Lines Matching refs:DomainT
34 [[statically bounded] [asymmetric][__ro_itv__] [`<class DomainT, template<class>class Compar…
91 which is `interval<DomainT,Compare>::type`.
157 [/ CL [__itv__] [__itv__] [`<DomainT,Compare>`]]
158 [[__itv_bsets__][__itv_set__] [`<DomainT,Compare,IntervalT,Alloc>`]]
159 [[] [__sep_itv_set__][`<DomainT,Compare,IntervalT,Alloc>`]]
160 [[] [__spl_itv_set__][`<DomainT,Compare,IntervalT,Alloc>`]]
173 [[__itv__] [`DomainT`][`Compare = std::less`] [] []]
174 [[__itv_bsets__] [`DomainT`][`Compare = std::less`] [`IntervalT = interval<DomainT,Compa…
176 [/ [__icl_set__] [`DomainT`][`Compare = std::less`] [] [`All…
193 [[__itv_bmaps__][__itv_map__] [`<DomainT,CodomainT,Traits,Compare,Combine,Section,IntervalT,Allo…
194 [[] [__spl_itv_map__][`<DomainT,CodomainT,Traits,Compare,Combine,Section,IntervalT,Allo…
195 [[__icl_map__] [__icl_map__] [`<DomainT,CodomainT,Traits,Compare,Combine,Section,Alloc>`]]
209 …DomainT`][`CodomainT`] [`Traits = identity_absorber`] [`Compare = std::less`] [`Combine = in…
210 [[__icl_map__] [`DomainT`][`CodomainT`] [`Traits = identity_absorber`] [`Compare = std::less…
218 D := class DomainT,
260 … [`Intervals, Sets, Maps`][`typename`][`DomainT`] [] [For the typ…
261 [[] [] [`template`] [`Compare`] [`Compare<DomainT>`] …
272 [[`typename`][`DomainT`] [] [`Regular<DomainT> && LessThanCo…
273 … `&& (IsIncrementable<DomainT>||HasUnitElement<DomainT>)`] ]
274 …[] [`IsIntegral<DomainT>`] [`IsIncrementable<DomainT> && IsDe…
278 [[`template`][`Compare`] [] [`LessThanComparable<DomainT,Com…
284 [h4 Requirements on DomainT]
287 template parameter `DomainT`. Some requirements are dependent
289 functions that are expected for `DomainT`, if the default order
294 [[`DomainT`] [] [`DomainT(), <`] [`Regular<DomainT> && StrictWe…
295 …++, unit_element<CodomainT>::value()`][`&& (IsIncrementable<DomainT>||HasUnitElement<DomainT>)`] …
296 [[] [`IsIntegral<DomainT>`][`++, --`] [`IsIncrementable<DomainT> && …
299 A domain type `DomainT` for intervals and interval containers
305 *or* `HasUnitElement` is required for `DomainT`.
307 interval `[b,a]` where `a < b` (here `<` represents `Compare<DomainT>()`).
309 for any type `DomainT` we choose `[1,0]`, where `0` is a null-value or `identity_element`
312 interval() := [unit_element<DomainT>::value(), identity_element<DomainT>::value()] //pseudocode
315 `DomainT`. A `unit_element<T>::value()` is implemented
322 So a type `DomainT` that is `incrementable` will
336 [@http://en.wikipedia.org/wiki/Strict_weak_ordering strict weak ordering] on `DomainT`.
338 Finally, if `DomainT` is an integral type, `DomainT` needs to
347 one in- or decrementation, if `DomainT` is an integral type.
352 `DomainT` parameter. `IntervalT` has two associated types
359 if all `DomainT` elements of `x` are less than elements of `y` in the
364 [[`IntervalT`] [`exclusive_less`] [`IsExclusiveLessComparable<Interval<DomainT,Compare> >`] ]
454 D := class DomainT,
467 Xl := class ExclusiveLess = exclusive_less<Interval<DomainT,Compare> >