HomeSort by relevance Sort by last modified time
    Searched full:tdiv (Results 1 - 10 of 10) sorted by null

  /external/chromium_org/third_party/skia/experimental/Intersection/
CubicToQuadratics.cpp 32 Compute the Tdiv as the root of (cubic) equation
33 sqrt(3)/18 · |P2 - 3·C2 + 3·C1 - P1|/2 · Tdiv ^ 3 = prec
34 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
36 Repeat from step 2 with the second resulted segment (corresponding to 1-Tdiv)
37 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
39 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximation
117 double tDiv = calcTDiv(cubic, precision, 0);
118 if (tDiv >= 1)
    [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkDCubicToQuads.cpp 31 Compute the Tdiv as the root of (cubic) equation
32 sqrt(3)/18 · |P2 - 3·C2 + 3·C1 - P1|/2 · Tdiv ^ 3 = prec
33 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
35 Repeat from step 2 with the second resulted segment (corresponding to 1-Tdiv)
36 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
38 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximation
91 double tDiv = calc_t_div(cubic, precision, 0);
92 if (tDiv >= 1)
    [all...]
  /external/skia/experimental/Intersection/
CubicToQuadratics.cpp 32 Compute the Tdiv as the root of (cubic) equation
33 sqrt(3)/18 · |P2 - 3·C2 + 3·C1 - P1|/2 · Tdiv ^ 3 = prec
34 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
36 Repeat from step 2 with the second resulted segment (corresponding to 1-Tdiv)
37 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
39 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximation
117 double tDiv = calcTDiv(cubic, precision, 0);
118 if (tDiv >= 1)
    [all...]
  /external/skia/src/pathops/
SkDCubicToQuads.cpp 31 Compute the Tdiv as the root of (cubic) equation
32 sqrt(3)/18 · |P2 - 3·C2 + 3·C1 - P1|/2 · Tdiv ^ 3 = prec
33 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
35 Repeat from step 2 with the second resulted segment (corresponding to 1-Tdiv)
36 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
38 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximation
91 double tDiv = calc_t_div(cubic, precision, 0);
92 if (tDiv >= 1)
    [all...]
  /external/clang/test/Analysis/
taint-tester.c 21 double tdiv = n / 30; // expected-warning+ {{tainted}} local
23 char tinc = tdiv++; // expected-warning + {{tainted}}
  /external/valgrind/main/none/tests/ppc32/
test_isa_2_06_part3.c     [all...]
test_isa_2_06_part3.stdout.exp     [all...]
  /external/valgrind/main/none/tests/ppc64/
test_isa_2_06_part3.stdout.exp     [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/info/
gmp.info-1     [all...]
  /external/valgrind/main/VEX/priv/
guest_ppc_toIR.c     [all...]

Completed in 401 milliseconds