Home
last modified time | relevance | path

Searched refs:roots (Results 76 – 100 of 14405) sorted by relevance

12345678910>>...577

/dports/security/certmgr/certmgr-3.0.3/vendor/github.com/google/certificate-transparency-go/certificate-transparency-go-1.0.21/x509/
H A Dname_constraints_test.go66 roots: []constraintsSpec{
77 roots: []constraintsSpec{
93 roots: []constraintsSpec{
111 roots: []constraintsSpec{
128 roots: []constraintsSpec{
145 roots: []constraintsSpec{
163 roots: []constraintsSpec{
180 roots: []constraintsSpec{
198 roots: []constraintsSpec{
216 roots: []constraintsSpec{
[all …]
/dports/www/firefox-esr/firefox-91.8.0/gfx/skia/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/skia/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
[all …]
/dports/www/firefox/firefox-99.0/gfx/skia/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/skia/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/src/pathops/
H A DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
[all …]
/dports/math/gap/gap-4.11.0/pkg/unipot-1.4/lib/
H A Dunipot.gi614 roots := record.roots;
1622 p := Position( roots, k * roots[r] + roots[s] );
1658 Position( roots, roots[r]+roots[s] ),
1664 Position( roots, roots[s]+roots[r] ),
1853 if (roots[y.r] + roots[x.r]) in roots then
1857 if (2*roots[y.r] + roots[x.r]) in roots then
1859 elif (roots[y.r] + 2*roots[x.r]) in roots then
1864 in21 := (2*roots[y.r] + roots[x.r]) in roots;
1865 in12 := (roots[y.r] + 2*roots[x.r]) in roots;
1879 if (3*roots[y.r] + roots[x.r]) in roots then
[all …]
/dports/net/gdrive/gdrive-2.1.1/vendor/github.com/soniakeys/graph/
H A Dfromlist.go361 if roots != nil {
366 roots.SetAll()
373 if roots != nil && roots.Bit(i) == 1 {
399 if roots != nil {
404 roots.SetAll()
415 if roots != nil && roots.Bit(i) == 1 {
435 if roots != nil {
440 roots.SetAll()
448 if roots != nil && roots.Bit(i) == 1 {
480 roots.SetAll()
[all …]
/dports/devel/viewvc-devel/viewvc-c93d9da79c31457ecb0a771ff52d28353dc6e878/templates/default/
H A Droots.ezt22 [if-any roots]
23 [for roots]
24 <tr class="vc_row_[if-index roots even]even[else]odd[end]">
25 …nclick="jumpTo('[roots.href]')"><a href="[roots.href]"><img src="[docroot]/images/[roots.type]-log…
27 …<td>[if-any roots.rev]<strong>[if-any roots.log_href]<a href="[roots.log_href]">[roots.rev]</a>[el…
28 by <em>[roots.author]</em>: [roots.log][end]</td>
/dports/biology/sigviewer/sigviewer-0.6.4-13-gf62f8d9/src/signal_processing/SPUC/
H A Dbutterworth.h42 complex<double>* roots; variable
62 roots = new complex<double>[n2];
71 delete [] roots; in ~butterworth()
105 roots[j] = wp*expj(arg); in get_roots()
117 double tmp = (roots[0].real()-a)/(a+roots[0].real()); in bilinear()
122 td = a*a - 2*a*roots[j].real() + magsq(roots[j]); in bilinear()
123 roots[j] = complex<double>((a*a - magsq(roots[j])), in bilinear()
124 2.0*a*roots[j].imag())/td; in bilinear()
130 iir[j-odd].set_coeff(-2*roots[j].real()/magsq(roots[j]),1.0/magsq(roots[j])); in get_coeff()
131 gain *= (magsq(roots[j]) - 2*roots[j].real() + 1.0)/(4*magsq(roots[j])); in get_coeff()
/dports/science/PETSc/petsc-3.14.1/src/dm/impls/plex/tests/output/
H A Dex1_part_simple_1.out61 [0] Number of roots=33, leaves=7, remote ranks=1
69 [1] Number of roots=0, leaves=7, remote ranks=1
77 [2] Number of roots=0, leaves=7, remote ranks=1
85 [3] Number of roots=0, leaves=7, remote ranks=1
93 [4] Number of roots=0, leaves=7, remote ranks=1
101 [5] Number of roots=0, leaves=7, remote ranks=1
109 [6] Number of roots=0, leaves=7, remote ranks=1
117 [7] Number of roots=0, leaves=7, remote ranks=1
187 [0] Number of roots=7, leaves=3, remote ranks=2
191 [1] Number of roots=7, leaves=5, remote ranks=2
[all …]
/dports/lang/racket/racket-8.3/collects/setup/
H A Dpath-relativize.rkt22 ;; If `find-roots-dir` returns a list of roots, then a path is
35 (define exploded-roots
36 (delay (cond [(find-roots-dir)
52 (define roots (force exploded-roots))
54 [root (and (pair? roots) (car roots))]
55 [roots (if (pair? roots) (cdr roots) '())])
68 [else (loop orig-path (car roots) (cdr roots))])]
74 [else (loop orig-path (car roots) (cdr roots))])])))
76 (define roots-or-orig
90 (define roots (force roots-or-orig))
[all …]
/dports/lang/racket-minimal/racket-8.3/collects/setup/
H A Dpath-relativize.rkt22 ;; If `find-roots-dir` returns a list of roots, then a path is
35 (define exploded-roots
36 (delay (cond [(find-roots-dir)
52 (define roots (force exploded-roots))
54 [root (and (pair? roots) (car roots))]
55 [roots (if (pair? roots) (cdr roots) '())])
68 [else (loop orig-path (car roots) (cdr roots))])]
74 [else (loop orig-path (car roots) (cdr roots))])])))
76 (define roots-or-orig
90 (define roots (force roots-or-orig))
[all …]
/dports/net/zerotier/ZeroTierOne-1.8.3/attic/world/
H A Dmkworld.cpp81 std::vector<World::Root> roots; in main() local
87 roots.push_back(World::Root()); in main()
89 roots.back().stableEndpoints.push_back(InetAddress("185.180.13.82/9993")); in main()
90 roots.back().stableEndpoints.push_back(InetAddress("2a02:6ea0:c815::/9993")); in main()
93 roots.push_back(World::Root()); in main()
95 roots.back().stableEndpoints.push_back(InetAddress("207.246.73.245/443")); in main()
99 roots.push_back(World::Root()); in main()
101 roots.back().stableEndpoints.push_back(InetAddress("147.75.92.2/443")); in main()
105 roots.push_back(World::Root()); in main()
107 roots.back().stableEndpoints.push_back(InetAddress("195.181.173.159/443")); in main()
[all …]
/dports/games/dhewm3/dhewm3-1.5.1/neo/idlib/math/
H A DPolynomial.cpp111 roots[i] = x; in GetRoots()
128 x = roots[i]; in GetRoots()
130 if ( roots[j].r <= x.r ) { in GetRoots()
133 roots[j+1] = roots[j]; in GetRoots()
135 roots[j+1] = x; in GetRoots()
169 roots[i] = complexRoots[i].r; in GetRoots()
197 num = p.GetRoots( roots ); in Test()
204 num = p.GetRoots( roots ); in Test()
211 num = p.GetRoots( roots ); in Test()
218 num = p.GetRoots( roots ); in Test()
[all …]
/dports/math/eigen3/eigen-3.3.9/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/misc/opennn/opennn-5.0.5/eigen/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/unsupported/doc/examples/
H A DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Digraph_layout_reingold_tilford_circular.c31 igraph_vector_t roots, rootlevel; in main() local
50 igraph_vector_init_int(&roots, 1, 1); in main()
54 igraph_vector_destroy(&roots); in main()
66 igraph_vector_init_int(&roots, 2, 0, 3); in main()
70 igraph_vector_destroy(&roots); in main()
75 igraph_vector_init_int(&roots, 2, 0, 3); in main()
80 igraph_vector_destroy(&roots); in main()
97 igraph_vector_init_int(&roots, 1, -1); in main()
101 igraph_vector_destroy(&roots); in main()
106 igraph_vector_init_int(&roots, 2, 0, 3); in main()
[all …]
/dports/devel/git-cinnabar/git-cinnabar-0.5.8/tests/
H A Ddag.py21 self.assertEqual(set(self.dag.roots()), set('BC'))
28 self.assertEqual(set(self.dag.roots()), set('EFGH'))
34 self.assertEqual(set(self.dag.roots('bar')), set())
36 self.assertEqual(set(self.dag.roots()), set('EFGH'))
43 self.assertEqual(set(self.dag.roots()), set('DEIJ'))
51 self.assertEqual(set(self.dag.roots()), set('E'))
55 self.assertEqual(set(self.dag.roots()), set())
62 self.assertEqual(set(self.dag.roots()), set('B'))
70 self.assertEqual(set(self.dag.roots()), set('B'))
77 self.assertEqual(set(self.dag.roots()), set('B'))
[all …]

12345678910>>...577