1 /* $XConsortium: ISet.C /main/1 1996/07/29 16:54:10 cde-hp $ */
2 // Copyright (c) 1994 James Clark
3 // See the file COPYING for copying permission.
5 #ifndef ISet_DEF_INCLUDED
6 #define ISet_DEF_INCLUDED 1
11 namespace SP_NAMESPACE {
25 ISet<T>::ISet(const T *v, size_t n)
27 for (size_t i = 0; i < n; i++)
32 Boolean ISet<T>::contains(T x) const
34 for (size_t i = 0; i < r_.size(); i++)
36 return r_[i].min <= x ? 1 : 0;
41 void ISet<T>::addRange(T min, T max)
47 for (i = r_.size(); i > 0 && min - 1 <= r_[i - 1].max; i--)
50 // r_[i - 1].max < min - 1 <= r_[i].max
51 if (i < r_.size() && (r_[i].min == 0 || max >= r_[i].min - 1)) {
55 if (max > r_[i].max) {
58 for (j = i + 1; j < r_.size() && r_[i].max >= r_[j].min - 1; j++)
59 r_[i].max = r_[j].max;
60 // get rid of i + 1 ... j - 1
62 for (size_t k = j; k < r_.size(); k++)
63 r_[k - (j - i - 1)] = r_[k];
64 r_.resize(r_.size() - (j - i - 1));
69 // r_[i - 1].max < min - 1
70 // max + 1 < r_[i].min
71 r_.resize(r_.size() + 1);
72 for (size_t j = r_.size() - 1; j > i; j--)
80 void ISet<T>::remove(T c)
82 for (size_t i = 0; i < r_.size(); i++)
85 if (r_[i].min == r_[i].max) {
86 while (++i < r_.size())
88 r_.resize(r_.size() - 1);
90 else if (c == r_[i].min)
92 else if (c == r_[i].max)
95 r_.resize(r_.size() + 1);
97 // subtracting 2 is safe since we know that the length is >= 2
98 for (size_t j = r_.size() - 2; j > i; j--)
100 r_[i + 1].max = r_[i].max;
101 r_[i + 1].min = c + 1;
110 void ISet<T>::check()
112 for (size_t i = 0; i < r_.size(); i++) {
113 if (r_[i].min > r_[i].max)
115 // adjacent ranges must be coalesced
116 if (i > 0 && r_[i].min - 1 <= r_[i - 1].max)
122 void ISet<T>::clear()
131 #endif /* not ISet_DEF_INCLUDED */