|
6 | 6 | *
|
7 | 7 | * Copyright (c) 1994, Regents of the University of California
|
8 | 8 | *
|
9 |
| - * $Id: nbtree.h,v 1.10 1997/03/18 18:41:16 scrappy Exp $ |
| 9 | + * $Id: nbtree.h,v 1.11 1997/03/24 08:04:51 vadim Exp $ |
10 | 10 | *
|
11 | 11 | *-------------------------------------------------------------------------
|
12 | 12 | */
|
@@ -67,8 +67,8 @@ typedef struct BTScanOpaqueData {
|
67 | 67 | Buffer btso_curbuf;
|
68 | 68 | Buffer btso_mrkbuf;
|
69 | 69 | uint16 qual_ok; /* 0 for quals like key == 1 && key > 2 */
|
70 |
| - uint16 numberOfKeys; /* number of key attributes */ |
71 |
| - uint16 numberOfFirstKeys; /* number of first key attributes */ |
| 70 | + uint16 numberOfKeys; /* number of keys */ |
| 71 | + uint16 numberOfFirstKeys; /* number of keys for 1st attribute */ |
72 | 72 | ScanKey keyData; /* key descriptor */
|
73 | 73 | } BTScanOpaqueData;
|
74 | 74 |
|
@@ -185,7 +185,6 @@ typedef struct BTPageState {
|
185 | 185 |
|
186 | 186 | #define BTORDER_PROC 1
|
187 | 187 |
|
188 |
| - |
189 | 188 | /*
|
190 | 189 | * prototypes for functions in nbtinsert.c
|
191 | 190 | */
|
@@ -274,6 +273,7 @@ extern void _bt_freestack(BTStack stack);
|
274 | 273 | extern void _bt_orderkeys(Relation relation, BTScanOpaque so);
|
275 | 274 | extern bool _bt_checkqual(IndexScanDesc scan, IndexTuple itup);
|
276 | 275 | extern bool _bt_checkforkeys(IndexScanDesc scan, IndexTuple itup, Size keysz);
|
| 276 | +extern bool _bt_checkkeys (IndexScanDesc scan, IndexTuple tuple, Size *keysok); |
277 | 277 | extern BTItem _bt_formitem(IndexTuple itup);
|
278 | 278 |
|
279 | 279 | /*
|
|
0 commit comments