OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:realRoots
(Results
1 - 13
of
13
) sorted by null
/external/eigen/unsupported/doc/examples/
PolynomialSolver1.cpp
20
std::vector<double>
realRoots
;
21
psolve.
realRoots
(
realRoots
);
22
Map<Vector5d> mapRR( &
realRoots
[0] );
/external/skia/tests/
PathOpsCubicLineIntersectionIdeas.cpp
164
int
realRoots
= SkDCubic::RootsReal(A, B, C, D, allRoots);
165
int valid = SkDQuad::AddValidTs(allRoots,
realRoots
, validRoots);
169
if (
realRoots
== 1) {
185
if (
realRoots
== 3) {
191
SkDebugf("
realRoots
=%d (%1.9g, %1.9g, %1.9g) valid=%d (%1.9g, %1.9g, %1.9g)\n",
192
realRoots
, allRoots[0], allRoots[1], allRoots[2], valid, validRoots[0],
196
if (
realRoots
== 3) {
261
int
realRoots
= SkDCubic::RootsReal(A, B, C, D, allRoots);
262
int valid = SkDQuad::AddValidTs(allRoots,
realRoots
, validRoots);
264
SkASSERT_RELEASE(
realRoots
!= 1)
[
all
...]
/external/skqp/tests/
PathOpsCubicLineIntersectionIdeas.cpp
164
int
realRoots
= SkDCubic::RootsReal(A, B, C, D, allRoots);
165
int valid = SkDQuad::AddValidTs(allRoots,
realRoots
, validRoots);
169
if (
realRoots
== 1) {
185
if (
realRoots
== 3) {
191
SkDebugf("
realRoots
=%d (%1.9g, %1.9g, %1.9g) valid=%d (%1.9g, %1.9g, %1.9g)\n",
192
realRoots
, allRoots[0], allRoots[1], allRoots[2], valid, validRoots[0],
196
if (
realRoots
== 3) {
261
int
realRoots
= SkDCubic::RootsReal(A, B, C, D, allRoots);
262
int valid = SkDQuad::AddValidTs(allRoots,
realRoots
, validRoots);
264
SkASSERT_RELEASE(
realRoots
!= 1)
[
all
...]
/external/eigen/unsupported/test/
polynomialsolver.cpp
113
//Test
realRoots
115
psolve.
realRoots
( calc_realRoots );
185
EvalRootsType
realRoots
= EvalRootsType::Random(deg);
186
roots_to_monicPolynomial(
realRoots
, pols );
189
realRoots
.template cast <
194
realRoots
);
/external/skia/src/pathops/
SkPathOpsConic.h
58
static int AddValidTs(double s[], int
realRoots
, double* t) {
59
return SkDQuad::AddValidTs(s,
realRoots
, t);
SkPathOpsQuad.cpp
109
int SkDQuad::AddValidTs(double s[], int
realRoots
, double* t) {
111
for (int index = 0; index <
realRoots
; ++index) {
139
int
realRoots
= RootsReal(A, B, C, s);
140
int foundRoots = AddValidTs(s,
realRoots
, t);
SkPathOpsQuad.h
64
static int AddValidTs(double s[], int
realRoots
, double* t);
SkPathOpsCubic.cpp
375
int
realRoots
= RootsReal(A, B, C, D, s);
376
int foundRoots = SkDQuad::AddValidTs(s,
realRoots
, t);
377
for (int index = 0; index <
realRoots
; ++index) {
/external/skqp/src/pathops/
SkPathOpsConic.h
58
static int AddValidTs(double s[], int
realRoots
, double* t) {
59
return SkDQuad::AddValidTs(s,
realRoots
, t);
SkPathOpsQuad.cpp
106
int SkDQuad::AddValidTs(double s[], int
realRoots
, double* t) {
108
for (int index = 0; index <
realRoots
; ++index) {
136
int
realRoots
= RootsReal(A, B, C, s);
137
int foundRoots = AddValidTs(s,
realRoots
, t);
SkPathOpsQuad.h
64
static int AddValidTs(double s[], int
realRoots
, double* t);
SkPathOpsCubic.cpp
375
int
realRoots
= RootsReal(A, B, C, D, s);
376
int foundRoots = SkDQuad::AddValidTs(s,
realRoots
, t);
377
for (int index = 0; index <
realRoots
; ++index) {
/external/eigen/unsupported/Eigen/src/Polynomials/
PolynomialSolver.h
69
inline void
realRoots
( Stl_back_insertion_sequence& bi_seq,
Completed in 125 milliseconds