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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201

use std::cmp::Ordering;
use std::hash::Hash;

use num::Integer;

use crate::interval::traits::Interval;
use crate::search::binary_search::BinarySearch;
use crate::set::ordered_integer_set::ContiguousIntegerSet;
use crate::set::traits::{Refineable, Set};
use crate::traits::SubsetIndexable;

pub struct OrderedIntervalPartitions<E: Integer + Copy> {
    partitions: Vec<ContiguousIntegerSet<E>>,
}

impl<E: Integer + Copy> OrderedIntervalPartitions<E> {
    pub fn from_vec(mut partitions: Vec<ContiguousIntegerSet<E>>)
        -> OrderedIntervalPartitions<E> {
        partitions.sort_by_key(|p| p.get_start());
        OrderedIntervalPartitions { partitions }
    }

    #[inline]
    pub fn from_vec_with_trusted_order(partitions: Vec<ContiguousIntegerSet<E>>)
        -> OrderedIntervalPartitions<E> {
        OrderedIntervalPartitions { partitions }
    }

    pub fn from_slice(slice: &[[E; 2]]) -> OrderedIntervalPartitions<E> {
        OrderedIntervalPartitions::from_vec(slice.iter()
                                                 .map(|s| ContiguousIntegerSet::new(s[0], s[1]))
                                                 .collect())
    }

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

    #[inline]
    pub fn get_partitions_by_ref(&self) -> &Vec<ContiguousIntegerSet<E>> {
        &self.partitions
    }

    #[inline]
    pub fn into_vec(self) -> Vec<ContiguousIntegerSet<E>> {
        self.partitions
    }
}

impl<E: Integer + Copy + Hash> SubsetIndexable<ContiguousIntegerSet<E>> for OrderedIntervalPartitions<E> {
    #[inline]
    fn get_set_containing(&self, subset: &ContiguousIntegerSet<E>) -> Option<ContiguousIntegerSet<E>> {
        match self.get_partition_containing(subset) {
            None => None,
            Some(s) => Some(s.1)
        }
    }
}

impl<E: Integer + Copy + Hash> OrderedIntervalPartitions<E> {
    /// if there is a partition containing the subinterval, returns a tuple `(partition_index, partition)`
    pub fn get_partition_containing(
        &self,
        subinterval: &ContiguousIntegerSet<E>,
    ) -> Option<(usize, ContiguousIntegerSet<E>)> {
        match self.partitions.binary_search_with_cmp(
            0, self.partitions.len(), subinterval, |interval, subinterval| {
                if subinterval.is_subset_of(interval) {
                    Ordering::Equal
                } else if interval.get_start() > subinterval.get_start() {
                    Ordering::Greater
                } else {
                    Ordering::Less
                }
            }) {
            Ok(i) => Some((i, self.partitions[i])),
            Err(_) => None
        }
    }
}

