Lines Matching defs:pairs

5734     let pairs = [
5771     for p in &pairs {
22993 /// onto the stack, and then some pairs of adjacent runs are merged until these two invariants are
23069         // Merge some pairs of adjacent runs to satisfy the invariants.
29192     /// Appends all key-value pairs from the union of two ascending iterators,
29215     /// Pushes all key-value pairs to the end of the tree, incrementing a
29223         // Iterate through all key-value pairs, pushing them into nodes at the right level.
30730     /// In other words, remove all pairs `(k, v)` such that `f(&k, &mut v)` returns `false`.
30972     /// Creates an iterator that visits all elements (key-value pairs) in
32101     /// a given number of distinct key-value pairs.
32120     /// Split off a tree with key-value pairs at and after the given key.
35849     // 2 key-value pairs:
35939 // Specifically tests iter_mut's ability to mutate the value of pairs in-line.
35948     // Forward and backward iteration sees enough pairs (also tested elsewhere)
36395         let mut pairs = (0..size).map(|i| (i, i));
36397         for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) {
36401         assert_eq!(pairs.next(), None);
36435             let mut pairs = (i..=j).map(|i| (i, i));
36437             for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) {
36441             assert_eq!(pairs.next(), None);
36456             let mut pairs = (i..=j).map(|i| (i, i));
36458             for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) {
36462             assert_eq!(pairs.next(), None);
36493         let pairs = (0..3).map(|i| (i, i));
36494         let mut map: BTreeMap<_, _> = pairs.collect();
36502         let pairs = (0..3).map(|i| (i, i));
36503         let mut map: BTreeMap<_, _> = pairs.clone().collect();
36504         assert!(map.drain_filter(|_, _| true).eq(pairs));
36512         let pairs = (0..3).map(|i| (i, i));
36513         let mut map: BTreeMap<_, _> = pairs.collect();
36529         let pairs = (0..3).map(|i| (i, i));
36530         let mut map: BTreeMap<_, _> = pairs.collect();
36544         let pairs = (0..3).map(|i| (i, i));
36545         let mut map: BTreeMap<_, _> = pairs.collect();
36553         let pairs = (0..3).map(|i| (i, i));
36555             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36564         let pairs = (0..3).map(|i| (i, i));
36566             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36575         let pairs = (0..3).map(|i| (i, i));
36576         let mut map: BTreeMap<_, _> = pairs.collect();
36584         let pairs = (0..NODE_CAPACITY).map(|i| (i, i));
36585         let mut map: BTreeMap<_, _> = pairs.collect();
36593         let pairs = (0..NODE_CAPACITY).map(|i| (i, i));
36595             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36604         let pairs = (0..NODE_CAPACITY).map(|i| (i, i));
36606             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36615         let pairs = (0..NODE_CAPACITY).map(|i| (i, i));
36616         let mut map: BTreeMap<_, _> = pairs.collect();
36632         let pairs = (0..MIN_INSERTS_HEIGHT_1).map(|i| (i, i));
36633         let mut map: BTreeMap<_, _> = pairs.collect();
36641         let pairs = (0..MIN_INSERTS_HEIGHT_1).map(|i| (i, i));
36643             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36652         let pairs = (0..MIN_INSERTS_HEIGHT_1).map(|i| (i, i));
36654             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36663         let pairs = (0..MIN_INSERTS_HEIGHT_2).map(|i| (i, i));
36665             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36674         let pairs = (0..MIN_INSERTS_HEIGHT_2).map(|i| (i, i));
36676             let mut map: BTreeMap<_, _> = pairs.clone().collect();
36685         let pairs = (0..MIN_INSERTS_HEIGHT_2).map(|i| (i, i));
36686         let mut map: BTreeMap<_, _> = pairs.collect();
37575     let pairs = (0..MIN_INSERTS_HEIGHT_2).map(|i| (i, i));
37576     let mut left: BTreeMap<_, _> = pairs.clone().collect();
37590     let pairs = (0..MIN_INSERTS_HEIGHT_2).map(|i| (i, i));
37592     let mut left: BTreeMap<_, _> = pairs.clone().collect();
38624 /// pairs. For example, in a node with length 2, there would be 3 possible edge locations - one
38625 /// to the left of the node, one between the two pairs, and one at the right of the node.
38752     /// Inserts a new key-value pair between the key-value pairs to the right and left of
38772     /// Inserts a new key-value pair between the key-value pairs to the right and left of
38864     /// Inserts a new key-value pair between the key-value pairs to the right and left of
39001     /// - The node is truncated to only contain the key-value pairs to the left of
39004     /// - All the key-value pairs to the right of this handle are put into a newly
39033     /// - The node is truncated to only contain the edges and key-value pairs to the
39036     /// - All the edges and key-value pairs to the right of this handle are put into
40298 /// PairSlices pairs up equal length slice parts of two deques
42884     /// Looks up a series of four elements in a slice of pairs sorted by