orx-split-vec 3.22.0

An efficient dynamic capacity vector with pinned element guarantees.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

use crate::Fragment;
use core::slice::Iter;

type Outer<'a, T> = Iter<'a, Fragment<T>>;
type Inner<'a, T> = Iter<'a, T>;

pub fn all<'a, T, F>(outer: &mut Outer<'a, T>, inner: &mut Inner<'a, T>, mut f: F) -> bool
where
    F: FnMut(&'a T) -> bool,
{
    match inner.all(&mut f) {
        false => false,
        true => !outer.any(|inner| !inner.iter().all(&mut f)),
    }
}

pub fn any<'a, T, F>(outer: &mut Outer<'a, T>, inner: &mut Inner<'a, T>, mut f: F) -> bool
where
    F: FnMut(&'a T) -> bool,
{
    match inner.any(&mut f) {
        true => true,
        false => outer.any(|inner| inner.iter().any(&mut f)),
    }
}

pub fn fold<'a, T, B, F>(outer: &mut Outer<'a, T>, inner: &mut Inner<'a, T>, init: B, mut f: F) -> B
where
    F: FnMut(B, &'a T) -> B,
{
    let res = inner.fold(init, &mut f);
    outer.fold(res, |res, inner| inner.iter().fold(res, &mut f))
}

pub fn reduce<'a, T, F>(
    outer: &mut Outer<'a, T>,
    inner: &mut Inner<'a, T>,
    mut f: F,
) -> Option<&'a T>
where
    F: FnMut(&'a T, &'a T) -> &'a T,
{
    match inner.len() {
        0 => match outer.next() {
            Some(inner) => inner
                .iter()
                .reduce(&mut f)
                .map(|res| outer.fold(res, |res, inner| inner.iter().fold(res, &mut f))),
            None => None,
        },
        _ => inner
            .reduce(&mut f)
            .map(|res| outer.fold(res, |res, inner| inner.iter().fold(res, &mut f))),
    }
}