Home
last modified time | relevance | path

Searched refs:candidate (Results 1 – 25 of 347) sorted by relevance

12345678910>>...14

/external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/
DPhoneNumberMatcher.java252 CharSequence candidate = text.subSequence(start, matcher.end()); in find() local
257 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate); in find()
259 PhoneNumberMatch match = extractMatch(candidate, start); in find()
264 index = start + candidate.length(); in find()
275 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { in trimAfterFirstMatch() argument
276 Matcher trailingCharsMatcher = pattern.matcher(candidate); in trimAfterFirstMatch()
278 candidate = candidate.subSequence(0, trailingCharsMatcher.start()); in trimAfterFirstMatch()
280 return candidate; in trimAfterFirstMatch()
314 private PhoneNumberMatch extractMatch(CharSequence candidate, int offset) { in extractMatch() argument
316 if (SLASH_SEPARATED_DATES.matcher(candidate).find()) { in extractMatch()
[all …]
/external/v8/src/compiler/
Djs-inlining-heuristic.cc108 Candidate candidate = *i; in Finalize() local
111 if (!candidate.node->IsDead()) { in Finalize()
112 Reduction r = inliner_.ReduceJSCall(candidate.node, candidate.function); in Finalize()
114 cumulative_count_ += candidate.function->shared()->ast_node_count(); in Finalize()
130 for (const Candidate& candidate : candidates_) { in PrintCandidates() local
132 candidate.node->id(), candidate.calls, in PrintCandidates()
133 candidate.function->shared()->SourceSize(), in PrintCandidates()
134 candidate.function->shared()->ast_node_count(), in PrintCandidates()
135 candidate.function->shared()->DebugName()->ToCString().get()); in PrintCandidates()
Dinstruction-scheduler.cc135 auto candidate = ready_list.end(); in ScheduleBlock() local
143 if ((candidate == ready_list.end()) || in ScheduleBlock()
144 CompareNodes(*iterator, *candidate)) { in ScheduleBlock()
145 candidate = iterator; in ScheduleBlock()
150 if (candidate != ready_list.end()) { in ScheduleBlock()
151 sequence()->AddInstruction((*candidate)->instruction()); in ScheduleBlock()
153 for (auto successor : (*candidate)->successors()) { in ScheduleBlock()
157 cycle + (*candidate)->latency())); in ScheduleBlock()
164 ready_list.erase(candidate); in ScheduleBlock()
/external/webrtc/talk/app/webrtc/
Djsepsessiondescription.cc120 const IceCandidateInterface* candidate) { in AddCandidate() argument
121 if (!candidate || candidate->sdp_mline_index() < 0) in AddCandidate()
124 if (!GetMediasectionIndex(candidate, &mediasection_index)) { in AddCandidate()
137 cricket::Candidate updated_candidate = candidate->candidate(); in AddCandidate()
146 new JsepIceCandidate(candidate->sdp_mid(), in AddCandidate()
178 const IceCandidateInterface* candidate, in GetMediasectionIndex() argument
180 if (!candidate || !index) { in GetMediasectionIndex()
183 *index = static_cast<size_t>(candidate->sdp_mline_index()); in GetMediasectionIndex()
184 if (description_ && !candidate->sdp_mid().empty()) { in GetMediasectionIndex()
188 if (candidate->sdp_mid() == description_->contents().at(i).name) { in GetMediasectionIndex()
Djsepicecandidate.cc57 const cricket::Candidate& candidate) in JsepIceCandidate() argument
60 candidate_(candidate) { in JsepIceCandidate()
85 const IceCandidateInterface* candidate) const { in HasCandidate()
89 if ((*it)->sdp_mid() == candidate->sdp_mid() && in HasCandidate()
90 (*it)->sdp_mline_index() == candidate->sdp_mline_index() && in HasCandidate()
91 (*it)->candidate().IsEquivalent(candidate->candidate())) { in HasCandidate()
Djsepicecandidate.h45 const cricket::Candidate& candidate);
49 void SetCandidate(const cricket::Candidate& candidate) { in SetCandidate() argument
50 candidate_ = candidate; in SetCandidate()
55 virtual const cricket::Candidate& candidate() const { in candidate() function
77 virtual bool HasCandidate(const IceCandidateInterface* candidate) const;
79 virtual void add(JsepIceCandidate* candidate) { in add() argument
80 candidates_.push_back(candidate); in add()
/external/v8/src/heap/
Dmark-compact-inl.h102 JSFunction** CodeFlusher::GetNextCandidateSlot(JSFunction* candidate) { in GetNextCandidateSlot() argument
104 HeapObject::RawField(candidate, JSFunction::kNextFunctionLinkOffset)); in GetNextCandidateSlot()
108 JSFunction* CodeFlusher::GetNextCandidate(JSFunction* candidate) { in GetNextCandidate() argument
109 Object* next_candidate = candidate->next_function_link(); in GetNextCandidate()
114 void CodeFlusher::SetNextCandidate(JSFunction* candidate, in SetNextCandidate() argument
116 candidate->set_next_function_link(next_candidate, UPDATE_WEAK_WRITE_BARRIER); in SetNextCandidate()
120 void CodeFlusher::ClearNextCandidate(JSFunction* candidate, Object* undefined) { in ClearNextCandidate() argument
122 candidate->set_next_function_link(undefined, SKIP_WRITE_BARRIER); in ClearNextCandidate()
127 SharedFunctionInfo* candidate) { in GetNextCandidate() argument
128 Object* next_candidate = candidate->code()->gc_metadata(); in GetNextCandidate()
[all …]
/external/skia/src/core/
DSkTDynamicHash.h94 T* candidate = fArray[index]; in find() local
95 if (Empty() == candidate) { in find()
98 if (Deleted() != candidate && GetKey(*candidate) == key) { in find()
99 return candidate; in find()
148 const T* candidate = fArray[index]; in countCollisions() local
149 if (Empty() == candidate || Deleted() == candidate || GetKey(*candidate) == key) { in countCollisions()
212 const T* candidate = fArray[index]; in innerAdd() local
213 if (Empty() == candidate || Deleted() == candidate) { in innerAdd()
214 if (Deleted() == candidate) { in innerAdd()
231 const T* candidate = fArray[index]; in innerRemove() local
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/
DPrimes.java150 …public static MROutput enhancedMRProbablePrimeTest(BigInteger candidate, SecureRandom random, int … in enhancedMRProbablePrimeTest() argument
152 checkCandidate(candidate, "candidate"); in enhancedMRProbablePrimeTest()
163 if (candidate.bitLength() == 2) in enhancedMRProbablePrimeTest()
167 if (!candidate.testBit(0)) in enhancedMRProbablePrimeTest()
172 BigInteger w = candidate; in enhancedMRProbablePrimeTest()
173 BigInteger wSubOne = candidate.subtract(ONE); in enhancedMRProbablePrimeTest()
174 BigInteger wSubTwo = candidate.subtract(TWO); in enhancedMRProbablePrimeTest()
253 public static boolean hasAnySmallFactors(BigInteger candidate) in hasAnySmallFactors() argument
255 checkCandidate(candidate, "candidate"); in hasAnySmallFactors()
257 return implHasAnySmallFactors(candidate); in hasAnySmallFactors()
[all …]
/external/mesa3d/src/gallium/drivers/r300/compiler/
Dradeon_program_pair.c42 int candidate = -1; in rc_pair_alloc_source() local
88 candidate = i; in rc_pair_alloc_source()
93 candidate = RC_PAIR_PRESUB_SRC; in rc_pair_alloc_source()
94 } else if (candidate < 0 || (rgb && rgb_used > 2) in rc_pair_alloc_source()
102 pair->RGB.Src[candidate].Used = 1; in rc_pair_alloc_source()
103 pair->RGB.Src[candidate].File = file; in rc_pair_alloc_source()
104 pair->RGB.Src[candidate].Index = index; in rc_pair_alloc_source()
105 if (candidate == RC_PAIR_PRESUB_SRC) { in rc_pair_alloc_source()
115 pair->Alpha.Src[candidate].Used = 1; in rc_pair_alloc_source()
116 pair->Alpha.Src[candidate].File = file; in rc_pair_alloc_source()
[all …]
/external/webrtc/webrtc/api/objc/
DRTCIceCandidate.mm45 (webrtc::IceCandidateInterface *)candidate {
46 NSParameterAssert(candidate);
48 candidate->ToString(&sdp);
51 sdpMLineIndex:candidate->sdp_mline_index()
52 sdpMid:[NSString stringForStdString:candidate->sdp_mid()]];
58 webrtc::IceCandidateInterface *candidate = webrtc::CreateIceCandidate(
61 if (!candidate) {
62 RTCLog(@"Failed to create ICE candidate: %s\nline: %s",
67 return rtc::scoped_ptr<webrtc::IceCandidateInterface>(candidate);
/external/bison/lib/
Dhash.c444 is_prime (size_t candidate) in is_prime() argument
449 while (square < candidate && (candidate % divisor)) in is_prime()
456 return (candidate % divisor ? true : false); in is_prime()
463 next_prime (size_t candidate) in next_prime() argument
466 if (candidate < 10) in next_prime()
467 candidate = 10; in next_prime()
470 candidate |= 1; in next_prime()
472 while (SIZE_MAX != candidate && !is_prime (candidate)) in next_prime()
473 candidate += 2; in next_prime()
475 return candidate; in next_prime()
[all …]
/external/clang/include/clang/Sema/
DTypoCorrection.h270 virtual bool ValidateCandidate(const TypoCorrection &candidate);
278 virtual unsigned RankCandidate(const TypoCorrection &candidate) { in RankCandidate() argument
279 return (!MatchesTypo(candidate) && ValidateCandidate(candidate)) in RankCandidate()
302 bool MatchesTypo(const TypoCorrection &candidate) { in MatchesTypo() argument
303 return Typo && candidate.isResolved() && !candidate.requiresImport() && in MatchesTypo()
304 candidate.getCorrectionAsIdentifierInfo() == Typo && in MatchesTypo()
307 candidate.getCorrectionSpecifier() == TypoNNS; in MatchesTypo()
319 bool ValidateCandidate(const TypoCorrection &candidate) override { in ValidateCandidate() argument
320 return candidate.getCorrectionDeclAs<C>(); in ValidateCandidate()
333 bool ValidateCandidate(const TypoCorrection &candidate) override;
[all …]
/external/v8/src/
Dversion.cc47 const char* candidate = IsCandidate() ? " (candidate)" : ""; in GetString() local
55 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate, in GetString()
59 GetMajor(), GetMinor(), GetBuild(), candidate, in GetString()
69 const char* candidate = IsCandidate() ? "-candidate" : ""; in GetSONAME() local
72 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate); in GetSONAME()
75 GetMajor(), GetMinor(), GetBuild(), candidate); in GetSONAME()
/external/libvpx/libvpx/vp9/common/
Dvp9_mvref_common.c42 const MB_MODE_INFO *const candidate = &candidate_mi->mbmi; in find_mv_refs_idx() local
44 context_counter += mode_2_counter[candidate->mode]; in find_mv_refs_idx()
47 if (candidate->ref_frame[0] == ref_frame) in find_mv_refs_idx()
50 else if (candidate->ref_frame[1] == ref_frame) in find_mv_refs_idx()
62 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row * in find_mv_refs_idx() local
66 if (candidate->ref_frame[0] == ref_frame) in find_mv_refs_idx()
67 ADD_MV_REF_LIST(candidate->mv[0], refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
68 else if (candidate->ref_frame[1] == ref_frame) in find_mv_refs_idx()
69 ADD_MV_REF_LIST(candidate->mv[1], refmv_count, mv_ref_list, Done); in find_mv_refs_idx()
104 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row in find_mv_refs_idx() local
[all …]
/external/webrtc/webrtc/tools/loopback_test/
Dloopback_test.js41 pc.addIceCandidate = function (candidate, successCallback, argument
43 if (forceTurn && candidate.candidate.indexOf("typ relay ") == -1) {
44 trace("Dropping non-turn candidate: " + candidate.candidate);
48 origAddIceCandidate.call(this, candidate, successCallback,
158 if (e.candidate) {
159 this.addIceCandidate(new RTCIceCandidate(e.candidate),
/external/mockito/src/org/mockito/internal/invocation/
DInvocationMatcher.java77 public boolean hasSimilarMethod(Invocation candidate) { in hasSimilarMethod() argument
79 String currentMethodName = candidate.getMethod().getName(); in hasSimilarMethod()
82 final boolean isUnverified = !candidate.isVerified(); in hasSimilarMethod()
83 final boolean mockIsTheSame = getInvocation().getMock() == candidate.getMock(); in hasSimilarMethod()
84 final boolean methodEquals = hasSameMethod(candidate); in hasSimilarMethod()
90 …final boolean overloadedButSameArgs = !methodEquals && safelyArgumentsMatch(candidate.getArguments… in hasSimilarMethod()
95 public boolean hasSameMethod(Invocation candidate) { in hasSameMethod() argument
99 Method m2 = candidate.getMethod(); in hasSameMethod()
/external/v8/test/cctest/
Dtest-version.cc40 bool candidate, const char* soname) { in SetVersion() argument
45 Version::candidate_ = candidate; in SetVersion()
54 int patch, bool candidate, in CheckVersion() argument
61 SetVersion(major, minor, build, patch, candidate, ""); in CheckVersion()
69 SetVersion(major, minor, build, patch, candidate, soname); in CheckVersion()
/external/elfutils/lib/
Dnext_prime.c35 is_prime (size_t candidate) in is_prime() argument
41 while (sq < candidate && candidate % divn != 0) in is_prime()
51 return candidate % divn != 0; in is_prime()
/external/clang/test/Modules/
Dredecl-merge.m30 // expected-note@Inputs/redecl-merge-left.h:93{{candidate function}}
31 // expected-note@Inputs/redecl-merge-right.h:90{{candidate function}}
82 // expected-note@Inputs/redecl-merge-left.h:60{{candidate found by name lookup is 'T2'}}
83 // expected-note@Inputs/redecl-merge-right.h:63{{candidate found by name lookup is 'T2'}}
90 // expected-note@Inputs/redecl-merge-left.h:64{{candidate function}}
91 // expected-note@Inputs/redecl-merge-right.h:70{{candidate function}}
97 // expected-note@Inputs/redecl-merge-left.h:77{{candidate found by name lookup is 'var2'}}
98 // expected-note@Inputs/redecl-merge-right.h:77{{candidate found by name lookup is 'var2'}}
100 // expected-note@Inputs/redecl-merge-left.h:79{{candidate found by name lookup is 'var3'}}
101 // expected-note@Inputs/redecl-merge-right.h:79{{candidate found by name lookup is 'var3'}}
/external/google-tv-pairing-protocol/cpp/
Dautogen.sh22 for candidate in "$@"; do
23 if "$candidate" --version >/dev/null 2>&1; then
24 echo "$candidate"
28 echo "$candidate" # the last one in $@
/external/wpa_supplicant_8/src/rsn_supp/
Dpreauth.c302 struct rsn_pmksa_candidate *candidate, *n; in rsn_preauth_candidate_process() local
323 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, in rsn_preauth_candidate_process()
326 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL); in rsn_preauth_candidate_process()
327 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && in rsn_preauth_candidate_process()
332 MAC2STR(candidate->bssid)); in rsn_preauth_candidate_process()
333 dl_list_del(&candidate->list); in rsn_preauth_candidate_process()
334 rsn_preauth_init(sm, candidate->bssid, in rsn_preauth_candidate_process()
336 os_free(candidate); in rsn_preauth_candidate_process()
341 MAC2STR(candidate->bssid)); in rsn_preauth_candidate_process()
345 wpa_sm_add_pmkid(sm, candidate->bssid, p->pmkid); in rsn_preauth_candidate_process()
[all …]
/external/junit/src/org/junit/experimental/theories/
DParameterSignature.java43 public boolean canAcceptType(Class<?> candidate) { in canAcceptType() argument
44 return type.isAssignableFrom(candidate); in canAcceptType()
75 Annotation candidate= findDeepAnnotation(each.annotationType() in findDeepAnnotation()
77 if (candidate != null) in findDeepAnnotation()
78 return annotationType.cast(candidate); in findDeepAnnotation()
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/
DSyncSampleIntersectFinderImpl.java82 for (Track candidate : movie.getTracks()) { in sampleNumbers()
83 …if (candidate.getSyncSamples() != null && "vide".equals(candidate.getHandler()) && candidate.getSy… in sampleNumbers()
84 referenceTrack = candidate; in sampleNumbers()
131 for (Track candidate : movie.getTracks()) { in sampleNumbers()
132 if (candidate.getSyncSamples() != null && candidate.getSyncSamples().length > 0) { in sampleNumbers()
133 long[] refSyncSamples = sampleNumbers(candidate, movie); in sampleNumbers()
134 int refSampleCount = candidate.getSamples().size(); in sampleNumbers()
/external/owasp/sanitizer/empiricism/
Dhtml-containment.js303 var candidate = stack.shift();
304 if (isEnd(candidate.node)) {
305 var path = [candidate.node];
306 while (candidate.next) {
307 candidate = candidate.next;
308 path.push(candidate.node);
312 var adjacentNodes = adjacent(candidate.node);
316 for (var dupe = candidate; dupe; dupe = dupe.next) {
319 stack.push({ node: adjacentNode, next: candidate });

12345678910>>...14