HomeSort by relevance Sort by last modified time
    Searched refs:parts (Results 176 - 200 of 1654) sorted by null

1 2 3 4 5 6 78 91011>>

  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_glob.py 16 def norm(self, *parts):
17 return os.path.normpath(os.path.join(self.tempdir, *parts))
19 def mktemp(self, *parts):
20 filename = self.norm(*parts)
45 def glob(self, *parts):
46 if len(parts) == 1:
47 pattern = parts[0]
49 pattern = os.path.join(*parts)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_glob.py 16 def norm(self, *parts):
17 return os.path.normpath(os.path.join(self.tempdir, *parts))
19 def mktemp(self, *parts):
20 filename = self.norm(*parts)
45 def glob(self, *parts):
46 if len(parts) == 1:
47 pattern = parts[0]
49 pattern = os.path.join(*parts)
  /tools/tradefederation/core/src/com/android/tradefed/device/
DeviceSelectionOptions.java 439 String[] parts = prod.split(VARIANT_SEPARATOR); local
440 if (parts.length == 1) {
441 splitProducts.put(parts[0], null);
442 } else if (parts.length == 2) {
444 Collection<String> variants = splitProducts.get(parts[0]);
447 splitProducts.put(parts[0], variants);
449 variants.add(parts[1]);
453 prod, VARIANT_SEPARATOR, parts.length));
  /external/autotest/client/common_lib/cros/
chrome.py 27 parts = re.split('@', username)
28 parts[0] = re.sub('\.', '', parts[0])
30 if len(parts) == 1:
31 parts.append('gmail.com')
32 return '@'.join(parts)
  /external/autotest/server/site_tests/brillo_Gtests/