impl<E: Integer + Copy> Refineable<OrderedIntervalPartitions<E>> for OrderedIntervalPartitions<E> {
    /// # Example
    /// ```
    /// use analytic::partition::ordered_interval_partitions::OrderedIntervalPartitions;
    /// use analytic::set::traits::Refineable;
    /// use analytic::set::ordered_integer_set::ContiguousIntegerSet;
    /// let p1 = OrderedIntervalPartitions::from_slice(&[[-1, 4], [8, 10]]);
    /// let p2 = OrderedIntervalPartitions::from_slice(&[[3, 7]]);
    /// assert_eq!(p1.get_common_refinement(&p2).into_vec(), [[-1, 2], [3, 4], [5, 7], [8, 10]]
    ///                                               .iter()
    ///                                               .map(|[a, b]| ContiguousIntegerSet::new(*a, *b))
    ///                                               .collect::<Vec<ContiguousIntegerSet<i32>>>());
    /// ```
    fn get_common_refinement(&self, other: &OrderedIntervalPartitions<E>) -> OrderedIntervalPartitions<E> {
        let mut i = 0;
        let mut j = 0;
        let end_i = self.num_partitions();
        let end_j = other.num_partitions();
        let mut refinement = Vec::new();
        let mut lhs_remnant = None;
        let mut rhs_remnant = None;
        while i < end_i && j < end_j {
            let lhs = lhs_remnant.unwrap_or(self.partitions[i]);
            let rhs = rhs_remnant.unwrap_or(other.partitions[j]);
            match lhs.intersect(&rhs) {
                None => {
                    if lhs.get_start() <= rhs.get_start() {
                        refinement.push(lhs);
                        i += 1;
                        lhs_remnant = None;
                    } else {
                        refinement.push(rhs);
                        j += 1;
                        rhs_remnant = None;
                    }
                }
                Some(intersection) => {
                    if lhs.get_start() < intersection.get_start() {
                        refinement.push(
                            ContiguousIntegerSet::new(lhs.get_start(), intersection.get_start() - E::one())
                        );
                    }
                    if rhs.get_start() < intersection.get_start() {
                        refinement.push(
                            ContiguousIntegerSet::new(rhs.get_start(), intersection.get_start() - E::one())
                        );
                    }
                    refinement.push(intersection);
                    if lhs.get_end() > intersection.get_end() {
                        lhs_remnant = Some(
                            ContiguousIntegerSet::new(intersection.get_end() + E::one(), lhs.get_end())
                        );
                    } else {
                        lhs_remnant = None;
                        i += 1;
                    }
                    if rhs.get_end() > intersection.get_end() {
                        rhs_remnant = Some(
                            ContiguousIntegerSet::new(intersection.get_end() + E::one(), rhs.get_end())
                        );
                    } else {
                        rhs_remnant = None;
                        j += 1;
                    }
                }
            }
        }
        if let Some(r) = lhs_remnant {
            refinement.push(r);
            i += 1;
        }
        if let Some(r) = rhs_remnant {
            refinement.push(r);
            j += 1;
        }
        while i < end_i {
            refinement.push(self.partitions[i]);
            i += 1;
        }
        while j < end_j {
            refinement.push(other.partitions[j]);
            j += 1;
        }
        OrderedIntervalPartitions::from_vec_with_trusted_order(refinement)
    }
}

#[cfg(test)]
mod tests {
    use num::Integer;

    use crate::partition::ordered_interval_partitions::OrderedIntervalPartitions;
    use crate::set::ordered_integer_set::ContiguousIntegerSet;
    use crate::set::traits::Refineable;

    #[test]
    fn test_ordered_interval_partitions_common_refinement() {
        fn test<E: Integer + Copy + std::fmt::Debug>(a: &[[E; 2]], b: &[[E; 2]], expected: &[[E; 2]]) {
            let s1 = OrderedIntervalPartitions::from_slice(a);
            let s2 = OrderedIntervalPartitions::from_slice(b);
            let expected = expected.iter()
                                   .map(|[a, b]| ContiguousIntegerSet::new(*a, *b))
                                   .collect::<Vec<ContiguousIntegerSet<E>>>();
            assert_eq!(s1.get_common_refinement(&s2).into_vec(), expected);
            assert_eq!(s2.get_common_refinement(&s1).into_vec(), expected);
        }
        test::<usize>(&[], &[], &[]);
        test(&[[0usize, 4], [6, 10]], &[[1, 2], [4, 6]], &[[0, 0], [1, 2], [3, 3], [4, 4], [5, 5], [6, 6], [7, 10]]);
        test(&[[0usize, 5], [8, 10]], &[[6, 7], [11, 13]], &[[0, 5], [6, 7], [8, 10], [11, 13]]);
        test(&[[-1, 5]], &[[-2, 0]], &[[-2, -2], [-1, 0], [1, 5]]);
        test(&[[0usize, 10], [15, 23]], &[[3, 5], [20, 23]], &[[0, 2], [3, 5], [6, 10], [15, 19], [20, 23]]);
        test(&[[0usize, 10], [15, 23]], &[[3, 5], [15, 23]], &[[0, 2], [3, 5], [6, 10], [15, 23]]);
        test(&[[0usize, 10], [15, 23]], &[[3, 5], [15, 20]], &[[0, 2], [3, 5], [6, 10], [15, 20], [21, 23]]);
        test(&[[1, 100]], &[[3, 5], [23, 30]], &[[1, 2], [3, 5], [6, 22], [23, 30], [31, 100]]);
        test(&[[2usize, 6], [8, 12]], &[[0, 3], [5, 13]], &[[0, 1], [2, 3], [4, 4], [5, 6], [7, 7], [8, 12], [13, 13]]);
        test(&[[0usize, 3], [4, 8]], &[[2, 4]], &[[0, 1], [2, 3], [4, 4], [5, 8]]);
        test(&[[0usize, 4], [5, 7]], &[], &[[0, 4], [5, 7]]);
    }
}