HomeSort by relevance Sort by last modified time
    Searched refs:candidate (Results 26 - 50 of 190) sorted by null

12 3 4 5 6 7 8

  /libcore/xml/src/main/java/org/xmlpull/v1/
XmlPullParserFactory.java 304 Class candidate = null; local
308 candidate = Class.forName (name);
310 instance = candidate.newInstance ();
314 if (candidate != null) {
317 parserClasses.add(candidate);
321 serializerClasses.add(candidate);
  /external/chromium/third_party/libjingle/source/talk/p2p/base/
rawtransport.cc 67 Candidate candidate;
68 candidate.set_name(cand_elem->Attr(buzz::QN_NAME));
69 candidate.set_address(addr);
70 candidates->push_back(candidate);
80 for (std::vector<Candidate>::const_iterator
transport.h 55 #include "talk/p2p/base/candidate.h"
78 typedef std::vector<Candidate> Candidates;
173 const std::vector<Candidate>&> SignalCandidatesReady;
174 void OnRemoteCandidates(const std::vector<Candidate>& candidates);
176 // If candidate is not acceptable, returns false and sets error.
178 virtual bool VerifyCandidate(const Candidate& candidate,
221 // Called when a candidate is ready from remote peer.
222 void OnRemoteCandidate(const Candidate& candidate);
    [all...]
tcpport.cc 65 Connection* TCPPort::CreateConnection(const Candidate& address,
181 TCPConnection::TCPConnection(TCPPort* port, const Candidate& candidate,
183 : Connection(port, 0, candidate), socket_(socket), error_(0) {
190 candidate.address(), port->proxy(), port->user_agent(),
191 candidate.protocol() == "ssltcp");
195 << " to " << candidate.address().ToString();
200 << candidate.address().ToString();
rawtransportchannel.h 36 #include "talk/p2p/base/candidate.h"
87 virtual void OnCandidate(const Candidate& candidate);
108 const std::vector<Candidate>& candidates);
  /external/clang/test/SemaCXX/
cast-conversion.cpp 11 struct B { // expected-note 3 {{candidate constructor (the implicit copy constructor) not viable}} \
12 expected-note 3 {{candidate constructor (the implicit move constructor) not viable}}
13 B(A); // expected-note 3 {{candidate constructor not viable}}
41 template <int> float* &f0(); // expected-note{{candidate}}
42 template <unsigned> float* &f0(); // expected-note{{candidate}}
using-directive.cpp 4 short i; // expected-note 2{{candidate found by name lookup is 'A::i'}}
6 long i; // expected-note{{candidate found by name lookup is 'A::B::i'}}
7 void f() {} // expected-note{{candidate function}}
10 expected-note{{candidate found by name lookup is 'A::B::E'}}
13 namespace E {} // expected-note{{candidate found by name lookup is 'A::E'}}
18 expected-note{{candidate found by name lookup is 'A::C::E'}}
21 void f() {} // expected-note{{candidate function}}
48 struct K2 {}; // expected-note 2{{candidate found by name lookup is 'A::K2'}}
51 struct K2 {}; // expected-note 2{{candidate found by name lookup is 'K2'}}
61 class X { // expected-note{{candidate found by name lookup is 'X'}
    [all...]
explicit.cpp 43 class Y { }; // expected-note {{candidate constructor (the implicit copy constructor) not viable: no known conversion from 'Conversion::Z' to 'const Conversion::Y &' for 1st argument}} \
44 expected-note {{candidate constructor (the implicit move constructor) not viable: no known conversion from 'Conversion::Z' to 'Conversion::Y &&' for 1st argument}} \
45 expected-note {{candidate constructor (the implicit copy constructor) not viable: no known conversion from 'Conversion::Z' to 'const Conversion::Y &' for 1st argument}} \
46 expected-note {{candidate constructor (the implicit move constructor) not viable: no known conversion from 'Conversion::Z' to 'Conversion::Y &&' for 1st argument}}
  /external/harfbuzz/contrib/
harfbuzz-unicode.c 68 const struct script_property *candidate = vcandidate; local
70 if (key < candidate->range_start) {
72 } else if (key > candidate->range_end) {
213 const struct grapheme_break_property *candidate = vcandidate; local
215 if (key < candidate->range_start) {
217 } else if (key > candidate->range_end) {
257 const struct mirroring_property *candidate = vcandidate; local
259 if (key < candidate->a) {
261 } else if (key > candidate->a) {
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
UserDictionaryToolsEdit.java 77 /** The constant for notifying dialog (The length of specified stroke or candidate exceeds the limit) */
150 mBeforeEditWnnWord.candidate = ((TextView)sFocusingPairView).getText().toString();
197 /* Text changed listener for the candidate text */
250 String candidate = mCandidateEditText.getText().toString(); local
251 if (addDictionary(stroke, candidate)) {
262 String candidate = mCandidateEditText.getText().toString(); local
263 if (addDictionary(stroke, candidate)) {
266 addDictionary(mBeforeEditWnnWord.stroke, mBeforeEditWnnWord.candidate);
334 * @param candidate The string of the word
337 private boolean addDictionary(String stroke, String candidate) {
    [all...]
CandidateTextView.java 45 /** Maximum width of candidate view */
49 /** Minimum width of candidate view */
67 * @param candidateMinimumHeight Minimum height of candidate view
68 * @param candidateMinimumWidth Minimum width of candidate view
69 * @param maxWidth Maximum width of candidate view
89 * Textview is set to the best content for the display of candidate.
90 * @param WnnWord candidate
91 * @param wordCount candidate id
100 setText(word.candidate);
115 * @param WnnWord candidate wor
    [all...]
OpenWnnDictionaryImpl.java 46 /** The maximum length of candidate */
62 protected static final String COLUMN_NAME_CANDIDATE = "candidate";
475 queryArgs[ 1 ] = wnnWord.candidate;
606 OpenWnnDictionaryImplJni.setCandidate( this.mWnnWork, wnnWord.candidate );
650 result.candidate = mDbCursor.getString( 1 );
685 result.candidate = OpenWnnDictionaryImplJni.getCandidate( this.mWnnWork );
728 words[ i ].candidate = cursor.getString( 1 );
    [all...]
  /external/bison/lib/
hash.c 433 /* Return true if CANDIDATE is a prime number. CANDIDATE should be an odd
437 is_prime (size_t candidate)
442 while (square < candidate && (candidate % divisor))
449 return (candidate % divisor ? true : false);
452 /* Round a given CANDIDATE number up to the nearest prime, and return that
456 next_prime (size_t candidate)
459 if (candidate < 10)
460 candidate = 10
960 float candidate = local
1010 size_t candidate = local
    [all...]
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/EN/
OpenWnnEngineEN.java 54 /** The candidate filter */
58 * Candidate's case
102 * Get a candidate.
104 * @param index Index of candidate
105 * @return A candidate; {@code null} if no candidate for the index.
109 /* search the candidate from the dictionaries */
113 char c = word.candidate.charAt(0);
120 word.candidate = Character.toString(Character.toUpperCase(c)) + word.candidate.substring(1)
    [all...]
  /external/clang/include/clang/Sema/
TypoCorrection.h 215 /// candidate is viable, without ranking potentially viable candidates.
218 virtual bool ValidateCandidate(const TypoCorrection &candidate) {
223 /// to a candidate (where a lower value represents a better candidate), or
224 /// returning InvalidDistance if the candidate is not at all viable. For
225 /// validation callbacks that only need to determine if a candidate is viable,
228 virtual unsigned RankCandidate(const TypoCorrection &candidate) {
229 return ValidateCandidate(candidate) ? 0 : InvalidDistance;
249 virtual bool ValidateCandidate(const TypoCorrection &candidate) {
250 return candidate.getCorrectionDeclAs<C>()
    [all...]
  /external/chromium/chrome/browser/profiles/
profile_manager.cc 170 Profile* candidate = iter->second->profile.get(); local
171 if (candidate->GetRuntimeId() == profile_id)
172 return candidate;
173 if (candidate->HasOffTheRecordProfile()) {
174 candidate = candidate->GetOffTheRecordProfile();
175 if (candidate->GetRuntimeId() == profile_id)
176 return candidate;
187 Profile* candidate = iter->second->profile.get(); local
188 if (candidate == profile |
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/rsn_supp/
preauth.c 42 * pmksa_candidate_free - Free all entries in PMKSA candidate list
290 * Go through the PMKSA candidates and start pre-authentication if a candidate
296 struct rsn_pmksa_candidate *candidate; local
301 /* TODO: drop priority for old candidate entries */
303 wpa_msg(sm->ctx->ctx, MSG_DEBUG, "RSN: processing PMKSA candidate "
317 candidate = sm->pmksa_candidates;
318 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL);
319 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 &&
322 "candidate " MACSTR
324 MAC2STR(candidate->bssid))
    [all...]
  /external/wpa_supplicant_8/src/rsn_supp/
preauth.c 34 * pmksa_candidate_free - Free all entries in PMKSA candidate list
280 * Go through the PMKSA candidates and start pre-authentication if a candidate
286 struct rsn_pmksa_candidate *candidate, *n; local
291 /* TODO: drop priority for old candidate entries */
293 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate "
305 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates,
308 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL);
309 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 &&
312 "candidate " MACSTR
314 MAC2STR(candidate->bssid))
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/
WorkingSetHelper.java 98 Object candidate= path.getSegment(0);
99 if (!(candidate instanceof IWorkingSet))
102 IWorkingSet workingSetCandidate= (IWorkingSet) candidate;
  /external/guava/guava/src/com/google/common/hash/
Hashing.java 191 int candidate = 0; local
200 next = (int) ((candidate + 1) * inv);
203 candidate = next;
205 return candidate;
  /external/oprofile/libpp/
locate_images.cpp 108 virtual bool operator()(string const & candidate) const {
109 if (candidate.length() != value.length())
113 if (value[i] == candidate[i])
116 (candidate[i] == ',' || candidate[i] == '-'))
  /external/webkit/Source/WebCore/page/
SpatialNavigation.cpp 140 // * b = Focus candidate node's rect.
212 // * b = Focus candidate node's rect.
543 // This method calculates the exitPoint from the startingRect and the entryPoint into the candidate rect.
623 void distanceDataForNode(FocusDirection direction, const FocusCandidate& current, FocusCandidate& candidate)
625 if (areElementsOnSameLine(current, candidate)) {
626 if ((direction == FocusDirectionUp && current.rect.y() > candidate.rect.y()) || (direction == FocusDirectionDown && candidate.rect.y() > current.rect.y())) {
627 candidate.distance = 0;
628 candidate.alignment = Full;
633 IntRect nodeRect = candidate.rect
    [all...]
  /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/
MultiSourceCorpus.java 91 for (Source candidate : getSources()) {
92 if (candidate.getQueryThreshold() <= query.length()) {
93 sources.add(candidate);
  /external/webkit/PerformanceTests/SunSpider/resources/
sunspider-analyze-results.js 209 var candidate = categoryMeans[category].toFixed(2).toString().length;
210 if (candidate > width)
211 width = candidate;
213 var candidate = testMeansByCategory[category][test].toFixed(2).toString().length;
214 if (candidate > width)
215 width = candidate;
  /external/webkit/Source/WebCore/editing/
VisiblePosition.cpp 460 static Position canonicalizeCandidate(const Position& candidate)
462 if (candidate.isNull())
464 ASSERT(candidate.isCandidate());
465 Position upstream = candidate.upstream();
468 return candidate;
478 // FIXME (9535): Canonicalizing to the leftmost candidate means that if we're at a line wrap, we will
481 // the appropriate renderer for VisiblePosition's like these, or b) canonicalize to the rightmost candidate
491 Position candidate = position.upstream(); local
492 if (candidate.isCandidate())
493 return candidate;
    [all...]

Completed in 2271 milliseconds

12 3 4 5 6 7 8