| /external/chromium_org/net/tools/dump_cache/ |
| url_to_filename_encoder.h | 21 // URLs, we should pick one that doesn't show up frequently in URLs. Candidates
|
| /external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
| candidate.h | 112 // Candidates in a new generation replace those in the old generation.
|
| sessionmessages.h | 50 typedef std::vector<Candidate> Candidates;
|
| relayport.cc | 200 // TODO: set local preference value for TCP based candidates.
289 for (size_t i = 0; i < Candidates().size(); ++i) {
290 const Candidate& local = Candidates()[i];
|
| /external/llvm/docs/ |
| HowToReleaseLLVM.rst | 17 If you're looking for the document on how to test the release candidates and
70 * Tagging release candidates for the release team to begin testing.
132 Build the LLVM Release Candidates
135 Create release candidates for ``llvm``, ``clang``, ``dragonegg``, and the LLVM
|
| /external/llvm/include/llvm/CodeGen/ |
| LiveIntervalUnion.h | 40 /// Union of live intervals that are strong candidates for coalescing into a
|
| RegisterScavenging.h | 200 BitVector &Candidates,
|
| /external/marisa-trie/tools/ |
| cmdopt.c | 140 // There are other candidates.
|
| /external/marisa-trie/v0_1_5/tools/ |
| cmdopt.c | 140 // There are other candidates.
|
| /external/sfntly/cpp/src/sfntly/port/ |
| refcount.h | 54 // 4. Smart pointers here are very bad candidates for function parameters. Use
|
| /external/bison/build-aux/ |
| announce-gen | 439 my @candidates = map { "$my_distdir.$_" } @archive_suffixes;
440 my @tarballs = grep {-f $_} @candidates;
443 or die "$ME: none of " . join(', ', @candidates) . " were found\n";
|
| /external/chromium_org/chrome/browser/favicon/ |
| favicon_handler.cc | 335 const std::vector<FaviconURL>& candidates) {
339 for (std::vector<FaviconURL>::const_iterator i = candidates.begin();
340 i != candidates.end(); ++i) {
|
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| q_gain_p.cpp | 121 gain_cand -- Array of type Word16 -- pitch gain candidates (3),
183 Word16 gain_cand[], /* o : pitch gain candidates (3), MR795 only, Q14 */
215 /* in MR795 mode, compute three gain_pit candidates around the index
|
| /frameworks/base/core/java/android/text/ |
| InputType.java | 126 * that the input method should not be showing candidates itself, but can
127 * expect for the editor to supply its own completions/candidates from
151 * display any dictionary-based candidates. This is useful for text views that
|
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| GraphRunner.java | 588 /** Schedule strategy: From set of candidates, pick a random one. */
590 /** Schedule strategy: From set of candidates, pick node executed least recently executed. */
592 /** Schedule strategy: From set of candidates, pick node executed least number of times. */
[all...] |
| /libcore/luni/src/main/java/java/lang/ |
| Runtime.java | 370 List<String> candidates = new ArrayList<String>(); local
374 candidates.add(candidate);
388 throw new UnsatisfiedLinkError("Library " + libraryName + " not found; tried " + candidates);
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| Position.cpp | 541 // If true, adjacent candidates are visually distinct.
581 // This function and downstream() are used for moving back and forth between visually equivalent candidates.
582 // For example, for the text node "foo bar" where whitespace is collapsible, there are two candidates
703 // This function and upstream() are used for moving back and forth between visually equivalent candidates.
704 // For example, for the text node "foo bar" where whitespace is collapsible, there are two candidates
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| inspect.py | 549 candidates = []
557 candidates.append((match.group(1), i))
558 if candidates:
561 candidates.sort()
562 return lines, candidates[0][1]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| inspect.py | 549 candidates = []
557 candidates.append((match.group(1), i))
558 if candidates:
561 candidates.sort()
562 return lines, candidates[0][1]
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | [all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_generators.py | [all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| AnnotationsDirectoryItem.java | 88 * interning candidates are ones that <i>only</i> have a non-null
|
| /dalvik/dx/src/com/android/dx/dex/file/ |
| AnnotationsDirectoryItem.java | 87 * interning candidates are ones that <i>only</i> have a non-null
|
| /external/chromium/chrome/browser/password_manager/ |
| password_form_manager.h | 105 // an exact match, we still provide candidates that the user may
|
| /external/chromium/third_party/libjingle/source/talk/examples/call/ |
| call_main.cc | 228 DEFINE_string(filterhost, NULL, "Filter out the host from all candidates.");
|
