| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Bresenham2.java | 80 int longest = Math.abs(w);
local
82 if (longest <= shortest) {
83 longest = Math.abs(h);
90 int numerator = longest >> 1;
91 for (int i = 0; i <= longest; i++) {
96 if (numerator > longest) {
97 numerator -= longest;
|
| /external/regex-re2/re2/ |
| bitstate.cc | 39 bool anchored, bool longest,
53 bool longest_; // whether search wants leftmost-longest match
294 bool anchored, bool longest,
306 longest_ = longest || prog_->anchor_end();
355 // If full match, we ask for an anchored longest match
370 bool longest = kind != kFirstMatch; local
371 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
| nfa.cc | 42 // * If longest is true, returns the longest match starting
51 bool anchored, bool longest,
112 bool longest_; // whether searching for longest match
346 // Leftmost-longest mode: save this match only if
401 bool anchored, bool longest,
425 longest = true;
437 longest_ = longest;
441 // longest match (if longest is true) and also to tel
[all...] |
| /external/regex-re2/re2/testing/ |
| backtrack.cc | 54 bool anchored, bool longest,
67 bool longest_; // whether search wants leftmost-longest match
95 bool anchored, bool longest,
106 longest_ = longest | prog_->anchor_end();
231 // If full match, we ask for an anchored longest match
246 bool longest = kind != kFirstMatch; local
247 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
| exhaustive_tester.cc | 103 RE2::Options longest; local
104 longest.set_longest_match(true);
105 RE2 relongest(regexp, longest);
|
| /external/mesa3d/src/mesa/main/ |
| shader_query.cpp | 220 size_t longest = 0; local
231 if (len >= longest)
232 longest = len + 1;
235 return longest;
|
| /external/selinux/libselinux/src/ |
| matchpathcon.c | 238 int h, used, nel, len, longest; local
244 longest = 0;
253 if (len > longest)
254 longest = len;
259 ("%s: hash table stats: %d elements, %d/%d buckets used, longest chain length %d\n",
260 __FUNCTION__, nel, used, HASH_BUCKETS, longest);
|
| /external/zopfli/src/zopfli/ |
| blocksplitter.c | 202 size_t longest = 0; local
208 if (!done[start] && end - start > longest) {
212 longest = end - start;
|
| /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 | 211 int longest,
238 if (*(iLowLimit + longest) == *(match - delta + longest))
247 if ((matchEnd-startt) > longest)
249 longest = (int)(matchEnd-startt);
269 if ((int)mlt > longest) { longest = (int)mlt; *matchpos = base + matchIndex + back; *startpos = ip+back; }
275 return longest;
|
| /external/selinux/policycoreutils/setfiles/ |
| restore.c | 502 int h, used, nel, len, longest; local
508 longest = 0;
517 if (len > longest)
518 longest = len;
524 ("%s: hash table stats: %d elements, %d/%d buckets used, longest chain length %d\n",
525 __FUNCTION__, nel, used, HASH_BUCKETS, longest);
|
| /external/icu/icu4c/source/tools/tzcode/ |
| zdump.c | 226 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/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:]
|
| /prebuilts/python/darwin-x86/2.7.5/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/python/linux-x86/2.7.5/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:]
|
| /external/skia/src/pathops/ |
| SkOpAngle.cpp | 374 // OPTIMIZATION: longest can all be either lazily computed here or precomputed in setup
376 double longest = 0; local
388 longest = SkTMax(longest, lenSq);
391 return sqrt(longest) / dist;
[all...] |
| /external/skia/tests/ |
| PathOpsAngleIdeas.cpp | 123 double longest = SkTMax(v[0].length(), SkTMax(v[1].length(), v[2].length())); local
124 return longest / dist;
[all...] |
| /external/v8/test/mjsunit/harmony/ |
| simd.js | 18 // Provide enough parameters for the longest type (currently 16). It's
|
| /external/v8/tools/profviz/ |
| composer.js | 518 // Label the longest pauses.
|
| /external/iproute2/doc/ |
| ip-cref.tex | [all...] |
| /prebuilts/tools/common/m2/repository/org/apache/commons/commons-lang3/3.2.1/ |
| commons-lang3-3.2.1.jar | |
| /prebuilts/tools/common/m2/repository/org/apache/commons/commons-lang3/3.3/ |
| commons-lang3-3.3.jar | |
