problemo 0.0.12

Problemo
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
56

use super::{super::implementation::*, problem::*, weakly::*};

use std::cmp::*;

/// Iterate unique problems.
///
/// Equality is tested for using the first [CauseEquality](super::super::cause::CauseEquality) or
/// [CauseComparison](super::super::cause::CauseComparison) found in each problem.
///
/// See: [WeaklyComparableProblem].
pub fn iter_unique_problems<'problems, ProblemsT>(
    problems: ProblemsT,
) -> impl Iterator<Item = Problem>
where
    ProblemsT: IntoIterator<Item = Problem>,
{
    let mut problems: Vector<_> = problems.into_iter().map(WeaklyComparableProblem).collect();
    dedup(&mut problems);
    problems.into_iter().map(|problem| problem.0)
}

/// Iterate unique problem references.
///
/// Equality is tested for using the first [CauseEquality](super::super::cause::CauseEquality) or
/// [CauseComparison](super::super::cause::CauseComparison) found in each problem.
///
/// See: [WeaklyComparableProblemRef].
pub fn iter_unique_problem_refs<'problems, ProblemsT>(
    problems: ProblemsT,
) -> impl Iterator<Item = &'problems Problem>
where
    ProblemsT: IntoIterator<Item = &'problems Problem>,
{
    let mut problems: Vector<_> = problems
        .into_iter()
        .map(WeaklyComparableProblemRef)
        .collect();
    dedup(&mut problems);
    problems.into_iter().map(|problem| problem.0)
}

// Utils

fn dedup<ItemT>(vector: &mut Vector<ItemT>)
where
    ItemT: PartialEq,
{
    let length = vector.len();
    if length > 1 {
        for index in (1..length).rev() {
            if vector[0..index].contains(&vector[index]) {
                vector.remove(index);
            }
        }
    }
}