| /external/chromium/chrome/browser/chromeos/input_method/ |
| input_method_util.cc | 660 std::vector<std::string> candidates; local
662 GetInputMethodIdsFromLanguageCode(language_code, type, &candidates);
665 candidates.push_back(GetHardwareInputMethodId());
675 // Add candidates to input_method_ids, while skipping duplicates.
676 for (size_t i = 0; i < candidates.size(); ++i) {
677 const std::string& candidate = candidates[i];
|
| /external/chromium_org/v8/src/ |
| mark-compact.h | 267 // after live objects were relocated from evacuation candidates.
406 // CodeFlusher collects candidates for code flushing during marking and
407 // processes those candidates after marking has completed in order to
672 // TODO(gc) If all evacuation candidates are too popular we
677 // to other evacuation candidates thus we have to
783 // candidates.
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_mcomp.c | 786 #define PATTERN_CANDIDATES_REF 3 // number of refinement candidates
789 // Each scale can have a different number of candidates and shape of
790 // candidates as indicated in the num_candidates and candidates arrays
802 const MV candidates[MAX_PATTERN_SCALES]
856 this_mv.as_mv.row = br + candidates[t][i].row;
857 this_mv.as_mv.col = bc + candidates[t][i].col;
866 this_mv.as_mv.row = br + candidates[t][i].row;
867 this_mv.as_mv.col = bc + candidates[t][i].col;
884 br += candidates[best_init_s][k].row
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineLICM.cpp | 151 /// CandidateInfo - Keep track of information about hoisting candidates.
175 SmallVectorImpl<CandidateInfo> &Candidates);
407 SmallVectorImpl<CandidateInfo> &Candidates) {
485 Candidates.push_back(CandidateInfo(MI, Def, FI));
500 SmallVector<CandidateInfo, 32> Candidates;
504 // collect potential LICM candidates.
528 ProcessMI(MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates);
548 // Now evaluate whether the potential candidates qualify.
556 for (unsigned i = 0, e = Candidates.size(); i != e; ++i) {
557 if (Candidates[i].FI != INT_MIN &
[all...] |
| /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/chromium_org/third_party/libjingle/source/talk/app/webrtc/ |
| peerconnection_unittest.cc | 754 EXPECT_EQ(0u, (*desc)->candidates(0)->count());
774 // EXPECT_TRUE_WAIT, local ice candidates might be sent to the remote peer
[all...] |
| /external/chromium_org/chrome/browser/history/ |
| url_index_private_data.h | 57 // set). Once we have a set of candidates, they are filtered to ensure
61 // candidates, as the scoring of such a large number of candidates may
64 // will be found in nearly all history candidates. Results are sorted by
170 // construction of the search results candidates for 'transl' but then would
|
| /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/clang/lib/Sema/ |
| SemaOverload.cpp | 793 Candidates.clear();
[all...] |
| /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_org/chrome/browser/ui/ |
| metro_pin_tab_helper_win.cc | 396 // Request all the candidates.
427 const std::vector<content::FaviconURL>& candidates) {
428 favicon_url_candidates_ = candidates;
|
| /external/chromium_org/third_party/libjingle/source/talk/p2p/client/ |
| connectivitychecker.cc | 286 const std::vector<Candidate> candidates = port->Candidates(); local
287 Candidate c = candidates[0];
|
| /external/chromium_org/chrome/browser/chromeos/input_method/ |
| input_method_manager_impl.cc | 237 std::vector<std::string> candidates;
241 &candidates);
244 candidates.push_back(util_.GetHardwareInputMethodId());
258 // Add candidates to layouts, while skipping duplicates.
259 for (size_t i = 0; i < candidates.size(); ++i) {
260 const std::string& candidate = candidates[i];
[all...] |
| candidate_window_controller_impl.cc | 179 for (size_t i = 0; i < lookup_table.candidates().size(); ++i) {
181 lookup_table.candidates()[i];
|
| candidate_window_view_unittest.cc | 118 // Set 9 candidates.
127 // Reduce the number of candidates to 3.
|
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| constants.cc | 65 const std::string GINGLE_ACTION_CANDIDATES("candidates");
136 // transports and candidates
|
| /external/chromium_org/components/autofill/core/common/ |
| autofill_messages.h | 195 // Notification that forms have been seen that are candidates for
202 // Notification that password forms have been seen that are candidates for
|
| /external/chromium_org/content/public/browser/ |
| web_contents_observer.h | 243 // Invoked when new FaviconURL candidates are received from the renderer.
245 const std::vector<FaviconURL>& candidates) {}
|
| /external/chromium_org/third_party/libjingle/source/talk/examples/ios/AppRTCDemo/ |
| APPRTCAppDelegate.m | 319 [self displayLogMessage:@"SDP onSuccess() - possibly drain candidates"];
323 [self displayLogMessage:@"SDP onSuccess - drain candidates"];
|
| /external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
| constants.cc | 71 const char GINGLE_ACTION_CANDIDATES[] = "candidates";
159 // Transports and candidates.
|
