unique index implementation).
*
* Copyright (c) 1994, Regents of the University of California
*
- * $Id: genam.h,v 1.5 1996/11/13 20:50:28 scrappy Exp $
+ * $Id: genam.h,v 1.6 1997/01/10 09:36:29 vadim Exp $
*
*-------------------------------------------------------------------------
*/
extern InsertIndexResult index_insert(Relation relation,
Datum *datum, char *nulls,
ItemPointer heap_t_ctid,
- bool is_update);
+ Relation heapRel);
extern void index_delete(Relation relation, ItemPointer indexItem);
extern IndexScanDesc index_beginscan(Relation relation, bool scanFromEnd,
uint16 numberOfKeys, ScanKey key);
FuncIndexInfo *finfo,
PredInfo *predInfo);
extern InsertIndexResult gistinsert(Relation r, Datum *datum,
- char *nulls,ItemPointer ht_ctid, bool is_update);
+ char *nulls,ItemPointer ht_ctid, Relation heapRel);
extern void _gistdump(Relation r);
extern char *text_range_out(TXTRANGE *r);
extern char *int_range_out(INTRANGE *r);
*
* Copyright (c) 1994, Regents of the University of California
*
- * $Id: hash.h,v 1.5 1996/11/13 20:50:31 scrappy Exp $
+ * $Id: hash.h,v 1.6 1997/01/10 09:36:32 vadim Exp $
*
* NOTES
* modeled after Margo Seltzer's hash implementation for unix.
AttrNumber *attnum, IndexStrategy istrat, uint16 pcount,
Datum *params, FuncIndexInfo *finfo, PredInfo *predInfo);
extern InsertIndexResult hashinsert(Relation rel, Datum *datum, char *nulls,
- ItemPointer ht_ctid, bool is_update);
+ ItemPointer ht_ctid, Relation heapRel);
extern char *hashgettuple(IndexScanDesc scan, ScanDirection dir);
extern char *hashbeginscan(Relation rel, bool fromEnd, uint16 keysz,
ScanKey scankey);
*
* Copyright (c) 1994, Regents of the University of California
*
- * $Id: nbtree.h,v 1.4 1996/11/13 20:50:32 scrappy Exp $
+ * $Id: nbtree.h,v 1.5 1997/01/10 09:36:33 vadim Exp $
*
*-------------------------------------------------------------------------
*/
* prototypes for functions in nbtinsert.c
*/
extern InsertIndexResult _bt_doinsert(Relation rel, BTItem btitem,
- bool index_is_unique, bool is_update);
+ bool index_is_unique, Relation heapRel);
/* default is to allow duplicates */
extern bool _bt_itemcmp(Relation rel, Size keysz, BTItem item1, BTItem item2,
AttrNumber *attnum, IndexStrategy istrat, uint16 pcount,
Datum *params, FuncIndexInfo *finfo, PredInfo *predInfo);
extern InsertIndexResult btinsert(Relation rel, Datum *datum, char *nulls,
- ItemPointer ht_ctid, bool is_update);
+ ItemPointer ht_ctid, Relation heapRel);
extern char *btgettuple(IndexScanDesc scan, ScanDirection dir);
extern char *btbeginscan(Relation rel, bool fromEnd, uint16 keysz,
ScanKey scankey);
*
* Copyright (c) 1994, Regents of the University of California
*
- * $Id: rtree.h,v 1.4 1996/11/13 20:50:34 scrappy Exp $
+ * $Id: rtree.h,v 1.5 1997/01/10 09:36:34 vadim Exp $
*
*-------------------------------------------------------------------------
*/
* Defined in access/index-rtree/
*/
extern InsertIndexResult rtinsert(Relation r, Datum *datum, char *nulls,
- ItemPointer ht_ctid, bool is_update);
+ ItemPointer ht_ctid, Relation heapRel);
extern char *rtdelete(Relation r, ItemPointer tid);
extern RetrieveIndexResult rtgettuple(IndexScanDesc s, ScanDirection dir);