39 #ifndef FCL_CCD_INTERVAL_H 40 #define FCL_CCD_INTERVAL_H 43 #include "fcl/common/types.h" 102 bool intersect(
const Interval& other);
112 bool contains(S v)
const;
127 template <
typename S>
130 template <
typename S>
135 #include "fcl/math/motion/taylor_model/interval-inl.h" Interval & bound(S v)
Compute the minimum interval contains v and original interval.
Definition: interval-inl.h:378
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
S getAbsUpper() const
Return the farthest distance for points within the interval to zero.
Definition: interval-inl.h:361
Interval class for [a, b].
Definition: interval.h:50
bool overlap(const Interval &other) const
determine whether the intersection between intervals is empty
Definition: interval-inl.h:325
S getAbsLower() const
Return the nearest distance for points within the interval to zero.
Definition: interval-inl.h:352
void setValue(S a, S b)
construct interval [left, right]
Definition: interval-inl.h:82
Interval operator/(const Interval &other) const
other must not contain 0
Definition: interval-inl.h:310
S operator[](size_t i) const
access the interval endpoints: 0 for left, 1 for right end
Definition: interval-inl.h:96
bool operator==(const Interval &other) const
whether two intervals are the same
Definition: interval-inl.h:110
Interval operator+(const Interval &other) const
add two intervals
Definition: interval-inl.h:119