| /external/chromium_org/components/autofill/core/browser/ |
| H A D | autofill_field_unittest.cc | 541 int splits[] = {4, 4, 4, 4}; local
542 test.splits_ = std::vector<int>(splits, splits + arraysize(splits));
585 int splits[] = {4, 6, 5}; local
586 test.splits_ = std::vector<int>(splits, splits + arraysize(splits));
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | CubicConvexHull.cpp | 24 , splits(0) {
108 __FUNCTION__, depth, splits, newMinT1, newMaxT1, minT1, maxT1,
119 __FUNCTION__, depth, splits, newMinT2, newMaxT2, minT2, maxT2,
132 ++splits;
142 --splits;
159 int splits; member in class:CubicIntersections
|
| H A D | QuadraticIntersection.cpp | 26 , splits(0)
107 splits, newMinT1, newMaxT1, minT1, maxT1, split);
117 splits, newMinT2, newMaxT2, minT2, maxT2, split);
225 ++splits;
235 --splits;
252 int splits; member in class:QuadraticIntersections
|
| /external/skia/experimental/Intersection/ |
| H A D | CubicConvexHull.cpp | 24 , splits(0) {
108 __FUNCTION__, depth, splits, newMinT1, newMaxT1, minT1, maxT1,
119 __FUNCTION__, depth, splits, newMinT2, newMaxT2, minT2, maxT2,
132 ++splits;
142 --splits;
159 int splits; member in class:CubicIntersections
|
| H A D | QuadraticIntersection.cpp | 26 , splits(0)
107 splits, newMinT1, newMaxT1, minT1, maxT1, split);
117 splits, newMinT2, newMaxT2, minT2, maxT2, split);
225 ++splits;
235 --splits;
252 int splits; member in class:QuadraticIntersections
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| H A D | fldset.cpp | 68 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) argument
72 splits = 1;
74 splits += 1;
77 UnicodeString *result = new UnicodeString[splits];
|
| H A D | csdetest.cpp | 112 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) argument
116 splits = 1;
118 splits += 1;
121 UnicodeString *result = new UnicodeString[splits];
159 int32_t splits = 0; local
161 UnicodeString *eSplit = split(encoding, CH_SLASH, splits);
212 if (splits > 1 && lang.compare(eSplit[1]) != 0) {
|
| H A D | regextst.cpp | 5187 UnicodeString splits[10]; local
5189 int32_t numFields = pMatcher->split(text, splits, 10, status);
|
| /external/icu/icu4c/source/test/intltest/ |
| H A D | fldset.cpp | 68 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) argument
72 splits = 1;
74 splits += 1;
77 UnicodeString *result = new UnicodeString[splits];
|
| H A D | csdetest.cpp | 112 static UnicodeString *split(const UnicodeString &src, UChar ch, int32_t &splits) argument
116 splits = 1;
118 splits += 1;
121 UnicodeString *result = new UnicodeString[splits];
159 int32_t splits = 0; local
161 UnicodeString *eSplit = split(encoding, CH_SLASH, splits);
212 if (splits > 1 && lang.compare(eSplit[1]) != 0) {
|
| H A D | regextst.cpp | 5192 UnicodeString splits[10]; local
5194 int32_t numFields = pMatcher->split(text, splits, 10, status);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| H A D | nv50_ir_ra.cpp | 705 std::list<Instruction *> splits; member in class:nv50_ir::GCRA
938 splits.push_back(insn);
1379 splits.clear(); // avoid duplicate entries on next coalesce pass
1607 for (std::list<Instruction *>::iterator it = splits.begin();
1608 it != splits.end();
1619 splits.clear();
1947 // spilling splits is annoying, just make sure they're separate
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| H A D | nv50_ir_ra.cpp | 705 std::list<Instruction *> splits; member in class:nv50_ir::GCRA
938 splits.push_back(insn);
1379 splits.clear(); // avoid duplicate entries on next coalesce pass
1607 for (std::list<Instruction *>::iterator it = splits.begin();
1608 it != splits.end();
1619 splits.clear();
1947 // spilling splits is annoying, just make sure they're separate
|
| /external/opencv/ml/src/ |
| H A D | mltree.cpp | 270 // create memory storage that will keep nodes and splits of the decision tree
1381 // find all the surrogate splits
1426 // for a surrogate split. Surrogate splits with quality less than node->maxlr
2054 // LL - number of samples that both the primary and the surrogate splits send to the left
2167 // LL - number of samples that both the primary and the surrogate splits send to the left
2442 // try to complete direction using surrogate splits
3110 cvStartWriteStruct( fs, "splits", CV_NODE_SEQ );
3203 CV_ERROR( CV_StsParseError, "some of the splits are not stored properly" );
3251 // for categorical splits we do not use inversed splits,
3288 CvFileNode* splits; local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.eclipse.equinox.p2.metadata_2.0.0.v20100601.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.text_3.5.0.v20100601-1300.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |