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

use crate::structure::orderings::PartialOrdSignature;

use super::{EqSignature, OrdSignature, SetSignature, Signature};
use std::fmt::Debug;
use std::marker::PhantomData;

pub struct EmptySetStructure<Set> {
    _set: PhantomData<Set>,
}

impl<Set> Clone for EmptySetStructure<Set> {
    fn clone(&self) -> Self {
        Self { _set: PhantomData }
    }
}

impl<Set> Debug for EmptySetStructure<Set> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("EmptySetStructure").finish()
    }
}

impl<Set> PartialEq for EmptySetStructure<Set> {
    fn eq(&self, _: &Self) -> bool {
        true
    }
}

impl<Set> Eq for EmptySetStructure<Set> {}

impl<Set> Default for EmptySetStructure<Set> {
    fn default() -> Self {
        Self { _set: PhantomData }
    }
}

impl<Set: Send + Sync> Signature for EmptySetStructure<Set> {}

impl<Set: Debug + Clone + Send + Sync> SetSignature for EmptySetStructure<Set> {
    type Set = Set;

    fn validate_element(&self, _: &Self::Set) -> Result<(), String> {
        Err("Empty set has no elements".to_string())
    }
}

impl<Set: Debug + Clone + Send + Sync> EqSignature for EmptySetStructure<Set> {
    fn equal(&self, _: &Self::Set, _: &Self::Set) -> bool {
        panic!("Empty set had no elements to compare for equality")
    }
}

impl<Set: Debug + Clone + Send + Sync> PartialOrdSignature for EmptySetStructure<Set> {
    fn partial_cmp(&self, a: &Self::Set, b: &Self::Set) -> Option<std::cmp::Ordering> {
        Some(self.cmp(a, b))
    }
}

impl<Set: Debug + Clone + Send + Sync> OrdSignature for EmptySetStructure<Set> {
    fn cmp(&self, _: &Self::Set, _: &Self::Set) -> std::cmp::Ordering {
        panic!("Empty set had no elements to compare for ordering")
    }
}