Lines Matching refs:given

13880 /// - Create a [`Vec`] containing a given list of elements:
13889 /// - Create a [`Vec`] from a given element and size:
13953 /// formatting string in the order given unless named or positional parameters
14522 /// The `ptr` must be allocated (on the system heap), and with the given `capacity`.
14637 /// The `ptr` must be allocated (via the given allocator `alloc`), and with the given
14793 /// Shrinks the allocation down to the specified amount. If the given amount
14798 /// Panics if the given amount is *larger* than the current capacity.
16551 /// If the given capacity is `0`, no allocation will occur, and this method
16979 /// Appends a given string slice onto the end of this `String`.
17113 /// in the given `String`. The collection may reserve more space to avoid
17148 /// be inserted in the given `String`. After calling `reserve_exact`,
17233 /// Appends the given [`char`] to the end of this `String`.
17653 /// Splits the string into two at the given byte index.
17762 /// and replaces it with the given string.
17763 /// The given string doesn't need to be the same length as the range.
18415 /// Converts the given value to a `String`.
18541 /// Converts the given boxed `str` slice to a `String`.
18562 /// Converts the given `String` to a boxed `str` slice that is owned.
18667 /// Converts the given `String` to a vector `Vec` that holds values of type `u8`.
18848 /// from any borrow of a given type.
19502 //! given allocation is destroyed, the value stored in that allocation (often
19580 //! Consider a scenario where a set of `Gadget`s are owned by a given `Owner`.
20482 /// Returns a mutable reference into the given `Rc`, if there are
20512 /// Returns a mutable reference into the given `Rc`,
20572 /// Makes a mutable reference into the given `Rc`.
20698 // Calculate layout using the given value layout.
20721 // Calculate layout using the given value layout.
20744 // Allocate for the `RcBox<T>` using the given value.
20778 /// Allocates an `RcBox<[T]>` with the given length.
22567 /// given separator between each.
22585 /// given separator between each.
23337 /// pointer to a given allocation is destroyed, the value stored in that allocation (often
24350 // Calculate layout using the given value layout.
24372 // Calculate layout using the given value layout.
24394 // Allocate for the `ArcInner<T>` using the given value.
24428 /// Allocates an `ArcInner<[T]>` with the given length.
24582 /// Makes a mutable reference into the given `Arc`.
24671 /// Returns a mutable reference into the given `Arc`, if there are
24710 /// Returns a mutable reference into the given `Arc`,
25842 //! would be formatted in the same order as they're given. The format string
27076 /// Adds the given node to the front of the list.
27117 /// Adds the given node to the back of the list.
27575 /// given value.
27777 /// Splits the list into two at the given index. Returns everything after the given index,
27834 /// Removes the element at the given index and returns it.
27862 // Below, we iterate towards the node at the given index, either from
28390 /// Inserts the elements from the given `LinkedList` after the current one.
28413 /// Inserts the elements from the given `LinkedList` before the current one.
29359 /// Some anonymous query, the result of which is already given.
29560 /// Looks up a given key in a (sub)tree headed by the node, recursively.
29694 /// Looks up a given key in the node, without recursion.
30889 /// Gets the given key's corresponding entry in the map for in-place manipulation.
30923 /// Splits the collection into two at the given key. Returns everything after the given key,
31473 /// Implementation of a typical `DrainFilter::next` method, given the predicate.
32101 /// a given number of distinct key-value pairs.
32120 /// Split off a tree with key-value pairs at and after the given key.
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.
33073 /// Splits the collection into two at the given key. Returns everything after the given key,
33996 /// The given edge must not have been previously returned by counterpart
34024 /// The given edge must not have been previously returned by counterpart
37948 // given node has exactly the same length.
39083 /// Prefers the left side, to be optimal if the given node is somehow
40002 /// Extends `self` with the contents of the given iterator.
40300 /// For example, given deques "A" and "B" with the following division into slices:
40557 /// Returns the index in the underlying buffer for a given logical element
40564 /// Returns the index in the underlying buffer for a given logical element
40571 /// Returns the index in the underlying buffer for a given logical element
40840 /// Provides a reference to the element at the given index.
40865 /// Provides a mutable reference to the element at the given index.
40944 /// given `VecDeque`. Does nothing if the capacity is already sufficient.
40970 /// Reserves capacity for at least `additional` more elements to be inserted in the given
41004 /// be inserted in the given `VecDeque<T>`. After calling `try_reserve_exact`,
41045 /// in the given `VecDeque<T>`. The collection may reserve more space to avoid
41609 /// given value.
41929 // the given object
42300 /// Splits the `VecDeque` into two at the given index.
42755 /// Binary searches this sorted `VecDeque` for a given element.
42913 /// Returns the index of the partition point according to the given predicate
42916 /// The deque is assumed to be partitioned according to the given predicate.
42987 /// Returns the index in the underlying buffer for a given logical element index.
45155 /// given `BinaryHeap`. Does nothing if the capacity is already sufficient.
46971 /// It can also initialize each element of a `Vec<T>` with a given value.
47569 /// in the given `Vec<T>`. The collection may reserve more space to avoid
47592 /// be inserted in the given `Vec<T>`. After calling `reserve_exact`,
47618 /// in the given `Vec<T>`. The collection may reserve more space to avoid
47656 /// elements to be inserted in the given `Vec<T>`. After calling
48312 /// Removes all but the first of consecutive elements in the vector satisfying a given equality
48620 /// Splits the collection into two at the given index.
48686 /// you'd rather [`Clone`] a given value, use [`Vec::resize`]. If you
48955 // - `slice::range` guarantees that the given range is valid for indexing self
48999 /// Extend the vector by `n` values, using the given generator.
49322 /// with the given `replace_with` iterator and yields the removed items.
50227 //! raw pointer allocated with the [`Global`] allocator, given that the
50489 /// Allocates memory in the given allocator then places `x` into it.
50512 /// Allocates memory in the given allocator then places `x` into it,
50931 /// Constructs a box from a raw pointer in the given allocator.