OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:iIndex
(Results
1 - 11
of
11
) sorted by null
/external/skia/tests/
PathOpsCubicLineIntersectionTest.cpp
34
static void testOne(skiatest::Reporter* reporter, int
iIndex
) {
35
const SkDCubic& cubic = lineCubicTests[
iIndex
].cubic;
37
const SkDLine& line = lineCubicTests[
iIndex
].line;
45
SkDebugf("[%d] cubic order=%d\n",
iIndex
, order1);
49
SkDebugf("[%d] line order=%d\n",
iIndex
, order2);
62
__FUNCTION__,
iIndex
, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
71
int
iIndex
= static_cast<int>(index);
72
testOne(reporter,
iIndex
);
78
int
iIndex
= 0;
79
testOne(reporter,
iIndex
);
[
all
...]
PathOpsCubicQuadIntersectionTest.cpp
32
int
iIndex
= static_cast<int>(index);
43
SkDebugf("[%d] cubic order=%d\n",
iIndex
, order1);
47
SkDebugf("[%d] quad order=%d\n",
iIndex
, order2);
60
__FUNCTION__,
iIndex
, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
PathOpsQuadLineIntersectionTest.cpp
97
int
iIndex
= static_cast<int>(index);
106
SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__,
iIndex
, order1);
110
SkDebugf("%s [%d] line order=%d\n", __FUNCTION__,
iIndex
, order2);
129
__FUNCTION__,
iIndex
, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY);
PathOpsCubicIntersectionTest.cpp
18
int
iIndex
= static_cast<int>(index);
29
SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__,
iIndex
, order1);
35
SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__,
iIndex
, order2);
43
SkDebugf("%s [%d] no intersection\n", __FUNCTION__,
iIndex
);
49
SkDebugf("%s [%d] coincident\n", __FUNCTION__,
iIndex
);
/external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCommon.cpp
444
int rIndex,
iIndex
;
458
for (
iIndex
= rIndex + 1;
iIndex
< ends; ++
iIndex
) {
459
int inner = runs[
iIndex
>> 1];
461
const SkPoint& iPt =
iIndex
& 1 ? iContour.end() : iContour.start();
465
distances[row +
iIndex
] = dist; // oStart distance from iStart
/external/skia/src/pathops/
SkPathOpsCommon.cpp
444
int rIndex,
iIndex
;
458
for (
iIndex
= rIndex + 1;
iIndex
< ends; ++
iIndex
) {
459
int inner = runs[
iIndex
>> 1];
461
const SkPoint& iPt =
iIndex
& 1 ? iContour.end() : iContour.start();
465
distances[row +
iIndex
] = dist; // oStart distance from iStart
/external/chromium_org/third_party/sqlite/src/src/
test_thread.c
339
int
iIndex
;
347
interp, objv[1], aSub, sizeof(aSub[0]), "sub-command", 0, &
iIndex
350
pSub = &aSub[
iIndex
];
/external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2.c
[
all
...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/
ant.jar
/prebuilts/tools/common/ant/
ant.jar
/prebuilts/tools/common/m2/internal/org/apache/ant/ant/1.8.0/
ant-1.8.0.jar
Completed in 191 milliseconds