Searched refs:pieces (Results 1 - 25 of 57) sorted by relevance

123

/external/v8/tools/
H A Dobjdump-v848 pieces = line.split(None, 3)
49 return " " + pieces[0][2:] + ":\t" + pieces[3]
/external/skia/tools/lua/
H A Dcount_dashes.lua51 local pieces = 2*p
52 if pieces < 5 then
55 if pieces > 5 and pieces < 10 then
/external/icu/icu4c/source/common/
H A Dcaniter.cpp71 pieces(NULL),
90 if(pieces != NULL) {
92 if(pieces[i] != NULL) {
93 delete[] pieces[i];
96 uprv_free(pieces);
97 pieces = NULL;
146 buffer.append(pieces[i][current[i]]);
185 pieces = (UnicodeString **)uprv_malloc(sizeof(UnicodeString *));
190 if (pieces == NULL || pieces_lengths == NULL || current == NULL) {
195 pieces[
[all...]
H A Ducnv_imp.h104 * If the args are passed in, then the pieces must be passed in too.
106 * - pieces==NULL && args==NULL
107 * - pieces!=NULL && args==NULL
108 * - pieces!=NULL && args!=NULL
113 UConverterNamePieces *pieces,
/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DCanonicalIterator.java89 for (int i = 0; i < pieces.length; ++i) {
90 buffer.append(pieces[i][current[i]]);
102 if (current[i] < pieces[i].length) break; // got sequence
119 pieces = new String[1][];
121 pieces[0] = new String[]{""};
145 pieces = new String[segmentList.size()][];
147 for (i = 0; i < pieces.length; ++i) {
149 pieces[i] = getEquivalents(segmentList.get(i));
235 private String[][] pieces; field in class:CanonicalIterator
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DCanonicalIterator.java92 for (int i = 0; i < pieces.length; ++i) {
93 buffer.append(pieces[i][current[i]]);
105 if (current[i] < pieces[i].length) break; // got sequence
123 pieces = new String[1][];
125 pieces[0] = new String[]{""};
149 pieces = new String[segmentList.size()][];
151 for (i = 0; i < pieces.length; ++i) {
153 pieces[i] = getEquivalents(segmentList.get(i));
239 private String[][] pieces; field in class:CanonicalIterator
/external/autotest/client/site_tests/buffet_BasicDBusAPI/
H A Dbuffet_BasicDBusAPI.py68 pieces = line.split('=', 1)
69 if len(pieces) != 2:
71 key = pieces[0].strip()
73 expected_version = pieces[1].strip()
/external/libmojo/third_party/jinja2/
H A Dloaders.py26 pieces = []
33 pieces.append(piece)
34 return pieces
160 pieces = split_template_path(template)
162 filename = path.join(searchpath, *pieces)
222 pieces = split_template_path(template)
223 p = '/'.join((self.package_path,) + tuple(pieces))
/external/autotest/client/cros/faft/utils/
H A Dsaft_flashrom_util.py92 pieces = item.split('=')
93 if len(pieces) != 2:
95 rv[pieces[0]] = pieces[1].strip('"')
/external/icu/icu4c/source/common/unicode/
H A Dcaniter.h85 * Cleans pieces
170 // 2 dimensional array holds the pieces of the string with
172 UnicodeString **pieces; member in class:U_FINAL
176 // current is used in iterating to combine pieces
/external/toolchain-utils/
H A Dweekly_report.py51 pieces = test_path.split('/')
52 test_name = pieces[-1]
105 pieces = test_path.split('/') variable
106 test_name = pieces[-1]
H A Dtest_toolchains.py79 # Break this piece into the image number + other pieces, and get the
85 pieces = config.split('/')
86 compiler_version = pieces[-1]
/external/curl/docs/libcurl/
H A Dmksymbolsmanpage.pl58 introduced and for some symbols two additional information pieces:
/external/skia/bench/
H A DMeasureBench.cpp32 MeasureBench(bool usePathMeasure, float size, size_t pieces) argument
35 fPieces(pieces) {
/external/autotest/client/site_tests/firmware_TouchMTB/
H A Dfirmware_utils.py73 pieces = filename.split('-')
74 return pieces[1] if len(pieces) >= 2 else None
/external/guava/guava/src/com/google/common/net/
H A DInternetDomainName.java510 final String[] pieces = domain.split(DOT_REGEX, 2);
511 return pieces.length == 2 && PublicSuffixPatterns.UNDER.containsKey(pieces[1]);
/external/protobuf/java/core/src/test/java/com/google/protobuf/
H A DByteStringTest.java150 final List<ByteString> pieces = makeConcretePieces(testBytes);
152 ByteString byteString = ByteString.copyFrom(pieces);
159 return pieces.iterator();
548 List<ByteString> pieces = makeConcretePieces(referenceBytes);
549 ByteString listString = ByteString.copyFrom(pieces);
584 List<ByteString> pieces = makeConcretePieces(referenceBytes);
585 ByteString listString = ByteString.copyFrom(pieces);
597 List<ByteString> pieces = makeConcretePieces(referenceBytes);
599 Iterator<ByteString> iter = pieces.iterator();
698 List<ByteString> pieces
[all...]
/external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
H A DTransliterationChart.java155 UnicodeSet pieces = new UnicodeSet();
162 if (UCharacter.getName(d.charAt(1)).indexOf("LENGTH") >= 0) pieces.add(d.charAt(1));
164 pw.println(pieces);
/external/nanopb-c/generator/google/protobuf/internal/
H A Dencoder.py383 pieces = []
384 _EncodeVarint(pieces.append, value)
385 return "".join(pieces)
/external/protobuf/java/core/src/main/java/com/google/protobuf/
H A DRopeByteString.java50 * ByteStrings, without copying the data in the pieces. The concatenation is
63 * <p>Fundamentally the Rope algorithm represents the collection of pieces as a
147 * <p>Small pieces of length less than {@link
149 * BAP95. Large pieces are referenced without copy.
375 PieceIterator pieces = new PieceIterator(this);
376 while (pieces.hasNext()) {
377 LeafByteString byteString = pieces.next();
511 // We always get to the end of at least one of the pieces
556 * authors use an array to keep track of pieces, while here we use a stack.
622 // our new piece or of shorter pieces, t
[all...]
/external/protobuf/python/google/protobuf/internal/
H A Dencoder.py410 pieces = []
411 _EncodeVarint(pieces.append, value)
412 return b"".join(pieces)
/external/clang/tools/scan-build-py/libscanbuild/
H A Danalyze.py198 def prefix_with(constant, pieces):
204 return [elem for piece in pieces for elem in [constant, piece]]
/external/clang/lib/StaticAnalyzer/Core/
H A DBugReporter.cpp101 /// can lead to redundant diagnostic pieces at the same point in a path.
131 // Check to see if we should keep one of the two pieces. If we
153 /// Recursively scan through a path and prune out calls and macros pieces
156 static bool removeUnneededCalls(PathPieces &pieces, BugReport *R, argument
159 const unsigned N = pieces.size();
164 IntrusiveRefCntPtr<PathDiagnosticPiece> piece(pieces.front());
165 pieces.pop_front();
202 pieces.push_back(piece);
215 /// Recursively scan through a path and make sure that all call pieces have
285 /// Remove all pieces wit
1962 addContextEdges(PathPieces &pieces, SourceManager &SM, const ParentMap &PM, const LocationContext *LCtx) argument
2043 simplifySimpleBranches(PathPieces &pieces) argument
[all...]
H A DPathDiagnostic.cpp1033 static void compute_path_size(const PathPieces &pieces, unsigned &size) { argument
1034 for (PathPieces::const_iterator it = pieces.begin(),
1035 et = pieces.end(); it != et; ++it) {
/external/libunwind/doc/
H A Dunw_get_proc_info_by_ip.tex47 discontiguous pieces, \Prog{libunwind} will treat each piece as a

Completed in 1292 milliseconds

123