HomeSort by relevance Sort by last modified time
    Searched full:candidates (Results 76 - 100 of 429) sorted by null

1 2 34 5 6 7 8 91011>>

  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
OpenWnnJAJP.java 111 /** IME's status for {@code mStatus} input/no candidates). */
117 /** IME's status for {@code mStatus}(all candidates are displayed). */
148 /** Delay time(msec.) to start prediction after key input when the candidates view is not shown. */
151 /** Delay time(msec.) to start prediction after key input when the candidates view is shown. */
427 /** {@code Handler} for drawing candidates/displaying tutorial */
1597 int candidates = 0; local
1882 int candidates = mConverter.makeCandidateListOf(mCommitCount); local
    [all...]
  /external/opencv/cvaux/src/
cvclique.cpp 311 /* Count disconnections with candidates */
395 //update weights of current clique and candidates
435 else //check nonempty set of candidates
558 /* Count disconnections with candidates */
658 else //check nonempty set of candidates
  /external/openssh/
moduli.c 32 * Sieve candidates for "safe" primes,
231 * list candidates for Sophie-Germain primes (where q = (p-1)/2)
436 logit("%.24s Found %u candidates", ctime(&time_stop), r);
443 * on the list of candidates
647 logit("%.24s Found %u safe primes of %u candidates in %ld seconds",
ssh-keygen.0 83 DH-GEX candidates using the -T command.
320 # ssh-keygen -G moduli-2048.candidates -b 2048
326 Once a set of candidates have been generated, they must be tested for
328 ssh-keygen will read candidates from standard input (or a file specified
331 # ssh-keygen -T moduli-2048 -f moduli-2048.candidates
ssh-keygen.1 205 candidates using the
504 .Dl # ssh-keygen -G moduli-2048.candidates -b 2048
512 Once a set of candidates have been generated, they must be tested for
519 will read candidates from standard input (or a file specified using the
524 .Dl # ssh-keygen -T moduli-2048 -f moduli-2048.candidates
  /packages/inputmethods/PinyinIME/jni/include/
matrixsearch.h 104 // When user inputs and selects candidates, the fixed lemma ids are stored in
146 // The maximum length of the sentence candidates counted in chinese
214 // If all candidates are the first one for that step, the whole string can be
237 // 1. In Viterbi decoding, this buffer is used to get all possible candidates
342 // Prepare candidates from the last fixed hanzi position.
  /external/chromium/chrome/browser/
favicon_helper.cc 162 const std::vector<FaviconURL>& candidates) {
168 for (std::vector<FaviconURL>::const_iterator i = candidates.begin();
169 i != candidates.end(); ++i) {
favicon_helper.h 99 const std::vector<FaviconURL>& candidates);
246 // The prioritized favicon candidates from the page back from the renderer.
  /external/chromium/third_party/libjingle/source/talk/p2p/base/
constants.cc 65 const std::string GINGLE_ACTION_CANDIDATES("candidates");
136 // transports and candidates
candidate.h 88 // Candidates in a new generation replace those in the old generation.
relayport.cc 226 for (std::vector<Candidate>::const_iterator it = candidates().begin();
227 it != candidates().end(); ++it) {
281 for (size_t i = 0; i < candidates().size(); ++i) {
282 const Candidate& local = candidates()[i];
  /external/llvm/lib/CodeGen/
RegAllocBasic.cpp 225 // Populate a list of physical register spill candidates.
260 // No other spill candidates were found, so spill the current VirtReg.
  /external/valgrind/main/docs/internals/
release-HOWTO.txt 51 For each release candidate (should do release candidates for feature
105 candidates 2+).
  /packages/inputmethods/PinyinIME/src/com/android/inputmethod/pinyin/
CandidatesContainer.java 89 * The animation view used to show candidates. It contains two views.
90 * Normally, the candidates are shown one of them. When user navigates to
  /ndk/sources/host-tools/sed-4.2.1/lib/
regexec.c 102 const re_node_set *candidates)
118 const re_node_set *candidates,
124 Idx str_idx, const re_node_set *candidates)
1812 const re_node_set *candidates; local
    [all...]
  /external/clang/lib/Sema/
SemaOverload.cpp 745 Candidates.clear();
    [all...]
  /external/chromium/chrome/browser/chromeos/login/
login_utils.cc 498 std::vector<std::string> candidates; local
500 input_method_ids, &candidates);
501 for (size_t i = 0; i < candidates.size(); ++i) {
502 const std::string& candidate = candidates[i];
  /external/chromium/net/http/
http_auth_controller.h 102 // chooses candidates by searching the auth cache and the URL for a
  /external/clang/test/SemaCXX/
overload-member-call.cpp 70 // Tests the exact text used to note the candidates
  /external/llvm/include/llvm/CodeGen/
RegisterScavenging.h 162 BitVector &Candidates,
  /external/mesa3d/docs/
download.html 18 When a new release is coming, release candidates (betas) may be found
  /external/stlport/doc/
stlport_namespaces.txt 53 Good candidates for that are <utility> or <cerrno> as they are small headers. Including
  /external/v8/src/
mark-compact.h 267 // after live objects were relocated from evacuation candidates.
511 // TODO(gc) If all evacuation candidates are too popular we
516 // to other evacuation candidates thus we have to
580 // candidates.
version.cc 39 // Use 1 for candidates and 0 otherwise.
  /external/webkit/Source/WebCore/css/
CSSMutableStyleDeclaration.cpp 84 HashMap<int, bool> candidates; local
89 if (candidates.contains(property->id())) {
90 if (!important && candidates.get(property->id()))
95 candidates.set(property->id(), important);
    [all...]

Completed in 619 milliseconds

1 2 34 5 6 7 8 91011>>