Lines Matching refs:pair
23089 // Examines the stack of runs and identifies the next pair of runs to merge. More specifically,
23368 /// In the end, this means that you may need to pair `Arc<T>` with some sort of
29196 /// If both iterators produce the same key, this method drops the pair from
29197 /// the left iterator and appends the pair from the right iterator.
29225 // Try to push key-value pair into the current leaf node.
29253 // Push key-value pair and new right subtree.
29282 /// If two keys are equal, returns the key-value pair from the right source.
29589 /// If found, returns an `Ok` with that node, the strictly ascending pair of
29591 /// pair of bounds for continuing the search in the child nodes, in case
30338 /// Returns the key-value pair corresponding to the supplied key.
30366 /// Returns the first key-value pair in the map.
30367 /// The key in this pair is the minimum key in the map.
30450 /// Returns the last key-value pair in the map.
30451 /// The key in this pair is the maximum key in the map.
30592 /// Inserts a key-value pair into the map.
30632 /// Tries to insert a key-value pair into the map, and returns
31256 while let Some(pair) = next_or_end(self) {
31258 drop(pair);
33787 /// the range, returns a pair of empty options.
33853 /// Finds the pair of leaf edges delimiting a specific range in a tree.
33867 /// Finds the pair of leaf edges delimiting an entire tree.
33874 /// Splits a unique reference into a pair of leaf edges delimiting a specified range.
33892 /// Splits a unique reference into a pair of leaf edges delimiting the full range of the tree.
33904 /// Splits a unique reference into a pair of leaf edges delimiting the full range of the tree.
33988 /// on the right side, and the key-value pair in between, which is either
33992 /// implies that if no more key-value pair exists, the entire remainder of
34016 /// on the left side, and the key-value pair in between, which is either
34020 /// implies that if no more key-value pair exists, the entire remainder of
35544 // Body of `remove_entry`, probably separate because the name reflects the returned pair.
35829 // 1 key-value pair:
35861 // 1 key-value pair:
36397 for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) {
36398 assert_eq!(kv, pair);
36437 for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) {
36438 assert_eq!(kv, pair);
36458 for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) {
36459 assert_eq!(kv, pair);
37737 /// Removes a key-value pair from the tree, and returns that pair, as well as
37738 /// the leaf edge corresponding to that former pair. It's possible this empties
37865 /// Creates a new core for an iterator merging a pair of sources.
37870 /// Returns the next pair of items stemming from the pair of sources
37876 /// return the same empty pair.
37910 /// Returns a pair of upper bounds for the `size_hint` of the final iterator.
38534 /// Adds a key-value pair to the end of the node.
38548 /// Adds a key-value pair, and an edge to go to the right of that pair,
38618 /// A reference to a specific key-value pair or edge within a node. The `Node` parameter
38620 /// pair) or `Edge` (signifying a handle on an edge).
38642 /// Retrieves the node that contains the edge or key-value pair this handle points to.
38654 /// Creates a new handle to a key-value pair in `node`.
38752 /// Inserts a new key-value pair between the key-value pairs to the right and left of
38754 /// pair to fit.
38772 /// Inserts a new key-value pair between the key-value pairs to the right and left of
38812 /// Inserts a new key-value pair and an edge that will go to the right of that new pair
38813 /// between this edge and the key-value pair to the right of this edge. This method assumes
38814 /// that there is enough space in the node for the new pair to fit.
38830 /// Inserts a new key-value pair and an edge that will go to the right of that new pair
38831 /// between this edge and the key-value pair to the right of this edge. This method splits
38864 /// Inserts a new key-value pair between the key-value pairs to the right and left of
39015 /// Removes the key-value pair pointed to by this handle and returns it, along with the edge
39016 /// that the key-value pair collapsed into.
39058 /// around an internal key-value pair.
39201 /// Merges the parent's key-value pair and both adjacent child nodes into
39209 /// Merges the parent's key-value pair and both adjacent child nodes into
39217 /// Merges the parent's key-value pair and both adjacent child nodes into
39240 /// Removes a key-value pair from the left child and places it in the key-value storage
39241 /// of the parent, while pushing the old parent key-value pair into the right child.
39252 /// Removes a key-value pair from the right child and places it in the key-value storage
39253 /// of the parent, while pushing the old parent key-value pair onto the left child.
39298 // Move the left-most stolen pair to the parent.
39303 // Move parent's key-value pair to the right child.
39347 // Move the right-most stolen pair to the parent.
39352 // Move parent's key-value pair to the left child.
41313 /// Returns a pair of slices which contain, in order, the contents of the
41348 /// Returns a pair of slices which contain, in order, the contents of the