HomeSort by relevance Sort by last modified time
    Searched defs:candidates (Results 1 - 22 of 22) sorted by null

  /system/media/mca/filterfw/java/android/filterfw/core/
RandomScheduler.java 43 Vector<Filter> candidates = new Vector<Filter>(); local
46 candidates.add(filter);
48 if (candidates.size() > 0) {
49 int r = mRand.nextInt(candidates.size());
50 return candidates.elementAt(r);
  /external/webkit/Tools/CodeCoverage/
run-generate-coverage-data 173 def generate_covs(candidates):
181 print candidates.keys()
182 for dir in candidates.keys():
184 for dep in candidates[dir].keys():
217 candidates = map(lambda x: parse_dependency_file(x,base_dir,[]), depends) variable
219 # Build a number of sources from the candidates. This is a Set for the poor
223 for (_,dir,deps) in candidates:
234 print "Found %d candidates" % (len(sources))
  /external/chromium/third_party/libjingle/source/talk/p2p/base/
sessionmessages.h 49 typedef std::vector<Candidate> Candidates;
110 const Candidates& candidates)
113 candidates(candidates) {}
117 Candidates candidates; member in struct:cricket::TransportInfo
transport.cc 283 void Transport::OnRemoteCandidates(const std::vector<Candidate>& candidates) {
284 for (std::vector<Candidate>::const_iterator iter = candidates.begin();
285 iter != candidates.end();
383 std::vector<Candidate> candidates; local
386 candidates.swap(ready_candidates_);
391 if (!candidates.empty()) {
392 SignalCandidatesReady(this, candidates);
port.h 136 const std::vector<Candidate>& candidates() const { return candidates_; } function in class:cricket::Port
  /external/icu4c/common/
dictbe.cpp 111 int count; // Count of candidates
113 int32_t offset; // Offset in the text of these candidates
121 // Fill the list of candidates if needed, select the longest, and return the number found
122 int candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd );
148 PossibleWord::candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd ) { function in class:PossibleWord
265 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
268 if (candidates == 1) {
274 else if (candidates > 1) {
281 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
342 int candidates = words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
    [all...]
  /frameworks/base/core/java/android/text/method/
LinkMovementMethod.java 105 ClickableSpan[] candidates = buffer.getSpans(first, last, ClickableSpan.class); local
144 for (int i = 0; i < candidates.length; i++) {
145 int end = buffer.getSpanEnd(candidates[i]);
149 beststart = buffer.getSpanStart(candidates[i]);
166 for (int i = 0; i < candidates.length; i++) {
167 int start = buffer.getSpanStart(candidates[i]);
172 bestend = buffer.getSpanEnd(candidates[i]);
  /libcore/luni/src/main/java/java/lang/
Runtime.java 376 List<String> candidates = new ArrayList<String>(); local
380 candidates.add(candidate);
393 throw new UnsatisfiedLinkError("Library " + libraryName + " not found; tried " + candidates);
  /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/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/third_party/libjingle/source/talk/p2p/client/
basicportallocator.cc 436 // Only accumulate the candidates whose protocol has been enabled
437 std::vector<Candidate> candidates; local
438 const std::vector<Candidate>& potentials = port->candidates();
444 candidates.push_back(potentials[i]);
447 if (!candidates.empty()) {
448 SignalCandidatesReady(this, candidates);
454 std::vector<Candidate> candidates; local
460 const std::vector<Candidate>& potentials = it->port->candidates();
466 candidates.push_back(potentials[i]);
470 if (!candidates.empty())
    [all...]
  /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...]
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
ContactAggregator.java 593 MatchCandidateList candidates = new MatchCandidateList(); local
617 candidates, matcher, values);
656 long currentContactId, MatchCandidateList candidates, ContactMatcher matcher,
670 candidates.clear();
680 contactId = pickBestMatchBasedOnData(db, rawContactId, candidates, matcher);
2226 MatchCandidateList candidates = new MatchCandidateList(); local
    [all...]
  /external/clang/lib/Sema/
SemaCXXCast.cpp 275 OverloadCandidateSet &candidates = sequence.getFailedCandidateSet(); local
284 if (candidates.empty())
306 candidates.NoteCandidates(S, howManyCandidates, &src, 1);
    [all...]
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
OpenWnnEN.java 124 /** Delay time(msec.) to start prediction after key input when the candidates view is not shown. */
127 /** Delay time(msec.) to start prediction after key input when the candidates view is shown. */
130 /** {@code Handler} for drawing candidates/displaying tutorial */
744 * and the candidates view is not shown, dismiss the SW-keyboard.
762 * Thread for updating the candidates view
765 int candidates = 0; local
768 candidates = mConverter.predict(mComposingText, 0, -1);
770 /* update the candidates view */
771 if (candidates > 0) {
784 /* update the candidates view *
    [all...]
OpenWnnJAJP.java 103 /** IME's status for {@code mStatus} input/no candidates). */
109 /** IME's status for {@code mStatus}(all candidates are displayed). */
140 /** Delay time(msec.) to start prediction after key input when the candidates view is not shown. */
143 /** Delay time(msec.) to start prediction after key input when the candidates view is shown. */
398 /** {@code Handler} for drawing candidates/displaying tutorial */
1289 int candidates = 0; local
1547 int candidates = mConverter.makeCandidateListOf(mCommitCount); local
    [all...]
  /external/webkit/Source/WebCore/bridge/qt/
qt_runtime.cpp 1178 QVector<QtMethodMatchData> candidates; local
    [all...]
  /packages/apps/Mms/src/com/android/mms/data/
Contact.java 384 * The min_match is used to narrow down the candidates for the final
1063 ArrayList<Contact> candidates = mContactsHash.get(key); local
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/deprecated/
VoiceProxy.java 405 mVoiceResults.candidates.get(0).toString().length());
541 for (String c : mVoiceResults.candidates) {
800 public void onVoiceResults(List<String> candidates,
808 mVoiceResults.candidates = candidates;
822 List<String> candidates; field in class:VoiceProxy.VoiceResults
    [all...]
  /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...]
  /prebuilt/common/ecj/
ecj.jar 
  /prebuilt/common/eclipse/
org.eclipse.jface_3.4.2.M20090107-0800.jar 

Completed in 394 milliseconds