HomeSort by relevance Sort by last modified time
    Searched defs:pieces (Results 1 - 25 of 40) sorted by null

1 2

  /external/chromium_org/chrome/common/
chrome_content_client_unittest.cc 15 std::vector<std::string> pieces; local
17 // Check if the pieces of the user agent string come in the correct order.
21 base::SplitStringUsingSubstr(buffer, "Mozilla/5.0 (", &pieces);
22 ASSERT_EQ(2u, pieces.size());
23 buffer = pieces[1];
24 EXPECT_EQ("", pieces[0]);
26 base::SplitStringUsingSubstr(buffer, ") AppleWebKit/", &pieces);
27 ASSERT_EQ(2u, pieces.size());
28 buffer = pieces[1];
29 std::string os_str = pieces[0]
    [all...]
  /external/chromium_org/gpu/config/
gpu_info_collector.cc 71 std::vector<std::string> pieces; local
72 base::SplitString(sub_string, '.', &pieces);
73 if (pieces.size() >= 2)
74 return pieces[0] + "." + pieces[1];
gpu_info_collector_android.cc 40 std::vector<std::string> pieces; local
41 base::SplitString(sub_string, '.', &pieces);
42 if (pieces.size() < 2)
44 return pieces[0] + "." + pieces[1];
gpu_info_collector_x11.cc 250 std::vector<std::string> pieces; local
251 base::SplitStringAlongWhitespace(gl_version_string, &pieces);
254 if (pieces.size() < 3)
257 std::string driver_version = pieces[2];
264 gpu_info->driver_vendor = pieces[1];
gpu_control_list.cc 1212 std::vector<std::string> pieces; local
1233 std::vector<std::string> pieces; local
1305 std::vector<std::string> pieces; local
    [all...]
  /external/chromium_org/third_party/icu/source/common/unicode/
caniter.h 83 * Cleans pieces
166 // 2 dimensional array holds the pieces of the string with
168 UnicodeString **pieces; member in class:CanonicalIterator
172 // current is used in iterating to combine pieces
  /external/icu4c/common/unicode/
caniter.h 83 * Cleans pieces
168 // 2 dimensional array holds the pieces of the string with
170 UnicodeString **pieces; member in class:CanonicalIterator
174 // current is used in iterating to combine pieces
  /frameworks/base/core/java/android/net/
LinkAddress.java 71 String [] pieces = address.split("/", 2); local
72 prefixLength = Integer.parseInt(pieces[1]);
73 inetAddress = InetAddress.parseNumericAddress(pieces[0]);
  /external/chromium_org/chrome/browser/ui/autofill/
