Searched refs:candidate (Results 1 - 25 of 128) sorted by relevance

123456

/external/webkit/Source/WebCore/css/
H A DCSSNamespace.h45 for (CSSNamespace* candidate = this; candidate; candidate = candidate->parent.get()) {
46 if (candidate->prefix == prefix)
47 return candidate;
/external/elfutils/lib/
H A Dnext_prime.c55 is_prime (size_t candidate) argument
61 while (sq < candidate && candidate % divn != 0)
71 return candidate % divn != 0;
/external/chromium/third_party/libjingle/source/talk/p2p/base/
H A Dp2ptransport.cc88 // Only look at local part because it might be <session><candidate>
89 // or <tranport><candidate>.
91 Candidate candidate; local
92 if (!ParseCandidate(candidate_elem, &candidate, error))
94 candidates->push_back(candidate);
101 Candidate* candidate,
110 return BadParse("candidate missing required attribute", error);
117 candidate->set_name(elem->Attr(buzz::QN_NAME));
118 candidate->set_address(address);
119 candidate
100 ParseCandidate(const buzz::XmlElement* elem, Candidate* candidate, ParseError* error) argument
173 WriteCandidate(const Candidate& candidate, buzz::XmlElement* elem, WriteError* error) argument
[all...]
H A Dtransport.cc32 #include "talk/p2p/base/candidate.h"
43 ChannelParams() : channel(NULL), candidate(NULL) {}
45 : name(name), channel(NULL), candidate(NULL) {}
49 channel(NULL), candidate(NULL) {}
50 explicit ChannelParams(cricket::Candidate* candidate) : argument
51 channel(NULL), candidate(candidate) {
52 name = candidate->name();
56 delete candidate;
62 cricket::Candidate* candidate; member in struct:cricket::ChannelParams
291 OnRemoteCandidate(const Candidate& candidate) argument
306 OnRemoteCandidate_w(const Candidate& candidate) argument
366 OnChannelCandidateReady(TransportChannelImpl* channel, const Candidate& candidate) argument
[all...]
H A Drawtransport.cc67 Candidate candidate;
68 candidate.set_name(cand_elem->Attr(buzz::QN_NAME));
69 candidate.set_address(addr);
70 candidates->push_back(candidate);
H A Dtransportchannelimpl.h74 virtual void OnCandidate(const Candidate& candidate) = 0;
H A Dp2ptransport.h70 Candidate* candidate,
72 bool WriteCandidate(const Candidate& candidate,
/external/harfbuzz/contrib/
H A Dharfbuzz-unicode-tables.c18 const struct combining_property *candidate = vcandidate; local
20 if (key < candidate->range_start) {
22 } else if (key > candidate->range_end) {
50 const struct category_property *candidate = vcandidate; local
52 if (key < candidate->range_start) {
54 } else if (key > candidate->range_end) {
H A Dharfbuzz-unicode.c68 const struct script_property *candidate = vcandidate; local
70 if (key < candidate->range_start) {
72 } else if (key > candidate->range_end) {
206 const struct grapheme_break_property *candidate = vcandidate; local
208 if (key < candidate->range_start) {
210 } else if (key > candidate->range_end) {
250 const struct mirroring_property *candidate = vcandidate; local
252 if (key < candidate->a) {
254 } else if (key > candidate->a) {
/external/v8/src/
H A Dversion.cc49 #define CANDIDATE_STRING " (candidate)"
80 const char* candidate = IsCandidate() ? " (candidate)" : ""; local
88 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate,
92 GetMajor(), GetMinor(), GetBuild(), candidate,
102 const char* candidate = IsCandidate() ? "-candidate" : ""; local
105 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate);
108 GetMajor(), GetMinor(), GetBuild(), candidate);
H A Dversion.h63 bool candidate, const char* soname);
/external/libphonenumber/java/src/com/android/i18n/phonenumbers/
H A DPhoneNumberMatcher.java201 * @param leniency the leniency to use when evaluating candidate phone numbers
233 CharSequence candidate = text.subSequence(start, matcher.end());
238 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate);
240 PhoneNumberMatch match = extractMatch(candidate, start);
245 index = start + candidate.length();
253 * Trims away any characters after the first match of {@code pattern} in {@code candidate},
256 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { argument
257 Matcher trailingCharsMatcher = pattern.matcher(candidate);
259 candidate
295 extractMatch(CharSequence candidate, int offset) argument
328 extractInnerMatch(String candidate, int offset) argument
389 parseAndVerify(String candidate, int offset) argument
546 checkNumberGroupingIsValid( PhoneNumber number, String candidate, PhoneNumberUtil util, NumberGroupingChecker checker) argument
559 containsMoreThanOneSlash(String candidate) argument
564 containsOnlyValidXChars( PhoneNumber number, String candidate, PhoneNumberUtil util) argument
[all...]
/external/v8/test/cctest/
H A Dtest-version.cc40 bool candidate, const char* soname) {
45 Version::candidate_ = candidate;
53 int patch, bool candidate,
60 SetVersion(major, minor, build, patch, candidate, "");
68 SetVersion(major, minor, build, patch, candidate, soname);
80 "0.0.0 (candidate) SIMULATOR", "libv8-0.0.0-candidate.so");
83 "1.0.0 (candidate) SIMULATOR", "libv8-1.0.0-candidate.so");
86 "1.0.0.1 (candidate) SIMULATO
39 SetVersion(int major, int minor, int build, int patch, bool candidate, const char* soname) argument
52 CheckVersion(int major, int minor, int build, int patch, bool candidate, const char* expected_version_string, const char* expected_generic_soname) argument
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DRegularImmutableSet.java50 Object candidate = table[i & mask];
51 if (candidate == null) {
54 if (candidate.equals(target)) {
/external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/
H A Dp3.cpp6 class C {}; // expected-note {{candidate}}
10 expected-note {{candidate}}
/external/llvm/lib/Target/Sparc/
H A DDelaySlotFiller.cpp62 MachineBasicBlock::iterator candidate);
74 bool delayHasHazard(MachineBasicBlock::iterator candidate,
187 bool Filler::delayHasHazard(MachineBasicBlock::iterator candidate, argument
194 if (candidate->isImplicitDef() || candidate->isKill())
197 if (candidate->mayLoad()) {
203 if (candidate->mayStore()) {
211 for (unsigned i = 0, e = candidate->getNumOperands(); i!= e; ++i) {
212 const MachineOperand &MO = candidate->getOperand(i);
290 // return true if the candidate i
291 isDelayFiller(MachineBasicBlock &MBB, MachineBasicBlock::iterator candidate) argument
[all...]
/external/junit/src/org/junit/experimental/theories/
H A DParameterSignature.java43 public boolean canAcceptType(Class<?> candidate) { argument
44 return type.isAssignableFrom(candidate);
75 Annotation candidate= findDeepAnnotation(each.annotationType()
77 if (candidate != null)
78 return annotationType.cast(candidate);
/external/llvm/lib/Target/MBlaze/
H A DMBlazeDelaySlotFiller.cpp65 static bool hasImmInstruction(MachineBasicBlock::iterator &candidate) { argument
68 unsigned numOper = candidate->getNumOperands();
70 MachineOperand &mop = candidate->getOperand(op);
105 static bool delayHasHazard(MachineBasicBlock::iterator &candidate, argument
108 MachineBasicBlock::iterator a = candidate;
112 // candidate := a0 = operation(a1, a2)
123 bool a_is_memory = candidate->mayLoad() || candidate->mayStore();
126 // candidate instruction.
179 MachineBasicBlock::iterator candidate) {
178 isDelayFiller(MachineBasicBlock &MBB, MachineBasicBlock::iterator candidate) argument
[all...]
/external/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp77 InstrIter candidate);
90 bool delayHasHazard(InstrIter candidate,
187 bool Filler::delayHasHazard(InstrIter candidate, argument
191 if (candidate->isImplicitDef() || candidate->isKill())
196 if (candidate->mayLoad()) {
202 if (candidate->mayStore()) {
210 assert((!candidate->isCall() && !candidate->isReturn()) &&
213 for (unsigned i = 0, e = candidate
[all...]
/external/webkit/Source/WebCore/page/
H A DFocusController.cpp439 static void updateFocusCandidateIfNeeded(FocusDirection direction, const FocusCandidate& current, FocusCandidate& candidate, FocusCandidate& closest) argument
441 ASSERT(candidate.visibleNode->isElementNode());
442 ASSERT(candidate.visibleNode->renderer());
445 if (frameOwnerElement(candidate) && (!frameOwnerElement(candidate)->contentFrame() || candidate.rect.isEmpty()))
449 if (candidate.isOffscreen && !canBeScrolledIntoView(direction, candidate))
452 distanceDataForNode(direction, current, candidate);
453 if (candidate
509 FocusCandidate candidate = FocusCandidate(node, direction); local
[all...]
/external/clang/test/SemaCXX/
H A Dcast-conversion.cpp11 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}}
H A Dusing-directive.cpp4 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 foun
[all...]
/external/bison/lib/
H A Dhash.c437 is_prime (size_t candidate) argument
442 while (square < candidate && (candidate % divisor))
449 return (candidate % divisor ? true : false);
456 next_prime (size_t candidate) argument
459 if (candidate < 10)
460 candidate = 10;
463 candidate |= 1;
465 while (!is_prime (candidate))
466 candidate
540 hash_initialize(size_t candidate, const Hash_tuning *tuning, Hash_hasher hasher, Hash_comparator comparator, Hash_data_freer data_freer) argument
819 hash_rehash(Hash_table *table, size_t candidate) argument
960 float candidate = local
1010 size_t candidate = local
[all...]
/external/clang/include/clang/Sema/
H A DTypoCorrection.h215 /// candidate is viable, without ranking potentially viable candidates.
218 virtual bool ValidateCandidate(const TypoCorrection &candidate) { argument
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) { argument
229 return ValidateCandidate(candidate) ? 0 : InvalidDistance;
249 virtual bool ValidateCandidate(const TypoCorrection &candidate) { argument
250 return candidate
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/
H A DSyncSampleIntersectFinderImpl.java82 for (Track candidate : movie.getTracks()) {
83 if (candidate.getSyncSamples() != null && "vide".equals(candidate.getHandler()) && candidate.getSyncSamples().length > 0) {
84 referenceTrack = candidate;
131 for (Track candidate : movie.getTracks()) {
132 if (candidate.getSyncSamples() != null && candidate.getSyncSamples().length > 0) {
133 long[] refSyncSamples = sampleNumbers(candidate, movie);
134 int refSampleCount = candidate
[all...]

Completed in 3060 milliseconds

123456