pecos-core 0.1.1

Provides core definitions and functions for PECOS simulations.
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

// Copyright 2024 The PECOS Developers
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
// in compliance with the License.You may obtain a copy of the License at
//
//     https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software distributed under the License
// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
// or implied. See the License for the specific language governing permissions and limitations under
// the License.

use crate::sets::vec_set::iterators::{Difference, Intersection, SymmetricDifference, Union};
use crate::VecSet;
use core::slice::Iter;

use crate::{Element, Set};

impl<'a, E: Element + 'a> Set<'a> for VecSet<E> {
    type Element = E;
    type Iter = Iter<'a, E>;
    type Difference = Difference<'a, E>;
    type Intersection = Intersection<'a, E>;
    type SymmetricDifference = SymmetricDifference<'a, E>;
    type Union = Union<'a, E>;

    #[inline]
    #[must_use]
    fn new() -> Self {
        Self::new()
    }

    #[inline]
    fn capacity(&self) -> usize {
        self.elements.capacity()
    }

    #[inline]
    fn clear(&mut self) {
        self.elements.clear();
    }

    #[inline]
    fn contains(&self, value: &E) -> bool {
        self.elements.contains(value)
    }

    #[inline]
    fn difference(&'a self, other: &'a Self) -> Self::Difference {
        Difference {
            iter: self.elements.iter(),
            other,
        }
    }

    #[inline]
    fn difference_ref(&'a self, other: &'a Self) -> Self::Difference {
        self.difference(other)
    }

    #[inline]
    fn insert(&mut self, value: E) {
        if !self.elements.contains(&value) {
            self.elements.push(value);
        }
    }

    #[inline]
    fn intersection(&'a self, other: &'a Self) -> Self::Intersection {
        if self.len() <= other.len() {
            Intersection {
                iter: self.iter(),
                other,
            }
        } else {
            Intersection {
                iter: other.iter(),
                other: self,
            }
        }
    }

    #[inline]
    fn is_empty(&self) -> bool {
        self.elements.is_empty()
    }

    #[inline]
    fn iter(&'a self) -> Self::Iter {
        self.elements.iter()
    }

    #[inline]
    fn len(&self) -> usize {
        self.elements.len()
    }

    #[inline]
    fn remove(&mut self, value: &E) {
        self.elements.retain(|&x| x != *value);
    }

    #[inline]
    fn retain<F>(&mut self, f: F)
    where
        F: FnMut(&E) -> bool,
    {
        self.elements.retain(f);
    }

    #[inline]
    fn symmetric_difference(&'a self, other: &'a Self) -> Self::SymmetricDifference {
        SymmetricDifference {
            iter: self.difference(other).chain(other.difference(self)),
        }
    }

    #[inline]
    fn symmetric_difference_update(&mut self, rhs: &Self) {
        let mut temp = Self::new();
        self.retain(|x| {
            if rhs.contains(x) {
                temp.insert(*x);
                false
            } else {
                true
            }
        });
        for item in &rhs.elements {
            if !temp.contains(item) {
                self.insert(*item);
            }
        }
    }

    #[inline]
    fn union(&'a self, other: &'a Self) -> Self::Union {
        if self.len() >= other.len() {
            Union {
                iter: self.iter().chain(other.difference(self)),
            }
        } else {
            Union {
                iter: other.iter().chain(self.difference(other)),
            }
        }
    }

    #[inline]
    fn union_update(&mut self, rhs: &Self) {
        for &item in &rhs.elements {
            self.insert(item);
        }
    }

    #[inline]
    #[must_use]
    fn with_capacity(capacity: usize) -> Self {
        Self {
            elements: Vec::with_capacity(capacity),
        }
    }
}