Lines Matching refs:key
53 * Search a btree for a key.
57 * key: key to find
62 * of the key, if it were inserted into the tree, is entered into
66 __bt_search(t, key, exactp)
68 const DBT *key;
85 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) == 0) {
110 __bt_sprev(t, h, key, exactp))
114 __bt_snext(t, h, key, exactp))
124 * key and may be zero or a last + 1 index. If it's non-zero,
126 * be a parent page for the key. If a split later occurs, the
139 * Check for an exact match after the key.
144 * key: key
151 __bt_snext(t, h, key, exactp)
154 const DBT *key;
165 * Get the next page. The key is either an exact
171 if (__bt_cmp(t, key, &e) != 0) {
219 * Check for an exact match before the key.
224 * key: key
231 __bt_sprev(t, h, key, exactp)
234 const DBT *key;
245 * Get the previous page. The key is either an exact
251 if (__bt_cmp(t, key, &e) != 0) {