SYMBOL INDEX (3866 symbols across 45 files) FILE: benchmarks/engines/libc/main.rs function main (line 5) | fn main() -> anyhow::Result<()> { function memchr_oneshot_count (line 33) | fn memchr_oneshot_count(b: &Benchmark) -> anyhow::Result> { function memmem_oneshot_count (line 39) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { function libc_memchr (line 47) | fn libc_memchr(haystack: &[u8], needle: u8) -> Option { function libc_memmem (line 65) | fn libc_memmem(haystack: &[u8], needle: &[u8]) -> Option { FILE: benchmarks/engines/rust-bytecount/main.rs function main (line 5) | fn main() -> anyhow::Result<()> { function memchr_oneshot_count (line 31) | fn memchr_oneshot_count(b: &Benchmark) -> anyhow::Result> { FILE: benchmarks/engines/rust-jetscii/main.rs function main (line 5) | fn main() -> anyhow::Result<()> { function memmem_prebuilt_count (line 32) | fn memmem_prebuilt_count(b: &Benchmark) -> anyhow::Result> { function memmem_oneshot_count (line 41) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { FILE: benchmarks/engines/rust-memchr/main.rs function main (line 7) | fn main() -> anyhow::Result<()> { function memchr_oneshot_count (line 66) | fn memchr_oneshot_count(b: &Benchmark) -> anyhow::Result> { function memchr_prebuilt_count (line 76) | fn memchr_prebuilt_count(b: &Benchmark) -> anyhow::Result> { function memchr_only_count (line 82) | fn memchr_only_count(b: &Benchmark) -> anyhow::Result> { function memchr_fallback_count (line 88) | fn memchr_fallback_count(b: &Benchmark) -> anyhow::Result> { function memchr_naive_count (line 95) | fn memchr_naive_count(b: &Benchmark) -> anyhow::Result> { function memchr2_count (line 105) | fn memchr2_count(b: &Benchmark) -> anyhow::Result> { function memchr2_fallback_count (line 111) | fn memchr2_fallback_count(b: &Benchmark) -> anyhow::Result> { function memchr2_naive_count (line 118) | fn memchr2_naive_count(b: &Benchmark) -> anyhow::Result> { function memchr3_count (line 128) | fn memchr3_count(b: &Benchmark) -> anyhow::Result> { function memchr3_fallback_count (line 136) | fn memchr3_fallback_count(b: &Benchmark) -> anyhow::Result> { function memchr3_naive_count (line 143) | fn memchr3_naive_count(b: &Benchmark) -> anyhow::Result> { function memrchr_count (line 153) | fn memrchr_count(b: &Benchmark) -> anyhow::Result> { function memrchr2_count (line 161) | fn memrchr2_count(b: &Benchmark) -> anyhow::Result> { function memrchr3_count (line 169) | fn memrchr3_count(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_count (line 177) | fn memmem_prebuilt_count(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_needles (line 184) | fn memmem_prebuilt_needles(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_haystack (line 203) | fn memmem_prebuilt_haystack(b: &Benchmark) -> anyhow::Result> { function memmem_oneshot_count (line 221) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { function memmem_binary_count (line 228) | fn memmem_binary_count(b: &Benchmark) -> anyhow::Result> { function memmem_twoway_count (line 236) | fn memmem_twoway_count(b: &Benchmark) -> anyhow::Result> { function memmem_rabinkarp_count (line 245) | fn memmem_rabinkarp_count(b: &Benchmark) -> anyhow::Result> { function memmem_shiftor_count (line 254) | fn memmem_shiftor_count(b: &Benchmark) -> anyhow::Result> { type Binary (line 266) | struct Binary; method rank (line 269) | fn rank(&self, byte: u8) -> u8 { type IteratorExt (line 290) | trait IteratorExt: Iterator { method count_slow (line 297) | fn count_slow(mut self) -> usize FILE: benchmarks/engines/rust-memchrold/main.rs function main (line 5) | fn main() -> anyhow::Result<()> { function memchr_oneshot_count (line 54) | fn memchr_oneshot_count(b: &Benchmark) -> anyhow::Result> { function memchr_prebuilt_count (line 64) | fn memchr_prebuilt_count(b: &Benchmark) -> anyhow::Result> { function memchr_naive_count (line 70) | fn memchr_naive_count(b: &Benchmark) -> anyhow::Result> { function memchr2_count (line 80) | fn memchr2_count(b: &Benchmark) -> anyhow::Result> { function memchr3_count (line 86) | fn memchr3_count(b: &Benchmark) -> anyhow::Result> { function memrchr_count (line 92) | fn memrchr_count(b: &Benchmark) -> anyhow::Result> { function memrchr2_count (line 98) | fn memrchr2_count(b: &Benchmark) -> anyhow::Result> { function memrchr3_count (line 104) | fn memrchr3_count(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_count (line 112) | fn memmem_prebuilt_count(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_needles (line 119) | fn memmem_prebuilt_needles(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_haystack (line 138) | fn memmem_prebuilt_haystack(b: &Benchmark) -> anyhow::Result> { function memmem_oneshot_count (line 156) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { FILE: benchmarks/engines/rust-sliceslice/main.rs function main (line 5) | fn main() -> anyhow::Result<()> { function memmem_prebuilt_count (line 46) | fn memmem_prebuilt_count(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_needles (line 83) | fn memmem_prebuilt_needles(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_haystack (line 144) | fn memmem_prebuilt_haystack(b: &Benchmark) -> anyhow::Result> { function memmem_oneshot_count (line 203) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { FILE: benchmarks/engines/rust-std/build.rs function main (line 5) | fn main() { function rustc_version (line 10) | fn rustc_version() -> Option { FILE: benchmarks/engines/rust-std/main.rs function main (line 5) | fn main() -> anyhow::Result<()> { function memmem_oneshot_count (line 32) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { function memmem_prebuilt_count (line 58) | fn memmem_prebuilt_count(b: &Benchmark) -> anyhow::Result> { FILE: benchmarks/engines/stringzilla/main.rs function main (line 7) | fn main() -> anyhow::Result<()> { function memmem_oneshot_count (line 33) | fn memmem_oneshot_count(b: &Benchmark) -> anyhow::Result> { FILE: benchmarks/haystacks/code/rust-library.rs function bench_collect_into (line 5) | fn bench_collect_into(b: &mut Bencher) { function bench_push_front (line 13) | fn bench_push_front(b: &mut Bencher) { function bench_push_back (line 21) | fn bench_push_back(b: &mut Bencher) { function bench_push_back_pop_back (line 29) | fn bench_push_back_pop_back(b: &mut Bencher) { function bench_push_front_pop_front (line 38) | fn bench_push_front_pop_front(b: &mut Bencher) { function bench_iter (line 47) | fn bench_iter(b: &mut Bencher) { function bench_iter_mut (line 55) | fn bench_iter_mut(b: &mut Bencher) { function bench_iter_rev (line 63) | fn bench_iter_rev(b: &mut Bencher) { function bench_iter_mut_rev (line 71) | fn bench_iter_mut_rev(b: &mut Bencher) { function char_iterator (line 81) | fn char_iterator(b: &mut Bencher) { function char_iterator_for (line 88) | fn char_iterator_for(b: &mut Bencher) { function char_iterator_ascii (line 99) | fn char_iterator_ascii(b: &mut Bencher) { function char_iterator_rev (line 111) | fn char_iterator_rev(b: &mut Bencher) { function char_iterator_rev_for (line 118) | fn char_iterator_rev_for(b: &mut Bencher) { function char_indicesator (line 129) | fn char_indicesator(b: &mut Bencher) { function char_indicesator_rev (line 137) | fn char_indicesator_rev(b: &mut Bencher) { function split_unicode_ascii (line 145) | fn split_unicode_ascii(b: &mut Bencher) { function split_ascii (line 152) | fn split_ascii(b: &mut Bencher) { function split_extern_fn (line 160) | fn split_extern_fn(b: &mut Bencher) { function split_closure (line 171) | fn split_closure(b: &mut Bencher) { function split_slice (line 179) | fn split_slice(b: &mut Bencher) { function bench_join (line 188) | fn bench_join(b: &mut Bencher) { function bench_contains_short_short (line 198) | fn bench_contains_short_short(b: &mut Bencher) { function bench_contains_short_long (line 208) | fn bench_contains_short_long(b: &mut Bencher) { function bench_contains_bad_naive (line 252) | fn bench_contains_bad_naive(b: &mut Bencher) { function bench_contains_equal (line 262) | fn bench_contains_equal(b: &mut Bencher) { function bench_with_capacity (line 381) | fn bench_with_capacity(b: &mut Bencher) { function bench_push_str (line 386) | fn bench_push_str(b: &mut Bencher) { constant REPETITIONS (line 394) | const REPETITIONS: u64 = 10_000; function bench_push_str_one_byte (line 397) | fn bench_push_str_one_byte(b: &mut Bencher) { function bench_push_char_one_byte (line 408) | fn bench_push_char_one_byte(b: &mut Bencher) { function bench_push_char_two_bytes (line 419) | fn bench_push_char_two_bytes(b: &mut Bencher) { function from_utf8_lossy_100_ascii (line 430) | fn from_utf8_lossy_100_ascii(b: &mut Bencher) { function from_utf8_lossy_100_multibyte (line 441) | fn from_utf8_lossy_100_multibyte(b: &mut Bencher) { function from_utf8_lossy_invalid (line 450) | fn from_utf8_lossy_invalid(b: &mut Bencher) { function from_utf8_lossy_100_invalid (line 458) | fn from_utf8_lossy_100_invalid(b: &mut Bencher) { function bench_exact_size_shrink_to_fit (line 466) | fn bench_exact_size_shrink_to_fit(b: &mut Bencher) { function bench_from_str (line 482) | fn bench_from_str(b: &mut Bencher) { function bench_from (line 489) | fn bench_from(b: &mut Bencher) { function bench_to_string (line 496) | fn bench_to_string(b: &mut Bencher) { function bench_insert_char_short (line 503) | fn bench_insert_char_short(b: &mut Bencher) { function bench_insert_char_long (line 513) | fn bench_insert_char_long(b: &mut Bencher) { function bench_insert_str_short (line 523) | fn bench_insert_str_short(b: &mut Bencher) { function bench_insert_str_long (line 533) | fn bench_insert_str_long(b: &mut Bencher) { function bench_new (line 546) | fn bench_new(b: &mut Bencher) { function do_bench_with_capacity (line 550) | fn do_bench_with_capacity(b: &mut Bencher, src_len: usize) { function bench_with_capacity_0000 (line 557) | fn bench_with_capacity_0000(b: &mut Bencher) { function bench_with_capacity_0010 (line 562) | fn bench_with_capacity_0010(b: &mut Bencher) { function bench_with_capacity_0100 (line 567) | fn bench_with_capacity_0100(b: &mut Bencher) { function bench_with_capacity_1000 (line 572) | fn bench_with_capacity_1000(b: &mut Bencher) { function do_bench_from_fn (line 576) | fn do_bench_from_fn(b: &mut Bencher, src_len: usize) { function bench_from_fn_0000 (line 583) | fn bench_from_fn_0000(b: &mut Bencher) { function bench_from_fn_0010 (line 588) | fn bench_from_fn_0010(b: &mut Bencher) { function bench_from_fn_0100 (line 593) | fn bench_from_fn_0100(b: &mut Bencher) { function bench_from_fn_1000 (line 598) | fn bench_from_fn_1000(b: &mut Bencher) { function do_bench_from_elem (line 602) | fn do_bench_from_elem(b: &mut Bencher, src_len: usize) { function bench_from_elem_0000 (line 609) | fn bench_from_elem_0000(b: &mut Bencher) { function bench_from_elem_0010 (line 614) | fn bench_from_elem_0010(b: &mut Bencher) { function bench_from_elem_0100 (line 619) | fn bench_from_elem_0100(b: &mut Bencher) { function bench_from_elem_1000 (line 624) | fn bench_from_elem_1000(b: &mut Bencher) { function do_bench_from_slice (line 628) | fn do_bench_from_slice(b: &mut Bencher, src_len: usize) { function bench_from_slice_0000 (line 637) | fn bench_from_slice_0000(b: &mut Bencher) { function bench_from_slice_0010 (line 642) | fn bench_from_slice_0010(b: &mut Bencher) { function bench_from_slice_0100 (line 647) | fn bench_from_slice_0100(b: &mut Bencher) { function bench_from_slice_1000 (line 652) | fn bench_from_slice_1000(b: &mut Bencher) { function do_bench_from_iter (line 656) | fn do_bench_from_iter(b: &mut Bencher, src_len: usize) { function bench_from_iter_0000 (line 668) | fn bench_from_iter_0000(b: &mut Bencher) { function bench_from_iter_0010 (line 673) | fn bench_from_iter_0010(b: &mut Bencher) { function bench_from_iter_0100 (line 678) | fn bench_from_iter_0100(b: &mut Bencher) { function bench_from_iter_1000 (line 683) | fn bench_from_iter_1000(b: &mut Bencher) { function do_bench_extend (line 687) | fn do_bench_extend(b: &mut Bencher, dst_len: usize, src_len: usize) { function bench_extend_0000_0000 (line 701) | fn bench_extend_0000_0000(b: &mut Bencher) { function bench_extend_0000_0010 (line 706) | fn bench_extend_0000_0010(b: &mut Bencher) { function bench_extend_0000_0100 (line 711) | fn bench_extend_0000_0100(b: &mut Bencher) { function bench_extend_0000_1000 (line 716) | fn bench_extend_0000_1000(b: &mut Bencher) { function bench_extend_0010_0010 (line 721) | fn bench_extend_0010_0010(b: &mut Bencher) { function bench_extend_0100_0100 (line 726) | fn bench_extend_0100_0100(b: &mut Bencher) { function bench_extend_1000_1000 (line 731) | fn bench_extend_1000_1000(b: &mut Bencher) { function do_bench_extend_from_slice (line 735) | fn do_bench_extend_from_slice(b: &mut Bencher, dst_len: usize, src_len: ... function bench_extend_recycle (line 749) | fn bench_extend_recycle(b: &mut Bencher) { function bench_extend_from_slice_0000_0000 (line 763) | fn bench_extend_from_slice_0000_0000(b: &mut Bencher) { function bench_extend_from_slice_0000_0010 (line 768) | fn bench_extend_from_slice_0000_0010(b: &mut Bencher) { function bench_extend_from_slice_0000_0100 (line 773) | fn bench_extend_from_slice_0000_0100(b: &mut Bencher) { function bench_extend_from_slice_0000_1000 (line 778) | fn bench_extend_from_slice_0000_1000(b: &mut Bencher) { function bench_extend_from_slice_0010_0010 (line 783) | fn bench_extend_from_slice_0010_0010(b: &mut Bencher) { function bench_extend_from_slice_0100_0100 (line 788) | fn bench_extend_from_slice_0100_0100(b: &mut Bencher) { function bench_extend_from_slice_1000_1000 (line 793) | fn bench_extend_from_slice_1000_1000(b: &mut Bencher) { function do_bench_clone (line 797) | fn do_bench_clone(b: &mut Bencher, src_len: usize) { function bench_clone_0000 (line 806) | fn bench_clone_0000(b: &mut Bencher) { function bench_clone_0010 (line 811) | fn bench_clone_0010(b: &mut Bencher) { function bench_clone_0100 (line 816) | fn bench_clone_0100(b: &mut Bencher) { function bench_clone_1000 (line 821) | fn bench_clone_1000(b: &mut Bencher) { function do_bench_clone_from (line 825) | fn do_bench_clone_from(b: &mut Bencher, times: usize, dst_len: usize, sr... function bench_clone_from_01_0000_0000 (line 843) | fn bench_clone_from_01_0000_0000(b: &mut Bencher) { function bench_clone_from_01_0000_0010 (line 848) | fn bench_clone_from_01_0000_0010(b: &mut Bencher) { function bench_clone_from_01_0000_0100 (line 853) | fn bench_clone_from_01_0000_0100(b: &mut Bencher) { function bench_clone_from_01_0000_1000 (line 858) | fn bench_clone_from_01_0000_1000(b: &mut Bencher) { function bench_clone_from_01_0010_0010 (line 863) | fn bench_clone_from_01_0010_0010(b: &mut Bencher) { function bench_clone_from_01_0100_0100 (line 868) | fn bench_clone_from_01_0100_0100(b: &mut Bencher) { function bench_clone_from_01_1000_1000 (line 873) | fn bench_clone_from_01_1000_1000(b: &mut Bencher) { function bench_clone_from_01_0010_0100 (line 878) | fn bench_clone_from_01_0010_0100(b: &mut Bencher) { function bench_clone_from_01_0100_1000 (line 883) | fn bench_clone_from_01_0100_1000(b: &mut Bencher) { function bench_clone_from_01_0010_0000 (line 888) | fn bench_clone_from_01_0010_0000(b: &mut Bencher) { function bench_clone_from_01_0100_0010 (line 893) | fn bench_clone_from_01_0100_0010(b: &mut Bencher) { function bench_clone_from_01_1000_0100 (line 898) | fn bench_clone_from_01_1000_0100(b: &mut Bencher) { function bench_clone_from_10_0000_0000 (line 903) | fn bench_clone_from_10_0000_0000(b: &mut Bencher) { function bench_clone_from_10_0000_0010 (line 908) | fn bench_clone_from_10_0000_0010(b: &mut Bencher) { function bench_clone_from_10_0000_0100 (line 913) | fn bench_clone_from_10_0000_0100(b: &mut Bencher) { function bench_clone_from_10_0000_1000 (line 918) | fn bench_clone_from_10_0000_1000(b: &mut Bencher) { function bench_clone_from_10_0010_0010 (line 923) | fn bench_clone_from_10_0010_0010(b: &mut Bencher) { function bench_clone_from_10_0100_0100 (line 928) | fn bench_clone_from_10_0100_0100(b: &mut Bencher) { function bench_clone_from_10_1000_1000 (line 933) | fn bench_clone_from_10_1000_1000(b: &mut Bencher) { function bench_clone_from_10_0010_0100 (line 938) | fn bench_clone_from_10_0010_0100(b: &mut Bencher) { function bench_clone_from_10_0100_1000 (line 943) | fn bench_clone_from_10_0100_1000(b: &mut Bencher) { function bench_clone_from_10_0010_0000 (line 948) | fn bench_clone_from_10_0010_0000(b: &mut Bencher) { function bench_clone_from_10_0100_0010 (line 953) | fn bench_clone_from_10_0100_0010(b: &mut Bencher) { function bench_clone_from_10_1000_0100 (line 958) | fn bench_clone_from_10_1000_0100(b: &mut Bencher) { function bench_in_place_recycle (line 1001) | fn bench_in_place_recycle(b: &mut Bencher) { function bench_in_place_zip_recycle (line 1018) | fn bench_in_place_zip_recycle(b: &mut Bencher) { function bench_in_place_zip_iter_mut (line 1037) | fn bench_in_place_zip_iter_mut(b: &mut Bencher) { function vec_cast (line 1052) | pub fn vec_cast(input: Vec) -> Vec { function bench_transmute (line 1057) | fn bench_transmute(b: &mut Bencher) { type Droppable (line 1069) | struct Droppable(usize); method drop (line 1072) | fn drop(&mut self) { function bench_in_place_collect_droppable (line 1078) | fn bench_in_place_collect_droppable(b: &mut Bencher) { constant LEN (line 1090) | const LEN: usize = 16384; function bench_chain_collect (line 1093) | fn bench_chain_collect(b: &mut Bencher) { function bench_chain_chain_collect (line 1099) | fn bench_chain_chain_collect(b: &mut Bencher) { function bench_nest_chain_chain_collect (line 1111) | fn bench_nest_chain_chain_collect(b: &mut Bencher) { function bench_range_map_collect (line 1119) | fn bench_range_map_collect(b: &mut Bencher) { function bench_chain_extend_ref (line 1124) | fn bench_chain_extend_ref(b: &mut Bencher) { function bench_chain_extend_value (line 1134) | fn bench_chain_extend_value(b: &mut Bencher) { function bench_rev_1 (line 1144) | fn bench_rev_1(b: &mut Bencher) { function bench_rev_2 (line 1154) | fn bench_rev_2(b: &mut Bencher) { function bench_map_regular (line 1164) | fn bench_map_regular(b: &mut Bencher) { function bench_map_fast (line 1174) | fn bench_map_fast(b: &mut Bencher) { function random_sorted_fill (line 1188) | fn random_sorted_fill(mut seed: u32, buf: &mut [u32]) { function bench_vec_dedup_old (line 1208) | fn bench_vec_dedup_old(b: &mut Bencher, sz: usize) { function bench_vec_dedup_new (line 1227) | fn bench_vec_dedup_new(b: &mut Bencher, sz: usize) { function bench_dedup_old_100 (line 1242) | fn bench_dedup_old_100(b: &mut Bencher) { function bench_dedup_new_100 (line 1246) | fn bench_dedup_new_100(b: &mut Bencher) { function bench_dedup_old_1000 (line 1251) | fn bench_dedup_old_1000(b: &mut Bencher) { function bench_dedup_new_1000 (line 1255) | fn bench_dedup_new_1000(b: &mut Bencher) { function bench_dedup_old_10000 (line 1260) | fn bench_dedup_old_10000(b: &mut Bencher) { function bench_dedup_new_10000 (line 1264) | fn bench_dedup_new_10000(b: &mut Bencher) { function bench_dedup_old_100000 (line 1269) | fn bench_dedup_old_100000(b: &mut Bencher) { function bench_dedup_new_100000 (line 1273) | fn bench_dedup_new_100000(b: &mut Bencher) { function bench_iteration (line 1414) | fn bench_iteration(b: &mut Bencher, size: i32) { function iteration_20 (line 1430) | pub fn iteration_20(b: &mut Bencher) { function iteration_1000 (line 1435) | pub fn iteration_1000(b: &mut Bencher) { function iteration_100000 (line 1440) | pub fn iteration_100000(b: &mut Bencher) { function bench_iteration_mut (line 1444) | fn bench_iteration_mut(b: &mut Bencher, size: i32) { function iteration_mut_20 (line 1460) | pub fn iteration_mut_20(b: &mut Bencher) { function iteration_mut_1000 (line 1465) | pub fn iteration_mut_1000(b: &mut Bencher) { function iteration_mut_100000 (line 1470) | pub fn iteration_mut_100000(b: &mut Bencher) { function bench_first_and_last (line 1474) | fn bench_first_and_last(b: &mut Bencher, size: i32) { function first_and_last_0 (line 1485) | pub fn first_and_last_0(b: &mut Bencher) { function first_and_last_100 (line 1490) | pub fn first_and_last_100(b: &mut Bencher) { function first_and_last_10k (line 1495) | pub fn first_and_last_10k(b: &mut Bencher) { constant BENCH_RANGE_SIZE (line 1499) | const BENCH_RANGE_SIZE: i32 = 145; constant BENCH_RANGE_COUNT (line 1500) | const BENCH_RANGE_COUNT: i32 = BENCH_RANGE_SIZE * (BENCH_RANGE_SIZE - 1)... function bench_range (line 1502) | fn bench_range(b: &mut Bencher, f: F) function range_included_excluded (line 1521) | pub fn range_included_excluded(b: &mut Bencher) { function range_included_included (line 1526) | pub fn range_included_included(b: &mut Bencher) { function range_included_unbounded (line 1531) | pub fn range_included_unbounded(b: &mut Bencher) { function range_unbounded_unbounded (line 1536) | pub fn range_unbounded_unbounded(b: &mut Bencher) { function bench_iter (line 1540) | fn bench_iter(b: &mut Bencher, repeats: i32, size: i32) { function range_unbounded_vs_iter (line 1551) | pub fn range_unbounded_vs_iter(b: &mut Bencher) { function iter_0 (line 1556) | pub fn iter_0(b: &mut Bencher) { function iter_1 (line 1561) | pub fn iter_1(b: &mut Bencher) { function iter_100 (line 1566) | pub fn iter_100(b: &mut Bencher) { function iter_10k (line 1571) | pub fn iter_10k(b: &mut Bencher) { function iter_1m (line 1576) | pub fn iter_1m(b: &mut Bencher) { constant FAT (line 1580) | const FAT: usize = 256; function slim_map (line 1584) | fn slim_map(n: usize) -> BTreeMap { function fat_val_map (line 1589) | fn fat_val_map(n: usize) -> BTreeMap { function clone_slim_100 (line 1594) | pub fn clone_slim_100(b: &mut Bencher) { function clone_slim_100_and_clear (line 1600) | pub fn clone_slim_100_and_clear(b: &mut Bencher) { function clone_slim_100_and_drain_all (line 1606) | pub fn clone_slim_100_and_drain_all(b: &mut Bencher) { function clone_slim_100_and_drain_half (line 1612) | pub fn clone_slim_100_and_drain_half(b: &mut Bencher) { function clone_slim_100_and_into_iter (line 1622) | pub fn clone_slim_100_and_into_iter(b: &mut Bencher) { function clone_slim_100_and_pop_all (line 1628) | pub fn clone_slim_100_and_pop_all(b: &mut Bencher) { function clone_slim_100_and_remove_all (line 1638) | pub fn clone_slim_100_and_remove_all(b: &mut Bencher) { function clone_slim_100_and_remove_half (line 1651) | pub fn clone_slim_100_and_remove_half(b: &mut Bencher) { function clone_slim_10k (line 1665) | pub fn clone_slim_10k(b: &mut Bencher) { function clone_slim_10k_and_clear (line 1671) | pub fn clone_slim_10k_and_clear(b: &mut Bencher) { function clone_slim_10k_and_drain_all (line 1677) | pub fn clone_slim_10k_and_drain_all(b: &mut Bencher) { function clone_slim_10k_and_drain_half (line 1683) | pub fn clone_slim_10k_and_drain_half(b: &mut Bencher) { function clone_slim_10k_and_into_iter (line 1693) | pub fn clone_slim_10k_and_into_iter(b: &mut Bencher) { function clone_slim_10k_and_pop_all (line 1699) | pub fn clone_slim_10k_and_pop_all(b: &mut Bencher) { function clone_slim_10k_and_remove_all (line 1709) | pub fn clone_slim_10k_and_remove_all(b: &mut Bencher) { function clone_slim_10k_and_remove_half (line 1722) | pub fn clone_slim_10k_and_remove_half(b: &mut Bencher) { function clone_fat_val_100 (line 1736) | pub fn clone_fat_val_100(b: &mut Bencher) { function clone_fat_val_100_and_clear (line 1742) | pub fn clone_fat_val_100_and_clear(b: &mut Bencher) { function clone_fat_val_100_and_drain_all (line 1748) | pub fn clone_fat_val_100_and_drain_all(b: &mut Bencher) { function clone_fat_val_100_and_drain_half (line 1754) | pub fn clone_fat_val_100_and_drain_half(b: &mut Bencher) { function clone_fat_val_100_and_into_iter (line 1764) | pub fn clone_fat_val_100_and_into_iter(b: &mut Bencher) { function clone_fat_val_100_and_pop_all (line 1770) | pub fn clone_fat_val_100_and_pop_all(b: &mut Bencher) { function clone_fat_val_100_and_remove_all (line 1780) | pub fn clone_fat_val_100_and_remove_all(b: &mut Bencher) { function clone_fat_val_100_and_remove_half (line 1793) | pub fn clone_fat_val_100_and_remove_half(b: &mut Bencher) { function random (line 1810) | fn random(n: usize) -> BTreeSet { function neg (line 1820) | fn neg(n: usize) -> BTreeSet { function pos (line 1826) | fn pos(n: usize) -> BTreeSet { function stagger (line 1832) | fn stagger(n1: usize, factor: usize) -> [BTreeSet; 2] { function slim_set (line 1857) | fn slim_set(n: usize) -> BTreeSet { function clone_100 (line 1862) | pub fn clone_100(b: &mut Bencher) { function clone_100_and_clear (line 1868) | pub fn clone_100_and_clear(b: &mut Bencher) { function clone_100_and_drain_all (line 1874) | pub fn clone_100_and_drain_all(b: &mut Bencher) { function clone_100_and_drain_half (line 1880) | pub fn clone_100_and_drain_half(b: &mut Bencher) { function clone_100_and_into_iter (line 1890) | pub fn clone_100_and_into_iter(b: &mut Bencher) { function clone_100_and_pop_all (line 1896) | pub fn clone_100_and_pop_all(b: &mut Bencher) { function clone_100_and_remove_all (line 1906) | pub fn clone_100_and_remove_all(b: &mut Bencher) { function clone_100_and_remove_half (line 1919) | pub fn clone_100_and_remove_half(b: &mut Bencher) { function clone_10k (line 1933) | pub fn clone_10k(b: &mut Bencher) { function clone_10k_and_clear (line 1939) | pub fn clone_10k_and_clear(b: &mut Bencher) { function clone_10k_and_drain_all (line 1945) | pub fn clone_10k_and_drain_all(b: &mut Bencher) { function clone_10k_and_drain_half (line 1951) | pub fn clone_10k_and_drain_half(b: &mut Bencher) { function clone_10k_and_into_iter (line 1961) | pub fn clone_10k_and_into_iter(b: &mut Bencher) { function clone_10k_and_pop_all (line 1967) | pub fn clone_10k_and_pop_all(b: &mut Bencher) { function clone_10k_and_remove_all (line 1977) | pub fn clone_10k_and_remove_all(b: &mut Bencher) { function clone_10k_and_remove_half (line 1990) | pub fn clone_10k_and_remove_half(b: &mut Bencher) { function iterator (line 2039) | fn iterator(b: &mut Bencher) { function mut_iterator (line 2057) | fn mut_iterator(b: &mut Bencher) { function concat (line 2070) | fn concat(b: &mut Bencher) { function join (line 2078) | fn join(b: &mut Bencher) { function push (line 2084) | fn push(b: &mut Bencher) { function starts_with_same_vector (line 2093) | fn starts_with_same_vector(b: &mut Bencher) { function starts_with_single_element (line 2099) | fn starts_with_single_element(b: &mut Bencher) { function starts_with_diff_one_element_at_end (line 2105) | fn starts_with_diff_one_element_at_end(b: &mut Bencher) { function ends_with_same_vector (line 2113) | fn ends_with_same_vector(b: &mut Bencher) { function ends_with_single_element (line 2119) | fn ends_with_single_element(b: &mut Bencher) { function ends_with_diff_one_element_at_beginning (line 2125) | fn ends_with_diff_one_element_at_beginning(b: &mut Bencher) { function contains_last_element (line 2133) | fn contains_last_element(b: &mut Bencher) { function zero_1kb_from_elem (line 2139) | fn zero_1kb_from_elem(b: &mut Bencher) { function zero_1kb_set_memory (line 2144) | fn zero_1kb_set_memory(b: &mut Bencher) { function zero_1kb_loop_set (line 2157) | fn zero_1kb_loop_set(b: &mut Bencher) { function zero_1kb_mut_iter (line 2170) | fn zero_1kb_mut_iter(b: &mut Bencher) { function random_inserts (line 2184) | fn random_inserts(b: &mut Bencher) { function random_removes (line 2196) | fn random_removes(b: &mut Bencher) { function gen_ascending (line 2207) | fn gen_ascending(len: usize) -> Vec { function gen_descending (line 2211) | fn gen_descending(len: usize) -> Vec { constant SEED (line 2215) | const SEED: [u8; 16] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14... function gen_random (line 2217) | fn gen_random(len: usize) -> Vec { function gen_random_bytes (line 2222) | fn gen_random_bytes(len: usize) -> Vec { function gen_mostly_ascending (line 2227) | fn gen_mostly_ascending(len: usize) -> Vec { function gen_mostly_descending (line 2238) | fn gen_mostly_descending(len: usize) -> Vec { function gen_strings (line 2249) | fn gen_strings(len: usize) -> Vec { function gen_big_random (line 2259) | fn gen_big_random(len: usize) -> Vec<[u64; 16]> { type F64x4 (line 2372) | struct F64x4(f64, f64, f64, f64); function bench_new (line 2417) | fn bench_new(b: &mut Bencher) { function bench_grow_1025 (line 2425) | fn bench_grow_1025(b: &mut Bencher) { function bench_iter_1000 (line 2436) | fn bench_iter_1000(b: &mut Bencher) { function bench_mut_iter_1000 (line 2449) | fn bench_mut_iter_1000(b: &mut Bencher) { function bench_try_fold (line 2462) | fn bench_try_fold(b: &mut Bencher) { function bench_find_smallest_1000 (line 2473) | fn bench_find_smallest_1000(b: &mut Bencher) { function bench_peek_mut_deref_mut (line 2496) | fn bench_peek_mut_deref_mut(b: &mut Bencher) { function bench_from_vec (line 2515) | fn bench_from_vec(b: &mut Bencher) { function bench_into_sorted_vec (line 2524) | fn bench_into_sorted_vec(b: &mut Bencher) { function bench_push (line 2531) | fn bench_push(b: &mut Bencher) { function bench_pop (line 2547) | fn bench_pop(b: &mut Bencher) { constant VECDEQUE_LEN (line 2560) | const VECDEQUE_LEN: i32 = 100000; constant WARMUP_N (line 2561) | const WARMUP_N: usize = 100; constant BENCH_N (line 2562) | const BENCH_N: usize = 1000; function main (line 2564) | fn main() { function test_basic (line 2596) | fn test_basic() { function generate_test (line 2635) | fn generate_test() -> LinkedList { function list_from (line 2639) | fn list_from(v: &[T]) -> LinkedList { function test_split_off (line 2644) | fn test_split_off() { function test_iterator (line 2700) | fn test_iterator() { function test_iterator_clone (line 2716) | fn test_iterator_clone() { function test_iterator_double_end (line 2730) | fn test_iterator_double_end() { function test_rev_iter (line 2748) | fn test_rev_iter() { function test_mut_iter (line 2764) | fn test_mut_iter() { function test_iterator_mut_double_end (line 2785) | fn test_iterator_mut_double_end() { function test_mut_rev_iter (line 2803) | fn test_mut_rev_iter() { function test_eq (line 2817) | fn test_eq() { function test_hash (line 2832) | fn test_hash() { function test_ord (line 2852) | fn test_ord() { function test_ord_nan (line 2862) | fn test_ord_nan() { function test_show (line 2894) | fn test_show() { function test_extend_ref (line 2903) | fn test_extend_ref() { function test_extend (line 2922) | fn test_extend() { function test_contains (line 2938) | fn test_contains() { function drain_filter_empty (line 2951) | fn drain_filter_empty() { function drain_filter_zst (line 2968) | fn drain_filter_zst() { function drain_filter_false (line 2991) | fn drain_filter_false() { function drain_filter_true (line 3014) | fn drain_filter_true() { function drain_filter_complex (line 3038) | fn drain_filter_complex() { function drain_filter_drop_panic_leak (line 3126) | fn drain_filter_drop_panic_leak() { function drain_filter_pred_panic_leak (line 3160) | fn drain_filter_pred_panic_leak() { function test_drop (line 3194) | fn test_drop() { function test_drop_with_pop (line 3216) | fn test_drop_with_pop() { function test_drop_clear (line 3242) | fn test_drop_clear() { function test_drop_panic (line 3266) | fn test_drop_panic() { function uninhabited (line 3305) | fn uninhabited() { function slice (line 3317) | fn slice() { function trait_object (line 3330) | fn trait_object() { function float_nan_ne (line 3348) | fn float_nan_ne() { function partial_eq (line 3355) | fn partial_eq() { function eq (line 3371) | fn eq() { type Rc (line 3389) | type Rc = Arc; constant SHARED_ITER_MAX (line 3391) | const SHARED_ITER_MAX: u16 = 100; function assert_trusted_len (line 3393) | fn assert_trusted_len(_: &I) {} function shared_from_iter_normal (line 3396) | fn shared_from_iter_normal() { function shared_from_iter_trustedlen_normal (line 3418) | fn shared_from_iter_trustedlen_normal() { function shared_from_iter_trustedlen_panic (line 3456) | fn shared_from_iter_trustedlen_panic() { function shared_from_iter_trustedlen_no_fuse (line 3470) | fn shared_from_iter_trustedlen_no_fuse() { function test_le (line 3499) | fn test_le() { function test_find (line 3507) | fn test_find() { function test_rfind (line 3517) | fn test_rfind() { function test_collect (line 3527) | fn test_collect() { function test_into_bytes (line 3537) | fn test_into_bytes() { function test_find_str (line 3544) | fn test_find_str() { function s (line 3591) | fn s(x: &str) -> String { function test_concat_for_different_types (line 3603) | fn test_concat_for_different_types() { function test_concat_for_different_lengths (line 3609) | fn test_concat_for_different_lengths() { function test_join_for_different_types (line 3625) | fn test_join_for_different_types() { function test_join_for_different_lengths (line 3635) | fn test_join_for_different_lengths() { function test_join_for_different_lengths_with_long_separator (line 3646) | fn test_join_for_different_lengths_with_long_separator() { function test_join_isue_80335 (line 3657) | fn test_join_isue_80335() { function test_unsafe_slice (line 3688) | fn test_unsafe_slice() { function test_starts_with (line 3715) | fn test_starts_with() { function test_ends_with (line 3726) | fn test_ends_with() { function test_is_empty (line 3737) | fn test_is_empty() { function test_replacen (line 3743) | fn test_replacen() { function test_replace (line 3757) | fn test_replace() { function test_replace_2a (line 3768) | fn test_replace_2a() { function test_replace_2b (line 3778) | fn test_replace_2b() { function test_replace_2c (line 3788) | fn test_replace_2c() { function test_replace_2d (line 3798) | fn test_replace_2d() { function test_replace_pattern (line 3807) | fn test_replace_pattern() { function assert_range_eq_can_fail_by_panic (line 3870) | fn assert_range_eq_can_fail_by_panic() { function assert_range_eq_can_fail_by_inequality (line 3879) | fn assert_range_eq_can_fail_by_inequality() { function simple_ascii (line 3944) | fn simple_ascii() { function simple_unicode (line 3959) | fn simple_unicode() { function simple_big (line 4004) | fn simple_big() { function test_slice_fail (line 4029) | fn test_slice_fail() { constant DATA (line 4134) | const DATA: &str = "abcαβγ"; constant BAD_START (line 4136) | const BAD_START: usize = 4; constant GOOD_START (line 4137) | const GOOD_START: usize = 3; constant BAD_END (line 4138) | const BAD_END: usize = 6; constant GOOD_END (line 4139) | const GOOD_END: usize = 7; constant BAD_END_INCL (line 4140) | const BAD_END_INCL: usize = BAD_END - 1; constant GOOD_END_INCL (line 4141) | const GOOD_END_INCL: usize = GOOD_END - 1; constant LOREM_PARAGRAPH (line 4198) | const LOREM_PARAGRAPH: &str = "\ function test_slice_fail_truncated_1 (line 4209) | fn test_slice_fail_truncated_1() { function test_slice_fail_truncated_2 (line 4215) | fn test_slice_fail_truncated_2() { function test_str_slice_rangetoinclusive_ok (line 4221) | fn test_str_slice_rangetoinclusive_ok() { function test_str_slice_rangetoinclusive_notok (line 4229) | fn test_str_slice_rangetoinclusive_notok() { function test_str_slicemut_rangetoinclusive_ok (line 4235) | fn test_str_slicemut_rangetoinclusive_ok() { function test_str_slicemut_rangetoinclusive_notok (line 4244) | fn test_str_slicemut_rangetoinclusive_notok() { function test_is_char_boundary (line 4251) | fn test_is_char_boundary() { function test_trim_start_matches (line 4271) | fn test_trim_start_matches() { function test_trim_end_matches (line 4286) | fn test_trim_end_matches() { function test_trim_matches (line 4301) | fn test_trim_matches() { function test_trim_start (line 4316) | fn test_trim_start() { function test_trim_end (line 4326) | fn test_trim_end() { function test_trim (line 4336) | fn test_trim() { function test_is_whitespace (line 4346) | fn test_is_whitespace() { function test_is_utf8 (line 4355) | fn test_is_utf8() { function from_utf8_mostly_ascii (line 4380) | fn from_utf8_mostly_ascii() { function from_utf8_error (line 4392) | fn from_utf8_error() { function test_as_bytes (line 4422) | fn test_as_bytes() { function test_as_bytes_fail (line 4436) | fn test_as_bytes_fail() { function test_as_ptr (line 4445) | fn test_as_ptr() { function vec_str_conversions (line 4457) | fn vec_str_conversions() { function test_contains (line 4475) | fn test_contains() { function test_contains_char (line 4492) | fn test_contains_char() { function test_split_at (line 4500) | fn test_split_at() { function test_split_at_mut (line 4513) | fn test_split_at_mut() { function test_split_at_boundscheck (line 4525) | fn test_split_at_boundscheck() { function test_escape_unicode (line 4531) | fn test_escape_unicode() { function test_escape_debug (line 4544) | fn test_escape_debug() { function test_escape_default (line 4568) | fn test_escape_default() { function test_total_ord (line 4582) | fn test_total_ord() { function test_iterator (line 4591) | fn test_iterator() { function test_rev_iterator (line 4607) | fn test_rev_iterator() { function test_chars_decoding (line 4623) | fn test_chars_decoding() { function test_chars_rev_decoding (line 4635) | fn test_chars_rev_decoding() { function test_iterator_clone (line 4646) | fn test_iterator_clone() { function test_iterator_last (line 4654) | fn test_iterator_last() { function test_chars_debug (line 4662) | fn test_chars_debug() { function test_bytesator (line 4672) | fn test_bytesator() { function test_bytes_revator (line 4687) | fn test_bytes_revator() { function test_bytesator_nth (line 4702) | fn test_bytesator_nth() { function test_bytesator_count (line 4716) | fn test_bytesator_count() { function test_bytesator_last (line 4724) | fn test_bytesator_last() { function test_char_indicesator (line 4732) | fn test_char_indicesator() { function test_char_indices_revator (line 4749) | fn test_char_indices_revator() { function test_char_indices_last (line 4766) | fn test_char_indices_last() { function test_splitn_char_iterator (line 4774) | fn test_splitn_char_iterator() { function test_split_char_iterator_no_trailing (line 4792) | fn test_split_char_iterator_no_trailing() { function test_split_char_iterator_inclusive (line 4803) | fn test_split_char_iterator_inclusive() { function test_split_char_iterator_inclusive_rev (line 4822) | fn test_split_char_iterator_inclusive_rev() { function test_rsplit (line 4846) | fn test_rsplit() { function test_rsplitn (line 4860) | fn test_rsplitn() { function test_split_once (line 4874) | fn test_split_once() { function test_rsplit_once (line 4886) | fn test_rsplit_once() { function test_split_whitespace (line 4898) | fn test_split_whitespace() { function test_lines (line 4905) | fn test_lines() { function test_splitator (line 4916) | fn test_splitator() { function test_str_default (line 4938) | fn test_str_default() { function test_str_container (line 4952) | fn test_str_container() { function test_str_from_utf8 (line 4964) | fn test_str_from_utf8() { function test_pattern_deref_forward (line 4976) | fn test_pattern_deref_forward() { function test_empty_match_indices (line 4984) | fn test_empty_match_indices() { function test_bool_from_str (line 4991) | fn test_bool_from_str() { function check_contains_all_substrings (line 4997) | fn check_contains_all_substrings(s: &str) { function strslice_issue_16589 (line 5008) | fn strslice_issue_16589() { function strslice_issue_16878 (line 5017) | fn strslice_issue_16878() { function test_strslice_contains (line 5024) | fn test_strslice_contains() { function test_rsplitn_char_iterator (line 5030) | fn test_rsplitn_char_iterator() { function test_split_char_iterator (line 5052) | fn test_split_char_iterator() { function test_rev_split_char_iterator_no_trailing (line 5086) | fn test_rev_split_char_iterator_no_trailing() { function test_utf16_code_units (line 5099) | fn test_utf16_code_units() { function starts_with_in_unicode (line 5104) | fn starts_with_in_unicode() { function starts_short_long (line 5109) | fn starts_short_long() { function contains_weird_cases (line 5128) | fn contains_weird_cases() { function trim_ws (line 5135) | fn trim_ws() { function to_lowercase (line 5149) | fn to_lowercase() { function to_uppercase (line 5182) | fn to_uppercase() { function test_into_string (line 5188) | fn test_into_string() { function test_box_slice_clone (line 5196) | fn test_box_slice_clone() { function test_cow_from (line 5204) | fn test_cow_from() { function test_repeat (line 5214) | fn test_repeat() { function cmp_search_to_vec (line 5242) | fn cmp_search_to_vec<'a>( function different_str_pattern_forwarding_lifetimes (line 5462) | fn different_str_pattern_forwarding_lifetimes() { function test_str_multiline (line 5478) | fn test_str_multiline() { function test_str_escapes (line 5492) | fn test_str_escapes() { function const_str_ptr (line 5499) | fn const_str_ptr() { function utf8 (line 5519) | fn utf8() { function utf8_chars (line 5569) | fn utf8_chars() { function test_hash (line 5599) | fn test_hash() { type IntoCow (line 5624) | pub trait IntoCow<'a, B: ?Sized> method into_cow (line 5628) | fn into_cow(self) -> Cow<'a, B>; function into_cow (line 5638) | fn into_cow(self) -> Cow<'a, str> { function test_from_str (line 5644) | fn test_from_str() { function test_from_cow_str (line 5650) | fn test_from_cow_str() { function test_unsized_to_string (line 5656) | fn test_unsized_to_string() { function test_from_utf8 (line 5662) | fn test_from_utf8() { function test_from_utf8_lossy (line 5679) | fn test_from_utf8_lossy() { function test_from_utf16 (line 5733) | fn test_from_utf16() { function test_utf16_invalid (line 5788) | fn test_utf16_invalid() { function test_from_utf16_lossy (line 5803) | fn test_from_utf16_lossy() { function test_push_bytes (line 5821) | fn test_push_bytes() { function test_push_str (line 5831) | fn test_push_str() { function test_add_assign (line 5842) | fn test_add_assign() { function test_push (line 5853) | fn test_push() { function test_pop (line 5864) | fn test_pop() { function test_split_off_empty (line 5875) | fn test_split_off_empty() { function test_split_off_past_end (line 5884) | fn test_split_off_past_end() { function test_split_off_mid_char (line 5892) | fn test_split_off_mid_char() { function test_split_off_ascii (line 5898) | fn test_split_off_ascii() { function test_split_off_unicode (line 5908) | fn test_split_off_unicode() { function test_str_truncate (line 5918) | fn test_str_truncate() { function test_str_truncate_invalid_len (line 5936) | fn test_str_truncate_invalid_len() { function test_str_truncate_split_codepoint (line 5944) | fn test_str_truncate_split_codepoint() { function test_str_clear (line 5950) | fn test_str_clear() { function test_str_add (line 5958) | fn test_str_add() { function remove (line 5967) | fn remove() { function remove_bad (line 5978) | fn remove_bad() { function test_remove_matches (line 5983) | fn test_remove_matches() { function test_retain (line 6010) | fn test_retain() { function insert (line 6044) | fn insert() { function insert_bad1 (line 6054) | fn insert_bad1() { function insert_bad2 (line 6059) | fn insert_bad2() { function test_slicing (line 6064) | fn test_slicing() { function test_simple_types (line 6073) | fn test_simple_types() { function test_vectors (line 6084) | fn test_vectors() { function test_from_iterator (line 6093) | fn test_from_iterator() { function test_drain (line 6114) | fn test_drain() { function test_drain_start_overflow (line 6132) | fn test_drain_start_overflow() { function test_drain_end_overflow (line 6139) | fn test_drain_end_overflow() { function test_replace_range (line 6145) | fn test_replace_range() { function test_replace_range_char_boundary (line 6153) | fn test_replace_range_char_boundary() { function test_replace_range_inclusive_range (line 6159) | fn test_replace_range_inclusive_range() { function test_replace_range_out_of_bounds (line 6169) | fn test_replace_range_out_of_bounds() { function test_replace_range_inclusive_out_of_bounds (line 6176) | fn test_replace_range_inclusive_out_of_bounds() { function test_replace_range_start_overflow (line 6183) | fn test_replace_range_start_overflow() { function test_replace_range_end_overflow (line 6190) | fn test_replace_range_end_overflow() { function test_replace_range_empty (line 6196) | fn test_replace_range_empty() { function test_replace_range_unbounded (line 6203) | fn test_replace_range_unbounded() { function test_replace_range_evil_start_bound (line 6210) | fn test_replace_range_evil_start_bound() { function test_replace_range_evil_end_bound (line 6233) | fn test_replace_range_evil_end_bound() { function test_extend_ref (line 6256) | fn test_extend_ref() { function test_into_boxed_str (line 6264) | fn test_into_boxed_str() { function test_reserve_exact (line 6271) | fn test_reserve_exact() { function test_try_reserve (line 6297) | fn test_try_reserve() { function test_try_reserve_exact (line 6387) | fn test_try_reserve_exact() { function test_from_char (line 6457) | fn test_from_char() { function test_str_concat (line 6464) | fn test_str_concat() { function test_from_cow_slice (line 6489) | fn test_from_cow_slice() { function test_from_cow_str (line 6495) | fn test_from_cow_str() { function test_from_cow_c_str (line 6501) | fn test_from_cow_c_str() { function test_from_cow_os_str (line 6507) | fn test_from_cow_os_str() { function test_from_cow_path (line 6513) | fn test_from_cow_path() { function cow_const (line 6519) | fn cow_const() { type DropCounter (line 6542) | struct DropCounter<'a> { method drop (line 6547) | fn drop(&mut self) { function test_small_vec_struct (line 6553) | fn test_small_vec_struct() { function test_double_drop (line 6558) | fn test_double_drop() { function test_reserve (line 6583) | fn test_reserve() { function test_zst_capacity (line 6605) | fn test_zst_capacity() { function test_indexing (line 6610) | fn test_indexing() { function test_debug_fmt (line 6623) | fn test_debug_fmt() { function test_push (line 6635) | fn test_push() { function test_extend (line 6646) | fn test_extend() { function test_extend_from_slice (line 6691) | fn test_extend_from_slice() { function test_extend_ref (line 6703) | fn test_extend_ref() { function test_slice_from_ref (line 6718) | fn test_slice_from_ref() { function test_slice_from_mut (line 6726) | fn test_slice_from_mut() { function test_slice_to_mut (line 6740) | fn test_slice_to_mut() { function test_split_at_mut (line 6754) | fn test_split_at_mut() { function test_clone (line 6779) | fn test_clone() { function test_clone_from (line 6792) | fn test_clone_from() { function test_retain (line 6814) | fn test_retain() { function test_retain_pred_panic_with_hole (line 6821) | fn test_retain_pred_panic_with_hole() { function test_retain_pred_panic_no_hole (line 6838) | fn test_retain_pred_panic_no_hole() { function test_retain_drop_panic (line 6853) | fn test_retain_drop_panic() { function test_dedup (line 6882) | fn test_dedup() { function test_dedup_by_key (line 6899) | fn test_dedup_by_key() { function test_dedup_by (line 6916) | fn test_dedup_by() { function test_dedup_unique (line 6934) | fn test_dedup_unique() { function zero_sized_values (line 6946) | fn zero_sized_values() { function test_partition (line 6979) | fn test_partition() { function test_zip_unzip (line 6987) | fn test_zip_unzip() { function test_cmp (line 6998) | fn test_cmp() { function test_vec_truncate_drop (line 7021) | fn test_vec_truncate_drop() { function test_vec_truncate_fail (line 7042) | fn test_vec_truncate_fail() { function test_index (line 7058) | fn test_index() { function test_index_out_of_bounds (line 7065) | fn test_index_out_of_bounds() { function test_slice_out_of_bounds_1 (line 7072) | fn test_slice_out_of_bounds_1() { function test_slice_out_of_bounds_2 (line 7079) | fn test_slice_out_of_bounds_2() { function test_slice_out_of_bounds_3 (line 7086) | fn test_slice_out_of_bounds_3() { function test_slice_out_of_bounds_4 (line 7093) | fn test_slice_out_of_bounds_4() { function test_slice_out_of_bounds_5 (line 7100) | fn test_slice_out_of_bounds_5() { function test_swap_remove_empty (line 7107) | fn test_swap_remove_empty() { function test_move_items (line 7113) | fn test_move_items() { function test_move_items_reverse (line 7123) | fn test_move_items_reverse() { function test_move_items_zero_sized (line 7133) | fn test_move_items_zero_sized() { function test_drain_empty_vec (line 7143) | fn test_drain_empty_vec() { function test_drain_items (line 7154) | fn test_drain_items() { function test_drain_items_reverse (line 7165) | fn test_drain_items_reverse() { function test_drain_items_zero_sized (line 7176) | fn test_drain_items_zero_sized() { function test_drain_out_of_bounds (line 7188) | fn test_drain_out_of_bounds() { function test_drain_range (line 7194) | fn test_drain_range() { function test_drain_inclusive_range (line 7213) | fn test_drain_inclusive_range() { function test_drain_max_vec_size (line 7236) | fn test_drain_max_vec_size() { function test_drain_index_overflow (line 7254) | fn test_drain_index_overflow() { function test_drain_inclusive_out_of_bounds (line 7264) | fn test_drain_inclusive_out_of_bounds() { function test_drain_start_overflow (line 7271) | fn test_drain_start_overflow() { function test_drain_end_overflow (line 7278) | fn test_drain_end_overflow() { function test_drain_leak (line 7284) | fn test_drain_leak() { function test_splice (line 7322) | fn test_splice() { function test_splice_inclusive_range (line 7332) | fn test_splice_inclusive_range() { function test_splice_out_of_bounds (line 7345) | fn test_splice_out_of_bounds() { function test_splice_inclusive_out_of_bounds (line 7353) | fn test_splice_inclusive_out_of_bounds() { function test_splice_items_zero_sized (line 7360) | fn test_splice_items_zero_sized() { function test_splice_unbounded (line 7369) | fn test_splice_unbounded() { function test_splice_forget (line 7377) | fn test_splice_forget() { function test_into_boxed_slice (line 7385) | fn test_into_boxed_slice() { function test_append (line 7392) | fn test_append() { function test_split_off (line 7401) | fn test_split_off() { function test_split_off_take_all (line 7411) | fn test_split_off_take_all() { function test_into_iter_as_slice (line 7423) | fn test_into_iter_as_slice() { function test_into_iter_as_mut_slice (line 7435) | fn test_into_iter_as_mut_slice() { function test_into_iter_debug (line 7446) | fn test_into_iter_debug() { function test_into_iter_count (line 7454) | fn test_into_iter_count() { function test_into_iter_clone (line 7459) | fn test_into_iter_clone() { function test_into_iter_leak (line 7477) | fn test_into_iter_leak() { function test_from_iter_specialization (line 7502) | fn test_from_iter_specialization() { function test_from_iter_partially_drained_in_place_specialization (line 7511) | fn test_from_iter_partially_drained_in_place_specialization() { function test_from_iter_specialization_with_iterator_adapters (line 7523) | fn test_from_iter_specialization_with_iterator_adapters() { function test_from_iter_specialization_head_tail_drop (line 7544) | fn test_from_iter_specialization_head_tail_drop() { function test_from_iter_specialization_panic_during_iteration_drops (line 7559) | fn test_from_iter_specialization_panic_during_iteration_drops() { function test_from_iter_specialization_panic_during_drop_leaks (line 7583) | fn test_from_iter_specialization_panic_during_drop_leaks() { function test_cow_from (line 7628) | fn test_cow_from() { function test_from_cow (line 7638) | fn test_from_cow() { function assert_covariance (line 7646) | fn assert_covariance() { function from_into_inner (line 7656) | fn from_into_inner() { function overaligned_allocations (line 7672) | fn overaligned_allocations() { function drain_filter_empty (line 7687) | fn drain_filter_empty() { function drain_filter_zst (line 7703) | fn drain_filter_zst() { function drain_filter_false (line 7725) | fn drain_filter_false() { function drain_filter_true (line 7747) | fn drain_filter_true() { function drain_filter_complex (line 7770) | fn drain_filter_complex() { function drain_filter_consumed_panic (line 7841) | fn drain_filter_consumed_panic() { function drain_filter_unconsumed_panic (line 7893) | fn drain_filter_unconsumed_panic() { function drain_filter_unconsumed (line 7942) | fn drain_filter_unconsumed() { function test_reserve_exact (line 7950) | fn test_reserve_exact() { function test_try_reserve (line 7976) | fn test_try_reserve() { function test_try_reserve_exact (line 8094) | fn test_try_reserve_exact() { function test_stable_pointers (line 8190) | fn test_stable_pointers() { function vec_macro_repeating_null_raw_fat_pointer (line 8292) | fn vec_macro_repeating_null_raw_fat_pointer() { function test_push_growth_strategy (line 8322) | fn test_push_growth_strategy() { function partialeq_vec_and_prim (line 8447) | fn partialeq_vec_and_prim() { function partialeq_vec_full (line 8466) | fn partialeq_vec_full() { function test_vec_cycle (line 8489) | fn test_vec_cycle() { function test_vec_cycle_wrapped (line 8527) | fn test_vec_cycle_wrapped() { function test_zero_sized_vec_push (line 8568) | fn test_zero_sized_vec_push() { function test_vec_macro_repeat (line 8585) | fn test_vec_macro_repeat() { function test_vec_swap (line 8598) | fn test_vec_swap() { function test_extend_from_within_spec (line 8610) | fn test_extend_from_within_spec() { function test_extend_from_within_clone (line 8624) | fn test_extend_from_within_clone() { function test_extend_from_within_complete_rande (line 8632) | fn test_extend_from_within_complete_rande() { function test_extend_from_within_empty_rande (line 8640) | fn test_extend_from_within_empty_rande() { function test_extend_from_within_out_of_rande (line 8649) | fn test_extend_from_within_out_of_rande() { function test_extend_from_within_zst (line 8655) | fn test_extend_from_within_zst() { function test_extend_from_within_empty_vec (line 8663) | fn test_extend_from_within_empty_vec() { function test_extend_from_within (line 8671) | fn test_extend_from_within() { function test_vec_dedup_by (line 8680) | fn test_vec_dedup_by() { function test_vec_dedup_empty (line 8689) | fn test_vec_dedup_empty() { function test_vec_dedup_one (line 8698) | fn test_vec_dedup_one() { function test_vec_dedup_multiple_ident (line 8707) | fn test_vec_dedup_multiple_ident() { function test_vec_dedup_partialeq (line 8716) | fn test_vec_dedup_partialeq() { function test_vec_dedup (line 8733) | fn test_vec_dedup() { function test_vec_dedup_panicking (line 8753) | fn test_vec_dedup_panicking() { function test_extend_from_within_panicing_clone (line 8807) | fn test_extend_from_within_panicing_clone() { function hash (line 8889) | fn hash(t: &T) -> u64 { function test_boxed_hasher (line 8899) | fn test_boxed_hasher() { function check_cow_add_cow (line 8914) | fn check_cow_add_cow() { function check_cow_add_str (line 8944) | fn check_cow_add_str() { function check_cow_add_assign_cow (line 8967) | fn check_cow_add_assign_cow() { function check_cow_add_assign_str (line 9009) | fn check_cow_add_assign_str() { function check_cow_clone_from (line 9043) | fn check_cow_clone_from() { function uninhabited (line 9062) | fn uninhabited() { function slice (line 9074) | fn slice() { function trait_object (line 9087) | fn trait_object() { function float_nan_ne (line 9105) | fn float_nan_ne() { function partial_eq (line 9112) | fn partial_eq() { function eq (line 9128) | fn eq() { constant SHARED_ITER_MAX (line 9144) | const SHARED_ITER_MAX: u16 = 100; function assert_trusted_len (line 9146) | fn assert_trusted_len(_: &I) {} function shared_from_iter_normal (line 9149) | fn shared_from_iter_normal() { function shared_from_iter_trustedlen_normal (line 9171) | fn shared_from_iter_trustedlen_normal() { function shared_from_iter_trustedlen_panic (line 9209) | fn shared_from_iter_trustedlen_panic() { function shared_from_iter_trustedlen_no_fuse (line 9223) | fn shared_from_iter_trustedlen_no_fuse() { function square (line 9259) | fn square(n: usize) -> usize { function is_odd (line 9263) | fn is_odd(n: &usize) -> bool { function test_from_fn (line 9268) | fn test_from_fn() { function test_from_elem (line 9293) | fn test_from_elem() { function test_is_empty (line 9317) | fn test_is_empty() { function test_len_divzero (line 9324) | fn test_len_divzero() { function test_get (line 9336) | fn test_get() { function test_first (line 9346) | fn test_first() { function test_first_mut (line 9356) | fn test_first_mut() { function test_split_first (line 9366) | fn test_split_first() { function test_split_first_mut (line 9377) | fn test_split_first_mut() { function test_split_last (line 9388) | fn test_split_last() { function test_split_last_mut (line 9399) | fn test_split_last_mut() { function test_last (line 9411) | fn test_last() { function test_last_mut (line 9421) | fn test_last_mut() { function test_slice (line 9431) | fn test_slice() { function test_slice_from (line 9462) | fn test_slice_from() { function test_slice_to (line 9472) | fn test_slice_to() { function test_pop (line 9482) | fn test_pop() { function test_swap_remove (line 9494) | fn test_swap_remove() { function test_swap_remove_fail (line 9506) | fn test_swap_remove_fail() { function test_swap_remove_noncopyable (line 9513) | fn test_swap_remove_noncopyable() { function test_push (line 9528) | fn test_push() { function test_truncate (line 9543) | fn test_truncate() { function test_clear (line 9553) | fn test_clear() { function test_retain (line 9561) | fn test_retain() { function test_binary_search (line 9568) | fn test_binary_search() { function test_reverse (line 9613) | fn test_reverse() { function test_sort (line 9638) | fn test_sort() { function test_sort_stability (line 9712) | fn test_sort_stability() { function test_rotate_left (line 9754) | fn test_rotate_left() { function test_rotate_right (line 9789) | fn test_rotate_right() { function test_concat (line 9824) | fn test_concat() { function test_join (line 9838) | fn test_join() { function test_join_nocopy (line 9851) | fn test_join_nocopy() { function test_insert (line 9860) | fn test_insert() { function test_insert_oob (line 9880) | fn test_insert_oob() { function test_remove (line 9886) | fn test_remove() { function test_remove_fail (line 9904) | fn test_remove_fail() { function test_capacity (line 9911) | fn test_capacity() { function test_slice_2 (line 9918) | fn test_slice_2() { function test_total_ord_u8 (line 9942) | fn test_total_ord_u8() { function test_total_ord_i32 (line 9956) | fn test_total_ord_i32() { function test_iterator (line 9970) | fn test_iterator() { function test_iter_size_hints (line 9988) | fn test_iter_size_hints() { function test_iter_as_slice (line 9995) | fn test_iter_as_slice() { function test_iter_as_ref (line 10004) | fn test_iter_as_ref() { function test_iter_clone (line 10013) | fn test_iter_clone() { function test_iter_is_empty (line 10024) | fn test_iter_is_empty() { function test_mut_iterator (line 10034) | fn test_mut_iterator() { function test_rev_iterator (line 10043) | fn test_rev_iterator() { function test_mut_rev_iterator (line 10055) | fn test_mut_rev_iterator() { function test_move_iterator (line 10064) | fn test_move_iterator() { function test_move_rev_iterator (line 10070) | fn test_move_rev_iterator() { function test_splitator (line 10076) | fn test_splitator() { function test_splitator_inclusive (line 10096) | fn test_splitator_inclusive() { function test_splitator_inclusive_reverse (line 10116) | fn test_splitator_inclusive_reverse() { function test_splitator_mut_inclusive (line 10136) | fn test_splitator_mut_inclusive() { function test_splitator_mut_inclusive_reverse (line 10156) | fn test_splitator_mut_inclusive_reverse() { function test_splitnator (line 10176) | fn test_splitnator() { function test_splitnator_mut (line 10192) | fn test_splitnator_mut() { function test_rsplitator (line 10208) | fn test_rsplitator() { function test_rsplitnator (line 10226) | fn test_rsplitnator() { function test_windowsator (line 10243) | fn test_windowsator() { function test_windowsator_0 (line 10259) | fn test_windowsator_0() { function test_chunksator (line 10265) | fn test_chunksator() { function test_chunksator_0 (line 10283) | fn test_chunksator_0() { function test_chunks_exactator (line 10289) | fn test_chunks_exactator() { function test_chunks_exactator_0 (line 10307) | fn test_chunks_exactator_0() { function test_rchunksator (line 10313) | fn test_rchunksator() { function test_rchunksator_0 (line 10331) | fn test_rchunksator_0() { function test_rchunks_exactator (line 10337) | fn test_rchunks_exactator() { function test_rchunks_exactator_0 (line 10355) | fn test_rchunks_exactator_0() { function test_reverse_part (line 10361) | fn test_reverse_part() { function test_show (line 10368) | fn test_show() { function test_vec_default (line 10393) | fn test_vec_default() { function test_overflow_does_not_cause_segfault (line 10407) | fn test_overflow_does_not_cause_segfault() { function test_overflow_does_not_cause_segfault_managed (line 10416) | fn test_overflow_does_not_cause_segfault_managed() { function test_mut_split_at (line 10423) | fn test_mut_split_at() { type Foo (line 10448) | struct Foo; function test_iter_zero_sized (line 10451) | fn test_iter_zero_sized() { function test_shrink_to_fit (line 10490) | fn test_shrink_to_fit() { function test_starts_with (line 10502) | fn test_starts_with() { function test_ends_with (line 10516) | fn test_ends_with() { function test_mut_splitator (line 10530) | fn test_mut_splitator() { function test_mut_splitator_rev (line 10546) | fn test_mut_splitator_rev() { function test_get_mut (line 10555) | fn test_get_mut() { function test_mut_chunks (line 10565) | fn test_mut_chunks() { function test_mut_chunks_rev (line 10578) | fn test_mut_chunks_rev() { function test_mut_chunks_0 (line 10591) | fn test_mut_chunks_0() { function test_mut_chunks_exact (line 10597) | fn test_mut_chunks_exact() { function test_mut_chunks_exact_rev (line 10610) | fn test_mut_chunks_exact_rev() { function test_mut_chunks_exact_0 (line 10623) | fn test_mut_chunks_exact_0() { function test_mut_rchunks (line 10629) | fn test_mut_rchunks() { function test_mut_rchunks_rev (line 10642) | fn test_mut_rchunks_rev() { function test_mut_rchunks_0 (line 10655) | fn test_mut_rchunks_0() { function test_mut_rchunks_exact (line 10661) | fn test_mut_rchunks_exact() { function test_mut_rchunks_exact_rev (line 10674) | fn test_mut_rchunks_exact_rev() { function test_mut_rchunks_exact_0 (line 10687) | fn test_mut_rchunks_exact_0() { function test_mut_last (line 10693) | fn test_mut_last() { function test_to_vec (line 10703) | fn test_to_vec() { function test_in_place_iterator_specialization (line 10710) | fn test_in_place_iterator_specialization() { function test_box_slice_clone (line 10719) | fn test_box_slice_clone() { function test_box_slice_clone_panics (line 10729) | fn test_box_slice_clone_panics() { function test_copy_from_slice (line 10773) | fn test_copy_from_slice() { function test_copy_from_slice_dst_longer (line 10782) | fn test_copy_from_slice_dst_longer() { function test_copy_from_slice_dst_shorter (line 10790) | fn test_copy_from_slice_dst_shorter() { constant MAX_LEN (line 10796) | const MAX_LEN: usize = 80; type DropCounter (line 10885) | struct DropCounter { method eq (line 10892) | fn eq(&self, other: &Self) -> bool { method partial_cmp (line 10898) | fn partial_cmp(&self, other: &Self) -> Option { method cmp (line 10907) | fn cmp(&self, other: &Self) -> Ordering { method drop (line 10913) | fn drop(&mut self) { function panic_safe (line 10970) | fn panic_safe() { function repeat_generic_slice (line 11022) | fn repeat_generic_slice() { function subslice_patterns (line 11031) | fn subslice_patterns() { function test_group_by (line 11149) | fn test_group_by() { function test_group_by_mut (line 11178) | fn test_group_by_mut() { function test_simple (line 11218) | fn test_simple() { function test_parameterized (line 11252) | fn test_parameterized(a: T, b: T, c: T, d:... function test_push_front_grow (line 11283) | fn test_push_front_grow() { function test_index (line 11305) | fn test_index() { function test_index_out_of_bounds (line 11315) | fn test_index_out_of_bounds() { function test_range_start_overflow (line 11325) | fn test_range_start_overflow() { function test_range_end_overflow (line 11332) | fn test_range_end_overflow() { type Taggy (line 11338) | enum Taggy { type Taggypar (line 11345) | enum Taggypar { type RecCy (line 11352) | struct RecCy { function test_param_int (line 11359) | fn test_param_int() { function test_param_taggy (line 11364) | fn test_param_taggy() { function test_param_taggypar (line 11369) | fn test_param_taggypar() { function test_param_reccy (line 11379) | fn test_param_reccy() { function test_with_capacity (line 11388) | fn test_with_capacity() { function test_with_capacity_non_power_two (line 11398) | fn test_with_capacity_non_power_two() { function test_reserve_exact (line 11439) | fn test_reserve_exact() { function test_reserve (line 11447) | fn test_reserve() { function test_swap (line 11455) | fn test_swap() { function test_iter (line 11463) | fn test_iter() { function test_rev_iter (line 11498) | fn test_rev_iter() { function test_mut_rev_iter_wrap (line 11518) | fn test_mut_rev_iter_wrap() { function test_mut_iter (line 11532) | fn test_mut_iter() { function test_mut_rev_iter (line 11555) | fn test_mut_rev_iter() { function test_into_iter (line 11578) | fn test_into_iter() { function test_drain (line 11636) | fn test_drain() { function test_from_iter (line 11702) | fn test_from_iter() { function test_clone (line 11717) | fn test_clone() { function test_eq (line 11734) | fn test_eq() { function test_partial_eq_array (line 11755) | fn test_partial_eq_array() { function test_hash (line 11774) | fn test_hash() { function test_hash_after_rotation (line 11792) | fn test_hash_after_rotation() { function test_eq_after_rotation (line 11811) | fn test_eq_after_rotation() { function test_ord (line 11838) | fn test_ord() { function test_show (line 11851) | fn test_show() { function test_drop (line 11860) | fn test_drop() { function test_drop_with_pop (line 11882) | fn test_drop_with_pop() { function test_drop_clear (line 11908) | fn test_drop_clear() { function test_drop_panic (line 11932) | fn test_drop_panic() { function test_reserve_grow (line 11965) | fn test_reserve_grow() { function test_get (line 12009) | fn test_get() { function test_get_mut (line 12041) | fn test_get_mut() { function test_front (line 12064) | fn test_front() { function test_as_slices (line 12076) | fn test_as_slices() { function test_as_mut_slices (line 12104) | fn test_as_mut_slices() { function test_append (line 12132) | fn test_append() { function test_append_permutations (line 12153) | fn test_append_permutations() { type DropCounter (line 12228) | struct DropCounter<'a> { method drop (line 12233) | fn drop(&mut self) { function test_append_double_drop (line 12239) | fn test_append_double_drop() { function test_retain (line 12254) | fn test_retain() { function test_extend_ref (line 12263) | fn test_extend_ref() { function test_contains (line 12289) | fn test_contains() { function assert_covariance (line 12302) | fn assert_covariance() { function test_is_empty (line 12309) | fn test_is_empty() { function test_reserve_exact_2 (line 12330) | fn test_reserve_exact_2() { function test_try_reserve (line 12355) | fn test_try_reserve() { function test_try_reserve_exact (line 12470) | fn test_try_reserve_exact() { function test_rotate_nop (line 12565) | fn test_rotate_nop() { function test_rotate_left_parts (line 12623) | fn test_rotate_left_parts() { function test_rotate_right_parts (line 12642) | fn test_rotate_right_parts() { function test_rotate_left_random (line 12661) | fn test_rotate_left_random() { function test_rotate_right_random (line 12679) | fn test_rotate_right_random() { function test_try_fold_empty (line 12697) | fn test_try_fold_empty() { function test_try_fold_none (line 12702) | fn test_try_fold_none() { function test_try_fold_ok (line 12708) | fn test_try_fold_ok() { function test_try_fold_unit (line 12714) | fn test_try_fold_unit() { function test_try_fold_unit_none (line 12720) | fn test_try_fold_unit_none() { function test_try_fold_rotated (line 12728) | fn test_try_fold_rotated() { function test_try_fold_moves_iter (line 12741) | fn test_try_fold_moves_iter() { function test_try_fold_exhaust_wrap (line 12749) | fn test_try_fold_exhaust_wrap() { function test_try_fold_wraparound (line 12762) | fn test_try_fold_wraparound() { function test_try_rfold_rotated (line 12775) | fn test_try_rfold_rotated() { function test_try_rfold_moves_iter (line 12788) | fn test_try_rfold_moves_iter() { function truncate_leak (line 12796) | fn truncate_leak() { function test_drain_leak (line 12829) | fn test_drain_leak() { function test_binary_search (line 12868) | fn test_binary_search() { function test_binary_search_by (line 12891) | fn test_binary_search_by() { function test_binary_search_by_key (line 12899) | fn test_binary_search_by_key() { function test_partition_point (line 12907) | fn test_partition_point() { function test_zero_sized_push (line 12925) | fn test_zero_sized_push() { function test_from_zero_sized_vec (line 12955) | fn test_from_zero_sized_vec() { function test_format (line 12966) | fn test_format() { type A (line 12971) | struct A; method fmt (line 12977) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type B (line 12972) | struct B; method fmt (line 12982) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type C (line 12973) | struct C; method fmt (line 12987) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type D (line 12974) | struct D; method fmt (line 12992) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function test_format_macro_interface (line 13006) | fn test_format_macro_interface() { function test_write (line 13196) | fn test_write() { function test_print (line 13215) | fn test_print() { function test_format_args (line 13226) | fn test_format_args() { function test_order (line 13244) | fn test_order() { function test_once (line 13261) | fn test_once() { function test_refcell (line 13275) | fn test_refcell() { function test_iterator (line 13290) | fn test_iterator() { function test_iter_rev_cloned_collect (line 13302) | fn test_iter_rev_cloned_collect() { function test_into_iter_collect (line 13312) | fn test_into_iter_collect() { function test_into_iter_size_hint (line 13322) | fn test_into_iter_size_hint() { function test_into_iter_rev_collect (line 13339) | fn test_into_iter_rev_collect() { function test_into_iter_sorted_collect (line 13349) | fn test_into_iter_sorted_collect() { function test_drain_sorted_collect (line 13357) | fn test_drain_sorted_collect() { function check_exact_size_iterator (line 13364) | fn check_exact_size_iterator(len: usize, it: I) { function test_exact_size_iterator (line 13379) | fn test_exact_size_iterator() { function check_trusted_len (line 13388) | fn check_trusted_len(len: usize, it: I) { function test_trusted_len (line 13401) | fn test_trusted_len() { function test_peek_and_pop (line 13408) | fn test_peek_and_pop() { function test_peek_mut (line 13420) | fn test_peek_mut() { function test_peek_mut_pop (line 13432) | fn test_peek_mut_pop() { function test_push (line 13445) | fn test_push() { function test_push_unique (line 13467) | fn test_push_unique() { function check_to_vec (line 13488) | fn check_to_vec(mut data: Vec) { function test_to_vec (line 13499) | fn test_to_vec() { function test_in_place_iterator_specialization (line 13516) | fn test_in_place_iterator_specialization() { function test_empty_pop (line 13528) | fn test_empty_pop() { function test_empty_peek (line 13534) | fn test_empty_peek() { function test_empty_peek_mut (line 13540) | fn test_empty_peek_mut() { function test_from_iter (line 13546) | fn test_from_iter() { function test_drain (line 13557) | fn test_drain() { function test_drain_sorted (line 13566) | fn test_drain_sorted() { function test_drain_sorted_leak (line 13575) | fn test_drain_sorted_leak() { function test_extend_ref (line 13606) | fn test_extend_ref() { function test_append (line 13631) | fn test_append() { function test_append_to_empty (line 13642) | fn test_append_to_empty() { function test_extend_specialization (line 13653) | fn test_extend_specialization() { function assert_covariance (line 13663) | fn assert_covariance() { function test_retain (line 13670) | fn test_retain() { function panic_safe (line 13699) | fn panic_safe() { function unitialized_zero_size_box (line 13777) | fn unitialized_zero_size_box() { type Dummy (line 13793) | struct Dummy { function box_clone_and_clone_from_equivalence (line 13798) | fn box_clone_and_clone_from_equivalence() { function box_clone_from_ptr_stability (line 13815) | fn box_clone_from_ptr_stability() { function box_deref_lval (line 13826) | fn box_deref_lval() { function alloc_system_overaligned_request (line 13835) | fn alloc_system_overaligned_request() { function std_heap_overaligned_request (line 13840) | fn std_heap_overaligned_request() { function check_overalign_requests (line 13844) | fn check_overalign_requests(allocator: T) { function __rust_alloc (line 14030) | fn __rust_alloc(size: usize, align: usize) -> *mut u8; function __rust_dealloc (line 14032) | fn __rust_dealloc(ptr: *mut u8, size: usize, align: usize); function __rust_realloc (line 14034) | fn __rust_realloc(ptr: *mut u8, old_size: usize, align: usize, new_size:... function __rust_alloc_zeroed (line 14036) | fn __rust_alloc_zeroed(size: usize, align: usize) -> *mut u8; type Global (line 14050) | pub struct Global; method alloc_impl (line 14161) | fn alloc_impl(&self, layout: Layout, zeroed: bool) -> Result *mut u8 { function dealloc (line 14103) | pub unsafe fn dealloc(ptr: *mut u8, layout: Layout) { function realloc (line 14121) | pub unsafe fn realloc(ptr: *mut u8, layout: Layout, new_size: usize) -> ... function alloc_zeroed (line 14154) | pub unsafe fn alloc_zeroed(layout: Layout) -> *mut u8 { method allocate (line 14225) | fn allocate(&self, layout: Layout) -> Result, AllocError> { method allocate_zeroed (line 14230) | fn allocate_zeroed(&self, layout: Layout) -> Result, Alloc... method deallocate (line 14235) | unsafe fn deallocate(&self, ptr: NonNull, layout: Layout) { method grow (line 14244) | unsafe fn grow( method grow_zeroed (line 14255) | unsafe fn grow_zeroed( method shrink (line 14266) | unsafe fn shrink( function exchange_malloc (line 14314) | unsafe fn exchange_malloc(size: usize, align: usize) -> *mut u8 { function box_free (line 14329) | pub(crate) unsafe fn box_free(ptr: Unique, a... function __rust_alloc_error_handler (line 14345) | fn __rust_alloc_error_handler(size: usize, align: usize) -> !; function handle_alloc_error (line 14364) | pub fn handle_alloc_error(layout: Layout) -> ! { function __rdl_oom (line 14385) | pub unsafe extern "C" fn __rdl_oom(size: usize, _align: usize) -> ! { function __rg_oom (line 14391) | pub unsafe extern "C" fn __rg_oom(size: usize, align: usize) -> ! { type WriteCloneIntoRaw (line 14403) | pub(crate) trait WriteCloneIntoRaw: Sized { method write_clone_into_raw (line 14404) | unsafe fn write_clone_into_raw(&self, target: *mut Self); method write_clone_into_raw (line 14409) | default unsafe fn write_clone_into_raw(&self, target: *mut Self) { method write_clone_into_raw (line 14418) | unsafe fn write_clone_into_raw(&self, target: *mut Self) { type AllocInit (line 14441) | enum AllocInit { type RawVec (line 14471) | pub struct RawVec { constant NEW (line 14483) | pub const NEW: Self = Self::new(); function new (line 14490) | pub const fn new() -> Self { function with_capacity (line 14508) | pub fn with_capacity(capacity: usize) -> Self { function with_capacity_zeroed (line 14514) | pub fn with_capacity_zeroed(capacity: usize) -> Self { function from_raw_parts (line 14527) | pub unsafe fn from_raw_parts(ptr: *mut T, capacity: usize) -> Self { constant MIN_NON_ZERO_CAP (line 14538) | const MIN_NON_ZERO_CAP: usize = if mem::size_of::() == 1 { function new_in (line 14549) | pub const fn new_in(alloc: A) -> Self { function with_capacity_in (line 14557) | pub fn with_capacity_in(capacity: usize, alloc: A) -> Self { function with_capacity_zeroed_in (line 14564) | pub fn with_capacity_zeroed_in(capacity: usize, alloc: A) -> Self { function from_box (line 14569) | pub fn from_box(slice: Box<[T], A>) -> Self { function into_box (line 14588) | pub unsafe fn into_box(self, len: usize) -> Box<[MaybeUninit], A> { function allocate_in (line 14602) | fn allocate_in(capacity: usize, init: AllocInit, alloc: A) -> Self { function from_raw_parts_in (line 14644) | pub unsafe fn from_raw_parts_in(ptr: *mut T, capacity: usize, alloc: A) ... function ptr (line 14652) | pub fn ptr(&self) -> *mut T { function capacity (line 14660) | pub fn capacity(&self) -> usize { function allocator (line 14665) | pub fn allocator(&self) -> &A { function current_memory (line 14669) | fn current_memory(&self) -> Option<(NonNull, Layout)> { function reserve (line 14735) | pub fn reserve(&mut self, len: usize, additional: usize) { function try_reserve (line 14755) | pub fn try_reserve(&mut self, len: usize, additional: usize) -> Result<(... function reserve_exact (line 14780) | pub fn reserve_exact(&mut self, len: usize, additional: usize) { function try_reserve_exact (line 14785) | pub fn try_reserve_exact( function shrink_to_fit (line 14803) | pub fn shrink_to_fit(&mut self, amount: usize) { function needs_to_grow (line 14811) | fn needs_to_grow(&self, len: usize, additional: usize) -> bool { function capacity_from_bytes (line 14815) | fn capacity_from_bytes(excess: usize) -> usize { function set_ptr (line 14820) | fn set_ptr(&mut self, ptr: NonNull<[u8]>) { function grow_amortized (line 14832) | fn grow_amortized(&mut self, len: usize, additional: usize) -> Result<()... function grow_exact (line 14861) | fn grow_exact(&mut self, len: usize, additional: usize) -> Result<(), Tr... function shrink (line 14877) | fn shrink(&mut self, amount: usize) -> Result<(), TryReserveError> { function finish_grow (line 14900) | fn finish_grow( method drop (line 14929) | fn drop(&mut self) { function handle_reserve (line 14938) | fn handle_reserve(result: Result<(), TryReserveError>) { function alloc_guard (line 14956) | fn alloc_guard(alloc_size: usize) -> Result<(), TryReserveError> { function capacity_overflow (line 14967) | fn capacity_overflow() -> ! { type Output (line 15048) | type Output = String; function concat (line 15050) | fn concat(slice: &Self) -> String { type Output (line 15057) | type Output = String; function join (line 15059) | fn join(slice: &Self, sep: &str) -> String { function join_generic_copy (line 15111) | fn join_generic_copy(slice: &[S], sep: &[T]) -> Vec function into_boxed_bytes (line 15210) | pub fn into_boxed_bytes(self: Box) -> Box<[u8]> { function replace (line 15240) | pub fn replace<'a, P: Pattern<'a>>(&'a self, from: P, to: &str) -> String { function replacen (line 15278) | pub fn replacen<'a, P: Pattern<'a>>(&'a self, pat: P, to: &str, count: u... function to_lowercase (line 15331) | pub fn to_lowercase(&self) -> String { function to_uppercase (line 15410) | pub fn to_uppercase(&self) -> String { function into_string (line 15443) | pub fn into_string(self: Box) -> String { function repeat (line 15469) | pub fn repeat(&self, n: usize) -> String { function to_ascii_uppercase (line 15496) | pub fn to_ascii_uppercase(&self) -> String { function to_ascii_lowercase (line 15526) | pub fn to_ascii_lowercase(&self) -> String { function from_boxed_utf8_unchecked (line 15549) | pub unsafe fn from_boxed_utf8_unchecked(v: Box<[u8]>) -> Box { type Canary (line 15570) | struct Canary(*mut atomic::AtomicUsize); method drop (line 15573) | fn drop(&mut self) { function manually_share_arc (line 15586) | fn manually_share_arc() { function test_arc_get_mut (line 15604) | fn test_arc_get_mut() { function weak_counts (line 15617) | fn weak_counts() { function try_unwrap (line 15644) | fn try_unwrap() { function into_from_raw (line 15656) | fn into_from_raw() { function test_into_from_raw_unsized (line 15673) | fn test_into_from_raw_unsized() { function into_from_weak_raw (line 15695) | fn into_from_weak_raw() { function test_into_from_weak_raw_unsized (line 15713) | fn test_into_from_weak_raw_unsized() { function test_cowarc_clone_make_mut (line 15737) | fn test_cowarc_clone_make_mut() { function test_cowarc_clone_unique2 (line 15761) | fn test_cowarc_clone_unique2() { function test_cowarc_clone_weak (line 15783) | fn test_cowarc_clone_weak() { function test_live (line 15797) | fn test_live() { function test_dead (line 15804) | fn test_dead() { function weak_self_cyclic (line 15812) | fn weak_self_cyclic() { function drop_arc (line 15825) | fn drop_arc() { function drop_arc_weak (line 15833) | fn drop_arc_weak() { function test_strong_count (line 15844) | fn test_strong_count() { function test_weak_count (line 15861) | fn test_weak_count() { function show_arc (line 15887) | fn show_arc() { type Foo (line 15894) | struct Foo { function test_unsized (line 15899) | fn test_unsized() { function test_maybe_thin_unsized (line 15908) | fn test_maybe_thin_unsized() { function test_from_owned (line 15925) | fn test_from_owned() { function test_new_weak (line 15932) | fn test_new_weak() { function test_ptr_eq (line 15938) | fn test_ptr_eq() { function test_weak_count_locked (line 15949) | fn test_weak_count_locked() { function test_from_str (line 15971) | fn test_from_str() { function test_copy_from_slice (line 15978) | fn test_copy_from_slice() { function test_clone_from_slice (line 15986) | fn test_clone_from_slice() { function test_clone_from_slice_panic (line 15998) | fn test_clone_from_slice_panic() { function test_from_box (line 16020) | fn test_from_box() { function test_from_box_str (line 16028) | fn test_from_box_str() { function test_from_box_slice (line 16038) | fn test_from_box_slice() { function test_from_box_trait (line 16046) | fn test_from_box_trait() { function test_from_box_trait_zero_sized (line 16057) | fn test_from_box_trait_zero_sized() { function test_from_vec (line 16067) | fn test_from_vec() { function test_downcast (line 16075) | fn test_downcast() { function test_array_from_slice (line 16095) | fn test_array_from_slice() { function test_arc_cyclic_with_zero_refs (line 16107) | fn test_arc_cyclic_with_zero_refs() { function test_arc_new_cyclic_one_ref (line 16124) | fn test_arc_new_cyclic_one_ref() { function test_arc_cyclic_two_refs (line 16145) | fn test_arc_cyclic_two_refs() { type String (line 16450) | pub struct String { method into_cow (line 5632) | fn into_cow(self) -> Cow<'a, str> { method borrow (line 15164) | fn borrow(&self) -> &str { method borrow_mut (line 15172) | fn borrow_mut(&mut self) -> &mut str { method new (line 16536) | pub const fn new() -> String { method with_capacity (line 16581) | pub fn with_capacity(capacity: usize) -> String { method from_str (line 16591) | pub fn from_str(_: &str) -> String { method from_utf8 (line 16653) | pub fn from_utf8(vec: Vec) -> Result { method from_utf8_lossy (line 16710) | pub fn from_utf8_lossy(v: &[u8]) -> Cow<'_, str> { method from_utf16 (line 16762) | pub fn from_utf16(v: &[u16]) -> Result { method from_utf16_lossy (line 16802) | pub fn from_utf16_lossy(v: &[u16]) -> String { method into_raw_parts (line 16833) | pub fn into_raw_parts(self) -> (*mut u8, usize, usize) { method from_raw_parts (line 16884) | pub unsafe fn from_raw_parts(buf: *mut u8, length: usize, capacity: us... method from_utf8_unchecked (line 16918) | pub unsafe fn from_utf8_unchecked(bytes: Vec) -> String { method into_bytes (line 16938) | pub fn into_bytes(self) -> Vec { method as_str (line 16955) | pub fn as_str(&self) -> &str { method as_mut_str (line 16975) | pub fn as_mut_str(&mut self) -> &mut str { method push_str (line 16994) | pub fn push_str(&mut self, string: &str) { method capacity (line 17011) | pub fn capacity(&self) -> usize { method reserve (line 17061) | pub fn reserve(&mut self, additional: usize) { method reserve_exact (line 17108) | pub fn reserve_exact(&mut self, additional: usize) { method try_reserve (line 17143) | pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryRese... method try_reserve_exact (line 17181) | pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), T... method shrink_to_fit (line 17202) | pub fn shrink_to_fit(&mut self) { method shrink_to (line 17229) | pub fn shrink_to(&mut self, min_capacity: usize) { method push (line 17250) | pub fn push(&mut self, ch: char) { method as_bytes (line 17274) | pub fn as_bytes(&self) -> &[u8] { method truncate (line 17303) | pub fn truncate(&mut self, new_len: usize) { method pop (line 17329) | pub fn pop(&mut self) -> Option { method remove (line 17361) | pub fn remove(&mut self, idx: usize) -> char { method remove_matches (line 17397) | pub fn remove_matches<'a, P>(&'a mut self, pat: P) method retain (line 17459) | pub fn retain(&mut self, mut f: F) method insert (line 17528) | pub fn insert(&mut self, idx: usize, ch: char) { method insert_bytes (line 17538) | unsafe fn insert_bytes(&mut self, idx: usize, bytes: &[u8]) { method insert_str (line 17573) | pub fn insert_str(&mut self, idx: usize, string: &str) { method as_mut_vec (line 17607) | pub unsafe fn as_mut_vec(&mut self) -> &mut Vec { method len (line 17630) | pub fn len(&self) -> usize { method is_empty (line 17649) | pub fn is_empty(&self) -> bool { method split_off (line 17679) | pub fn split_off(&mut self, at: usize) -> String { method clear (line 17705) | pub fn clear(&mut self) { method drain (line 17738) | pub fn drain(&mut self, range: R) -> Drain<'_> method replace_range (line 17783) | pub fn replace_range(&mut self, range: R, replace_with: &str) method into_boxed_str (line 17830) | pub fn into_boxed_str(self) -> Box { method from_iter (line 17935) | fn from_iter>(iter: I) -> String { method from_iter (line 17944) | fn from_iter>(iter: I) -> String { method from_iter (line 17953) | fn from_iter>(iter: I) -> String { method from_iter (line 17962) | fn from_iter>(iter: I) -> String { method from_iter (line 17980) | fn from_iter>>(iter: I) -> String { method from_iter (line 17989) | fn from_iter>>(iter: I) -> String { method extend (line 18008) | fn extend>(&mut self, iter: I) { method extend_one (line 18016) | fn extend_one(&mut self, c: char) { method extend_reserve (line 18021) | fn extend_reserve(&mut self, additional: usize) { method extend (line 18028) | fn extend>(&mut self, iter: I) { method extend_one (line 18033) | fn extend_one(&mut self, &c: &'a char) { method extend_reserve (line 18038) | fn extend_reserve(&mut self, additional: usize) { method extend (line 18045) | fn extend>(&mut self, iter: I) { method extend_one (line 18050) | fn extend_one(&mut self, s: &'a str) { method extend (line 18057) | fn extend>>(&mut self, iter: I) { method extend (line 18064) | fn extend>(&mut self, iter: I) { method extend_one (line 18069) | fn extend_one(&mut self, s: String) { method extend (line 18076) | fn extend>>(&mut self, iter: I) { method extend_one (line 18081) | fn extend_one(&mut self, s: Cow<'a, str>) { method fmt (line 18191) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method fmt (line 18199) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method hash (line 18207) | fn hash(&self, hasher: &mut H) { type Output (line 18251) | type Output = String; method add (line 18254) | fn add(mut self, other: &str) -> String { method add_assign (line 18266) | fn add_assign(&mut self, other: &str) { type Output (line 18273) | type Output = str; method index (line 18276) | fn index(&self, index: ops::Range) -> &str { type Output (line 18282) | type Output = str; method index (line 18285) | fn index(&self, index: ops::RangeTo) -> &str { type Output (line 18291) | type Output = str; method index (line 18294) | fn index(&self, index: ops::RangeFrom) -> &str { type Output (line 18300) | type Output = str; method index (line 18303) | fn index(&self, _index: ops::RangeFull) -> &str { type Output (line 18309) | type Output = str; method index (line 18312) | fn index(&self, index: ops::RangeInclusive) -> &str { type Output (line 18318) | type Output = str; method index (line 18321) | fn index(&self, index: ops::RangeToInclusive) -> &str { method index_mut (line 18329) | fn index_mut(&mut self, index: ops::Range) -> &mut str { method index_mut (line 18336) | fn index_mut(&mut self, index: ops::RangeTo) -> &mut str { method index_mut (line 18343) | fn index_mut(&mut self, index: ops::RangeFrom) -> &mut str { method index_mut (line 18350) | fn index_mut(&mut self, _index: ops::RangeFull) -> &mut str { method index_mut (line 18357) | fn index_mut(&mut self, index: ops::RangeInclusive) -> &mut str { method index_mut (line 18364) | fn index_mut(&mut self, index: ops::RangeToInclusive) -> &mut s... type Target (line 18371) | type Target = str; method deref (line 18374) | fn deref(&self) -> &str { method deref_mut (line 18382) | fn deref_mut(&mut self) -> &mut str { method as_ref (line 18489) | fn as_ref(&self) -> &str { method as_mut (line 18497) | fn as_mut(&mut self) -> &mut str { method as_ref (line 18505) | fn as_ref(&self) -> &[u8] { method from (line 18513) | fn from(s: &str) -> String { method from (line 18524) | fn from(s: &mut str) -> String { method from (line 18532) | fn from(s: &String) -> String { method from (line 18555) | fn from(s: Box) -> String { method from (line 18582) | fn from(s: Cow<'a, str>) -> String { method write_str (line 18689) | fn write_str(&mut self, s: &str) -> fmt::Result { method write_char (line 18695) | fn write_char(&mut self, c: char) -> fmt::Result { method from (line 18812) | fn from(c: char) -> Self { type FromUtf8Error (line 16489) | pub struct FromUtf8Error { method as_bytes (line 17852) | pub fn as_bytes(&self) -> &[u8] { method into_bytes (line 17875) | pub fn into_bytes(self) -> Vec { method utf8_error (line 17903) | pub fn utf8_error(&self) -> Utf8Error { method fmt (line 17910) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type FromUtf16Error (line 16512) | pub struct FromUtf16Error(()); method fmt (line 17917) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method clone (line 17924) | fn clone(&self) -> Self { method clone_from (line 17928) | fn clone_from(&mut self, source: &Self) { type Searcher (line 18099) | type Searcher = <&'b str as Pattern<'a>>::Searcher; function into_searcher (line 18101) | fn into_searcher(self, haystack: &'a str) -> <&'b str as Pattern<'a>>::S... function is_contained_in (line 18106) | fn is_contained_in(self, haystack: &'a str) -> bool { function is_prefix_of (line 18111) | fn is_prefix_of(self, haystack: &'a str) -> bool { function strip_prefix_of (line 18116) | fn strip_prefix_of(self, haystack: &'a str) -> Option<&'a str> { function is_suffix_of (line 18121) | fn is_suffix_of(self, haystack: &'a str) -> bool { function strip_suffix_of (line 18126) | fn strip_suffix_of(self, haystack: &'a str) -> Option<&'a str> { method eq (line 18134) | fn eq(&self, other: &String) -> bool { method ne (line 18138) | fn ne(&self, other: &String) -> bool { method default (line 18183) | fn default() -> String { type ParseError (line 18393) | pub type ParseError = core::convert::Infallible; type Err (line 18397) | type Err = core::convert::Infallible; method from_str (line 18399) | fn from_str(s: &str) -> Result { type ToString (line 18414) | pub trait ToString { method to_string (line 18429) | fn to_string(&self) -> String; method to_string (line 18445) | default fn to_string(&self) -> String { method to_string (line 18457) | fn to_string(&self) -> String { method to_string (line 18465) | fn to_string(&self) -> String { method to_string (line 18473) | fn to_string(&self) -> String { method to_string (line 18481) | fn to_string(&self) -> String { function from (line 18575) | fn from(s: String) -> Box { function from (line 18600) | fn from(s: &'a str) -> Cow<'a, str> { function from (line 18620) | fn from(s: String) -> Cow<'a, str> { function from (line 18639) | fn from(s: &'a String) -> Cow<'a, str> { function from_iter (line 18646) | fn from_iter>(it: I) -> Cow<'a, str> { function from_iter (line 18653) | fn from_iter>(it: I) -> Cow<'a, str> { function from_iter (line 18660) | fn from_iter>(it: I) -> Cow<'a, str> { function from (line 18681) | fn from(string: String) -> Vec { type Drain (line 18708) | pub struct Drain<'a> { function fmt (line 18721) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method drop (line 18733) | fn drop(&mut self) { function as_str (line 18759) | pub fn as_str(&self) -> &str { type Item (line 18781) | type Item = char; method next (line 18784) | fn next(&mut self) -> Option { method size_hint (line 18788) | fn size_hint(&self) -> (usize, Option) { method last (line 18793) | fn last(mut self) -> Option { method next_back (line 18801) | fn next_back(&mut self) -> Option { function borrow (line 18838) | fn borrow(&self) -> &B { type ToOwned (line 18851) | pub trait ToOwned { type Owned (line 15179) | type Owned = String; method to_owned (line 15181) | fn to_owned(&self) -> String { method clone_into (line 15185) | fn clone_into(&self, target: &mut String) { method to_owned (line 18871) | fn to_owned(&self) -> Self::Owned; method clone_into (line 18890) | fn clone_into(&self, target: &mut Self::Owned) { type Owned (line 18900) | type Owned = T; method to_owned (line 18901) | fn to_owned(&self) -> T { method clone_into (line 18905) | fn clone_into(&self, target: &mut T) { type Owned (line 22777) | type Owned = Vec; method to_owned (line 22779) | fn to_owned(&self) -> Vec { method to_owned (line 22784) | fn to_owned(&self) -> Vec { method clone_into (line 22788) | fn clone_into(&self, target: &mut Vec) { type Cow (line 18992) | pub enum Cow<'a, B: ?Sized + 'a> method clone (line 19007) | fn clone(&self) -> Self { method clone_from (line 19017) | fn clone_from(&mut self, source: &Self) { function is_borrowed (line 19042) | pub const fn is_borrowed(&self) -> bool { function is_owned (line 19065) | pub const fn is_owned(&self) -> bool { function to_mut (line 19087) | pub fn to_mut(&mut self) -> &mut ::Owned { function into_owned (line 19135) | pub fn into_owned(self) -> ::Owned { type Target (line 19145) | type Target = B; method deref (line 19147) | fn deref(&self) -> &B { method cmp (line 19164) | fn cmp(&self, other: &Self) -> Ordering { function eq (line 19176) | fn eq(&self, other: &Cow<'b, C>) -> bool { method partial_cmp (line 19187) | fn partial_cmp(&self, other: &Cow<'a, B>) -> Option { function fmt (line 19197) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 19210) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method default (line 19224) | fn default() -> Self { method hash (line 19235) | fn hash(&self, state: &mut H) { function as_ref (line 19242) | fn as_ref(&self) -> &T { type Output (line 19249) | type Output = Cow<'a, str>; function add (line 19252) | fn add(mut self, rhs: &'a str) -> Self::Output { type Output (line 19260) | type Output = Cow<'a, str>; function add (line 19263) | fn add(mut self, rhs: Cow<'a, str>) -> Self::Output { function add_assign (line 19271) | fn add_assign(&mut self, rhs: &'a str) { function add_assign (line 19287) | fn add_assign(&mut self, rhs: Cow<'a, str>) { type RcBox (line 19775) | struct RcBox { type Rc (line 19793) | pub struct Rc { function inner (line 19811) | fn inner(&self) -> &RcBox { function from_inner (line 19817) | fn from_inner(ptr: NonNull>) -> Self { function from_ptr (line 19821) | unsafe fn from_ptr(ptr: *mut RcBox) -> Self { function new (line 19837) | pub fn new(value: T) -> Rc { function new_cyclic (line 19872) | pub fn new_cyclic(data_fn: impl FnOnce(&Weak) -> T) -> Rc { function new_uninit (line 19933) | pub fn new_uninit() -> Rc> { function new_zeroed (line 19964) | pub fn new_zeroed() -> Rc> { function try_new (line 19986) | pub fn try_new(value: T) -> Result, AllocError> { function try_new_uninit (line 20021) | pub fn try_new_uninit() -> Result>, AllocError> { function try_new_zeroed (line 20054) | pub fn try_new_zeroed() -> Result>, AllocError> { function pin (line 20066) | pub fn pin(value: T) -> Pin> { function try_unwrap (line 20091) | pub fn try_unwrap(this: Self) -> Result { function new_uninit_slice (line 20136) | pub fn new_uninit_slice(len: usize) -> Rc<[mem::MaybeUninit]> { function new_zeroed_slice (line 20161) | pub fn new_zeroed_slice(len: usize) -> Rc<[mem::MaybeUninit]> { function assume_init (line 20209) | pub unsafe fn assume_init(self) -> Rc { function assume_init (line 20250) | pub unsafe fn assume_init(self) -> Rc<[T]> { function into_raw (line 20273) | pub fn into_raw(this: Self) -> *const T { function as_ptr (line 20296) | pub fn as_ptr(this: &Self) -> *const T { function from_raw (line 20343) | pub unsafe fn from_raw(ptr: *const T) -> Self { function downgrade (line 20365) | pub fn downgrade(this: &Self) -> Weak { function weak_count (line 20386) | pub fn weak_count(this: &Self) -> usize { function strong_count (line 20404) | pub fn strong_count(this: &Self) -> usize { function increment_strong_count (line 20434) | pub unsafe fn increment_strong_count(ptr: *const T) { function decrement_strong_count (line 20471) | pub unsafe fn decrement_strong_count(ptr: *const T) { function is_unique (line 20478) | fn is_unique(this: &Self) -> bool { function get_mut (line 20508) | pub fn get_mut(this: &mut Self) -> Option<&mut T> { function get_mut_unchecked (line 20541) | pub unsafe fn get_mut_unchecked(this: &mut Self) -> &mut T { function ptr_eq (line 20566) | pub fn ptr_eq(this: &Self, other: &Self) -> bool { function make_mut (line 20622) | pub fn make_mut(this: &mut Self) -> &mut T { function downcast (line 20676) | pub fn downcast(self) -> Result, Rc> { function allocate_for_layout (line 20693) | unsafe fn allocate_for_layout( function try_allocate_for_layout (line 20716) | unsafe fn try_allocate_for_layout( function allocate_for_ptr (line 20743) | unsafe fn allocate_for_ptr(ptr: *const T) -> *mut RcBox { function from_box (line 20754) | fn from_box(v: Box) -> Rc { function allocate_for_slice (line 20779) | unsafe fn allocate_for_slice(len: usize) -> *mut RcBox<[T]> { function copy_from_slice (line 20792) | unsafe fn copy_from_slice(v: &[T]) -> Rc<[T]> { function from_iter_exact (line 20803) | unsafe fn from_iter_exact(iter: impl iter::Iterator, len: usiz... type RcFromSlice (line 20850) | trait RcFromSlice { method from_slice (line 20851) | fn from_slice(slice: &[T]) -> Self; function from_slice (line 20856) | default fn from_slice(v: &[T]) -> Self { function from_slice (line 20863) | fn from_slice(v: &[T]) -> Self { type Target (line 20870) | type Target = T; method deref (line 20873) | fn deref(&self) -> &T { method drop (line 20908) | fn drop(&mut self) { method clone (line 20944) | fn clone(&self) -> Rc { method default (line 20963) | fn default() -> Rc { type RcEqIdent (line 20969) | trait RcEqIdent { method eq (line 20970) | fn eq(&self, other: &Rc) -> bool; method ne (line 20971) | fn ne(&self, other: &Rc) -> bool; function eq (line 20977) | default fn eq(&self, other: &Rc) -> bool { function ne (line 20982) | default fn ne(&self, other: &Rc) -> bool { type MarkerEq (line 20989) | pub(crate) trait MarkerEq: PartialEq {} function eq (line 21003) | fn eq(&self, other: &Rc) -> bool { function ne (line 21008) | fn ne(&self, other: &Rc) -> bool { method eq (line 21034) | fn eq(&self, other: &Rc) -> bool { method ne (line 21056) | fn ne(&self, other: &Rc) -> bool { method partial_cmp (line 21081) | fn partial_cmp(&self, other: &Rc) -> Option { method lt (line 21099) | fn lt(&self, other: &Rc) -> bool { method le (line 21117) | fn le(&self, other: &Rc) -> bool { method gt (line 21135) | fn gt(&self, other: &Rc) -> bool { method ge (line 21153) | fn ge(&self, other: &Rc) -> bool { method cmp (line 21175) | fn cmp(&self, other: &Rc) -> Ordering { method hash (line 21182) | fn hash(&self, state: &mut H) { function fmt (line 21189) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 21196) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 21203) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function from (line 21210) | fn from(t: T) -> Self { function from (line 21228) | fn from(v: &[T]) -> Rc<[T]> { function from (line 21245) | fn from(v: &str) -> Rc { function from (line 21264) | fn from(v: String) -> Rc { function from (line 21282) | fn from(v: Box) -> Rc { function from (line 21300) | fn from(mut v: Vec) -> Rc<[T]> { function from (line 21319) | fn from(cow: Cow<'a, B>) -> Rc { type Error (line 21329) | type Error = Rc<[T]>; function try_from (line 21331) | fn try_from(boxed_slice: Rc<[T]>) -> Result { function from_iter (line 21380) | fn from_iter>(iter: I) -> Self { type ToRcSlice (line 21386) | trait ToRcSlice: Iterator + Sized { method to_rc_slice (line 21387) | fn to_rc_slice(self) -> Rc<[T]>; method to_rc_slice (line 21391) | default fn to_rc_slice(self) -> Rc<[T]> { method to_rc_slice (line 21397) | fn to_rc_slice(self) -> Rc<[T]> { type Weak (line 21443) | pub struct Weak { function new (line 21479) | pub fn new() -> Weak { function is_dangling (line 21484) | pub(crate) fn is_dangling(ptr: *mut T) -> bool { type WeakInner (line 21491) | struct WeakInner<'a> { function as_ptr (line 21523) | pub fn as_ptr(&self) -> *const T { function into_raw (line 21566) | pub fn into_raw(self) -> *const T { function from_raw (line 21615) | pub unsafe fn from_raw(ptr: *const T) -> Self { function upgrade (line 21658) | pub fn upgrade(&self) -> Option> { function strong_count (line 21672) | pub fn strong_count(&self) -> usize { function weak_count (line 21680) | pub fn weak_count(&self) -> usize { function inner (line 21695) | fn inner(&self) -> Option> { function ptr_eq (line 21752) | pub fn ptr_eq(&self, other: &Self) -> bool { method drop (line 21783) | fn drop(&mut self) { method clone (line 21811) | fn clone(&self) -> Weak { function fmt (line 21821) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method default (line 21842) | fn default() -> Weak { type RcInnerPtr (line 21857) | trait RcInnerPtr { method weak_ref (line 21858) | fn weak_ref(&self) -> &Cell; method strong_ref (line 21859) | fn strong_ref(&self) -> &Cell; method strong (line 21862) | fn strong(&self) -> usize { method inc_strong (line 21867) | fn inc_strong(&self) { method dec_strong (line 21881) | fn dec_strong(&self) { method weak (line 21886) | fn weak(&self) -> usize { method inc_weak (line 21891) | fn inc_weak(&self) { method dec_weak (line 21905) | fn dec_weak(&self) { method weak_ref (line 21912) | fn weak_ref(&self) -> &Cell { method strong_ref (line 21917) | fn strong_ref(&self) -> &Cell { method weak_ref (line 21924) | fn weak_ref(&self) -> &Cell { method strong_ref (line 21929) | fn strong_ref(&self) -> &Cell { function borrow (line 21936) | fn borrow(&self) -> &T { function as_ref (line 21943) | fn as_ref(&self) -> &T { function data_offset (line 21957) | unsafe fn data_offset(ptr: *const T) -> isize { function data_offset_align (line 21968) | fn data_offset_align(align: usize) -> isize { function into_vec (line 22124) | pub fn into_vec(b: Box<[T], A>) -> Vec { function to_vec (line 22133) | pub fn to_vec(s: &[T], alloc: A) -> Vec(s: &[Self], alloc: A) -> Vec method to_vec (line 22145) | default fn to_vec(s: &[Self], alloc: A) -> Vec { method to_vec (line 22181) | fn to_vec(s: &[Self], alloc: A) -> Vec { function sort (line 22226) | pub fn sort(&mut self) function sort_by (line 22280) | pub fn sort_by(&mut self, mut compare: F) function sort_by_key (line 22320) | pub fn sort_by_key(&mut self, mut f: F) function sort_by_cached_key (line 22362) | pub fn sort_by_cached_key(&mut self, f: F) function to_vec (line 22420) | pub fn to_vec(&self) -> Vec function to_vec_in (line 22442) | pub fn to_vec_in(&self, alloc: A) -> Vec function into_vec (line 22466) | pub fn into_vec(self: Box) -> Vec { function repeat (line 22492) | pub fn repeat(&self, n: usize) -> Vec function concat (line 22559) | pub fn concat(&self) -> >::Output function join (line 22577) | pub fn join(&self, sep: Separator) -> (&self, sep: Separator) -> Vec { function to_ascii_lowercase (line 22635) | pub fn to_ascii_lowercase(&self) -> Vec { type Concat (line 22676) | pub trait Concat { method concat (line 22683) | fn concat(slice: &Self) -> Self::Output; type Join (line 22688) | pub trait Join { method join (line 22695) | fn join(slice: &Self, sep: Separator) -> Self::Output; type Output (line 22700) | type Output = Vec; function concat (line 22702) | fn concat(slice: &Self) -> Vec { type Output (line 22714) | type Output = Vec; function join (line 22716) | fn join(slice: &Self, sep: &T) -> Vec { type Output (line 22736) | type Output = Vec; function join (line 22738) | fn join(slice: &Self, sep: &[T]) -> Vec { function borrow (line 22763) | fn borrow(&self) -> &[T] { function borrow_mut (line 22770) | fn borrow_mut(&mut self) -> &mut [T] { function insert_head (line 22809) | fn insert_head(v: &mut [T], is_less: &mut F) function merge (line 22880) | unsafe fn merge(v: &mut [T], mid: usize, buf: *mut T, is_less: &mu... function merge_sort (line 23000) | fn merge_sort(v: &mut [T], mut is_less: F) type Wake (line 23193) | pub trait Wake { method wake (line 23196) | fn wake(self: Arc); method wake_by_ref (line 23206) | fn wake_by_ref(self: &Arc) { method from (line 23216) | fn from(waker: Arc) -> Waker { method from (line 23228) | fn from(waker: Arc) -> RawWaker { function raw_waker (line 23239) | fn raw_waker(waker: Arc) -> RawWaker { constant MAX_REFCOUNT (line 23311) | const MAX_REFCOUNT: usize = (isize::MAX) as usize; type Arc (line 23495) | pub struct Arc { function from_inner (line 23512) | fn from_inner(ptr: NonNull>) -> Self { function from_ptr (line 23516) | unsafe fn from_ptr(ptr: *mut ArcInner) -> Self { type Weak (line 23542) | pub struct Weak { function fmt (line 23564) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type ArcInner (line 23573) | struct ArcInner { function new (line 23599) | pub fn new(data: T) -> Arc { function new_cyclic (line 23632) | pub fn new_cyclic(data_fn: impl FnOnce(&Weak) -> T) -> Arc { function new_uninit (line 23705) | pub fn new_uninit() -> Arc> { function new_zeroed (line 23736) | pub fn new_zeroed() -> Arc> { function pin (line 23749) | pub fn pin(data: T) -> Pin> { function try_new (line 23766) | pub fn try_new(data: T) -> Result, AllocError> { function try_new_uninit (line 23802) | pub fn try_new_uninit() -> Result>, AllocError> { function try_new_zeroed (line 23835) | pub fn try_new_zeroed() -> Result>, AllocError> { function try_unwrap (line 23865) | pub fn try_unwrap(this: Self) -> Result { function new_uninit_slice (line 23909) | pub fn new_uninit_slice(len: usize) -> Arc<[mem::MaybeUninit]> { function new_zeroed_slice (line 23934) | pub fn new_zeroed_slice(len: usize) -> Arc<[mem::MaybeUninit]> { function assume_init (line 23982) | pub unsafe fn assume_init(self) -> Arc { function assume_init (line 24023) | pub unsafe fn assume_init(self) -> Arc<[T]> { function into_raw (line 24044) | pub fn into_raw(this: Self) -> *const T { function as_ptr (line 24067) | pub fn as_ptr(this: &Self) -> *const T { function from_raw (line 24114) | pub unsafe fn from_raw(ptr: *const T) -> Self { function downgrade (line 24137) | pub fn downgrade(this: &Self) -> Weak { function weak_count (line 24190) | pub fn weak_count(this: &Self) -> usize { function strong_count (line 24219) | pub fn strong_count(this: &Self) -> usize { function increment_strong_count (line 24251) | pub unsafe fn increment_strong_count(ptr: *const T) { function decrement_strong_count (line 24290) | pub unsafe fn decrement_strong_count(ptr: *const T) { function inner (line 24295) | fn inner(&self) -> &ArcInner { function drop_slow (line 24306) | unsafe fn drop_slow(&mut self) { function ptr_eq (line 24334) | pub fn ptr_eq(this: &Self, other: &Self) -> bool { function allocate_for_layout (line 24345) | unsafe fn allocate_for_layout( function try_allocate_for_layout (line 24367) | unsafe fn try_allocate_for_layout( function allocate_for_ptr (line 24393) | unsafe fn allocate_for_ptr(ptr: *const T) -> *mut ArcInner { function from_box (line 24404) | fn from_box(v: Box) -> Arc { function allocate_for_slice (line 24429) | unsafe fn allocate_for_slice(len: usize) -> *mut ArcInner<[T]> { function copy_from_slice (line 24442) | unsafe fn copy_from_slice(v: &[T]) -> Arc<[T]> { function from_iter_exact (line 24455) | unsafe fn from_iter_exact(iter: impl iter::Iterator, len: usiz... type ArcFromSlice (line 24502) | trait ArcFromSlice { method from_slice (line 24503) | fn from_slice(slice: &[T]) -> Self; function from_slice (line 24508) | default fn from_slice(v: &[T]) -> Self { function from_slice (line 24515) | fn from_slice(v: &[T]) -> Self { method clone (line 24537) | fn clone(&self) -> Arc { type Target (line 24570) | type Target = T; method deref (line 24573) | fn deref(&self) -> &T { function make_mut (line 24616) | pub fn make_mut(this: &mut Self) -> &mut T { function get_mut (line 24697) | pub fn get_mut(this: &mut Self) -> Option<&mut T> { function get_mut_unchecked (line 24739) | pub unsafe fn get_mut_unchecked(this: &mut Self) -> &mut T { function is_unique (line 24749) | fn is_unique(&mut self) -> bool { method drop (line 24802) | fn drop(&mut self) { function downcast (line 24867) | pub fn downcast(self) -> Result, Self> function new (line 24896) | pub fn new() -> Weak { type WeakInner (line 24903) | struct WeakInner<'a> { function as_ptr (line 24935) | pub fn as_ptr(&self) -> *const T { function into_raw (line 24978) | pub fn into_raw(self) -> *const T { function from_raw (line 25027) | pub unsafe fn from_raw(ptr: *const T) -> Self { function upgrade (line 25072) | pub fn upgrade(&self) -> Option> { function strong_count (line 25109) | pub fn strong_count(&self) -> usize { function weak_count (line 25125) | pub fn weak_count(&self) -> usize { function inner (line 25147) | fn inner(&self) -> Option> { function ptr_eq (line 25204) | pub fn ptr_eq(&self, other: &Self) -> bool { method clone (line 25223) | fn clone(&self) -> Weak { method default (line 25260) | fn default() -> Weak { method drop (line 25291) | fn drop(&mut self) { type ArcEqIdent (line 25310) | trait ArcEqIdent { method eq (line 25311) | fn eq(&self, other: &Arc) -> bool; method ne (line 25312) | fn ne(&self, other: &Arc) -> bool; function eq (line 25318) | default fn eq(&self, other: &Arc) -> bool { function ne (line 25322) | default fn ne(&self, other: &Arc) -> bool { function eq (line 25337) | fn eq(&self, other: &Arc) -> bool { function ne (line 25342) | fn ne(&self, other: &Arc) -> bool { method eq (line 25367) | fn eq(&self, other: &Arc) -> bool { method ne (line 25388) | fn ne(&self, other: &Arc) -> bool { method partial_cmp (line 25409) | fn partial_cmp(&self, other: &Arc) -> Option { method lt (line 25426) | fn lt(&self, other: &Arc) -> bool { method le (line 25443) | fn le(&self, other: &Arc) -> bool { method gt (line 25460) | fn gt(&self, other: &Arc) -> bool { method ge (line 25477) | fn ge(&self, other: &Arc) -> bool { method cmp (line 25497) | fn cmp(&self, other: &Arc) -> Ordering { function fmt (line 25506) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 25513) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 25520) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method default (line 25537) | fn default() -> Arc { method hash (line 25544) | fn hash(&self, state: &mut H) { function from (line 25551) | fn from(t: T) -> Self { function from (line 25569) | fn from(v: &[T]) -> Arc<[T]> { function from (line 25586) | fn from(v: &str) -> Arc { function from (line 25605) | fn from(v: String) -> Arc { function from (line 25623) | fn from(v: Box) -> Arc { function from (line 25641) | fn from(mut v: Vec) -> Arc<[T]> { function from (line 25660) | fn from(cow: Cow<'a, B>) -> Arc { type Error (line 25670) | type Error = Arc<[T]>; function try_from (line 25672) | fn try_from(boxed_slice: Arc<[T]>) -> Result { function from_iter (line 25721) | fn from_iter>(iter: I) -> Self { type ToArcSlice (line 25727) | trait ToArcSlice: Iterator + Sized { method to_arc_slice (line 25728) | fn to_arc_slice(self) -> Arc<[T]>; method to_arc_slice (line 25732) | default fn to_arc_slice(self) -> Arc<[T]> { method to_arc_slice (line 25738) | fn to_arc_slice(self) -> Arc<[T]> { function borrow (line 25765) | fn borrow(&self) -> &T { function as_ref (line 25772) | fn as_ref(&self) -> &T { function data_offset (line 25786) | unsafe fn data_offset(ptr: *const T) -> isize { function data_offset_align (line 25797) | fn data_offset_align(align: usize) -> isize { function format (line 26378) | pub fn format(args: Arguments<'_>) -> string::String { function test_clone (line 26395) | fn test_clone() { function test_simple (line 26403) | fn test_simple() { function test_simple_clone (line 26409) | fn test_simple_clone() { function test_destructor (line 26417) | fn test_destructor() { function test_live (line 26423) | fn test_live() { function test_dead (line 26430) | fn test_dead() { function weak_self_cyclic (line 26438) | fn weak_self_cyclic() { function is_unique (line 26451) | fn is_unique() { function test_strong_count (line 26465) | fn test_strong_count() { function test_weak_count (line 26482) | fn test_weak_count() { function weak_counts (line 26499) | fn weak_counts() { function try_unwrap (line 26526) | fn try_unwrap() { function into_from_raw (line 26538) | fn into_from_raw() { function test_into_from_raw_unsized (line 26555) | fn test_into_from_raw_unsized() { function into_from_weak_raw (line 26577) | fn into_from_weak_raw() { function test_into_from_weak_raw_unsized (line 26595) | fn test_into_from_weak_raw_unsized() { function get_mut (line 26619) | fn get_mut() { function test_cowrc_clone_make_unique (line 26632) | fn test_cowrc_clone_make_unique() { function test_cowrc_clone_unique2 (line 26656) | fn test_cowrc_clone_unique2() { function test_cowrc_clone_weak (line 26679) | fn test_cowrc_clone_weak() { function test_show (line 26693) | fn test_show() { function test_unsized (line 26699) | fn test_unsized() { function test_maybe_thin_unsized (line 26705) | fn test_maybe_thin_unsized() { function test_from_owned (line 26722) | fn test_from_owned() { function test_new_weak (line 26729) | fn test_new_weak() { function test_ptr_eq (line 26735) | fn test_ptr_eq() { function test_from_str (line 26745) | fn test_from_str() { function test_copy_from_slice (line 26752) | fn test_copy_from_slice() { function test_clone_from_slice (line 26760) | fn test_clone_from_slice() { function test_clone_from_slice_panic (line 26772) | fn test_clone_from_slice_panic() { function test_from_box (line 26794) | fn test_from_box() { function test_from_box_str (line 26802) | fn test_from_box_str() { function test_from_box_slice (line 26812) | fn test_from_box_slice() { function test_from_box_trait (line 26820) | fn test_from_box_trait() { function test_from_box_trait_zero_sized (line 26831) | fn test_from_box_trait_zero_sized() { function test_from_vec (line 26841) | fn test_from_vec() { function test_downcast (line 26849) | fn test_downcast() { function test_array_from_slice (line 26869) | fn test_array_from_slice() { function test_rc_cyclic_with_zero_refs (line 26881) | fn test_rc_cyclic_with_zero_refs() { function test_rc_cyclic_with_one_ref (line 26899) | fn test_rc_cyclic_with_one_ref() { function test_rc_cyclic_with_two_ref (line 26921) | fn test_rc_cyclic_with_two_ref() { type LinkedList (line 26983) | pub struct LinkedList { type Node (line 26990) | struct Node { type Iter (line 27001) | pub struct Iter<'a, T: 'a> { function fmt (line 27010) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method clone (line 27018) | fn clone(&self) -> Self { type IterMut (line 27028) | pub struct IterMut<'a, T: 'a> { function fmt (line 27040) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type IntoIter (line 27053) | pub struct IntoIter { function fmt (line 27059) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function new (line 27065) | fn new(element: T) -> Self { function into_element (line 27069) | fn into_element(self: Box) -> T { function push_front_node (line 27078) | fn push_front_node(&mut self, mut node: Box>) { function pop_front_node (line 27099) | fn pop_front_node(&mut self) -> Option>> { function push_back_node (line 27119) | fn push_back_node(&mut self, mut node: Box>) { function pop_back_node (line 27140) | fn pop_back_node(&mut self) -> Option>> { function unlink_node (line 27165) | unsafe fn unlink_node(&mut self, mut node: NonNull>) { function splice_nodes (line 27188) | unsafe fn splice_nodes( function detach_all_nodes (line 27222) | fn detach_all_nodes(mut self) -> Option<(NonNull>, NonNull Self { function new (line 27336) | pub const fn new() -> Self { function append (line 27370) | pub fn append(&mut self, other: &mut Self) { function prepend (line 27391) | pub fn prepend(&mut self, other: &mut Self) { function iter (line 27431) | pub fn iter(&self) -> Iter<'_, T> { function iter_mut (line 27460) | pub fn iter_mut(&mut self) -> IterMut<'_, T> { function cursor_front (line 27469) | pub fn cursor_front(&self) -> Cursor<'_, T> { function cursor_front_mut (line 27478) | pub fn cursor_front_mut(&mut self) -> CursorMut<'_, T> { function cursor_back (line 27487) | pub fn cursor_back(&self) -> Cursor<'_, T> { function cursor_back_mut (line 27496) | pub fn cursor_back_mut(&mut self) -> CursorMut<'_, T> { function is_empty (line 27517) | pub fn is_empty(&self) -> bool { function len (line 27544) | pub fn len(&self) -> usize { function clear (line 27570) | pub fn clear(&mut self) { function contains (line 27592) | pub fn contains(&self, x: &T) -> bool function front (line 27615) | pub fn front(&self) -> Option<&T> { function front_mut (line 27641) | pub fn front_mut(&mut self) -> Option<&mut T> { function back (line 27661) | pub fn back(&self) -> Option<&T> { function back_mut (line 27687) | pub fn back_mut(&mut self) -> Option<&mut T> { function push_front (line 27709) | pub fn push_front(&mut self, elt: T) { function pop_front (line 27733) | pub fn pop_front(&mut self) -> Option { function push_back (line 27752) | pub fn push_back(&mut self, elt: T) { function pop_back (line 27773) | pub fn pop_back(&mut self) -> Option { function split_off (line 27803) | pub fn split_off(&mut self, at: usize) -> LinkedList { function remove (line 27858) | pub fn remove(&mut self, at: usize) -> T { function drain_filter (line 27907) | pub fn drain_filter(&mut self, filter: F) -> DrainFilter<'_, T, F> method drop (line 27921) | fn drop(&mut self) { type Item (line 27942) | type Item = &'a T; method next (line 27945) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 27960) | fn size_hint(&self) -> (usize, Option) { method last (line 27965) | fn last(mut self) -> Option<&'a T> { method next_back (line 27973) | fn next_back(&mut self) -> Option<&'a T> { type Item (line 27996) | type Item = &'a mut T; method next (line 27999) | fn next(&mut self) -> Option<&'a mut T> { method size_hint (line 28014) | fn size_hint(&self) -> (usize, Option) { method last (line 28019) | fn last(mut self) -> Option<&'a mut T> { method next_back (line 28027) | fn next_back(&mut self) -> Option<&'a mut T> { type Cursor (line 28058) | pub struct Cursor<'a, T: 'a> { method clone (line 28066) | fn clone(&self) -> Self { function fmt (line 28074) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type CursorMut (line 28090) | pub struct CursorMut<'a, T: 'a> { function fmt (line 28098) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function index (line 28109) | pub fn index(&self) -> Option { function move_next (line 28120) | pub fn move_next(&mut self) { function move_prev (line 28142) | pub fn move_prev(&mut self) { function current (line 28163) | pub fn current(&self) -> Option<&'a T> { function peek_next (line 28173) | pub fn peek_next(&self) -> Option<&'a T> { function peek_prev (line 28189) | pub fn peek_prev(&self) -> Option<&'a T> { function index (line 28206) | pub fn index(&self) -> Option { function move_next (line 28217) | pub fn move_next(&mut self) { function move_prev (line 28239) | pub fn move_prev(&mut self) { function current (line 28260) | pub fn current(&mut self) -> Option<&mut T> { function peek_next (line 28270) | pub fn peek_next(&mut self) -> Option<&mut T> { function peek_prev (line 28286) | pub fn peek_prev(&mut self) -> Option<&mut T> { function as_cursor (line 28302) | pub fn as_cursor(&self) -> Cursor<'_, T> { function insert_after (line 28315) | pub fn insert_after(&mut self, item: T) { function insert_before (line 28335) | pub fn insert_before(&mut self, item: T) { function remove_current (line 28355) | pub fn remove_current(&mut self) -> Option { function remove_current_as_list (line 28373) | pub fn remove_current_as_list(&mut self) -> Option> { function splice_after (line 28395) | pub fn splice_after(&mut self, list: LinkedList) { function splice_before (line 28418) | pub fn splice_before(&mut self, list: LinkedList) { function split_after (line 28440) | pub fn split_after(&mut self) -> LinkedList { function split_before (line 28456) | pub fn split_before(&mut self) -> LinkedList { type DrainFilter (line 28465) | pub struct DrainFilter<'a, T: 'a, F: 'a> type Item (line 28481) | type Item = T; method next (line 28483) | fn next(&mut self) -> Option { method size_hint (line 28500) | fn size_hint(&self) -> (usize, Option) { method drop (line 28510) | fn drop(&mut self) { function fmt (line 28537) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Item (line 28544) | type Item = T; method next (line 28547) | fn next(&mut self) -> Option { method size_hint (line 28552) | fn size_hint(&self) -> (usize, Option) { method next_back (line 28560) | fn next_back(&mut self) -> Option { function from_iter (line 28573) | fn from_iter>(iter: I) -> Self { type Item (line 28582) | type Item = T; type IntoIter (line 28583) | type IntoIter = IntoIter; method into_iter (line 28587) | fn into_iter(self) -> IntoIter { type Item (line 28594) | type Item = &'a T; type IntoIter (line 28595) | type IntoIter = Iter<'a, T>; method into_iter (line 28597) | fn into_iter(self) -> Iter<'a, T> { type Item (line 28604) | type Item = &'a mut T; type IntoIter (line 28605) | type IntoIter = IterMut<'a, T>; method into_iter (line 28607) | fn into_iter(self) -> IterMut<'a, T> { function extend (line 28614) | fn extend>(&mut self, iter: I) { function extend_one (line 28619) | fn extend_one(&mut self, elem: T) { function spec_extend (line 28625) | default fn spec_extend(&mut self, iter: I) { function spec_extend (line 28631) | fn spec_extend(&mut self, ref mut other: LinkedList) { function extend (line 28638) | fn extend>(&mut self, iter: I) { function extend_one (line 28643) | fn extend_one(&mut self, &elem: &'a T) { method eq (line 28650) | fn eq(&self, other: &Self) -> bool { method ne (line 28654) | fn ne(&self, other: &Self) -> bool { method partial_cmp (line 28664) | fn partial_cmp(&self, other: &Self) -> Option { method cmp (line 28672) | fn cmp(&self, other: &Self) -> Ordering { method clone (line 28679) | fn clone(&self) -> Self { method clone_from (line 28683) | fn clone_from(&mut self, other: &Self) { function fmt (line 28699) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method hash (line 28706) | fn hash(&self, state: &mut H) { function assert_covariance (line 28716) | fn assert_covariance() { function list_from (line 28764) | fn list_from(v: &[T]) -> LinkedList { function check_links (line 28768) | pub fn check_links(list: &LinkedList) { function test_append (line 28813) | fn test_append() { function test_clone_from (line 28870) | fn test_clone_from() { function test_send (line 28914) | fn test_send() { function test_fuzz (line 28927) | fn test_fuzz() { function test_26021 (line 28937) | fn test_26021() { function test_split_off (line 28956) | fn test_split_off() { function fuzz_test (line 28974) | fn fuzz_test(sz: i32) { function drain_filter_test (line 29013) | fn drain_filter_test() { function drain_to_empty_test (line 29025) | fn drain_to_empty_test() { function test_cursor_move_peek (line 29037) | fn test_cursor_move_peek() { function test_cursor_mut_insert (line 29130) | fn test_cursor_mut_insert() { function append_from_sorted_iters (line 29203) | pub fn append_from_sorted_iters(&mut self, left: I, right: I, length:... function bulk_push (line 29218) | pub fn bulk_push(&mut self, iter: I, length: &mut usize) type MergeIter (line 29274) | struct MergeIter>(MergeIterInner); type Item (line 29280) | type Item = (K, V); method next (line 29283) | fn next(&mut self) -> Option<(K, V)> { type CrashTestDummy (line 29300) | pub struct CrashTestDummy { method new (line 29309) | pub fn new(id: usize) -> CrashTestDummy { method spawn (line 29320) | pub fn spawn(&self, panic: Panic) -> Instance<'_> { method cloned (line 29325) | pub fn cloned(&self) -> usize { method dropped (line 29330) | pub fn dropped(&self) -> usize { method queried (line 29335) | pub fn queried(&self) -> usize { type Instance (line 29341) | pub struct Instance<'a> { type Panic (line 29347) | pub enum Panic { function id (line 29355) | pub fn id(&self) -> usize { function query (line 29360) | pub fn query(&self, result: R) -> R { method clone (line 29370) | fn clone(&self) -> Self { method drop (line 29380) | fn drop(&mut self) { method partial_cmp (line 29389) | fn partial_cmp(&self, other: &Self) -> Option { method cmp (line 29395) | fn cmp(&self, other: &Self) -> Ordering { method eq (line 29401) | fn eq(&self, other: &Self) -> bool { type DeterministicRng (line 29408) | pub struct DeterministicRng { method new (line 29417) | pub fn new() -> Self { method next (line 29422) | pub fn next(&mut self) -> u32 { type Cyclic3 (line 29441) | pub enum Cyclic3 { method partial_cmp (line 29449) | fn partial_cmp(&self, other: &Self) -> Option { method cmp (line 29455) | fn cmp(&self, other: &Self) -> Ordering { method eq (line 29465) | fn eq(&self, other: &Self) -> bool { type Governor (line 29474) | pub struct Governor { method new (line 29479) | pub fn new() -> Self { method flip (line 29483) | pub fn flip(&self) { type Governed (line 29492) | pub struct Governed<'a, T>(pub T, pub &'a Governor); method partial_cmp (line 29495) | fn partial_cmp(&self, other: &Self) -> Option { method cmp (line 29501) | fn cmp(&self, other: &Self) -> Ordering { method eq (line 29509) | fn eq(&self, other: &Self) -> bool { type SearchBound (line 29528) | pub enum SearchBound { function from_range (line 29540) | pub fn from_range(range_bound: Bound) -> Self { type SearchResult (line 29549) | pub enum SearchResult { type IndexResult (line 29554) | pub enum IndexResult { function search_tree (line 29566) | pub fn search_tree( function search_tree_for_bifurcation (line 29600) | pub fn search_tree_for_bifurcation<'r, Q: ?Sized, R>( function find_lower_bound_edge (line 29665) | pub fn find_lower_bound_edge<'r, Q>( function find_upper_bound_edge (line 29679) | pub fn find_upper_bound_edge<'r, Q>( function search_node (line 29701) | pub fn search_node(self, key: &Q) -> SearchResult(&self, key: &Q, start_index: usize) ... function find_lower_bound_index (line 29743) | fn find_lower_bound_index<'r, Q>( function find_upper_bound_index (line 29770) | unsafe fn find_upper_bound_index<'r, Q>( constant MIN_LEN (line 29814) | pub(super) const MIN_LEN: usize = node::MIN_LEN_AFTER_SPLIT; type BTreeMap (line 29935) | pub struct BTreeMap { method drop (line 29942) | fn drop(&mut self) { method clone (line 29951) | fn clone(&self) -> BTreeMap { type Key (line 30031) | type Key = K; function get (line 30033) | fn get(&self, key: &Q) -> Option<&K> { function take (line 30041) | fn take(&mut self, key: &Q) -> Option { function replace (line 30052) | fn replace(&mut self, key: K) -> Option { type Iter (line 30072) | pub struct Iter<'a, K: 'a, V: 'a> { function fmt (line 30079) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type IterMut (line 30092) | pub struct IterMut<'a, K: 'a, V: 'a> { type IntoIter (line 30104) | pub struct IntoIter { function iter (line 30112) | pub(super) fn iter(&self) -> Iter<'_, K, V> { function fmt (line 30120) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Dropper (line 30128) | struct Dropper { type Keys (line 30140) | pub struct Keys<'a, K: 'a, V: 'a> { function fmt (line 30146) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Values (line 30158) | pub struct Values<'a, K: 'a, V: 'a> { function fmt (line 30164) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type ValuesMut (line 30176) | pub struct ValuesMut<'a, K: 'a, V: 'a> { function fmt (line 30182) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type IntoKeys (line 30194) | pub struct IntoKeys { function fmt (line 30200) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type IntoValues (line 30212) | pub struct IntoValues { function fmt (line 30218) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Range (line 30230) | pub struct Range<'a, K: 'a, V: 'a> { function fmt (line 30236) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type RangeMut (line 30248) | pub struct RangeMut<'a, K: 'a, V: 'a> { function fmt (line 30257) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function new (line 30282) | pub const fn new() -> BTreeMap function clear (line 30304) | pub fn clear(&mut self) { function get (line 30326) | pub fn get(&self, key: &Q) -> Option<&V> function get_key_value (line 30354) | pub fn get_key_value(&self, k: &Q) -> Option<(&K, &V)> function first_key_value (line 30384) | pub fn first_key_value(&self) -> Option<(&K, &V)> function first_entry (line 30413) | pub fn first_entry(&mut self) -> Option> function pop_first (line 30443) | pub fn pop_first(&mut self) -> Option<(K, V)> function last_key_value (line 30467) | pub fn last_key_value(&self) -> Option<(&K, &V)> function last_entry (line 30496) | pub fn last_entry(&mut self) -> Option> function pop_last (line 30526) | pub fn pop_last(&mut self) -> Option<(K, V)> function contains_key (line 30551) | pub fn contains_key(&self, key: &Q) -> bool function get_mut (line 30580) | pub fn get_mut(&mut self, key: &Q) -> Option<&mut V> function insert (line 30619) | pub fn insert(&mut self, key: K, value: V) -> Option function try_insert (line 30656) | pub fn try_insert(&mut self, key: K, value: V) -> Result<&mut V, Occupie... function remove (line 30686) | pub fn remove(&mut self, key: &Q) -> Option function remove_entry (line 30713) | pub fn remove_entry(&mut self, key: &Q) -> Option<(K, V)> function retain (line 30744) | pub fn retain(&mut self, mut f: F) function append (line 30781) | pub fn append(&mut self, other: &mut Self) function range (line 30832) | pub fn range(&self, range: R) -> Range<'_, K, V> function range_mut (line 30876) | pub fn range_mut(&mut self, range: R) -> RangeMut<'_, K, V> function entry (line 30908) | pub fn entry(&mut self, key: K) -> Entry<'_, K, V> function split_off (line 30953) | pub fn split_off(&mut self, key: &Q) -> Self function drain_filter (line 31005) | pub fn drain_filter(&mut self, pred: F) -> DrainFilter<'_, K, V, F> function drain_filter_inner (line 31013) | pub(super) fn drain_filter_inner(&mut self) -> DrainFilterInner<'_, K, V> function into_keys (line 31049) | pub fn into_keys(self) -> IntoKeys { function into_values (line 31072) | pub fn into_values(self) -> IntoValues { type Item (line 31079) | type Item = (&'a K, &'a V); type IntoIter (line 31080) | type IntoIter = Iter<'a, K, V>; method into_iter (line 31082) | fn into_iter(self) -> Iter<'a, K, V> { type Item (line 31089) | type Item = (&'a K, &'a V); method next (line 31091) | fn next(&mut self) -> Option<(&'a K, &'a V)> { method size_hint (line 31100) | fn size_hint(&self) -> (usize, Option) { method last (line 31104) | fn last(mut self) -> Option<(&'a K, &'a V)> { method min (line 31108) | fn min(mut self) -> Option<(&'a K, &'a V)> { method max (line 31112) | fn max(mut self) -> Option<(&'a K, &'a V)> { method next_back (line 31122) | fn next_back(&mut self) -> Option<(&'a K, &'a V)> { method len (line 31134) | fn len(&self) -> usize { method clone (line 31141) | fn clone(&self) -> Self { type Item (line 31148) | type Item = (&'a K, &'a mut V); type IntoIter (line 31149) | type IntoIter = IterMut<'a, K, V>; method into_iter (line 31151) | fn into_iter(self) -> IterMut<'a, K, V> { type Item (line 31158) | type Item = (&'a K, &'a mut V); method next (line 31160) | fn next(&mut self) -> Option<(&'a K, &'a mut V)> { method size_hint (line 31169) | fn size_hint(&self) -> (usize, Option) { method last (line 31173) | fn last(mut self) -> Option<(&'a K, &'a mut V)> { method min (line 31177) | fn min(mut self) -> Option<(&'a K, &'a mut V)> { method max (line 31181) | fn max(mut self) -> Option<(&'a K, &'a mut V)> { method next_back (line 31188) | fn next_back(&mut self) -> Option<(&'a K, &'a mut V)> { method len (line 31200) | fn len(&self) -> usize { function iter (line 31211) | pub(super) fn iter(&self) -> Iter<'_, K, V> { type Item (line 31218) | type Item = (K, V); type IntoIter (line 31219) | type IntoIter = IntoIter; method into_iter (line 31221) | fn into_iter(self) -> IntoIter { method drop (line 31234) | fn drop(&mut self) { method drop (line 31266) | fn drop(&mut self) { type Item (line 31275) | type Item = (K, V); method next (line 31277) | fn next(&mut self) -> Option<(K, V)> { method size_hint (line 31286) | fn size_hint(&self) -> (usize, Option) { method next_back (line 31293) | fn next_back(&mut self) -> Option<(K, V)> { method len (line 31305) | fn len(&self) -> usize { type Item (line 31315) | type Item = &'a K; method next (line 31317) | fn next(&mut self) -> Option<&'a K> { method size_hint (line 31321) | fn size_hint(&self) -> (usize, Option) { method last (line 31325) | fn last(mut self) -> Option<&'a K> { method min (line 31329) | fn min(mut self) -> Option<&'a K> { method max (line 31333) | fn max(mut self) -> Option<&'a K> { method next_back (line 31340) | fn next_back(&mut self) -> Option<&'a K> { method len (line 31347) | fn len(&self) -> usize { method clone (line 31357) | fn clone(&self) -> Self { type Item (line 31364) | type Item = &'a V; method next (line 31366) | fn next(&mut self) -> Option<&'a V> { method size_hint (line 31370) | fn size_hint(&self) -> (usize, Option) { method last (line 31374) | fn last(mut self) -> Option<&'a V> { method next_back (line 31381) | fn next_back(&mut self) -> Option<&'a V> { method len (line 31388) | fn len(&self) -> usize { method clone (line 31398) | fn clone(&self) -> Self { type DrainFilter (line 31405) | pub struct DrainFilter<'a, K, V, F> type DrainFilterInner (line 31416) | pub(super) struct DrainFilterInner<'a, K: 'a, V: 'a> { method drop (line 31433) | fn drop(&mut self) { function fmt (line 31445) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Item (line 31455) | type Item = (K, V); method next (line 31457) | fn next(&mut self) -> Option<(K, V)> { method size_hint (line 31461) | fn size_hint(&self) -> (usize, Option) { function peek (line 31468) | pub(super) fn peek(&self) -> Option<(&K, &V)> { function next (line 31474) | pub(super) fn next(&mut self, pred: &mut F) -> Option<(K, V)> function size_hint (line 31498) | pub(super) fn size_hint(&self) -> (usize, Option) { type Item (line 31512) | type Item = (&'a K, &'a V); method next (line 31514) | fn next(&mut self) -> Option<(&'a K, &'a V)> { method last (line 31518) | fn last(mut self) -> Option<(&'a K, &'a V)> { method min (line 31522) | fn min(mut self) -> Option<(&'a K, &'a V)> { method max (line 31526) | fn max(mut self) -> Option<(&'a K, &'a V)> { type Item (line 31533) | type Item = &'a mut V; method next (line 31535) | fn next(&mut self) -> Option<&'a mut V> { method size_hint (line 31539) | fn size_hint(&self) -> (usize, Option) { method last (line 31543) | fn last(mut self) -> Option<&'a mut V> { method next_back (line 31550) | fn next_back(&mut self) -> Option<&'a mut V> { method len (line 31557) | fn len(&self) -> usize { function next_unchecked (line 31566) | unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { type Item (line 31573) | type Item = K; method next (line 31575) | fn next(&mut self) -> Option { method size_hint (line 31579) | fn size_hint(&self) -> (usize, Option) { method last (line 31583) | fn last(mut self) -> Option { method min (line 31587) | fn min(mut self) -> Option { method max (line 31591) | fn max(mut self) -> Option { method next_back (line 31598) | fn next_back(&mut self) -> Option { method len (line 31605) | fn len(&self) -> usize { type Item (line 31615) | type Item = V; method next (line 31617) | fn next(&mut self) -> Option { method size_hint (line 31621) | fn size_hint(&self) -> (usize, Option) { method last (line 31625) | fn last(mut self) -> Option { method next_back (line 31632) | fn next_back(&mut self) -> Option { method len (line 31639) | fn len(&self) -> usize { method next_back (line 31649) | fn next_back(&mut self) -> Option<(&'a K, &'a V)> { function next_back_unchecked (line 31655) | unsafe fn next_back_unchecked(&mut self) -> (&'a K, &'a V) { method clone (line 31665) | fn clone(&self) -> Self { type Item (line 31672) | type Item = (&'a K, &'a mut V); method next (line 31674) | fn next(&mut self) -> Option<(&'a K, &'a mut V)> { method last (line 31678) | fn last(mut self) -> Option<(&'a K, &'a mut V)> { method min (line 31682) | fn min(mut self) -> Option<(&'a K, &'a mut V)> { method max (line 31686) | fn max(mut self) -> Option<(&'a K, &'a mut V)> { function next_unchecked (line 31692) | unsafe fn next_unchecked(&mut self) -> (&'a K, &'a mut V) { function iter (line 31698) | pub(super) fn iter(&self) -> Range<'_, K, V> { method next_back (line 31705) | fn next_back(&mut self) -> Option<(&'a K, &'a mut V)> { function next_back_unchecked (line 31714) | unsafe fn next_back_unchecked(&mut self) -> (&'a K, &'a mut V) { function from_iter (line 31721) | fn from_iter>(iter: T) -> BTreeMap { function extend (line 31731) | fn extend>(&mut self, iter: T) { function extend_one (line 31738) | fn extend_one(&mut self, (k, v): (K, V)) { function extend (line 31745) | fn extend>(&mut self, iter: I) { function extend_one (line 31750) | fn extend_one(&mut self, (&k, &v): (&'a K, &'a V)) { method hash (line 31757) | fn hash(&self, state: &mut H) { method default (line 31767) | fn default() -> BTreeMap { method eq (line 31774) | fn eq(&self, other: &BTreeMap) -> bool { method partial_cmp (line 31785) | fn partial_cmp(&self, other: &BTreeMap) -> Option { method cmp (line 31793) | fn cmp(&self, other: &BTreeMap) -> Ordering { method fmt (line 31800) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Output (line 31811) | type Output = V; function index (line 31819) | fn index(&self, key: &Q) -> &V { function iter (line 31847) | pub fn iter(&self) -> Iter<'_, K, V> { function iter_mut (line 31879) | pub fn iter_mut(&mut self) -> IterMut<'_, K, V> { function keys (line 31912) | pub fn keys(&self) -> Keys<'_, K, V> { function values (line 31933) | pub fn values(&self) -> Values<'_, K, V> { function values_mut (line 31959) | pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> { function len (line 31980) | pub const fn len(&self) -> usize { function is_empty (line 32000) | pub const fn is_empty(&self) -> bool { function ensure_is_owned (line 32006) | fn ensure_is_owned(root: &mut Option>) -> &mut Root { type DormantMutRef (line 32026) | pub struct DormantMutRef<'a, T> { function new (line 32038) | pub fn new(t: &'a mut T) -> (&'a mut T, Self) { function awaken (line 32052) | pub unsafe fn awaken(self) -> &'a mut T { function take_mut (line 32070) | pub fn take_mut(v: &mut T, change: impl FnOnce(T) -> T) { function replace (line 32079) | pub fn replace(v: &mut T, change: impl FnOnce(T) -> (T, R)) -> R { function calc_split_length (line 32102) | pub fn calc_split_length( function split_off (line 32125) | pub fn split_off(&mut self, key: &Q) -> Self function new_pillar (line 32159) | fn new_pillar(height: usize) -> Self { type BTreeSet (line 32231) | pub struct BTreeSet { method clone (line 32237) | fn clone(&self) -> Self { method clone_from (line 32241) | fn clone_from(&mut self, other: &Self) { type Iter (line 32253) | pub struct Iter<'a, T: 'a> { function fmt (line 32259) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type IntoIter (line 32272) | pub struct IntoIter { type Range (line 32284) | pub struct Range<'a, T: 'a> { type Difference (line 32295) | pub struct Difference<'a, T: 'a> { type DifferenceInner (line 32299) | enum DifferenceInner<'a, T: 'a> { function fmt (line 32315) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type SymmetricDifference (line 32327) | pub struct SymmetricDifference<'a, T: 'a>(MergeIterInner>); function fmt (line 32331) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Intersection (line 32343) | pub struct Intersection<'a, T: 'a> { type IntersectionInner (line 32347) | enum IntersectionInner<'a, T: 'a> { function fmt (line 32363) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Union (line 32375) | pub struct Union<'a, T: 'a>(MergeIterInner>); function fmt (line 32379) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { constant ITER_PERFORMANCE_TIPPING_SIZE_DIFF (line 32390) | const ITER_PERFORMANCE_TIPPING_SIZE_DIFF: usize = 16; function new (line 32407) | pub const fn new() -> BTreeSet function range (line 32437) | pub fn range(&self, range: R) -> Range<'_, T> function difference (line 32467) | pub fn difference<'a>(&'a self, other: &'a BTreeSet) -> Difference<'a... function symmetric_difference (line 32528) | pub fn symmetric_difference<'a>(&'a self, other: &'a BTreeSet) -> Sym... function intersection (line 32556) | pub fn intersection<'a>(&'a self, other: &'a BTreeSet) -> Intersectio... function union (line 32607) | pub fn union<'a>(&'a self, other: &'a BTreeSet) -> Union<'a, T> function clear (line 32627) | pub fn clear(&mut self) { function contains (line 32647) | pub fn contains(&self, value: &Q) -> bool function get (line 32671) | pub fn get(&self, value: &Q) -> Option<&T> function is_disjoint (line 32697) | pub fn is_disjoint(&self, other: &BTreeSet) -> bool function is_subset (line 32722) | pub fn is_subset(&self, other: &BTreeSet) -> bool function is_superset (line 32801) | pub fn is_superset(&self, other: &BTreeSet) -> bool function first (line 32827) | pub fn first(&self) -> Option<&T> function last (line 32853) | pub fn last(&self) -> Option<&T> function pop_first (line 32878) | pub fn pop_first(&mut self) -> Option function pop_last (line 32903) | pub fn pop_last(&mut self) -> Option function insert (line 32931) | pub fn insert(&mut self, value: T) -> bool function replace (line 32954) | pub fn replace(&mut self, value: T) -> Option function remove (line 32981) | pub fn remove(&mut self, value: &Q) -> bool function take (line 33005) | pub fn take(&mut self, value: &Q) -> Option function retain (line 33029) | pub fn retain(&mut self, mut f: F) function append (line 33066) | pub fn append(&mut self, other: &mut Self) function split_off (line 33103) | pub fn split_off(&mut self, key: &Q) -> Self function drain_filter (line 33138) | pub fn drain_filter<'a, F>(&'a mut self, pred: F) -> DrainFilter<'a, T, F> function iter (line 33174) | pub fn iter(&self) -> Iter<'_, T> { function len (line 33193) | pub const fn len(&self) -> usize { function is_empty (line 33211) | pub const fn is_empty(&self) -> bool { function from_iter (line 33218) | fn from_iter>(iter: I) -> BTreeSet { type Item (line 33227) | type Item = T; type IntoIter (line 33228) | type IntoIter = IntoIter; method into_iter (line 33242) | fn into_iter(self) -> IntoIter { type Item (line 33249) | type Item = &'a T; type IntoIter (line 33250) | type IntoIter = Iter<'a, T>; method into_iter (line 33252) | fn into_iter(self) -> Iter<'a, T> { type DrainFilter (line 33259) | pub struct DrainFilter<'a, T, F> method drop (line 33273) | fn drop(&mut self) { function fmt (line 33284) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Item (line 33294) | type Item = T; method next (line 33296) | fn next(&mut self) -> Option { method size_hint (line 33302) | fn size_hint(&self) -> (usize, Option) { function extend (line 33313) | fn extend>(&mut self, iter: Iter) { function extend_one (line 33320) | fn extend_one(&mut self, elem: T) { function extend (line 33327) | fn extend>(&mut self, iter: I) { function extend_one (line 33332) | fn extend_one(&mut self, &elem: &'a T) { method default (line 33340) | fn default() -> BTreeSet { type Output (line 33347) | type Output = BTreeSet; function sub (line 33363) | fn sub(self, rhs: &BTreeSet) -> BTreeSet { type Output (line 33370) | type Output = BTreeSet; function bitxor (line 33386) | fn bitxor(self, rhs: &BTreeSet) -> BTreeSet { type Output (line 33393) | type Output = BTreeSet; function bitand (line 33409) | fn bitand(self, rhs: &BTreeSet) -> BTreeSet { type Output (line 33416) | type Output = BTreeSet; function bitor (line 33432) | fn bitor(self, rhs: &BTreeSet) -> BTreeSet { method fmt (line 33439) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method clone (line 33446) | fn clone(&self) -> Self { type Item (line 33452) | type Item = &'a T; method next (line 33454) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 33458) | fn size_hint(&self) -> (usize, Option) { method last (line 33462) | fn last(mut self) -> Option<&'a T> { method min (line 33466) | fn min(mut self) -> Option<&'a T> { method max (line 33470) | fn max(mut self) -> Option<&'a T> { method next_back (line 33476) | fn next_back(&mut self) -> Option<&'a T> { method len (line 33482) | fn len(&self) -> usize { type Item (line 33492) | type Item = T; method next (line 33494) | fn next(&mut self) -> Option { method size_hint (line 33498) | fn size_hint(&self) -> (usize, Option) { method next_back (line 33504) | fn next_back(&mut self) -> Option { method len (line 33510) | fn len(&self) -> usize { method clone (line 33520) | fn clone(&self) -> Self { type Item (line 33527) | type Item = &'a T; method next (line 33529) | fn next(&mut self) -> Option<&'a T> { method last (line 33533) | fn last(mut self) -> Option<&'a T> { method min (line 33537) | fn min(mut self) -> Option<&'a T> { method max (line 33541) | fn max(mut self) -> Option<&'a T> { method next_back (line 33548) | fn next_back(&mut self) -> Option<&'a T> { method clone (line 33558) | fn clone(&self) -> Self { type Item (line 33575) | type Item = &'a T; method next (line 33577) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 33604) | fn size_hint(&self) -> (usize, Option) { method min (line 33615) | fn min(mut self) -> Option<&'a T> { method clone (line 33625) | fn clone(&self) -> Self { type Item (line 33631) | type Item = &'a T; method next (line 33633) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 33642) | fn size_hint(&self) -> (usize, Option) { method min (line 33650) | fn min(mut self) -> Option<&'a T> { method clone (line 33660) | fn clone(&self) -> Self { type Item (line 33676) | type Item = &'a T; method next (line 33678) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 33701) | fn size_hint(&self) -> (usize, Option) { method min (line 33710) | fn min(mut self) -> Option<&'a T> { method clone (line 33720) | fn clone(&self) -> Self { type Item (line 33726) | type Item = &'a T; method next (line 33728) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 33733) | fn size_hint(&self) -> (usize, Option) { method min (line 33739) | fn min(mut self) -> Option<&'a T> { type LeafRange (line 33755) | pub struct LeafRange { function none (line 33761) | pub fn none() -> Self { function is_empty (line 33765) | pub fn is_empty(&self) -> bool { function reborrow (line 33770) | pub fn reborrow(&self) -> LeafRange, K, V> { function find_leaf_edges_spanning_range (line 33792) | unsafe fn find_leaf_edges_spanning_range( function full_range (line 33830) | fn full_range( function range_search (line 33857) | pub fn range_search(self, range: R) -> LeafRange... function full_range (line 33868) | pub fn full_range(self) -> LeafRange, K, V> { function range_search (line 33883) | pub fn range_search(self, range: R) -> LeafRange LeafRange, K, V> { function full_range (line 33907) | pub fn full_range(self) -> LeafRange { function next_kv (line 33921) | pub fn next_kv( function next_back_kv (line 33942) | pub fn next_back_kv( function next_kv (line 33967) | pub fn next_kv( function deallocating_next (line 33998) | unsafe fn deallocating_next(self) -> Option<(Self, (K, V))> { function deallocating_next_back (line 34026) | unsafe fn deallocating_next_back(self) -> Option<(Self, (K, V))> { function deallocating_end (line 34049) | pub fn deallocating_end(self) { function next_unchecked (line 34063) | pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { function next_back_unchecked (line 34076) | pub unsafe fn next_back_unchecked(&mut self) -> (&'a K, &'a V) { function next_unchecked (line 34091) | pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a mut V) { function next_back_unchecked (line 34106) | pub unsafe fn next_back_unchecked(&mut self) -> (&'a K, &'a mut V) { function deallocating_next_unchecked (line 34130) | pub unsafe fn deallocating_next_unchecked(&mut self) -> (K, V) { function deallocating_next_back_unchecked (line 34148) | pub unsafe fn deallocating_next_back_unchecked(&mut self) -> (K, V) { function first_leaf_edge (line 34159) | pub fn first_leaf_edge(self) -> Handle Handle { function visit_nodes_in_order (line 34193) | pub fn visit_nodes_in_order(self, mut visit: F) function calc_length (line 34225) | pub fn calc_length(self) -> usize { function next_leaf_edge (line 34240) | pub fn next_leaf_edge(self) -> Handle { method get (line 34280) | fn get(&self, key: &Q) -> Option<&Self::Key>; method take (line 34281) | fn take(&mut self, key: &Q) -> Option; method replace (line 34282) | fn replace(&mut self, key: Self::Key) -> Option; function test_clone_eq (line 34296) | fn test_clone_eq() { function test_const (line 34306) | fn test_const() { function test_iter_min_max (line 34313) | fn test_iter_min_max() { function check (line 34343) | fn check(a: &[i32], b: &[i32], expected: &[i32], f: F) function test_intersection (line 34369) | fn test_intersection() { function test_intersection_size_hint (line 34401) | fn test_intersection_size_hint() { function test_difference (line 34417) | fn test_difference() { function test_difference_size_hint (line 34453) | fn test_difference_size_hint() { function test_symmetric_difference (line 34517) | fn test_symmetric_difference() { function test_symmetric_difference_size_hint (line 34529) | fn test_symmetric_difference_size_hint() { function test_union (line 34541) | fn test_union() { function test_union_size_hint (line 34557) | fn test_union_size_hint() { function test_is_disjoint (line 34570) | fn test_is_disjoint() { function test_is_subset (line 34578) | fn test_is_subset() { function test_retain (line 34615) | fn test_retain() { function test_drain_filter (line 34626) | fn test_drain_filter() { function test_drain_filter_drop_panic_leak (line 34637) | fn test_drain_filter_drop_panic_leak() { function test_drain_filter_pred_panic_leak (line 34657) | fn test_drain_filter_pred_panic_leak() { function test_clear (line 34680) | fn test_clear() { function test_zip (line 34689) | fn test_zip() { function test_from_iter (line 34709) | fn test_from_iter() { function test_show (line 34720) | fn test_show() { function test_extend_ref (line 34734) | fn test_extend_ref() { function test_recovery (line 34762) | fn test_recovery() { function test_variance (line 34809) | fn test_variance() { function test_sync (line 34826) | fn test_sync() { function test_send (line 34865) | fn test_send() { function test_ord_absence (line 34904) | fn test_ord_absence() { function test_append (line 34925) | fn test_append() { function test_first_last (line 34949) | fn test_first_last() { function rand_data (line 34984) | fn rand_data(len: usize) -> Vec { function test_split_off_empty_right (line 34990) | fn test_split_off_empty_right() { function test_split_off_empty_left (line 35002) | fn test_split_off_empty_left() { function test_split_off_large_random_sorted (line 35014) | fn test_split_off_large_random_sorted() { function test_borrow (line 35030) | fn test_borrow() { type Entry (line 35062) | pub enum Entry<'a, K: 'a, V: 'a> { method fmt (line 35074) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type VacantEntry (line 35085) | pub struct VacantEntry<'a, K: 'a, V: 'a> { method fmt (line 35096) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type OccupiedEntry (line 35104) | pub struct OccupiedEntry<'a, K: 'a, V: 'a> { method fmt (line 35114) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type OccupiedError (line 35123) | pub struct OccupiedError<'a, K: 'a, V: 'a> { method fmt (line 35132) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 35143) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function or_insert (line 35169) | pub fn or_insert(self, default: V) -> &'a mut V { function or_insert_with (line 35192) | pub fn or_insert_with V>(self, default: F) -> &'a mut V { function or_insert_with_key (line 35219) | pub fn or_insert_with_key V>(self, default: F) -> &'a m... function key (line 35240) | pub fn key(&self) -> &K { function and_modify (line 35268) | pub fn and_modify(self, f: F) -> Self function or_default (line 35297) | pub fn or_default(self) -> &'a mut V { function key (line 35318) | pub fn key(&self) -> &K { function into_key (line 35337) | pub fn into_key(self) -> K { function insert (line 35358) | pub fn insert(self, value: V) -> &'a mut V { function key (line 35395) | pub fn key(&self) -> &K { function remove_entry (line 35419) | pub fn remove_entry(self) -> (K, V) { function get (line 35439) | pub fn get(&self) -> &V { function get_mut (line 35470) | pub fn get_mut(&mut self) -> &mut V { function into_mut (line 35496) | pub fn into_mut(self) -> &'a mut V { function insert (line 35518) | pub fn insert(&mut self, value: V) -> V { function remove (line 35540) | pub fn remove(self) -> V { function remove_kv (line 35545) | pub(super) fn remove_kv(self) -> (K, V) { constant NODE_CAPACITY (line 35579) | const NODE_CAPACITY: usize = node::CAPACITY; constant MIN_INSERTS_HEIGHT_1 (line 35584) | const MIN_INSERTS_HEIGHT_1: usize = NODE_CAPACITY + 1; constant MIN_INSERTS_HEIGHT_2 (line 35589) | const MIN_INSERTS_HEIGHT_2: usize = 89; function test_all_refs (line 35593) | fn test_all_refs<'a, T: 'a>(dummy: &mut T, iter: impl Iterator Option { function dump_keys (line 35646) | fn dump_keys(&self) -> String function assert_strictly_ascending (line 35658) | fn assert_strictly_ascending(&self) function compact (line 35674) | fn compact(&mut self) function assert_min_len (line 35685) | fn assert_min_len(self, min_len: usize) { function test_levels (line 35700) | fn test_levels() { function test_check_ord_chaos (line 35738) | fn test_check_ord_chaos() { function test_check_invariants_ord_chaos (line 35747) | fn test_check_invariants_ord_chaos() { function test_basic_large (line 35755) | fn test_basic_large() { function test_basic_small (line 35808) | fn test_basic_small() { function test_iter (line 35894) | fn test_iter() { function test_iter_rev (line 35917) | fn test_iter_rev() { function do_test_iter_mut_mutation (line 35940) | fn do_test_iter_mut_mutation(size: usize) type Align32 (line 35976) | struct Align32(usize); type Error (line 35979) | type Error = (); method try_from (line 35981) | fn try_from(s: usize) -> Result { function test_iter_mut_mutation (line 35987) | fn test_iter_mut_mutation() { function test_values_mut (line 36011) | fn test_values_mut() { function test_values_mut_mutation (line 36018) | fn test_values_mut_mutation() { function test_iter_entering_root_twice (line 36033) | fn test_iter_entering_root_twice() { function test_iter_descending_to_same_node_twice (line 36050) | fn test_iter_descending_to_same_node_twice() { function test_iter_mixed (line 36065) | fn test_iter_mixed() { function test_iter_min_max (line 36093) | fn test_iter_min_max() { function range_keys (line 36128) | fn range_keys(map: &BTreeMap, range: impl RangeBounds) ->... function test_range_small (line 36138) | fn test_range_small() { function test_range_height_1 (line 36197) | fn test_range_height_1() { function test_range_large (line 36217) | fn test_range_large() { function test_range_inclusive_max_value (line 36286) | fn test_range_inclusive_max_value() { function test_range_equal_empty_cases (line 36294) | fn test_range_equal_empty_cases() { function test_range_equal_excluded (line 36302) | fn test_range_equal_excluded() { function test_range_backwards_1 (line 36309) | fn test_range_backwards_1() { function test_range_backwards_2 (line 36316) | fn test_range_backwards_2() { function test_range_backwards_3 (line 36323) | fn test_range_backwards_3() { function test_range_backwards_4 (line 36330) | fn test_range_backwards_4() { function test_range_finding_ill_order_in_map (line 36336) | fn test_range_finding_ill_order_in_map() { function test_range_finding_ill_order_in_range_ord (line 36348) | fn test_range_finding_ill_order_in_range_ord() { function test_range_1000 (line 36388) | fn test_range_1000() { function test_range_borrowed_key (line 36412) | fn test_range_borrowed_key() { function test_range (line 36426) | fn test_range() { function test_range_mut (line 36447) | fn test_range_mut() { function test_retain (line 36469) | fn test_retain() { function empty (line 36483) | fn empty() { function consumed_keeping_all (line 36492) | fn consumed_keeping_all() { function consumed_removing_all (line 36501) | fn consumed_removing_all() { function mutating_and_keeping (line 36511) | fn mutating_and_keeping() { function mutating_and_removing (line 36528) | fn mutating_and_removing() { function underfull_keeping_all (line 36543) | fn underfull_keeping_all() { function underfull_removing_one (line 36552) | fn underfull_removing_one() { function underfull_keeping_one (line 36563) | fn underfull_keeping_one() { function underfull_removing_all (line 36574) | fn underfull_removing_all() { function height_0_keeping_all (line 36583) | fn height_0_keeping_all() { function height_0_removing_one (line 36592) | fn height_0_removing_one() { function height_0_keeping_one (line 36603) | fn height_0_keeping_one() { function height_0_removing_all (line 36614) | fn height_0_removing_all() { function height_0_keeping_half (line 36623) | fn height_0_keeping_half() { function height_1_removing_all (line 36631) | fn height_1_removing_all() { function height_1_removing_one (line 36640) | fn height_1_removing_one() { function height_1_keeping_one (line 36651) | fn height_1_keeping_one() { function height_2_removing_one (line 36662) | fn height_2_removing_one() { function height_2_keeping_one (line 36673) | fn height_2_keeping_one() { function height_2_removing_all (line 36684) | fn height_2_removing_all() { function drop_panic_leak (line 36693) | fn drop_panic_leak() { function pred_panic_leak (line 36713) | fn pred_panic_leak() { function pred_panic_reuse (line 36739) | fn pred_panic_reuse() { function test_borrow (line 36771) | fn test_borrow() { function test_entry (line 36844) | fn test_entry() { function test_extend_ref (line 36896) | fn test_extend_ref() { function test_zst (line 36913) | fn test_zst() { function test_bad_zst (line 36940) | fn test_bad_zst() { function test_clear (line 36973) | fn test_clear() { function test_clear_drop_panic_leak (line 36987) | fn test_clear_drop_panic_leak() { function test_clone (line 37010) | fn test_clone() { function test_clone_panic_leak (line 37055) | fn test_clone_panic_leak() { function test_clone_from (line 37084) | fn test_clone_from() { function test_variance (line 37109) | fn test_variance() { function test_sync (line 37168) | fn test_sync() { function test_send (line 37237) | fn test_send() { function test_ord_absence (line 37306) | fn test_ord_absence() { function test_const (line 37347) | fn test_const() { function test_occupied_entry_key (line 37354) | fn test_occupied_entry_key() { function test_vacant_entry_key (line 37373) | fn test_vacant_entry_key() { function test_first_last_entry (line 37392) | fn test_first_last_entry() { function test_insert_into_full_height_0 (line 37417) | fn test_insert_into_full_height_0() { function test_insert_into_full_height_1 (line 37427) | fn test_insert_into_full_height_1() { function test_append_drop_leak (line 37499) | fn test_append_drop_leak() { function test_append_ord_chaos (line 37518) | fn test_append_ord_chaos() { function rand_data (line 37538) | fn rand_data(len: usize) -> Vec<(u32, u32)> { function test_split_off_empty_right (line 37544) | fn test_split_off_empty_right() { function test_split_off_empty_left (line 37558) | fn test_split_off_empty_left() { function test_split_off_tiny_left_height_2 (line 37574) | fn test_split_off_tiny_left_height_2() { function test_split_off_tiny_right_height_2 (line 37589) | fn test_split_off_tiny_right_height_2() { function test_split_off_halfway (line 37604) | fn test_split_off_halfway() { function test_split_off_large_random_sorted (line 37623) | fn test_split_off_large_random_sorted() { function test_into_iter_drop_leak_height_0 (line 37640) | fn test_into_iter_drop_leak_height_0() { function test_into_iter_drop_leak_height_1 (line 37663) | fn test_into_iter_drop_leak_height_1() { function test_into_keys (line 37681) | fn test_into_keys() { function test_into_values (line 37693) | fn test_into_values() { function test_insert_remove_intertwined (line 37705) | fn test_insert_remove_intertwined() { function test_insert_remove_intertwined_ord_chaos (line 37719) | fn test_insert_remove_intertwined_ord_chaos() { function remove_kv_tracking (line 37741) | pub fn remove_kv_tracking( function remove_leaf_kv (line 37753) | fn remove_leaf_kv( function remove_internal_kv (line 37805) | fn remove_internal_kv( type MergeIterInner (line 37830) | pub struct MergeIterInner { type Peeked (line 37839) | enum Peeked { method clone (line 37849) | fn clone(&self) -> Self { method fmt (line 37859) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function new (line 37866) | pub fn new(a: I, b: I) -> Self { function nexts (line 37877) | pub fn nexts Ordering>( function lens (line 37911) | pub fn lens(&self) -> (usize, usize) constant B (line 37963) | const B: usize = 6; method fmt (line 12982) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { constant CAPACITY (line 37964) | pub const CAPACITY: usize = 2 * B - 1; constant MIN_LEN_AFTER_SPLIT (line 37965) | pub const MIN_LEN_AFTER_SPLIT: usize = B - 1; constant KV_IDX_CENTER (line 37966) | const KV_IDX_CENTER: usize = B - 1; constant EDGE_IDX_LEFT_OF_CENTER (line 37967) | const EDGE_IDX_LEFT_OF_CENTER: usize = B - 1; constant EDGE_IDX_RIGHT_OF_CENTER (line 37968) | const EDGE_IDX_RIGHT_OF_CENTER: usize = B; type LeafNode (line 37971) | struct LeafNode { function init (line 37991) | unsafe fn init(this: *mut Self) { function new (line 38002) | fn new() -> Box { type InternalNode (line 38018) | struct InternalNode { function new (line 38034) | unsafe fn new() -> Box { type BoxedNode (line 38050) | type BoxedNode = NonNull>; type NodeRef (line 38103) | pub struct NodeRef { type Root (line 38119) | pub type Root = NodeRef; method clone (line 38123) | fn clone(&self) -> Self { function new_leaf (line 38137) | fn new_leaf() -> Self { function from_new_leaf (line 38141) | fn from_new_leaf(leaf: Box>) -> Self { function new_internal (line 38147) | fn new_internal(child: Root) -> Self { function from_new_internal (line 38155) | unsafe fn from_new_internal(internal: Box>, height: u... function from_internal (line 38166) | fn from_internal(node: NonNull>, height: usize) -> Se... function as_internal_ptr (line 38176) | fn as_internal_ptr(this: &Self) -> *mut InternalNode { function as_internal_mut (line 38184) | fn as_internal_mut(&mut self) -> &mut InternalNode { function len (line 38195) | pub fn len(&self) -> usize { function height (line 38206) | pub fn height(&self) -> usize { function reborrow (line 38211) | pub fn reborrow(&self) -> NodeRef, K, V, Type> { function as_leaf_ptr (line 38218) | fn as_leaf_ptr(this: &Self) -> *mut LeafNode { function ascend (line 38236) | pub fn ascend( function first_edge (line 38253) | pub fn first_edge(self) -> Handle { function last_edge (line 38257) | pub fn last_edge(self) -> Handle { function first_kv (line 38263) | pub fn first_kv(self) -> Handle { function last_kv (line 38270) | pub fn last_kv(self) -> Handle { function eq (line 38279) | fn eq(&self, other: &Self) -> bool { function into_leaf (line 38292) | fn into_leaf(self) -> &'a LeafNode { function keys (line 38299) | pub fn keys(&self) -> &[K] { function deallocate_and_ascend (line 38311) | pub unsafe fn deallocate_and_ascend( function reborrow_mut (line 38342) | unsafe fn reborrow_mut(&mut self) -> NodeRef, K, V, Type> { function as_leaf_mut (line 38347) | fn as_leaf_mut(&mut self) -> &mut LeafNode { function into_leaf_mut (line 38354) | fn into_leaf_mut(mut self) -> &'a mut LeafNode { function key_area_mut (line 38366) | unsafe fn key_area_mut(&mut self, index: I) -> &mut O... function val_area_mut (line 38380) | unsafe fn val_area_mut(&mut self, index: I) -> &mut O... function edge_area_mut (line 38396) | unsafe fn edge_area_mut(&mut self, index: I) -> &mut ... function into_key_val_mut_at (line 38410) | unsafe fn into_key_val_mut_at(mut self, idx: usize) -> (&'a K, &'a mut V) { function len_mut (line 38428) | pub fn len_mut(&mut self) -> &mut u16 { function correct_childrens_parent_links (line 38436) | unsafe fn correct_childrens_parent_links>(&mut... function correct_all_childrens_parent_links (line 38443) | fn correct_all_childrens_parent_links(&mut self) { function set_parent_link (line 38452) | fn set_parent_link(&mut self, parent: NonNull>, paren... function clear_parent_link (line 38461) | fn clear_parent_link(&mut self) { function new (line 38470) | pub fn new() -> Self { function push_internal_level (line 38477) | pub fn push_internal_level(&mut self) -> NodeRef, K, V, ... function pop_internal_level (line 38493) | pub fn pop_internal_level(&mut self) { function borrow_mut (line 38517) | pub fn borrow_mut(&mut self) -> NodeRef, K, V, Type> { function borrow_valmut (line 38522) | pub fn borrow_valmut(&mut self) -> NodeRef, K, V, Typ... function into_dying (line 38528) | pub fn into_dying(self) -> NodeRef { function push (line 38535) | pub fn push(&mut self, key: K, val: V) { function push (line 38550) | pub fn push(&mut self, key: K, val: V, edge: Root) { function forget_type (line 38568) | pub fn forget_type(self) -> NodeRef NodeRef NodeRef, K, V,... function cast_to_internal_unchecked (line 38612) | unsafe fn cast_to_internal_unchecked(self) -> NodeRef, K... type Handle (line 38626) | pub struct Handle { method clone (line 38636) | fn clone(&self) -> Self { function into_node (line 38643) | pub fn into_node(self) -> Node { function idx (line 38648) | pub fn idx(&self) -> usize { function new_kv (line 38656) | pub unsafe fn new_kv(node: NodeRef, idx: usi... function left_edge (line 38662) | pub fn left_edge(self) -> Handle, ma... function right_edge (line 38666) | pub fn right_edge(self) -> Handle, m... method eq (line 38674) | fn eq(&self, other: &Self) -> bool { function reborrow (line 38684) | pub fn reborrow(&self) -> Handle, K, V, NodeTy... function reborrow_mut (line 38696) | pub unsafe fn reborrow_mut( function new_edge (line 38707) | pub unsafe fn new_edge(node: NodeRef, idx: u... function left_kv (line 38713) | pub fn left_kv(self) -> Result Result { function splitpoint (line 38740) | fn splitpoint(edge_idx: usize) -> (usize, LeftOrRight) { function insert_fit (line 38757) | fn insert_fit(&mut self, key: K, val: V) -> *mut V { function insert (line 38776) | fn insert(mut self, key: K, val: V) -> (InsertResult<'a, K, V, marker::L... function correct_parent_link (line 38802) | fn correct_parent_link(self) { function insert_fit (line 38815) | fn insert_fit(&mut self, key: K, val: V, edge: Root) { function insert (line 38833) | fn insert( function insert_recursing (line 38871) | pub fn insert_recursing( function descend (line 38908) | pub fn descend(self) -> NodeRef { function into_kv (line 38924) | pub fn into_kv(self) -> (&'a K, &'a V) { function key_mut (line 38934) | pub fn key_mut(&mut self) -> &mut K { function into_val_mut (line 38938) | pub fn into_val_mut(self) -> &'a mut V { function into_kv_valmut (line 38946) | pub fn into_kv_valmut(self) -> (&'a K, &'a mut V) { function kv_mut (line 38952) | pub fn kv_mut(&mut self) -> (&mut K, &mut V) { function replace_kv (line 38965) | pub fn replace_kv(&mut self, k: K, v: V) -> (K, V) { function split_leaf_data (line 38974) | fn split_leaf_data(&mut self, new_node: &mut LeafNode) -> (K, V) { function split (line 39006) | pub fn split(mut self) -> SplitResult<'a, K, V, marker::Leaf> { function remove (line 39017) | pub fn remove( function split (line 39038) | pub fn split(mut self) -> SplitResult<'a, K, V, marker::Internal> { type BalancingContext (line 39059) | pub struct BalancingContext<'a, K, V> { function consider_for_balancing (line 39066) | pub fn consider_for_balancing(self) -> BalancingContext<'a, K, V> { function choose_parent_kv (line 39092) | pub fn choose_parent_kv(self) -> Result usize { function right_child_len (line 39119) | pub fn right_child_len(&self) -> usize { function into_left_child (line 39123) | pub fn into_left_child(self) -> NodeRef, K, V, marker::L... function into_right_child (line 39127) | pub fn into_right_child(self) -> NodeRef, K, V, marker::... function can_merge (line 39133) | pub fn can_merge(&self) -> bool { function do_merge (line 39140) | fn do_merge< function merge_tracking_parent (line 39205) | pub fn merge_tracking_parent(self) -> NodeRef, K, V, mar... function merge_tracking_child (line 39213) | pub fn merge_tracking_child(self) -> NodeRef, K, V, mark... function merge_tracking_child_edge (line 39222) | pub fn merge_tracking_child_edge( function steal_left (line 39244) | pub fn steal_left( function steal_right (line 39256) | pub fn steal_right( function bulk_steal_left (line 39265) | pub fn bulk_steal_left(&mut self, count: usize) { function bulk_steal_right (line 39328) | pub fn bulk_steal_right(&mut self, count: usize) { function forget_node_type (line 39393) | pub fn forget_node_type( function forget_node_type (line 39401) | pub fn forget_node_type( function forget_node_type (line 39409) | pub fn forget_node_type( function forget_node_type (line 39417) | pub fn forget_node_type( function force (line 39426) | pub fn force( function cast_to_leaf_unchecked (line 39445) | pub unsafe fn cast_to_leaf_unchecked( function move_suffix (line 39456) | pub fn move_suffix( type ForceResult (line 39499) | pub enum ForceResult { type SplitResult (line 39505) | pub struct SplitResult<'a, K, V, NodeType> { function forget_node_type (line 39515) | pub fn forget_node_type(self) -> SplitResult<'a, K, V, marker::LeafOrInt... function forget_node_type (line 39521) | pub fn forget_node_type(self) -> SplitResult<'a, K, V, marker::LeafOrInt... type InsertResult (line 39526) | pub enum InsertResult<'a, K, V, NodeType> { type Leaf (line 39534) | pub enum Leaf {} type Internal (line 39535) | pub enum Internal {} type LeafOrInternal (line 39536) | pub enum LeafOrInternal {} type Owned (line 39538) | pub enum Owned {} type Dying (line 39539) | pub enum Dying {} type Immut (line 39540) | pub struct Immut<'a>(PhantomData<&'a ()>); type Mut (line 39541) | pub struct Mut<'a>(PhantomData<&'a mut ()>); type ValMut (line 39542) | pub struct ValMut<'a>(PhantomData<&'a mut ()>); type BorrowType (line 39544) | pub trait BorrowType { constant PERMITS_TRAVERSAL (line 39547) | const PERMITS_TRAVERSAL: bool = true; constant PERMITS_TRAVERSAL (line 39553) | const PERMITS_TRAVERSAL: bool = false; type KV (line 39560) | pub enum KV {} type Edge (line 39561) | pub enum Edge {} function slice_insert (line 39568) | unsafe fn slice_insert(slice: &mut [MaybeUninit], idx: usize, val:... function slice_remove (line 39585) | unsafe fn slice_remove(slice: &mut [MaybeUninit], idx: usize) -> T { function slice_shl (line 39600) | unsafe fn slice_shl(slice: &mut [MaybeUninit], distance: usize) { function slice_shr (line 39611) | unsafe fn slice_shr(slice: &mut [MaybeUninit], distance: usize) { function move_to_slice (line 39621) | fn move_to_slice(src: &mut [MaybeUninit], dst: &mut [MaybeUninit String function test_splitpoint (line 39674) | fn test_splitpoint() { function test_partial_eq (line 39698) | fn test_partial_eq() { function test_sizes (line 39725) | fn test_sizes() { function fix_node_through_parent (line 39739) | fn fix_node_through_parent( function fix_node_and_affected_ancestors (line 39785) | pub fn fix_node_and_affected_ancestors(mut self) -> bool { function fix_top (line 39798) | pub fn fix_top(&mut self) { function fix_right_border (line 39807) | pub fn fix_right_border(&mut self) { function fix_left_border (line 39816) | pub fn fix_left_border(&mut self) { function fix_right_border_of_plentiful (line 39827) | pub fn fix_right_border_of_plentiful(&mut self) { function fix_left_border_of_left_edge (line 39846) | fn fix_left_border_of_left_edge(mut self) { function fix_right_border_of_right_edge (line 39853) | fn fix_right_border_of_right_edge(mut self) { function fix_left_child (line 39866) | fn fix_left_child(self) -> NodeRef, K, V, marker::LeafOr... function fix_right_child (line 39886) | fn fix_right_child(self) -> NodeRef, K, V, marker::LeafO... type TryReserveError (line 39951) | pub enum TryReserveError { method from (line 39977) | fn from(_: LayoutError) -> Self { method fmt (line 39984) | fn fmt( type SpecExtend (line 40001) | trait SpecExtend { method spec_extend (line 40003) | fn spec_extend(&mut self, iter: I); method spec_extend (line 46146) | fn spec_extend(&mut self, iter: I); type IntoIter (line 40018) | pub struct IntoIter { function fmt (line 40024) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Item (line 40031) | type Item = T; method next (line 40034) | fn next(&mut self) -> Option { method size_hint (line 40039) | fn size_hint(&self) -> (usize, Option) { method __iterator_get_unchecked (line 40045) | unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> Self::Item method next_back (line 40064) | fn next_back(&mut self) -> Option { method is_empty (line 40071) | fn is_empty(&self) -> bool { constant MAY_HAVE_SIDE_EFFECT (line 40090) | const MAY_HAVE_SIDE_EFFECT: bool = false; type Drain (line 40124) | pub struct Drain<'a, T: 'a> { function fmt (line 40133) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method drop (line 40149) | fn drop(&mut self) { type Item (line 40210) | type Item = T; method next (line 40213) | fn next(&mut self) -> Option { method size_hint (line 40218) | fn size_hint(&self) -> (usize, Option) { method next_back (line 40226) | fn next_back(&mut self) -> Option { type RingSlices (line 40239) | pub trait RingSlices: Sized { method slice (line 40240) | fn slice(self, from: usize, to: usize) -> Self; method split_at (line 40241) | fn split_at(self, i: usize) -> (Self, Self); method ring_slices (line 40243) | fn ring_slices(buf: Self, head: usize, tail: usize) -> (Self, Self) { method slice (line 40257) | fn slice(self, from: usize, to: usize) -> Self { method split_at (line 40260) | fn split_at(self, i: usize) -> (Self, Self) { method slice (line 40266) | fn slice(self, from: usize, to: usize) -> Self { method split_at (line 40269) | fn split_at(self, i: usize) -> (Self, Self) { method slice (line 40275) | fn slice(self, from: usize, to: usize) -> Self { method split_at (line 40282) | fn split_at(self, mid: usize) -> (Self, Self) { type PairSlices (line 40312) | pub struct PairSlices<'a, 'b, T> { function from (line 40320) | pub fn from(to: &'a mut VecDeque, from: &'b VecDeque) -> Self { function has_remainder (line 40326) | pub fn has_remainder(&self) -> bool { function remainder (line 40330) | pub fn remainder(self) -> impl Iterator { type Item (line 40336) | type Item = (&'a mut [T], &'b [T]); method next (line 40337) | fn next(&mut self) -> Option { constant INITIAL_CAPACITY (line 40415) | const INITIAL_CAPACITY: usize = 7; constant MINIMUM_CAPACITY (line 40416) | const MINIMUM_CAPACITY: usize = 1; constant MAXIMUM_ZST_CAPACITY (line 40418) | const MAXIMUM_ZST_CAPACITY: usize = 1 << (usize::BITS - 1); type VecDeque (line 40440) | pub struct VecDeque { method clone (line 40453) | fn clone(&self) -> VecDeque { method clone_from (line 40457) | fn clone_from(&mut self, other: &Self) { method drop (line 40475) | fn drop(&mut self) { method default (line 40502) | fn default() -> VecDeque { function ptr (line 40510) | fn ptr(&self) -> *mut T { function cap (line 40516) | fn cap(&self) -> usize { function buffer_as_slice (line 40527) | unsafe fn buffer_as_slice(&self) -> &[T] { function buffer_as_mut_slice (line 40533) | unsafe fn buffer_as_mut_slice(&mut self) -> &mut [T] { function buffer_read (line 40539) | unsafe fn buffer_read(&mut self, off: usize) -> T { function buffer_write (line 40545) | unsafe fn buffer_write(&mut self, off: usize, value: T) { function is_full (line 40553) | fn is_full(&self) -> bool { function wrap_index (line 40560) | fn wrap_index(&self, idx: usize) -> usize { function wrap_add (line 40567) | fn wrap_add(&self, idx: usize, addend: usize) -> usize { function wrap_sub (line 40574) | fn wrap_sub(&self, idx: usize, subtrahend: usize) -> usize { function copy (line 40580) | unsafe fn copy(&self, dst: usize, src: usize, len: usize) { function copy_nonoverlapping (line 40604) | unsafe fn copy_nonoverlapping(&self, dst: usize, src: usize, len: usize) { function wrap_copy (line 40629) | unsafe fn wrap_copy(&self, dst: usize, src: usize, len: usize) { function handle_capacity_increase (line 40765) | unsafe fn handle_capacity_increase(&mut self, old_capacity: usize) { function new (line 40818) | pub fn new() -> VecDeque { function with_capacity (line 40832) | pub fn with_capacity(capacity: usize) -> VecDeque { function get (line 40856) | pub fn get(&self, index: usize) -> Option<&T> { function get_mut (line 40885) | pub fn get_mut(&mut self, index: usize) -> Option<&mut T> { function swap (line 40918) | pub fn swap(&mut self, i: usize, j: usize) { function capacity (line 40939) | pub fn capacity(&self) -> usize { function reserve_exact (line 40966) | pub fn reserve_exact(&mut self, additional: usize) { function reserve (line 40987) | pub fn reserve(&mut self, additional: usize) { function try_reserve_exact (line 41040) | pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), Try... function try_reserve (line 41078) | pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserv... function shrink_to_fit (line 41112) | pub fn shrink_to_fit(&mut self) { function shrink_to (line 41138) | pub fn shrink_to(&mut self, min_capacity: usize) { function truncate (line 41220) | pub fn truncate(&mut self, len: usize) { function iter (line 41280) | pub fn iter(&self) -> Iter<'_, T> { function iter_mut (line 41302) | pub fn iter_mut(&mut self) -> IterMut<'_, T> { function as_slices (line 41341) | pub fn as_slices(&self) -> (&[T], &[T]) { function as_mut_slices (line 41375) | pub fn as_mut_slices(&mut self) -> (&mut [T], &mut [T]) { function len (line 41398) | pub fn len(&self) -> usize { function is_empty (line 41415) | pub fn is_empty(&self) -> bool { function range_tail_head (line 41419) | fn range_tail_head(&self, range: R) -> (usize, usize) function range (line 41451) | pub fn range(&self, range: R) -> Iter<'_, T> function range_mut (line 41490) | pub fn range_mut(&mut self, range: R) -> IterMut<'_, T> function drain (line 41537) | pub fn drain(&mut self, range: R) -> Drain<'_, T> function clear (line 41604) | pub fn clear(&mut self) { function contains (line 41625) | pub fn contains(&self, x: &T) -> bool function front (line 41649) | pub fn front(&self) -> Option<&T> { function front_mut (line 41673) | pub fn front_mut(&mut self) -> Option<&mut T> { function back (line 41693) | pub fn back(&self) -> Option<&T> { function back_mut (line 41717) | pub fn back_mut(&mut self) -> Option<&mut T> { function pop_front (line 41738) | pub fn pop_front(&mut self) -> Option { function pop_back (line 41763) | pub fn pop_back(&mut self) -> Option { function push_front (line 41786) | pub fn push_front(&mut self, value: T) { function push_back (line 41811) | pub fn push_back(&mut self, value: T) { function is_contiguous (line 41822) | fn is_contiguous(&self) -> bool { function swap_remove_front (line 41853) | pub fn swap_remove_front(&mut self, index: usize) -> Option { function swap_remove_back (line 41888) | pub fn swap_remove_back(&mut self, index: usize) -> Option { function insert (line 41922) | pub fn insert(&mut self, index: usize, value: T) { function remove (line 42144) | pub fn remove(&mut self, index: usize) -> Option { function split_off (line 42326) | pub fn split_off(&mut self, at: usize) -> Self { function append (line 42389) | pub fn append(&mut self, other: &mut Self) { function retain (line 42425) | pub fn retain(&mut self, mut f: F) function grow (line 42445) | fn grow(&mut self) { function resize_with (line 42484) | pub fn resize_with(&mut self, new_len: usize, generator: impl FnMut() ->... function make_contiguous (line 42550) | pub fn make_contiguous(&mut self) -> &mut [T] { function rotate_left (line 42676) | pub fn rotate_left(&mut self, mid: usize) { function rotate_right (line 42719) | pub fn rotate_right(&mut self, k: usize) { function rotate_left_inner (line 42737) | unsafe fn rotate_left_inner(&mut self, mid: usize) { function rotate_right_inner (line 42746) | unsafe fn rotate_right_inner(&mut self, k: usize) { function binary_search (line 42803) | pub fn binary_search(&self, x: &T) -> Result function binary_search_by (line 42848) | pub fn binary_search_by<'a, F>(&'a self, mut f: F) -> Result function binary_search_by_key (line 42905) | pub fn binary_search_by_key<'a, B, F>(&'a self, b: &B, mut f: F) -> Resu... function partition_point (line 42945) | pub fn partition_point

(&self, mut pred: P) -> usize function resize (line 42982) | pub fn resize(&mut self, new_len: usize, value: T) { function wrap_index (line 42989) | fn wrap_index(index: usize, size: usize) -> usize { function count (line 42997) | fn count(tail: usize, head: usize, size: usize) -> usize { method eq (line 43004) | fn eq(&self, other: &VecDeque) -> bool { method partial_cmp (line 43053) | fn partial_cmp(&self, other: &VecDeque) -> Option { method cmp (line 43061) | fn cmp(&self, other: &VecDeque) -> Ordering { method hash (line 43068) | fn hash(&self, state: &mut H) { type Output (line 43082) | type Output = A; function index (line 43085) | fn index(&self, index: usize) -> &A { function index_mut (line 43093) | fn index_mut(&mut self, index: usize) -> &mut A { function from_iter (line 43100) | fn from_iter>(iter: T) -> VecDeque { type Item (line 43111) | type Item = T; type IntoIter (line 43112) | type IntoIter = IntoIter; method into_iter (line 43116) | fn into_iter(self) -> IntoIter { type Item (line 43123) | type Item = &'a T; type IntoIter (line 43124) | type IntoIter = Iter<'a, T>; method into_iter (line 43126) | fn into_iter(self) -> Iter<'a, T> { type Item (line 43133) | type Item = &'a mut T; type IntoIter (line 43134) | type IntoIter = IterMut<'a, T>; method into_iter (line 43136) | fn into_iter(self) -> IterMut<'a, T> { function extend (line 43143) | fn extend>(&mut self, iter: T) { function extend_one (line 43165) | fn extend_one(&mut self, elem: A) { function extend_reserve (line 43170) | fn extend_reserve(&mut self, additional: usize) { function extend (line 43177) | fn extend>(&mut self, iter: I) { function extend_one (line 43182) | fn extend_one(&mut self, &elem: &T) { function extend_reserve (line 43187) | fn extend_reserve(&mut self, additional: usize) { function fmt (line 43194) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function from (line 43209) | fn from(mut other: Vec) -> Self { function from (line 43265) | fn from(mut other: VecDeque) -> Self { type Iter (line 43294) | pub struct Iter<'a, T: 'a> { function fmt (line 43302) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method clone (line 43311) | fn clone(&self) -> Self { type Item (line 43318) | type Item = &'a T; method next (line 43321) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 43331) | fn size_hint(&self) -> (usize, Option) { method fold (line 43336) | fn fold(self, mut accum: Acc, mut f: F) -> Acc method try_fold (line 43345) | fn try_fold(&mut self, init: B, mut f: F) -> R method nth (line 43370) | fn nth(&mut self, n: usize) -> Option { method last (line 43381) | fn last(mut self) -> Option<&'a T> { method __iterator_get_unchecked (line 43386) | unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> Self::Item method next_back (line 43402) | fn next_back(&mut self) -> Option<&'a T> { method rfold (line 43410) | fn rfold(self, mut accum: Acc, mut f: F) -> Acc method try_rfold (line 43419) | fn try_rfold(&mut self, init: B, mut f: F) -> R method is_empty (line 43446) | fn is_empty(&self) -> bool { constant MAY_HAVE_SIDE_EFFECT (line 43460) | const MAY_HAVE_SIDE_EFFECT: bool = false; function bench_push_back_100 (line 43466) | fn bench_push_back_100(b: &mut test::Bencher) { function bench_push_front_100 (line 43479) | fn bench_push_front_100(b: &mut test::Bencher) { function bench_pop_back_100 (line 43492) | fn bench_pop_back_100(b: &mut test::Bencher) { function bench_pop_front_100 (line 43506) | fn bench_pop_front_100(b: &mut test::Bencher) { function test_swap_front_back_remove (line 43519) | fn test_swap_front_back_remove() { function test_insert (line 43560) | fn test_insert() { function make_contiguous_big_tail (line 43594) | fn make_contiguous_big_tail() { function make_contiguous_big_head (line 43616) | fn make_contiguous_big_head() { function make_contiguous_small_free (line 43635) | fn make_contiguous_small_free() { function make_contiguous_head_to_end (line 43675) | fn make_contiguous_head_to_end() { function make_contiguous_head_to_end_2 (line 43689) | fn make_contiguous_head_to_end_2() { function test_remove (line 43704) | fn test_remove() { function test_range (line 43742) | fn test_range() { function test_range_mut (line 43768) | fn test_range_mut() { function test_drain (line 43802) | fn test_drain() { function test_shrink_to_fit (line 43837) | fn test_shrink_to_fit() { function test_split_off (line 43869) | fn test_split_off() { function test_from_vec (line 43908) | fn test_from_vec() { function test_from_vec_zst_overflow (line 43930) | fn test_from_vec_zst_overflow() { function test_vec_from_vecdeque (line 43939) | fn test_vec_from_vecdeque() { function test_clone_from (line 44004) | fn test_clone_from() { function test_vec_deque_truncate_drop (line 44028) | fn test_vec_deque_truncate_drop() { function issue_53529 (line 44063) | fn issue_53529() { function issue_80303 (line 44080) | fn issue_80303() { type IterMut (line 44131) | pub struct IterMut<'a, T: 'a> { function fmt (line 44148) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Item (line 44159) | type Item = &'a mut T; method next (line 44162) | fn next(&mut self) -> Option<&'a mut T> { method size_hint (line 44176) | fn size_hint(&self) -> (usize, Option) { method fold (line 44181) | fn fold(self, mut accum: Acc, mut f: F) -> Acc method nth (line 44193) | fn nth(&mut self, n: usize) -> Option { method last (line 44204) | fn last(mut self) -> Option<&'a mut T> { method __iterator_get_unchecked (line 44209) | unsafe fn __iterator_get_unchecked(&mut self, idx: usize) -> Self::Item method next_back (line 44225) | fn next_back(&mut self) -> Option<&'a mut T> { method rfold (line 44237) | fn rfold(self, mut accum: Acc, mut f: F) -> Acc method is_empty (line 44252) | fn is_empty(&self) -> bool { constant MAY_HAVE_SIDE_EFFECT (line 44266) | const MAY_HAVE_SIDE_EFFECT: bool = false; type BinaryHeap (line 44518) | pub struct BinaryHeap { type PeekMut (line 44530) | pub struct PeekMut<'a, T: 'a + Ord> { function fmt (line 44537) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method drop (line 44544) | fn drop(&mut self) { type Target (line 44554) | type Target = T; method deref (line 44555) | fn deref(&self) -> &T { method deref_mut (line 44564) | fn deref_mut(&mut self) -> &mut T { function pop (line 44575) | pub fn pop(mut this: PeekMut<'a, T>) -> T { method clone (line 44584) | fn clone(&self) -> Self { method clone_from (line 44588) | fn clone_from(&mut self, source: &Self) { method default (line 44597) | fn default() -> BinaryHeap { function fmt (line 44604) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function new (line 44622) | pub fn new() -> BinaryHeap { function with_capacity (line 44641) | pub fn with_capacity(capacity: usize) -> BinaryHeap { function peek_mut (line 44675) | pub fn peek_mut(&mut self) -> Option> { function pop (line 44699) | pub fn pop(&mut self) -> Option { function push (line 44743) | pub fn push(&mut self, item: T) { function into_sorted_vec (line 44769) | pub fn into_sorted_vec(mut self) -> Vec { function sift_up (line 44801) | unsafe fn sift_up(&mut self, start: usize, pos: usize) -> usize { function sift_down_range (line 44830) | unsafe fn sift_down_range(&mut self, pos: usize, end: usize) { function sift_down (line 44870) | unsafe fn sift_down(&mut self, pos: usize) { function sift_down_to_bottom (line 44886) | unsafe fn sift_down_to_bottom(&mut self, mut pos: usize) { function rebuild_tail (line 44923) | fn rebuild_tail(&mut self, start: usize) { function rebuild (line 44959) | fn rebuild(&mut self) { function append (line 44991) | pub fn append(&mut self, other: &mut Self) { function drain_sorted (line 45027) | pub fn drain_sorted(&mut self) -> DrainSorted<'_, T> { function retain (line 45051) | pub fn retain(&mut self, mut f: F) function iter (line 45088) | pub fn iter(&self) -> Iter<'_, T> { function into_iter_sorted (line 45107) | pub fn into_iter_sorted(self) -> IntoIterSorted { function peek (line 45133) | pub fn peek(&self) -> Option<&T> { function capacity (line 45150) | pub fn capacity(&self) -> usize { function reserve_exact (line 45179) | pub fn reserve_exact(&mut self, additional: usize) { function reserve (line 45202) | pub fn reserve(&mut self, additional: usize) { function shrink_to_fit (line 45221) | pub fn shrink_to_fit(&mut self) { function shrink_to (line 45245) | pub fn shrink_to(&mut self, min_capacity: usize) { function as_slice (line 45266) | pub fn as_slice(&self) -> &[T] { function into_vec (line 45288) | pub fn into_vec(self) -> Vec { function len (line 45306) | pub fn len(&self) -> usize { function is_empty (line 45329) | pub fn is_empty(&self) -> bool { function drain (line 45355) | pub fn drain(&mut self) -> Drain<'_, T> { function clear (line 45376) | pub fn clear(&mut self) { type Hole (line 45385) | struct Hole<'a, T: 'a> { function new (line 45396) | unsafe fn new(data: &'a mut [T], pos: usize) -> Self { function pos (line 45404) | fn pos(&self) -> usize { function element (line 45410) | fn element(&self) -> &T { function get (line 45418) | unsafe fn get(&self, index: usize) -> &T { function move_to (line 45428) | unsafe fn move_to(&mut self, index: usize) { method drop (line 45443) | fn drop(&mut self) { type Iter (line 45459) | pub struct Iter<'a, T: 'a> { function fmt (line 45465) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { method clone (line 45473) | fn clone(&self) -> Self { type Item (line 45480) | type Item = &'a T; method next (line 45483) | fn next(&mut self) -> Option<&'a T> { method size_hint (line 45488) | fn size_hint(&self) -> (usize, Option) { method last (line 45493) | fn last(self) -> Option<&'a T> { method next_back (line 45501) | fn next_back(&mut self) -> Option<&'a T> { method is_empty (line 45508) | fn is_empty(&self) -> bool { type IntoIter (line 45524) | pub struct IntoIter { function fmt (line 45530) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Item (line 45537) | type Item = T; method next (line 45540) | fn next(&mut self) -> Option { method size_hint (line 45545) | fn size_hint(&self) -> (usize, Option) { method next_back (line 45553) | fn next_back(&mut self) -> Option { method is_empty (line 45560) | fn is_empty(&self) -> bool { type Source (line 45570) | type Source = IntoIter; method as_inner (line 45573) | unsafe fn as_inner(&mut self) -> &mut Self::Source { type IntoIterSorted (line 45591) | pub struct IntoIterSorted { type Item (line 45597) | type Item = T; method next (line 45600) | fn next(&mut self) -> Option { method size_hint (line 45605) | fn size_hint(&self) -> (usize, Option) { type Drain (line 45628) | pub struct Drain<'a, T: 'a> { type Item (line 45634) | type Item = T; method next (line 45637) | fn next(&mut self) -> Option { method size_hint (line 45642) | fn size_hint(&self) -> (usize, Option) { method next_back (line 45650) | fn next_back(&mut self) -> Option { method is_empty (line 45657) | fn is_empty(&self) -> bool { type DrainSorted (line 45673) | pub struct DrainSorted<'a, T: Ord> { method drop (line 45680) | fn drop(&mut self) { type Item (line 45699) | type Item = T; method next (line 45702) | fn next(&mut self) -> Option { method size_hint (line 45707) | fn size_hint(&self) -> (usize, Option) { function from (line 45727) | fn from(vec: Vec) -> BinaryHeap { function from (line 45740) | fn from(heap: BinaryHeap) -> Vec { function from_iter (line 45747) | fn from_iter>(iter: I) -> BinaryHeap { type Item (line 45754) | type Item = T; type IntoIter (line 45755) | type IntoIter = IntoIter; method into_iter (line 45775) | fn into_iter(self) -> IntoIter { type Item (line 45782) | type Item = &'a T; type IntoIter (line 45783) | type IntoIter = Iter<'a, T>; method into_iter (line 45785) | fn into_iter(self) -> Iter<'a, T> { function extend (line 45793) | fn extend>(&mut self, iter: I) { function extend_one (line 45798) | fn extend_one(&mut self, item: T) { function extend_reserve (line 45803) | fn extend_reserve(&mut self, additional: usize) { function spec_extend (line 45809) | default fn spec_extend(&mut self, iter: I) { function spec_extend (line 45815) | fn spec_extend(&mut self, ref mut other: BinaryHeap) { function extend_desugared (line 45821) | fn extend_desugared>(&mut self, iter: I) { function extend (line 45833) | fn extend>(&mut self, iter: I) { function extend_one (line 45838) | fn extend_one(&mut self, &item: &'a T) { function extend_reserve (line 45843) | fn extend_reserve(&mut self, additional: usize) { type IntoIter (line 45869) | pub struct IntoIter< function fmt (line 45883) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function as_slice (line 45901) | pub fn as_slice(&self) -> &[T] { function as_mut_slice (line 45919) | pub fn as_mut_slice(&mut self) -> &mut [T] { function allocator (line 45926) | pub fn allocator(&self) -> &A { function as_raw_mut_slice (line 45930) | fn as_raw_mut_slice(&mut self) -> *mut [T] { function forget_allocation_drop_remaining (line 45943) | pub(super) fn forget_allocation_drop_remaining(&mut self) { function as_ref (line 45962) | fn as_ref(&self) -> &[T] { type Item (line 45974) | type Item = T; method next (line 45977) | fn next(&mut self) -> Option { method size_hint (line 45997) | fn size_hint(&self) -> (usize, Option) { method count (line 46007) | fn count(self) -> usize { method __iterator_get_unchecked (line 46011) | unsafe fn __iterator_get_unchecked(&mut self, i: usize) -> Self::Item method next_back (line 46032) | fn next_back(&mut self) -> Option { method is_empty (line 46051) | fn is_empty(&self) -> bool { constant MAY_HAVE_SIDE_EFFECT (line 46070) | const MAY_HAVE_SIDE_EFFECT: bool = false; method clone (line 46076) | fn clone(&self) -> Self { method clone (line 46080) | fn clone(&self) -> Self { method drop (line 46087) | fn drop(&mut self) { type Source (line 46115) | type Source = Self; method as_inner (line 46118) | unsafe fn as_inner(&mut self) -> &mut Self::Source { type AsIntoIter (line 46125) | pub(crate) trait AsIntoIter { type Item (line 45582) | type Item = I; method as_into_iter (line 45584) | fn as_into_iter(&mut self) -> &mut vec::IntoIter { method as_into_iter (line 46127) | fn as_into_iter(&mut self) -> &mut IntoIter; type Item (line 46131) | type Item = T; method as_into_iter (line 46133) | fn as_into_iter(&mut self) -> &mut IntoIter { type SpecExtend (line 46145) | pub(super) trait SpecExtend { method spec_extend (line 40003) | fn spec_extend(&mut self, iter: I); method spec_extend (line 46146) | fn spec_extend(&mut self, iter: I); function spec_extend (line 46153) | default fn spec_extend(&mut self, iter: I) { function spec_extend (line 46162) | default fn spec_extend(&mut self, iterator: I) { function spec_extend (line 46195) | fn spec_extend(&mut self, mut iterator: IntoIter) { function spec_extend (line 46208) | default fn spec_extend(&mut self, iterator: I) { function spec_extend (line 46217) | fn spec_extend(&mut self, iterator: slice::Iter<'a, T>) { type SpecFromElem (line 46229) | pub(super) trait SpecFromElem: Sized { method from_elem (line 46230) | fn from_elem(elem: Self, n: usize, alloc: A) -> Vec(elem: Self, n: usize, alloc: A) -> ... method from_elem (line 46243) | fn from_elem(elem: i8, n: usize, alloc: A) -> Vec { method from_elem (line 46258) | fn from_elem(elem: u8, n: usize, alloc: A) -> Vec { method from_elem (line 46273) | fn from_elem(elem: T, n: usize, alloc: A) -> Vec { type Drain (line 46303) | pub struct Drain< function fmt (line 46319) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function as_slice (line 46337) | pub fn as_slice(&self) -> &[T] { function allocator (line 46344) | pub fn allocator(&self) -> &A { function as_ref (line 46351) | fn as_ref(&self) -> &[T] { type Item (line 46363) | type Item = T; method next (line 46366) | fn next(&mut self) -> Option { method size_hint (line 46370) | fn size_hint(&self) -> (usize, Option) { method next_back (line 46378) | fn next_back(&mut self) -> Option { method drop (line 46385) | fn drop(&mut self) { method is_empty (line 46427) | fn is_empty(&self) -> bool { type SpecFromIterNested (line 46445) | pub(super) trait SpecFromIterNested { method from_iter (line 46446) | fn from_iter(iter: I) -> Self; function from_iter (line 46453) | default fn from_iter(mut iterator: I) -> Self { function from_iter (line 46482) | fn from_iter(iterator: I) -> Self { type IsZero (line 46499) | pub(super) unsafe trait IsZero { method is_zero (line 46501) | fn is_zero(&self) -> bool; method is_zero (line 46535) | fn is_zero(&self) -> bool { method is_zero (line 46542) | fn is_zero(&self) -> bool { method is_zero (line 46556) | fn is_zero(&self) -> bool { method is_zero (line 46563) | fn is_zero(&self) -> bool { type SpecFromIter (line 46593) | pub(super) trait SpecFromIter { method from_iter (line 46594) | fn from_iter(iter: I) -> Self; function from_iter (line 46601) | default fn from_iter(iterator: I) -> Self { function from_iter (line 46607) | fn from_iter(iterator: IntoIter) -> Self { function from_iter (line 46640) | default fn from_iter(iterator: I) -> Self { function from_iter (line 46651) | fn from_iter(iterator: slice::Iter<'a, T>) -> Self { function from_iter (line 46660) | fn from_iter(iterator: slice::Iter<'a, T>) -> Self { type SourceIterMarker (line 46677) | pub(super) trait SourceIterMarker: SourceIter {} function from_iter (line 46691) | default fn from_iter(mut iterator: I) -> Self { function write_in_place_with_drop (line 46745) | fn write_in_place_with_drop( type SpecInPlaceCollect (line 46762) | trait SpecInPlaceCollect: Iterator { method collect_in_place (line 46765) | fn collect_in_place(&mut self, dst: *mut T, end: *const T) -> usize; method collect_in_place (line 46773) | default fn collect_in_place(&mut self, dst_buf: *mut T, end: *const T) -... method collect_in_place (line 46791) | fn collect_in_place(&mut self, dst_buf: *mut T, end: *const T) -> usize { type Vec (line 47182) | pub struct Vec Self { function with_capacity (line 47249) | pub fn with_capacity(capacity: usize) -> Self { function from_raw_parts (line 47317) | pub unsafe fn from_raw_parts(ptr: *mut T, length: usize, capacity: usize... function new_in (line 47339) | pub const fn new_in(alloc: A) -> Self { function with_capacity_in (line 47387) | pub fn with_capacity_in(capacity: usize, alloc: A) -> Self { function from_raw_parts_in (line 47463) | pub unsafe fn from_raw_parts_in(ptr: *mut T, length: usize, capacity: us... function into_raw_parts (line 47500) | pub fn into_raw_parts(self) -> (*mut T, usize, usize) { function into_raw_parts_with_alloc (line 47544) | pub fn into_raw_parts_with_alloc(self) -> (*mut T, usize, usize, A) { function capacity (line 47564) | pub fn capacity(&self) -> usize { function reserve (line 47587) | pub fn reserve(&mut self, additional: usize) { function reserve_exact (line 47613) | pub fn reserve_exact(&mut self, additional: usize) { function try_reserve (line 47651) | pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserv... function try_reserve_exact (line 47693) | pub fn try_reserve_exact(&mut self, additional: usize) -> Result<(), Try... function shrink_to_fit (line 47713) | pub fn shrink_to_fit(&mut self) { function shrink_to (line 47743) | pub fn shrink_to(&mut self, min_capacity: usize) { function into_boxed_slice (line 47774) | pub fn into_boxed_slice(mut self) -> Box<[T], A> { function truncate (line 47827) | pub fn truncate(&mut self, len: usize) { function as_slice (line 47862) | pub fn as_slice(&self) -> &[T] { function as_mut_slice (line 47879) | pub fn as_mut_slice(&mut self) -> &mut [T] { function as_ptr (line 47910) | pub fn as_ptr(&self) -> *const T { function as_mut_ptr (line 47946) | pub fn as_mut_ptr(&mut self) -> *mut T { function allocator (line 47959) | pub fn allocator(&self) -> &A { function set_len (line 48043) | pub unsafe fn set_len(&mut self, new_len: usize) { function swap_remove (line 48072) | pub fn swap_remove(&mut self, index: usize) -> T { function insert (line 48111) | pub fn insert(&mut self, index: usize, element: T) { function remove (line 48159) | pub fn remove(&mut self, index: usize) -> T { function retain (line 48213) | pub fn retain(&mut self, mut f: F) function dedup_by_key (line 48304) | pub fn dedup_by_key(&mut self, mut key: F) function dedup_by (line 48331) | pub fn dedup_by(&mut self, mut same_bucket: F) function push (line 48440) | pub fn push(&mut self, value: T) { function pop (line 48465) | pub fn pop(&mut self) -> Option { function append (line 48493) | pub fn append(&mut self, other: &mut Self) { function append_elements (line 48502) | unsafe fn append_elements(&mut self, other: *const [T]) { function drain (line 48536) | pub fn drain(&mut self, range: R) -> Drain<'_, T, A> function clear (line 48584) | pub fn clear(&mut self) { function len (line 48600) | pub fn len(&self) -> usize { function is_empty (line 48616) | pub fn is_empty(&self) -> bool { function split_off (line 48641) | pub fn split_off(&mut self, at: usize) -> Self function resize_with (line 48703) | pub fn resize_with(&mut self, new_len: usize, f: F) function leak (line 48739) | pub fn leak<'a>(self) -> &'a mut [T] function spare_capacity_mut (line 48778) | pub fn spare_capacity_mut(&mut self) -> &mut [MaybeUninit] { function split_at_spare_mut (line 48843) | pub fn split_at_spare_mut(&mut self) -> (&mut [T], &mut [MaybeUninit]) { function split_at_spare_mut_with_len (line 48853) | unsafe fn split_at_spare_mut_with_len( function resize (line 48896) | pub fn resize(&mut self, new_len: usize, value: T) { function extend_from_slice (line 48926) | pub fn extend_from_slice(&mut self, other: &[T]) { function extend_from_within (line 48947) | pub fn extend_from_within(&mut self, src: R) type ExtendWith (line 48963) | trait ExtendWith { method next (line 48964) | fn next(&mut self) -> T; method last (line 48965) | fn last(self) -> T; type ExtendElement (line 48968) | struct ExtendElement(T); function next (line 48970) | fn next(&mut self) -> T { function last (line 48973) | fn last(self) -> T { type ExtendDefault (line 48978) | struct ExtendDefault; method next (line 48980) | fn next(&mut self) -> T { method last (line 48983) | fn last(self) -> T { type ExtendFunc (line 48988) | struct ExtendFunc(F); function next (line 48990) | fn next(&mut self) -> T { function last (line 48993) | fn last(mut self) -> T { function extend_with (line 49000) | fn extend_with>(&mut self, n: usize, mut value: E) { function dedup (line 49046) | pub fn dedup(&mut self) { function from_elem (line 49057) | pub fn from_elem(elem: T, n: usize) -> Vec { function from_elem_in (line 49063) | pub fn from_elem_in(elem: T, n: usize, alloc: A)... type ExtendFromWithinSpec (line 49067) | trait ExtendFromWithinSpec { method spec_extend_from_within (line 49072) | unsafe fn spec_extend_from_within(&mut self, src: Range); method spec_extend_from_within (line 49076) | default unsafe fn spec_extend_from_within(&mut self, src: Range) { method spec_extend_from_within (line 49095) | unsafe fn spec_extend_from_within(&mut self, src: Range) { type Target (line 49128) | type Target = [T]; function deref (line 49130) | fn deref(&self) -> &[T] { function deref_mut (line 49137) | fn deref_mut(&mut self) -> &mut [T] { method clone (line 49145) | fn clone(&self) -> Self { method clone (line 49155) | fn clone(&self) -> Self { method clone_from (line 49160) | fn clone_from(&mut self, other: &Self) { method hash (line 49177) | fn hash(&self, state: &mut H) { type Output (line 49188) | type Output = I::Output; function index (line 49191) | fn index(&self, index: I) -> &Self::Output { function index_mut (line 49203) | fn index_mut(&mut self, index: I) -> &mut Self::Output { function from_iter (line 49211) | fn from_iter>(iter: I) -> Vec { type Item (line 49218) | type Item = T; type IntoIter (line 49219) | type IntoIter = IntoIter; method into_iter (line 49235) | fn into_iter(self) -> IntoIter { type Item (line 49260) | type Item = &'a T; type IntoIter (line 49261) | type IntoIter = slice::Iter<'a, T>; method into_iter (line 49263) | fn into_iter(self) -> slice::Iter<'a, T> { type Item (line 49270) | type Item = &'a mut T; type IntoIter (line 49271) | type IntoIter = slice::IterMut<'a, T>; method into_iter (line 49273) | fn into_iter(self) -> slice::IterMut<'a, T> { function extend (line 49281) | fn extend>(&mut self, iter: I) { function extend_one (line 49286) | fn extend_one(&mut self, item: T) { function extend_reserve (line 49291) | fn extend_reserve(&mut self, additional: usize) { function extend_desugared (line 49299) | fn extend_desugared>(&mut self, mut iterator: I) { function splice (line 49356) | pub fn splice(&mut self, range: R, replace_with: I) -> Splice<'_, ... function drain_filter (line 49409) | pub fn drain_filter(&mut self, filter: F) -> DrainFilter<'_, T, F, A> function extend (line 49432) | fn extend>(&mut self, iter: I) { function extend_one (line 49437) | fn extend_one(&mut self, &item: &'a T) { function extend_reserve (line 49442) | fn extend_reserve(&mut self, additional: usize) { method partial_cmp (line 49451) | fn partial_cmp(&self, other: &Self) -> Option { method cmp (line 49463) | fn cmp(&self, other: &Self) -> Ordering { method drop (line 49470) | fn drop(&mut self) { method default (line 49484) | fn default() -> Vec { function fmt (line 49491) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function as_ref (line 49498) | fn as_ref(&self) -> &Vec { function as_mut (line 49505) | fn as_mut(&mut self) -> &mut Vec { function as_ref (line 49512) | fn as_ref(&self) -> &[T] { function as_mut (line 49519) | fn as_mut(&mut self) -> &mut [T] { function from (line 49534) | fn from(s: &[T]) -> Vec { function from (line 49538) | fn from(s: &[T]) -> Vec { function from (line 49553) | fn from(s: &mut [T]) -> Vec { function from (line 49557) | fn from(s: &mut [T]) -> Vec { function from (line 49565) | fn from(s: [T; N]) -> Vec { function from (line 49576) | fn from(s: [T; N]) -> Vec { function from (line 49600) | fn from(s: Cow<'a, [T]>) -> Vec { function from (line 49618) | fn from(s: Box<[T], A>) -> Self { function from (line 49637) | fn from(v: Vec) -> Self { function from (line 49651) | fn from(s: &str) -> Vec { type Error (line 49658) | type Error = Vec; function try_from (line 49689) | fn try_from(mut vec: Vec) -> Result<[T; N], Vec> { type SetLenOnDrop (line 49711) | pub(super) struct SetLenOnDrop<'a> { function new (line 49718) | pub(super) fn new(len: &'a mut usize) -> Self { function increment_len (line 49723) | pub(super) fn increment_len(&mut self, increment: usize) { method drop (line 49730) | fn drop(&mut self) { type DrainFilter (line 49755) | pub struct DrainFilter< function allocator (line 49787) | pub fn allocator(&self) -> &A { type Item (line 49797) | type Item = T; method next (line 49799) | fn next(&mut self) -> Option { method size_hint (line 49825) | fn size_hint(&self) -> (usize, Option) { method drop (line 49835) | fn drop(&mut self) { function from (line 49884) | fn from(s: &'a [T]) -> Cow<'a, [T]> { function from (line 49891) | fn from(v: Vec) -> Cow<'a, [T]> { function from (line 49898) | fn from(v: &'a Vec) -> Cow<'a, [T]> { function from_iter (line 49908) | fn from_iter>(it: I) -> Cow<'a, [T]> { type Splice (line 49975) | pub struct Splice< type Item (line 49986) | type Item = I::Item; method next (line 49988) | fn next(&mut self) -> Option { method size_hint (line 49992) | fn size_hint(&self) -> (usize, Option) { method next_back (line 49999) | fn next_back(&mut self) -> Option { method drop (line 50009) | fn drop(&mut self) { function fill (line 50054) | unsafe fn fill>(&mut self, replace_with: &mut I) -... function move_tail (line 50074) | unsafe fn move_tail(&mut self, additional: usize) { type InPlaceDrop (line 50093) | pub(super) struct InPlaceDrop { function len (line 50099) | fn len(&self) -> usize { method drop (line 50106) | fn drop(&mut self) { function allocate_zeroed (line 50148) | fn allocate_zeroed() { function alloc_owned_small (line 50166) | fn alloc_owned_small(b: &mut Bencher) { type Box (line 50335) | pub struct Box< function new (line 50354) | pub fn new(x: T) -> Self { function new_uninit (line 50378) | pub fn new_uninit() -> Box> { function new_zeroed (line 50403) | pub fn new_zeroed() -> Box> { function pin (line 50411) | pub fn pin(x: T) -> Pin> { function try_new (line 50430) | pub fn try_new(x: T) -> Result { function try_new_uninit (line 50457) | pub fn try_new_uninit() -> Result>, AllocError> { function try_new_zeroed (line 50483) | pub fn try_new_zeroed() -> Result>, AllocError> { function new_in (line 50504) | pub fn new_in(x: T, alloc: A) -> Self { function try_new_in (line 50529) | pub fn try_new_in(x: T, alloc: A) -> Result { function new_uninit_in (line 50559) | pub fn new_uninit_in(alloc: A) -> Box, A> { function try_new_uninit_in (line 50593) | pub fn try_new_uninit_in(alloc: A) -> Result, A>... function new_zeroed_in (line 50621) | pub fn new_zeroed_in(alloc: A) -> Box, A> { function try_new_zeroed_in (line 50655) | pub fn try_new_zeroed_in(alloc: A) -> Result, A>... function pin_in (line 50665) | pub fn pin_in(x: T, alloc: A) -> Pin function into_boxed_slice (line 50676) | pub fn into_boxed_slice(boxed: Self) -> Box<[T], A> { function into_inner (line 50694) | pub fn into_inner(boxed: Self) -> T { function new_uninit_slice (line 50721) | pub fn new_uninit_slice(len: usize) -> Box<[mem::MaybeUninit]> { function new_zeroed_slice (line 50744) | pub fn new_zeroed_slice(len: usize) -> Box<[mem::MaybeUninit]> { function new_uninit_slice_in (line 50774) | pub fn new_uninit_slice_in(len: usize, alloc: A) -> Box<[mem::MaybeUnini... function new_zeroed_slice_in (line 50800) | pub fn new_zeroed_slice_in(len: usize, alloc: A) -> Box<[mem::MaybeUnini... function assume_init (line 50836) | pub unsafe fn assume_init(self) -> Box { function assume_init (line 50875) | pub unsafe fn assume_init(self) -> Box<[T], A> { function from_raw (line 50925) | pub unsafe fn from_raw(raw: *mut T) -> Self { function from_raw_in (line 50980) | pub unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Self { function into_raw (line 51025) | pub fn into_raw(b: Self) -> *mut T { function into_raw_with_allocator (line 51077) | pub fn into_raw_with_allocator(b: Self) -> (*mut T, A) { function into_unique (line 51089) | pub fn into_unique(b: Self) -> (Unique, A) { function allocator (line 51106) | pub fn allocator(b: &Self) -> &A { function leak (line 51147) | pub fn leak<'a>(b: Self) -> &'a mut T function into_pin (line 51160) | pub fn into_pin(boxed: Self) -> Pin method drop (line 51173) | fn drop(&mut self) { method default (line 51181) | fn default() -> Self { method default (line 51188) | fn default() -> Self { method default (line 51195) | fn default() -> Self { method clone (line 51217) | fn clone(&self) -> Self { method clone_from (line 51244) | fn clone_from(&mut self, source: &Self) { method clone (line 51251) | fn clone(&self) -> Self { method eq (line 51261) | fn eq(&self, other: &Self) -> bool { method ne (line 51265) | fn ne(&self, other: &Self) -> bool { method partial_cmp (line 51272) | fn partial_cmp(&self, other: &Self) -> Option { method lt (line 51276) | fn lt(&self, other: &Self) -> bool { method le (line 51280) | fn le(&self, other: &Self) -> bool { method ge (line 51284) | fn ge(&self, other: &Self) -> bool { method gt (line 51288) | fn gt(&self, other: &Self) -> bool { method cmp (line 51295) | fn cmp(&self, other: &Self) -> Ordering { method hash (line 51304) | fn hash(&self, state: &mut H) { method finish (line 51311) | fn finish(&self) -> u64 { method write (line 51314) | fn write(&mut self, bytes: &[u8]) { method write_u8 (line 51317) | fn write_u8(&mut self, i: u8) { method write_u16 (line 51320) | fn write_u16(&mut self, i: u16) { method write_u32 (line 51323) | fn write_u32(&mut self, i: u32) { method write_u64 (line 51326) | fn write_u64(&mut self, i: u64) { method write_u128 (line 51329) | fn write_u128(&mut self, i: u128) { method write_usize (line 51332) | fn write_usize(&mut self, i: usize) { method write_i8 (line 51335) | fn write_i8(&mut self, i: i8) { method write_i16 (line 51338) | fn write_i16(&mut self, i: i16) { method write_i32 (line 51341) | fn write_i32(&mut self, i: i32) { method write_i64 (line 51344) | fn write_i64(&mut self, i: i64) { method write_i128 (line 51347) | fn write_i128(&mut self, i: i128) { method write_isize (line 51350) | fn write_isize(&mut self, i: isize) { function from (line 51369) | fn from(t: T) -> Self { function from (line 51382) | fn from(boxed: Box) -> Self { function from (line 51402) | fn from(slice: &[T]) -> Box<[T]> { function from (line 51415) | fn from(cow: Cow<'_, [T]>) -> Box<[T]> { function from (line 51436) | fn from(s: &str) -> Box { function from (line 51444) | fn from(cow: Cow<'_, str>) -> Box { function from (line 51471) | fn from(s: Box) -> Self { function from (line 51488) | fn from(array: [T; N]) -> Box<[T]> { type Error (line 51495) | type Error = Box<[T]>; function try_from (line 51497) | fn try_from(boxed_slice: Box<[T]>) -> Result { function downcast (line 51526) | pub fn downcast(self) -> Result, Self> { function downcast (line 51558) | pub fn downcast(self) -> Result, Self> { function downcast (line 51590) | pub fn downcast(self) -> Result, Self> { function fmt (line 51605) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 51612) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { function fmt (line 51619) | fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { type Target (line 51629) | type Target = T; method deref (line 51631) | fn deref(&self) -> &T { method deref_mut (line 51638) | fn deref_mut(&mut self) -> &mut T { type Item (line 51648) | type Item = I::Item; method next (line 51649) | fn next(&mut self) -> Option { method size_hint (line 51652) | fn size_hint(&self) -> (usize, Option) { method nth (line 51655) | fn nth(&mut self, n: usize) -> Option { method last (line 51658) | fn last(self) -> Option { type BoxIter (line 51663) | trait BoxIter { method last (line 51665) | fn last(self) -> Option; type Item (line 51669) | type Item = I::Item; method last (line 51670) | default fn last(self) -> Option { method last (line 51684) | fn last(self) -> Option { method next_back (line 51691) | fn next_back(&mut self) -> Option { method nth_back (line 51694) | fn nth_back(&mut self, n: usize) -> Option { method len (line 51700) | fn len(&self) -> usize { method is_empty (line 51703) | fn is_empty(&self) -> bool { type Output (line 51713) | type Output = >::Output; function call_once (line 51715) | extern "rust-call" fn call_once(self, args: Args) -> Self::Output { function call_mut (line 51722) | extern "rust-call" fn call_mut(&mut self, args: Args) -> Self::Output { function call (line 51729) | extern "rust-call" fn call(&self, args: Args) -> Self::Output { function from_iter (line 51742) | fn from_iter>(iter: T) -> Self { method clone (line 51749) | fn clone(&self) -> Self { method clone_from (line 51754) | fn clone_from(&mut self, other: &Self) { function borrow (line 51765) | fn borrow(&self) -> &T { function borrow_mut (line 51772) | fn borrow_mut(&mut self) -> &mut T { function as_ref (line 51779) | fn as_ref(&self) -> &T { function as_mut (line 51786) | fn as_mut(&mut self) -> &mut T { type Yield (line 51821) | type Yield = G::Yield; type Return (line 51822) | type Return = G::Return; function resume (line 51824) | fn resume(mut self: Pin<&mut Self>, arg: R) -> GeneratorState, arg: R) -> GeneratorState, cx: &mut Context<'_>) -> Poll, cx: &mut Context<'_>) -> Poll (usize, Option) { function allocator_param (line 51870) | fn allocator_param() { function reserve_does_not_overallocate (line 51915) | fn reserve_does_not_overallocate() { function test_owned_clone (line 51956) | fn test_owned_clone() { type Test (line 51963) | struct Test; function any_move (line 51966) | fn any_move() { function test_show (line 51991) | fn test_show() { function deref (line 52010) | fn deref() { function raw_sized (line 52016) | fn raw_sized() { function raw_trait (line 52028) | fn raw_trait() { function f64_slice (line 52057) | fn f64_slice() { function i64_slice (line 52064) | fn i64_slice() { function str_slice (line 52071) | fn str_slice() { function boxed_slice_from_iter (line 52078) | fn boxed_slice_from_iter() { function test_array_from_slice (line 52086) | fn test_array_from_slice() { FILE: benchmarks/shared/lib.rs type Benchmark (line 14) | pub struct Benchmark { method from_stdin (line 27) | pub fn from_stdin() -> anyhow::Result { method one_needle (line 35) | pub fn one_needle(&self) -> anyhow::Result<&[u8]> { method one_needle_byte (line 47) | pub fn one_needle_byte(&self) -> anyhow::Result { method two_needle_bytes (line 64) | pub fn two_needle_bytes(&self) -> anyhow::Result<(u8, u8)> { method three_needle_bytes (line 86) | pub fn three_needle_bytes(&self) -> anyhow::Result<(u8, u8, u8)> { method read (line 110) | fn read(mut raw: &[u8]) -> anyhow::Result { method set (line 120) | fn set(&mut self, klv: OneKLV) -> anyhow::Result<()> { type OneKLV (line 147) | struct OneKLV { method read (line 153) | fn read(bytes: &[u8]) -> anyhow::Result<(OneKLV, usize)> { type Sample (line 219) | pub struct Sample { function run (line 233) | pub fn run( function run_and_count (line 250) | pub fn run_and_count( function count_memchr (line 283) | pub fn count_memchr( function count_memchr2 (line 296) | pub fn count_memchr2( function count_memchr3 (line 310) | pub fn count_memchr3( function count_memmem (line 325) | pub fn count_memmem( function count_memmem_str (line 341) | pub fn count_memmem_str( FILE: src/arch/aarch64/memchr.rs function memchr_raw (line 41) | pub(crate) unsafe fn memchr_raw( function memrchr_raw (line 55) | pub(crate) unsafe fn memrchr_raw( function memchr2_raw (line 69) | pub(crate) unsafe fn memchr2_raw( function memrchr2_raw (line 84) | pub(crate) unsafe fn memrchr2_raw( function memchr3_raw (line 99) | pub(crate) unsafe fn memchr3_raw( function memrchr3_raw (line 115) | pub(crate) unsafe fn memrchr3_raw( function count_raw (line 131) | pub(crate) unsafe fn count_raw( FILE: src/arch/aarch64/neon/memchr.rs type One (line 29) | pub struct One(generic::One); method new (line 40) | pub fn new(needle: u8) -> Option { method new_unchecked (line 63) | pub unsafe fn new_unchecked(needle: u8) -> One { method is_available (line 77) | pub fn is_available() -> bool { method find (line 94) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 110) | pub fn rfind(&self, haystack: &[u8]) -> Option { method count (line 122) | pub fn count(&self, haystack: &[u8]) -> usize { method find_raw (line 156) | pub unsafe fn find_raw( method rfind_raw (line 200) | pub unsafe fn rfind_raw( method count_raw (line 241) | pub unsafe fn count_raw(&self, start: *const u8, end: *const u8) -> us... method find_raw_impl (line 269) | unsafe fn find_raw_impl( method rfind_raw_impl (line 289) | unsafe fn rfind_raw_impl( method count_raw_impl (line 309) | unsafe fn count_raw_impl( method iter (line 323) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> OneIter<'a, 'h> { type OneIter (line 340) | pub struct OneIter<'a, 'h> { type Item (line 346) | type Item = usize; method next (line 349) | fn next(&mut self) -> Option { method count (line 357) | fn count(self) -> usize { method size_hint (line 366) | fn size_hint(&self) -> (usize, Option) { method next_back (line 373) | fn next_back(&mut self) -> Option { type Two (line 389) | pub struct Two(generic::Two); method new (line 400) | pub fn new(needle1: u8, needle2: u8) -> Option { method new_unchecked (line 423) | pub unsafe fn new_unchecked(needle1: u8, needle2: u8) -> Two { method is_available (line 437) | pub fn is_available() -> bool { method find (line 454) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 470) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 504) | pub unsafe fn find_raw( method rfind_raw (line 548) | pub unsafe fn rfind_raw( method find_raw_impl (line 580) | unsafe fn find_raw_impl( method rfind_raw_impl (line 600) | unsafe fn rfind_raw_impl( method iter (line 614) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> TwoIter<'a, 'h> { type TwoIter (line 631) | pub struct TwoIter<'a, 'h> { type Item (line 637) | type Item = usize; method next (line 640) | fn next(&mut self) -> Option { method size_hint (line 648) | fn size_hint(&self) -> (usize, Option) { method next_back (line 655) | fn next_back(&mut self) -> Option { type Three (line 671) | pub struct Three(generic::Three); method new (line 682) | pub fn new(needle1: u8, needle2: u8, needle3: u8) -> Option { method new_unchecked (line 705) | pub unsafe fn new_unchecked( method is_available (line 723) | pub fn is_available() -> bool { method find (line 740) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 756) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 790) | pub unsafe fn find_raw( method rfind_raw (line 836) | pub unsafe fn rfind_raw( method find_raw_impl (line 870) | unsafe fn find_raw_impl( method rfind_raw_impl (line 890) | unsafe fn rfind_raw_impl( method iter (line 904) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> ThreeIter<'a, 'h> { type ThreeIter (line 921) | pub struct ThreeIter<'a, 'h> { type Item (line 927) | type Item = usize; method next (line 930) | fn next(&mut self) -> Option { method size_hint (line 938) | fn size_hint(&self) -> (usize, Option) { method next_back (line 945) | fn next_back(&mut self) -> Option { function forward_one (line 962) | fn forward_one() { function reverse_one (line 971) | fn reverse_one() { function count_one (line 980) | fn count_one() { function forward_two (line 987) | fn forward_two() { function reverse_two (line 998) | fn reverse_two() { function forward_three (line 1009) | fn forward_three() { function reverse_three (line 1021) | fn reverse_three() { FILE: src/arch/aarch64/neon/packedpair.rs type Finder (line 23) | pub struct Finder(packedpair::Finder); method new (line 41) | pub fn new(needle: &[u8]) -> Option { method with_pair (line 53) | pub fn with_pair(needle: &[u8], pair: Pair) -> Option { method with_pair_impl (line 72) | unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { method is_available (line 90) | pub fn is_available() -> bool { method find (line 107) | pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_prefilter (line 118) | pub fn find_prefilter(&self, haystack: &[u8]) -> Option { method find_impl (line 136) | unsafe fn find_impl( method find_prefilter_impl (line 157) | unsafe fn find_prefilter_impl(&self, haystack: &[u8]) -> Option { method pair (line 165) | pub fn pair(&self) -> &Pair { method min_haystack_len (line 177) | pub fn min_haystack_len(&self) -> usize { function find (line 186) | fn find(haystack: &[u8], needle: &[u8]) -> Option> { function forward_substring (line 197) | fn forward_substring() { function forward_packedpair (line 202) | fn forward_packedpair() { function forward_packedpair_prefilter (line 220) | fn forward_packedpair_prefilter() { FILE: src/arch/all/memchr.rs constant USIZE_BYTES (line 29) | const USIZE_BYTES: usize = (usize::BITS / 8) as usize; constant USIZE_ALIGN (line 31) | const USIZE_ALIGN: usize = USIZE_BYTES - 1; type One (line 35) | pub struct One { constant LOOP_BYTES (line 42) | const LOOP_BYTES: usize = 2 * USIZE_BYTES; method new (line 46) | pub fn new(needle: u8) -> One { method try_new (line 55) | pub(crate) fn try_new(needle: u8) -> Option { method find (line 65) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 81) | pub fn rfind(&self, haystack: &[u8]) -> Option { method count (line 93) | pub fn count(&self, haystack: &[u8]) -> usize { method find_raw (line 127) | pub unsafe fn find_raw( method rfind_raw (line 197) | pub unsafe fn rfind_raw( method count_raw (line 256) | pub unsafe fn count_raw(&self, start: *const u8, end: *const u8) -> us... method iter (line 276) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> OneIter<'a, 'h> { method has_needle (line 281) | fn has_needle(&self, chunk: usize) -> bool { method confirm (line 286) | fn confirm(&self, haystack_byte: u8) -> bool { type OneIter (line 303) | pub struct OneIter<'a, 'h> { type Item (line 311) | type Item = usize; method next (line 314) | fn next(&mut self) -> Option { method count (line 322) | fn count(self) -> usize { method size_hint (line 331) | fn size_hint(&self) -> (usize, Option) { method next_back (line 338) | fn next_back(&mut self) -> Option { type Two (line 352) | pub struct Two { method new (line 363) | pub fn new(needle1: u8, needle2: u8) -> Two { method try_new (line 377) | pub(crate) fn try_new(needle1: u8, needle2: u8) -> Option { method find (line 387) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 403) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 437) | pub unsafe fn find_raw( method rfind_raw (line 503) | pub unsafe fn rfind_raw( method iter (line 541) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> TwoIter<'a, 'h> { method has_needle (line 546) | fn has_needle(&self, chunk: usize) -> bool { method confirm (line 551) | fn confirm(&self, haystack_byte: u8) -> bool { type TwoIter (line 568) | pub struct TwoIter<'a, 'h> { type Item (line 576) | type Item = usize; method next (line 579) | fn next(&mut self) -> Option { method size_hint (line 587) | fn size_hint(&self) -> (usize, Option) { method next_back (line 594) | fn next_back(&mut self) -> Option { type Three (line 608) | pub struct Three { method new (line 621) | pub fn new(needle1: u8, needle2: u8, needle3: u8) -> Three { method try_new (line 637) | pub(crate) fn try_new( method find (line 651) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 667) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 701) | pub unsafe fn find_raw( method rfind_raw (line 767) | pub unsafe fn rfind_raw( method iter (line 805) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> ThreeIter<'a, 'h> { method has_needle (line 810) | fn has_needle(&self, chunk: usize) -> bool { method confirm (line 817) | fn confirm(&self, haystack_byte: u8) -> bool { type ThreeIter (line 836) | pub struct ThreeIter<'a, 'h> { type Item (line 844) | type Item = usize; method next (line 847) | fn next(&mut self) -> Option { method size_hint (line 855) | fn size_hint(&self) -> (usize, Option) { method next_back (line 862) | fn next_back(&mut self) -> Option { function has_zero_byte (line 877) | fn has_zero_byte(x: usize) -> bool { function splat (line 892) | const fn splat(b: u8) -> usize { function forward_one (line 904) | fn forward_one() { function reverse_one (line 913) | fn reverse_one() { function count_one (line 922) | fn count_one() { function forward_two (line 929) | fn forward_two() { function reverse_two (line 940) | fn reverse_two() { function forward_three (line 951) | fn forward_three() { function reverse_three (line 963) | fn reverse_three() { function regression_double_ended_iterator (line 977) | fn regression_double_ended_iterator() { function regression_count_new_lines (line 991) | fn regression_count_new_lines() { function regression_big_endian1 (line 1010) | fn regression_big_endian1() { function regression_big_endian2 (line 1018) | fn regression_big_endian2() { FILE: src/arch/all/mod.rs function is_prefix (line 26) | pub fn is_prefix(haystack: &[u8], needle: &[u8]) -> bool { function is_suffix (line 42) | pub fn is_suffix(haystack: &[u8], needle: &[u8]) -> bool { function is_equal (line 65) | pub fn is_equal(x: &[u8], y: &[u8]) -> bool { function is_equal_raw (line 108) | pub unsafe fn is_equal_raw( function equals_different_lengths (line 165) | fn equals_different_lengths() { function equals_mismatch (line 173) | fn equals_mismatch() { function equals_yes (line 198) | fn equals_yes() { function prefix (line 212) | fn prefix() { function suffix (line 224) | fn suffix() { FILE: src/arch/all/packedpair/default_rank.rs constant RANK (line 1) | pub(crate) const RANK: [u8; 256] = [ FILE: src/arch/all/packedpair/mod.rs type Finder (line 35) | pub struct Finder { method new (line 45) | pub fn new(needle: &[u8]) -> Option { method with_pair (line 56) | pub fn with_pair(needle: &[u8], pair: Pair) -> Option { method find_prefilter (line 69) | pub fn find_prefilter(&self, haystack: &[u8]) -> Option { method pair (line 107) | pub fn pair(&self) -> &Pair { type Pair (line 135) | pub struct Pair { method new (line 149) | pub fn new(needle: &[u8]) -> Option { method with_ranker (line 163) | pub fn with_ranker( method with_indices (line 214) | pub fn with_indices( method index1 (line 238) | pub fn index1(&self) -> u8 { method index2 (line 244) | pub fn index2(&self) -> u8 { type HeuristicFrequencyRank (line 309) | pub trait HeuristicFrequencyRank { method rank (line 317) | fn rank(&self, byte: u8) -> u8; method rank (line 324) | fn rank(&self, byte: u8) -> u8 { method rank (line 335) | fn rank(&self, byte: u8) -> u8 { type DefaultFrequencyRank (line 321) | pub(crate) struct DefaultFrequencyRank; function forward_packedpair (line 345) | fn forward_packedpair() { FILE: src/arch/all/rabinkarp.rs type Finder (line 69) | pub struct Finder { method new (line 87) | pub fn new(needle: &[u8]) -> Finder { method find (line 111) | pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_raw (line 150) | pub unsafe fn find_raw( type FinderRev (line 180) | pub struct FinderRev(Finder); method new (line 185) | pub fn new(needle: &[u8]) -> FinderRev { method rfind (line 209) | pub fn rfind(&self, haystack: &[u8], needle: &[u8]) -> Option { method rfind_raw (line 248) | pub unsafe fn rfind_raw( function is_fast (line 278) | pub(crate) fn is_fast(haystack: &[u8], _needle: &[u8]) -> bool { type Hash (line 285) | struct Hash(u32); method new (line 290) | fn new() -> Hash { method forward (line 300) | unsafe fn forward(mut start: *const u8, end: *const u8) -> Hash { method reverse (line 315) | unsafe fn reverse(start: *const u8, mut end: *const u8) -> Hash { method roll (line 330) | fn roll(&mut self, finder: &Finder, old: u8, new: u8) { method add (line 337) | fn add(&mut self, byte: u8) { method del (line 344) | fn del(&mut self, finder: &Finder, byte: u8) { function is_equal_raw (line 362) | unsafe fn is_equal_raw(x: *const u8, y: *const u8, n: usize) -> bool { function forward (line 378) | fn forward() { function reverse (line 385) | fn reverse() { FILE: src/arch/all/shiftor.rs type Mask (line 16) | type Mask = u16; type Finder (line 20) | pub struct Finder { constant MAX_NEEDLE_LEN (line 26) | const MAX_NEEDLE_LEN: usize = (Mask::BITS - 1) as usize; method new (line 32) | pub fn new(needle: &[u8]) -> Option { method find (line 61) | pub fn find(&self, haystack: &[u8]) -> Option { function forward (line 84) | fn forward() { FILE: src/arch/all/twoway.rs type Finder (line 37) | pub struct Finder(TwoWay); method new (line 114) | pub fn new(needle: &[u8]) -> Finder { method find (line 137) | pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_with_prefilter (line 151) | pub(crate) fn find_with_prefilter( method find_small_imp (line 174) | fn find_small_imp( method find_large_imp (line 226) | fn find_large_imp( type FinderRev (line 41) | pub struct FinderRev(TwoWay); method new (line 278) | pub fn new(needle: &[u8]) -> FinderRev { method rfind (line 301) | pub fn rfind(&self, haystack: &[u8], needle: &[u8]) -> Option { method rfind_small_imp (line 317) | fn rfind_small_imp( method rfind_large_imp (line 359) | fn rfind_large_imp( type TwoWay (line 80) | struct TwoWay { type Shift (line 428) | enum Shift { method forward (line 440) | fn forward( method reverse (line 463) | fn reverse( type Suffix (line 483) | struct Suffix { method forward (line 500) | fn forward(needle: &[u8], kind: SuffixKind) -> Suffix { method reverse (line 548) | fn reverse(needle: &[u8], kind: SuffixKind) -> Suffix { type SuffixKind (line 590) | enum SuffixKind { method cmp (line 630) | fn cmp(self, current: u8, candidate: u8) -> SuffixOrdering { type SuffixOrdering (line 609) | enum SuffixOrdering { type ApproximateByteSet (line 651) | struct ApproximateByteSet(u64); method new (line 655) | fn new(needle: &[u8]) -> ApproximateByteSet { method contains (line 666) | fn contains(&self, byte: u8) -> bool { function get_suffix_forward (line 678) | fn get_suffix_forward(needle: &[u8], kind: SuffixKind) -> (&[u8], usize) { function get_suffix_reverse (line 684) | fn get_suffix_reverse(needle: &[u8], kind: SuffixKind) -> (&[u8], usize) { function suffixes (line 690) | fn suffixes(bytes: &[u8]) -> Vec<&[u8]> { function naive_maximal_suffix_forward (line 695) | fn naive_maximal_suffix_forward(needle: &[u8]) -> &[u8] { function naive_maximal_suffix_reverse (line 703) | fn naive_maximal_suffix_reverse(needle: &[u8]) -> Vec { function forward (line 719) | fn forward() { function reverse (line 726) | fn reverse() { function suffix_forward (line 733) | fn suffix_forward() { function suffix_reverse (line 790) | fn suffix_reverse() { function regression_rev_small_period (line 871) | fn regression_rev_small_period() { FILE: src/arch/generic/memchr.rs type One (line 100) | pub(crate) struct One { constant LOOP_SIZE (line 107) | const LOOP_SIZE: usize = 4 * V::BYTES; function new (line 111) | pub(crate) unsafe fn new(needle: u8) -> One { function needle1 (line 117) | pub(crate) fn needle1(&self) -> u8 { function find_raw (line 143) | pub(crate) unsafe fn find_raw( function rfind_raw (line 254) | pub(crate) unsafe fn rfind_raw( function count_raw (line 349) | pub(crate) unsafe fn count_raw( function search_chunk (line 416) | unsafe fn search_chunk( type Two (line 437) | pub(crate) struct Two { constant LOOP_SIZE (line 446) | const LOOP_SIZE: usize = 2 * V::BYTES; function new (line 450) | pub(crate) unsafe fn new(needle1: u8, needle2: u8) -> Two { function needle1 (line 461) | pub(crate) fn needle1(&self) -> u8 { function needle2 (line 467) | pub(crate) fn needle2(&self) -> u8 { function find_raw (line 493) | pub(crate) unsafe fn find_raw( function rfind_raw (line 592) | pub(crate) unsafe fn rfind_raw( function search_chunk (line 670) | unsafe fn search_chunk( type Three (line 695) | pub(crate) struct Three { constant LOOP_SIZE (line 706) | const LOOP_SIZE: usize = 2 * V::BYTES; function new (line 710) | pub(crate) unsafe fn new( function needle1 (line 727) | pub(crate) fn needle1(&self) -> u8 { function needle2 (line 733) | pub(crate) fn needle2(&self) -> u8 { function needle3 (line 739) | pub(crate) fn needle3(&self) -> u8 { function find_raw (line 765) | pub(crate) unsafe fn find_raw( function rfind_raw (line 874) | pub(crate) unsafe fn rfind_raw( function search_chunk (line 962) | unsafe fn search_chunk( type Iter (line 999) | pub(crate) struct Iter<'h> { function new (line 1027) | pub(crate) fn new(haystack: &'h [u8]) -> Iter<'h> { function next (line 1044) | pub(crate) unsafe fn next( function count (line 1064) | pub(crate) fn count( function next_back (line 1083) | pub(crate) unsafe fn next_back( function size_hint (line 1103) | pub(crate) fn size_hint(&self) -> (usize, Option) { function search_slice_with_raw (line 1125) | pub(crate) unsafe fn search_slice_with_raw( function fwd_byte_by_byte (line 1148) | pub(crate) unsafe fn fwd_byte_by_byte bool>( function rev_byte_by_byte (line 1174) | pub(crate) unsafe fn rev_byte_by_byte bool>( function count_byte_by_byte (line 1199) | pub(crate) unsafe fn count_byte_by_byte bool>( FILE: src/arch/generic/packedpair.rs type Finder (line 35) | pub(crate) struct Finder { function new (line 54) | pub(crate) unsafe fn new(needle: &[u8], pair: Pair) -> Finder { function find (line 80) | pub(crate) unsafe fn find( function find_prefilter (line 170) | pub(crate) unsafe fn find_prefilter( function find_in_chunk (line 229) | unsafe fn find_in_chunk( function find_prefilter_in_chunk (line 269) | unsafe fn find_prefilter_in_chunk(&self, cur: *const u8) -> Option { function pair (line 288) | pub(crate) fn pair(&self) -> &Pair { function min_haystack_len (line 297) | pub(crate) fn min_haystack_len(&self) -> usize { function matched (line 312) | unsafe fn matched(start: *const u8, cur: *const u8, chunki: usize) -> us... FILE: src/arch/wasm32/memchr.rs function memchr_raw (line 28) | pub(crate) unsafe fn memchr_raw( function memrchr_raw (line 42) | pub(crate) unsafe fn memrchr_raw( function memchr2_raw (line 56) | pub(crate) unsafe fn memchr2_raw( function memrchr2_raw (line 71) | pub(crate) unsafe fn memrchr2_raw( function memchr3_raw (line 86) | pub(crate) unsafe fn memchr3_raw( function memrchr3_raw (line 102) | pub(crate) unsafe fn memrchr3_raw( function count_raw (line 118) | pub(crate) unsafe fn count_raw( FILE: src/arch/wasm32/simd128/memchr.rs type One (line 29) | pub struct One(generic::One); method new (line 40) | pub fn new(needle: u8) -> Option { method new_unchecked (line 58) | pub unsafe fn new_unchecked(needle: u8) -> One { method is_available (line 72) | pub fn is_available() -> bool { method find (line 89) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 105) | pub fn rfind(&self, haystack: &[u8]) -> Option { method count (line 117) | pub fn count(&self, haystack: &[u8]) -> usize { method find_raw (line 151) | pub unsafe fn find_raw( method rfind_raw (line 195) | pub unsafe fn rfind_raw( method count_raw (line 240) | pub unsafe fn count_raw(&self, start: *const u8, end: *const u8) -> us... method find_raw_impl (line 268) | unsafe fn find_raw_impl( method rfind_raw_impl (line 288) | unsafe fn rfind_raw_impl( method count_raw_impl (line 308) | unsafe fn count_raw_impl( method iter (line 322) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> OneIter<'a, 'h> { type OneIter (line 339) | pub struct OneIter<'a, 'h> { type Item (line 345) | type Item = usize; method next (line 348) | fn next(&mut self) -> Option { method count (line 356) | fn count(self) -> usize { method size_hint (line 365) | fn size_hint(&self) -> (usize, Option) { method next_back (line 372) | fn next_back(&mut self) -> Option { type Two (line 388) | pub struct Two(generic::Two); method new (line 399) | pub fn new(needle1: u8, needle2: u8) -> Option { method new_unchecked (line 417) | pub unsafe fn new_unchecked(needle1: u8, needle2: u8) -> Two { method is_available (line 431) | pub fn is_available() -> bool { method find (line 448) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 464) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 498) | pub unsafe fn find_raw( method rfind_raw (line 542) | pub unsafe fn rfind_raw( method find_raw_impl (line 574) | unsafe fn find_raw_impl( method rfind_raw_impl (line 594) | unsafe fn rfind_raw_impl( method iter (line 608) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> TwoIter<'a, 'h> { type TwoIter (line 625) | pub struct TwoIter<'a, 'h> { type Item (line 631) | type Item = usize; method next (line 634) | fn next(&mut self) -> Option { method size_hint (line 642) | fn size_hint(&self) -> (usize, Option) { method next_back (line 649) | fn next_back(&mut self) -> Option { type Three (line 665) | pub struct Three(generic::Three); method new (line 676) | pub fn new(needle1: u8, needle2: u8, needle3: u8) -> Option { method new_unchecked (line 694) | pub unsafe fn new_unchecked( method is_available (line 712) | pub fn is_available() -> bool { method find (line 729) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 745) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 779) | pub unsafe fn find_raw( method rfind_raw (line 825) | pub unsafe fn rfind_raw( method find_raw_impl (line 859) | unsafe fn find_raw_impl( method rfind_raw_impl (line 879) | unsafe fn rfind_raw_impl( method iter (line 893) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> ThreeIter<'a, 'h> { type ThreeIter (line 910) | pub struct ThreeIter<'a, 'h> { type Item (line 916) | type Item = usize; method next (line 919) | fn next(&mut self) -> Option { method size_hint (line 927) | fn size_hint(&self) -> (usize, Option) { method next_back (line 934) | fn next_back(&mut self) -> Option { function forward_one (line 951) | fn forward_one() { function reverse_one (line 960) | fn reverse_one() { function count_one (line 969) | fn count_one() { function forward_two (line 976) | fn forward_two() { function reverse_two (line 987) | fn reverse_two() { function forward_three (line 998) | fn forward_three() { function reverse_three (line 1010) | fn reverse_three() { FILE: src/arch/wasm32/simd128/packedpair.rs type Finder (line 23) | pub struct Finder(packedpair::Finder); method new (line 34) | pub fn new(needle: &[u8]) -> Option { method with_pair (line 46) | pub fn with_pair(needle: &[u8], pair: Pair) -> Option { method with_pair_impl (line 65) | unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { method is_available (line 83) | pub fn is_available() -> bool { method find (line 99) | pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_prefilter (line 109) | pub fn find_prefilter(&self, haystack: &[u8]) -> Option { method find_impl (line 126) | fn find_impl(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_prefilter_impl (line 146) | fn find_prefilter_impl(&self, haystack: &[u8]) -> Option { method pair (line 157) | pub fn pair(&self) -> &Pair { method min_haystack_len (line 169) | pub fn min_haystack_len(&self) -> usize { function find (line 178) | fn find(haystack: &[u8], needle: &[u8]) -> Option> { function forward_substring (line 189) | fn forward_substring() { function forward_packedpair (line 194) | fn forward_packedpair() { function forward_packedpair_prefilter (line 212) | fn forward_packedpair_prefilter() { FILE: src/arch/x86_64/avx2/memchr.rs type One (line 29) | pub struct One { method new (line 46) | pub fn new(needle: u8) -> Option { method new_unchecked (line 69) | pub unsafe fn new_unchecked(needle: u8) -> One { method is_available (line 86) | pub fn is_available() -> bool { method find (line 117) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 133) | pub fn rfind(&self, haystack: &[u8]) -> Option { method count (line 145) | pub fn count(&self, haystack: &[u8]) -> usize { method find_raw (line 179) | pub unsafe fn find_raw( method rfind_raw (line 245) | pub unsafe fn rfind_raw( method count_raw (line 299) | pub unsafe fn count_raw(&self, start: *const u8, end: *const u8) -> us... method find_raw_sse2 (line 336) | unsafe fn find_raw_sse2( method rfind_raw_sse2 (line 356) | unsafe fn rfind_raw_sse2( method count_raw_sse2 (line 376) | unsafe fn count_raw_sse2( method find_raw_avx2 (line 396) | unsafe fn find_raw_avx2( method rfind_raw_avx2 (line 416) | unsafe fn rfind_raw_avx2( method count_raw_avx2 (line 436) | unsafe fn count_raw_avx2( method iter (line 450) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> OneIter<'a, 'h> { type OneIter (line 467) | pub struct OneIter<'a, 'h> { type Item (line 473) | type Item = usize; method next (line 476) | fn next(&mut self) -> Option { method count (line 484) | fn count(self) -> usize { method size_hint (line 493) | fn size_hint(&self) -> (usize, Option) { method next_back (line 500) | fn next_back(&mut self) -> Option { type Two (line 516) | pub struct Two { method new (line 533) | pub fn new(needle1: u8, needle2: u8) -> Option { method new_unchecked (line 556) | pub unsafe fn new_unchecked(needle1: u8, needle2: u8) -> Two { method is_available (line 573) | pub fn is_available() -> bool { method find (line 604) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 620) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 654) | pub unsafe fn find_raw( method rfind_raw (line 720) | pub unsafe fn rfind_raw( method find_raw_sse2 (line 764) | unsafe fn find_raw_sse2( method rfind_raw_sse2 (line 784) | unsafe fn rfind_raw_sse2( method find_raw_avx2 (line 804) | unsafe fn find_raw_avx2( method rfind_raw_avx2 (line 824) | unsafe fn rfind_raw_avx2( method iter (line 838) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> TwoIter<'a, 'h> { type TwoIter (line 855) | pub struct TwoIter<'a, 'h> { type Item (line 861) | type Item = usize; method next (line 864) | fn next(&mut self) -> Option { method size_hint (line 872) | fn size_hint(&self) -> (usize, Option) { method next_back (line 879) | fn next_back(&mut self) -> Option { type Three (line 895) | pub struct Three { method new (line 912) | pub fn new(needle1: u8, needle2: u8, needle3: u8) -> Option { method new_unchecked (line 935) | pub unsafe fn new_unchecked( method is_available (line 956) | pub fn is_available() -> bool { method find (line 987) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 1003) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 1037) | pub unsafe fn find_raw( method rfind_raw (line 1105) | pub unsafe fn rfind_raw( method find_raw_sse2 (line 1151) | unsafe fn find_raw_sse2( method rfind_raw_sse2 (line 1171) | unsafe fn rfind_raw_sse2( method find_raw_avx2 (line 1191) | unsafe fn find_raw_avx2( method rfind_raw_avx2 (line 1211) | unsafe fn rfind_raw_avx2( method iter (line 1225) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> ThreeIter<'a, 'h> { type ThreeIter (line 1242) | pub struct ThreeIter<'a, 'h> { type Item (line 1248) | type Item = usize; method next (line 1251) | fn next(&mut self) -> Option { method size_hint (line 1259) | fn size_hint(&self) -> (usize, Option) { method next_back (line 1266) | fn next_back(&mut self) -> Option { function forward_one (line 1283) | fn forward_one() { function reverse_one (line 1292) | fn reverse_one() { function count_one (line 1301) | fn count_one() { function forward_two (line 1308) | fn forward_two() { function reverse_two (line 1319) | fn reverse_two() { function forward_three (line 1330) | fn forward_three() { function reverse_three (line 1342) | fn reverse_three() { FILE: src/arch/x86_64/avx2/packedpair.rs type Finder (line 23) | pub struct Finder { method new (line 37) | pub fn new(needle: &[u8]) -> Option { method with_pair (line 49) | pub fn with_pair(needle: &[u8], pair: Pair) -> Option { method with_pair_impl (line 68) | unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { method is_available (line 87) | pub fn is_available() -> bool { method find (line 118) | pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_prefilter (line 132) | pub fn find_prefilter(&self, haystack: &[u8]) -> Option { method find_impl (line 150) | unsafe fn find_impl( method find_prefilter_impl (line 175) | unsafe fn find_prefilter_impl(&self, haystack: &[u8]) -> Option { method pair (line 187) | pub fn pair(&self) -> &Pair { method min_haystack_len (line 199) | pub fn min_haystack_len(&self) -> usize { function find (line 219) | fn find(haystack: &[u8], needle: &[u8]) -> Option> { function forward_substring (line 230) | fn forward_substring() { function forward_packedpair (line 235) | fn forward_packedpair() { function forward_packedpair_prefilter (line 253) | fn forward_packedpair_prefilter() { FILE: src/arch/x86_64/memchr.rs function memchr_raw (line 174) | pub(crate) fn memchr_raw( function memrchr_raw (line 197) | pub(crate) fn memrchr_raw( function memchr2_raw (line 220) | pub(crate) fn memchr2_raw( function memrchr2_raw (line 245) | pub(crate) fn memrchr2_raw( function memchr3_raw (line 270) | pub(crate) fn memchr3_raw( function memrchr3_raw (line 297) | pub(crate) fn memrchr3_raw( function count_raw (line 324) | pub(crate) fn count_raw(n1: u8, start: *const u8, end: *const u8) -> usi... FILE: src/arch/x86_64/sse2/memchr.rs type One (line 29) | pub struct One(generic::One<__m128i>); method new (line 40) | pub fn new(needle: u8) -> Option { method new_unchecked (line 63) | pub unsafe fn new_unchecked(needle: u8) -> One { method is_available (line 77) | pub fn is_available() -> bool { method find (line 94) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 110) | pub fn rfind(&self, haystack: &[u8]) -> Option { method count (line 122) | pub fn count(&self, haystack: &[u8]) -> usize { method find_raw (line 156) | pub unsafe fn find_raw( method rfind_raw (line 212) | pub unsafe fn rfind_raw( method count_raw (line 257) | pub unsafe fn count_raw(&self, start: *const u8, end: *const u8) -> us... method find_raw_impl (line 285) | unsafe fn find_raw_impl( method rfind_raw_impl (line 305) | unsafe fn rfind_raw_impl( method count_raw_impl (line 325) | unsafe fn count_raw_impl( method iter (line 339) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> OneIter<'a, 'h> { type OneIter (line 356) | pub struct OneIter<'a, 'h> { type Item (line 362) | type Item = usize; method next (line 365) | fn next(&mut self) -> Option { method count (line 373) | fn count(self) -> usize { method size_hint (line 382) | fn size_hint(&self) -> (usize, Option) { method next_back (line 389) | fn next_back(&mut self) -> Option { type Two (line 405) | pub struct Two(generic::Two<__m128i>); method new (line 416) | pub fn new(needle1: u8, needle2: u8) -> Option { method new_unchecked (line 439) | pub unsafe fn new_unchecked(needle1: u8, needle2: u8) -> Two { method is_available (line 453) | pub fn is_available() -> bool { method find (line 470) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 486) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 520) | pub unsafe fn find_raw( method rfind_raw (line 576) | pub unsafe fn rfind_raw( method find_raw_impl (line 611) | unsafe fn find_raw_impl( method rfind_raw_impl (line 631) | unsafe fn rfind_raw_impl( method iter (line 645) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> TwoIter<'a, 'h> { type TwoIter (line 662) | pub struct TwoIter<'a, 'h> { type Item (line 668) | type Item = usize; method next (line 671) | fn next(&mut self) -> Option { method size_hint (line 679) | fn size_hint(&self) -> (usize, Option) { method next_back (line 686) | fn next_back(&mut self) -> Option { type Three (line 702) | pub struct Three(generic::Three<__m128i>); method new (line 713) | pub fn new(needle1: u8, needle2: u8, needle3: u8) -> Option { method new_unchecked (line 736) | pub unsafe fn new_unchecked( method is_available (line 754) | pub fn is_available() -> bool { method find (line 771) | pub fn find(&self, haystack: &[u8]) -> Option { method rfind (line 787) | pub fn rfind(&self, haystack: &[u8]) -> Option { method find_raw (line 821) | pub unsafe fn find_raw( method rfind_raw (line 879) | pub unsafe fn rfind_raw( method find_raw_impl (line 916) | unsafe fn find_raw_impl( method rfind_raw_impl (line 936) | unsafe fn rfind_raw_impl( method iter (line 950) | pub fn iter<'a, 'h>(&'a self, haystack: &'h [u8]) -> ThreeIter<'a, 'h> { type ThreeIter (line 967) | pub struct ThreeIter<'a, 'h> { type Item (line 973) | type Item = usize; method next (line 976) | fn next(&mut self) -> Option { method size_hint (line 984) | fn size_hint(&self) -> (usize, Option) { method next_back (line 991) | fn next_back(&mut self) -> Option { function forward_one (line 1008) | fn forward_one() { function reverse_one (line 1017) | fn reverse_one() { function count_one (line 1026) | fn count_one() { function forward_two (line 1033) | fn forward_two() { function reverse_two (line 1044) | fn reverse_two() { function forward_three (line 1055) | fn forward_three() { function reverse_three (line 1067) | fn reverse_three() { FILE: src/arch/x86_64/sse2/packedpair.rs type Finder (line 23) | pub struct Finder(packedpair::Finder<__m128i>); method new (line 34) | pub fn new(needle: &[u8]) -> Option { method with_pair (line 46) | pub fn with_pair(needle: &[u8], pair: Pair) -> Option { method with_pair_impl (line 65) | unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { method is_available (line 83) | pub fn is_available() -> bool { method find (line 100) | pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option { method find_prefilter (line 114) | pub fn find_prefilter(&self, haystack: &[u8]) -> Option { method find_impl (line 132) | unsafe fn find_impl( method find_prefilter_impl (line 153) | unsafe fn find_prefilter_impl(&self, haystack: &[u8]) -> Option { method pair (line 161) | pub fn pair(&self) -> &Pair { method min_haystack_len (line 173) | pub fn min_haystack_len(&self) -> usize { function find (line 182) | fn find(haystack: &[u8], needle: &[u8]) -> Option> { function forward_substring (line 193) | fn forward_substring() { function forward_packedpair (line 198) | fn forward_packedpair() { function forward_packedpair_prefilter (line 216) | fn forward_packedpair_prefilter() { FILE: src/cow.rs type CowBytes (line 11) | pub struct CowBytes<'a>(Imp<'a>); type Imp (line 18) | enum Imp<'a> { type Imp (line 25) | struct Imp<'a>(&'a [u8]); type Target (line 28) | type Target = [u8]; function deref (line 31) | fn deref(&self) -> &[u8] { function new (line 39) | pub(crate) fn new>(bytes: &'a B) -> CowBytes<'a> { function new_owned (line 46) | pub(crate) fn new_owned( function as_slice (line 55) | pub(crate) fn as_slice(&self) -> &[u8] { function into_owned (line 65) | pub(crate) fn into_owned(self) -> CowBytes<'static> { function new (line 77) | pub fn new(bytes: &'a [u8]) -> Imp<'a> { function as_slice (line 90) | pub fn as_slice(&self) -> &[u8] { function as_slice (line 106) | pub fn as_slice(&self) -> &[u8] { FILE: src/ext.rs type Pointer (line 2) | pub(crate) trait Pointer { method distance (line 8) | unsafe fn distance(self, origin: Self) -> usize; method as_usize (line 17) | fn as_usize(self) -> usize; method distance (line 21) | unsafe fn distance(self, origin: *const T) -> usize { method as_usize (line 26) | fn as_usize(self) -> usize { method distance (line 32) | unsafe fn distance(self, origin: *mut T) -> usize { method as_usize (line 36) | fn as_usize(self) -> usize { type Byte (line 43) | pub(crate) trait Byte { method to_char (line 45) | fn to_char(self) -> char; method to_char (line 50) | fn to_char(self) -> char { FILE: src/memchr.rs function memchr (line 27) | pub fn memchr(needle: u8, haystack: &[u8]) -> Option { function memrchr (line 59) | pub fn memrchr(needle: u8, haystack: &[u8]) -> Option { function memchr2 (line 92) | pub fn memchr2(needle1: u8, needle2: u8, haystack: &[u8]) -> Option Option(needle: u8, haystack: &'h [u8]) -> Memchr<'h> { function memrchr_iter (line 223) | pub fn memrchr_iter(needle: u8, haystack: &[u8]) -> Rev> { function memchr2_iter (line 232) | pub fn memchr2_iter<'h>( function memrchr2_iter (line 243) | pub fn memrchr2_iter( function memchr3_iter (line 256) | pub fn memchr3_iter<'h>( function memrchr3_iter (line 268) | pub fn memrchr3_iter( type Memchr (line 288) | pub struct Memchr<'h> { function new (line 300) | pub fn new(needle1: u8, haystack: &'h [u8]) -> Memchr<'h> { type Item (line 309) | type Item = usize; method next (line 312) | fn next(&mut self) -> Option { method count (line 327) | fn count(self) -> usize { method size_hint (line 336) | fn size_hint(&self) -> (usize, Option) { method next_back (line 343) | fn next_back(&mut self) -> Option { type Memchr2 (line 364) | pub struct Memchr2<'h> { function new (line 377) | pub fn new(needle1: u8, needle2: u8, haystack: &'h [u8]) -> Memchr2<'h> { type Item (line 387) | type Item = usize; method next (line 390) | fn next(&mut self) -> Option { method size_hint (line 400) | fn size_hint(&self) -> (usize, Option) { method next_back (line 407) | fn next_back(&mut self) -> Option { type Memchr3 (line 432) | pub struct Memchr3<'h> { function new (line 446) | pub fn new( type Item (line 462) | type Item = usize; method next (line 465) | fn next(&mut self) -> Option { method size_hint (line 477) | fn size_hint(&self) -> (usize, Option) { method next_back (line 484) | fn next_back(&mut self) -> Option { function memchr_raw (line 504) | unsafe fn memchr_raw( function memrchr_raw (line 541) | unsafe fn memrchr_raw( function memchr2_raw (line 574) | unsafe fn memchr2_raw( function memrchr2_raw (line 609) | unsafe fn memrchr2_raw( function memchr3_raw (line 646) | unsafe fn memchr3_raw( function memrchr3_raw (line 688) | unsafe fn memrchr3_raw( function count_raw (line 730) | unsafe fn count_raw(needle: u8, start: *const u8, end: *const u8) -> usi... function forward1_iter (line 758) | fn forward1_iter() { function forward1_oneshot (line 767) | fn forward1_oneshot() { function reverse1_iter (line 774) | fn reverse1_iter() { function reverse1_oneshot (line 783) | fn reverse1_oneshot() { function count1_iter (line 790) | fn count1_iter() { function forward2_iter (line 797) | fn forward2_iter() { function forward2_oneshot (line 808) | fn forward2_oneshot() { function reverse2_iter (line 819) | fn reverse2_iter() { function reverse2_oneshot (line 830) | fn reverse2_oneshot() { function forward3_iter (line 841) | fn forward3_iter() { function forward3_oneshot (line 853) | fn forward3_oneshot() { function reverse3_iter (line 865) | fn reverse3_iter() { function reverse3_oneshot (line 877) | fn reverse3_oneshot() { function sync_regression (line 895) | fn sync_regression() { FILE: src/memmem/mod.rs function find_iter (line 116) | pub fn find_iter<'h, 'n, N: 'n + ?Sized + AsRef<[u8]>>( function rfind_iter (line 150) | pub fn rfind_iter<'h, 'n, N: 'n + ?Sized + AsRef<[u8]>>( function find (line 185) | pub fn find(haystack: &[u8], needle: &[u8]) -> Option { function rfind (line 222) | pub fn rfind(haystack: &[u8], needle: &[u8]) -> Option { type FindIter (line 237) | pub struct FindIter<'h, 'n> { function new (line 246) | pub(crate) fn new( function into_owned (line 263) | pub fn into_owned(self) -> FindIter<'h, 'static> { type Item (line 274) | type Item = usize; method next (line 276) | fn next(&mut self) -> Option { method size_hint (line 288) | fn size_hint(&self) -> (usize, Option) { type FindRevIter (line 314) | pub struct FindRevIter<'h, 'n> { function new (line 324) | pub(crate) fn new( function into_owned (line 341) | pub fn into_owned(self) -> FindRevIter<'h, 'static> { type Item (line 351) | type Item = usize; method next (line 353) | fn next(&mut self) -> Option { type Finder (line 384) | pub struct Finder<'n> { function new (line 392) | pub fn new>(needle: &'n B) -> Finder<'n> { function find (line 421) | pub fn find(&self, haystack: &[u8]) -> Option { function find_iter (line 454) | pub fn find_iter<'a, 'h>( function into_owned (line 470) | pub fn into_owned(self) -> Finder<'static> { function as_ref (line 488) | pub fn as_ref(&self) -> Finder<'_> { function needle (line 502) | pub fn needle(&self) -> &[u8] { type FinderRev (line 521) | pub struct FinderRev<'n> { function new (line 529) | pub fn new>(needle: &'n B) -> FinderRev<'n> { function rfind (line 560) | pub fn rfind>(&self, haystack: B) -> Option { function rfind_iter (line 592) | pub fn rfind_iter<'a, 'h>( function into_owned (line 608) | pub fn into_owned(self) -> FinderRev<'static> { function as_ref (line 626) | pub fn as_ref(&self) -> FinderRev<'_> { function needle (line 640) | pub fn needle(&self) -> &[u8] { type FinderBuilder (line 651) | pub struct FinderBuilder { method new (line 657) | pub fn new() -> FinderBuilder { method build_forward (line 663) | pub fn build_forward<'n, B: ?Sized + AsRef<[u8]>>( method build_forward_owned (line 673) | pub fn build_forward_owned>>( method build_forward_with_ranker (line 683) | pub fn build_forward_with_ranker< method build_forward_with_ranker_owned (line 703) | pub fn build_forward_with_ranker_owned< method build_reverse (line 718) | pub fn build_reverse<'n, B: ?Sized + AsRef<[u8]>>( method build_reverse_owned (line 732) | pub fn build_reverse_owned>>( method prefilter (line 745) | pub fn prefilter(&mut self, prefilter: Prefilter) -> &mut FinderBuilder { function forward (line 761) | fn forward() { function reverse (line 768) | fn reverse() { FILE: src/memmem/searcher.rs type Searcher (line 33) | pub(crate) struct Searcher { method new (line 44) | pub(crate) fn new( method twoway (line 174) | fn twoway( method find (line 210) | pub(crate) fn find( method fmt (line 228) | fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result { type TwoWayWithPrefilter (line 262) | struct TwoWayWithPrefilter { type SearcherKindFn (line 273) | type SearcherKindFn = unsafe fn( function searcher_kind_empty (line 286) | unsafe fn searcher_kind_empty( function searcher_kind_one_byte (line 301) | unsafe fn searcher_kind_one_byte( function searcher_kind_two_way (line 318) | unsafe fn searcher_kind_two_way( function searcher_kind_two_way_with_prefilter (line 339) | unsafe fn searcher_kind_two_way_with_prefilter( function searcher_kind_sse2 (line 362) | unsafe fn searcher_kind_sse2( function searcher_kind_avx2 (line 383) | unsafe fn searcher_kind_avx2( function searcher_kind_simd128 (line 404) | unsafe fn searcher_kind_simd128( function searcher_kind_neon (line 425) | unsafe fn searcher_kind_neon( type SearcherRev (line 441) | pub(crate) struct SearcherRev { method new (line 470) | pub(crate) fn new(needle: &[u8]) -> SearcherRev { method rfind (line 493) | pub(crate) fn rfind( type SearcherRevKind (line 459) | enum SearcherRevKind { type PrefilterConfig (line 544) | pub enum PrefilterConfig { method is_none (line 561) | fn is_none(&self) -> bool { method default (line 554) | fn default() -> PrefilterConfig { type Prefilter (line 604) | struct Prefilter { method fallback (line 615) | fn fallback( method sse2 (line 644) | fn sse2(finder: sse2::Finder, needle: &[u8]) -> Prefilter { method avx2 (line 659) | fn avx2(finder: avx2::Finder, needle: &[u8]) -> Prefilter { method simd128 (line 674) | fn simd128(finder: simd128::Finder, needle: &[u8]) -> Prefilter { method neon (line 689) | fn neon(finder: neon::Finder, needle: &[u8]) -> Prefilter { method find (line 715) | fn find(&self, haystack: &[u8]) -> Option { method find_simple (line 725) | fn find_simple(&self, haystack: &[u8]) -> Option { method fmt (line 738) | fn fmt(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result { type PrefilterKindFn (line 774) | type PrefilterKindFn = function prefilter_kind_fallback (line 783) | unsafe fn prefilter_kind_fallback( function prefilter_kind_sse2 (line 797) | unsafe fn prefilter_kind_sse2( function prefilter_kind_avx2 (line 816) | unsafe fn prefilter_kind_avx2( function prefilter_kind_simd128 (line 835) | unsafe fn prefilter_kind_simd128( function prefilter_kind_neon (line 854) | unsafe fn prefilter_kind_neon( type PrefilterState (line 876) | pub(crate) struct PrefilterState { constant MIN_SKIPS (line 891) | const MIN_SKIPS: u32 = 50; constant MIN_SKIP_BYTES (line 899) | const MIN_SKIP_BYTES: u32 = 8; method new (line 903) | pub(crate) fn new() -> PrefilterState { method update (line 910) | fn update(&mut self, skipped: usize) { method is_effective (line 924) | fn is_effective(&mut self) -> bool { method is_inert (line 943) | fn is_inert(&self) -> bool { method skips (line 949) | fn skips(&self) -> u32 { type Pre (line 958) | pub(crate) struct Pre<'a> { function find (line 968) | pub(crate) fn find(&mut self, haystack: &[u8]) -> Option { function is_effective (line 976) | pub(crate) fn is_effective(&mut self) -> bool { function do_packed_search (line 994) | fn do_packed_search(needle: &[u8]) -> bool { FILE: src/tests/memchr/mod.rs constant SEEDS (line 13) | const SEEDS: &'static [Seed] = &[ type Runner (line 63) | pub(crate) struct Runner { method new (line 73) | pub(crate) fn new(needle_len: usize) -> Runner { method forward_iter (line 83) | pub(crate) fn forward_iter(self, mut test: F) method reverse_iter (line 115) | pub(crate) fn reverse_iter(self, mut test: F) method count_iter (line 148) | pub(crate) fn count_iter(self, mut test: F) method forward_oneshot (line 179) | pub(crate) fn forward_oneshot(self, mut test: F) method reverse_oneshot (line 198) | pub(crate) fn reverse_oneshot(self, mut test: F) type Test (line 216) | struct Test { method new (line 227) | fn new(seed: &Seed) -> Test { type Seed (line 238) | struct Seed { constant EXPAND_LEN (line 263) | const EXPAND_LEN: usize = { method generate (line 285) | fn generate(&self) -> impl Iterator { FILE: src/tests/memchr/naive.rs function memchr (line 1) | pub(crate) fn memchr(n1: u8, haystack: &[u8]) -> Option { function memchr2 (line 5) | pub(crate) fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option { function memchr3 (line 9) | pub(crate) fn memchr3( function memrchr (line 18) | pub(crate) fn memrchr(n1: u8, haystack: &[u8]) -> Option { function memrchr2 (line 22) | pub(crate) fn memrchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option { function memrchr3 (line 26) | pub(crate) fn memrchr3( FILE: src/tests/memchr/prop.rs function double_ended_take (line 257) | pub(crate) fn double_ended_take( function naive1_iter (line 291) | pub(crate) fn naive1_iter<'a>( function naive2_iter (line 299) | pub(crate) fn naive2_iter<'a>( function naive3_iter (line 312) | pub(crate) fn naive3_iter<'a>( FILE: src/tests/mod.rs function byte_order (line 10) | fn byte_order() { FILE: src/tests/packedpair.rs constant SEEDS (line 12) | const SEEDS: &[Seed] = &[ type Runner (line 27) | pub(crate) struct Runner { method new (line 37) | pub(crate) fn new() -> Runner { method run (line 49) | pub(crate) fn run(self) { method fwd (line 77) | pub(crate) fn fwd( type Test (line 89) | struct Test { method new (line 104) | fn new( type Seed (line 142) | struct Seed { constant NEEDLE_LENGTH_LIMIT (line 149) | const NEEDLE_LENGTH_LIMIT: usize = { constant HAYSTACK_LENGTH_LIMIT (line 160) | const HAYSTACK_LENGTH_LIMIT: usize = { method generate (line 172) | fn generate(self) -> impl Iterator { FILE: src/tests/substring/mod.rs constant SEEDS (line 15) | const SEEDS: &'static [Seed] = &[ type Runner (line 66) | pub(crate) struct Runner { method new (line 78) | pub(crate) fn new() -> Runner { method run (line 90) | pub(crate) fn run(self) { method fwd (line 133) | pub(crate) fn fwd( method rev (line 149) | pub(crate) fn rev( type Test (line 160) | struct Test { type Seed (line 178) | struct Seed { constant MAX_PAD (line 186) | const MAX_PAD: usize = 34; method new (line 188) | const fn new( method generate (line 197) | fn generate(self) -> impl Iterator { FILE: src/tests/substring/naive.rs function find (line 9) | pub(crate) fn find(haystack: &[u8], needle: &[u8]) -> Option { function rfind (line 20) | pub(crate) fn rfind(haystack: &[u8], needle: &[u8]) -> Option { function forward (line 37) | fn forward() { function reverse (line 42) | fn reverse() { FILE: src/tests/substring/prop.rs function prefix_is_substring (line 74) | pub(crate) fn prefix_is_substring( function suffix_is_substring (line 92) | pub(crate) fn suffix_is_substring( function same_as_naive (line 111) | pub(crate) fn same_as_naive( FILE: src/vector.rs type Vector (line 17) | pub(crate) trait Vector: Copy + core::fmt::Debug { constant BYTES (line 20) | const BYTES: usize; constant ALIGN (line 23) | const ALIGN: usize; method splat (line 33) | unsafe fn splat(byte: u8) -> Self; method load_aligned (line 42) | unsafe fn load_aligned(data: *const u8) -> Self; method load_unaligned (line 51) | unsafe fn load_unaligned(data: *const u8) -> Self; method movemask (line 54) | unsafe fn movemask(self) -> Self::Mask; method cmpeq (line 56) | unsafe fn cmpeq(self, vector2: Self) -> Self; method and (line 58) | unsafe fn and(self, vector2: Self) -> Self; method or (line 60) | unsafe fn or(self, vector2: Self) -> Self; method movemask_will_have_non_zero (line 63) | unsafe fn movemask_will_have_non_zero(self) -> bool { constant BYTES (line 201) | const BYTES: usize = 16; constant ALIGN (line 202) | const ALIGN: usize = Self::BYTES - 1; type Mask (line 204) | type Mask = SensibleMoveMask; method splat (line 207) | unsafe fn splat(byte: u8) -> __m128i { method load_aligned (line 212) | unsafe fn load_aligned(data: *const u8) -> __m128i { method load_unaligned (line 217) | unsafe fn load_unaligned(data: *const u8) -> __m128i { method movemask (line 222) | unsafe fn movemask(self) -> SensibleMoveMask { method cmpeq (line 227) | unsafe fn cmpeq(self, vector2: Self) -> __m128i { method and (line 232) | unsafe fn and(self, vector2: Self) -> __m128i { method or (line 237) | unsafe fn or(self, vector2: Self) -> __m128i { constant BYTES (line 250) | const BYTES: usize = 32; constant ALIGN (line 251) | const ALIGN: usize = Self::BYTES - 1; type Mask (line 253) | type Mask = SensibleMoveMask; method splat (line 256) | unsafe fn splat(byte: u8) -> __m256i { method load_aligned (line 261) | unsafe fn load_aligned(data: *const u8) -> __m256i { method load_unaligned (line 266) | unsafe fn load_unaligned(data: *const u8) -> __m256i { method movemask (line 271) | unsafe fn movemask(self) -> SensibleMoveMask { method cmpeq (line 276) | unsafe fn cmpeq(self, vector2: Self) -> __m256i { method and (line 281) | unsafe fn and(self, vector2: Self) -> __m256i { method or (line 286) | unsafe fn or(self, vector2: Self) -> __m256i { constant BYTES (line 299) | const BYTES: usize = 16; constant ALIGN (line 300) | const ALIGN: usize = Self::BYTES - 1; type Mask (line 302) | type Mask = NeonMoveMask; method splat (line 305) | unsafe fn splat(byte: u8) -> uint8x16_t { method load_aligned (line 310) | unsafe fn load_aligned(data: *const u8) -> uint8x16_t { method load_unaligned (line 317) | unsafe fn load_unaligned(data: *const u8) -> uint8x16_t { method movemask (line 322) | unsafe fn movemask(self) -> NeonMoveMask { method cmpeq (line 331) | unsafe fn cmpeq(self, vector2: Self) -> uint8x16_t { method and (line 336) | unsafe fn and(self, vector2: Self) -> uint8x16_t { method or (line 341) | unsafe fn or(self, vector2: Self) -> uint8x16_t { method movemask_will_have_non_zero (line 352) | unsafe fn movemask_will_have_non_zero(self) -> bool { constant BYTES (line 461) | const BYTES: usize = 16; constant ALIGN (line 462) | const ALIGN: usize = Self::BYTES - 1; type Mask (line 464) | type Mask = SensibleMoveMask; method splat (line 467) | unsafe fn splat(byte: u8) -> v128 { method load_aligned (line 472) | unsafe fn load_aligned(data: *const u8) -> v128 { method load_unaligned (line 477) | unsafe fn load_unaligned(data: *const u8) -> v128 { method movemask (line 482) | unsafe fn movemask(self) -> SensibleMoveMask { method cmpeq (line 487) | unsafe fn cmpeq(self, vector2: Self) -> v128 { method and (line 492) | unsafe fn and(self, vector2: Self) -> v128 { method or (line 497) | unsafe fn or(self, vector2: Self) -> v128 { type MoveMask (line 82) | pub(crate) trait MoveMask: Copy + core::fmt::Debug { method all_zeros_except_least_significant (line 85) | fn all_zeros_except_least_significant(n: usize) -> Self; method has_non_zero (line 88) | fn has_non_zero(self) -> bool; method count_ones (line 91) | fn count_ones(self) -> usize; method and (line 94) | fn and(self, other: Self) -> Self; method or (line 97) | fn or(self, other: Self) -> Self; method clear_least_significant_bit (line 101) | fn clear_least_significant_bit(self) -> Self; method first_offset (line 104) | fn first_offset(self) -> usize; method last_offset (line 107) | fn last_offset(self) -> usize; method all_zeros_except_least_significant (line 140) | fn all_zeros_except_least_significant(n: usize) -> SensibleMoveMask { method has_non_zero (line 146) | fn has_non_zero(self) -> bool { method count_ones (line 151) | fn count_ones(self) -> usize { method and (line 156) | fn and(self, other: SensibleMoveMask) -> SensibleMoveMask { method or (line 161) | fn or(self, other: SensibleMoveMask) -> SensibleMoveMask { method clear_least_significant_bit (line 166) | fn clear_least_significant_bit(self) -> SensibleMoveMask { method first_offset (line 171) | fn first_offset(self) -> usize { method last_offset (line 182) | fn last_offset(self) -> usize { method all_zeros_except_least_significant (line 388) | fn all_zeros_except_least_significant(n: usize) -> NeonMoveMask { method has_non_zero (line 394) | fn has_non_zero(self) -> bool { method count_ones (line 399) | fn count_ones(self) -> usize { method and (line 404) | fn and(self, other: NeonMoveMask) -> NeonMoveMask { method or (line 409) | fn or(self, other: NeonMoveMask) -> NeonMoveMask { method clear_least_significant_bit (line 414) | fn clear_least_significant_bit(self) -> NeonMoveMask { method first_offset (line 419) | fn first_offset(self) -> usize { method last_offset (line 446) | fn last_offset(self) -> usize { type SensibleMoveMask (line 118) | pub(crate) struct SensibleMoveMask(u32); method get_for_offset (line 126) | fn get_for_offset(self) -> u32 { type NeonMoveMask (line 374) | pub(crate) struct NeonMoveMask(u64); method get_for_offset (line 381) | fn get_for_offset(self) -> u64 {