Home
last modified time | relevance | path

Searched refs:sols (Results 1 – 25 of 942) sorted by relevance

12345678910>>...38

/dports/math/cgal/CGAL-5.3/include/CGAL/Circular_kernel_3/
H A DCircular_arc_point_3.h80 CGAL_kernel_precondition(sols.size() != 0);
81 if(sols.size() == 1) {
103 CGAL_kernel_precondition(sols.size() != 0);
104 if(sols.size() == 1) {
126 CGAL_kernel_precondition(sols.size() != 0);
127 if(sols.size() == 1) {
148 CGAL_kernel_precondition(sols.size() != 0);
149 if(sols.size() == 1) {
170 CGAL_kernel_precondition(sols.size() != 0);
171 if(sols.size() == 1) {
[all …]
/dports/math/4ti2/4ti2-Release_1_6_9/src/groebner/
H A DOptimise.cpp122 VectorArray sols(0, n); in compute_infeasible() local
123 sols.insert(sol); in compute_infeasible()
152 sol = sols[0]; in compute_infeasible()
216 sol = sols[0]; in compute_infeasible()
360 sols.insert(sol); in compute_feasible()
368 sol = sols[0]; in compute_feasible()
434 sols[0]= sol; in compute_feasible()
443 sol = sols[0]; in compute_feasible()
512 sols.insert(sol); in compute_bounded()
541 sol = sols[0]; in compute_bounded()
[all …]
/dports/science/cgnslib/CGNS-4.1.2/src/cgnstools/utilities/
H A Dcgns_info.c74 SOLUTION *sols; in print_solution() local
77 sols = zone->sols; in print_solution()
80 printf (" solution %d - %s\n", sols[ns].id, sols[ns].name); in print_solution()
81 printf (" location = %d\n", sols[ns].location); in print_solution()
83 sols[ns].rind[0][0], sols[ns].rind[0][1], in print_solution()
84 sols[ns].rind[1][0], sols[ns].rind[1][1], in print_solution()
85 sols[ns].rind[2][0], sols[ns].rind[2][1]); in print_solution()
86 printf (" size = %d\n", (int)sols[ns].size); in print_solution()
87 printf (" fields = %d\n", sols[ns].nflds); in print_solution()
88 for (nf = 0; nf < sols[ns].nflds; nf++) in print_solution()
[all …]
H A Dinterpolate_cgns.c115 if (z->sols->nflds == 0) { in check_solution()
121 if (z->sols->nflds > 1) in check_solution()
122 qsort (z->sols->flds, z->sols->nflds, sizeof(FIELD), sort_name); in check_solution()
124 if (z->sols->nflds != Zones->sols->nflds) in check_solution()
128 if (strcmp (z->sols->flds[nf].name, Zones->sols->flds[nf].name)) in check_solution()
939 sol = z->sols; in build_solution()
943 sol = &z->sols[ns]; in build_solution()
948 z->sols = (SOLUTION *) realloc (z->sols, in build_solution()
950 if (NULL == z->sols) in build_solution()
959 z->sols = sol = new_solution (1); in build_solution()
[all …]
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Dheur_sync.c78 SCIPfreeBlockMemoryArray(scip, &heurdata->sols, heurdata->maxnsols); in SCIP_DECL_HEURFREE()
105 SCIP_CALL( SCIPfreeSol(scip, &heurdata->sols[i]) ); in SCIP_DECL_HEUREXITSOL()
137 … SCIP_CALL( SCIPtrySolFree(scip, &heurdata->sols[i], FALSE, FALSE, FALSE, FALSE, FALSE, &stored) ); in SCIP_DECL_HEUREXEC()
162 SCIP_CALL( SCIPallocBlockMemoryArray(scip, &heurdata->sols, heurdata->maxnsols) ); in SCIPincludeHeurSync()
211 while( i > 0 && solobj > SCIPgetSolTransObj(scip, heurdata->sols[i - 1]) ) in SCIPheurSyncPassSol()
213 heurdata->sols[i] = heurdata->sols[i - 1]; in SCIPheurSyncPassSol()
216 heurdata->sols[i] = sol; in SCIPheurSyncPassSol()
226 while( i < heurdata->nsols && solobj < SCIPgetSolTransObj(scip, heurdata->sols[i]) ) in SCIPheurSyncPassSol()
230 heurdata->sols[i - 1] = heurdata->sols[i]; in SCIPheurSyncPassSol()
234 SCIP_CALL( SCIPfreeSol(scip, &heurdata->sols[i]) ); in SCIPheurSyncPassSol()
[all …]
H A Dprimal.c128 (*primal)->sols = NULL; in SCIPprimalCreate()
253 sol = primal->sols[i]; in sortPrimalSols()
256 primal->sols[j] = primal->sols[j-1]; in sortPrimalSols()
257 primal->sols[j] = sol; in sortPrimalSols()
724 sol = primal->sols[insertpos]; in primalAddSol()
740 primal->sols[pos] = primal->sols[pos-1]; in primalAddSol()
744 primal->sols[insertpos] = sol; in primalAddSol()
860 primal->sols[pos] = primal->sols[pos-1]; in primalAddOrigSol()
863 primal->sols[insertpos] = sol; in primalAddOrigSol()
917 SCIP_SOL** sols; in primalSearchSolPos() local
[all …]
H A Dheur_crossover.c276 if( SCIPsolGetHeur(sols[selection[i]]) == SCIPsolGetHeur(sols[newsol]) in solHasNewSource()
277 && SCIPsolGetNodenum(sols[selection[i]]) == SCIPsolGetNodenum(sols[newsol]) ) in solHasNewSource()
299 SCIP_SOL** sols; in selectSolsRandomized() local
306 sols = SCIPgetSols(scip); in selectSolsRandomized()
375 sols = SCIPgetSols(scip); in fixVariables()
376 assert(sols != NULL); in fixVariables()
449 sols = SCIPgetSols(scip); in determineVariableFixings()
477 if( SCIPsolGetHeur(sols[i]) != solheur || SCIPsolGetNodenum(sols[i]) != solnodenum ) in determineVariableFixings()
908 SCIP_SOL** sols; in SCIP_DECL_HEUREXEC() local
935 sols = SCIPgetSols(scip); in SCIP_DECL_HEUREXEC()
[all …]
H A Dheur_reoptsols.c167 SCIP_SOL** sols; in SCIP_DECL_HEUREXEC() local
198 SCIP_CALL( SCIPallocBufferArray(scip, &sols, allocmem) ); in SCIP_DECL_HEUREXEC()
225 SCIP_CALL( SCIPgetReoptSolsRun(scip, run, sols, allocmem, &nsols) ); in SCIP_DECL_HEUREXEC()
231 SCIP_CALL( SCIPreallocBufferArray(scip, &sols, allocmem) ); in SCIP_DECL_HEUREXEC()
233 SCIP_CALL( SCIPgetReoptSolsRun(scip, run, sols, allocmem, &nsols) ); in SCIP_DECL_HEUREXEC()
245 sol = sols[s]; in SCIP_DECL_HEUREXEC()
291 SCIPfreeBufferArray(scip, &sols); in SCIP_DECL_HEUREXEC()
/dports/devel/py-opengrok-tools/opengrok-1.3.16/testdata/sources/clojure/
H A Dsample.clj9 (reduce (fn [sols a]
10 (clojure.set/union (set (map #(conj % a) sols)) sols)) #{#{}} coll))
16 (reduce (fn [sols a]
17 (clojure.set/union (set (map #(conj % a) sols)) sols)) #{#{}} coll))
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/tests/
H A Dsolve_simple_problem.cc19 D_ASSERT(ss.sols().size() == 4*3*2*2); in main()
20 for(int i : range1(ss.sols().size())) in main()
22 D_ASSERT(ss.sols()[i][2] == 2 || ss.sols()[i][2] == 4); in main()
23 D_ASSERT(ss.sols()[i][2] == 4 || ss.sols()[i][2] == 2); in main()
/dports/math/cgal/CGAL-5.3/include/CGAL/Min_sphere_of_spheres_d/
H A DMin_sphere_of_spheres_d_support_set.h284 if (sols[1] < sols[0])
285 std::swap(sols[0],sols[1]);
288 if (sols[0]*Tol<FT>::result() >= maxradius[m]) {
289 sol[m+1] = sols[0];
292 sol[m+1] = sols[1];
313 Result sols[2] = {
320 std::swap(sols[0],sols[1]);
321 CGAL_MINIBALL_ASSERT(is_neg_or_zero(sols[0]-sols[1],discrim[m+1]));
324 if (!is_neg(sols[0]-maxradius[m],discrim[m+1])) {
325 sol[m+1] = sols[0];
[all …]
/dports/editors/texmacs/TeXmacs-1.99.4-src/TeXmacs/progs/kernel/logic/
H A Dlogic-query.scm70 (sols (map bind-expand sols2)))
71 (if (null? sols) sols
72 (logic-return (logic-prove-any (cdr rule) extra sols) serial)))))
78 (let ((sols (logic-try goal (car prg) extra bl)))
79 (if (== sols (list bl)) sols
80 (append sols (logic-exec goal (cdr prg) extra bl))))))
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/src/toys/
H A Dlevelsets-test.cpp88 vector<vector<Interval> > sols=level_sets(B,levels,0,1); in draw() local
89 for (unsigned i=0;i<sols.size();i++){ in draw()
90 for (unsigned j=0;j<sols[i].size();j++){ in draw()
94 plot_bar(cr,ys, 1., sols[i][j].min(), sols[i][j].max()); in draw()
97 plot_bar(cr,ys, 1., sols[i][j].min(), sols[i][j].max()); in draw()
102 plot_bar(cr,0., 1., sols[i][j].min(), sols[i][j].max()); in draw()
103 Point sol ( 150 + 300 * sols[i][j].middle(), 300); in draw()
/dports/math/lib2geom/lib2geom-1.1/src/toys/
H A Dlevelsets-test.cpp88 vector<vector<Interval> > sols=level_sets(B,levels,0,1); in draw() local
89 for (unsigned i=0;i<sols.size();i++){ in draw()
90 for (unsigned j=0;j<sols[i].size();j++){ in draw()
94 plot_bar(cr,ys, 1., sols[i][j].min(), sols[i][j].max()); in draw()
97 plot_bar(cr,ys, 1., sols[i][j].min(), sols[i][j].max()); in draw()
102 plot_bar(cr,0., 1., sols[i][j].min(), sols[i][j].max()); in draw()
103 Point sol ( 150 + 300 * sols[i][j].middle(), 300); in draw()
/dports/print/lilypond-devel/lilypond-2.23.5/lily/
H A Dbezier.cc105 vector<Real> sols; in get_other_coordinates() local
108 return sols; in get_other_coordinates()
263 sols.push_back (0.999); in minmax()
264 sols.push_back (0.001); in minmax()
269 for (vsize i = sols.size (); i--;) in minmax()
271 Offset p (curve_point (sols[i])); in minmax()
303 vector<Real> sols (solve_derivative (d)); in extent() local
304 sols.push_back (1.0); in extent()
305 sols.push_back (0.0); in extent()
306 for (vsize i = sols.size (); i--;) in extent()
[all …]
/dports/print/lilypond/lilypond-2.22.1/lily/
H A Dbezier.cc105 vector<Real> sols; in get_other_coordinates() local
108 return sols; in get_other_coordinates()
263 sols.push_back (0.999); in minmax()
264 sols.push_back (0.001); in minmax()
269 for (vsize i = sols.size (); i--;) in minmax()
271 Offset p (curve_point (sols[i])); in minmax()
304 vector<Real> sols (solve_derivative (d)); in extent() local
305 sols.push_back (1.0); in extent()
306 sols.push_back (0.0); in extent()
307 for (vsize i = sols.size (); i--;) in extent()
[all …]
/dports/multimedia/mswebrtc/mswebrtc-1.1.1/webrtc/webrtc/modules/audio_processing/intelligibility/
H A Dintelligibility_enhancer_unittest.cc167 vector<float> sols(enh_->bank_size_); in TEST_F() local
174 enh_->SolveForGainsGivenLambda(lambda, enh_->start_freq_, &sols[0]); in TEST_F()
176 EXPECT_NEAR(kTestZeroVar[i], sols[i], kMaxTestError); in TEST_F()
182 enh_->SolveForGainsGivenLambda(lambda, enh_->start_freq_, &sols[0]); in TEST_F()
184 EXPECT_NEAR(kTestNonZeroVarLambdaTop[i], sols[i], kMaxTestError); in TEST_F()
187 enh_->SolveForGainsGivenLambda(lambda, enh_->start_freq_, &sols[0]); in TEST_F()
189 EXPECT_NEAR(kTestZeroVar[i], sols[i], kMaxTestError); in TEST_F()
/dports/math/SCIP/scip-7.0.3/tests/src/cons/superindicator/
H A Dslack.c132 SCIP_SOL** sols; in SCIPsolveSlack() local
517 sols = NULL; in SCIPsolveSlack()
613 SCIPfreeMemoryArray(scip, &sols); in SCIPsolveSlack()
664 sols = SCIPgetSols(scip); in SCIPsolveSlack()
671 objval = SCIPgetSolOrigObj(scip, *sols); in SCIPsolveSlack()
857 sols[0] = SCIPgetBestSol(scip); in SCIPsolveSlack()
859 *sol = sols[0]; in SCIPsolveSlack()
913 SCIPfreeMemoryArray(scip, &sols); in SCIPsolveSlack()
986 SCIP_SOL** sols; in testslack() local
1002 SCIP_CALL( SCIPallocMemory(scip, &sols) ); in testslack()
[all …]
/dports/math/SCIP/scip-7.0.3/check/
H A Dcheck_count.awk103 sols = 0;
204 sols = $4;
260 else if( (interrupted && knownsols[prob] >= sols) ) {
263 else if( !interrupted && knownsols[prob] == sols ) {
271 if( sols > 1e+16 )
272 solsstr = sprintf("%e", sols);
274 solsstr = sprintf("%d", sols);
/dports/math/py-Diofant/Diofant-0.13.0/diofant/polys/
H A Dsolvers.py37 sols = dict(zip(ring.gens, echelon[:, -1]))
39 sols = {}
42 sols[ring.gens[p]] = (echelon[i, p + 1:]*vect)[0]
44 return {k: ring(v) for k, v in sols.items()}
/dports/math/SCIP/scip-7.0.3/applications/STP/src/
H A Dheur_rec.c182 SCIP_SOL** sols = NULL; in selectdiffsols() local
209 poolsols = pool->sols; in selectdiffsols()
274 solk = sols[k]; in selectdiffsols()
360 poolsols = pool->sols; in selectsols()
481 SCIP_SOL** sols = NULL; in buildsolgraph() local
497 assert(sols != NULL); in buildsolgraph()
889 return pool->sols[i]; in SCIPStpHeurRecSolfromIdx()
1095 newsol = sols[i]; in SCIPStpHeurRecRun()
1940 SCIP_SOL** sols; in SCIP_DECL_HEUREXEC() local
2039 assert(sols != NULL); in SCIP_DECL_HEUREXEC()
[all …]
/dports/math/py-sympy/sympy-1.9/sympy/solvers/tests/
H A Dtest_numeric.py95 sols = nsolve((y**2 - x, x**2 - pi), (x, y), (3, 3), prec=128)
96 assert isinstance(sols, Matrix)
97 assert sols.shape == (2, 1)
98 assert abs(sqrt(pi).evalf(128) - sols[0]) < 1e-128
99 assert abs(sqrt(sqrt(pi)).evalf(128) - sols[1]) < 1e-128
100 assert all(isinstance(i, Float) for i in sols)
/dports/math/alps/CHiPPS-ALPS-releases-2.0.1/Alps/src/
H A DAlpsSolutionPool.cpp96 double> >& sols) const { in getAllKnowledges()
97 sols.reserve(sols.size() + solutions_.size()); in getAllKnowledges()
100 sols.push_back(std::make_pair(static_cast<AlpsKnowledge *> in getAllKnowledges()
/dports/astro/pykep/pykep-2.6/pykep/examples/
H A D_ex5.py27 sols = archi.get_champions_f()
28 idx = sols.index(min(sols))
/dports/astro/py-pykep/pykep-2.6/pykep/examples/
H A D_ex5.py27 sols = archi.get_champions_f()
28 idx = sols.index(min(sols))

12345678910>>...38