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:t1Step
(Results
1 - 2
of
2
) sorted by relevance
/third_party/skia/tests/
H
A
D
PathOpsCubicIntersectionTest.cpp
527
double
t1Step
, double t2Step) {
in intersectionFinder()
536
t1[0] = c1.ptAtT(t1Seed -
t1Step
);
in intersectionFinder()
538
t1[2] = c1.ptAtT(t1Seed +
t1Step
);
in intersectionFinder()
558
t1Seed -=
t1Step
;
in intersectionFinder()
560
t1Seed +=
t1Step
;
in intersectionFinder()
569
t1Step
/= 2;
in intersectionFinder()
575
t1Step
= t2Step = 0.1;
in intersectionFinder()
576
double t10 = t1Seed -
t1Step
* 2;
in intersectionFinder()
577
double t12 = t1Seed +
t1Step
* 2;
in intersectionFinder()
581
while (!approximately_zero(
t1Step
)) {
in intersectionFinder()
526
intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, double
t1Step
, double t2Step)
intersectionFinder()
argument
622
double
t1Step
= 0.000001;
CubicIntersection_IntersectionFinder()
local
[all...]
H
A
D
PathOpsQuadIntersectionTest.cpp
423
double
t1Step
= 0.1;
in intersectionFinder()
local
428
t1[0] = quad1.ptAtT(t1Seed -
t1Step
);
in intersectionFinder()
430
t1[2] = quad1.ptAtT(t1Seed +
t1Step
);
in intersectionFinder()
450
t1Seed -=
t1Step
;
in intersectionFinder()
452
t1Seed +=
t1Step
;
in intersectionFinder()
461
t1Step
/= 2;
in intersectionFinder()
467
t1Step
= t2Step = 0.1;
in intersectionFinder()
468
double t10 = t1Seed -
t1Step
* 2;
in intersectionFinder()
469
double t12 = t1Seed +
t1Step
* 2;
in intersectionFinder()
473
while (!approximately_zero(
t1Step
)) {
in intersectionFinder()
[all...]
Completed in 3 milliseconds