Searched refs:Interval (Results 1 - 25 of 60) sorted by relevance

123

/forgerock/openam-v13/openam-core/src/main/java/com/sun/identity/log/handlers/
H A DSecureFileHandler.java252 String Interval =
254 if ((Interval == null) || (Interval.length() == 0)) {
257 signInterval = Long.parseLong(Interval) * 1000;
747 String Interval =
749 if ((Interval == null) || (Interval.length() == 0)) {
752 signInterval = Long.parseLong(Interval) * 1000;
/forgerock/openam/openam-core/src/main/java/com/sun/identity/log/handlers/
H A DSecureFileHandler.java251 String Interval =
253 if ((Interval == null) || (Interval.length() == 0)) {
256 signInterval = Long.parseLong(Interval) * 1000;
746 String Interval =
748 if ((Interval == null) || (Interval.length() == 0)) {
751 signInterval = Long.parseLong(Interval) * 1000;
/inkscape/src/live_effects/
H A Dlpe-rough-hatches.h39 generateLevels(Geom::Interval const &domain, double x_org);
H A Dlpegroupbbox.h21 Geom::Interval boundingbox_X;
22 Geom::Interval boundingbox_Y;
/inkscape/src/
H A Dsp-hatch-path.h47 Geom::Interval bounds() const;
/inkscape/src/2geom/
H A Dbezier-clipping.cpp76 operator<< (std::basic_ostream<charT> & os, const Interval & I)
89 size_t get_precision(Interval const& I)
155 void map_to(Interval & J, Interval const& I)
250 void portion (std::vector<Point> & B , Interval const& I)
275 void iterate(std::vector<Interval>& domsA,
276 std::vector<Interval>& domsB,
279 Interval const& domA,
280 Interval const& domB,
358 * This bounds are returned through the output Interval paramete
[all...]
H A Dconcepts.h70 Interval dom;
93 /*With portion, Interval makes some sense, but instead I'm opting for
97 C) Interval version provided below
106 typedef typename ShapeTraits<T>::IntervalType Interval; typedef in struct:Geom::ShapeConcept
136 inline T portion(const T& t, const Interval& i) { return portion(t, i.min(), i.max()); }
H A Dcoord.h126 // NOTE: operator helpers for Rect and Interval are defined here.
157 typedef Interval IntervalType;
163 boost::equality_comparable< Interval
164 , boost::equality_comparable< Interval, IntInterval
165 , boost::additive< Interval
166 , boost::multipliable< Interval
167 , boost::orable< Interval
168 , boost::arithmetic< Interval, Coord
H A Dcurve.cpp129 Interval dom_i(prev_i, splits[i]);
134 Interval dom_j(prev_j, splits[j]);
H A Dcurve.h102 virtual Interval timeRange() const {
103 Interval tr(0, 1);
221 /** @brief A version of that accepts an Interval. */
222 Curve *portion(Interval const &i) const { return portion(i.min(), i.max()); }
250 /** @brief A version that takes an Interval. */
251 Coord nearestTime(Point const &p, Interval const &i) const {
263 /** @brief A version that takes an Interval. */
264 std::vector<Coord> allNearestTimes(Point const &p, Interval const &i) {
H A Dd2-sbasis.cpp303 static std::vector<Interval> intersect( std::vector<Interval> const &a, std::vector<Interval> const &b){
304 std::vector<Interval> result;
318 std::vector<Interval> level_set( D2<SBasis> const &f, Rect region){
322 std::vector<Interval> level_set( D2<SBasis> const &f, Point p, double tol){
327 std::vector<std::vector<Interval> > level_sets( D2<SBasis> const &f, std::vector<Rect> regions){
328 std::vector<Interval> regsX (regions.size(), Interval() );
329 std::vector<Interval> regs
[all...]
H A Dforward.h49 class Interval;
H A Dintersection.h111 typedef Interval IntervalType;
H A Dinterval.h58 class Interval class in namespace:Geom
66 Interval() {} function in class:Geom::Interval
68 explicit Interval(Coord u) : Base(u) {} function in class:Geom::Interval
70 Interval(Coord u, Coord v) : Base(u,v) {} function in class:Geom::Interval
72 Interval(IntInterval const &i) : Base(i.min(), i.max()) {} function in class:Geom::Interval
73 Interval(Base const &b) : Base(b) {} function in class:Geom::Interval
81 * @return Interval that contains all values from [start, end). */
83 static Interval from_range(InputIterator start, InputIterator end) {
84 Interval result = Base::from_range(start, end);
88 static Interval from_arra
[all...]
H A Dline.cpp174 Interval xpart(root(r[X].min(), X), root(r[X].max(), X));
175 Interval ypart(root(r[Y].min(), Y), root(r[Y].max(), Y));
288 Interval unit(0, 1);
301 Interval unit(0, 1);
H A Dlinear.h98 OptInterval bounds_exact() const { return Interval(a[0], a[1]); }
100 OptInterval bounds_local(double u, double v) const { return Interval(valueAt(u), valueAt(v)); }
H A Dpath-intersection.h67 Crossings pair_intersect(Curve const & A, Interval const &Ad,
68 Curve const & B, Interval const &Bd);
69 Crossings mono_intersect(Curve const & A, Interval const &Ad,
70 Curve const & B, Interval const &Bd);
H A Dpiecewise.cpp55 divi.setDomain(Interval(pa.cuts[i],pa.cuts[i+1]));
94 c0.setDomain(Interval(0.,.5));
95 c1.setDomain(Interval(.5,1.));
166 OptInterval g_range( Interval( g.at0(), g.at1() ));
187 SBasis g_portion = portion( g01, Interval(0.,.5) );
188 SBasis f_portion = portion( f, Interval(0.,.5) );
191 g_portion = portion( g01, Interval(.5, 1.) );
192 f_portion = portion( f, Interval(.5, 1.) );
231 std::vector<Interval> level_set(Piecewise<SBasis> const &f, Interval cons
[all...]
H A Dpiecewise.h219 inline Interval domain() const { return Interval(cuts.front(), cuts.back()); }
222 inline void setDomain(Interval dom) {
324 Interval const &m = *_m;
330 if(fi == ti) return bounds_local(f[fi], Interval(ft, tt));
332 typename FragmentConcept<T>::BoundsType ret(bounds_local(f[fi], Interval(ft, 1.)));
335 if(tt != 0.) ret.unionWith(bounds_local(f[ti], Interval(0., tt)));
776 Interval bs = *bounds_fast(g);
824 fgi.setDomain(Interval(g.cuts[i], g.cuts[i+1]));
897 std::vector<Interval> level_se
[all...]
H A Drect.h101 Rect(Interval const &a, Interval const &b) : Base(a,b) {}
244 if(r.empty()) return Rect(Interval(0,0), Interval(0,0));
H A Dsbasis-math.cpp172 sqrtf0.setDomain(Interval(0.,.5));
173 sqrtf1.setDomain(Interval(.5,1.));
196 sqrtfi.setDomain(Interval(ff.cuts[i],ff.cuts[i+1]));
226 cosfi.setDomain(Interval(f.cuts[i],f.cuts[i+1]));
265 c0.setDomain(Interval(0.,.5));
266 c1.setDomain(Interval(.5,1.));
282 Piecewise<SBasis> reciprocalOnDomain(Interval range, double tol){
H A Dsbasis-roots.cpp94 Interval result = Interval(a.at0(), a.at1());
104 Interval result = Interval(a.at0(), a.at1());
125 Interval res(0,0); // an empty sbasis is 0.
184 Interval res = Interval(lo,hi);
269 Interval bs = *bounds_local(df,Interval(a,b));
362 static bool compareIntervalMin( Interval
[all...]
H A Dsbasis.h419 inline SBasis portion(const SBasis &t, Interval const &ivl) { return portion(t, ivl.min(), ivl.max()); }
447 std::vector<double> roots(SBasis const & s, Interval const inside);
467 std::vector<Interval> level_set (SBasis const &f,
482 std::vector<Interval> level_set (SBasis const &f,
483 Interval const &level,
496 std::vector<std::vector<Interval> > level_sets (SBasis const &f,
510 std::vector<std::vector<Interval> > level_sets (SBasis const &f,
511 std::vector<Interval> const &levels,
H A Dsweeper.h55 Interval itemBounds(ItemIterator /*ii*/) { return Interval(); }
74 * - Interval itemBounds(iterator i) - given an iterator from the above range,
115 Interval b = _set.itemBounds(i);
H A Delliptical-arc.cpp143 Interval xival = Interval::from_range(coord[X], coord[X] + ncoord[X]);
144 Interval yival = Interval::from_range(coord[Y], coord[Y] + ncoord[Y]);
170 Interval unit_interval(0, 1);
569 Interval unit(0, 1);
841 Interval yspan(ymin[Y], ymax[Y]);
869 Interval ival(ymin[Y], fp[Y]);
875 Interval ival(ip[Y], fp[Y]);
881 Interval iva
[all...]

Completed in 85 milliseconds

123