/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_2/ |
H A D | Construct_storage_site_2.h | 166 Storage_site_2 supp1 = p.supporting_site(0); in split_on_point_first_subsegment() local 171 if ( are_parallel(supp0.site(), supp1.site()) ) { in split_on_point_first_subsegment() 172 supp1 = p.supporting_site(1); in split_on_point_first_subsegment() 190 Storage_site_2 supp1 = p.supporting_site(0); in split_on_point_first_subsegment() local 195 if ( are_parallel(supp0.site(), supp1.site()) ) { in split_on_point_first_subsegment() 196 supp1 = p.supporting_site(1); in split_on_point_first_subsegment() 223 Storage_site_2 supp1 = p.supporting_site(0); in split_on_point_second_subsegment() local 228 if ( are_parallel(supp0.site(), supp1.site()) ) { in split_on_point_second_subsegment() 229 supp1 = p.supporting_site(1); in split_on_point_second_subsegment() 247 Storage_site_2 supp1 = p.supporting_site(0); in split_on_point_second_subsegment() local [all …]
|
/dports/math/fcl/fcl-0.7.0/src/narrowphase/detail/convexity_based_algorithm/ |
H A D | gjk_libccd.cpp | 91 ccd_support_fn supp1, 106 ccd_support_fn supp1, 118 ccd_support_fn supp1,
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bvpl/kernels/ |
H A D | bvpl_gauss3d_x_kernel_factory.cxx | 28 bvpl_gauss3d_x_kernel_factory::bvpl_gauss3d_x_kernel_factory(float s1, float s2, float supp1, float… 34 supp1_ = supp1; 53 …actory::bvpl_gauss3d_x_kernel_factory(float s1, float s2, float s3, float supp1, float supp2, floa… in bvpl_gauss3d_x_kernel_factory() argument 59 supp1_ = supp1; in bvpl_gauss3d_x_kernel_factory()
|
H A D | bvpl_gauss3d_kernel_factory.cxx | 47 bvpl_gauss3d_kernel_factory::bvpl_gauss3d_kernel_factory(float s1, float s2, float s3,float supp1 ,… in bvpl_gauss3d_kernel_factory() argument 53 supp1_ = supp1; in bvpl_gauss3d_kernel_factory()
|
H A D | bvpl_gauss3d_kernel_factory.h | 35 …bvpl_gauss3d_kernel_factory(float s1, float s2, float s3,float supp1 = 2.0, float supp2 = 1.0, flo…
|
/dports/math/4ti2/4ti2-Release_1_6_9/src/groebner/ |
H A D | OnesTree.tpp | 143 OnesTreeBranch<IndexSet>::find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, co… 150 if (supp1[nodes[i].first]) { --temp_diff1; } 154 nodes[i].second->find_diff(indices, supp1, temp_diff1, supp2, temp_diff2); 157 if (supp1[nodes[i].first]) 165 nodes[i].second->find_diff(indices, supp1, diff1-1, supp2, diff2-1); 170 nodes[i].second->find_diff(indices, supp1, diff1-1, supp2, diff2); 180 nodes[i].second->find_diff(indices, supp1, diff1, supp2, diff2-1); 185 nodes[i].second->find_diff(indices, supp1, diff1, supp2, diff2); 262 OnesTreeLeaf<IndexSet>::find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, cons… 336 OnesTree<IndexSet>::find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, const In… [all …]
|
H A D | OnesTree.h | 44 …virtual void find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, const IndexSet… 63 …virtual void find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, const IndexSet… 82 …virtual void find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, const IndexSet… 104 …void find_diff(std::vector<int>& indices, const IndexSet& supp1, int diff1, const IndexSet& supp2,…
|
H A D | SupportTree.h | 50 const IndexSet& supp1, int diff1, 73 const IndexSet& supp1, int diff1, 156 const IndexSet& supp1, int diff1, in find_diff() argument 159 find_diff(root, indices, supp1, diff1, supp2, diff2); in find_diff()
|
H A D | SupportTree.tpp | 228 const IndexSet& supp1, int diff1, 238 if (supp1[nodes[i].first]) { --temp_diff1; } 242 nodes[i].second->find_diff(indices, supp1, temp_diff1, supp2, temp_diff2); 245 if (supp1[node.nodes[i].first]) 253 … find_diff(*node.nodes[i].second, indices, supp1, diff1-1, supp2, diff2-1); 258 find_diff(*node.nodes[i].second, indices, supp1, diff1-1, supp2, diff2); 268 find_diff(*node.nodes[i].second, indices, supp1, diff1, supp2, diff2-1); 273 find_diff(*node.nodes[i].second, indices, supp1, diff1, supp2, diff2);
|
/dports/math/singular/Singular-Release-4-2-1/IntegerProgramming/ |
H A D | Buchberger.cc | 140 int supp_union=supp1|supp2; in unnecessary_S_pair() 160 if(actual_list==supp1) in unnecessary_S_pair() 295 int supp_union=supp1|supp2; in unnecessary_S_pair() 326 if(supp1==supp2) in unnecessary_S_pair() 330 iter.set_to_list(generators[supp1]); in unnecessary_S_pair() 347 iter.set_to_list(generators[supp1]); in unnecessary_S_pair() 1329 if(supp1==supp2) in reduce_by() 1332 if((supp1|supp)==supp1) in reduce_by() 1336 iter.set_to_list(generators[supp1]); in reduce_by() 1382 if((supp1|supp)==supp1) in reduce_by() [all …]
|
/dports/math/fcl/fcl-0.7.0/include/fcl/narrowphase/detail/convexity_based_algorithm/ |
H A D | gjk_libccd.h | 194 ccd_support_fn supp1, 225 bool GJKDistance(void* obj1, ccd_support_fn supp1, 251 bool GJKSignedDistance(void* obj1, ccd_support_fn supp1,
|
/dports/math/fcl05/fcl-0.5.0/include/fcl/narrowphase/ |
H A D | gjk_libccd.h | 167 bool GJKCollide(void* obj1, ccd_support_fn supp1, ccd_center_fn cen1, 172 bool GJKDistance(void* obj1, ccd_support_fn supp1,
|
/dports/textproc/filepp/filepp-1.8.0/tests/ |
H A D | test-suppress | 4 #include "test-supp1"
|
/dports/devel/valgrind/valgrind-dragonfly-dragonfly/memcheck/tests/ |
H A D | supp1.vgtest | 2 prog: supp1
|
/dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/memcheck/tests/ |
H A D | supp1.vgtest | 2 prog: supp1
|
/dports/math/gap/gap-4.11.0/pkg/guava-3.15/lib/ |
H A D | curves.gi | 484 supp1:=D1.support; 488 for pt in Union(supp1,supp2) do 489 if (pt in supp1) and (pt in supp2) then 490 pos1:=PositionSublist(supp1,[pt]); 495 if (pt in supp1) and not(pt in supp2) then 496 pos1:=PositionSublist(supp1,[pt]); 609 supp1:=D1.support; 613 for pt in Union(supp1,supp2) do 614 if (pt in supp1) and (pt in supp2) then 615 pos1:=PositionSublist(supp1,[pt]); [all …]
|
/dports/net/iaxmodem/iaxmodem-1.2.0/lib/spandsp/src/ |
H A D | echo.c | 313 ec->supp1 = 0; 495 supp = supp_change + k1*ec->supp1 + k2*ec->supp2; 496 ec->supp2 = ec->supp1; 497 ec->supp1 = supp;
|
/dports/net-mgmt/ocsinventory-ocsreports/ocsinventory-ocsreports/require/ |
H A D | function_config_generale.php | 257 $supp1 = array("DOWNLOAD_CYCLE_LATENCY", "DOWNLOAD_FRAG_LATENCY", "DOWNLOAD_PERIOD_LATENCY", 290 while ($supp1[$i]) { 291 if ($protectedPost[$supp1[$i]] < 1 && isset($protectedPost[$supp1[$i]])) { 292 $tab_error[$supp1[$i]] = '1';
|
/dports/math/eclib/eclib-20210318/libsrc/ |
H A D | mrank2.cc | 141 res = desc2(c,d1,d2,badprimes, supp1, elsgens1, mask1, lim2,x,y,z,verb); in second_descent() 208 const vector<bigint>& supp = (which? supp1 : supp0); in find_elsgens() 452 res = 1+desc2(c,d1,d2,badprimes,supp1,elsgens1,mask1,lim2,x,y,z,verb,1); in find_els2gens() 720 supp1 = pdivs(ddash); in local_descent() 722 set_union(supp0.begin(),supp0.end(),supp1.begin(),supp1.end(),back_inserter(badprimes)); in local_descent() 729 supp1.insert(supp1.begin(),minusone); in local_descent()
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/spandsp/src/ |
H A D | echo.c | 332 ec->supp1 = 0; 562 supp = supp_change + k1*ec->supp1 + k2*ec->supp2; 563 ec->supp2 = ec->supp1; 564 ec->supp1 = supp;
|
/dports/comms/spandsp/spandsp-284fe91/src/ |
H A D | echo.c | 332 ec->supp1 = 0; 562 supp = supp_change + k1*ec->supp1 + k2*ec->supp2; 563 ec->supp2 = ec->supp1; 564 ec->supp1 = supp;
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/spandsp/src/spandsp/private/ |
H A D | echo.h | 54 int32_t supp1; member
|
/dports/comms/spandsp/spandsp-284fe91/src/spandsp/private/ |
H A D | echo.h | 54 int32_t supp1; member
|
/dports/science/py-scipy/scipy-1.7.1/scipy/stats/tests/ |
H A D | test_discrete_basic.py | 160 supp1 = supp[supp < _b] 161 npt.assert_array_equal(distfn.ppf(distfn.cdf(supp1, *arg) + 1e-8, *arg), 162 supp1 + distfn.inc, msg + ' ppf-cdf-next')
|
/dports/devel/clixon/clixon-4.8.0/test/ |
H A D | valgrind-clixon.supp | 2 supp1
|