Lines Matching refs:equal
6800 // equal
9740 // of the tuple), so elements with equal first items
11793 // test that two deques hash equal even if elements are laid out differently
11812 // test that two deques are equal even if elements are laid out differently
14184 "`new_layout.size()` must be greater than or equal to `old_layout.size()`"
14190 // SAFETY: `new_size` is non-zero as `old_size` is greater than or equal to `new_size`
14206 // SAFETY: because `new_layout.size()` must be greater than or equal to `old_size`,
14274 "`new_layout.size()` must be smaller than or equal to `old_layout.size()`"
14294 // SAFETY: because `new_size` must be smaller than or equal to `old_layout.size()`,
14583 /// * `len` must be greater than or equal to the most recently requested capacity, and
14584 /// * `len` must be less than or equal to `self.capacity()`.
14592 "`len` must be smaller than or equal to `self.capacity()`"
16353 /// the length will always be less than or equal to the capacity.
16846 /// * `length` needs to be less than or equal to `capacity`.
17115 /// greater than or equal to `self.len() + additional`. Does nothing if
17149 /// capacity will be greater than or equal to `self.len() + additional`.
17345 /// Panics if `idx` is larger than or equal to the `String`'s length,
21017 /// Two `Rc`s are equal if their inner values are equal, even if they are
21022 /// always equal.
21103 /// 'Less than or equal to' comparison for two `Rc`s.
21139 /// 'Greater than or equal to' comparison for two `Rc`s.
21715 /// Since this compares pointers it means that `Weak::new()` will equal each
22200 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case.
22235 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*n* \* log(*n*)) worst-case.
22289 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*m* \* *n* \* log(*n*))
22332 /// This sort is stable (i.e., does not reorder equal elements) and *O*(*m* \* *n* + *n* \* log(*n*))
22921 // If equal, prefer the left run to maintain stability.
22945 // If equal, prefer the right run to maintain stability.
25167 /// Since this compares pointers it means that `Weak::new()` will equal each
25351 /// Two `Arc`s are equal if their inner values are equal, even if they are
25355 /// two `Arc`s that point to the same allocation are always equal.
25430 /// 'Less than or equal to' comparison for two `Arc`s.
25464 /// 'Greater than or equal to' comparison for two `Arc`s.
27574 /// Returns `true` if the `LinkedList` contains an element equal to the
28897 // Two equal length lists
29282 /// If two keys are equal, returns the key-value pair from the right source.
29623 panic!("range start and end are equal and excluded in BTreeMap")
32655 /// Returns a reference to the value in the set, if any, that is equal to the given value.
32938 /// Adds a value to the set, replacing the existing value, if any, that is equal to the given
32989 /// Removes and returns the value in the set, if any, that is equal to the given one.
37872 /// is equal and occurs in both sources. If one of the returned options
40298 /// PairSlices pairs up equal length slice parts of two deques
40896 /// `i` and `j` may be equal.
41005 /// capacity will be greater than or equal to `self.len() + additional`.
41047 /// greater than or equal to `self.len() + additional`. Does nothing if
41608 /// Returns `true` if the `VecDeque` contains an element equal to the
41899 /// greater than or equal to `index` towards the back.
42458 /// Modifies the `VecDeque` in-place so that `len()` is equal to `new_len`,
42960 /// Modifies the `VecDeque` in-place so that `len()` is equal to new_len,
45416 /// Unsafe because index must be within the data slice and not equal to pos.
45426 /// Unsafe because index must be within the data slice and not equal to pos.
47264 /// needs to be equal to satisfy the [`dealloc`] requirement that memory must be
47266 /// * `length` needs to be less than or equal to `capacity`.
47402 /// needs to be equal to satisfy the [`dealloc`] requirement that memory must be
47404 /// * `length` needs to be less than or equal to `capacity`.
47571 /// greater than or equal to `self.len() + additional`. Does nothing if
47593 /// capacity will be greater than or equal to `self.len() + additional`.
47620 /// greater than or equal to `self.len() + additional`. Does nothing if
47657 /// `try_reserve_exact`, capacity will be greater than or equal to
47715 // they are equal, so we can avoid the panic case in `RawVec::shrink_to_fit`
47977 /// - `new_len` must be less than or equal to [`capacity()`].
48316 /// must determine if the elements compare equal. The elements are passed in opposite order
48405 /* Because `read_ptr` can be equal to `write_ptr`, we either
48676 /// Resizes the `Vec` in-place so that `len` is equal to `new_len`.
48873 /// Resizes the `Vec` in-place so that `len` is equal to `new_len`.
49109 // - `count` is equal to the len of `source`, so source is valid for
49335 /// * or `replace_with` yields fewer or equal elements than `range`’s length