| /external/chromium_org/ui/keyboard/resources/ |
| D | touch_fuzzing.js | 56 var splits = findSplits(this.keys, Orientation.HORIZONTAL);
57 this.tree = createBinaryTree(0, splits.length - 1, splits);
246 var splits = findSplits(array, !currentRotation);
247 var tree = createBinaryTree(0, splits.length - 1, splits);
409 var splits = [];
414 splits.push(new Line(mid, orientation));
417 return splits;
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/ |
| D | ApplicationResolver.java | 53 String[] splits = receiverClassName.split("\\."); in replaceLastDotWith$IfInnerStaticClass() local
55 …if (splits[splits.length - 1].matches(staticInnerClassRegex) && splits[splits.length - 2].matches(… in replaceLastDotWith$IfInnerStaticClass()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | CubicConvexHull.cpp | 24 , splits(0) { in CubicIntersections()
108 __FUNCTION__, depth, splits, newMinT1, newMaxT1, minT1, maxT1, in intersect()
119 __FUNCTION__, depth, splits, newMinT2, newMaxT2, minT2, maxT2, in intersect()
132 ++splits; in chop()
142 --splits; in chop()
159 int splits; member in CubicIntersections
|
| D | QuadraticIntersection.cpp | 26 , splits(0) in QuadraticIntersections()
107 splits, newMinT1, newMaxT1, minT1, maxT1, split); in intersect()
117 splits, newMinT2, newMaxT2, minT2, maxT2, split); in intersect()
225 ++splits; in chop()
235 --splits; in chop()
252 int splits; member in QuadraticIntersections
|
| D | EdgeWalker.cpp | 2668 SkTArray<InEdge> splits; in simplify() local
2670 (*currentPtr)->splitInflectionPts(splits); in simplify()
2672 if (splits.count()) { in simplify()
2673 for (int index = 0; index < splits.count(); ++index) { in simplify()
2674 edges.push_back(splits[index]); in simplify()
|
| /external/skia/experimental/Intersection/ |
| D | CubicConvexHull.cpp | 24 , splits(0) { in CubicIntersections()
108 __FUNCTION__, depth, splits, newMinT1, newMaxT1, minT1, maxT1, in intersect()
119 __FUNCTION__, depth, splits, newMinT2, newMaxT2, minT2, maxT2, in intersect()
132 ++splits; in chop()
142 --splits; in chop()
159 int splits; member in CubicIntersections
|
| D | QuadraticIntersection.cpp | 26 , splits(0) in QuadraticIntersections()
107 splits, newMinT1, newMaxT1, minT1, maxT1, split); in intersect()
117 splits, newMinT2, newMaxT2, minT2, maxT2, split); in intersect()
225 ++splits; in chop()
235 --splits; in chop()
252 int splits; member in QuadraticIntersections
|
| D | EdgeWalker.cpp | 2668 SkTArray<InEdge> splits; in simplify() local
2670 (*currentPtr)->splitInflectionPts(splits); in simplify()
2672 if (splits.count()) { in simplify()
2673 for (int index = 0; index < splits.count(); ++index) { in simplify()
2674 edges.push_back(splits[index]); in simplify()
|
| /external/chromium_org/components/autofill/core/browser/ |
| D | autofill_field_unittest.cc | 541 int splits[] = {4, 4, 4, 4}; in TEST() local
542 test.splits_ = std::vector<int>(splits, splits + arraysize(splits)); in TEST()
585 int splits[] = {4, 6, 5}; in TEST() local
586 test.splits_ = std::vector<int>(splits, splits + arraysize(splits)); in TEST()
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| D | csdetest.cpp | 112 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) in split() argument
116 splits = 1; in split()
118 splits += 1; in split()
121 UnicodeString *result = new UnicodeString[splits]; in split()
159 int32_t splits = 0; in checkEncoding() local
161 UnicodeString *eSplit = split(encoding, CH_SLASH, splits); in checkEncoding()
212 if (splits > 1 && lang.compare(eSplit[1]) != 0) { in checkEncoding()
|
| D | fldset.cpp | 68 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) in split() argument
72 splits = 1; in split()
74 splits += 1; in split()
77 UnicodeString *result = new UnicodeString[splits]; in split()
|
| /external/icu/icu4c/source/test/intltest/ |
| D | csdetest.cpp | 112 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) in split() argument
116 splits = 1; in split()
118 splits += 1; in split()
121 UnicodeString *result = new UnicodeString[splits]; in split()
159 int32_t splits = 0; in checkEncoding() local
161 UnicodeString *eSplit = split(encoding, CH_SLASH, splits); in checkEncoding()
212 if (splits > 1 && lang.compare(eSplit[1]) != 0) { in checkEncoding()
|
| D | fldset.cpp | 68 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) in split() argument
72 splits = 1; in split()
74 splits += 1; in split()
77 UnicodeString *result = new UnicodeString[splits]; in split()
|
| /external/llvm/lib/Support/ |
| D | StringRef.cpp | 283 for (int splits = 0; in split() local
284 rest.data() != nullptr && (MaxSplit < 0 || splits < MaxSplit); in split()
285 ++splits) { in split()
|
| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| D | multi_block.ll | 11 ; if (d) foo(); <----- This splits the blocks
|
| /external/llvm/test/CodeGen/Mips/ |
| D | 2011-05-26-BranchKillsVreg.ll | 4 ; PHI elimination splits the critical edge from %while.end415 to %if.end427.
|
| /external/llvm/test/Transforms/ScalarRepl/ |
| D | 2008-06-05-loadstore-agg.ll | 4 ; values. This checks of scalarrepl splits up the struct and array properly.
|
| /external/libpcap/ |
| D | README.sita | 31 both WAN and LAN protocols. It effectively splits the operation of
|
| /external/mesa3d/docs/ |
| D | README.MITS | 42 No. This implementation splits the processing of the vertex buffer
|
| /external/chromium_org/third_party/mesa/src/docs/ |
| D | README.MITS | 42 No. This implementation splits the processing of the vertex buffer
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_ra.cpp | 705 std::list<Instruction *> splits; member in nv50_ir::GCRA
938 splits.push_back(insn); in doCoalesce()
1379 splits.clear(); // avoid duplicate entries on next coalesce pass in cleanup()
1607 for (std::list<Instruction *>::iterator it = splits.begin(); in resolveSplitsAndMerges()
1608 it != splits.end(); in resolveSplitsAndMerges()
1619 splits.clear(); in resolveSplitsAndMerges()
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_ra.cpp | 705 std::list<Instruction *> splits; member in nv50_ir::GCRA
938 splits.push_back(insn); in doCoalesce()
1379 splits.clear(); // avoid duplicate entries on next coalesce pass in cleanup()
1607 for (std::list<Instruction *>::iterator it = splits.begin(); in resolveSplitsAndMerges()
1608 it != splits.end(); in resolveSplitsAndMerges()
1619 splits.clear(); in resolveSplitsAndMerges()
|
| /external/stlport/doc/ |
| D | build_system.txt | 34 files that define generic rules. Here, it then splits into app/ and lib/, which are
|
| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| D | README.tokenizers | 72 The ICU tokenizer implementation is very simple. It splits the input
|
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| D | README.tokenizers | 72 The ICU tokenizer implementation is very simple. It splits the input
|