Home
last modified time | relevance | path

Searched refs:bound1 (Results 1 – 25 of 931) sorted by relevance

12345678910>>...38

/dports/math/clingo/clingo-5.5.1/libgringo/tests/input/
H A Daggregate.cc226 auto a1(bdaggr(NAF::POS, AggregateFunction::SUM, bound1(), bdvec1()));
227 auto a2(bdaggr(NAF::POS, AggregateFunction::SUM, bound1(), bdvec2()));
228 auto a3(bdaggr(NAF::NOT, AggregateFunction::SUM, bound1(), bdvec1()));
262 auto d1(hdaggr(AggregateFunction::SUM, bound1(), hdvec1()));
263 auto d2(hdaggr(AggregateFunction::SUM, bound1(), hdvec2()));
272 auto e1(hdaggr(AggregateFunction::SUM, bound1(), condvec1()));
273 auto e2(hdaggr(AggregateFunction::SUM, bound1(), condvec2()));
327 auto d1(hdaggr(AggregateFunction::SUM, bound1(), hdvec1()));
328 auto d2(hdaggr(AggregateFunction::SUM, bound1(), hdvec2()));
337 auto e1(hdaggr(AggregateFunction::SUM, bound1(), condvec1()));
[all …]
/dports/databases/postgis31/postgis-3.1.4/deps/wagyu/include/mapbox/geometry/wagyu/
H A Dintersect.hpp20 bound_ptr<T> bound1; member
25 : bound1(std::move(n.bound1)), bound2(std::move(n.bound2)), pt(std::move(n.pt)) { in intersect_node()
29 bound1 = std::move(n.bound1); in operator =()
36 : bound1(bound1_), bound2(bound2_), pt(pt_) { in intersect_node()
50 out << *e.bound1 << std::endl; in operator <<()
/dports/databases/postgis30/postgis-3.0.4/deps/wagyu/include/mapbox/geometry/wagyu/
H A Dintersect.hpp20 bound_ptr<T> bound1; member
25 : bound1(std::move(n.bound1)), bound2(std::move(n.bound2)), pt(std::move(n.pt)) { in intersect_node()
29 bound1 = std::move(n.bound1); in operator =()
36 : bound1(bound1_), bound2(bound2_), pt(pt_) { in intersect_node()
50 out << *e.bound1 << std::endl; in operator <<()
/dports/databases/postgis32/postgis-3.2.0/deps/wagyu/include/mapbox/geometry/wagyu/
H A Dintersect.hpp20 bound_ptr<T> bound1; member
25 : bound1(std::move(n.bound1)), bound2(std::move(n.bound2)), pt(std::move(n.pt)) { in intersect_node()
29 bound1 = std::move(n.bound1); in operator =()
36 : bound1(bound1_), bound2(bound2_), pt(pt_) { in intersect_node()
50 out << *e.bound1 << std::endl; in operator <<()
/dports/science/py-dlib/dlib-19.22/dlib/global_optimization/
H A Dfind_max_global.h433 const matrix<double,0,1>& bound1,
450 const matrix<double,0,1>& bound1,
468 const matrix<double,0,1>& bound1,
486 const matrix<double,0,1>& bound1,
508 const matrix<double,0,1>& bound1,
526 const matrix<double,0,1>& bound1,
545 const matrix<double,0,1>& bound1,
584 const double bound1,
600 const double bound1,
617 const double bound1,
[all …]
/dports/science/dlib-cpp/dlib-19.22/dlib/global_optimization/
H A Dfind_max_global.h433 const matrix<double,0,1>& bound1,
450 const matrix<double,0,1>& bound1,
468 const matrix<double,0,1>& bound1,
486 const matrix<double,0,1>& bound1,
508 const matrix<double,0,1>& bound1,
526 const matrix<double,0,1>& bound1,
545 const matrix<double,0,1>& bound1,
584 const double bound1,
600 const double bound1,
617 const double bound1,
[all …]
/dports/science/py-dlib/dlib-19.22/tools/python/src/
H A Dglobal_optimization.cpp114 py::list bound1, in py_find_max_global() argument
121 DLIB_CASSERT(len(bound1) == len(bound2)); in py_find_max_global()
122 DLIB_CASSERT(len(bound1) == len(is_integer_variable)); in py_find_max_global()
129 auto result = find_max_global(func, list_to_mat(bound1), list_to_mat(bound2), in py_find_max_global()
138 py::list bound1, in py_find_max_global2() argument
144 DLIB_CASSERT(len(bound1) == len(bound2)); in py_find_max_global2()
160 py::list bound1, in py_find_min_global() argument
167 DLIB_CASSERT(len(bound1) == len(bound2)); in py_find_min_global()
168 DLIB_CASSERT(len(bound1) == len(is_integer_variable)); in py_find_min_global()
184 py::list bound1, in py_find_min_global2() argument
[all …]
/dports/science/dlib-cpp/dlib-19.22/tools/python/src/
H A Dglobal_optimization.cpp114 py::list bound1, in py_find_max_global() argument
121 DLIB_CASSERT(len(bound1) == len(bound2)); in py_find_max_global()
122 DLIB_CASSERT(len(bound1) == len(is_integer_variable)); in py_find_max_global()
129 auto result = find_max_global(func, list_to_mat(bound1), list_to_mat(bound2), in py_find_max_global()
138 py::list bound1, in py_find_max_global2() argument
144 DLIB_CASSERT(len(bound1) == len(bound2)); in py_find_max_global2()
160 py::list bound1, in py_find_min_global() argument
167 DLIB_CASSERT(len(bound1) == len(bound2)); in py_find_min_global()
168 DLIB_CASSERT(len(bound1) == len(is_integer_variable)); in py_find_min_global()
184 py::list bound1, in py_find_min_global2() argument
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Linq.Expressions/tests/Array/
H A DNewArrayBoundsTests.cs255 Expression bound1 = Expression.Constant(3); in UpdateSameReturnsSame()
256 … NewArrayExpression newArrayExpression = Expression.NewArrayBounds(typeof(string), bound0, bound1); in UpdateSameReturnsSame()
257 Assert.Same(newArrayExpression, newArrayExpression.Update(new [] {bound0, bound1})); in UpdateSameReturnsSame()
264 Expression bound1 = Expression.Constant(3); in UpdateDifferentReturnsDifferent()
265 … NewArrayExpression newArrayExpression = Expression.NewArrayBounds(typeof(string), bound0, bound1); in UpdateDifferentReturnsDifferent()
267 …t.NotSame(newArrayExpression, newArrayExpression.Update(new[] { bound0, bound1, bound0, bound1 })); in UpdateDifferentReturnsDifferent()
275 Expression bound1 = Expression.Constant(3); in UpdateDoesntRepeatEnumeration()
276 … NewArrayExpression newArrayExpression = Expression.NewArrayBounds(typeof(string), bound0, bound1); in UpdateDoesntRepeatEnumeration()
284 Expression bound1 = Expression.Constant(3); in UpdateNullThrows()
285 … NewArrayExpression newArrayExpression = Expression.NewArrayBounds(typeof(string), bound0, bound1); in UpdateNullThrows()
/dports/cad/opencascade/opencascade-7.6.0/tests/bugs/modalg_7/
H A Dbug2660414 restore [locate_data_file bug26604_bound1.brep] bound1
18 mkcurve b1 bound1
26 display bound1
37 vdisplay bound1
/dports/graphics/pixen/Pixen-0.1/
H A DKTMatrix.h130 + (id)matrixWithCuboidBounds:(unsigned)bound1,...;
131 + (id)matrixWithCuboidBoundsObjectAtCoordinates:(unsigned)bound1,...;
132 + (id)matrixWithCuboidBoundsObjectsAtCoordinateArrays:(unsigned)bound1,...;
133 + (id)matrixWithCuboidBoundsObjectsAtCoordinates:(unsigned)bound1,...;
186 - (id)initWithCuboidBounds:(unsigned)bound1,...;
187 - (id)initWithCuboidBoundsObjectAtCoordinates:(unsigned)bound1,...;
188 - (id)initWithCuboidBoundsObjectsAtCoordinateArrays:(unsigned)bound1,...;
189 - (id)initWithCuboidBoundsObjectsAtCoordinates:(unsigned)bound1,...;
H A DKTPlaceholderMatrix.m71 - (id)initWithCuboidBoundsObjectAtCoordinates:(unsigned)bound1,...
80 va_start(args, bound1);
82 initWithBoundsList:bound1 :&args];
98 - (id)initWithCuboidBoundsObjectsAtCoordinates:(unsigned)bound1,...
116 va_start(args, bound1);
118 initWithBoundsList:bound1 :&args];
H A DKTPlaceholderMutableMatrix.m77 - (id)initWithCuboidBoundsObjectAtCoordinates:(unsigned)bound1,...
86 va_start(args, bound1);
88 initWithBoundsList:bound1 :&args];
104 - (id)initWithCuboidBoundsObjectsAtCoordinates:(unsigned)bound1,...
122 va_start(args, bound1);
124 initWithBoundsList:bound1 :&args];
/dports/math/cgal/CGAL-5.3/include/CGAL/QP_solver/
H A DQP__filtered_base_impl.h155 bound1 = d_NT * row_max_c; in update_maxima()
190 if ( z > bound1) bound1 = z; in update_maxima()
204 bound1 *= q; in update_maxima()
209 << "first bound for certification: " << bound1 << std::endl; in update_maxima()
247 if ( z > bound1) bound1 = z; in update_maxima()
280 if ( mu >= bound1) { in certify_mu_j_NT()
321 NT bound1_with_w = bound1 + (d_NT * w_j_NT_abs * q); in certify_mu_j_NT()
/dports/net-mgmt/darkstat/darkstat-3.0.719/
H A Dhttp.c460 size_t bound1, bound2; in parse_field() local
467 bound1 = pos - conn->request + strlen(field); in parse_field()
470 for (bound2 = bound1; in parse_field()
476 return (split_string(conn->request, bound1, bound2)); in parse_field()
489 size_t bound1, bound2, mid; in parse_request() local
493 for (bound1 = 0; bound1 < conn->request_length && in parse_request()
494 conn->request[bound1] != ' '; bound1++) in parse_request()
498 strntoupper(conn->method, bound1); in parse_request()
501 for (; bound1 < conn->request_length && in parse_request()
502 conn->request[bound1] == ' '; bound1++) in parse_request()
[all …]
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/rectangle_tree/
H A Dminimal_coverage_sweep_impl.hpp65 BoundType bound1(node->Bound().Dim()); in SweepNonLeafNode() local
70 bound1 |= node->Child(sorted[i].second).Bound(); in SweepNonLeafNode()
79 ElemType area1 = bound1.Volume(); in SweepNonLeafNode()
121 BoundType bound1(node->Bound().Dim()); in SweepLeafNode() local
126 bound1 |= node->Dataset().col(node->Point(sorted[i].second)); in SweepLeafNode()
134 return bound1.Volume() + bound2.Volume(); in SweepLeafNode()
/dports/graphics/pixen/Pixen-0.1/KTMatrix [imp]/
H A DKTPlaceholderMatrix.m71 - (id)initWithCuboidBoundsObjectAtCoordinates:(unsigned)bound1,...
80 va_start(args, bound1);
82 initWithBoundsList:bound1 :&args];
98 - (id)initWithCuboidBoundsObjectsAtCoordinates:(unsigned)bound1,...
116 va_start(args, bound1);
118 initWithBoundsList:bound1 :&args];
H A DKTPlaceholderMutableMatrix.m77 - (id)initWithCuboidBoundsObjectAtCoordinates:(unsigned)bound1,...
86 va_start(args, bound1);
88 initWithBoundsList:bound1 :&args];
104 - (id)initWithCuboidBoundsObjectsAtCoordinates:(unsigned)bound1,...
122 va_start(args, bound1);
124 initWithBoundsList:bound1 :&args];
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/include/uhd/utils/
H A Dalgorithm.hpp81 UHD_INLINE T clip(const T& val, const T& bound1, const T& bound2) in clip() argument
83 const T minimum = std::min(bound1, bound2); in clip()
86 const T maximum = std::max(bound1, bound2); in clip()
/dports/math/cgal/CGAL-5.3/include/CGAL/Arr_geometry_traits/
H A DBezier_bounding_rational_traits.h208 bound1(), in Intersection_point()
217 bound1 (_bound1), in Intersection_point()
355 if (! in_pt.bound1.can_refine || ! in_pt.bound2.can_refine) in refine_intersection_point()
363 if (in_pt.bound1.type == Bez_point_bound::RATIONAL_PT || in refine_intersection_point()
372 const Control_points& cp1 = in_pt.bound1.ctrl; in refine_intersection_point()
373 const NT& t_min1 = in_pt.bound1.t_min; in refine_intersection_point()
374 const NT& t_max1 = in_pt.bound1.t_max; in refine_intersection_point()
387 ref_pt.bound1.can_refine = false; in refine_intersection_point()
430 ref_pt = Intersection_point (bound1, bound2, ref_bbox); in refine_intersection_point()
671 const Control_points& cp1 = bound1.ctrl; in compare_slopes_at_intersection_point()
[all …]
/dports/games/tesseract-data/tesseract/src/engine/
H A Dgrass.cpp15 plane bound1, bound2; member
22 bound1(vec(2*M_PI*(i/float(NUMGRASSWEDGES) - 0.25f), 0), 0), in grasswedge()
25 across.div(-across.dot(bound1)); in grasswedge()
121 leftb = w.bound1.dist(leftp); in gengrassquads()
122 leftdb = w.bound1.dot(leftdir); in gengrassquads()
146 if(w.bound1.dist(p2) >= 0) continue; in gengrassquads()
211 if(w.bound1.dist(g.center) > g.radius || w.bound2.dist(g.center) > g.radius) continue; in gengrassquads()
229 w.bound1.offset = -camera1->o.dot(w.bound1); in generategrass()
/dports/games/tesseract/tesseract/src/engine/
H A Dgrass.cpp15 plane bound1, bound2; member
22 bound1(vec(2*M_PI*(i/float(NUMGRASSWEDGES) - 0.25f), 0), 0), in grasswedge()
25 across.div(-across.dot(bound1)); in grasswedge()
121 leftb = w.bound1.dist(leftp); in gengrassquads()
122 leftdb = w.bound1.dot(leftdir); in gengrassquads()
146 if(w.bound1.dist(p2) >= 0) continue; in gengrassquads()
211 if(w.bound1.dist(g.center) > g.radius || w.bound2.dist(g.center) > g.radius) continue; in gengrassquads()
229 w.bound1.offset = -camera1->o.dot(w.bound1); in generategrass()
/dports/games/sauerbraten/sauerbraten/src/engine/
H A Dgrass.cpp17 plane bound1, bound2; member
25 bound1(vec(2*M_PI*(i/float(NUMGRASSWEDGES) - 0.25f), 0), 0), in grasswedge()
28 across.div(-across.dot(bound1)); in grasswedge()
30 bvec vertbound1(bound1), vertbound2(bound2); in grasswedge()
134 leftb = w.bound1.dist(leftp); in gengrassquads()
135 leftdb = w.bound1.dot(leftdir); in gengrassquads()
159 if(w.bound1.dist(p2) >= grassmargin) continue; in gengrassquads()
230 …if(w.bound1.dist(g.center) > g.radius + grassmargin || w.bound2.dist(g.center) > g.radius + grassm… in gengrassquads()
254 w.bound1.offset = -camera1->o.dot(w.bound1); in generategrass()
/dports/emulators/mess/mame-mame0226/src/mame/machine/
H A Dsegaic16.cpp421 const s16 bound1 = s16(m_regs[0]); in execute() local
425 const s16 min = (bound1 < bound2) ? bound1 : bound2; in execute()
426 const s16 max = (bound1 > bound2) ? bound1 : bound2; in execute()
/dports/emulators/mame/mame-mame0226/src/mame/machine/
H A Dsegaic16.cpp421 const s16 bound1 = s16(m_regs[0]); in execute() local
425 const s16 min = (bound1 < bound2) ? bound1 : bound2; in execute()
426 const s16 max = (bound1 > bound2) ? bound1 : bound2; in execute()

12345678910>>...38