Lines Matching defs:out
2041 // out.
3869 #[should_panic(expected = "out of bounds")]
4038 message: "out of bounds";
4045 message: "out of bounds";
4052 message: "out of bounds";
4059 message: "out of bounds";
4066 message: "out of bounds";
4073 message: "out of bounds";
4088 // 0..=6 is out of bounds before exhaustion, so it
4095 message: "out of bounds";
4208 #[should_panic(expected = "byte index 1024 is out of bounds of `Lorem ipsum dolor sit amet")]
6575 // Here tv goes out of scope, tv.y should be dropped, but not tv.x.
10923 // Work out the total number of comparisons required to sort
11046 ($inp:expr, $typ:ty, $out:expr $(,)?) => {
11047 assert_eq!($out, identity::<$typ>($inp))
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
12160 let mut out = VecDeque::new();
12162 out.push_back(a);
12165 out.push_front(push_back + b);
12168 out.pop_back();
12171 out.pop_front();
12173 out
13176 // make sure that format! doesn't move out of local variables
13730 // don't use 0 in the data -- we want to catch the zeroed-out case.
15128 // we would have run out of memory anyway and the rest of the function requires
16198 //! If you have a vector of valid UTF-8 bytes, you can make a [`String`] out of
16376 /// // We can re-build a String out of ptr, len, and capacity. This is all
17718 /// boundary, or if they're out of bounds.
17752 // Take out two simultaneous borrows. The &mut String won't be accessed
17768 /// boundary, or if they're out of bounds.
17859 /// consume the error, moving out the bytes, so that a copy of the bytes
18095 reason = "API not fully fleshed out and ready to be stabilized",
18985 /// // The data was mutated. Let check it out.
19623 //! // Despite dropping `gadget_owner`, we're still able to print out the name
19648 //! memory safety by only giving out shared references to the value it wraps,
19705 //! // Iterate over our `Gadget`s, printing their details out.
20340 /// // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!
22917 let out = &mut hole.dest;
22928 ptr::copy_nonoverlapping(to_copy, get_and_increment(out), 1);
22941 let mut out = v_end;
22952 ptr::copy_nonoverlapping(to_copy, decrement_and_get(&mut out), 1);
24111 /// // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!
24299 // `Sync` as well, so we're ok loaning out an immutable pointer to these
25292 // If we find out that we were the last weak pointer, then its time to
27030 // have been handed out by the iterator! So be careful when using this; the methods
28938 // There was a bug in split_off that failed to null out the RHS's head's prev ptr.
32388 // It's used to divide rather than multiply sizes, to rule out overflow,
33230 /// Gets an iterator for moving out the `BTreeSet`'s contents.
33769 /// Temporarily takes out another, immutable equivalent of the same range.
35522 /// Takes the value of the entry out of the map, and returns it.
38210 /// Temporarily takes out another, immutable reference to the same node.
38332 /// Temporarily takes out another, mutable reference to the same node. Beware, as
38337 /// pointer can easily be used to make the original pointer dangling, out of
38683 /// Temporarily takes out another, immutable handle on the same location.
38691 /// Temporarily takes out another, mutable handle on the same location. Beware, as
40537 /// Moves an element out of the buffer
40902 /// Panics if either index is out of bounds.
41147 // All elements are out of desired bounds
41148 // Elements are contiguous, and head is out of desired bounds
41149 // Elements are discontiguous, and tail is out of desired bounds
41155 // Move elements from out of desired bounds (positions after target_cap)
41547 // Drain will ptr::read out the values to remove.
41833 /// Returns `None` if `index` is out of bounds.
41868 /// Returns `None` if `index` is out of bounds.
41923 assert!(index <= self.len(), "index out of bounds");
42125 /// Returns `None` if `index` is out of bounds.
42328 assert!(at <= len, "`at` out of bounds");
43791 // head or tail out of bounds
43822 // head or tail out of bounds
44150 // SAFETY: these are the elements we have not handed out yet, so aliasing is fine.
44186 // SAFETY: these are the elements we have not handed out yet, so aliasing is fine.
44242 // SAFETY: these are the elements we have not handed out yet, so aliasing is fine.
44790 // order to move an element out of the vector (leaving behind a
44802 // Take out the value at `pos` and create a hole.
44965 // self.len() == 0, but it's ruled out by the loop condition.
45757 /// Creates a consuming iterator, that is, one that moves each value out of
45857 /// An iterator that moves out of a vector.
46735 // but prevent drop of the allocation itself once IntoIter goes out of scope
47299 /// // Pull out the various important pieces of information about `v`
47444 /// // Pull out the various important pieces of information about `v`
48057 /// Panics if `index` is out of bounds.
48149 /// Panics if `index` is out of bounds.
48176 // copy it out, unsafely having a copy of the value on
48232 // In cases when predicate and `drop` never panick, it will be optimized out.
48546 // Drain will ptr::read out the values to remove.
49221 /// Creates a consuming iterator, that is, one that moves each value out of
49424 /// Extend implementation that copies elements out of references before pushing them onto the Vec.
49706 // Set the length of the vec when the `SetLenOnDrop` value goes out of scope.
50051 /// that have been moved out.
50175 //! drop their contents when they go out of scope. Boxes also ensure that they