163             if other.ranges[b].upper() < self.ranges[a].lower() {  in difference()
169             if self.ranges[a].upper() < other.ranges[b].lower() {  in difference()
265         if self.ranges[0].lower() > I::Bound::min_value() {  in negate()
266             let upper = self.ranges[0].lower().decrement();  in negate()
270             let lower = self.ranges[i - 1].upper().increment();  in negate()  localVariable
271             let upper = self.ranges[i].lower().decrement();  in negate()
272             self.ranges.push(I::create(lower, upper));  in negate()
275             let lower = self.ranges[drain_end - 1].upper().increment();  in negate()  localVariable
276             self.ranges.push(I::create(lower, I::Bound::max_value()));  in negate()
340     fn lower(&self) -> Self::Bound;  in lower()  method
350     fn create(lower: Self::Bound, upper: Self::Bound) -> Self {  in create()
352         if lower <= upper {  in create()
353             int.set_lower(lower);  in create()
357             int.set_upper(lower);  in create()
369         let lower = cmp::min(self.lower(), other.lower());  in union()  localVariable
371         Some(Self::create(lower, upper))  in union()
378         let lower = cmp::max(self.lower(), other.lower());  in intersect()  localVariable
380         if lower <= upper {  in intersect()
381             Some(Self::create(lower, upper))  in intersect()
399         let add_lower = other.lower() > self.lower();  in difference()
406             let upper = other.lower().decrement();  in difference()
407             ret.0 = Some(Self::create(self.lower(), upper));  in difference()
410             let lower = other.upper().increment();  in difference()  localVariable
411             let range = Self::create(lower, self.upper());  in difference()
442         let lower1 = self.lower().as_u32();  in is_contiguous()
444         let lower2 = other.lower().as_u32();  in is_contiguous()
452         let (lower1, upper1) = (self.lower(), self.upper());  in is_intersection_empty()
453         let (lower2, upper2) = (other.lower(), other.upper());  in is_intersection_empty()
459         let (lower1, upper1) = (self.lower(), self.upper());  in is_subset()
460         let (lower2, upper2) = (other.lower(), other.upper());  in is_subset()