Searched refs:IntervalSet (Results 1 - 7 of 7) sorted by relevance
/third_party/cups-filters/filter/pdftopdf/ |
H A D | intervalset.cc | 7 const IntervalSet::key_t IntervalSet::npos=std::numeric_limits<IntervalSet::key_t>::max(); 9 void IntervalSet::clear() // {{{ in clear() 15 void IntervalSet::add(key_t start,key_t end) // {{{ in add() 23 void IntervalSet::finish() // {{{ in finish() 52 bool IntervalSet::contains(key_t val) const // {{{ in contains() 63 IntervalSet::key_t IntervalSet::next(key_t val) const // {{{ in next() 85 bool IntervalSet [all...] |
H A D | intervalset.h | 7 class IntervalSet { class
|
H A D | pdftopdf_processor.h | 79 IntervalSet pageRange;
|
H A D | pdftopdf.cc | 237 static void parseRanges(const char *range,IntervalSet &ret) // {{{ in parseRanges()
|
/third_party/rust/crates/regex/regex-syntax/src/hir/ |
H A D | interval.rs | 36 pub struct IntervalSet<I> { structure names 40 impl<I: Interval> IntervalSet<I> { impls 46 pub fn new<T: IntoIterator<Item = I>>(intervals: T) -> IntervalSet<I> { in new() 47 let mut set = IntervalSet { ranges: intervals.into_iter().collect() }; in new() 95 pub fn union(&mut self, other: &IntervalSet<I>) { in union() 102 pub fn intersect(&mut self, other: &IntervalSet<I>) { in intersect() 140 pub fn difference(&mut self, other: &IntervalSet<I>) { in difference() 238 pub fn symmetric_difference(&mut self, other: &IntervalSet<I>) { in symmetric_difference()
|
H A D | mod.rs | 12 use crate::hir::interval::{Interval, IntervalSet, IntervalSetIter}; 838 set: IntervalSet<ClassUnicodeRange>, 850 ClassUnicode { set: IntervalSet::new(ranges) } in new() 1081 set: IntervalSet<ClassBytesRange>, 1093 ClassBytes { set: IntervalSet::new(ranges) } in new()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 325 using IntervalSet = std::set<IntervalInfo, decltype(&lowestEndPoint)>; 329 IntervalSet Active(lowestEndPoint); 346 IntervalSet::iterator RetireItr = Active.begin();
|
Completed in 8 milliseconds