SYMBOL INDEX (2306 symbols across 286 files)

FILE: benches/chain3_collect_map.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function fibonacci (line 45) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 56) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 63) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 67) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 77) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 86) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 95) | fn run(c: &mut Criterion) {

FILE: benches/chain4_collect_map.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function fibonacci (line 45) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 56) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 63) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 73) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 84) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 94) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 104) | fn run(c: &mut Criterion) {

FILE: benches/chain_collect_map.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function fibonacci (line 45) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 56) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 63) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 67) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 72) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 76) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 80) | fn run(c: &mut Criterion) {

FILE: benches/collect_filter.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function to_output (line 24) | fn to_output(idx: &usize) -> Output {
  function filter (line 45) | fn filter(output: &&Output) -> bool {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> Vec<Output> {
  function seq (line 70) | fn seq(inputs: &[Output]) -> Vec<&Output> {
  function rayon (line 74) | fn rayon(inputs: &[Output]) -> Vec<&Output> {
  function orx_into_vec (line 79) | fn orx_into_vec(inputs: &[Output]) -> Vec<&Output> {
  function orx_into_split_vec (line 83) | fn orx_into_split_vec(inputs: &[Output]) -> SplitVec<&Output> {
  function orx_into_vec_with (line 88) | fn orx_into_vec_with<P: ParThreadPool>(inputs: &[Output], pool: P) -> Ve...
  function run (line 92) | fn run(c: &mut Criterion) {

FILE: benches/collect_filtermap.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function filter_map (line 24) | fn filter_map(idx: &usize) -> Option<Output> {
  function to_output (line 28) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 49) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 60) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 67) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 71) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 76) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 80) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 84) | fn run(c: &mut Criterion) {

FILE: benches/collect_flatmap.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function flat_map (line 24) | fn flat_map(idx: &usize) -> Vec<Output> {
  function to_output (line 28) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 49) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 60) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 67) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 71) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 76) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_sorted_into_vec (line 80) | fn orx_sorted_into_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 84) | fn run(c: &mut Criterion) {

FILE: benches/collect_iter_into_par.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function filter (line 45) | fn filter(output: &Output) -> bool {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 69) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 73) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 78) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 87) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 96) | fn run(c: &mut Criterion) {

FILE: benches/collect_long_chain.rs
  constant SEED (line 9) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 10) | const FIB_UPPER_BOUND: u32 = 29;
  type Out1 (line 13) | struct Out1 {
  type Out2 (line 18) | struct Out2 {
  type Out3 (line 24) | struct Out3 {
  type Out4 (line 30) | struct Out4 {
  function map1 (line 36) | fn map1(idx: &usize) -> Out1 {
  function filter1 (line 48) | fn filter1(output: &Out1) -> bool {
  function map2 (line 54) | fn map2(input: Out1) -> Out2 {
  function filter2 (line 63) | fn filter2(output: &Out2) -> bool {
  function map3 (line 67) | fn map3(input: Out2) -> Out3 {
  function map4 (line 72) | fn map4(input: Out3) -> Out4 {
  function filter4 (line 79) | fn filter4(output: &Out4) -> bool {
  function fibonacci (line 83) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 94) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 101) | fn seq(inputs: &[usize]) -> Vec<Out4> {
  function rayon (line 114) | fn rayon(inputs: &[usize]) -> Vec<Out4> {
  function orx_into_vec (line 128) | fn orx_into_vec(inputs: &[usize]) -> Vec<Out4> {
  function orx_into_split_vec (line 141) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Out4> {
  function run (line 154) | fn run(c: &mut Criterion) {

FILE: benches/collect_map.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function fibonacci (line 45) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 56) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 63) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 67) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 72) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 76) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function run (line 80) | fn run(c: &mut Criterion) {

FILE: benches/collect_map_filter.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function filter (line 45) | fn filter(output: &Output) -> bool {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 69) | fn seq(inputs: &[usize]) -> Vec<Output> {
  function rayon (line 73) | fn rayon(inputs: &[usize]) -> Vec<Output> {
  function orx_into_vec (line 78) | fn orx_into_vec(inputs: &[usize]) -> Vec<Output> {
  function orx_into_split_vec (line 82) | fn orx_into_split_vec(inputs: &[usize]) -> SplitVec<Output> {
  function orx_into_vec_with (line 87) | fn orx_into_vec_with<P: ParThreadPool>(inputs: &[usize], pool: P) -> Vec...
  function run (line 96) | fn run(c: &mut Criterion) {

FILE: benches/collect_map_filter_hash_set.rs
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 11) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 15) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 16) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 19) | struct Output {
  function map (line 24) | fn map(idx: &usize) -> Output {
  function filter (line 45) | fn filter(output: &Output) -> bool {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> HashSet<usize> {
  function seq (line 69) | fn seq(inputs: &HashSet<usize>) -> Vec<Output> {
  function rayon (line 73) | fn rayon(inputs: &HashSet<usize>) -> Vec<Output> {
  function orx_through_vec (line 78) | fn orx_through_vec(inputs: &HashSet<usize>) -> Vec<Output> {
  function orx_through_iter (line 83) | fn orx_through_iter(inputs: &HashSet<usize>) -> Vec<Output> {
  function run (line 92) | fn run(c: &mut Criterion) {

FILE: benches/count_filtermap.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function filter_map (line 23) | fn filter_map(idx: &usize) -> Option<Output> {
  function to_output (line 27) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 48) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 59) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 66) | fn seq(inputs: &[usize]) -> usize {
  function rayon (line 70) | fn rayon(inputs: &[usize]) -> usize {
  function orx (line 75) | fn orx(inputs: &[usize]) -> usize {
  function run (line 79) | fn run(c: &mut Criterion) {

FILE: benches/count_flatmap.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = true;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function flat_map (line 23) | fn flat_map(idx: &usize) -> Vec<Output> {
  function to_output (line 27) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 48) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 59) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 66) | fn seq(inputs: &[usize]) -> usize {
  function rayon (line 70) | fn rayon(inputs: &[usize]) -> usize {
  function orx (line 75) | fn orx(inputs: &[usize]) -> usize {
  function run (line 79) | fn run(c: &mut Criterion) {

FILE: benches/count_map.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function map (line 23) | fn map(idx: &usize) -> Output {
  function fibonacci (line 44) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 55) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 62) | fn seq(inputs: &[usize]) -> usize {
  function rayon (line 66) | fn rayon(inputs: &[usize]) -> usize {
  function orx (line 71) | fn orx(inputs: &[usize]) -> usize {
  function run (line 75) | fn run(c: &mut Criterion) {

FILE: benches/count_map_filter.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = true;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function map (line 23) | fn map(idx: &usize) -> Output {
  function filter (line 44) | fn filter(output: &Output) -> bool {
  function fibonacci (line 50) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 61) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 68) | fn seq(inputs: &[usize]) -> usize {
  function rayon (line 72) | fn rayon(inputs: &[usize]) -> usize {
  function orx (line 77) | fn orx(inputs: &[usize]) -> usize {
  function run (line 81) | fn run(c: &mut Criterion) {

FILE: benches/drain_vec_collect_map_filter.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function map (line 23) | fn map(idx: usize) -> Output {
  function filter (line 43) | fn filter(output: &Output) -> bool {
  function fibonacci (line 49) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 60) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 67) | fn seq(input: &mut Vec<usize>) -> Vec<Output> {
  function rayon (line 71) | fn rayon(input: &mut Vec<usize>) -> Vec<Output> {
  function orx_into_vec (line 79) | fn orx_into_vec(input: &mut Vec<usize>) -> Vec<Output> {
  function orx_into_split_vec (line 83) | fn orx_into_split_vec(input: &mut Vec<usize>) -> SplitVec<Output> {
  function run (line 87) | fn run(c: &mut Criterion) {

FILE: benches/find.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 10) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 11) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 12) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 13) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 14) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 16) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 20) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 21) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 24) | struct Output {
  function to_output (line 30) | fn to_output(idx: &usize) -> Output {
  function get_find (line 53) | fn get_find(n: usize) -> impl Fn(&Output) -> bool {
  function fibonacci (line 57) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 68) | fn inputs(len: usize) -> Vec<Output> {
  function seq (line 76) | fn seq(inputs: &[Output], find: impl Fn(&Output) -> bool) -> Option<&Out...
  function rayon (line 80) | fn rayon(inputs: &[Output], find: impl Fn(&Output) -> bool + Send + Sync...
  function orx (line 85) | fn orx(inputs: &[Output], find: impl Fn(&Output) -> bool + Send + Sync) ...
  function run (line 89) | fn run(c: &mut Criterion) {

FILE: benches/find_any.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 10) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 11) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 12) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 13) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 14) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 16) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 20) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 21) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 24) | struct Output {
  function to_output (line 30) | fn to_output(idx: &usize) -> Output {
  function get_find (line 53) | fn get_find(n: usize) -> impl Fn(&Output) -> bool {
  function fibonacci (line 57) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 68) | fn inputs(len: usize) -> Vec<Output> {
  function seq (line 76) | fn seq(inputs: &[Output], find: impl Fn(&Output) -> bool) -> Option<&Out...
  function rayon (line 80) | fn rayon(inputs: &[Output], find: impl Fn(&Output) -> bool + Send + Sync...
  function orx (line 85) | fn orx(inputs: &[Output], find: impl Fn(&Output) -> bool + Send + Sync) ...
  function run (line 92) | fn run(c: &mut Criterion) {

FILE: benches/find_flatmap.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 10) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 11) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 12) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 13) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 14) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 16) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 20) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 21) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 24) | struct Output {
  function flat_map (line 30) | fn flat_map(idx: &usize) -> Vec<Output> {
  function to_output (line 34) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 57) | fn fibonacci(n: &u32) -> u32 {
  function get_find (line 68) | fn get_find(n: usize) -> impl Fn(&Output) -> bool {
  function inputs (line 72) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 79) | fn seq(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync) -...
  function rayon (line 83) | fn rayon(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync)...
  function orx (line 88) | fn orx(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync) -...
  function run (line 92) | fn run(c: &mut Criterion) {

FILE: benches/find_iter_into_par.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 10) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 11) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 12) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 13) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 14) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 16) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 20) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 21) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 24) | struct Output {
  function map (line 30) | fn map(idx: &usize) -> Output {
  function get_find (line 53) | fn get_find(n: usize) -> impl Fn(&Output) -> bool {
  function filter (line 57) | fn filter(a: &Output) -> bool {
  function fibonacci (line 61) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 72) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 79) | fn seq(inputs: &[usize], find: impl Fn(&Output) -> bool) -> Option<Outpu...
  function rayon (line 83) | fn rayon(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync)...
  function orx (line 93) | fn orx(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync) -...
  function run (line 102) | fn run(c: &mut Criterion) {

FILE: benches/find_map_filter.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 10) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 11) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 12) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 13) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 14) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 16) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 20) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 21) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 24) | struct Output {
  function map (line 30) | fn map(idx: &usize) -> Output {
  function get_find (line 53) | fn get_find(n: usize) -> impl Fn(&Output) -> bool {
  function filter (line 57) | fn filter(a: &Output) -> bool {
  function fibonacci (line 61) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 72) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 79) | fn seq(inputs: &[usize], find: impl Fn(&Output) -> bool) -> Option<Outpu...
  function rayon (line 83) | fn rayon(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync)...
  function orx (line 92) | fn orx(inputs: &[usize], find: impl Fn(&Output) -> bool + Send + Sync) -...
  function run (line 96) | fn run(c: &mut Criterion) {

FILE: benches/mut_for_each_iter.rs
  type Data (line 5) | struct Data {
  function to_output (line 10) | fn to_output(idx: usize) -> Data {
  function inputs (line 16) | fn inputs(len: usize) -> HashMap<usize, Data> {
  function fibonacci (line 20) | fn fibonacci(n: usize) -> usize {
  function filter (line 31) | fn filter(data: &&mut Data) -> bool {
  function update (line 35) | fn update(data: &mut Data) {
  function seq (line 42) | fn seq<'a>(inputs: impl Iterator<Item = &'a mut Data>) {
  function rayon (line 46) | fn rayon<'a>(inputs: impl Iterator<Item = &'a mut Data> + Send) {
  function orx (line 51) | fn orx<'a>(inputs: impl Iterator<Item = &'a mut Data>) {
  function run (line 56) | fn run(c: &mut Criterion) {

FILE: benches/mut_for_each_slice.rs
  type Data (line 5) | struct Data {
  function to_output (line 10) | fn to_output(idx: usize) -> Data {
  function inputs (line 16) | fn inputs(len: usize) -> Vec<Data> {
  function fibonacci (line 20) | fn fibonacci(n: usize) -> usize {
  function filter (line 31) | fn filter(data: &&mut Data) -> bool {
  function update (line 35) | fn update(data: &mut Data) {
  function seq (line 42) | fn seq(inputs: &mut [Data]) {
  function rayon (line 46) | fn rayon(inputs: &mut [Data]) {
  function orx (line 51) | fn orx(inputs: &mut [Data]) {
  function run (line 56) | fn run(c: &mut Criterion) {

FILE: benches/rec_iter_map_collect.rs
  function fibonacci (line 9) | fn fibonacci(n: u64, work: usize) -> u64 {
  type Node (line 25) | struct Node {
    method new (line 31) | fn new(mut n: u32, rng: &mut impl Rng) -> Self {
    method seq_num_nodes (line 52) | fn seq_num_nodes(&self) -> usize {
    method seq (line 60) | fn seq(&self, work: usize, numbers: &mut Vec<u64>) {
  function seq (line 70) | fn seq(roots: &[Node], work: usize) -> Vec<u64> {
  function orx_lazy_unknown_chunk1024 (line 78) | fn orx_lazy_unknown_chunk1024(roots: &[Node], work: usize) -> SplitVec<u...
  function orx_lazy_exact (line 90) | fn orx_lazy_exact(roots: &[Node], work: usize, num_nodes: usize) -> Spli...
  function orx_linearized (line 101) | fn orx_linearized(roots: &[Node], work: usize) -> SplitVec<u64> {
  function run (line 113) | fn run(c: &mut Criterion) {

FILE: benches/rec_iter_map_sum.rs
  function fibonacci (line 11) | fn fibonacci(n: u64, work: usize) -> u64 {
  type Node (line 27) | struct Node {
    method new (line 33) | fn new(mut n: u32, rng: &mut impl Rng) -> Self {
    method seq_num_nodes (line 54) | fn seq_num_nodes(&self) -> usize {
    method seq_sum_fib (line 62) | fn seq_sum_fib(&self, work: usize) -> u64 {
  function seq (line 74) | fn seq(roots: &[Node], work: usize) -> u64 {
  function rayon (line 78) | fn rayon(roots: &[Node], work: usize) -> u64 {
  function orx_lazy_unknown_chunk1024 (line 104) | fn orx_lazy_unknown_chunk1024(roots: &[Node], work: usize) -> u64 {
  function orx_lazy_exact (line 116) | fn orx_lazy_exact(roots: &[Node], work: usize, num_nodes: usize) -> u64 {
  function orx_lazy_exact_flat_map (line 127) | fn orx_lazy_exact_flat_map(roots: &[Node], work: usize, num_nodes: usize...
  function orx_linearized (line 138) | fn orx_linearized(roots: &[Node], work: usize) -> u64 {
  function run (line 150) | fn run(c: &mut Criterion) {

FILE: benches/reduce.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function to_output (line 23) | fn to_output(idx: &usize) -> Output {
  function reduce (line 44) | fn reduce<'a>(a: &'a Output, b: &'a Output) -> &'a Output {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> Vec<Output> {
  function seq (line 70) | fn seq(inputs: &[Output]) -> Option<&Output> {
  function rayon (line 74) | fn rayon(inputs: &[Output]) -> Option<&Output> {
  function orx (line 79) | fn orx(inputs: &[Output]) -> Option<&Output> {
  function run (line 83) | fn run(c: &mut Criterion) {

FILE: benches/reduce_iter_into_par.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function map (line 23) | fn map(idx: &usize) -> Output {
  function filter (line 44) | fn filter(a: &Output) -> bool {
  function reduce (line 48) | fn reduce(a: Output, b: Output) -> Output {
  function fibonacci (line 55) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 66) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 73) | fn seq(inputs: &[usize]) -> Option<Output> {
  function rayon (line 77) | fn rayon(inputs: &[usize]) -> Option<Output> {
  function orx (line 87) | fn orx(inputs: &[usize]) -> Option<Output> {
  function orx_with (line 97) | fn orx_with<P: ParThreadPool>(inputs: &[usize], pool: P) -> Option<Outpu...
  function run (line 107) | fn run(c: &mut Criterion) {

FILE: benches/reduce_long_chain.rs
  constant SEED (line 8) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 9) | const FIB_UPPER_BOUND: u32 = 29;
  type Out1 (line 12) | struct Out1 {
  type Out2 (line 17) | struct Out2 {
  type Out3 (line 23) | struct Out3 {
  type Out4 (line 29) | struct Out4 {
  function map1 (line 35) | fn map1(idx: &usize) -> Out1 {
  function filter1 (line 47) | fn filter1(output: &Out1) -> bool {
  function map2 (line 53) | fn map2(input: Out1) -> Out2 {
  function filter2 (line 62) | fn filter2(output: &Out2) -> bool {
  function map3 (line 66) | fn map3(input: Out2) -> Out3 {
  function map4 (line 71) | fn map4(input: Out3) -> Out4 {
  function filter4 (line 78) | fn filter4(output: &Out4) -> bool {
  function reduce (line 82) | fn reduce(x: Out4, y: Out4) -> Out4 {
  function fibonacci (line 95) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 106) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 113) | fn seq(inputs: &[usize]) -> Option<Out4> {
  function rayon (line 126) | fn rayon(inputs: &[usize]) -> Option<Out4> {
  function orx (line 140) | fn orx(inputs: &[usize]) -> Option<Out4> {
  function run (line 153) | fn run(c: &mut Criterion) {

FILE: benches/reduce_map.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function map (line 23) | fn map(idx: &usize) -> Output {
  function reduce (line 44) | fn reduce(a: Output, b: Output) -> Output {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 69) | fn seq(inputs: &[usize]) -> Option<Output> {
  function rayon (line 73) | fn rayon(inputs: &[usize]) -> Option<Output> {
  function orx (line 78) | fn orx(inputs: &[usize]) -> Option<Output> {
  function run (line 82) | fn run(c: &mut Criterion) {

FILE: benches/reduce_map_filter.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function map (line 23) | fn map(idx: &usize) -> Output {
  function filter (line 44) | fn filter(a: &Output) -> bool {
  function reduce (line 48) | fn reduce(a: Output, b: Output) -> Output {
  function fibonacci (line 55) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 66) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 73) | fn seq(inputs: &[usize]) -> Option<Output> {
  function rayon (line 77) | fn rayon(inputs: &[usize]) -> Option<Output> {
  function orx (line 86) | fn orx(inputs: &[usize]) -> Option<Output> {
  function run (line 90) | fn run(c: &mut Criterion) {

FILE: benches/result_collect_map.rs
  type Err (line 7) | type Err = ParseIntError;
  constant TEST_LARGE_OUTPUT (line 9) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 10) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 11) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 12) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 13) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 14) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 16) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 20) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 21) | const FIB_UPPER_BOUND: u32 = 201;
  type Input (line 24) | struct Input {
  function to_input (line 30) | fn to_input(idx: &usize) -> Input {
  function to_bad_input (line 53) | fn to_bad_input() -> Input {
  function map_input_to_result (line 61) | fn map_input_to_result(input: &Input) -> Result<String, Err> {
  function fibonacci (line 68) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 79) | fn inputs(len: usize, idx_error: usize) -> Vec<Input> {
  function seq (line 92) | fn seq(inputs: &[Input], map: impl Fn(&Input) -> Result<String, Err>) ->...
  function rayon (line 96) | fn rayon(
  function orx (line 104) | fn orx(
  function orx_arbitrary (line 112) | fn orx_arbitrary(
  function run (line 125) | fn run(c: &mut Criterion) {

FILE: benches/result_reduce_map.rs
  type Err (line 8) | type Err = ParseIntError;
  constant TEST_LARGE_OUTPUT (line 10) | const TEST_LARGE_OUTPUT: bool = false;
  constant N (line 11) | const N: usize = 65_536 * 4;
  constant N_EARLY (line 12) | const N_EARLY: usize = 1000;
  constant N_MIDDLE (line 13) | const N_MIDDLE: usize = 65_536 * 2;
  constant N_LATE (line 14) | const N_LATE: usize = 65_536 * 4 - 10;
  constant N_NEVER (line 15) | const N_NEVER: usize = usize::MAX;
  constant LARGE_OUTPUT_LEN (line 17) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 21) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 22) | const FIB_UPPER_BOUND: u32 = 201;
  type Input (line 25) | struct Input {
  function to_input (line 31) | fn to_input(idx: &usize) -> Input {
  function to_bad_input (line 54) | fn to_bad_input() -> Input {
  function map_input_to_result (line 62) | fn map_input_to_result(input: &Input) -> Result<String, Err> {
  function map_to_number (line 69) | fn map_to_number(a: String) -> u32 {
  function fibonacci (line 74) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 85) | fn inputs(len: usize, idx_error: usize) -> Vec<Input> {
  function seq (line 98) | fn seq(inputs: &[Input], map: impl Fn(&Input) -> Result<String, Err>) ->...
  function rayon (line 118) | fn rayon(
  function orx (line 143) | fn orx(
  function orx_arbitrary (line 156) | fn orx_arbitrary(
  function run (line 170) | fn run(c: &mut Criterion) {

FILE: benches/sum.rs
  constant SEED (line 8) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 9) | const FIB_UPPER_BOUND: u32 = 201;
  function to_output (line 11) | fn to_output(idx: &usize) -> u32 {
  function fibonacci (line 16) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 27) | fn inputs(len: usize) -> Vec<u32> {
  function seq (line 35) | fn seq(inputs: &[u32]) -> u32 {
  function rayon (line 39) | fn rayon(inputs: &[u32]) -> u32 {
  function orx (line 44) | fn orx(inputs: &[u32]) -> u32 {
  function run (line 48) | fn run(c: &mut Criterion) {

FILE: benches/sum_filtermap.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function filter_map (line 23) | fn filter_map(idx: &usize) -> Option<u64> {
  function to_output (line 29) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 50) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 61) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 68) | fn seq(inputs: &[usize]) -> u64 {
  function rayon (line 72) | fn rayon(inputs: &[usize]) -> u64 {
  function orx (line 77) | fn orx(inputs: &[usize]) -> u64 {
  function run (line 81) | fn run(c: &mut Criterion) {

FILE: benches/sum_flatmap.rs
  constant TEST_LARGE_OUTPUT (line 8) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 10) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 14) | const SEED: u64 = 9562;
  constant FIB_UPPER_BOUND (line 15) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 18) | struct Output {
  function flat_map (line 23) | fn flat_map(idx: &usize) -> Vec<u64> {
  function to_output (line 30) | fn to_output(idx: &usize) -> Output {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 69) | fn seq(inputs: &[usize]) -> u64 {
  function rayon (line 73) | fn rayon(inputs: &[usize]) -> u64 {
  function orx (line 78) | fn orx(inputs: &[usize]) -> u64 {
  function run (line 82) | fn run(c: &mut Criterion) {

FILE: benches/sum_map_filter.rs
  constant SEED (line 8) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 9) | const FIB_UPPER_BOUND: u32 = 201;
  function map (line 11) | fn map(idx: &usize) -> u32 {
  function filter (line 16) | fn filter(output: &u32) -> bool {
  function fibonacci (line 20) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 31) | fn inputs(len: usize) -> Vec<usize> {
  function seq (line 38) | fn seq(inputs: &[usize]) -> u32 {
  function rayon (line 42) | fn rayon(inputs: &[usize]) -> u32 {
  function orx (line 47) | fn orx(inputs: &[usize]) -> u32 {
  function run (line 51) | fn run(c: &mut Criterion) {

FILE: benches/t_par_merge_sorted.rs
  type X (line 20) | type X = usize;
  function elem (line 22) | fn elem(i: usize) -> X {
  function is_leq (line 27) | fn is_leq(a: &X, b: &X) -> bool {
  function new_vec (line 31) | fn new_vec<T: Ord>(len: usize, elem: impl Fn(usize) -> T, sort_kind: Sor...
  function split_to_sorted_vecs (line 48) | fn split_to_sorted_vecs<T: Ord + Clone>(vec: &[T], split_kind: SplitKind...
  function split_at (line 52) | fn split_at<T: Ord + Clone>(vec: &[T], split_at: usize) -> (Vec<T>, Vec<...
  type SortKind (line 65) | enum SortKind {
  type SplitKind (line 72) | enum SplitKind {
    method split_point (line 79) | fn split_point(&self, len: usize) -> usize {
  type Input (line 88) | struct Input {
  method drop (line 95) | fn drop(&mut self) {
  type MergeData (line 105) | struct MergeData {
    method all (line 147) | fn all() -> Vec<Self> {
  method factor_names (line 112) | fn factor_names() -> Vec<&'static str> {
  method factor_names_short (line 116) | fn factor_names_short() -> Vec<&'static str> {
  method factor_levels (line 120) | fn factor_levels(&self) -> Vec<String> {
  method factor_levels_short (line 128) | fn factor_levels_short(&self) -> Vec<String> {
  type Params (line 167) | struct Params(ParamsParMergeSortedSlices);
    method all (line 222) | fn all() -> Vec<Self> {
  method factor_names (line 170) | fn factor_names() -> Vec<&'static str> {
  method factor_names_short (line 181) | fn factor_names_short() -> Vec<&'static str> {
  method factor_levels (line 185) | fn factor_levels(&self) -> Vec<String> {
  method factor_levels_short (line 196) | fn factor_levels_short(&self) -> Vec<String> {
  type TuneExperiment (line 261) | struct TuneExperiment;
  type InputFactors (line 264) | type InputFactors = MergeData;
  type AlgFactors (line 266) | type AlgFactors = Params;
  type Input (line 268) | type Input = Input;
  type Output (line 270) | type Output = ();
  method input (line 272) | fn input(&mut self, treatment: &Self::InputFactors) -> Self::Input {
  method execute (line 284) | fn execute(&mut self, variant: &Self::AlgFactors, input: &Self::Input) -...
  function run (line 301) | pub fn run(c: &mut Criterion) {
  function run (line 309) | fn run(c: &mut Criterion) {
  function run (line 313) | fn run(_: &mut Criterion) {

FILE: benches/t_seq_merge_sorted.rs
  type X (line 17) | type X = usize;
  function elem (line 19) | fn elem(i: usize) -> X {
  function is_leq (line 24) | fn is_leq(a: &X, b: &X) -> bool {
  function new_vec (line 28) | fn new_vec<T: Ord>(len: usize, elem: impl Fn(usize) -> T, sort_kind: Sor...
  function split_to_sorted_vecs (line 45) | fn split_to_sorted_vecs<T: Ord + Clone>(vec: &[T], split_kind: SplitKind...
  function split_at (line 49) | fn split_at<T: Ord + Clone>(vec: &[T], split_at: usize) -> (Vec<T>, Vec<...
  type SortKind (line 61) | enum SortKind {
  type SplitKind (line 67) | enum SplitKind {
    method split_point (line 74) | fn split_point(&self, len: usize) -> usize {
  type Input (line 83) | struct Input {
  method drop (line 90) | fn drop(&mut self) {
  type MergeData (line 100) | struct MergeData {
    method all (line 142) | fn all() -> Vec<Self> {
  method factor_names (line 107) | fn factor_names() -> Vec<&'static str> {
  method factor_names_short (line 111) | fn factor_names_short() -> Vec<&'static str> {
  method factor_levels (line 115) | fn factor_levels(&self) -> Vec<String> {
  method factor_levels_short (line 123) | fn factor_levels_short(&self) -> Vec<String> {
  type Params (line 166) | struct Params(ParamsSeqMergeSortedSlices);
    method all (line 202) | fn all() -> Vec<Self> {
  method factor_names (line 169) | fn factor_names() -> Vec<&'static str> {
  method factor_names_short (line 173) | fn factor_names_short() -> Vec<&'static str> {
  method factor_levels (line 177) | fn factor_levels(&self) -> Vec<String> {
  method factor_levels_short (line 184) | fn factor_levels_short(&self) -> Vec<String> {
  type TuneExperiment (line 224) | struct TuneExperiment;
  type InputFactors (line 227) | type InputFactors = MergeData;
  type AlgFactors (line 229) | type AlgFactors = Params;
  type Input (line 231) | type Input = Input;
  type Output (line 233) | type Output = ();
  method input (line 235) | fn input(&mut self, treatment: &Self::InputFactors) -> Self::Input {
  method execute (line 247) | fn execute(&mut self, variant: &Self::AlgFactors, input: &Self::Input) -...
  function run (line 257) | pub fn run(c: &mut Criterion) {
  function run (line 265) | fn run(c: &mut Criterion) {
  function run (line 269) | fn run(_: &mut Criterion) {

FILE: benches/vec_deque_collect_map_filter.rs
  constant TEST_LARGE_OUTPUT (line 10) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 12) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 16) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 17) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 20) | struct Output {
  function map (line 25) | fn map(idx: &usize) -> Output {
  function filter (line 46) | fn filter(output: &Output) -> bool {
  function fibonacci (line 52) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 63) | fn inputs(len: usize) -> VecDeque<usize> {
  function seq (line 70) | fn seq(inputs: &VecDeque<usize>) -> Vec<Output> {
  function rayon (line 74) | fn rayon(inputs: &VecDeque<usize>) -> Vec<Output> {
  function orx_into_vec (line 79) | fn orx_into_vec(inputs: &VecDeque<usize>) -> Vec<Output> {
  function orx_into_split_vec (line 83) | fn orx_into_split_vec(inputs: &VecDeque<usize>) -> SplitVec<Output> {
  function run (line 87) | fn run(c: &mut Criterion) {

FILE: benches/vec_deque_collect_map_filter_owned.rs
  constant TEST_LARGE_OUTPUT (line 10) | const TEST_LARGE_OUTPUT: bool = false;
  constant LARGE_OUTPUT_LEN (line 12) | const LARGE_OUTPUT_LEN: usize = match TEST_LARGE_OUTPUT {
  constant SEED (line 16) | const SEED: u64 = 5426;
  constant FIB_UPPER_BOUND (line 17) | const FIB_UPPER_BOUND: u32 = 201;
  type Output (line 20) | struct Output {
  function map (line 25) | fn map(idx: usize) -> Output {
  function filter (line 45) | fn filter(output: &Output) -> bool {
  function fibonacci (line 51) | fn fibonacci(n: &u32) -> u32 {
  function inputs (line 62) | fn inputs(len: usize) -> VecDeque<usize> {
  function seq (line 69) | fn seq(inputs: VecDeque<usize>) -> Vec<Output> {
  function rayon (line 73) | fn rayon(inputs: VecDeque<usize>) -> Vec<Output> {
  function orx_into_vec (line 78) | fn orx_into_vec(inputs: VecDeque<usize>) -> Vec<Output> {
  function orx_into_split_vec (line 82) | fn orx_into_split_vec(inputs: VecDeque<usize>) -> SplitVec<Output> {
  function run (line 86) | fn run(c: &mut Criterion) {

FILE: examples/benchmark_collect.rs
  function main (line 4) | fn main() {
  function main (line 26) | fn main() {

FILE: examples/benchmark_find.rs
  function main (line 4) | fn main() {
  function main (line 26) | fn main() {

FILE: examples/benchmark_find_any.rs
  function main (line 4) | fn main() {
  function main (line 26) | fn main() {

FILE: examples/benchmark_heterogeneous.rs
  function main (line 4) | fn main() {
  function main (line 26) | fn main() {

FILE: examples/benchmark_pools.rs
  function main (line 34) | fn main() {

FILE: examples/benchmark_reduce.rs
  function main (line 4) | fn main() {
  function main (line 26) | fn main() {

FILE: examples/collection_of_results.rs
  constant N (line 4) | const N: usize = 10_000;
  constant IDX_BAD_INPUT (line 5) | const IDX_BAD_INPUT: [usize; 4] = [1900, 4156, 6777, 5663];
  constant ITERATION_ORDERS (line 6) | const ITERATION_ORDERS: [IterationOrder; 2] = [IterationOrder::Ordered, ...
  function good_input (line 8) | fn good_input() -> Vec<String> {
  function bad_input (line 12) | fn bad_input() -> Vec<String> {
  function collection_of_results_good_case (line 22) | fn collection_of_results_good_case() {
  function collection_of_results_bad_case (line 50) | fn collection_of_results_bad_case() {
  function collect_result (line 93) | fn collect_result() {
  function main (line 115) | fn main() {

FILE: examples/function_composition_with_mut_using.rs
  function compose_mut_ref_unsafe_1 (line 44) | fn compose_mut_ref_unsafe_1<T, U, X, I, R>(
  function test_mut_ref_unsafe_1 (line 66) | fn test_mut_ref_unsafe_1() {
  function compose_mut_ref_unsafe_2 (line 88) | fn compose_mut_ref_unsafe_2<T, U, M, X, I, R>(
  function test_mut_ref_unsafe_2 (line 117) | fn test_mut_ref_unsafe_2() {
  function compose_unsafe_cell_on_reduce (line 144) | fn compose_unsafe_cell_on_reduce<T, U, M, X, I, R>(
  function test_unsafe_cell_on_reduce (line 173) | fn test_unsafe_cell_on_reduce() {
  function compose_unsafe_cell_on_all (line 200) | fn compose_unsafe_cell_on_all<T, U, M, X, I, R>(
  function test_unsafe_cell_on_all (line 231) | fn test_unsafe_cell_on_all() {
  function compose_clone (line 258) | fn compose_clone<T, U, X, I, R>(xap1: X, reduce1: R) -> impl FnOnce(&mut...
  function test_clone (line 273) | fn test_clone() {
  function compose_raw_ptr_all (line 295) | fn compose_raw_ptr_all<T, U, M, X, I, R>(
  function test_raw_ptr_all (line 320) | fn test_raw_ptr_all() {
  type Version (line 346) | enum Version {
  type Args (line 356) | struct Args {
  function main (line 362) | fn main() {

FILE: examples/map_while.rs
  constant N (line 3) | const N: usize = 10_000;
  constant IDX_BAD_INPUT (line 4) | const IDX_BAD_INPUT: [usize; 4] = [1900, 4156, 6777, 5663];
  function good_input (line 6) | fn good_input() -> Vec<String> {
  function bad_input (line 10) | fn bad_input() -> Vec<String> {
  function main (line 19) | fn main() {

FILE: examples/max_num_threads_config.rs
  function fib (line 13) | fn fib(n: &u64) -> u64 {
  constant MAX_NUM_THREADS_ENV_VARIABLE (line 26) | const MAX_NUM_THREADS_ENV_VARIABLE: &str = "ORX_PARALLEL_MAX_NUM_THREADS";
  function max_num_threads_by_env_variable (line 28) | fn max_num_threads_by_env_variable() -> Option<usize> {
  function main (line 39) | fn main() {

FILE: examples/mutable_par_iter.rs
  constant N (line 6) | const N: usize = 1_000_000;
  function mut_slice_into_par (line 8) | fn mut_slice_into_par() {
  function vec_par_mut (line 26) | fn vec_par_mut() {
  function iter_mut_into_par (line 43) | fn iter_mut_into_par() {
  function main (line 61) | fn main() {

FILE: examples/par_merge_sorted.rs
  function main (line 2) | fn main() {
  function main (line 7) | fn main() {

FILE: examples/parallelization_on_tree/collection_on_entire_tree.rs
  type Node (line 4) | type Node = crate::node::Node<String>;
  function run (line 6) | pub fn run(root: &Node) {
  function compute (line 41) | fn compute(node: &Node) -> u64 {
  function sequential (line 49) | fn sequential(root: &Node) -> Vec<u64> {
  function orx_rec (line 72) | fn orx_rec(root: &Node) -> Vec<u64> {
  function orx_rec_linearized (line 87) | fn orx_rec_linearized(root: &Node) -> Vec<u64> {
  function orx_rec_exact (line 110) | fn orx_rec_exact(root: &Node) -> Vec<u64> {

FILE: examples/parallelization_on_tree/main.rs
  type Args (line 15) | struct Args {
  function amount_of_work (line 21) | pub fn amount_of_work() -> &'static usize {
  function main (line 26) | fn main() {

FILE: examples/parallelization_on_tree/node.rs
  type Node (line 3) | pub struct Node<T> {
  method fmt (line 10) | fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
  function num_nodes (line 28) | pub fn num_nodes(&self) -> usize {

FILE: examples/parallelization_on_tree/reduction_on_entire_tree.rs
  type Node (line 5) | type Node = crate::node::Node<String>;
  function run (line 7) | pub fn run(root: &Node) {
  function compute (line 57) | fn compute(node: &Node) -> u64 {
  function sequential (line 65) | fn sequential(root: &Node) -> u64 {
  function rayon (line 76) | pub fn rayon(root: &Node) -> u64 {
  function orx_rec (line 102) | fn orx_rec(root: &Node) -> u64 {
  function orx_rec_linearized (line 117) | fn orx_rec_linearized(root: &Node) -> u64 {
  function orx_rec_exact (line 136) | fn orx_rec_exact(root: &Node) -> u64 {

FILE: examples/parallelization_on_tree/reduction_on_subset_of_tree.rs
  type Node (line 4) | type Node = crate::node::Node<String>;
  function run (line 6) | pub fn run(root: &Node) {
  function compute (line 54) | fn compute(node: &Node) -> u64 {
  function filter (line 58) | fn filter(node: &&Node) -> bool {
  function sequential (line 66) | fn sequential(root: &Node) -> u64 {
  function push_orx_rec (line 85) | fn push_orx_rec(root: &Node) -> u64 {
  function collect_extend_orx_rec (line 102) | fn collect_extend_orx_rec(root: &Node) -> u64 {

FILE: examples/parallelization_on_tree/run_utils.rs
  function timed (line 4) | pub fn timed<F, L, T>(name: &'static str, fun: F, log: L)
  function compute (line 22) | pub fn compute(value: u64) -> u64 {

FILE: examples/parallelization_on_tree/tree.rs
  type Tree (line 5) | pub struct Tree<T>(PhantomData<T>);
  function new_node (line 8) | pub fn new_node(
  function create_node (line 51) | fn create_node<T>(out_edges: &[Vec<usize>], idx: usize, data: fn(usize) ...

FILE: examples/using_for_each.rs
  function for_each (line 6) | fn for_each() {
  function map (line 23) | fn map() {
  function main (line 43) | fn main() {

FILE: examples/using_map.rs
  constant N (line 6) | const N: u64 = 100_000;
  function fibonacci (line 9) | fn fibonacci(n: u64) -> u64 {
  function using (line 20) | fn using() -> u64 {
  function using_clone (line 32) | fn using_clone() -> u64 {
  function using_clone_while_counting_clones (line 46) | fn using_clone_while_counting_clones() -> u64 {
  function main (line 76) | fn main() {

FILE: examples/using_metrics.rs
  constant N (line 4) | const N: u64 = 10_000_000;
  constant MAX_NUM_THREADS (line 5) | const MAX_NUM_THREADS: usize = 8;
  function fibonacci (line 8) | fn fibonacci(n: u64) -> u64 {
  type ThreadMetrics (line 20) | struct ThreadMetrics {
  type ThreadMetricsWriter (line 27) | struct ThreadMetricsWriter<'a> {
  type ComputationMetrics (line 31) | struct ComputationMetrics {
    method new (line 35) | fn new() -> Self {
    method create_for_thread (line 49) | unsafe fn create_for_thread<'a>(&self, thread_idx: usize) -> ThreadMet...
  function main (line 68) | fn main() {

FILE: examples/using_random_walk.rs
  function random_walk (line 5) | fn random_walk(rng: &mut impl Rng, position: i64, num_steps: usize) -> i...
  function random_step (line 9) | fn random_step(rng: &mut impl Rng, position: i64) -> i64 {
  function input_positions (line 16) | fn input_positions() -> Vec<i64> {
  function sequential (line 20) | fn sequential() {
  function parallel (line 35) | fn parallel() {
  function main (line 50) | fn main() {

FILE: examples/utils/benchmark_utils.rs
  function timed_reduce (line 11) | fn timed_reduce<F, O>(num_repetitions: usize, expected_output: &Option<O...
  type Computation (line 38) | type Computation<'a, O> = (&'a str, Box<dyn Fn() -> O>);
  function timed_reduce_all (line 40) | pub fn timed_reduce_all<O>(
  function timed_collect (line 58) | fn timed_collect<F, Out, O>(num_repetitions: usize, expected_output: &[O...
  function timed_collect_all (line 81) | pub fn timed_collect_all<Out, O>(

FILE: src/collect_into/collect.rs
  function map_collect_into (line 11) | pub fn map_collect_into<R, I, O, M1, P>(
  function map_collect_into_seq (line 38) | fn map_collect_into_seq<I, O, M1, P>(iter: I, map1: M1, mut pinned_vec: ...
  function xap_collect_into (line 52) | pub fn xap_collect_into<R, I, Vo, X1, P>(
  function xap_collect_into_seq (line 95) | fn xap_collect_into_seq<I, Vo, X1, P>(iter: I, xap1: X1, mut pinned_vec:...
  function xap_try_collect_into (line 115) | pub fn xap_try_collect_into<R, I, Vo, X1, P>(
  function xap_try_collect_into_seq (line 151) | fn xap_try_collect_into_seq<I, Vo, X1, P>(

FILE: src/collect_into/fixed_vec.rs
  type BridgePinnedVec (line 16) | type BridgePinnedVec = Self;
  function empty (line 18) | fn empty(iter_len: Option<usize>) -> Self {
  function m_collect_into (line 23) | fn m_collect_into<R, I, M1>(self, orchestrator: R, params: Params, iter:...
  function x_collect_into (line 34) | fn x_collect_into<R, I, Vo, X1>(
  function x_try_collect_into (line 51) | fn x_try_collect_into<R, I, Vo, X1>(
  function length (line 72) | fn length(&self) -> usize {

FILE: src/collect_into/par_collect_into.rs
  type ParCollectIntoCore (line 10) | pub trait ParCollectIntoCore<O>: Collection<Item = O> {
    method empty (line 13) | fn empty(iter_len: Option<usize>) -> Self;
    method m_collect_into (line 15) | fn m_collect_into<R, I, M1>(self, orchestrator: R, params: Params, ite...
    method x_collect_into (line 21) | fn x_collect_into<R, I, Vo, X1>(
    method x_try_collect_into (line 34) | fn x_try_collect_into<R, I, Vo, X1>(
    method length (line 51) | fn length(&self) -> usize;
    method is_empty (line 54) | fn is_empty(&self) -> bool {
    method is_equal_to (line 59) | fn is_equal_to<'a>(&self, b: impl orx_iterable::Iterable<Item = &'a O>...
    method is_equal_to_ref (line 76) | fn is_equal_to_ref(&self, b: impl orx_iterable::Iterable<Item = O>) ->...
  type ParCollectInto (line 94) | pub trait ParCollectInto<O>: ParCollectIntoCore<O> + UParCollectIntoCore...

FILE: src/collect_into/split_vec.rs
  type BridgePinnedVec (line 19) | type BridgePinnedVec = Self;
  function empty (line 21) | fn empty(iter_len: Option<usize>) -> Self {
  function m_collect_into (line 27) | fn m_collect_into<R, I, M1>(
  function x_collect_into (line 45) | fn x_collect_into<R, I, Vo, X1>(
  function x_try_collect_into (line 63) | fn x_try_collect_into<R, I, Vo, X1>(
  function length (line 85) | fn length(&self) -> usize {

FILE: src/collect_into/utils.rs
  function extend_vec_from_split (line 5) | pub fn extend_vec_from_split<T, G>(
  function split_vec_reserve (line 22) | pub fn split_vec_reserve<T, G: GrowthWithConstantTimeAccess>(

FILE: src/collect_into/vec.rs
  type BridgePinnedVec (line 17) | type BridgePinnedVec = FixedVec<O>;
  function empty (line 19) | fn empty(iter_len: Option<usize>) -> Self {
  function m_collect_into (line 26) | fn m_collect_into<R, I, M1>(
  function x_collect_into (line 54) | fn x_collect_into<R, I, Vo, X1>(
  function x_try_collect_into (line 72) | fn x_try_collect_into<R, I, Vo, X1>(
  function length (line 94) | fn length(&self) -> usize {

FILE: src/computational_variants/fallible_option.rs
  type ParOption (line 10) | pub struct ParOption<F, T, R = DefaultRunner>
  function new (line 24) | pub(crate) fn new(par: F) -> Self {
  type Item (line 37) | type Item = T;
  function num_threads (line 41) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 45) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 49) | fn iteration_order(self, order: IterationOrder) -> Self {
  function with_runner (line 53) | fn with_runner<Q: ParallelRunner>(
  function map (line 62) | fn map<Out, Map>(self, map: Map) -> impl ParIterOption<R, Item = Out>
  function filter (line 70) | fn filter<Filter>(self, filter: Filter) -> impl ParIterOption<R, Item = ...
  function flat_map (line 79) | fn flat_map<IOut, FlatMap>(self, flat_map: FlatMap) -> impl ParIterOptio...
  function filter_map (line 89) | fn filter_map<Out, FilterMap>(self, filter_map: FilterMap) -> impl ParIt...
  function inspect (line 98) | fn inspect<Operation>(self, operation: Operation) -> impl ParIterOption<...
  function collect_into (line 109) | fn collect_into<C>(self, output: C) -> Option<C>
  function collect (line 117) | fn collect<C>(self) -> Option<C>
  function reduce (line 127) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Option<Self::Item>>
  function first (line 137) | fn first(self) -> Option<Option<Self::Item>>

FILE: src/computational_variants/fallible_result/map_result.rs
  type ParMapResult (line 11) | pub struct ParMapResult<I, T, E, O, M1, R = DefaultRunner>
  function new (line 29) | pub(crate) fn new(par: ParMap<I, O, M1, R>) -> Self {
  type Item (line 44) | type Item = T;
  type Err (line 46) | type Err = E;
  type RegularItem (line 48) | type RegularItem = O;
  type RegularParIter (line 50) | type RegularParIter = ParMap<I, O, M1, R>;
  function con_iter_len (line 52) | fn con_iter_len(&self) -> Option<usize> {
  function into_regular_par (line 56) | fn into_regular_par(self) -> Self::RegularParIter {
  function from_regular_par (line 60) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self {
  function with_runner (line 69) | fn with_runner<Q: ParallelRunner>(
  function collect_into (line 82) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
  function reduce (line 95) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, Se...
  function first (line 108) | fn first(self) -> Result<Option<Self::Item>, Self::Err>

FILE: src/computational_variants/fallible_result/par_result.rs
  type ParResult (line 11) | pub struct ParResult<I, T, E, R = DefaultRunner>
  function new (line 27) | pub(crate) fn new(par: Par<I, R>) -> Self {
  type Item (line 41) | type Item = T;
  type Err (line 43) | type Err = E;
  type RegularItem (line 45) | type RegularItem = I::Item;
  type RegularParIter (line 47) | type RegularParIter = Par<I, R>;
  function con_iter_len (line 49) | fn con_iter_len(&self) -> Option<usize> {
  function into_regular_par (line 53) | fn into_regular_par(self) -> Self::RegularParIter {
  function from_regular_par (line 57) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self {
  function with_runner (line 66) | fn with_runner<Q: ParallelRunner>(
  function collect_into (line 79) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
  function reduce (line 92) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, Se...
  function first (line 105) | fn first(self) -> Result<Option<Self::Item>, Self::Err>

FILE: src/computational_variants/fallible_result/xap_result.rs
  type ParXapResult (line 13) | pub struct ParXapResult<I, T, E, Vo, X1, R = DefaultRunner>
  function new (line 36) | pub(crate) fn new(orchestrator: R, params: Params, iter: I, xap1: X1) ->...
  function destruct (line 46) | fn destruct(self) -> (R, Params, I, X1) {
  type Item (line 59) | type Item = T;
  type Err (line 61) | type Err = E;
  type RegularItem (line 63) | type RegularItem = Vo::Item;
  type RegularParIter (line 65) | type RegularParIter = ParXap<I, Vo, X1, R>;
  function con_iter_len (line 67) | fn con_iter_len(&self) -> Option<usize> {
  function into_regular_par (line 71) | fn into_regular_par(self) -> Self::RegularParIter {
  function from_regular_par (line 76) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self {
  function with_runner (line 83) | fn with_runner<Q: ParallelRunner>(
  function collect_into (line 93) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
  function reduce (line 106) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, Se...
  function first (line 119) | fn first(self) -> Result<Option<Self::Item>, Self::Err>

FILE: src/computational_variants/map.rs
  type ParMap (line 13) | pub struct ParMap<I, O, M1, R = DefaultRunner>
  function new (line 31) | pub(crate) fn new(orchestrator: R, params: Params, iter: I, map1: M1) ->...
  function destruct (line 40) | pub(crate) fn destruct(self) -> (R, Params, I, M1) {
  type Item (line 67) | type Item = O;
  function con_iter (line 69) | fn con_iter(&self) -> &impl ConcurrentIter {
  function params (line 73) | fn params(&self) -> Params {
  function num_threads (line 79) | fn num_threads(mut self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 84) | fn chunk_size(mut self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 89) | fn iteration_order(mut self, collect: IterationOrder) -> Self {
  function with_runner (line 94) | fn with_runner<Q: ParallelRunner>(self, orchestrator: Q) -> impl ParIter...
  function using (line 101) | fn using<'using, U, F>(
  function using_clone (line 115) | fn using_clone<U>(
  function map (line 130) | fn map<Out, Map>(self, map: Map) -> impl ParIter<R, Item = Out>
  function filter (line 139) | fn filter<Filter>(self, filter: Filter) -> impl ParIter<R, Item = Self::...
  function flat_map (line 152) | fn flat_map<IOut, FlatMap>(self, flat_map: FlatMap) -> impl ParIter<R, I...
  function filter_map (line 162) | fn filter_map<Out, FilterMap>(self, filter_map: FilterMap) -> impl ParIt...
  function take_while (line 171) | fn take_while<While>(self, take_while: While) -> impl ParIter<R, Item = ...
  function into_fallible_result (line 180) | fn into_fallible_result<Out, Err>(self) -> impl ParIterResult<R, Item = ...
  function collect_into (line 189) | fn collect_into<C>(self, output: C) -> C
  function reduce (line 199) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
  function first (line 210) | fn first(self) -> Option<Self::Item>
  function enumerate (line 228) | fn enumerate(self) -> impl ParIter<R, Item = (usize, Self::Item)> {

FILE: src/computational_variants/par.rs
  type Par (line 16) | pub struct Par<I, R = DefaultRunner>
  function new (line 31) | pub(crate) fn new(orchestrator: R, params: Params, iter: I) -> Self {
  function destruct (line 39) | pub(crate) fn destruct(self) -> (R, Params, I) {
  function orchestrator (line 43) | pub(crate) fn orchestrator(&self) -> &R {
  type Item (line 67) | type Item = I::Item;
  function con_iter (line 69) | fn con_iter(&self) -> &impl ConcurrentIter {
  function params (line 73) | fn params(&self) -> Params {
  function num_threads (line 79) | fn num_threads(mut self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 84) | fn chunk_size(mut self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 89) | fn iteration_order(mut self, collect: IterationOrder) -> Self {
  function with_runner (line 94) | fn with_runner<Q: ParallelRunner>(self, orchestrator: Q) -> impl ParIter...
  function using (line 100) | fn using<'using, U, F>(
  function using_clone (line 113) | fn using_clone<U>(
  function map (line 127) | fn map<Out, Map>(self, map: Map) -> impl ParIter<R, Item = Out>
  function filter (line 135) | fn filter<Filter>(self, filter: Filter) -> impl ParIter<R, Item = Self::...
  function flat_map (line 144) | fn flat_map<IOut, FlatMap>(self, flat_map: FlatMap) -> impl ParIter<R, I...
  function filter_map (line 154) | fn filter_map<Out, FilterMap>(self, filter_map: FilterMap) -> impl ParIt...
  function take_while (line 162) | fn take_while<While>(self, take_while: While) -> impl ParIter<R, Item = ...
  function into_fallible_result (line 171) | fn into_fallible_result<Out, Err>(self) -> impl ParIterResult<R, Item = ...
  function collect_into (line 180) | fn collect_into<C>(self, output: C) -> C
  function reduce (line 190) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
  function first (line 201) | fn first(self) -> Option<Self::Item> {
  function chain (line 233) | pub fn chain<C>(self, other: C) -> Par<ChainKnownLenI<I, C::IntoIter>, R>
  function enumerate (line 249) | fn enumerate(self) -> impl ParIter<R, Item = (usize, Self::Item)> {

FILE: src/computational_variants/tests/copied.rs
  function input (line 5) | fn input<O: FromIterator<usize>>(n: usize) -> O {
  function copied_cloned_empty (line 10) | fn copied_cloned_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function copied_cloned_map (line 26) | fn copied_cloned_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function copied_cloned_xap_flat_map (line 43) | fn copied_cloned_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function copied_cloned_xap_filter_map (line 60) | fn copied_cloned_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usiz...
  function copied_cloned_xap_filter_xap (line 77) | fn copied_cloned_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usiz...

FILE: src/computational_variants/tests/count.rs
  function input (line 7) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function count_empty (line 13) | fn count_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_map (line 25) | fn count_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_xap_flat_map (line 38) | fn count_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_xap_filter_map (line 52) | fn count_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_xap_filter_xap (line 66) | fn count_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/enumerate.rs
  function enumerate_sequential (line 8) | fn enumerate_sequential(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function enumerate_map (line 22) | fn enumerate_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function enumerate_using (line 38) | fn enumerate_using(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/fallible_option.rs
  function input (line 7) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function fallible_option_collect_empty (line 13) | fn fallible_option_collect_empty(nt: &[usize], chunk: &[usize]) {
  function fallible_option_collect_partial_success (line 33) | fn fallible_option_collect_partial_success(n: &[usize], nt: &[usize], ch...
  function fallible_option_collect_complete_success (line 54) | fn fallible_option_collect_complete_success(n: &[usize], nt: &[usize], c...

FILE: src/computational_variants/tests/fallible_result.rs
  function input (line 7) | fn input<O: FromIterator<String>>(n: usize) -> O {
  type MyErr (line 13) | struct MyErr(String);
    method new (line 15) | fn new() -> Self {
  function fallible_result_collect_empty (line 21) | fn fallible_result_collect_empty(nt: &[usize], chunk: &[usize]) {
  function fallible_result_collect_partial_success (line 41) | fn fallible_result_collect_partial_success(n: &[usize], nt: &[usize], ch...
  function fallible_result_collect_complete_success (line 65) | fn fallible_result_collect_complete_success(n: &[usize], nt: &[usize], c...

FILE: src/computational_variants/tests/flatten.rs
  function flatten_empty (line 8) | fn flatten_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function flatten_map (line 27) | fn flatten_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function flatten_xap_filter_map (line 44) | fn flatten_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function flatten_xap_filter_xap (line 69) | fn flatten_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/for_each.rs
  function input (line 8) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function sorted (line 13) | fn sorted(mut x: Vec<String>) -> Vec<String> {
  function for_each_empty (line 19) | fn for_each_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_map (line 35) | fn for_each_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_xap_flat_map (line 56) | fn for_each_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_xap_filter_map (line 77) | fn for_each_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_xap_filter_xap (line 98) | fn for_each_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/inspect.rs
  function input (line 8) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function sorted (line 13) | fn sorted(mut x: Vec<String>) -> Vec<String> {
  function inspect_empty (line 19) | fn inspect_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_map (line 36) | fn inspect_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_xap_flat_map (line 58) | fn inspect_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_xap_filter_map (line 80) | fn inspect_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_xap_filter_xap (line 102) | fn inspect_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/iter_consuming.rs
  constant N_OFFSET (line 11) | const N_OFFSET: usize = 13;
  function offset (line 13) | fn offset() -> Vec<String> {
  function input (line 17) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 22) | fn expected(
  function empty_collect_into (line 44) | fn empty_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ...
  function empty_collect (line 65) | fn empty_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[u...
  function map_collect_into (line 88) | fn map_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ch...
  function map_collect (line 110) | fn map_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[usi...

FILE: src/computational_variants/tests/iter_ref.rs
  function input (line 11) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 16) | fn expected(input: &impl Collection<Item = String>, map: impl Fn(String)...
  function empty_collect_into (line 23) | fn empty_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function empty_collect (line 49) | fn empty_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect_into (line 77) | fn map_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect (line 94) | fn map_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/map/collect.rs
  constant N (line 12) | const N: [usize; 2] = [37, 125];
  constant N (line 14) | const N: [usize; 2] = [1025, 4735];
  function m_map_collect (line 22) | fn m_map_collect(n: usize, nt: usize, chunk: usize, ordering: IterationO...

FILE: src/computational_variants/tests/map/find.rs
  constant N (line 9) | const N: [usize; 2] = [37, 125];
  constant N (line 11) | const N: [usize; 2] = [1025, 4735];
  function m_find (line 18) | fn m_find(n: usize, nt: usize, chunk: usize) {
  function m_map_find (line 35) | fn m_map_find(n: usize, nt: usize, chunk: usize) {

FILE: src/computational_variants/tests/map/reduce.rs
  constant N (line 9) | const N: [usize; 2] = [37, 125];
  constant N (line 11) | const N: [usize; 2] = [1025, 4735];
  function m_reduce (line 18) | fn m_reduce(n: usize, nt: usize, chunk: usize) {
  function m_map_reduce (line 40) | fn m_map_reduce(n: usize, nt: usize, chunk: usize) {

FILE: src/computational_variants/tests/min_max.rs
  function input (line 7) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function cmp (line 12) | fn cmp(a: &usize, b: &usize) -> Ordering {
  function key (line 19) | fn key(a: &usize) -> u64 {
  function min_max_empty (line 24) | fn min_max_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_map (line 48) | fn min_max_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_xap_flat_map (line 80) | fn min_max_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_xap_filter_map (line 122) | fn min_max_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_xap_filter_xap (line 169) | fn min_max_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/range.rs
  constant N_OFFSET (line 10) | const N_OFFSET: usize = 13;
  function offset (line 12) | fn offset() -> Vec<usize> {
  function expected (line 16) | fn expected<T>(
  function empty_collect_into (line 37) | fn empty_collect_into<C>(output: C, n: &[usize], nt: &[usize], chunk: &[...
  function empty_collect (line 55) | fn empty_collect<C>(_: C, n: &[usize], nt: &[usize], chunk: &[usize])
  function map_collect_into (line 75) | fn map_collect_into<C>(output: C, n: &[usize], nt: &[usize], chunk: &[us...
  function map_collect (line 94) | fn map_collect<C>(_: C, n: &[usize], nt: &[usize], chunk: &[usize])

FILE: src/computational_variants/tests/slice.rs
  function input (line 11) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 16) | fn expected(input: &impl Collection<Item = String>, map: impl Fn(String)...
  function empty_collect_into (line 23) | fn empty_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function empty_collect (line 49) | fn empty_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect_into (line 77) | fn map_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect (line 94) | fn map_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/sum.rs
  function input (line 6) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function sum_empty (line 12) | fn sum_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_map (line 24) | fn sum_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_xap_flat_map (line 38) | fn sum_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_xap_filter_map (line 52) | fn sum_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_xap_filter_xap (line 66) | fn sum_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/computational_variants/tests/vectors.rs
  constant N_OFFSET (line 11) | const N_OFFSET: usize = 13;
  function offset (line 13) | fn offset() -> Vec<String> {
  function input (line 17) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 22) | fn expected(
  function empty_collect_into (line 44) | fn empty_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ...
  function empty_collect (line 64) | fn empty_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[u...
  function map_collect_into (line 86) | fn map_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ch...
  function map_collect (line 107) | fn map_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[usi...

FILE: src/computational_variants/tests/xap/collect.rs
  constant N (line 15) | const N: [usize; 2] = [37, 125];
  constant N (line 17) | const N: [usize; 2] = [1025, 4735];
  function todo_panic_at_con_bag_new (line 20) | fn todo_panic_at_con_bag_new() {
  function x_flat_map_collect (line 65) | fn x_flat_map_collect(n: usize, nt: usize, chunk: usize, ordering: Itera...
  function x_filter_map_collect (line 104) | fn x_filter_map_collect(n: usize, nt: usize, chunk: usize, ordering: Ite...

FILE: src/computational_variants/tests/xap/find.rs
  constant N (line 13) | const N: [usize; 2] = [37, 125];
  constant N (line 15) | const N: [usize; 2] = [1025, 4735];
  function x_flat_map_find (line 22) | fn x_flat_map_find(n: usize, nt: usize, chunk: usize) {
  function x_filter_map_find (line 43) | fn x_filter_map_find(n: usize, nt: usize, chunk: usize) {

FILE: src/computational_variants/tests/xap/reduce.rs
  constant N (line 13) | const N: [usize; 2] = [37, 125];
  constant N (line 15) | const N: [usize; 2] = [1025, 4735];
  function x_flat_map_reduce (line 22) | fn x_flat_map_reduce(n: usize, nt: usize, chunk: usize) {
  function x_filter_map_reduce (line 47) | fn x_filter_map_reduce(n: usize, nt: usize, chunk: usize) {

FILE: src/computational_variants/xap.rs
  type ParXap (line 15) | pub struct ParXap<I, Vo, X1, R = DefaultRunner>
  function new (line 35) | pub(crate) fn new(orchestrator: R, params: Params, iter: I, xap1: X1) ->...
  function destruct (line 44) | pub(crate) fn destruct(self) -> (R, Params, I, X1) {
  type Item (line 74) | type Item = Vo::Item;
  function con_iter (line 76) | fn con_iter(&self) -> &impl ConcurrentIter {
  function params (line 80) | fn params(&self) -> Params {
  function num_threads (line 86) | fn num_threads(mut self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 91) | fn chunk_size(mut self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 96) | fn iteration_order(mut self, collect: IterationOrder) -> Self {
  function with_runner (line 101) | fn with_runner<Q: ParallelRunner>(self, orchestrator: Q) -> impl ParIter...
  function using (line 108) | fn using<'using, U, F>(
  function using_clone (line 122) | fn using_clone<U>(
  function map (line 137) | fn map<Out, Map>(self, map: Map) -> impl ParIter<R, Item = Out>
  function filter (line 150) | fn filter<Filter>(self, filter: Filter) -> impl ParIter<R, Item = Self::...
  function flat_map (line 162) | fn flat_map<IOut, FlatMap>(self, flat_map: FlatMap) -> impl ParIter<R, I...
  function filter_map (line 175) | fn filter_map<Out, FilterMap>(self, filter_map: FilterMap) -> impl ParIt...
  function take_while (line 187) | fn take_while<While>(self, take_while: While) -> impl ParIter<R, Item = ...
  function into_fallible_result (line 199) | fn into_fallible_result<Out, Err>(self) -> impl ParIterResult<R, Item = ...
  function collect_into (line 209) | fn collect_into<C>(self, output: C) -> C
  function reduce (line 219) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
  function first (line 231) | fn first(self) -> Option<Self::Item>

FILE: src/default_fns.rs
  function map_self (line 4) | pub fn map_self<T>(input: T) -> T {
  function map_count (line 9) | pub fn map_count<T>(_: T) -> usize {
  function map_copy (line 14) | pub fn map_copy<T: Copy>(x: &T) -> T {
  function map_clone (line 19) | pub fn map_clone<T: Clone>(x: &T) -> T {
  function reduce_sum (line 24) | pub fn reduce_sum<T>(a: T, b: T) -> T
  function reduce_unit (line 32) | pub fn reduce_unit(_: (), _: ()) {}
  function u_map_self (line 37) | pub fn u_map_self<U, T>(_: &mut U, input: T) -> T {
  function u_map_copy (line 42) | pub fn u_map_copy<U, T: Copy>(_: &mut U, x: &T) -> T {
  function u_map_clone (line 47) | pub fn u_map_clone<U, T: Clone>(_: &mut U, x: &T) -> T {
  function u_map_count (line 52) | pub fn u_map_count<U, T>(_: &mut U, _: T) -> usize {
  function u_reduce_sum (line 57) | pub fn u_reduce_sum<U, T>(_: &mut U, a: T, b: T) -> T
  function u_reduce_unit (line 65) | pub fn u_reduce_unit<U>(_: &mut U, _: (), _: ()) {}

FILE: src/enumerate/mod.rs
  type ParEnumerate (line 5) | pub trait ParEnumerate<R: ParallelRunner>: ParIter<R> {
    method enumerate (line 21) | fn enumerate(self) -> impl ParIter<R, Item = (usize, Self::Item)>;

FILE: src/env.rs
  constant MAX_NUM_THREADS_ENV_VARIABLE (line 4) | const MAX_NUM_THREADS_ENV_VARIABLE: &str = "ORX_PARALLEL_MAX_NUM_THREADS";
  function max_num_threads_by_env_variable (line 6) | pub fn max_num_threads_by_env_variable() -> Option<NonZeroUsize> {

FILE: src/executor/computation_kind.rs
  type ComputationKind (line 3) | pub enum ComputationKind {

FILE: src/executor/executor_with_diagnostics/parallel_executor.rs
  type ParallelExecutorWithDiagnostics (line 61) | pub struct ParallelExecutorWithDiagnostics<E>
  type SharedState (line 72) | type SharedState = SharedStateWithDiagnostics<E::SharedState>;
  type ThreadExecutor (line 74) | type ThreadExecutor = ThreadExecutorWithDiagnostics<E>;
  method new (line 76) | fn new(
  method new_shared_state (line 86) | fn new_shared_state(&self) -> Self::SharedState {
  method do_spawn_new (line 91) | fn do_spawn_new<I>(
  method new_thread_executor (line 104) | fn new_thread_executor(
  method complete_task (line 115) | fn complete_task(self, shared_state: Self::SharedState) {

FILE: src/executor/executor_with_diagnostics/shared_state.rs
  type SharedStateWithDiagnostics (line 5) | pub struct SharedStateWithDiagnostics<S> {
  function new (line 11) | pub fn new(inner: S) -> Self {
  function inner (line 20) | pub fn inner(&self) -> &S {
  function add_task_counts_of_thread (line 24) | pub fn add_task_counts_of_thread(&self, thread_idx: usize, chunk_sizes: ...
  function display (line 28) | pub fn display(self) {

FILE: src/executor/executor_with_diagnostics/thread_executor.rs
  type ThreadExecutorWithDiagnostics (line 7) | pub struct ThreadExecutorWithDiagnostics<E>
  function new (line 20) | pub(super) fn new(thread_idx: usize, executor: E::ThreadExecutor) -> Self {
  type SharedState (line 33) | type SharedState = SharedStateWithDiagnostics<E::SharedState>;
  method next_chunk_size (line 35) | fn next_chunk_size<I>(&self, shared_state: &Self::SharedState, iter: &I)...
  method begin_chunk (line 42) | fn begin_chunk(&mut self, chunk_size: usize) {
  method complete_chunk (line 46) | fn complete_chunk(&mut self, shared_state: &Self::SharedState, chunk_siz...
  method complete_task (line 52) | fn complete_task(&mut self, shared_state: &Self::SharedState) {

FILE: src/executor/fixed_chunk_executor/chunk_size.rs
  constant MAX_CHUNK_SIZE (line 4) | const MAX_CHUNK_SIZE: usize = 1 << 20;
  constant DESIRED_MIN_CHUNK_SIZE (line 5) | const DESIRED_MIN_CHUNK_SIZE: usize = 64;
  type ResolvedChunkSize (line 8) | pub enum ResolvedChunkSize {
    method new (line 14) | pub fn new(
    method chunk_size (line 27) | pub fn chunk_size(self) -> usize {
  function min_required_len (line 35) | const fn min_required_len(kind: ComputationKind, one_round_len: usize) -...
  function auto_chunk_size (line 43) | fn auto_chunk_size(
  function min_chunk_size (line 82) | fn min_chunk_size(
  function div_ceil (line 101) | const fn div_ceil(number: usize, divider: usize) -> usize {

FILE: src/executor/fixed_chunk_executor/parallel_executor.rs
  constant LAG_PERIODICITY (line 12) | const LAG_PERIODICITY: usize = 4;
  type FixedChunkRunner (line 14) | pub struct FixedChunkRunner {
    method spawn_new (line 33) | fn spawn_new(&self, num_spawned: usize, remaining: Option<usize>) -> b...
    method next_chunk (line 41) | fn next_chunk(&self, num_spawned: usize, remaining_len: Option<usize>)...
    method next_chunk_size_unknown_len (line 50) | fn next_chunk_size_unknown_len(&self, num_spawned: usize) -> Option<us...
    method next_chunk_size_known_len (line 57) | fn next_chunk_size_known_len(
  method clone (line 22) | fn clone(&self) -> Self {
  type SharedState (line 87) | type SharedState = ();
  type ThreadExecutor (line 89) | type ThreadExecutor = FixedChunkThreadExecutor;
  method new (line 91) | fn new(
  method new_shared_state (line 108) | fn new_shared_state(&self) -> Self::SharedState {}
  method do_spawn_new (line 110) | fn do_spawn_new<I>(&self, num_spawned: NumSpawned, _: &Self::SharedState...
  method new_thread_executor (line 125) | fn new_thread_executor(&self, _: usize, _: &Self::SharedState) -> Self::...
  method complete_task (line 131) | fn complete_task(self, _: Self::SharedState) {}

FILE: src/executor/fixed_chunk_executor/thread_executor.rs
  type FixedChunkThreadExecutor (line 4) | pub struct FixedChunkThreadExecutor {
  type SharedState (line 9) | type SharedState = ();
  method next_chunk_size (line 12) | fn next_chunk_size<I>(&self, _: &Self::SharedState, _: &I) -> usize
  method begin_chunk (line 19) | fn begin_chunk(&mut self, _: usize) {}
  method complete_chunk (line 21) | fn complete_chunk(&mut self, _: &Self::SharedState, _: usize) {}
  method complete_task (line 23) | fn complete_task(&mut self, _: &Self::SharedState) {}

FILE: src/executor/mod.rs
  type DefaultExecutor (line 15) | pub type DefaultExecutor = fixed_chunk_executor::FixedChunkRunner;

FILE: src/executor/parallel_compute/collect_arbitrary.rs
  function m (line 11) | pub fn m<C, I, O, M1, P>(
  function x (line 42) | pub fn x<C, I, Vo, X1, P>(

FILE: src/executor/parallel_compute/collect_ordered.rs
  function m (line 10) | pub fn m<C, I, O, M1, P>(
  function x (line 36) | pub fn x<C, I, Vo, X1, P>(

FILE: src/executor/parallel_compute/next.rs
  function m (line 8) | pub fn m<C, I, O, M1>(
  type ResultNext (line 36) | type ResultNext<Vo> = Result<
  function x (line 41) | pub fn x<C, I, Vo, X1>(

FILE: src/executor/parallel_compute/next_any.rs
  function m (line 8) | pub fn m<C, I, O, M1>(
  type ResultNextAny (line 32) | type ResultNextAny<Vo> =
  function x (line 35) | pub fn x<C, I, Vo, X1>(

FILE: src/executor/parallel_compute/reduce.rs
  function m (line 8) | pub fn m<C, I, O, M1, Red>(
  type ResultReduce (line 35) | type ResultReduce<Vo> =
  function x (line 38) | pub fn x<C, I, Vo, X1, Red>(

FILE: src/executor/parallel_executor.rs
  type ParallelExecutor (line 12) | pub trait ParallelExecutor: Sized + Sync + 'static + Clone {
    method new (line 21) | fn new(
    method new_shared_state (line 29) | fn new_shared_state(&self) -> Self::SharedState;
    method do_spawn_new (line 35) | fn do_spawn_new<I>(
    method new_thread_executor (line 46) | fn new_thread_executor(
    method complete_task (line 53) | fn complete_task(self, shared_state: Self::SharedState);

FILE: src/executor/thread_compute/collect_arbitrary.rs
  function m (line 11) | pub fn m<C, I, O, M1, P>(
  function x (line 65) | pub fn x<C, I, Vo, X1, P>(

FILE: src/executor/thread_compute/collect_ordered.rs
  function m (line 9) | pub fn m<C, I, O, M1, P>(
  function x (line 64) | pub fn x<C, I, Vo, X1>(

FILE: src/executor/thread_compute/next.rs
  function m (line 8) | pub fn m<C, I, O, M1>(
  function x (line 73) | pub fn x<C, I, Vo, X1>(

FILE: src/executor/thread_compute/next_any.rs
  function m (line 8) | pub fn m<C, I, O, M1>(
  function x (line 74) | pub fn x<C, I, Vo, X1>(

FILE: src/executor/thread_compute/reduce.rs
  function m (line 12) | pub fn m<C, I, O, M1, Red>(
  function x (line 84) | pub fn x<C, I, Vo, X1, Red>(

FILE: src/executor/thread_executor.rs
  type ThreadExecutor (line 5) | pub trait ThreadExecutor: Sized {
    method next_chunk_size (line 11) | fn next_chunk_size<I>(&self, shared_state: &Self::SharedState, iter: &...
    method begin_chunk (line 16) | fn begin_chunk(&mut self, chunk_size: usize);
    method complete_chunk (line 21) | fn complete_chunk(&mut self, shared_state: &Self::SharedState, chunk_s...
    method complete_task (line 26) | fn complete_task(&mut self, shared_state: &Self::SharedState);

FILE: src/experiment/algorithms/merge_sorted_slices/par.rs
  type PivotSearch (line 11) | pub enum PivotSearch {
  type ParamsParMergeSortedSlices (line 20) | pub struct ParamsParMergeSortedSlices {
  type Task (line 36) | struct Task<'a, T> {
  function clone (line 54) | unsafe fn clone(&self) -> Self {
  function par_merge (line 67) | pub fn par_merge<'a, T, F, R: ParallelRunner>(
  function handle_extend (line 106) | unsafe fn handle_extend<'a, T, F>(

FILE: src/experiment/algorithms/merge_sorted_slices/seq.rs
  function bin_search_idx (line 4) | pub(super) fn bin_search_idx(idx: Result<usize, usize>) -> usize {
  type StreakSearch (line 23) | pub enum StreakSearch {
  type ParamsSeqMergeSortedSlices (line 34) | pub struct ParamsSeqMergeSortedSlices {
  function seq_merge (line 46) | pub fn seq_merge<'a, T: 'a, F>(
  function seq_merge_unchecked (line 68) | pub unsafe fn seq_merge_unchecked<'a, T: 'a, F>(
  function seq_merge_streak_none (line 97) | unsafe fn seq_merge_streak_none<'a, T: 'a, F>(
  function seq_merge_streak_linear (line 163) | unsafe fn seq_merge_streak_linear<'a, T: 'a, F>(
  function seq_merge_streak_binary (line 237) | unsafe fn seq_merge_streak_binary<'a, T: 'a, F>(

FILE: src/experiment/algorithms/merge_sorted_slices/tests/inputs.rs
  type SortKind (line 7) | pub enum SortKind {
  function sorted_slices (line 13) | pub fn sorted_slices(

FILE: src/experiment/algorithms/merge_sorted_slices/tests/par.rs
  function runner (line 15) | fn runner() -> RunnerWithPool<DefaultPool> {
  constant PARAMS (line 19) | const PARAMS: &[ParamsSeqMergeSortedSlices] = &[
  function merge_sorted_slices_par (line 53) | fn merge_sorted_slices_par(
  function merge_sorted_slices_par_single_thread (line 75) | fn merge_sorted_slices_par_single_thread((left_len, total_len): (usize, ...
  function merge_sorted_slices_par_large (line 94) | fn merge_sorted_slices_par_large(len: usize, num_threads: usize, chunk_s...
  function run (line 110) | fn run((left_len, total_len): (usize, usize), sort: SortKind, params: Pa...

FILE: src/experiment/algorithms/merge_sorted_slices/tests/seq.rs
  constant PARAMS (line 11) | const PARAMS: &[ParamsSeqMergeSortedSlices] = &[
  function merge_sorted_slices_seq (line 43) | fn merge_sorted_slices_seq(

FILE: src/experiment/data_structures/slice.rs
  type Slice (line 4) | pub struct Slice<'a, T: 'a> {
  method clone (line 10) | fn clone(&self) -> Self {
  function from (line 19) | fn from(value: &[T]) -> Self {
  function new (line 27) | pub fn new(data: *const T, len: usize) -> Self {
  function destruct (line 35) | pub fn destruct(self) -> *const [T] {
  function split_at_unchecked (line 47) | pub unsafe fn split_at_unchecked(self, position: usize) -> [Self; 2] {
  function data (line 58) | pub(super) fn data(&self) -> *const T {
  function len (line 64) | pub fn len(&self) -> usize {
  function is_empty (line 69) | pub fn is_empty(&self) -> bool {
  function first_unchecked (line 80) | pub unsafe fn first_unchecked(&self) -> &'a T {
  function copy_from_nonoverlapping (line 88) | pub unsafe fn copy_from_nonoverlapping(&self, src: &Self) {
  function as_slice (line 100) | pub unsafe fn as_slice(&self) -> &'a [T] {
  type SliceSafe (line 107) | pub struct SliceSafe<'c, 'a, T: 'a>(&'c Slice<'a, T>);
  function new (line 111) | pub fn new(slice: &'c Slice<'a, T>) -> Self {
  function from (line 117) | fn from(value: &'c Slice<'a, T>) -> Self {
  function is_non_overlapping (line 124) | pub fn is_non_overlapping(&self, other: &Self) -> bool {

FILE: src/experiment/data_structures/slice_dst.rs
  type SliceDst (line 14) | pub struct SliceDst<'a, T>(Slice<'a, T>);
  function destruct (line 19) | pub fn destruct(self) -> *const [T] {
  function clone (line 32) | pub unsafe fn clone(&self) -> Self {
  function new (line 41) | pub unsafe fn new(data: *const T, len: usize) -> Self {
  function from_vec (line 54) | pub fn from_vec(vec: &'a mut Vec<T>) -> Self {
  function len (line 64) | pub fn len(&self) -> usize {
  function core (line 70) | pub fn core(&self) -> SliceSafe<'_, 'a, T> {
  function into_ptr_iter (line 75) | pub fn into_ptr_iter(self) -> SliceIterPtrDst<'a, T> {
  function split_at_unchecked (line 87) | pub unsafe fn split_at_unchecked(self, position: usize) -> [Self; 2] {
  function from (line 94) | fn from(value: &'c SliceDst<'a, T>) -> Self {

FILE: src/experiment/data_structures/slice_iter_ptr.rs
  type SliceIterPtr (line 4) | pub struct SliceIterPtr<'a, T: 'a> {
  method default (line 11) | fn default() -> Self {
  function new (line 26) | pub unsafe fn new(ptr: *const T, n: usize) -> Self {
  function is_finished (line 37) | pub fn is_finished(&self) -> bool {
  function remaining (line 44) | fn remaining(&self) -> usize {
  function peek (line 52) | pub fn peek(&self) -> *const T {
  function current (line 66) | pub unsafe fn current(&self) -> Option<&'a T> {
  function current_unchecked (line 83) | pub unsafe fn current_unchecked(&self) -> &'a T {
  function next_unchecked (line 98) | pub unsafe fn next_unchecked(&mut self) -> *const T {
  function next_n_unchecked (line 111) | pub unsafe fn next_n_unchecked(&mut self, count: usize) -> *const T {
  function jump_to_end (line 120) | pub fn jump_to_end(&mut self) {
  type Item (line 126) | type Item = *const T;
  method next (line 129) | fn next(&mut self) -> Option<Self::Item> {
  method size_hint (line 137) | fn size_hint(&self) -> (usize, Option<usize>) {
  method len (line 144) | fn len(&self) -> usize {

FILE: src/experiment/data_structures/slice_iter_ptr_dst.rs
  type SliceIterPtrDst (line 8) | pub struct SliceIterPtrDst<'a, T: 'a>(SliceIterPtr<'a, T>);
  method default (line 11) | fn default() -> Self {
  function new (line 21) | pub fn new(slice: SliceDst<'a, T>) -> Self {
  function is_finished (line 29) | pub fn is_finished(&self) -> bool {
  function len (line 36) | pub fn len(&self) -> usize {
  function write_one_from (line 50) | pub unsafe fn write_one_from(&mut self, src: &mut SliceIterPtrSrc<'a, T>) {
  function write_many_from (line 73) | pub unsafe fn write_many_from(&mut self, src: &mut SliceIterPtrSrc<'a, T...
  function write_rest_from (line 95) | pub unsafe fn write_rest_from(&mut self, src: &mut SliceIterPtrSrc<'a, T...

FILE: src/experiment/data_structures/slice_iter_ptr_src.rs
  type SliceIterPtrSrc (line 11) | pub struct SliceIterPtrSrc<'a, T: 'a>(SliceIterPtr<'a, T>);
  method default (line 14) | fn default() -> Self {
  function new (line 24) | pub fn new(slice: SliceSrc<'a, T>) -> Self {
  function is_finished (line 32) | pub fn is_finished(&self) -> bool {
  function current (line 39) | pub fn current(&self) -> Option<&'a T> {
  function next_unchecked (line 52) | pub unsafe fn next_unchecked(&mut self) -> *const T {
  function next_n_unchecked (line 63) | pub unsafe fn next_n_unchecked(&mut self, count: usize) -> *const T {
  function jump_to_end (line 69) | pub(super) fn jump_to_end(&mut self) {
  function values (line 75) | pub fn values(&self) -> core::slice::Iter<'a, T> {
  function as_slice (line 81) | pub fn as_slice(&self) -> &'a [T] {
  type Item (line 90) | type Item = *const T;
  method next (line 95) | fn next(&mut self) -> Option<Self::Item> {
  method size_hint (line 100) | fn size_hint(&self) -> (usize, Option<usize>) {
  method len (line 108) | fn len(&self) -> usize {

FILE: src/experiment/data_structures/slice_src.rs
  type SliceSrc (line 15) | pub struct SliceSrc<'a, T>(Slice<'a, T>);
  method clone (line 18) | fn clone(&self) -> Self {
  function destruct (line 26) | pub fn destruct(self) -> *const [T] {
  function from_slice (line 37) | pub fn from_slice(slice: &'a [T]) -> Self {
  function len (line 44) | pub fn len(&self) -> usize {
  function core (line 50) | pub fn core(&self) -> SliceSafe<'_, 'a, T> {
  function first_unchecked (line 60) | pub unsafe fn first_unchecked(&self) -> &'a T {
  function into_ptr_iter (line 67) | pub fn into_ptr_iter(self) -> SliceIterPtrSrc<'a, T> {
  function split_at_unchecked (line 79) | pub unsafe fn split_at_unchecked(self, position: usize) -> [Self; 2] {
  function as_slice (line 85) | pub fn as_slice(&self) -> &[T] {
  function values (line 92) | pub fn values(&'a self) -> core::slice::Iter<'a, T> {
  function from (line 98) | fn from(value: &'c SliceSrc<'a, T>) -> Self {

FILE: src/experiment/data_structures/tests/slice.rs
  function slice_overlap (line 7) | fn slice_overlap() {
  function slice_split_unchecked (line 36) | fn slice_split_unchecked(len: usize) {
  function slice_first_unchecked (line 54) | fn slice_first_unchecked(len: usize) {

FILE: src/generic_iterator/collect.rs
  function collect_vec (line 17) | pub fn collect_vec(self) -> Vec<T> {

FILE: src/generic_iterator/early_exit.rs
  function find (line 16) | pub fn find<Predicate>(self, predicate: Predicate) -> Option<T>
  function find_any (line 32) | pub fn find_any<Predicate>(self, predicate: Predicate) -> Option<T>

FILE: src/generic_iterator/iter.rs
  type GenericIterator (line 11) | pub enum GenericIterator<T, S, R, O>
  function sequential (line 32) | pub fn sequential(iter: S) -> Self {
  function rayon (line 43) | pub fn rayon(iter: R) -> Self {
  function orx (line 54) | pub fn orx(iter: O) -> Self {

FILE: src/generic_iterator/reduce.rs
  function reduce (line 17) | pub fn reduce<Reduce>(self, reduce: Reduce) -> Option<T>
  function count (line 33) | pub fn count(self) -> usize {
  function for_each (line 46) | pub fn for_each<Operation>(self, operation: Operation)
  function max (line 62) | pub fn max(self) -> Option<T>
  function max_by (line 78) | pub fn max_by<Compare>(self, compare: Compare) -> Option<T>
  function max_by_key (line 94) | pub fn max_by_key<Key, GetKey>(self, key: GetKey) -> Option<T>
  function min (line 111) | pub fn min(self) -> Option<T>
  function min_by (line 127) | pub fn min_by<Compare>(self, compare: Compare) -> Option<T>
  function min_by_key (line 143) | pub fn min_by_key<Key, GetKey>(self, key: GetKey) -> Option<T>
  function sum (line 160) | pub fn sum(self) -> T

FILE: src/generic_iterator/transformations.rs
  function map (line 18) | pub fn map<Out, Map>(
  function filter (line 43) | pub fn filter<Filter>(
  function flat_map (line 67) | pub fn flat_map<IOut, FlatMap>(
  function filter_map (line 97) | pub fn filter_map<Out, FilterMap>(
  function inspect (line 122) | pub fn inspect<Operation>(
  function flatten (line 148) | pub fn flatten(
  function copied (line 185) | pub fn copied(
  function cloned (line 208) | pub fn cloned(

FILE: src/generic_values/fallible_iterators/result_of_iter.rs
  type ResultOfIter (line 1) | pub struct ResultOfIter<I, E>
  function ok (line 13) | pub fn ok(iter: I) -> Self {
  function err (line 20) | pub fn err(error: E) -> Self {
  type Item (line 32) | type Item = Result<I::Item, E>;
  method next (line 35) | fn next(&mut self) -> Option<Self::Item> {

FILE: src/generic_values/option.rs
  type Item (line 15) | type Item = T;
  type Fallibility (line 17) | type Fallibility = Infallible;
  method push_to_pinned_vec (line 20) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 31) | fn push_to_vec_with_idx(
  method push_to_bag (line 43) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 55) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 70) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 84) | fn next(self) -> Next<Self> {
  method map (line 91) | fn map<M, O>(
  method filter (line 102) | fn filter<F>(
  method flat_map (line 113) | fn flat_map<Fm, Vo>(
  method filter_map (line 125) | fn filter_map<Fm, O>(
  method whilst (line 138) | fn whilst(
  method map_while_ok (line 154) | fn map_while_ok<Mr, O, E>(self, map_res: Mr) -> impl Values<Item = O, Fa...
  method u_map (line 164) | fn u_map<U, M, O>(
  method u_filter (line 176) | fn u_filter<U, F>(
  method u_flat_map (line 187) | fn u_flat_map<U, Fm, Vo>(
  method u_filter_map (line 199) | fn u_filter_map<U, Fm, O>(

FILE: src/generic_values/option_result.rs
  type OptionResult (line 9) | pub struct OptionResult<T, E>(pub(crate) Option<Result<T, E>>)
  type Item (line 17) | type Item = T;
  type Fallibility (line 19) | type Fallibility = Fallible<E>;
  method push_to_pinned_vec (line 21) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 35) | fn push_to_vec_with_idx(
  method push_to_bag (line 50) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 65) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 81) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 97) | fn next(self) -> Next<Self> {

FILE: src/generic_values/result.rs
  type Item (line 19) | type Item = T;
  type Fallibility (line 21) | type Fallibility = Fallible<E>;
  method push_to_pinned_vec (line 23) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 36) | fn push_to_vec_with_idx(
  method push_to_bag (line 50) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 64) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 79) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 94) | fn next(self) -> Next<Self> {

FILE: src/generic_values/runner_results/collect_arbitrary.rs
  type ArbitraryPush (line 4) | pub enum ArbitraryPush<F: Fallibility> {
  type ThreadCollectArbitrary (line 10) | pub enum ThreadCollectArbitrary<F>
  function into_result (line 20) | pub fn into_result(self) -> Result<(), F::Error> {
  function fmt (line 29) | fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
  type ParallelCollectArbitrary (line 38) | pub enum ParallelCollectArbitrary<V, P>
  function fmt (line 57) | fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
  function into_result (line 73) | pub fn into_result(self) -> Result<P, <V::Fallibility as Fallibility>::E...

FILE: src/generic_values/runner_results/collect_ordered.rs
  type OrderedPush (line 9) | pub enum OrderedPush<F: Fallibility> {
  type ThreadCollect (line 15) | pub enum ThreadCollect<V>
  method fmt (line 32) | fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
  function into_result (line 49) | pub fn into_result(self) -> Result<Self, <V::Fallibility as Fallibility>...
  type ParallelCollect (line 57) | pub enum ParallelCollect<V, P>
  function fmt (line 79) | fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
  function reduce (line 103) | pub fn reduce(results: Vec<ThreadCollect<V>>, mut pinned_vec: P) -> Self {
  function into_result (line 132) | pub fn into_result(self) -> Result<P, <V::Fallibility as Fallibility>::E...

FILE: src/generic_values/runner_results/collect_sequential.rs
  type SequentialPush (line 5) | pub enum SequentialPush<F: Fallibility> {
  function sequential_push_to_stop (line 12) | pub fn sequential_push_to_stop(self) -> Option<Stop<Never>> {
  function sequential_push_to_stop (line 21) | pub fn sequential_push_to_stop(self) -> Option<Stop<E>> {

FILE: src/generic_values/runner_results/fallibility.rs
  type Fallibility (line 10) | pub trait Fallibility: Sized {
    method ordered_push_to_stop (line 13) | fn ordered_push_to_stop(ordered_push: OrderedPush<Self>) -> Option<Sto...
    method arbitrary_push_to_stop (line 15) | fn arbitrary_push_to_stop(arbitrary_push: ArbitraryPush<Self>) -> Opti...
    method sequential_push_to_stop (line 17) | fn sequential_push_to_stop(sequential_push: SequentialPush<Self>) -> O...
    method reduce_to_stop (line 19) | fn reduce_to_stop<V>(reduce: Reduce<V>) -> Result<Option<V::Item>, Sto...
    method reduce_results (line 23) | fn reduce_results<T>(results: Vec<Result<T, Self::Error>>) -> Result<V...
    type Error (line 29) | type Error = Never;
    method ordered_push_to_stop (line 32) | fn ordered_push_to_stop(ordered_push: OrderedPush<Self>) -> Option<Sto...
    method arbitrary_push_to_stop (line 40) | fn arbitrary_push_to_stop(arbitrary_push: ArbitraryPush<Self>) -> Opti...
    method sequential_push_to_stop (line 48) | fn sequential_push_to_stop(sequential_push: SequentialPush<Self>) -> O...
    method reduce_to_stop (line 56) | fn reduce_to_stop<V>(reduce: Reduce<V>) -> Result<Option<V::Item>, Sto...
    method reduce_results (line 66) | fn reduce_results<T>(results: Vec<Result<T, Self::Error>>) -> Result<V...
    type Error (line 79) | type Error = E;
    method ordered_push_to_stop (line 82) | fn ordered_push_to_stop(ordered_push: OrderedPush<Self>) -> Option<Sto...
    method arbitrary_push_to_stop (line 93) | fn arbitrary_push_to_stop(arbitrary_push: ArbitraryPush<Self>) -> Opti...
    method sequential_push_to_stop (line 102) | fn sequential_push_to_stop(sequential_push: SequentialPush<Self>) -> O...
    method reduce_to_stop (line 111) | fn reduce_to_stop<V>(reduce: Reduce<V>) -> Result<Option<V::Item>, Sto...
    method reduce_results (line 122) | fn reduce_results<T>(results: Vec<Result<T, Self::Error>>) -> Result<V...
  type Infallible (line 26) | pub struct Infallible;
  type Fallible (line 76) | pub struct Fallible<E>(PhantomData<E>);
  type Never (line 134) | pub enum Never {}

FILE: src/generic_values/runner_results/next.rs
  type Next (line 3) | pub enum Next<V: Values> {
  type NextWithIdx (line 13) | pub enum NextWithIdx<V: Values> {
  type NextSuccess (line 27) | pub enum NextSuccess<T> {
  function reduce (line 33) | pub fn reduce(results: impl IntoIterator<Item = Self>) -> Option<(usize,...

FILE: src/generic_values/runner_results/reduce.rs
  type Reduce (line 3) | pub enum Reduce<V: Values> {
  function into_result (line 16) | pub fn into_result(self) -> Result<Option<V::Item>, <V::Fallibility as F...
  function fmt (line 26) | fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {

FILE: src/generic_values/runner_results/stop.rs
  type Stop (line 3) | pub enum Stop<E> {
  type StopWithIdx (line 8) | pub enum StopWithIdx<E> {
  type StopReduce (line 13) | pub enum StopReduce<V: Values> {

FILE: src/generic_values/transformable_values.rs
  type TransformableValues (line 3) | pub trait TransformableValues: Values {
    method map (line 4) | fn map<M, O>(
    method filter (line 11) | fn filter<F>(
    method flat_map (line 18) | fn flat_map<Fm, Vo>(
    method filter_map (line 26) | fn filter_map<Fm, O>(
    method whilst (line 33) | fn whilst(
    method map_while_ok (line 38) | fn map_while_ok<Mr, O, E>(
    method u_map (line 46) | fn u_map<U, M, O>(
    method u_filter (line 54) | fn u_filter<U, F>(
    method u_flat_map (line 62) | fn u_flat_map<U, Fm, Vo>(
    method u_filter_map (line 71) | fn u_filter_map<U, Fm, O>(

FILE: src/generic_values/values.rs
  type Values (line 10) | pub trait Values: Sized {
    method push_to_pinned_vec (line 15) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self:...
    method push_to_vec_with_idx (line 19) | fn push_to_vec_with_idx(
    method push_to_bag (line 25) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitra...
    method acc_reduce (line 30) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<S...
    method u_acc_reduce (line 34) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce...
    method next (line 38) | fn next(self) -> Next<Self>;
    method ordered_push_to_stop (line 43) | fn ordered_push_to_stop(
    method arbitrary_push_to_stop (line 50) | fn arbitrary_push_to_stop(
    method sequential_push_to_stop (line 57) | fn sequential_push_to_stop(
    method reduce_to_stop (line 64) | fn reduce_to_stop(reduce: Reduce<Self>) -> Result<Option<Self::Item>, ...

FILE: src/generic_values/vector.rs
  type Vector (line 13) | pub struct Vector<I>(pub I)
  type Item (line 21) | type Item = I::Item;
  type Fallibility (line 23) | type Fallibility = Infallible;
  method push_to_pinned_vec (line 26) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 37) | fn push_to_vec_with_idx(
  method push_to_bag (line 49) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 61) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 77) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 93) | fn next(self) -> Next<Self> {
  method map (line 105) | fn map<M, O>(
  method filter (line 116) | fn filter<F>(
  method flat_map (line 127) | fn flat_map<Fm, Vo>(
  method filter_map (line 139) | fn filter_map<Fm, O>(
  method whilst (line 149) | fn whilst(
  method map_while_ok (line 163) | fn map_while_ok<Mr, O, E>(self, map_res: Mr) -> impl Values<Item = O, Fa...
  method u_map (line 172) | fn u_map<U, M, O>(
  method u_filter (line 183) | fn u_filter<U, F>(
  method u_flat_map (line 194) | fn u_flat_map<U, Fm, Vo>(
  method u_filter_map (line 206) | fn u_filter_map<U, Fm, O>(

FILE: src/generic_values/vector_result.rs
  type VectorResult (line 10) | pub struct VectorResult<I, T, E>(pub(crate) I)
  type Item (line 20) | type Item = T;
  type Fallibility (line 22) | type Fallibility = Fallible<E>;
  method push_to_pinned_vec (line 24) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 37) | fn push_to_vec_with_idx(
  method push_to_bag (line 51) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 65) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 95) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 125) | fn next(self) -> Next<Self> {

FILE: src/generic_values/whilst_atom.rs
  type WhilstAtom (line 11) | pub enum WhilstAtom<T> {
  function new (line 18) | pub fn new(value: T, whilst: impl Fn(&T) -> bool) -> Self {
  type Item (line 27) | type Item = T;
  type Fallibility (line 29) | type Fallibility = Infallible;
  method push_to_pinned_vec (line 31) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 44) | fn push_to_vec_with_idx(
  method push_to_bag (line 58) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 72) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 87) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 102) | fn next(self) -> Next<Self> {
  method map (line 111) | fn map<M, O>(
  method filter (line 124) | fn filter<F>(
  method flat_map (line 140) | fn flat_map<Fm, Vo>(
  method filter_map (line 152) | fn filter_map<Fm, O>(
  method whilst (line 168) | fn whilst(
  method map_while_ok (line 184) | fn map_while_ok<Mr, O, E>(self, map_res: Mr) -> impl Values<Item = O, Fa...
  method u_map (line 198) | fn u_map<U, M, O>(
  method u_filter (line 212) | fn u_filter<U, F>(
  method u_flat_map (line 229) | fn u_flat_map<U, Fm, Vo>(
  method u_filter_map (line 242) | fn u_filter_map<U, Fm, O>(

FILE: src/generic_values/whilst_atom_result.rs
  type WhilstAtomResult (line 9) | pub enum WhilstAtomResult<T, E>
  type Item (line 22) | type Item = T;
  type Fallibility (line 24) | type Fallibility = Fallible<E>;
  method push_to_pinned_vec (line 26) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 40) | fn push_to_vec_with_idx(
  method push_to_bag (line 55) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 70) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 86) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 102) | fn next(self) -> Next<Self> {

FILE: src/generic_values/whilst_iterators/whilst_atom_flat_map.rs
  type WhilstAtomFlatMapIter (line 3) | pub struct WhilstAtomFlatMapIter<Vo>
  function from_atom (line 14) | pub fn from_atom<T, Fm>(atom: WhilstAtom<T>, flat_map: Fm) -> Self
  function u_from_atom (line 25) | pub fn u_from_atom<U, T, Fm>(u: *mut U, atom: WhilstAtom<T>, flat_map: F...
  type Item (line 41) | type Item = WhilstAtom<Vo::Item>;
  method next (line 43) | fn next(&mut self) -> Option<Self::Item> {

FILE: src/generic_values/whilst_iterators/whilst_option_flat_map.rs
  type WhilstOptionFlatMapIter (line 3) | pub struct WhilstOptionFlatMapIter<Vo>
  function from_option (line 14) | pub fn from_option<T, Fm>(atom: WhilstOption<T>, flat_map: Fm) -> Self
  function u_from_option (line 26) | pub fn u_from_option<U, T, Fm>(u: *mut U, atom: WhilstOption<T>, flat_ma...
  type Item (line 43) | type Item = WhilstAtom<Vo::Item>;
  method next (line 45) | fn next(&mut self) -> Option<Self::Item> {

FILE: src/generic_values/whilst_option.rs
  type WhilstOption (line 11) | pub enum WhilstOption<T> {
  type Item (line 18) | type Item = T;
  type Fallibility (line 20) | type Fallibility = Infallible;
  method push_to_pinned_vec (line 22) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 36) | fn push_to_vec_with_idx(
  method push_to_bag (line 51) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 66) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 82) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 98) | fn next(self) -> Next<Self> {
  method map (line 108) | fn map<M, O>(
  method filter (line 122) | fn filter<F>(
  method flat_map (line 139) | fn flat_map<Fm, Vo>(
  method filter_map (line 151) | fn filter_map<Fm, O>(
  method whilst (line 168) | fn whilst(
  method map_while_ok (line 185) | fn map_while_ok<Mr, O, E>(self, map_res: Mr) -> impl Values<Item = O, Fa...
  method u_map (line 200) | fn u_map<U, M, O>(
  method u_filter (line 215) | fn u_filter<U, F>(
  method u_flat_map (line 233) | fn u_flat_map<U, Fm, Vo>(
  method u_filter_map (line 246) | fn u_filter_map<U, Fm, O>(

FILE: src/generic_values/whilst_option_result.rs
  type WhilstOptionResult (line 9) | pub enum WhilstOptionResult<T, E>
  type Item (line 23) | type Item = T;
  type Fallibility (line 25) | type Fallibility = Fallible<E>;
  method push_to_pinned_vec (line 27) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 42) | fn push_to_vec_with_idx(
  method push_to_bag (line 58) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 74) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 91) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 108) | fn next(self) -> Next<Self> {

FILE: src/generic_values/whilst_vector.rs
  type WhilstVector (line 15) | pub struct WhilstVector<I, T>(pub(crate) I)
  type Item (line 23) | type Item = T;
  type Fallibility (line 25) | type Fallibility = Infallible;
  method push_to_pinned_vec (line 27) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 40) | fn push_to_vec_with_idx(
  method push_to_bag (line 54) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 68) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 98) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 128) | fn next(self) -> Next<Self> {
  method map (line 143) | fn map<M, O>(
  method filter (line 157) | fn filter<F>(
  method flat_map (line 174) | fn flat_map<Fm, Vo>(
  method filter_map (line 189) | fn filter_map<Fm, O>(
  method whilst (line 203) | fn whilst(
  method map_while_ok (line 220) | fn map_while_ok<Mr, O, E>(self, map_res: Mr) -> impl Values<Item = O, Fa...
  method u_map (line 232) | fn u_map<U, M, O>(
  method u_filter (line 247) | fn u_filter<U, F>(
  method u_flat_map (line 265) | fn u_flat_map<U, Fm, Vo>(
  method u_filter_map (line 281) | fn u_filter_map<U, Fm, O>(

FILE: src/generic_values/whilst_vector_result.rs
  type WhilstVectorResult (line 10) | pub struct WhilstVectorResult<I, T, E>(pub(crate) I)
  type Item (line 20) | type Item = T;
  type Fallibility (line 22) | type Fallibility = Fallible<E>;
  method push_to_pinned_vec (line 24) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 40) | fn push_to_vec_with_idx(
  method push_to_bag (line 57) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 72) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 106) | fn u_acc_reduce<U, X>(self, u: *mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 140) | fn next(self) -> Next<Self> {

FILE: src/heap_sort.rs
  function heap_sort_into (line 6) | pub fn heap_sort_into<T, P>(

FILE: src/into_par_iter.rs
  type IntoParIter (line 28) | pub trait IntoParIter: IntoConcurrentIter {
    method into_par (line 50) | fn into_par(self) -> Par<Self::IntoIter, DefaultRunner>;
    method into_par (line 57) | fn into_par(self) -> Par<Self::IntoIter, DefaultRunner> {
  type Item (line 63) | type Item = I::Item;
  type IntoIter (line 65) | type IntoIter = I;
  method into_con_iter (line 67) | fn into_con_iter(self) -> Self::IntoIter {

FILE: src/iter/recursive/into_par_rec_iter.rs
  type IntoParIterRec (line 19) | pub trait IntoParIterRec
    method into_par_rec (line 214) | fn into_par_rec<E>(
    method into_par_rec_exact (line 411) | fn into_par_rec_exact<E>(
    method into_par_rec (line 425) | fn into_par_rec<E>(
    method into_par_rec_exact (line 436) | fn into_par_rec_exact<E>(

FILE: src/iter/recursive/rec_par_iter.rs
  type Rec (line 10) | type Rec<T, E> = ConcurrentRecursiveIter<T, E>;
  function linearize (line 31) | pub fn linearize(self) -> Par<ConIterVec<T>, R> {
  function linearize (line 60) | pub fn linearize(self) -> ParMap<ConIterVec<T>, O, M1, R> {
  function linearize (line 90) | pub fn linearize(self) -> ParXap<ConIterVec<T>, Vo, X1, R> {

FILE: src/iter/special_iterators.rs
  type ParEmpty (line 5) | pub type ParEmpty<T, R = DefaultRunner> = Par<ConIterEmpty<T>, R>;
  function empty (line 8) | pub fn empty<T: Send + Sync>() -> ParEmpty<T> {

FILE: src/iter_into_par_iter.rs
  type IterIntoParIter (line 61) | pub trait IterIntoParIter: Iterator {
    method iter_into_par (line 119) | fn iter_into_par(self) -> Par<ConIterOfIter<Self>, DefaultRunner>
    method iter_into_par (line 130) | fn iter_into_par(self) -> Par<ConIterOfIter<Self>, DefaultRunner> {

FILE: src/par_iter.rs
  type ParIter (line 18) | pub trait ParIter<R = DefaultRunner>: Sized + Send + Sync
    method con_iter (line 26) | fn con_iter(&self) -> &impl ConcurrentIter;
    method params (line 79) | fn params(&self) -> Params;
    method num_threads (line 147) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self;
    method chunk_size (line 214) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self;
    method iteration_order (line 248) | fn iteration_order(self, order: IterationOrder) -> Self;
    method with_runner (line 312) | fn with_runner<Q: ParallelRunner>(self, runner: Q) -> impl ParIter<Q, ...
    method with_pool (line 382) | fn with_pool<P: ParThreadPool>(
    method using (line 603) | fn using<'using, U, F>(
    method using_clone (line 624) | fn using_clone<U>(
    method into_fallible_result (line 673) | fn into_fallible_result<T, E>(self) -> impl ParIterResult<R, Item = T,...
    method into_fallible_option (line 717) | fn into_fallible_option<T>(self) -> impl ParIterOption<R, Item = T>
    method map (line 743) | fn map<Out, Map>(self, map: Map) -> impl ParIter<R, Item = Out>
    method filter (line 761) | fn filter<Filter>(self, filter: Filter) -> impl ParIter<R, Item = Self...
    method flat_map (line 780) | fn flat_map<IOut, FlatMap>(self, flat_map: FlatMap) -> impl ParIter<R,...
    method filter_map (line 806) | fn filter_map<Out, FilterMap>(self, filter_map: FilterMap) -> impl Par...
    method inspect (line 867) | fn inspect<Operation>(self, operation: Operation) -> impl ParIter<R, I...
    method take_while (line 902) | fn take_while<While>(self, take_while: While) -> impl ParIter<R, Item ...
    method map_while (line 930) | fn map_while<Out, MapWhile>(self, map_while: MapWhile) -> impl ParIter...
    method copied (line 959) | fn copied<'a, T>(self) -> impl ParIter<R, Item = T>
    method cloned (line 990) | fn cloned<'a, T>(self) -> impl ParIter<R, Item = T>
    method flatten (line 1041) | fn flatten(self) -> impl ParIter<R, Item = <Self::Item as IntoIterator...
    method collect_into (line 1074) | fn collect_into<C>(self, output: C) -> C
    method collect (line 1098) | fn collect<C>(self) -> C
    method reduce (line 1123) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
    method all (line 1152) | fn all<Predicate>(self, predicate: Predicate) -> bool
    method any (line 1185) | fn any<Predicate>(self, predicate: Predicate) -> bool
    method count (line 1203) | fn count(self) -> usize {
    method for_each (line 1241) | fn for_each<Operation>(self, operation: Operation)
    method max (line 1264) | fn max(self) -> Option<Self::Item>
    method max_by (line 1283) | fn max_by<Compare>(self, compare: Compare) -> Option<Self::Item>
    method max_by_key (line 1307) | fn max_by_key<Key, GetKey>(self, key: GetKey) -> Option<Self::Item>
    method min (line 1335) | fn min(self) -> Option<Self::Item>
    method min_by (line 1354) | fn min_by<Compare>(self, compare: Compare) -> Option<Self::Item>
    method min_by_key (line 1378) | fn min_by_key<Key, GetKey>(self, get_key: GetKey) -> Option<Self::Item>
    method sum (line 1411) | fn sum<Out>(self) -> Out
    method first (line 1467) | fn first(self) -> Option<Self::Item>
    method find (line 1513) | fn find<Predicate>(self, predicate: Predicate) -> Option<Self::Item>

FILE: src/par_iter_option.rs
  type ParIterOption (line 126) | pub trait ParIterOption<R = DefaultRunner>
    method num_threads (line 143) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self;
    method chunk_size (line 154) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self;
    method iteration_order (line 159) | fn iteration_order(self, order: IterationOrder) -> Self;
    method with_runner (line 167) | fn with_runner<Q: ParallelRunner>(
    method with_pool (line 179) | fn with_pool<P: ParThreadPool>(
    method map (line 216) | fn map<Out, Map>(self, map: Map) -> impl ParIterOption<R, Item = Out>
    method filter (line 246) | fn filter<Filter>(self, filter: Filter) -> impl ParIterOption<R, Item ...
    method flat_map (line 286) | fn flat_map<IOut, FlatMap>(self, flat_map: FlatMap) -> impl ParIterOpt...
    method filter_map (line 327) | fn filter_map<Out, FilterMap>(self, filter_map: FilterMap) -> impl Par...
    method inspect (line 407) | fn inspect<Operation>(self, operation: Operation) -> impl ParIterOptio...
    method collect_into (line 454) | fn collect_into<C>(self, output: C) -> Option<C>
    method collect (line 496) | fn collect<C>(self) -> Option<C>
    method reduce (line 539) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Option<Self::Item>>
    method all (line 597) | fn all<Predicate>(self, predicate: Predicate) -> Option<bool>
    method any (line 661) | fn any<Predicate>(self, predicate: Predicate) -> Option<bool>
    method count (line 696) | fn count(self) -> Option<usize>
    method for_each (line 742) | fn for_each<Operation>(self, operation: Operation) -> Option<()>
    method max (line 769) | fn max(self) -> Option<Option<Self::Item>>
    method max_by (line 811) | fn max_by<Compare>(self, compare: Compare) -> Option<Option<Self::Item>>
    method max_by_key (line 860) | fn max_by_key<Key, GetKey>(self, key: GetKey) -> Option<Option<Self::I...
    method min (line 892) | fn min(self) -> Option<Option<Self::Item>>
    method min_by (line 934) | fn min_by<Compare>(self, compare: Compare) -> Option<Option<Self::Item>>
    method min_by_key (line 983) | fn min_by_key<Key, GetKey>(self, get_key: GetKey) -> Option<Option<Sel...
    method sum (line 1031) | fn sum<Out>(self) -> Option<Out>
    method first (line 1076) | fn first(self) -> Option<Option<Self::Item>>
    method find (line 1115) | fn find<Predicate>(self, predicate: Predicate) -> Option<Option<Self::...
  type IntoOption (line 1125) | pub trait IntoOption<T> {
    method into_option (line 1126) | fn into_option(self) -> Option<T>;
    method into_result_with_unit_err (line 1128) | fn into_result_with_unit_err(self) -> Result<T, ()>;
  function into_option (line 1133) | fn into_option(self) -> Option<T> {
  function into_result_with_unit_err (line 1138) | fn into_result_with_unit_err(self) -> Result<T, ()> {
  type ResultIntoOption (line 1146) | pub(crate) trait ResultIntoOption<T> {
    method into_option (line 1147) | fn into_option(self) -> Option<T>;
  function into_option (line 1152) | fn into_option(self) -> Option<T> {

FILE: src/par_iter_result.rs
  type ParIterResult (line 132) | pub trait ParIterResult<R = DefaultRunner>
    method con_iter_len (line 149) | fn con_iter_len(&self) -> Option<usize>;
    method into_regular_par (line 152) | fn into_regular_par(self) -> Self::RegularParIter;
    method from_regular_par (line 155) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self;
    method num_threads (line 167) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self
    method chunk_size (line 183) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self
    method iteration_order (line 193) | fn iteration_order(self, order: IterationOrder) -> Self
    method with_runner (line 206) | fn with_runner<Q: ParallelRunner>(
    method with_pool (line 218) | fn with_pool<P: ParThreadPool>(
    method map (line 255) | fn map<Out, Map>(self, map: Map) -> impl ParIterResult<R, Item = Out, ...
    method filter (line 290) | fn filter<Filter>(
    method flat_map (line 344) | fn flat_map<IOut, FlatMap>(
    method filter_map (line 396) | fn filter_map<Out, FilterMap>(
    method inspect (line 487) | fn inspect<Operation>(
    method collect_into (line 545) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
    method collect (line 588) | fn collect<C>(self) -> Result<C, Self::Err>
    method reduce (line 644) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, ...
    method all (line 703) | fn all<Predicate>(self, predicate: Predicate) -> Result<bool, Self::Err>
    method any (line 768) | fn any<Predicate>(self, predicate: Predicate) -> Result<bool, Self::Err>
    method count (line 804) | fn count(self) -> Result<usize, Self::Err>
    method for_each (line 851) | fn for_each<Operation>(self, operation: Operation) -> Result<(), Self:...
    method max (line 879) | fn max(self) -> Result<Option<Self::Item>, Self::Err>
    method max_by (line 922) | fn max_by<Compare>(self, compare: Compare) -> Result<Option<Self::Item...
    method max_by_key (line 972) | fn max_by_key<Key, GetKey>(self, key: GetKey) -> Result<Option<Self::I...
    method min (line 1005) | fn min(self) -> Result<Option<Self::Item>, Self::Err>
    method min_by (line 1048) | fn min_by<Compare>(self, compare: Compare) -> Result<Option<Self::Item...
    method min_by_key (line 1098) | fn min_by_key<Key, GetKey>(self, get_key: GetKey) -> Result<Option<Sel...
    method sum (line 1154) | fn sum<Out>(self) -> Result<Out, Self::Err>
    method first (line 1197) | fn first(self) -> Result<Option<Self::Item>, Self::Err>
    method find (line 1237) | fn find<Predicate>(self, predicate: Predicate) -> Result<Option<Self::...
  type IntoResult (line 1248) | pub trait IntoResult<T, E> {
    method into_result (line 1249) | fn into_result(self) -> Result<T, E>;
  function into_result (line 1254) | fn into_result(self) -> Result<T, E> {

FILE: src/par_thread_pool.rs
  type ParThreadPool (line 95) | pub trait ParThreadPool {
    method run_in_scope (line 103) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'sco...
    method scoped_computation (line 110) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
    method max_num_threads (line 116) | fn max_num_threads(&self) -> NonZeroUsize;
  type ParThreadPoolCompute (line 121) | pub trait ParThreadPoolCompute: ParThreadPool {
    method map_in_pool (line 122) | fn map_in_pool<F, S, M, T>(
    method run_in_pool (line 156) | fn run_in_pool<S, F>(&mut self, do_spawn: S, thread_do: F) -> NumSpawned

FILE: src/parallel_drainable.rs
  type ParallelDrainableOverSlice (line 25) | pub trait ParallelDrainableOverSlice: ConcurrentDrainableOverSlice {
    method par_drain (line 46) | fn par_drain<R>(

FILE: src/parallelizable.rs
  type Parallelizable (line 35) | pub trait Parallelizable: ConcurrentIterable {
    method par (line 64) | fn par(&self) -> Par<<Self as ConcurrentIterable>::Iter, DefaultRunner> {

FILE: src/parallelizable_collection.rs
  type ParallelizableCollection (line 38) | pub trait ParallelizableCollection: ConcurrentCollection {
    method par (line 74) | fn par(

FILE: src/parallelizable_collection_mut.rs
  type ParallelizableCollectionMut (line 47) | pub trait ParallelizableCollectionMut: ConcurrentCollectionMut + Paralle...
    method par_mut (line 62) | fn par_mut(&mut self) -> impl ParIter<DefaultRunner, Item = &mut Self:...

FILE: src/parameters/chunk_size.rs
  type ChunkSize (line 48) | pub enum ChunkSize {
    method from (line 68) | fn from(value: usize) -> Self {

FILE: src/parameters/iteration_order.rs
  type IterationOrder (line 20) | pub enum IterationOrder {

FILE: src/parameters/num_threads.rs
  type NumThreads (line 22) | pub enum NumThreads {
    method from (line 47) | fn from(value: usize) -> Self {
    method sequential (line 60) | pub const fn sequential() -> Self {
    method is_sequential (line 67) | pub fn is_sequential(self) -> bool {
  constant ONE (line 40) | const ONE: NonZeroUsize = NonZeroUsize::new(1).expect("seq=1 is positive");

FILE: src/parameters/params.rs
  type Params (line 5) | pub struct Params {
    method new (line 23) | pub fn new(
    method is_sequential (line 38) | pub fn is_sequential(self) -> bool {
    method with_num_threads (line 44) | pub(crate) fn with_num_threads(self, num_threads: impl Into<NumThreads...
    method with_chunk_size (line 52) | pub(crate) fn with_chunk_size(self, chunk_size: impl Into<ChunkSize>) ...
    method with_collect_ordering (line 60) | pub(crate) fn with_collect_ordering(self, iteration_order: IterationOr...

FILE: src/runner/computation_kind.rs
  type ComputationKind (line 3) | pub enum ComputationKind {

FILE: src/runner/implementations/pond.rs
  type PondPool (line 13) | pub struct PondPool(Pool, NonZeroUsize);
    method new_threads_unbounded (line 18) | pub fn new_threads_unbounded(num_threads: usize) -> Self {
    method inner (line 26) | pub fn inner(&self) -> &Pool {
    method inner_mut (line 31) | pub fn inner_mut(&mut self) -> &mut Pool {
    method into_inner (line 36) | pub fn into_inner(self) -> Pool {
  type ScopeRef (line 42) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 48) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 57) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 65) | fn max_num_threads(&self) -> NonZeroUsize {
  type ScopeRef (line 71) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 77) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 86) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 94) | fn max_num_threads(&self) -> NonZeroUsize {

FILE: src/runner/implementations/poolite.rs
  type ScopeRef (line 6) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 12) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 21) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 29) | fn max_num_threads(&self) -> NonZeroUsize {
  type ScopeRef (line 35) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 41) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 50) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 58) | fn max_num_threads(&self) -> NonZeroUsize {

FILE: src/runner/implementations/rayon_core.rs
  type ScopeRef (line 6) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 12) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 21) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 29) | fn max_num_threads(&self) -> NonZeroUsize {
  type ScopeRef (line 35) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 41) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 50) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 58) | fn max_num_threads(&self) -> NonZeroUsize {

FILE: src/runner/implementations/runner_with_pool.rs
  type RunnerWithPool (line 106) | pub struct RunnerWithPool<P, R = DefaultExecutor>
  method default (line 120) | fn default() -> Self {
  function from (line 129) | fn from(pool: P) -> Self {
  function into_inner_pool (line 186) | pub fn into_inner_pool(self) -> P {
  function with_executor (line 191) | pub fn with_executor<Q: ParallelExecutor>(self) -> RunnerWithPool<P, Q> {
  function with_diagnostics (line 241) | pub fn with_diagnostics(self) -> RunnerWithPool<P, ParallelExecutorWithD...
  type Executor (line 254) | type Executor = R;
  type ThreadPool (line 256) | type ThreadPool = P;
  method thread_pool (line 258) | fn thread_pool(&self) -> &Self::ThreadPool {
  method thread_pool_mut (line 262) | fn thread_pool_mut(&mut self) -> &mut Self::ThreadPool {

FILE: src/runner/implementations/scoped_pool.rs
  type ScopeRef (line 6) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 12) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 21) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 29) | fn max_num_threads(&self) -> NonZeroUsize {
  type ScopeRef (line 35) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 41) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 50) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 58) | fn max_num_threads(&self) -> core::num::NonZeroUsize {

FILE: src/runner/implementations/scoped_threadpool.rs
  type ScopeRef (line 6) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 12) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 21) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 29) | fn max_num_threads(&self) -> NonZeroUsize {
  type ScopeRef (line 35) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 41) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 50) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 58) | fn max_num_threads(&self) -> NonZeroUsize {

FILE: src/runner/implementations/sequential.rs
  type SequentialPool (line 14) | pub struct SequentialPool;
  type ScopeRef (line 17) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 23) | fn run_in_scope<'s, 'env, 'scope, W>(_: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 32) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 40) | fn max_num_threads(&self) -> NonZeroUsize {

FILE: src/runner/implementations/std_runner.rs
  constant MAX_UNSET_NUM_THREADS (line 4) | const MAX_UNSET_NUM_THREADS: NonZeroUsize = NonZeroUsize::new(8).expect(...
  type StdDefaultPool (line 22) | pub struct StdDefaultPool {
    method with_max_num_threads (line 32) | pub fn with_max_num_threads(max_num_threads: NonZeroUsize) -> Self {
  method default (line 42) | fn default() -> Self {
  type ScopeRef (line 59) | type ScopeRef<'s, 'env, 'scope>
  method max_num_threads (line 65) | fn max_num_threads(&self) -> NonZeroUsize {
  method scoped_computation (line 69) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method run_in_scope (line 77) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  type ScopeRef (line 88) | type ScopeRef<'s, 'env, 'scope>
  method max_num_threads (line 94) | fn max_num_threads(&self) -> NonZeroUsize {
  method scoped_computation (line 98) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method run_in_scope (line 106) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...

FILE: src/runner/implementations/tests/pond.rs
  constant N (line 9) | const N: [usize; 2] = [37, 125];
  constant N (line 11) | const N: [usize; 2] = [1025, 4735];
  function pool_pond_map (line 21) | fn pool_pond_map(n: usize, nt: usize, chunk: usize, ordering: IterationO...

FILE: src/runner/implementations/tests/poolite.rs
  constant N (line 7) | const N: [usize; 2] = [37, 125];
  constant N (line 9) | const N: [usize; 2] = [1025, 4735];
  function pool_poolite_map (line 19) | fn pool_poolite_map(n: usize, nt: usize, chunk: usize, ordering: Iterati...

FILE: src/runner/implementations/tests/rayon_core.rs
  constant N (line 6) | const N: [usize; 2] = [37, 125];
  constant N (line 8) | const N: [usize; 2] = [1025, 4735];
  function pool_rayon_map (line 18) | fn pool_rayon_map(n: usize, nt: usize, chunk: usize, ordering: Iteration...

FILE: src/runner/implementations/tests/scoped_pool.rs
  constant N (line 7) | const N: [usize; 2] = [37, 125];
  constant N (line 9) | const N: [usize; 2] = [1025, 4735];
  function pool_scoped_pool_map (line 19) | fn pool_scoped_pool_map(n: usize, nt: usize, chunk: usize, ordering: Ite...

FILE: src/runner/implementations/tests/scoped_threadpool.rs
  constant N (line 7) | const N: [usize; 2] = [37, 125];
  constant N (line 9) | const N: [usize; 2] = [1025, 4735];
  function pool_scoped_threadpool_map (line 19) | fn pool_scoped_threadpool_map(n: usize, nt: usize, chunk: usize, orderin...

FILE: src/runner/implementations/tests/sequential.rs
  constant N (line 6) | const N: [usize; 2] = [37, 125];
  constant N (line 8) | const N: [usize; 2] = [1025, 4735];
  function pool_scoped_threadpool_map (line 16) | fn pool_scoped_threadpool_map(n: usize, _: usize, chunk: usize, ordering...

FILE: src/runner/implementations/tests/std.rs
  constant N (line 9) | const N: [usize; 2] = [37, 125];
  constant N (line 11) | const N: [usize; 2] = [1025, 4735];
  function pool_scoped_threadpool_map (line 19) | fn pool_scoped_threadpool_map(n: usize, _: usize, chunk: usize, ordering...

FILE: src/runner/implementations/tests/utils.rs
  function run_map (line 8) | pub fn run_map(n: usize, chunk: usize, ordering: IterationOrder, mut orc...

FILE: src/runner/implementations/tests/yastl.rs
  constant N (line 10) | const N: [usize; 2] = [37, 125];
  constant N (line 12) | const N: [usize; 2] = [1025, 4735];
  function pool_yastl_map (line 22) | fn pool_yastl_map(n: usize, nt: usize, chunk: usize, ordering: Iteration...

FILE: src/runner/implementations/yastl.rs
  type YastlPool (line 15) | pub struct YastlPool(Pool, NonZeroUsize);
    method new (line 19) | pub fn new(num_threads: usize) -> Self {
    method with_config (line 28) | pub fn with_config(num_threads: usize, config: ThreadConfig) -> Self {
    method inner (line 36) | pub fn inner(&self) -> &Pool {
    method inner_mut (line 41) | pub fn inner_mut(&mut self) -> &mut Pool {
    method into_inner (line 46) | pub fn into_inner(self) -> Pool {
  type ScopeRef (line 52) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 58) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 67) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 75) | fn max_num_threads(&self) -> NonZeroUsize {
  type ScopeRef (line 81) | type ScopeRef<'s, 'env, 'scope>
  method run_in_scope (line 87) | fn run_in_scope<'s, 'env, 'scope, W>(s: &Self::ScopeRef<'s, 'env, 'scope...
  method scoped_computation (line 96) | fn scoped_computation<'env, 'scope, F>(&'env mut self, f: F)
  method max_num_threads (line 104) | fn max_num_threads(&self) -> NonZeroUsize {

FILE: src/runner/mod.rs
  type DefaultPool (line 29) | pub type DefaultPool = StdDefaultPool;
  type DefaultPool (line 35) | pub type DefaultPool = SequentialPool;
  type DefaultRunner (line 41) | pub type DefaultRunner = RunnerWithPool<DefaultPool>;

FILE: src/runner/num_spawned.rs
  type NumSpawned (line 3) | pub struct NumSpawned(usize);
    method zero (line 7) | pub fn zero() -> Self {
    method increment (line 12) | pub fn increment(&mut self) {
    method into_inner (line 17) | pub fn into_inner(self) -> usize {
    type Output (line 23) | type Output = usize;
    method rem (line 25) | fn rem(self, rhs: Self) -> Self::Output {

FILE: src/runner/parallel_runner.rs
  type ParallelRunner (line 12) | pub trait ParallelRunner {
    method new_executor (line 20) | fn new_executor(
    method thread_pool (line 31) | fn thread_pool(&self) -> &Self::ThreadPool;
    method thread_pool_mut (line 34) | fn thread_pool_mut(&mut self) -> &mut Self::ThreadPool;
    method run_all (line 39) | fn run_all<I, F>(
    method map_all (line 68) | fn map_all<F, I, M, T>(
    method map_infallible (line 105) | fn map_infallible<I, M, T>(
    method max_num_threads_for_computation (line 123) | fn max_num_threads_for_computation(
    type Executor (line 154) | type Executor = O::Executor;
    type ThreadPool (line 156) | type ThreadPool = O::ThreadPool;
    method thread_pool (line 158) | fn thread_pool(&self) -> &Self::ThreadPool {
    method thread_pool_mut (line 162) | fn thread_pool_mut(&mut self) -> &mut Self::ThreadPool {
  type SharedStateOf (line 143) | pub(crate) type SharedStateOf<C> =
  type ThreadRunnerOf (line 145) | pub(crate) type ThreadRunnerOf<C> =

FILE: src/special_type_sets/sum.rs
  type Sum (line 4) | pub trait Sum<Output> {
    method zero (line 6) | fn zero() -> Output;
    method map (line 9) | fn map(a: Self) -> Output;
    method u_map (line 12) | fn u_map<U>(_: &mut U, a: Self) -> Output;
    method reduce (line 15) | fn reduce(a: Output, b: Output) -> Output;
    method u_reduce (line 18) | fn u_reduce<U>(_: &mut U, a: Output, b: Output) -> Output;
  method zero (line 25) | fn zero() -> X {
  method map (line 30) | fn map(a: Self) -> X {
  method u_map (line 35) | fn u_map<U>(_: &mut U, a: Self) -> X {
  method reduce (line 40) | fn reduce(a: X, b: X) -> X {
  method u_reduce (line 45) | fn u_reduce<U>(_: &mut U, a: X, b: X) -> X {
  function zero (line 55) | fn zero() -> X {
  function map (line 60) | fn map(a: Self) -> X {
  function u_map (line 65) | fn u_map<U>(_: &mut U, a: Self) -> X {
  function reduce (line 70) | fn reduce(a: X, b: X) -> X {
  function u_reduce (line 75) | fn u_reduce<U>(_: &mut U, a: X, b: X) -> X {
  function zero (line 85) | fn zero() -> X {
  function map (line 90) | fn map(a: Self) -> X {
  function u_map (line 95) | fn u_map<U>(_: &mut U, a: Self) -> X {
  function reduce (line 100) | fn reduce(a: X, b: X) -> X {
  function u_reduce (line 105) | fn u_reduce<U>(_: &mut U, a: X, b: X) -> X {

FILE: src/test_utils.rs
  constant N (line 3) | pub const N: &[usize] = &[8025, 42735];
  constant NT (line 6) | pub const NT: &[usize] = &[0, 1, 2, 4];
  constant CHUNK (line 9) | pub const CHUNK: &[usize] = &[0, 1, 64, 1024];
  constant N (line 13) | pub const N: &[usize] = &[57];
  constant NT (line 16) | pub const NT: &[usize] = &[1, 2];
  constant CHUNK (line 19) | pub const CHUNK: &[usize] = &[4];
  function test_n_nt_chunk (line 22) | pub fn test_n_nt_chunk<T>(n: &[usize], nt: &[usize], chunk: &[usize], te...

FILE: src/using/collect_into/collect.rs
  function map_collect_into (line 12) | pub fn map_collect_into<'using, U, R, I, O, M1, P>(
  function map_collect_into_seq (line 41) | fn map_collect_into_seq<'using, U, I, O, M1, P>(using: U, iter: I, map1:...
  function xap_collect_into (line 57) | pub fn xap_collect_into<'using, U, R, I, Vo, X1, P>(
  function xap_collect_into_seq (line 102) | fn xap_collect_into_seq<'using, U, I, Vo, X1, P>(
  function xap_try_collect_into (line 129) | pub fn xap_try_collect_into<'using, U, R, I, Vo, X1, P>(
  function xap_try_collect_into_seq (line 167) | fn xap_try_collect_into_seq<'using, U, I, Vo, X1, P>(

FILE: src/using/collect_into/fixed_vec.rs
  function u_m_collect_into (line 15) | fn u_m_collect_into<'using, U, R, I, M1>(
  function u_x_collect_into (line 33) | fn u_x_collect_into<'using, U, R, I, Vo, X1>(
  function u_x_try_collect_into (line 52) | fn u_x_try_collect_into<'using, U, R, I, Vo, X1>(

FILE: src/using/collect_into/split_vec.rs
  function u_m_collect_into (line 20) | fn u_m_collect_into<'using, U, R, I, M1>(
  function u_x_collect_into (line 39) | fn u_x_collect_into<'using, U, R, I, Vo, X1>(
  function u_x_try_collect_into (line 60) | fn u_x_try_collect_into<'using, U, R, I, Vo, X1>(

FILE: src/using/collect_into/u_par_collect_into.rs
  type UParCollectIntoCore (line 9) | pub trait UParCollectIntoCore<O>: ParCollectIntoCore<O> {
    method u_m_collect_into (line 10) | fn u_m_collect_into<'using, U, R, I, M1>(
    method u_x_collect_into (line 24) | fn u_x_collect_into<'using, U, R, I, Vo, X1>(
    method u_x_try_collect_into (line 39) | fn u_x_try_collect_into<'using, U, R, I, Vo, X1>(

FILE: src/using/collect_into/vec.rs
  function u_m_collect_into (line 18) | fn u_m_collect_into<'using, U, R, I, M1>(
  function u_x_collect_into (line 48) | fn u_x_collect_into<'using, U, R, I, Vo, X1>(
  function u_x_try_collect_into (line 68) | fn u_x_try_collect_into<'using, U, R, I, Vo, X1>(

FILE: src/using/computational_variants/tests/copied.rs
  function input (line 7) | fn input<O: FromIterator<usize>>(n: usize) -> O {
  function copied_cloned_empty (line 12) | fn copied_cloned_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function copied_cloned_map (line 34) | fn copied_cloned_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function copied_cloned_xap_flat_map (line 57) | fn copied_cloned_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function copied_cloned_xap_filter_map (line 80) | fn copied_cloned_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usiz...
  function copied_cloned_xap_filter_xap (line 103) | fn copied_cloned_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usiz...

FILE: src/using/computational_variants/tests/count.rs
  function input (line 8) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function count_empty (line 14) | fn count_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_map (line 30) | fn count_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_xap_flat_map (line 47) | fn count_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_xap_filter_map (line 65) | fn count_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function count_xap_filter_xap (line 83) | fn count_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/fallible_option.rs
  function input (line 8) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function fallible_option_collect_empty (line 14) | fn fallible_option_collect_empty(nt: &[usize], chunk: &[usize]) {
  function fallible_option_collect_partial_success (line 35) | fn fallible_option_collect_partial_success(n: &[usize], nt: &[usize], ch...
  function fallible_option_collect_complete_success (line 57) | fn fallible_option_collect_complete_success(n: &[usize], nt: &[usize], c...

FILE: src/using/computational_variants/tests/fallible_result.rs
  function input (line 8) | fn input<O: FromIterator<String>>(n: usize) -> O {
  type MyErr (line 14) | struct MyErr(String);
    method new (line 16) | fn new() -> Self {
  function fallible_result_collect_empty (line 22) | fn fallible_result_collect_empty(nt: &[usize], chunk: &[usize]) {
  function fallible_result_collect_partial_success (line 43) | fn fallible_result_collect_partial_success(n: &[usize], nt: &[usize], ch...
  function fallible_result_collect_complete_success (line 68) | fn fallible_result_collect_complete_success(n: &[usize], nt: &[usize], c...

FILE: src/using/computational_variants/tests/flatten.rs
  function flatten_empty (line 9) | fn flatten_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function flatten_map (line 32) | fn flatten_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function flatten_xap_filter_map (line 53) | fn flatten_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function flatten_xap_filter_xap (line 82) | fn flatten_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/for_each.rs
  function input (line 9) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function sorted (line 14) | fn sorted(mut x: Vec<String>) -> Vec<String> {
  function for_each_empty (line 20) | fn for_each_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_map (line 40) | fn for_each_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_xap_flat_map (line 65) | fn for_each_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_xap_filter_map (line 90) | fn for_each_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function for_each_xap_filter_xap (line 115) | fn for_each_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/inspect.rs
  function input (line 9) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function sorted (line 14) | fn sorted(mut x: Vec<String>) -> Vec<String> {
  function inspect_empty (line 20) | fn inspect_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_map (line 44) | fn inspect_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_xap_flat_map (line 72) | fn inspect_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_xap_filter_map (line 100) | fn inspect_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function inspect_xap_filter_xap (line 128) | fn inspect_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/iter_consuming.rs
  constant N_OFFSET (line 12) | const N_OFFSET: usize = 13;
  function offset (line 14) | fn offset() -> Vec<String> {
  function input (line 18) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 23) | fn expected(
  function empty_collect_into (line 45) | fn empty_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ...
  function empty_collect (line 70) | fn empty_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[u...
  function map_collect_into (line 97) | fn map_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ch...
  function map_collect (line 123) | fn map_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[usi...

FILE: src/using/computational_variants/tests/iter_ref.rs
  function input (line 12) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 17) | fn expected(input: &impl Collection<Item = String>, map: impl Fn(String)...
  function empty_collect_into (line 24) | fn empty_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function empty_collect (line 66) | fn empty_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect_into (line 110) | fn map_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect (line 131) | fn map_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/map/collect.rs
  constant N (line 14) | const N: [usize; 2] = [37, 125];
  constant N (line 16) | const N: [usize; 2] = [1025, 4735];
  function m_map_collect (line 24) | fn m_map_collect(n: usize, nt: usize, chunk: usize, ordering: IterationO...

FILE: src/using/computational_variants/tests/map/find.rs
  constant N (line 13) | const N: [usize; 2] = [37, 125];
  constant N (line 15) | const N: [usize; 2] = [1025, 4735];
  function m_find (line 22) | fn m_find(n: usize, nt: usize, chunk: usize) {
  function m_map_find (line 46) | fn m_map_find(n: usize, nt: usize, chunk: usize) {

FILE: src/using/computational_variants/tests/map/reduce.rs
  constant N (line 13) | const N: [usize; 2] = [37, 125];
  constant N (line 15) | const N: [usize; 2] = [1025, 4735];
  function m_reduce (line 22) | fn m_reduce(n: usize, nt: usize, chunk: usize) {
  function m_map_reduce (line 50) | fn m_map_reduce(n: usize, nt: usize, chunk: usize) {

FILE: src/using/computational_variants/tests/min_max.rs
  function input (line 8) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function cmp (line 13) | fn cmp(a: &usize, b: &usize) -> Ordering {
  function key (line 20) | fn key(a: &usize) -> u64 {
  function min_max_empty (line 25) | fn min_max_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_map (line 55) | fn min_max_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_xap_flat_map (line 88) | fn min_max_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_xap_filter_map (line 131) | fn min_max_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function min_max_xap_filter_xap (line 179) | fn min_max_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/range.rs
  constant N_OFFSET (line 11) | const N_OFFSET: usize = 13;
  function offset (line 13) | fn offset() -> Vec<usize> {
  function expected (line 17) | fn expected<T>(
  function empty_collect_into (line 38) | fn empty_collect_into<C>(output: C, n: &[usize], nt: &[usize], chunk: &[...
  function empty_collect (line 60) | fn empty_collect<C>(_: C, n: &[usize], nt: &[usize], chunk: &[usize])
  function map_collect_into (line 84) | fn map_collect_into<C>(output: C, n: &[usize], nt: &[usize], chunk: &[us...
  function map_collect (line 107) | fn map_collect<C>(_: C, n: &[usize], nt: &[usize], chunk: &[usize])

FILE: src/using/computational_variants/tests/slice.rs
  function input (line 12) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 17) | fn expected(input: &impl Collection<Item = String>, map: impl Fn(String)...
  function empty_collect_into (line 24) | fn empty_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function empty_collect (line 66) | fn empty_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect_into (line 110) | fn map_collect_into(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function map_collect (line 131) | fn map_collect(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/sum.rs
  function input (line 7) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function sum_empty (line 13) | fn sum_empty(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_map (line 29) | fn sum_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_xap_flat_map (line 47) | fn sum_xap_flat_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_xap_filter_map (line 65) | fn sum_xap_filter_map(n: &[usize], nt: &[usize], chunk: &[usize]) {
  function sum_xap_filter_xap (line 83) | fn sum_xap_filter_xap(n: &[usize], nt: &[usize], chunk: &[usize]) {

FILE: src/using/computational_variants/tests/utils.rs
  function make_u_map (line 3) | pub(super) fn make_u_map<I, O>(
  function make_u_xap (line 15) | pub(super) fn make_u_xap<I, O>(
  function make_u_filter (line 29) | pub(super) fn make_u_filter<I>(
  function make_u_reduce (line 41) | pub(super) fn make_u_reduce<I>(

FILE: src/using/computational_variants/tests/vectors.rs
  constant N_OFFSET (line 12) | const N_OFFSET: usize = 13;
  function offset (line 14) | fn offset() -> Vec<String> {
  function input (line 18) | fn input<O: FromIterator<String>>(n: usize) -> O {
  function expected (line 23) | fn expected(
  function empty_collect_into (line 45) | fn empty_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ...
  function empty_collect (line 69) | fn empty_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[u...
  function map_collect_into (line 95) | fn map_collect_into<I, C>(_: I, output: C, n: &[usize], nt: &[usize], ch...
  function map_collect (line 120) | fn map_collect<I, C>(_: I, _: C, n: &[usize], nt: &[usize], chunk: &[usi...

FILE: src/using/computational_variants/tests/xap/collect.rs
  constant N (line 17) | const N: [usize; 2] = [37, 125];
  constant N (line 19) | const N: [usize; 2] = [1025, 4735];
  function todo_panic_at_con_bag_new (line 22) | fn todo_panic_at_con_bag_new() {
  function x_flat_map_collect (line 73) | fn x_flat_map_collect(n: usize, nt: usize, chunk: usize, ordering: Itera...
  function x_filter_map_collect (line 118) | fn x_filter_map_collect(n: usize, nt: usize, chunk: usize, ordering: Ite...

FILE: src/using/computational_variants/tests/xap/find.rs
  constant N (line 15) | const N: [usize; 2] = [37, 125];
  constant N (line 17) | const N: [usize; 2] = [1025, 4735];
  function x_flat_map_find (line 24) | fn x_flat_map_find(n: usize, nt: usize, chunk: usize) {
  function x_filter_map_find (line 51) | fn x_filter_map_find(n: usize, nt: usize, chunk: usize) {

FILE: src/using/computational_variants/tests/xap/reduce.rs
  constant N (line 16) | const N: [usize; 2] = [37, 125];
  constant N (line 18) | const N: [usize; 2] = [1025, 4735];
  function x_flat_map_reduce (line 25) | fn x_flat_map_reduce(n: usize, nt: usize, chunk: usize) {
  function x_filter_map_reduce (line 56) | fn x_filter_map_reduce(n: usize, nt: usize, chunk: usize) {

FILE: src/using/computational_variants/u_fallible_option.rs
  type UParOption (line 11) | pub struct UParOption<'using, U, F, T, R = DefaultRunner>
  function new (line 27) | pub(crate) fn new(par: F) -> Self {
  type Item (line 41) | type Item = T;
  function num_threads (line 45) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 49) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 53) | fn iteration_order(self, order: IterationOrder) -> Self {
  function with_runner (line 57) | fn with_runner<Q: ParallelRunner>(
  function map (line 66) | fn map<Out, Map>(self, map: Map) -> impl ParIterOptionUsing<'using, U, R...
  function filter (line 74) | fn filter<Filter>(
  function flat_map (line 86) | fn flat_map<IOut, FlatMap>(
  function filter_map (line 99) | fn filter_map<Out, FilterMap>(
  function inspect (line 111) | fn inspect<Operation>(
  function collect_into (line 125) | fn collect_into<C>(self, output: C) -> Option<C>
  function collect (line 133) | fn collect<C>(self) -> Option<C>
  function reduce (line 143) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Option<Self::Item>>
  function first (line 153) | fn first(self) -> Option<Option<Self::Item>>

FILE: src/using/computational_variants/u_fallible_result/u_map_result.rs
  type UParMapResult (line 11) | pub struct UParMapResult<'using, U, I, T, E, O, M1, R = DefaultRunner>
  function new (line 31) | pub(crate) fn new(par: UParMap<'using, U, I, O, M1, R>) -> Self {
  type Item (line 48) | type Item = T;
  type Err (line 50) | type Err = E;
  type RegularItem (line 52) | type RegularItem = O;
  type RegularParIter (line 54) | type RegularParIter = UParMap<'using, U, I, O, M1, R>;
  function con_iter_len (line 56) | fn con_iter_len(&self) -> Option<usize> {
  function into_regular_par (line 60) | fn into_regular_par(self) -> Self::RegularParIter {
  function from_regular_par (line 64) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self {
  function with_runner (line 73) | fn with_runner<Q: ParallelRunner>(
  function collect_into (line 86) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
  function reduce (line 103) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, Se...
  function first (line 125) | fn first(self) -> Result<Option<Self::Item>, Self::Err>

FILE: src/using/computational_variants/u_fallible_result/u_par_result.rs
  type UParResult (line 11) | pub struct UParResult<'using, U, I, T, E, R = DefaultRunner>
  function new (line 29) | pub(crate) fn new(par: UPar<'using, U, I, R>) -> Self {
  type Item (line 44) | type Item = T;
  type Err (line 46) | type Err = E;
  type RegularItem (line 48) | type RegularItem = I::Item;
  type RegularParIter (line 50) | type RegularParIter = UPar<'using, U, I, R>;
  function con_iter_len (line 52) | fn con_iter_len(&self) -> Option<usize> {
  function into_regular_par (line 56) | fn into_regular_par(self) -> Self::RegularParIter {
  function from_regular_par (line 60) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self {
  function with_runner (line 69) | fn with_runner<Q: ParallelRunner>(
  function collect_into (line 82) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
  function reduce (line 95) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, Se...
  function first (line 113) | fn first(self) -> Result<Option<Self::Item>, Self::Err>

FILE: src/using/computational_variants/u_fallible_result/u_xap_result.rs
  type UParXapResult (line 13) | pub struct UParXapResult<'using, U, I, T, E, Vo, X1, R = DefaultRunner>
  function new (line 39) | pub(crate) fn new(using: U, orchestrator: R, params: Params, iter: I, xa...
  function destruct (line 50) | fn destruct(self) -> (U, R, Params, I, X1) {
  type Item (line 71) | type Item = T;
  type Err (line 73) | type Err = E;
  type RegularItem (line 75) | type RegularItem = Vo::Item;
  type RegularParIter (line 77) | type RegularParIter = UParXap<'using, U, I, Vo, X1, R>;
  function con_iter_len (line 79) | fn con_iter_len(&self) -> Option<usize> {
  function into_regular_par (line 83) | fn into_regular_par(self) -> Self::RegularParIter {
  function from_regular_par (line 88) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self {
  function with_runner (line 95) | fn with_runner<Q: ParallelRunner>(
  function collect_into (line 105) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
  function reduce (line 118) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, Se...
  function first (line 136) | fn first(self) -> Result<Option<Self::Item>, Self::Err>

FILE: src/using/computational_variants/u_map.rs
  type UParMap (line 16) | pub struct UParMap<'using, U, I, O, M1, R = DefaultRunner>
  function new (line 38) | pub(crate) fn new(using: U, orchestrator: R, params: Params, iter: I, ma...
  function destruct (line 49) | pub(crate) fn destruct(self) -> (U, R, Params, I, M1) {
  type Item (line 85) | type Item = O;
  function con_iter (line 87) | fn con_iter(&self) -> &impl ConcurrentIter {
  function params (line 91) | fn params(&self) -> Params {
  function num_threads (line 95) | fn num_threads(mut self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 100) | fn chunk_size(mut self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 105) | fn iteration_order(mut self, collect: IterationOrder) -> Self {
  function with_runner (line 110) | fn with_runner<Q: ParallelRunner>(
  function map (line 118) | fn map<Out, Map>(self, map: Map) -> impl ParIterUsing<'using, U, R, Item...
  function filter (line 130) | fn filter<Filter>(self, filter: Filter) -> impl ParIterUsing<'using, U, ...
  function flat_map (line 145) | fn flat_map<IOut, FlatMap>(
  function filter_map (line 163) | fn filter_map<Out, FilterMap>(
  function into_fallible_result (line 180) | fn into_fallible_result<Out, Err>(
  function collect_into (line 189) | fn collect_into<C>(self, output: C) -> C
  function reduce (line 197) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
  function first (line 206) | fn first(self) -> Option<Self::Item>

FILE: src/using/computational_variants/u_par.rs
  type UPar (line 18) | pub struct UPar<'using, U, I, R = DefaultRunner>
  function new (line 37) | pub(crate) fn new(using: U, orchestrator: R, params: Params, iter: I) ->...
  function destruct (line 47) | pub(crate) fn destruct(self) -> (U, R, Params, I) {
  type Item (line 74) | type Item = I::Item;
  function con_iter (line 76) | fn con_iter(&self) -> &impl ConcurrentIter {
  function params (line 80) | fn params(&self) -> Params {
  function num_threads (line 84) | fn num_threads(mut self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 89) | fn chunk_size(mut self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 94) | fn iteration_order(mut self, collect: IterationOrder) -> Self {
  function with_runner (line 99) | fn with_runner<Q: ParallelRunner>(
  function map (line 107) | fn map<Out, Map>(self, map: Map) -> impl ParIterUsing<'using, U, R, Item...
  function filter (line 115) | fn filter<Filter>(self, filter: Filter) -> impl ParIterUsing<'using, U, ...
  function flat_map (line 128) | fn flat_map<IOut, FlatMap>(
  function filter_map (line 145) | fn filter_map<Out, FilterMap>(
  function into_fallible_result (line 161) | fn into_fallible_result<Out, Err>(
  function collect_into (line 170) | fn collect_into<C>(self, output: C) -> C
  function reduce (line 178) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
  function first (line 187) | fn first(self) -> Option<Self::Item>

FILE: src/using/computational_variants/u_xap.rs
  type UParXap (line 16) | pub struct UParXap<'using, U, I, Vo, X1, R = DefaultRunner>
  function new (line 40) | pub(crate) fn new(using: U, orchestrator: R, params: Params, iter: I, xa...
  function destruct (line 51) | pub(crate) fn destruct(self) -> (U, R, Params, I, X1) {
  type Item (line 90) | type Item = Vo::Item;
  function con_iter (line 92) | fn con_iter(&self) -> &impl ConcurrentIter {
  function params (line 96) | fn params(&self) -> Params {
  function num_threads (line 100) | fn num_threads(mut self, num_threads: impl Into<NumThreads>) -> Self {
  function chunk_size (line 105) | fn chunk_size(mut self, chunk_size: impl Into<ChunkSize>) -> Self {
  function iteration_order (line 110) | fn iteration_order(mut self, collect: IterationOrder) -> Self {
  function with_runner (line 115) | fn with_runner<Q: ParallelRunner>(
  function map (line 123) | fn map<Out, Map>(self, map: Map) -> impl ParIterUsing<'using, U, R, Item...
  function filter (line 143) | fn filter<Filter>(self, filter: Filter) -> impl ParIterUsing<'using, U, ...
  function flat_map (line 162) | fn flat_map<IOut, FlatMap>(
  function filter_map (line 185) | fn filter_map<Out, FilterMap>(
  function into_fallible_result (line 207) | fn into_fallible_result<Out, Err>(
  function collect_into (line 217) | fn collect_into<C>(self, output: C) -> C
  function reduce (line 225) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
  function first (line 241) | fn first(self) -> Option<Self::Item>

FILE: src/using/executor/parallel_compute/collect_arbitrary.rs
  function m (line 12) | pub fn m<'using, U, C, I, O, M1, P>(
  function x (line 46) | pub fn x<'using, U, C, I, Vo, X1, P>(

FILE: src/using/executor/parallel_compute/collect_ordered.rs
  function m (line 11) | pub fn m<'using, U, C, I, O, M1, P>(
  function x (line 41) | pub fn x<'using, U, C, I, Vo, X1, P>(

FILE: src/using/executor/parallel_compute/next.rs
  function m (line 9) | pub fn m<'using, U, C, I, O, M1>(
  type ResultNext (line 40) | type ResultNext<Vo> = Result<
  function x (line 45) | pub fn x<'using, U, C, I, Vo, X1>(

FILE: src/using/executor/parallel_compute/next_any.rs
  function m (line 9) | pub fn m<'using, U, C, I, O, M1>(
  type ResultNextAny (line 36) | type ResultNextAny<Vo> =
  function x (line 39) | pub fn x<'using, U, C, I, Vo, X1>(

FILE: src/using/executor/parallel_compute/reduce.rs
  function m (line 9) | pub fn m<'using, U, C, I, O, M1, Red>(
  type ResultReduce (line 44) | type ResultReduce<Vo> =
  function x (line 47) | pub fn x<'using, U, C, I, Vo, X1, Red>(

FILE: src/using/executor/thread_compute/collect_arbitrary.rs
  function m (line 11) | pub fn m<U, C, I, O, M1, P>(
  function x (line 59) | pub fn x<U, C, I, Vo, X1, P>(

FILE: src/using/executor/thread_compute/collect_ordered.rs
  function m (line 9) | pub fn m<U, C, I, O, M1, P>(
  function x (line 58) | pub fn x<U, C, I, Vo, X1>(

FILE: src/using/executor/thread_compute/next.rs
  function m (line 8) | pub fn m<U, C, I, O, M1>(
  function x (line 67) | pub fn x<U, C, I, Vo, X1>(

FILE: src/using/executor/thread_compute/next_any.rs
  function m (line 8) | pub fn m<U, C, I, O, M1>(
  function x (line 68) | pub fn x<U, C, I, Vo, X1>(

FILE: src/using/executor/thread_compute/reduce.rs
  function m (line 12) | pub fn m<U, C, I, O, M1, Red>(
  function x (line 84) | pub fn x<U, C, I, Vo, X1, Red>(

FILE: src/using/u_par_iter.rs
  type ParIterUsing (line 18) | pub trait ParIterUsing<'using, U, R = DefaultRunner>: Sized + Send + Sync
    method con_iter (line 27) | fn con_iter(&self) -> &impl ConcurrentIter;
    method params (line 32) | fn params(&self) -> Params;
    method num_threads (line 46) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self;
    method chunk_size (line 57) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self;
    method iteration_order (line 62) | fn iteration_order(self, collect: IterationOrder) -> Self;
    method with_runner (line 70) | fn with_runner<Q: ParallelRunner>(
    method with_pool (line 82) | fn with_pool<P: ParThreadPool>(
    method into_fallible_result (line 112) | fn into_fallible_result<T, E>(self) -> impl ParIterResultUsing<'using,...
    method into_fallible_option (line 133) | fn into_fallible_option<T>(self) -> impl ParIterOptionUsing<'using, U,...
    method map (line 152) | fn map<Out, Map>(self, map: Map) -> impl ParIterUsing<'using, U, R, It...
    method filter (line 163) | fn filter<Filter>(self, filter: Filter) -> impl ParIterUsing<'using, U...
    method flat_map (line 174) | fn flat_map<IOut, FlatMap>(
    method filter_map (line 193) | fn filter_map<Out, FilterMap>(
    method inspect (line 207) | fn inspect<Operation>(
    method copied (line 230) | fn copied<'a, T>(self) -> impl ParIterUsing<'using, U, R, Item = T>
    method cloned (line 245) | fn cloned<'a, T>(self) -> impl ParIterUsing<'using, U, R, Item = T>
    method flatten (line 260) | fn flatten(self) -> impl ParIterUsing<'using, U, R, Item = <Self::Item...
    method collect_into (line 277) | fn collect_into<C>(self, output: C) -> C
    method collect (line 288) | fn collect<C>(self) -> C
    method reduce (line 301) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Self::Item>
    method all (line 313) | fn all<Predicate>(self, predicate: Predicate) -> bool
    method any (line 329) | fn any<Predicate>(self, predicate: Predicate) -> bool
    method count (line 340) | fn count(self) -> usize {
    method for_each (line 351) | fn for_each<Operation>(self, operation: Operation)
    method max (line 362) | fn max(self) -> Option<Self::Item>
    method max_by (line 372) | fn max_by<Compare>(self, compare: Compare) -> Option<Self::Item>
    method max_by_key (line 387) | fn max_by_key<Key, GetKey>(self, key: GetKey) -> Option<Self::Item>
    method min (line 403) | fn min(self) -> Option<Self::Item>
    method min_by (line 413) | fn min_by<Compare>(self, compare: Compare) -> Option<Self::Item>
    method min_by_key (line 428) | fn min_by_key<Key, GetKey>(self, get_key: GetKey) -> Option<Self::Item>
    method sum (line 444) | fn sum<Out>(self) -> Out
    method first (line 462) | fn first(self) -> Option<Self::Item>
    method find (line 473) | fn find<Predicate>(self, predicate: Predicate) -> Option<Self::Item>

FILE: src/using/u_par_iter_option.rs
  type ParIterOptionUsing (line 17) | pub trait ParIterOptionUsing<'using, U, R = DefaultRunner>
    method num_threads (line 35) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self;
    method chunk_size (line 46) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self;
    method iteration_order (line 51) | fn iteration_order(self, order: IterationOrder) -> Self;
    method with_runner (line 59) | fn with_runner<Q: ParallelRunner>(
    method with_pool (line 71) | fn with_pool<P: ParThreadPool>(
    method map (line 94) | fn map<Out, Map>(self, map: Map) -> impl ParIterOptionUsing<'using, U,...
    method filter (line 110) | fn filter<Filter>(
    method flat_map (line 129) | fn flat_map<IOut, FlatMap>(
    method filter_map (line 150) | fn filter_map<Out, FilterMap>(
    method inspect (line 167) | fn inspect<Operation>(
    method collect_into (line 186) | fn collect_into<C>(self, output: C) -> Option<C>
    method collect (line 206) | fn collect<C>(self) -> Option<C>
    method reduce (line 223) | fn reduce<Reduce>(self, reduce: Reduce) -> Option<Option<Self::Item>>
    method all (line 236) | fn all<Predicate>(self, predicate: Predicate) -> Option<bool>
    method any (line 254) | fn any<Predicate>(self, predicate: Predicate) -> Option<bool>
    method count (line 267) | fn count(self) -> Option<usize>
    method for_each (line 284) | fn for_each<Operation>(self, operation: Operation) -> Option<()>
    method max (line 298) | fn max(self) -> Option<Option<Self::Item>>
    method max_by (line 311) | fn max_by<Compare>(self, compare: Compare) -> Option<Option<Self::Item>>
    method max_by_key (line 329) | fn max_by_key<Key, GetKey>(self, key: GetKey) -> Option<Option<Self::I...
    method min (line 348) | fn min(self) -> Option<Option<Self::Item>>
    method min_by (line 361) | fn min_by<Compare>(self, compare: Compare) -> Option<Option<Self::Item>>
    method min_by_key (line 379) | fn min_by_key<Key, GetKey>(self, get_key: GetKey) -> Option<Option<Sel...
    method sum (line 399) | fn sum<Out>(self) -> Option<Out>
    method first (line 420) | fn first(self) -> Option<Option<Self::Item>>
    method find (line 442) | fn find<Predicate>(self, predicate: Predicate) -> Option<Option<Self::...

FILE: src/using/u_par_iter_result.rs
  type ParIterResultUsing (line 19) | pub trait ParIterResultUsing<'using, U, R = DefaultRunner>
    method con_iter_len (line 37) | fn con_iter_len(&self) -> Option<usize>;
    method into_regular_par (line 40) | fn into_regular_par(self) -> Self::RegularParIter;
    method from_regular_par (line 43) | fn from_regular_par(regular_par: Self::RegularParIter) -> Self;
    method num_threads (line 55) | fn num_threads(self, num_threads: impl Into<NumThreads>) -> Self
    method chunk_size (line 71) | fn chunk_size(self, chunk_size: impl Into<ChunkSize>) -> Self
    method iteration_order (line 81) | fn iteration_order(self, order: IterationOrder) -> Self
    method with_runner (line 94) | fn with_runner<Q: ParallelRunner>(
    method with_pool (line 106) | fn with_pool<P: ParThreadPool>(
    method map (line 135) | fn map<Out, Map>(
    method filter (line 159) | fn filter<Filter>(
    method flat_map (line 189) | fn flat_map<IOut, FlatMap>(
    method filter_map (line 219) | fn filter_map<Out, FilterMap>(
    method inspect (line 244) | fn inspect<Operation>(
    method collect_into (line 270) | fn collect_into<C>(self, output: C) -> Result<C, Self::Err>
    method collect (line 291) | fn collect<C>(self) -> Result<C, Self::Err>
    method reduce (line 314) | fn reduce<Reduce>(self, reduce: Reduce) -> Result<Option<Self::Item>, ...
    method all (line 328) | fn all<Predicate>(self, predicate: Predicate) -> Result<bool, Self::Err>
    method any (line 347) | fn any<Predicate>(self, predicate: Predicate) -> Result<bool, Self::Err>
    method count (line 361) | fn count(self) -> Result<usize, Self::Err>
    method for_each (line 379) | fn for_each<Operation>(self, operation: Operation) -> Result<(), Self:...
    method max (line 394) | fn max(self) -> Result<Option<Self::Item>, Self::Err>
    method max_by (line 408) | fn max_by<Compare>(self, compare: Compare) -> Result<Option<Self::Item...
    method max_by_key (line 427) | fn max_by_key<Key, GetKey>(self, key: GetKey) -> Result<Option<Self::I...
    method min (line 447) | fn min(self) -> Result<Option<Self::Item>, Self::Err>
    method min_by (line 461) | fn min_by<Compare>(self, compare: Compare) -> Result<Option<Self::Item...
    method min_by_key (line 480) | fn min_by_key<Key, GetKey>(self, get_key: GetKey) -> Result<Option<Sel...
    method sum (line 501) | fn sum<Out>(self) -> Result<Out, Self::Err>
    method first (line 523) | fn first(self) -> Result<Option<Self::Item>, Self::Err>
    method find (line 546) | fn find<Predicate>(self, predicate: Predicate) -> Result<Option<Self::...

FILE: src/using/using_variants.rs
  type Using (line 5) | pub trait Using<'using>: Sync {
    method create (line 10) | fn create(&self, thread_idx: usize) -> Self::Item;
    method into_inner (line 13) | fn into_inner(self) -> Self::Item;
  type UsingClone (line 17) | pub struct UsingClone<T: Clone + 'static>(T);
  function new (line 20) | pub(crate) fn new(value: T) -> Self {
  type Item (line 26) | type Item = T;
  function create (line 28) | fn create(&self, _: usize) -> T {
  function into_inner (line 32) | fn into_inner(self) -> Self::Item {
  type UsingFun (line 40) | pub struct UsingFun<F, T>
  function new (line 51) | pub(crate) fn new(fun: F) -> Self {
  type Item (line 61) | type Item = T;
  function create (line 63) | fn create(&self, thread_idx: usize) -> Self::Item {
  function into_inner (line 67) | fn into_inner(self) -> Self::Item {

FILE: src/value_variants/whilst_iterators/whilst_atom_flat_map.rs
  type WhilstAtomFlatMapIter (line 3) | pub struct WhilstAtomFlatMapIter<Vo>
  function from_atom (line 14) | pub fn from_atom<T, Fm>(atom: WhilstAtom<T>, flat_map: Fm) -> Self
  function u_from_atom (line 25) | pub fn u_from_atom<U, T, Fm>(u: &mut U, atom: WhilstAtom<T>, flat_map: F...
  type Item (line 41) | type Item = WhilstAtom<Vo::Item>;
  method next (line 43) | fn next(&mut self) -> Option<Self::Item> {

FILE: src/value_variants/whilst_iterators/whilst_option_flat_map.rs
  type WhilstOptionFlatMapIter (line 3) | pub struct WhilstOptionFlatMapIter<Vo>
  function from_option (line 14) | pub fn from_option<T, Fm>(atom: WhilstOption<T>, flat_map: Fm) -> Self
  function u_from_option (line 26) | pub fn u_from_option<U, T, Fm>(u: &mut U, atom: WhilstOption<T>, flat_ma...
  type Item (line 43) | type Item = WhilstAtom<Vo::Item>;
  method next (line 45) | fn next(&mut self) -> Option<Self::Item> {

FILE: src/value_variants/whilst_vector.rs
  type WhilstVector (line 14) | pub struct WhilstVector<I, T>(pub(crate) I)
  type Item (line 22) | type Item = T;
  type Fallibility (line 24) | type Fallibility = Infallible;
  method push_to_pinned_vec (line 26) | fn push_to_pinned_vec<P>(self, vector: &mut P) -> SequentialPush<Self::F...
  method push_to_vec_with_idx (line 39) | fn push_to_vec_with_idx(
  method push_to_bag (line 53) | fn push_to_bag<P>(self, bag: &ConcurrentBag<Self::Item, P>) -> Arbitrary...
  method acc_reduce (line 67) | fn acc_reduce<X>(self, acc: Option<Self::Item>, reduce: X) -> Reduce<Self>
  method u_acc_reduce (line 97) | fn u_acc_reduce<U, X>(self, u: &mut U, acc: Option<Self::Item>, reduce: ...
  method next (line 127) | fn next(self) -> Next<Self> {
  method map (line 142) | fn map<M, O>(
  method filter (line 156) | fn filter<F>(
  method flat_map (line 173) | fn flat_map<Fm, Vo>(
  method filter_map (line 188) | fn filter_map<Fm, O>(
  method whilst (line 202) | fn whilst(
  method map_while_ok (line 219) | fn map_while_ok<Mr, O, E>(self, map_res: Mr) -> impl Values<Item = O, Fa...
  method u_map (line 231) | fn u_map<U, M, O>(
  method u_filter (line 246) | fn u_filter<U, F>(
  method u_flat_map (line 264) | fn u_flat_map<U, Fm, Vo>(
  method u_filter_map (line 280) | fn u_filter_map<U, Fm, O>(

FILE: tests/chain.rs
  function chain_known_known (line 5) | fn chain_known_known(n: usize, nt: usize, chunk: usize) {
  function chain_known_unknown (line 20) | fn chain_known_unknown(n: usize, nt: usize, chunk: usize) {

FILE: tests/into_par.rs
  function take_into_par_into_par_bounds (line 4) | fn take_into_par_into_par_bounds<T>(a: impl IntoParIter<Item = T>) {
  function take_into_par_into_con_iter_bounds (line 8) | fn take_into_par_into_con_iter_bounds<T>(a: impl IntoConcurrentIter<Item...
  function vec_into_par_iter (line 13) | fn vec_into_par_iter() {
  function slice_into_par_iter (line 22) | fn slice_into_par_iter() {
  function range_into_par_iter (line 32) | fn range_into_par_iter() {

FILE: tests/iter_into_par.rs
  function take_iter_into_par_iterator_bounds (line 4) | fn take_iter_into_par_iterator_bounds<I>(a: I)
  function take_iter_into_par_iter_into_con_iter_bounds (line 12) | fn take_iter_into_par_iter_into_con_iter_bounds<I>(a: I)
  function take_iter_into_par_iter_into_par_bounds (line 20) | fn take_iter_into_par_iter_into_par_bounds<T: Send>(a: impl IterIntoParI...
  function iter_into_par_iter (line 25) | fn iter_into_par_iter() {

FILE: tests/map_while_ok_collect/from_map.rs
  function map_while_ok_from_map_when_ok (line 4) | fn map_while_ok_from_map_when_ok() {
  function map_while_ok_from_map_when_error (line 24) | fn map_while_ok_from_map_when_error() {

FILE: tests/map_while_ok_collect/from_par.rs
  function map_while_ok_from_par_when_ok (line 4) | fn map_while_ok_from_par_when_ok() {
  function map_while_ok_from_par_when_error (line 22) | fn map_while_ok_from_par_when_error() {

FILE: tests/map_while_ok_collect/from_xap_chain.rs
  function map_while_ok_from_xap_chain_when_ok (line 4) | fn map_while_ok_from_xap_chain_when_ok() {
  function map_while_ok_from_xap_chain_when_error (line 38) | fn map_while_ok_from_xap_chain_when_error() {
  function map_while_ok_from_xap_chain_whilst_when_ok (line 72) | fn map_while_ok_from_xap_chain_whilst_when_ok() {
  function map_while_ok_from_xap_chain_whilst_when_err (line 111) | fn map_while_ok_from_xap_chain_whilst_when_err() {
  function map_while_ok_from_xap_chain_whilst_when_err_out_of_reach (line 146) | fn map_while_ok_from_xap_chain_whilst_when_err_out_of_reach() {

FILE: tests/map_while_ok_collect/from_xap_filter.rs
  function map_while_ok_from_xap_filter_when_ok (line 4) | fn map_while_ok_from_xap_filter_when_ok() {
  function map_while_ok_from_xap_filter_when_error (line 24) | fn map_while_ok_from_xap_filter_when_error() {
  function map_while_ok_from_xap_filter_whilst_when_ok (line 49) | fn map_while_ok_from_xap_filter_whilst_when_ok() {
  function map_while_ok_from_xap_filter_whilst_when_err (line 73) | fn map_while_ok_from_xap_filter_whilst_when_err() {
  function map_while_ok_from_xap_filter_whilst_when_err_out_of_reach (line 99) | fn map_while_ok_from_xap_filter_whilst_when_err_out_of_reach() {

FILE: tests/map_while_ok_collect/from_xap_filter_map.rs
  function map_while_ok_from_xap_filter_map_when_ok (line 4) | fn map_while_ok_from_xap_filter_map_when_ok() {
  function map_while_ok_from_xap_filter_map_when_error (line 24) | fn map_while_ok_from_xap_filter_map_when_error() {
  function map_while_ok_from_xap_filter_map_whilst_when_ok (line 49) | fn map_while_ok_from_xap_filter_map_whilst_when_ok() {
  function map_while_ok_from_xap_filter_map_whilst_when_error (line 73) | fn map_while_ok_from_xap_filter_map_whilst_when_error() {
  function map_while_ok_from_xap_filter_map_whilst_when_error_out_of_reach (line 99) | fn map_while_ok_from_xap_filter_map_whilst_when_error_out_of_reach() {

FILE: tests/map_while_ok_collect/from_xap_flat_map.rs
  function map_while_ok_from_xap_flat_map_when_ok (line 4) | fn map_while_ok_from_xap_flat_map_when_ok() {
  function map_while_ok_from_xap_flat_map_when_error (line 24) | fn map_while_ok_from_xap_flat_map_when_error() {
  function map_while_ok_from_xap_flat_map_whilst_when_ok (line 49) | fn map_while_ok_from_xap_flat_map_whilst_when_ok() {
  function map_while_ok_from_xap_flat_map_whilst_when_error (line 75) | fn map_while_ok_from_xap_flat_map_whilst_when_error() {
  function map_while_ok_from_xap_flat_map_whilst_when_error_out_of_reach (line 101) | fn map_while_ok_from_xap_flat_map_whilst_when_error_out_of_reach() {

FILE: tests/map_while_ok_collect_arbitrary/from_map.rs
  function map_while_ok_from_map_when_ok (line 6) | fn map_while_ok_from_map_when_ok() {
  function map_while_ok_from_map_when_error (line 28) | fn map_while_ok_from_map_when_error() {

FILE: tests/map_while_ok_collect_arbitrary/from_par.rs
  function map_while_ok_from_par_when_ok (line 6) | fn map_while_ok_from_par_when_ok() {
  function map_while_ok_from_par_when_error (line 26) | fn map_while_ok_from_par_when_error() {

FILE: tests/map_while_ok_collect_arbitrary/from_xap_chain.rs
  function map_while_ok_from_xap_chain_when_ok (line 5) | fn map_while_ok_from_xap_chain_when_ok() {
  function map_while_ok_from_xap_chain_when_error (line 43) | fn map_while_ok_from_xap_chain_when_error() {
  function map_while_ok_from_xap_chain_whilst_when_ok (line 78) | fn map_while_ok_from_xap_chain_whilst_when_ok() {
  function map_while_ok_from_xap_chain_whilst_when_err (line 111) | fn map_while_ok_from_xap_chain_whilst_when_err() {
  function map_while_ok_from_xap_chain_whilst_when_err_out_of_reach (line 147) | fn map_while_ok_from_xap_chain_whilst_when_err_out_of_reach() {

FILE: tests/map_while_ok_collect_arbitrary/from_xap_filter.rs
  function map_while_ok_from_xap_filter_when_ok (line 5) | fn map_while_ok_from_xap_filter_when_ok() {
  function map_while_ok_from_xap_filter_when_error (line 28) | fn map_while_ok_from_xap_filter_when_error() {
  function map_while_ok_from_xap_filter_whilst_when_ok (line 54) | fn map_while_ok_from_xap_filter_whilst_when_ok() {
  function map_while_ok_from_xap_filter_whilst_when_err (line 78) | fn map_while_ok_from_xap_filter_whilst_when_err() {
  function map_while_ok_from_xap_filter_whilst_when_err_out_of_reach (line 105) | fn map_while_ok_from_xap_filter_whilst_when_err_out_of_reach() {

FILE: tests/map_while_ok_collect_arbitrary/from_xap_filter_map.rs
  function map_while_ok_from_xap_filter_map_when_ok (line 5) | fn map_while_ok_from_xap_filter_map_when_ok() {
  function map_while_ok_from_xap_filter_map_when_error (line 28) | fn map_while_ok_from_xap_filter_map_when_error() {
  function map_while_ok_from_xap_filter_map_whilst_when_ok (line 54) | fn map_while_ok_from_xap_filter_map_whilst_when_ok() {
  function map_while_ok_from_xap_filter_map_whilst_when_error (line 78) | fn map_while_ok_from_xap_filter_map_whilst_when_error() {
  function map_while_ok_from_xap_filter_map_whilst_when_error_out_of_reach (line 105) | fn map_while_ok_from_xap_filter_map_whilst_when_error_out_of_reach() {

FILE: tests/map_while_ok_collect_arbitrary/from_xap_flat_map.rs
  function map_while_ok_from_xap_flat_map_when_ok (line 6) | fn map_while_ok_from_xap_flat_map_when_ok() {
  function map_while_ok_from_xap_flat_map_when_error (line 30) | fn map_while_ok_from_xap_flat_map_when_error() {
  function map_while_ok_from_xap_flat_map_whilst_when_ok (line 56) | fn map_while_ok_from_xap_flat_map_whilst_when_ok() {
  function map_while_ok_from_xap_flat_map_whilst_when_error (line 81) | fn map_while_ok_from_xap_flat_map_whilst_when_error() {
  function map_while_ok_from_xap_flat_map_whilst_when_error_out_of_reach (line 108) | fn map_while_ok_from_xap_flat_map_whilst_when_error_out_of_reach() {

FILE: tests/map_while_ok_collect_arbitrary/utils.rs
  function sort_if_ok (line 1) | pub fn sort_if_ok<T: Ord + PartialOrd, E>(res_vec: Result<Vec<T>, E>) ->...

FILE: tests/map_while_ok_reduce/from_map.rs
  function map_while_ok_from_map_when_ok (line 4) | fn map_while_ok_from_map_when_ok() {
  function map_while_ok_from_map_when_error (line 32) | fn map_while_ok_from_map_when_error() {

FILE: tests/map_while_ok_reduce/from_par.rs
  function map_while_ok_from_par_when_ok (line 4) | fn map_while_ok_from_par_when_ok() {
  function map_while_ok_from_par_when_error (line 22) | fn map_while_ok_from_par_when_error() {

FILE: tests/map_while_ok_reduce/from_xap_chain.rs
  function map_while_ok_from_xap_chain_when_ok (line 4) | fn map_while_ok_from_xap_chain_when_ok() {
  function map_while_ok_from_xap_chain_when_error (line 38) | fn map_while_ok_from_xap_chain_when_error() {

FILE: tests/map_while_ok_reduce/from_xap_filter.rs
  function map_while_ok_from_xap_filter_when_ok (line 4) | fn map_while_ok_from_xap_filter_when_ok() {
  function map_while_ok_from_xap_filter_when_ok_but_none (line 24) | fn map_while_ok_from_xap_filter_when_ok_but_none() {
  function map_while_ok_from_xap_filter_when_error (line 44) | fn map_while_ok_from_xap_filter_when_error() {

FILE: tests/map_while_ok_reduce/from_xap_filter_map.rs
  function map_while_ok_from_xap_filter_map_when_ok (line 4) | fn map_while_ok_from_xap_filter_map_when_ok() {
  function map_while_ok_from_xap_filter_map_when_ok_but_none (line 24) | fn map_while_ok_from_xap_filter_map_when_ok_but_none() {
  function map_while_ok_from_xap_filter_map_when_error (line 44) | fn map_while_ok_from_xap_filter_map_when_error() {

FILE: tests/map_while_ok_reduce/from_xap_flat_map.rs
  function map_while_ok_from_xap_flat_map_when_ok (line 4) | fn map_while_ok_from_xap_flat_map_when_ok() {
  function map_while_ok_from_xap_flat_map_when_ok_but_none (line 24) | fn map_while_ok_from_xap_flat_map_when_ok_but_none() {
  function map_while_ok_from_xap_flat_map_when_error (line 44) | fn map_while_ok_from_xap_flat_map_when_error() {

FILE: tests/mut_iter.rs
  constant N (line 7) | const N: [usize; 2] = [37, 125];
  constant N (line 9) | const N: [usize; 2] = [1025, 4735];
  type Data (line 12) | struct Data {
  function to_output (line 17) | fn to_output(idx: usize) -> Data {
  function filter (line 23) | fn filter(data: &&mut Data) -> bool {
  function update (line 27) | fn update(data: &mut Data) {
  function mut_iter (line 39) | fn mut_iter(n: usize, nt: usize, chunk: usize) {
  function mut_slice (line 61) | fn mut_slice(n: usize, nt: usize, chunk: usize) {

FILE: tests/parallel_drainable.rs
  type VecAndRange (line 6) | struct VecAndRange(Vec<String>, Range<usize>);
    method new (line 9) | fn new(n: usize) -> VecAndRange {
  function parallel_drainable_vec (line 30) | fn parallel_drainable_vec(n: usize, nt: usize, chunk: usize) {

FILE: tests/parallelizable.rs
  function take_parallelizable (line 4) | fn take_parallelizable<T>(a: impl Parallelizable<Item = T>) {
  function vec_parallelizable (line 10) | fn vec_parallelizable() {
  function slice_parallelizable (line 16) | fn slice_parallelizable() {
  function range_parallelizable (line 23) | fn range_parallelizable() {
  function cloning_iter_parallelizable (line 29) | fn cloning_iter_parallelizable() {

FILE: tests/parallelizable_collection.rs
  function take_parallelizable_collection (line 3) | fn take_parallelizable_collection<T>(a: impl ParallelizableCollection<It...
  function vec_parallelizable_collection (line 9) | fn vec_parallelizable_collection() {

FILE: tests/test_groups.rs
  function fibonacci (line 7) | pub fn fibonacci(n: u64) -> u64 {

FILE: tests/trait_bounds.rs
  function trait_bounds_parallelizable (line 6) | fn trait_bounds_parallelizable() {
  function trait_bounds_parallelizable_collection (line 21) | fn trait_bounds_parallelizable_collection() {
  function trait_bounds_into_par_iter (line 34) | fn trait_bounds_into_par_iter() {

FILE: tests/using/rng.rs
  function random_walk (line 5) | fn random_walk(rng: &mut impl Rng, position: i64, num_steps: usize) -> i...
  function random_step (line 9) | fn random_step(rng: &mut impl Rng, position: i64) -> i64 {
  function input_positions (line 16) | fn input_positions() -> Vec<i64> {
  function using_rng_map (line 21) | fn using_rng_map() {
  function using_rng_xap (line 35) | fn using_rng_xap() {
  function using_rng_xap_long (line 51) | fn using_rng_xap_long() {

FILE: tests/whilst/collect.rs
  function par (line 11) | fn par(n: usize, nt: usize, c: usize, until_num_digits: usize, until_dig...
  function map (line 35) | fn map(n: usize, nt: usize, c: usize, until_num_digits: usize, until_dig...
  function xap_filter (line 59) | fn xap_filter(n: usize, nt: usize, c: usize, stop_at: &[&str], filter_ou...
  function xap_filter_map (line 84) | fn xap_filter_map(n: usize, nt: usize, c: usize, stop_at: &[&str], filte...
  function xap_flat_map (line 109) | fn xap_flat_map(n: usize, nt: usize, c: usize, stop_at: &[usize], stop_a...

FILE: tests/whilst/collect_arbitrary.rs
  function par (line 10) | fn par(n: usize, nt: usize, c: usize, until_num_digits: usize, until_dig...
  function map (line 34) | fn map(n: usize, nt: usize, c: usize, until_num_digits: usize, until_dig...
  function xap_filter (line 59) | fn xap_filter(
  function xap_filter_map (line 91) | fn xap_filter_map(
  function xap_flat_map (line 123) | fn xap_flat_map(

FILE: tests/whilst/find.rs
  function par (line 10) | fn par(n: usize, nt: usize, c: usize, stop_at: &[usize], find: &[usize],...
  function filter (line 33) | fn filter(
  function flat_map (line 64) | fn flat_map(

FILE: tests/whilst/reduce.rs
  function par (line 10) | fn par(n: usize, nt: usize, c: usize, stop_at: usize, expected_min: usiz...
  function www_map (line 29) | fn www_map(n: usize, nt: usize, c: usize, stop_at: usize, expected_min: ...
  function filter (line 51) | fn filter(n: usize, nt: usize, c: usize, stop_at: usize, expected_min: u...
  function flatmap (line 71) | fn flatmap(n: usize, nt: usize, c: usize, stop_at: usize, expected_min: ...