Lines Matching defs:key
154 * If a node with a matching key exists, the first matching node found will
159 * \param key The key to search for
164 rb_tree_search(struct rb_tree *T, const void *key,
172 int c = cmp(x, key);
187 * matching key exists, that first matching node found will be returned.
188 * If no node with an exactly matching key exists, the node returned will
189 * be either the right-most node comparing less than \p key or the
190 * right-most node comparing greater than \p key. If the tree is empty,
195 * \param key The key to search for
200 rb_tree_search_sloppy(struct rb_tree *T, const void *key,
210 int c = cmp(x, key);