Lines Matching defs:search
12869 // Contiguous (front only) search:
12875 // Split search (both front & back non-empty):
12908 // Contiguous (front only) search:
12913 // Split search (both front & back non-empty):
29591 /// pair of bounds for continuing the search in the child nodes, in case
29661 /// Also returns the lower bound to be used for continuing the search in
29739 /// Also returns the lower bound to be used for continuing the search in
29806 use super::search::SearchResult::*;
29827 /// the amount of work performed in a search. In theory, a binary search tree (BST) is the optimal
29839 /// The precise number of comparisons depends on the node search strategy used. For optimal cache
29840 /// efficiency, one could search the nodes linearly. For optimal comparisons, one could search
29841 /// the node using binary search. As a compromise, one could also perform a linear search
29844 /// Currently, our implementation simply performs naive linear search. This provides excellent
29846 /// would like to further explore choosing the optimal search strategy based on the choice of B,
29847 /// and possibly other factors. Using linear search, searching for a random element is expected
32096 use super::search::SearchResult::*;
34272 mod search;
42923 /// as this method performs a kind of binary search.