/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/utils/ |
StringEscapeUtils.java | 227 private final int longest; field in class:StringEscapeUtils.LookupTranslator 257 longest = _longest; 267 int max = longest; 268 if (index + longest > input.length()) {
|
/external/selinux/libselinux/src/ |
matchpathcon.c | 266 int h, used, nel, len, longest; local 272 longest = 0; 281 if (len > longest) 282 longest = len; 287 ("%s: hash table stats: %d elements, %d/%d buckets used, longest chain length %d\n", 288 __FUNCTION__, nel, used, HASH_BUCKETS, longest);
|
selinux_restorecon.c | 488 int h, used, nel, len, longest; local 494 longest = 0; 502 if (len > longest) 503 longest = len; 508 "filespec hash table stats: %d elements, %d/%d buckets used, longest chain length %d\n", 509 nel, used, HASH_BUCKETS, longest);
|
/prebuilts/go/darwin-x86/src/regexp/ |
exec_test.go | 209 refull.longest = false 214 re.longest = false 219 refull.longest = true 220 return refull.FindStringSubmatchIndex(text), "[full,longest]" 224 re.longest = true 225 return re.FindStringSubmatchIndex(text), "[longest]" 236 refull.longest = false 241 re.longest = false 246 refull.longest = true 247 return refull.MatchString(text), "[full,longest]" [all...] |
backtrack.go | 127 longest := m.re.longest 271 if !m.matched || (longest && pos > 0 && pos > m.matchcap[1]) { 277 if !longest {
|
exec.go | 199 longest := m.re.longest 206 if longest && m.matched && len(t.cap) > 0 && m.matchcap[0] < t.cap[0] { 217 if len(t.cap) > 0 && (!longest || !m.matched || m.matchcap[1] < pos) { 221 if !longest {
|
/prebuilts/go/linux-x86/src/regexp/ |
exec_test.go | 209 refull.longest = false 214 re.longest = false 219 refull.longest = true 220 return refull.FindStringSubmatchIndex(text), "[full,longest]" 224 re.longest = true 225 return re.FindStringSubmatchIndex(text), "[longest]" 236 refull.longest = false 241 re.longest = false 246 refull.longest = true 247 return refull.MatchString(text), "[full,longest]" [all...] |
backtrack.go | 127 longest := m.re.longest 271 if !m.matched || (longest && pos > 0 && pos > m.matchcap[1]) { 277 if !longest {
|
exec.go | 199 longest := m.re.longest 206 if longest && m.matched && len(t.cap) > 0 && m.matchcap[0] < t.cap[0] { 217 if len(t.cap) > 0 && (!longest || !m.matched || m.matchcap[1] < pos) { 221 if !longest {
|
/external/zopfli/src/zopfli/ |
blocksplitter.c | 202 size_t longest = 0; local 208 if (!done[start] && end - start > longest) { 212 longest = end - start;
|
/build/kati/ |
stats.go | 120 Longest time.Duration 141 if d > sd.Longest { 142 sd.Longest = d 161 fmt.Println("count,longest(ns),total(ns),longest,total,name") 163 fmt.Printf("%d,%d,%d,%v,%v,%s\n", s.Count, s.Longest, s.Total, s.Longest, s.Total, s.Name)
|
/developers/build/prebuilts/gradle/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/ui/ |
ImageDetailActivity.java | 68 // For this sample we'll use half of the longest width to resize our images. As the 73 final int longest = (height > width ? height : width) / 2; local 80 mImageFetcher = new ImageFetcher(this, longest);
|
/developers/samples/android/ui/graphics/DisplayingBitmaps/Application/src/main/java/com/example/android/displayingbitmaps/ui/ |
ImageDetailActivity.java | 68 // For this sample we'll use half of the longest width to resize our images. As the 73 final int longest = (height > width ? height : width) / 2; local 80 mImageFetcher = new ImageFetcher(this, longest);
|
/development/samples/browseable/DisplayingBitmaps/src/com.example.android.displayingbitmaps/ui/ |
ImageDetailActivity.java | 68 // For this sample we'll use half of the longest width to resize our images. As the 73 final int longest = (height > width ? height : width) / 2; local 80 mImageFetcher = new ImageFetcher(this, longest);
|
/external/lz4/lib/ |
lz4hc.c | 185 int longest, 210 if (*(iLowLimit + longest) == *(matchPtr - delta + longest)) { 222 if (mlt > longest) { 223 longest = (int)mlt; 241 if ((int)mlt > longest) { longest = (int)mlt; *matchpos = base + matchIndex + back; *startpos = ip+back; } 247 return longest;
|
/prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/unicode/norm/ |
example_iter_test.go | 31 // FindPrefix finds the longest common prefix of ASCII characters
|
/prebuilts/go/linux-x86/src/vendor/golang_org/x/text/unicode/norm/ |
example_iter_test.go | 31 // FindPrefix finds the longest common prefix of ASCII characters
|
/external/icu/icu4c/source/tools/tzcode/ |
zdump.c | 227 static size_t longest; variable 517 longest = 0; 519 if (strlen(argv[i]) > longest) 520 longest = strlen(argv[i]); 529 || (fakeenv[0] = malloc(longest + 4)) == NULL) { 804 (void) printf("%-*s ", (int) longest, zone);
|
/prebuilts/go/darwin-x86/src/internal/syscall/windows/registry/ |
key.go | 158 MaxSubKeyLen uint32 // size of the key's subkey with the longest name, in Unicode characters, not including the terminating zero byte 160 MaxValueNameLen uint32 // size of the key's longest value name, in Unicode characters, not including the terminating zero byte 161 MaxValueLen uint32 // longest data component among the key's values, in bytes
|
/prebuilts/go/linux-x86/src/internal/syscall/windows/registry/ |
key.go | 158 MaxSubKeyLen uint32 // size of the key's subkey with the longest name, in Unicode characters, not including the terminating zero byte 160 MaxValueNameLen uint32 // size of the key's longest value name, in Unicode characters, not including the terminating zero byte 161 MaxValueLen uint32 // longest data component among the key's values, in bytes
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
trace.py | 198 # looking in sys.path for the longest matching prefix. We'll
202 longest = ""
206 if len(dir) > len(longest):
207 longest = dir
209 if longest:
210 base = path[len(longest) + 1:]
|
/external/python/cpython2/Lib/ |
trace.py | 198 # looking in sys.path for the longest matching prefix. We'll 202 longest = "" 206 if len(dir) > len(longest): 207 longest = dir 209 if longest: 210 base = path[len(longest) + 1:]
|
/external/python/cpython3/Lib/ |
trace.py | 147 # looking in sys.path for the longest matching prefix. We'll 151 longest = "" 155 if len(dir) > len(longest): 156 longest = dir 158 if longest: 159 base = path[len(longest) + 1:]
|
/prebuilts/gdb/darwin-x86/lib/python2.7/ |
trace.py | 198 # looking in sys.path for the longest matching prefix. We'll 202 longest = "" 206 if len(dir) > len(longest): 207 longest = dir 209 if longest: 210 base = path[len(longest) + 1:]
|
/prebuilts/gdb/linux-x86/lib/python2.7/ |
trace.py | 198 # looking in sys.path for the longest matching prefix. We'll 202 longest = "" 206 if len(dir) > len(longest): 207 longest = dir 209 if longest: 210 base = path[len(longest) + 1:]
|