Lines Matching defs:check
4206 // check the panic includes the prefix of the sliced string
4212 // check the truncation in the panic message
6309 // On 16/32-bit, we check that allocations don't exceed isize::MAX,
7988 // On 16/32-bit, we check that allocations don't exceed isize::MAX,
8912 // check that Cow<'a, str> implements addition
9625 // check the 1-byte-types path
9630 // check the 2-byte-types path
12180 // and the one getting appended are generated to check `append`.
12367 // On 16/32-bit, we check that allocations don't exceed isize::MAX,
14589 // Sanity-check one half of the safety requirement (we cannot check the other half).
14950 // On 64-bit we just need to check for overflow since trying to allocate
16604 /// to incur the overhead of the validity check, there is an unsafe version
16606 /// but skips the check.
16897 /// This function is unsafe because it does not check that the bytes passed
17585 /// This function is unsafe because it does not check that the bytes passed
18985 /// // The data was mutated. Let check it out.
19407 // that the feature-gate isn't enabled. Ideally, it wouldn't check for the feature gate for docs
19514 //! will check *at compile time* that you are not sending [`Rc`]s between
20513 /// without any check.
20995 /// store large values, that are slow to clone, but also heavy to check for equality, causing this
24143 // check if the weak counter is currently "locked"; if so, spin.
24711 /// without any check.
25296 // It's not necessary to check for the locked state here, because the
25329 /// store large values, that are slow to clone, but also heavy to check for equality, causing this
27160 /// Warning: this will not check that the provided node belongs to the current list.
27186 /// Warning: this will not check that the provided node belongs to the two existing lists.
28807 // check that len matches interior links.
29877 /// // check for a specific one.
32023 /// the compiler to follow. A `DormantMutRef` allows you to check borrowing
34343 fn check<F>(a: &[i32], b: &[i32], expected: &[i32], f: F)
34371 check(a, b, expected, |x, y, f| x.intersection(y).all(f))
34419 check(a, b, expected, |x, y, f| x.difference(y).all(f))
34519 check(a, b, expected, |x, y, f| x.symmetric_difference(y).all(f))
34543 check(a, b, expected, |x, y, f| x.union(y).all(f))
35619 // Lastly, check the invariant causing the least harm.
35633 fn check(&self)
35702 map.check();
35711 map.check();
35723 map.check();
35742 map.check();
35804 map.check();
35827 map.check();
35847 map.check();
35859 map.check();
35873 map.check();
35890 map.check();
35971 map.check();
36014 a.check();
36029 a.check();
36046 map.check();
36061 map.check();
36125 a.check();
36270 fn check<'a, L, R>(lhs: L, rhs: R)
36280 check(map.range(..=100), map.range(..101));
36281 check(map.range(5..=8), vec![(&5, &5), (&6, &6), (&7, &7), (&8, &8)]);
36282 check(map.range(-1..=2), vec![(&1, &1), (&2, &2)]);
36465 map.check();
36487 map.check();
36496 map.check();
36506 map.check();
36523 map.check();
36539 map.check();
36548 map.check();
36558 map.check();
36569 map.check();
36579 map.check();
36588 map.check();
36598 map.check();
36609 map.check();
36619 map.check();
36627 map.check();
36636 map.check();
36646 map.check();
36657 map.check();
36668 map.check();
36679 map.check();
36689 map.check();
36734 map.check();
36766 map.check();
36870 map.check();
36881 map.check();
36892 map.check();
36909 a.check();
36933 m.check();
36969 m.check();
36981 map.check();
37018 map.check();
37025 map.check();
37032 map.check();
37040 map.check();
37051 map.check();
37101 map2.check();
37104 map1.check();
37369 a.check();
37388 a.check();
37413 a.check();
37422 map.check();
37438 map.check();
37469 a.check();
37472 a.check();
37527 map1.check();
37528 map2.check(); // keys are not unique but still strictly ascending
37534 map1.check();
37535 map2.check();
37549 map.check();
37550 right.check();
37563 map.check();
37564 right.check();
37578 left.check();
37579 right.check();
37595 left.check();
37596 right.check();
37615 map.check();
37616 right.check();
37632 map.check();
37633 right.check();
37715 map.check();
38014 /// node, allowing code to act on leaf and internal nodes generically without having to even check
44457 /// // We can check the length of a heap.
46721 // check if SourceIter contract was upheld
46724 // check InPlaceIterable contract. This is only possible if the iterator advanced the
46752 // all we can do is check if it's still in range
47021 /// Use [`get`] and [`get_mut`] if you want to check whether the index is in
48085 // bounds check above succeeds there must be a last element (which
48223 // |<- processed len ->| ^- next to check
48342 /* Offset of the element we want to check if it is duplicate */
51876 // cannot check what happens when allocator is exhausted