Lines Matching refs:key
51 * Search a btree for a key.
55 * key: key to find
60 * of the key, if it were inserted into the tree, is entered into
64 __bt_search(BTREE *t, const DBT *key, int *exactp)
80 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) == 0) {
105 __bt_sprev(t, h, key, exactp))
109 __bt_snext(t, h, key, exactp))
119 * key and may be zero or a last + 1 index. If it's non-zero,
121 * be a parent page for the key. If a split later occurs, the
134 * Check for an exact match after the key.
139 * key: key
146 __bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp)
151 * Get the next page. The key is either an exact
157 if (__bt_cmp(t, key, &e) == 0) {
169 * Check for an exact match before the key.
174 * key: key
181 __bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp)
186 * Get the previous page. The key is either an exact
192 if (__bt_cmp(t, key, &e) == 0) {