|
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 | Bufferbtso_curbuf; |
68 | 68 | Bufferbtso_mrkbuf; |
69 | 69 | uint16qual_ok;/* 0 for quals like key == 1 && key > 2 */ |
70 | | -uint16numberOfKeys;/* number ofkey attributes */ |
71 | | -uint16numberOfFirstKeys;/* number offirst key attributes */ |
| 70 | +uint16numberOfKeys;/* number ofkeys */ |
| 71 | +uint16numberOfFirstKeys;/* number ofkeys for 1st attribute */ |
72 | 72 | ScanKeykeyData;/* key descriptor */ |
73 | 73 | }BTScanOpaqueData; |
74 | 74 |
|
@@ -185,7 +185,6 @@ typedef struct BTPageState { |
185 | 185 |
|
186 | 186 | #defineBTORDER_PROC1 |
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 | externvoid_bt_orderkeys(Relationrelation,BTScanOpaqueso); |
275 | 274 | externbool_bt_checkqual(IndexScanDescscan,IndexTupleitup); |
276 | 275 | externbool_bt_checkforkeys(IndexScanDescscan,IndexTupleitup,Sizekeysz); |
| 276 | +externbool_bt_checkkeys (IndexScanDescscan,IndexTupletuple,Size*keysok); |
277 | 277 | externBTItem_bt_formitem(IndexTupleitup); |
278 | 278 |
|
279 | 279 | /* |
|