algebraeon-sets 0.0.17

Algorithms in combinatorics.
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

use crate::structure::Signature;

use super::{EqSignature, SetSignature};
use std::fmt::Debug;

/// The set of Pairs
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct PairsStructure<S> {
    set: S,
}

impl<S: SetSignature> PairsStructure<S> {
    pub fn new(set: S) -> Self {
        Self { set }
    }

    /// Construct a new pair from two elements of a set
    pub fn new_pair(&self, a: S::Set, b: S::Set) -> Result<(S::Set, S::Set), String> {
        self.set.validate_element(&a)?;
        self.set.validate_element(&b)?;
        Ok((a, b))
    }
}

impl<S: SetSignature> Signature for PairsStructure<S> {}

impl<S: SetSignature> SetSignature for PairsStructure<S> {
    type Set = (S::Set, S::Set);

    fn validate_element(&self, x: &Self::Set) -> Result<(), String> {
        self.set.validate_element(&x.0)?;
        self.set.validate_element(&x.1)?;
        Ok(())
    }
}

impl<S: SetSignature + EqSignature> EqSignature for PairsStructure<S> {
    fn equal(&self, a: &Self::Set, b: &Self::Set) -> bool {
        self.set.equal(&a.0, &b.0) && self.set.equal(&a.1, &b.1)
    }
}

/// The set of unordered Pairs of distinct elements
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct UnorderedPairs<Set> {
    set: Set,
}

impl<Set: SetSignature> UnorderedPairs<Set> {
    pub fn new(set: Set) -> Self {
        Self { set }
    }
}

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct UnorderedPair<T>(T, T);

impl<S: SetSignature + EqSignature> UnorderedPairs<S> {
    pub fn new_pair(&self, a: &S::Set, b: &S::Set) -> Result<UnorderedPair<S::Set>, String> {
        if self.set.equal(a, b) {
            Err("UnorderedPair elements must be distinct".to_string())
        } else {
            Ok(UnorderedPair(a.clone(), b.clone()))
        }
    }
}

impl<S: SetSignature> Signature for UnorderedPairs<S> {}

impl<S: SetSignature + EqSignature> SetSignature for UnorderedPairs<S> {
    type Set = UnorderedPair<S::Set>;

    fn validate_element(&self, x: &Self::Set) -> Result<(), String> {
        self.set.validate_element(&x.0)?;
        self.set.validate_element(&x.1)?;
        if self.set.equal(&x.0, &x.1) {
            Err("UnorderedPair elements must be distinct".to_string())
        } else {
            Ok(())
        }
    }
}

impl<S: SetSignature + EqSignature> EqSignature for UnorderedPairs<S> {
    fn equal(&self, a: &Self::Set, b: &Self::Set) -> bool {
        self.set.equal(&a.0, &b.0) && self.set.equal(&a.1, &b.1)
            || self.set.equal(&a.0, &b.1) && self.set.equal(&a.1, &b.0)
    }
}