| /dports/net/vino/vino-3.22.0/server/libvncserver/ |
| H A D | rfbregion.c | 282 d_curr); in sraSpanListOr()
299 d_curr); in sraSpanListOr()
308 d_curr); in sraSpanListOr()
331 d_curr = d_curr->_next; in sraSpanListOr()
339 d_curr = d_curr->_next; in sraSpanListOr()
387 d_curr); in sraSpanListAnd()
419 d_curr=next; in sraSpanListAnd()
450 d_curr = d_curr->_next; in sraSpanListSubtract()
459 d_curr); in sraSpanListSubtract()
466 d_curr); in sraSpanListSubtract()
[all …]
|
| /dports/net/libvncserver/libvncserver-LibVNCServer-0.9.13/libvncserver/ |
| H A D | rfbregion.c | 298 d_curr); in sraSpanListOr()
315 d_curr); in sraSpanListOr()
324 d_curr); in sraSpanListOr()
347 d_curr = d_curr->_next; in sraSpanListOr()
355 d_curr = d_curr->_next; in sraSpanListOr()
403 d_curr); in sraSpanListAnd()
435 d_curr=next; in sraSpanListAnd()
466 d_curr = d_curr->_next; in sraSpanListSubtract()
475 d_curr); in sraSpanListSubtract()
482 d_curr); in sraSpanListSubtract()
[all …]
|
| /dports/math/cvc4/CVC4-1.7/src/theory/strings/ |
| H A D | type_enumerator.h | 37 Node d_curr; variable
40 d_curr = NodeManager::currentNM()->mkConst( ::CVC4::String( d_data ) ); in mkCurr()
52 Node operator*() override { return d_curr; }
82 bool isFinished() override { return d_curr.isNull(); } in isFinished()
90 Node d_curr; variable
93 d_curr = NodeManager::currentNM()->mkConst( ::CVC4::String( d_data ) ); in mkCurr()
104 Node operator*() { return d_curr; }
117 d_curr = Node::null();
124 bool isFinished() { return d_curr.isNull(); } in isFinished()
|
| /dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/ |
| H A D | geodesic.h | 248 const ScalarType &d_curr) in Distance() argument
262 s = (d_curr + d_pw1+ec_w1)/2; in Distance()
268 curr_d = d_curr + ew_c; in Distance()
281 curr_d = sqrt( pow(h,2)+ pow(d_curr + delta,2)); in Distance()
329 ScalarType curr_d,d_curr = 0.0,d_heap; variable
349 d_curr = TD[curr].d;
368 const ScalarType tol = (inter + d_curr + d_pw1)*.0001f;
371 (inter + d_curr < d_pw1 +tol ) ||
372 (inter + d_pw1 < d_curr +tol ) ||
388 if(d_curr > max_distance){
[all …]
|
| /dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/ |
| H A D | geodesic.h | 249 const ScalarType &d_curr) in Distance() argument
263 s = (d_curr + d_pw1+ec_w1)/2; in Distance()
269 curr_d = d_curr + ew_c; in Distance()
282 curr_d = sqrt( pow(h,2)+ pow(d_curr + delta,2)); in Distance()
330 ScalarType curr_d,d_curr = 0.0,d_heap; variable
350 d_curr = TD[curr].d;
369 const ScalarType tol = (inter + d_curr + d_pw1)*.0001f;
372 (inter + d_curr < d_pw1 +tol ) ||
373 (inter + d_pw1 < d_curr +tol ) ||
389 if(d_curr > max_distance){
[all …]
|
| /dports/math/cvc4/CVC4-1.7/src/theory/arith/ |
| H A D | matrix.h | 227 EntryID d_curr;
232 d_curr(start), d_entries(entries) in Iterator()
238 return d_curr; in getID()
243 return (*d_entries)[d_curr];
248 const MatrixEntry<T>& entry = (*d_entries)[d_curr];
249 d_curr = isRow ? entry.getNextRowEntryID() : entry.getNextColEntryID();
254 return d_curr == ENTRYID_SENTINEL; in atEnd()
258 return d_curr == i.d_curr && d_entries == i.d_entries;
262 return !(d_curr == i.d_curr && d_entries == i.d_entries);
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Nef_S2/ |
| H A D | SM_checker.h | 201 Direction d_curr = direction(hfit); in check_boundary_is_clockwise_weakly_polygon() local
202 if ( d_curr < d_prev ) ++winding_around_globally; in check_boundary_is_clockwise_weakly_polygon()
203 d_prev = d_curr; in check_boundary_is_clockwise_weakly_polygon()
|
| /dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/sygus/ |
| H A D | ce_guided_single_inv.cpp | 737 d_curr[i] = vals[i]; in increment()
751 for( unsigned i=0; i<d_curr.size(); i++ ){ in print()
752 Trace(c) << d_curr[i] << " "; in print()
1053 dt.d_curr.push_back( it->second[v] ); in initializeTrace()
1069 …riter::rewrite( cc.substitute( d_vars.begin(), d_vars.end(), dt.d_curr.begin(), dt.d_curr.end() ) … in incrementTrace()
1082 Assert( d_vars.size()==dt.d_curr.size() ); in incrementTrace()
1083 …writer::rewrite( c.substitute( d_vars.begin(), d_vars.end(), dt.d_curr.begin(), dt.d_curr.end() ) … in incrementTrace()
1103 Assert( d_vars.size()==dt.d_curr.size() ); in incrementTrace()
1104 …iter::rewrite( pvs.substitute( d_vars.begin(), d_vars.end(), dt.d_curr.begin(), dt.d_curr.end() ) … in incrementTrace()
|
| H A D | ce_guided_single_inv.h | 55 std::vector< Node > d_curr;
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Nef_2/ |
| H A D | PM_checker.h | 231 Direction d_curr = direction(hfit); in check_boundary_is_clockwise_weakly_polygon() local
232 if ( d_curr < d_prev ) ++winding_around_globally; in check_boundary_is_clockwise_weakly_polygon()
233 d_prev = d_curr; in check_boundary_is_clockwise_weakly_polygon()
|
| /dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/ |
| H A D | inst_propagator.cpp | 600 d_curr = body; in init()
710 Node eval = d_qy.evaluateTermExp( ii.d_curr, exp, visited, true, true, watch_list_out, props ); in update()
714 }else if( firstTime || eval!=ii.d_curr ){ in update()
719 Trace("qip-prop") << "...updated lemma " << ii.d_curr << " -> " << eval << std::endl; in update()
764 ii.d_curr = eval; in update()
766 …ip-prop-debug") << "...updating watch list for [" << id << "], curr is " << ii.d_curr << std::endl; in update()
|
| H A D | inst_propagator.h | 152 Node d_curr; variable
|
| /dports/graphics/blender/blender-2.91.0/source/blender/blenlib/intern/ |
| H A D | math_geom.c | 4218 cross_v3_v3v3(cross, d_curr->dir, d_next->dir); in mean_value_half_tan_v3()
4223 const float len = d_curr->len * d_next->len; in mean_value_half_tan_v3()
4249 const double len = d_curr->len * d_next->len; in mean_value_half_tan_v2_db()
4279 struct Float3_Len d_curr, d_next; in interp_weights_poly_v3() local
4288 DIR_V3_SET(&d_curr, v_curr - 3 /* v[n - 2] */, co); in interp_weights_poly_v3()
4290 ht_prev = mean_value_half_tan_v3(&d_curr, &d_next); in interp_weights_poly_v3()
4307 d_curr = d_next; in interp_weights_poly_v3()
4309 ht = mean_value_half_tan_v3(&d_curr, &d_next); in interp_weights_poly_v3()
4310 w[i_curr] = (ht_prev + ht) / d_curr.len; in interp_weights_poly_v3()
4364 struct Double2_Len d_curr, d_next; in interp_weights_poly_v2() local
[all …]
|
| /dports/math/py-mathics/Mathics3-2.2.0/mathics/builtin/ |
| H A D | strings.py | 2674 d_curr = list(row(d_prev_prev, d_prev, i, prev_c1, c1, 1))
2676 d_prev = d_curr
|