| /system/core/base/ |
| parsenetaddress.cpp | 51 std::vector<std::string> pieces = Split(address, ":"); local
52 *host = pieces[0];
53 if (pieces.size() > 1) {
54 port_str = pieces[1];
|
| /external/icu/icu4c/source/common/unicode/ |
| caniter.h | 83 * Cleans pieces
168 // 2 dimensional array holds the pieces of the string with
170 UnicodeString **pieces; member in class:U_FINAL
174 // current is used in iterating to combine pieces
|
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| AnnotationUtils.java | 171 * Split the string into pieces that are likely to be common
177 ArrayList<String> pieces = new ArrayList<String>(20); local
205 pieces.add(raw.substring(at, endAt));
209 int size = pieces.size();
213 list.set(i, new CstString(pieces.get(i)));
|
| /dalvik/dx/src/com/android/dx/dex/file/ |
| AnnotationUtils.java | 170 * Split the string into pieces that are likely to be common
176 ArrayList<String> pieces = new ArrayList<String>(20); local
204 pieces.add(raw.substring(at, endAt));
208 int size = pieces.size();
212 list.set(i, new CstString(pieces.get(i)));
|
| /external/ceres-solver/examples/ |
| nist.cc | 147 bool GetAndSplitLine(std::ifstream& ifs, std::vector<std::string>* pieces) {
148 pieces->clear();
151 SplitStringUsingChar(std::string(buf), ' ', pieces); local
167 std::vector<std::string> pieces; local
169 GetAndSplitLine(ifs, &pieces);
170 const int kNumResponses = std::atoi(pieces[1].c_str());
172 GetAndSplitLine(ifs, &pieces);
173 const int kNumPredictors = std::atoi(pieces[0].c_str());
175 GetAndSplitLine(ifs, &pieces);
176 const int kNumObservations = std::atoi(pieces[0].c_str())
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| AnnotationUtils.java | 169 * Split the string into pieces that are likely to be common
175 ArrayList<String> pieces = new ArrayList<String>(20); local
203 pieces.add(raw.substring(at, endAt));
207 int size = pieces.size();
211 list.set(i, new CstString(pieces.get(i)));
|
| /external/guava/guava/src/com/google/common/net/ |
| InternetDomainName.java | 510 final String[] pieces = domain.split(DOT_REGEX, 2); local
511 return pieces.length == 2 && PublicSuffixPatterns.UNDER.containsKey(pieces[1]);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CanonicalIterator.java | 87 for (int i = 0; i < pieces.length; ++i) {
88 buffer.append(pieces[i][current[i]]);
100 if (current[i] < pieces[i].length) break; // got sequence
117 pieces = new String[1][];
119 pieces[0] = new String[]{""};
143 pieces = new String[segmentList.size()][];
145 for (i = 0; i < pieces.length; ++i) {
147 pieces[i] = getEquivalents(segmentList.get(i));
233 private String[][] pieces; field in class:CanonicalIterator
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| CanonicalIterator.java | 90 for (int i = 0; i < pieces.length; ++i) {
91 buffer.append(pieces[i][current[i]]);
103 if (current[i] < pieces[i].length) break; // got sequence
121 pieces = new String[1][];
123 pieces[0] = new String[]{""};
147 pieces = new String[segmentList.size()][];
149 for (i = 0; i < pieces.length; ++i) {
151 pieces[i] = getEquivalents(segmentList.get(i));
237 private String[][] pieces; field in class:CanonicalIterator
|
| /frameworks/base/core/java/android/net/ |
| NetworkUtils.java | 282 String[] pieces = ipAndMaskString.split("/", 2); local
283 prefixLength = Integer.parseInt(pieces[1]);
284 address = InetAddress.parseNumericAddress(pieces[0]);
|
| /frameworks/base/tools/aapt2/util/ |
| Util.cpp | 122 size_t pieces = 0; local
124 pieces++;
138 return pieces >= 2;
146 size_t pieces = 0; local
148 pieces++;
161 return pieces >= 1;
|
| /frameworks/ex/common/java/com/android/common/ |
| OperationScheduler.java | 111 String[] pieces = param.substring(8).split("\\+"); local
112 if (pieces.length > 3) {
115 if (pieces.length > 0 && pieces[0].length() > 0) {
116 options.backoffFixedMillis = parseSeconds(pieces[0]);
118 if (pieces.length > 1 && pieces[1].length() > 0) {
119 options.backoffIncrementalMillis = parseSeconds(pieces[1]);
121 if (pieces.length > 2 && pieces[2].length() > 0)
[all...] |
| /system/core/adb/ |
| services.cpp | 448 std::vector<std::string> pieces = android::base::Split(port_spec, ","); local
449 if (pieces.size() != 2) {
455 int console_port = strtol(pieces[0].c_str(), NULL, 0);
456 int adb_port = strtol(pieces[1].c_str(), NULL, 0);
|
| adb.cpp | 242 std::vector<std::string> pieces = android::base::Split(banner, ":"); local
248 if (pieces.size() > 2) {
249 const std::string& props = pieces[2];
271 const std::string& type = pieces[0];
932 std::vector<std::string> pieces = android::base::Split(service, ";"); local
[all...] |
| /system/tools/aidl/ |
| aidl.cpp | 422 vector<string> pieces = Split(line.substr(0, end + 1), " \t"); local
423 for (const string& piece : pieces) {
|
| type_cpp.cpp | 570 auto pieces = Split(package, "."); local
571 for (const string& piece : pieces) {
|
| /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/ |
| TransliterationChart.java | 153 UnicodeSet pieces = new UnicodeSet(); local
160 if (UCharacter.getName(d.charAt(1)).indexOf("LENGTH") >= 0) pieces.add(d.charAt(1));
162 pw.println(pieces);
|
| /system/core/init/ |
| util.cpp | 434 std::vector<std::string> pieces = android::base::Split(entry, "="); local
435 if (pieces.size() == 2) {
436 fn(pieces[0], pieces[1], in_qemu);
|
| /bootable/recovery/applypatch/ |
| applypatch.cpp | 109 std::vector<std::string> pieces = android::base::Split(copy, ":"); local
110 if (pieces.size() < 4 || pieces.size() % 2 != 0) {
116 if (pieces[0] == "MTD") {
118 } else if (pieces[0] == "EMMC") {
124 const char* partition = pieces[1].c_str();
126 size_t pairs = (pieces.size() - 2) / 2; // # of (size, sha1) pairs in filename
132 size[i] = strtol(pieces[i*2+2].c_str(), NULL, 10);
137 sha1sum[i] = pieces[i*2+3].c_str();
310 std::vector<std::string> pieces = android::base::Split(copy, ":") local
731 std::vector<std::string> pieces = android::base::Split(target_str, ":"); local
[all...] |
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| meteor-contest.c | 55 /* The puzzle pieces must be specified by the path followed
106 * at each position on the board. That's 10 pieces x 50 board positions x
109 * The pieces are going to be unsigned long long ints just like the board so
114 unsigned long long pieces[10][50][12]; variable
302 pieces[piece][minimum][piece_counts[piece][minimum]] = piece_mask;
330 /* To thin the number of pieces, I calculate if any of them trap any empty
363 * number of attempted pieces in the solve algorithm by not including the 180-
364 * degree-rotated pieces of ONE of the pieces. I chose piece 3 because it gave
525 * leftmost empty cell. Mark off available pieces as it goes along
[all...] |
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| meteor-contest.c | 55 /* The puzzle pieces must be specified by the path followed
106 * at each position on the board. That's 10 pieces x 50 board positions x
109 * The pieces are going to be unsigned long long ints just like the board so
114 unsigned long long pieces[10][50][12]; variable
302 pieces[piece][minimum][piece_counts[piece][minimum]] = piece_mask;
330 /* To thin the number of pieces, I calculate if any of them trap any empty
363 * number of attempted pieces in the solve algorithm by not including the 180-
364 * degree-rotated pieces of ONE of the pieces. I chose piece 3 because it gave
525 * leftmost empty cell. Mark off available pieces as it goes along
[all...] |
| /bootable/recovery/updater/ |
| blockimg.cpp | 78 std::vector<std::string> pieces = android::base::Split(range_text, ","); local
79 if (pieces.size() < 3) {
84 if (!android::base::ParseUint(pieces[0].c_str(), &num, static_cast<size_t>(INT_MAX))) {
90 } else if (num != pieces.size() - 1) {
99 if (!android::base::ParseUint(pieces[i+1].c_str(), &rs.pos[i],
104 if (!android::base::ParseUint(pieces[i+2].c_str(), &rs.pos[i+1],
[all...] |
| /external/protobuf/java/src/main/java/com/google/protobuf/ |
| RopeByteString.java | 48 * ByteStrings, without copying the data in the pieces. The concatenation is
60 * <p>Fundamentally the Rope algorithm represents the collection of pieces as a
143 * <p>Small pieces of length less than {@link
145 * BAP95. Large pieces are referenced without copy.
273 // Pieces
390 PieceIterator pieces = new PieceIterator(this); local
391 while (pieces.hasNext()) {
392 LiteralByteString byteString = pieces.next();
522 // We always get to the end of at least one of the pieces
594 * authors use an array to keep track of pieces, while here we use a stack
784 private final PieceIterator pieces; field in class:RopeByteString.RopeByteIterator
[all...] |
| /external/protobuf/java/src/test/java/com/google/protobuf/ |
| ByteStringTest.java | 149 final List<ByteString> pieces = makeConcretePieces(testBytes); local
151 ByteString byteString = ByteString.copyFrom(pieces);
157 return pieces.iterator();
546 List<ByteString> pieces = makeConcretePieces(referenceBytes); local
547 ByteString listString = ByteString.copyFrom(pieces);
582 List<ByteString> pieces = makeConcretePieces(referenceBytes); local
583 ByteString listString = ByteString.copyFrom(pieces);
595 List<ByteString> pieces = makeConcretePieces(referenceBytes); local
597 Iterator<ByteString> iter = pieces.iterator();
696 List<ByteString> pieces = new ArrayList<ByteString>() local
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| ssearch.cpp | 1156 int32_t pieces = (m_rand() % 4) + 1; local
[all...] |
