Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:t2Step
(Results
1 - 2
of
2
) sorted by relevance
/third_party/skia/tests/
H
A
D
PathOpsCubicIntersectionTest.cpp
527
double t1Step, double
t2Step
) {
in intersectionFinder()
539
t2[0] = c2.ptAtT(t2Seed -
t2Step
);
in intersectionFinder()
541
t2[2] = c2.ptAtT(t2Seed +
t2Step
);
in intersectionFinder()
563
t2Seed -=
t2Step
;
in intersectionFinder()
565
t2Seed +=
t2Step
;
in intersectionFinder()
571
t2Step
/= 2;
in intersectionFinder()
575
t1Step =
t2Step
= 0.1;
in intersectionFinder()
578
double t20 = t2Seed -
t2Step
* 2;
in intersectionFinder()
579
double t22 = t2Seed +
t2Step
* 2;
in intersectionFinder()
592
while (!approximately_zero(
t2Step
)) {
in intersectionFinder()
526
intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, double t1Step, double
t2Step
)
intersectionFinder()
argument
623
double
t2Step
= 0.000001;
CubicIntersection_IntersectionFinder()
local
[all...]
H
A
D
PathOpsQuadIntersectionTest.cpp
424
double
t2Step
= 0.1;
in intersectionFinder()
local
431
t2[0] = quad2.ptAtT(t2Seed -
t2Step
);
in intersectionFinder()
433
t2[2] = quad2.ptAtT(t2Seed +
t2Step
);
in intersectionFinder()
455
t2Seed -=
t2Step
;
in intersectionFinder()
457
t2Seed +=
t2Step
;
in intersectionFinder()
463
t2Step
/= 2;
in intersectionFinder()
467
t1Step =
t2Step
= 0.1;
in intersectionFinder()
470
double t20 = t2Seed -
t2Step
* 2;
in intersectionFinder()
471
double t22 = t2Seed +
t2Step
* 2;
in intersectionFinder()
484
while (!approximately_zero(
t2Step
)) {
in intersectionFinder()
[all...]
Completed in 3 milliseconds