brillo_Gtests.py 97 parts = line.split(',')
98 if len(parts) < 2:
103 name = parts[0].strip()
104 extra_args = parts[2].strip() if len(parts) > 2 else ''
106 suite_map[name] = GtestSuite(name, path, parts[1].strip() == 'yes',
  /external/boringssl/src/crypto/err/
err_data_generate.go 191 parts := bytes.Split(line, comma)
192 if len(parts) != 3 {
193 return fmt.Errorf("bad line %d in %s: found %d values but want 3", lineNo, filename, len(parts))
195 libNum, ok := e.libraryMap[string(parts[0])]
202 key, err := strconv.ParseUint(string(parts[1]), 10 /* base */, 32 /* bit size */)
209 value := string(parts[2])
  /external/protobuf/java/util/src/main/java/com/google/protobuf/util/
FieldMaskTree.java 97 String[] parts = path.split(FIELD_PATH_SEPARATOR_REGEX); local
98 if (parts.length == 0) {
104 for (String part : parts) {
164 String[] parts = path.split(FIELD_PATH_SEPARATOR_REGEX); local
165 if (parts.length == 0) {
169 for (String part : parts) {
  /external/toolchain-utils/automation/clients/helper/
perforce.py 50 parts = [part for part in path_s.strip('/').split('/') if part]
52 if not parts:
55 return os.path.join(*parts)
94 parts = root_s.strip('/').split('/', 1)
96 if len(parts) != 1:
99 return parts[0]
  /frameworks/base/tools/aapt2/
Locale.cpp 78 std::vector<std::string> parts = util::SplitAndLowercase(str, '_'); local
80 const int num_tags = parts.size();
83 const std::string& lang = parts[0];
95 const std::string& part2 = parts[1];
112 const std::string& part3 = parts[2];
127 const std::string& part4 = parts[3];
  /external/aac/libSBRenc/src/
fram_gen.cpp 233 static void fillFramePost (INT *parts, INT *d, INT dmax, INT *v_bord,
250 INT *parts, INT d);
260 INT i_cmon, INT i_tran, INT parts, INT numberTimeSlots);
369 INT numEnv, tranPosInternal=0, bmin=0, bmax=0, parts, d, i_cmon=0, i_tran=0, nL; local
541 Design remaining parts of T/F-grid (assuming next frame is VarFix)
553 fillFramePost (&parts, &d, dmax, v_bord, length_v_bord, v_freq,
559 if (parts == 1 && d < dmin) /* no fill, short last envelope */
561 v_freq, length_v_freq, &parts, d);
574 v_bord, length_v_bord, v_freq, i_cmon, i_tran, parts, numberTimeSlots); /* FH 00-06-26 */
617 Design remaining parts of T/F-grid (assuming next frame is VarFix
976 INT parts, d, j, S, s = 0, segm, bord; local
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/src/
math_private.h 60 } parts; member in union:__anon1357
78 } parts; member in union:__anon1360
93 (ix0) = ew_u.parts.msw; \
94 (ix1) = ew_u.parts.lsw; \
111 (i) = gh_u.parts.msw; \
120 (i) = gl_u.parts.lsw; \
128 iw_u.parts.msw = (ix0); \
129 iw_u.parts.lsw = (ix1); \
147 sh_u.parts.msw = (v); \
157 sl_u.parts.lsw = (v);
    [all...]
  /frameworks/opt/net/voip/src/java/android/net/sip/
SimpleSessionDescription.java 92 String[] parts = line.substring(2).split(" ", 4); local
93 String[] ports = parts[1].split("/", 2);
94 Media media = newMedia(parts[0], Integer.parseInt(ports[0]),
96 parts[2]);
97 for (String format : parts[3].split(" ")) {
385 * has three parts: a key, a delimiter, and a value. Delimiters are special
406 String[] parts = address.split(" "); local
407 if (parts.length != 3) {
410 int slash = parts[2].indexOf('/');
411 return (slash < 0) ? parts[2] : parts[2].substring(0, slash)
    [all...]
  /prebuilts/go/darwin-x86/src/database/sql/
fakedb_test.go 196 parts := strings.Split(dsn, ";")
197 if len(parts) < 1 {
200 name := parts[0]
209 if len(parts) >= 2 && parts[1] == "badConn" {
404 // parts are table|selectCol1,selectCol2|whereCol=?,whereCol2=?
407 func (c *fakeConn) prepareSelect(stmt *fakeStmt, parts []string) (*fakeStmt, error) {
408 if len(parts) != 3 {
410 return nil, errf("invalid SELECT syntax with %d parts; want 3", len(parts))
    [all...]
  /prebuilts/go/linux-x86/src/database/sql/
fakedb_test.go 196 parts := strings.Split(dsn, ";")
197 if len(parts) < 1 {
200 name := parts[0]
209 if len(parts) >= 2 && parts[1] == "badConn" {
404 // parts are table|selectCol1,selectCol2|whereCol=?,whereCol2=?
407 func (c *fakeConn) prepareSelect(stmt *fakeStmt, parts []string) (*fakeStmt, error) {
408 if len(parts) != 3 {
410 return nil, errf("invalid SELECT syntax with %d parts; want 3", len(parts))
    [all...]
  /prebuilts/ndk/r11/sources/android/support/src/msun/
math_private.h 60 } parts; member in union:__anon111570
78 } parts; member in union:__anon111573
93 (ix0) = ew_u.parts.msw; \
94 (ix1) = ew_u.parts.lsw; \
111 (i) = gh_u.parts.msw; \
120 (i) = gl_u.parts.lsw; \
128 iw_u.parts.msw = (ix0); \
129 iw_u.parts.lsw = (ix1); \
147 sh_u.parts.msw = (v); \
157 sl_u.parts.lsw = (v);
    [all...]
  /prebuilts/ndk/r13/sources/android/support/src/msun/
math_private.h 60 } parts; member in union:__anon111958
78 } parts; member in union:__anon111961
93 (ix0) = ew_u.parts.msw; \
94 (ix1) = ew_u.parts.lsw; \
111 (i) = gh_u.parts.msw; \
120 (i) = gl_u.parts.lsw; \
128 iw_u.parts.msw = (ix0); \
129 iw_u.parts.lsw = (ix1); \
147 sh_u.parts.msw = (v); \
157 sl_u.parts.lsw = (v);
    [all...]
  /external/boringssl/src/ssl/test/runner/ed25519/
ed25519_test.go 113 parts := strings.Split(line, ":")
114 if len(parts) != 5 {
115 t.Fatalf("bad number of parts on line %d", lineNo)
118 privBytes, _ := hex.DecodeString(parts[0])
119 pubKey, _ := hex.DecodeString(parts[1])
120 msg, _ := hex.DecodeString(parts[2])
121 sig, _ := hex.DecodeString(parts[3])
  /prebuilts/go/darwin-x86/src/cmd/internal/obj/x86/
obj6_test.go 57 parts := strings.Split(line, "->")
58 if len(parts) != 2 {
64 for _, input_insn := range strings.Split(parts[0], ";") {
68 for _, expected_insn := range strings.Split(parts[1], ";") {
126 parts := strings.SplitN(line, "\t", 3)
127 if len(parts) != 3 {
130 n := normalize(parts[2])
  /prebuilts/go/linux-x86/src/cmd/internal/obj/x86/
obj6_test.go 57 parts := strings.Split(line, "->")
58 if len(parts) != 2 {
64 for _, input_insn := range strings.Split(parts[0], ";") {
68 for _, expected_insn := range strings.Split(parts[1], ";") {
126 parts := strings.SplitN(line, "\t", 3)
127 if len(parts) != 3 {
130 n := normalize(parts[2])
  /external/swiftshader/third_party/LLVM/lib/Support/
APFloat.cpp 65 /* A tight upper bound on number of parts required to hold the value
70 However, whilst the result may require only this many parts,
74 requires two parts to hold the single-part result). So we add an
352 lostFractionThroughTruncation(const integerPart *parts,
358 lsb = APInt::tcLSB(parts, partCount);
366 APInt::tcExtractBit(parts, bits - 1))
374 shiftRight(integerPart *dst, unsigned int parts, unsigned int bits)
378 lost_fraction = lostFractionThroughTruncation(dst, parts, bits);
380 APInt::tcShiftRight(dst, parts, bits);
422 ulpsFromBoundary(const integerPart *parts, unsigned int bits, bool isNearest
    [all...]
  /development/scripts/
native_heapdump_viewer.py 112 parts = line.split() variable
113 if len(parts) > 7 and parts[0] == "z" and parts[2] == "sz":
114 is_zygote = parts[1] != "1"
115 size = int(parts[3])
116 frames = map(lambda x: int(x, 16), parts[7:])
  /external/dagger2/compiler/src/main/java/dagger/internal/codegen/writer/
ClassName.java 201 List<String> parts = Splitter.on('.').splitToList(classNameString); local
203 for (int i = 0; i < parts.size(); i++) {
204 String part = parts.get(i);
221 int lastIndex = parts.size() - 1;
223 Joiner.on('.').join(parts.subList(0, firstClassPartIndex)),
226 : ImmutableList.copyOf(parts.subList(firstClassPartIndex, lastIndex)),
227 parts.get(lastIndex));
  /developers/build/prebuilts/gradle/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/util/
DiskLruCache.java 369 String[] parts = line.split(" "); local
370 if (parts.length < 2) {
374 String key = parts[1];
375 if (parts[0].equals(REMOVE) && parts.length == 2) {
386 if (parts[0].equals(CLEAN) && parts.length == 2 + valueCount) {
389 entry.setLengths(copyOfRange(parts, 2, parts.length));
390 } else if (parts[0].equals(DIRTY) && parts.length == 2)
    [all...]
  /developers/samples/android/ui/graphics/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/util/
DiskLruCache.java 369 String[] parts = line.split(" "); local
370 if (parts.length < 2) {
374 String key = parts[1];
375 if (parts[0].equals(REMOVE) && parts.length == 2) {
386 if (parts[0].equals(CLEAN) && parts.length == 2 + valueCount) {
389 entry.setLengths(copyOfRange(parts, 2, parts.length));
390 } else if (parts[0].equals(DIRTY) && parts.length == 2)
    [all...]
  /development/samples/browseable/DisplayingBitmaps/src/com.example.android.displayingbitmaps/util/
DiskLruCache.java 369 String[] parts = line.split(" "); local
370 if (parts.length < 2) {
374 String key = parts[1];
375 if (parts[0].equals(REMOVE) && parts.length == 2) {
386 if (parts[0].equals(CLEAN) && parts.length == 2 + valueCount) {
389 entry.setLengths(copyOfRange(parts, 2, parts.length));
390 } else if (parts[0].equals(DIRTY) && parts.length == 2)
    [all...]

Completed in 1745 milliseconds

1 2 3 4 5 6 78 91011>>