generated_credit_card_bubble_controller.cc 186 std::vector<base::string16> pieces; local
187 base::SplitStringDontTrim(to_split, kRangeSeparator, &pieces);
189 while (!pieces.empty()) {
190 base::string16 piece = pieces.front();
194 // to work for "|highlighting| starts here". Ignore empty pieces because
196 if (!piece.empty() && pieces.size() % 2 == 0) {
206 pieces.erase(pieces.begin(), pieces.begin() + 1);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
multiway_mergesort.h 86 /** @brief Pieces of data to merge @c [thread][sequence] */
87 std::vector<Piece<difference_type> >* pieces; member in struct:__gnu_parallel::PMWMSSortingData
161 sd->pieces[iam][seq].end = offsets[seq] - seqs[seq].first;
164 sd->pieces[iam][seq].end =
174 sd->pieces[iam][seq].begin = sd->pieces[iam - 1][seq].end;
177 sd->pieces[iam][seq].begin = 0;
216 sd->pieces[iam][s].begin =
225 sd->pieces[iam][s].begin = 0;
228 sd->pieces[iam][s].end
    [all...]
multiway_merge.h 1333 std::vector<std::pair<difference_type, difference_type> >* pieces; local
    [all...]
  /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 174 * Split the string into pieces that are likely to be common
180 ArrayList<String> pieces = new ArrayList<String>(20); local
208 pieces.add(raw.substring(at, endAt));
212 int size = pieces.size();
216 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
175 std::vector<std::string> pieces; local
177 GetAndSplitLine(ifs, &pieces);
178 const int kNumResponses = std::atoi(pieces[1].c_str());
180 GetAndSplitLine(ifs, &pieces);
181 const int kNumPredictors = std::atoi(pieces[0].c_str());
183 GetAndSplitLine(ifs, &pieces);
184 const int kNumObservations = std::atoi(pieces[0].c_str())
    [all...]
  /external/chromium_org/gpu/command_buffer/service/
feature_info.cc 72 std::vector<std::string> pieces; local
73 base::SplitString(types, ',', &pieces);
74 for (size_t i = 0; i < pieces.size(); ++i) {
76 bool succeed = base::StringToInt(pieces[i], &number);
  /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 543 final String[] pieces = domain.split(DOT_REGEX, 2); local
544 return pieces.length == 2 && TldPatterns.UNDER.contains(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...]
  /libcore/luni/src/main/java/javax/crypto/
Cipher.java 336 String[] pieces = transformation.split("/"); local
337 if (pieces.length > 3) {
340 // Empty or missing pieces are represented by null.
342 for (int i = 0; i < pieces.length; ++i) {
343 String piece = pieces[i].trim();
    [all...]
  /build/tools/releasetools/
common.py 189 pieces = line.split() variable in class:LoadRecoveryFSTab.Partition
190 if not (3 <= len(pieces) <= 4):
194 p.mount_point = pieces[0]
195 p.fs_type = pieces[1]
196 p.device = pieces[2]
199 if len(pieces) >= 4:
200 if pieces[3].startswith("/"):
201 p.device2 = pieces[3]
202 if len(pieces) >= 5:
203 options = pieces[4
225 pieces = line.split() variable in class:LoadRecoveryFSTab.Partition
    [all...]
  /external/chromium_org/net/ftp/
ftp_network_transaction.cc 182 // Split the line into comma-separated pieces and extract
184 std::vector<std::string> pieces; local
185 base::SplitString(line, ',', &pieces);
186 if (pieces.size() != 6)
192 if (!base::StringToInt(pieces[4], &p0))
194 if (!base::StringToInt(pieces[5], &p1))
    [all...]
  /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/
RopeByteString.java 49 * ByteStrings, without copying the data in the pieces. The concatenation is
61 * <p>Fundamentally the Rope algorithm represents the collection of pieces as a
144 * <p>Small pieces of length less than {@link
146 * BAP95. Large pieces are referenced without copy.
274 // Pieces
391 PieceIterator pieces = new PieceIterator(this); local
392 while (pieces.hasNext()) {
393 LiteralByteString byteString = pieces.next();
509 // We always get to the end of at least one of the pieces
581 * authors use an array to keep track of pieces, while here we use a stack
772 private final PieceIterator pieces; field in class:RopeByteString.RopeByteIterator
    [all...]
  /external/chromium_org/third_party/protobuf/java/src/test/java/com/google/protobuf/
ByteStringTest.java 148 final List<ByteString> pieces = makeConcretePieces(testBytes); local
150 ByteString byteString = ByteString.copyFrom(pieces);
156 return pieces.iterator();
545 List<ByteString> pieces = makeConcretePieces(referenceBytes); local
546 ByteString listString = ByteString.copyFrom(pieces);
581 List<ByteString> pieces = makeConcretePieces(referenceBytes); local
582 ByteString listString = ByteString.copyFrom(pieces);
594 List<ByteString> pieces = makeConcretePieces(referenceBytes); local
596 Iterator<ByteString> iter = pieces.iterator();
680 List<ByteString> pieces = new ArrayList<ByteString>() local
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
ssearch.cpp 1860 int32_t pieces = (m_rand() % 4) + 1; local
    [all...]
  /external/icu4c/test/intltest/
ssearch.cpp 1158 int32_t pieces = (m_rand() % 4) + 1; local
    [all...]

Completed in 581 milliseconds

1 2