/external/clang/test/Modules/ |
cxx-templates.cpp | 38 // expected-note@Inputs/cxx-templates-a.h:11 {{candidate}} 39 // expected-note@Inputs/cxx-templates-b.h:11 {{candidate}} 44 // expected-note@Inputs/cxx-templates-a.h:12 {{candidate}} 45 // expected-note@Inputs/cxx-templates-b.h:12 {{candidate}} 47 // expected-note@Inputs/cxx-templates-a.h:12 {{candidate}} 48 // expected-note@Inputs/cxx-templates-b.h:12 {{candidate}}
|
/external/clang/test/SemaCXX/ |
cxx11-user-defined-literals.cpp | 59 int operator"" _ambiguous(char); // expected-note {{candidate}} 61 void *operator"" _ambiguous(char); // expected-note {{candidate}} 80 int operator"" _ambig1(const char *); // expected-note {{candidate}} 81 template<char...> int operator"" _ambig1(); // expected-note {{candidate}} 86 template<char...> int operator"" _ambig2(); // expected-note 3{{candidate}} 88 int operator"" _ambig2(const char *); // expected-note 3{{candidate}}
|
cxx1y-deduced-return-type.cpp | 28 operator auto() { int *p = nullptr; return p; } // expected-note {{candidate}} 29 operator auto*() { int *p = nullptr; return p; } // expected-note {{candidate}} 116 auto fwd_decl(); // expected-note {{candidate template ignored: could not match 'auto ()' against 'int ()'}} 131 // expected-note {{candidate template ignored: could not match 'auto ()' against 'void ()'}} 162 template <typename T> auto f() { return 0; } // expected-note {{candidate}} \ 163 // expected-note {{candidate function has different return type ('int' expected but has 'auto')}} 164 template<typename T> void g(T(*)()); // expected-note 2{{candidate}} 176 template <typename T> auto f(int) { return 0; } // expected-note {{candidate}} \ 177 // expected-note {{candidate function has different return type ('int' expected but has 'auto')}} 178 template<typename T> void g(T(*)(int)); // expected-note 2{{candidate}} [all...] |
conversion-function.cpp | 63 Flop(const Flip&); // expected-note{{candidate constructor}} 66 operator Flop() const; // expected-note{{candidate function}} 84 operator int(); // expected-note {{candidate function}} 89 operator char(); // expected-note {{candidate function}} 150 operator A<T, typename sneaky_int<T>::type>&() const; // expected-note{{candidate function}} 191 operator YRef(); // expected-note{{candidate function}} 194 struct X { // expected-note{{candidate constructor (the implicit copy constructor) not}}
|
/external/chromium/third_party/libjingle/source/talk/p2p/base/ |
p2ptransportchannel.cc | 104 // Compare the candidate information. 289 // A new candidate is available, let listeners know 291 PortAllocatorSession *session, const std::vector<Candidate>& candidates) { 305 // candidate list. If it isn't return error to the stun request. 307 const Candidate *candidate = NULL; local 311 candidate = &(*it); 315 if (candidate == NULL) { 330 Candidate new_remote_candidate = *candidate; [all...] |
/external/llvm/lib/Target/Sparc/ |
DelaySlotFiller.cpp | 61 MachineBasicBlock::iterator candidate); 74 bool delayHasHazard(MachineBasicBlock::iterator candidate, 212 bool Filler::delayHasHazard(MachineBasicBlock::iterator candidate, 219 if (candidate->isImplicitDef() || candidate->isKill()) 222 if (candidate->mayLoad()) { 228 if (candidate->mayStore()) { 236 for (unsigned i = 0, e = candidate->getNumOperands(); i!= e; ++i) { 237 const MachineOperand &MO = candidate->getOperand(i); 322 // return true if the candidate is a delay filler [all...] |
/external/opencv/cvaux/src/ |
cvclique.cpp | 69 int* s; //for selected candidate 200 finder->s = new int[N+1]; //for selected candidate 241 delete finder->s; //for selected candidate 276 int* s = finder->s; //for selected candidate 317 /* Save position of potential candidate */ 329 s[k] = pos; //s - selected candidate 333 s[k] = i; //selected candidate is fixed point itself 345 //here we will look for candidate to translate into not 346 //s[k] now contains index of choosen candidate 351 //swap selected and first candidate [all...] |
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
SyncSampleIntersectFinderImpl.java | 82 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.getSamples().size() [all...] |
/external/chromium_org/third_party/WebKit/Source/core/page/ |
SpatialNavigation.cpp | 137 // * b = Focus candidate node's rect. 209 // * b = Focus candidate node's rect. 538 // This method calculates the exitPoint from the startingRect and the entryPoint into the candidate rect. 618 void distanceDataForNode(FocusDirection direction, const FocusCandidate& current, FocusCandidate& candidate) 620 if (areElementsOnSameLine(current, candidate)) { 621 if ((direction == FocusDirectionUp && current.rect.y() > candidate.rect.y()) || (direction == FocusDirectionDown && candidate.rect.y() > current.rect.y())) { 622 candidate.distance = 0; 623 candidate.alignment = Full; 628 LayoutRect nodeRect = candidate.rect [all...] |
TouchAdjustment.cpp | 240 // A node matching the NodeFilter is called a responder. Candidate nodes must either be a 248 // Check if we already have a result for a common ancestor from another candidate. 276 Node* candidate = candidates[i]; local 280 Node* respondingNode = responderMap.get(candidate); 285 if (editableAncestors.contains(candidate)) 287 if (candidate->isContentEditable()) { 288 Node* replacement = candidate; 289 Node* parent = candidate->parentOrShadowHostNode(); 299 candidate = replacement; 301 if (candidate) 310 Node* candidate = intersectedNodes[i].get(); local [all...] |
/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
OpenWnnEngineJAJP.java | 127 /** The candidate filter */ 195 * Get a candidate. 197 * @param index Index of a candidate. 198 * @return The candidate; {@code null} if there is no candidate. 264 * Add a candidate to the conversion result buffer. 267 * the same one in the buffer and the length of the candidate 274 if (word.candidate == null || mCandTable.containsKey(word.candidate) 275 || word.candidate.length() > MAX_OUTPUT_LENGTH) [all...] |
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
candidate.h | 42 // Candidate for ICE based connection discovery. 44 class Candidate { 47 // candidate-attribute syntax. http://tools.ietf.org/html/rfc5245#section-15.1 48 Candidate() : component_(0), priority_(0), generation_(0) {} 49 Candidate(const std::string& id, int component, const std::string& protocol, 141 // Determines whether this candidate is equivalent to the given one. 142 bool IsEquivalent(const Candidate& c) const {
|
rawtransportchannel.cc | 136 void RawTransportChannel::OnCandidate(const Candidate& candidate) { 137 remote_address_ = candidate.address(); 178 PortAllocatorSession *session, const std::vector<Candidate>& candidates) { 182 // The most recent candidate is the one we haven't seen yet. 183 Candidate c = candidates[candidates.size() - 1]; 251 Candidate remote_candidate;
|
/external/clang/unittests/Tooling/ |
TestVisitor.h | 187 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {} 190 if (Candidate.Matches(Name, Location)) { 193 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) { 202 << "Expected \"" << Candidate.ExpectedName 203 << "\" at " << Candidate.LineNumber 204 << ":" << Candidate.ColumnNumber << PartialMatches; 207 MatchCandidate Candidate;
|
/external/chromium_org/third_party/libjingle/source/talk/app/webrtc/ |
webrtcsdp_unittest.cc | 47 using cricket::Candidate; 77 typedef std::vector<Candidate> Candidates; 137 "a=candidate:a0+B/1 1 udp 2130706432 192.168.1.5 1234 typ host " 139 "a=candidate:a0+B/1 2 udp 2130706432 192.168.1.5 1235 typ host " 141 "a=candidate:a0+B/2 1 udp 2130706432 ::1 1238 typ host " 143 "a=candidate:a0+B/2 2 udp 2130706432 ::1 1239 typ host " 145 "a=candidate:a0+B/3 1 udp 2130706432 74.125.127.126 2345 typ srflx " 148 "a=candidate:a0+B/3 2 udp 2130706432 74.125.127.126 2347 typ srflx " 172 "a=candidate:a0+B/1 2 udp 2130706432 192.168.1.5 1236 typ host " 174 "a=candidate:a0+B/1 1 udp 2130706432 192.168.1.5 1237 typ host [all...] |
/external/bison/lib/ |
hash.c | 440 /* Return true if CANDIDATE is a prime number. CANDIDATE should be an odd 444 is_prime (size_t candidate) 449 while (square < candidate && (candidate % divisor)) 456 return (candidate % divisor ? true : false); 459 /* Round a given CANDIDATE number up to the nearest prime, and return that 463 next_prime (size_t candidate) 466 if (candidate < 10) 467 candidate = 10 1073 float candidate = local 1175 size_t candidate = local [all...] |
/external/chromium_org/third_party/libjingle/source/talk/examples/android/src/org/appspot/apprtc/ |
AppRTCDemoActivity.java | 357 @Override public void onIceCandidate(final IceCandidate candidate){ 361 jsonPut(json, "type", "candidate"); 362 jsonPut(json, "label", candidate.sdpMLineIndex); 363 jsonPut(json, "id", candidate.sdpMid); 364 jsonPut(json, "candidate", candidate.sdp); 482 for (IceCandidate candidate : queuedRemoteCandidates) { 483 pc.addIceCandidate(candidate); 504 if (type.equals("candidate")) { 505 IceCandidate candidate = new IceCandidate local [all...] |
/external/chromium_org/third_party/libjingle/source/talk/examples/peerconnection/client/ |
conductor.cc | 42 const char kCandidateSdpName[] = "candidate"; 160 void Conductor::OnIceCandidate(const webrtc::IceCandidateInterface* candidate) { 161 LOG(INFO) << __FUNCTION__ << " " << candidate->sdp_mline_index(); 165 jmessage[kCandidateSdpMidName] = candidate->sdp_mid(); 166 jmessage[kCandidateSdpMlineIndexName] = candidate->sdp_mline_index(); 168 if (!candidate->ToString(&sdp)) { 169 LOG(LS_ERROR) << "Failed to serialize candidate"; 274 talk_base::scoped_ptr<webrtc::IceCandidateInterface> candidate( 276 if (!candidate.get()) { 277 LOG(WARNING) << "Can't parse received candidate message." [all...] |
/external/chromium_org/third_party/freetype/src/autofit/ |
afhints.h | 119 * Each segment has at most one `best' candidate to form a black 120 * distance, or no candidate at all. Notice that two distinct segments 121 * can have the same candidate, which frequently means a serif. 127 * The best candidate is stored in field `link' in structure 132 * In the above ASCII drawing, the best candidate for both AB and CD is 133 * GH, while the best candidate for GH is AB. Similarly, the best 134 * candidate for EF and GH is AB, while the best candidate for AB is 147 * The best candidate is stored in field `serif' in structure
|
/external/chromium_org/tools/linux/ |
dump-static-initializers.py | 68 candidate = filename 70 if candidate != filename: 72 candidate = line.strip() 73 return candidate 95 candidate = filename 97 if candidate != filename: # More than one candidate; return bare filename. 99 candidate = line.strip() 100 return candidate
|
/external/freetype/src/autofit/ |
afhints.h | 119 * Each segment has at most one `best' candidate to form a black 120 * distance, or no candidate at all. Notice that two distinct segments 121 * can have the same candidate, which frequently means a serif. 127 * The best candidate is stored in field `link' in structure 132 * In the above ASCII drawing, the best candidate for both AB and CD is 133 * GH, while the best candidate for GH is AB. Similarly, the best 134 * candidate for EF and GH is AB, while the best candidate for AB is 147 * The best candidate is stored in field `serif' in structure
|
/external/chromium_org/third_party/WebKit/Source/core/html/ |
HTMLImportsController.cpp | 108 HTMLImportChild* candidate = m_imports[i].get(); local 109 if (candidate != excluding && equalIgnoringFragmentIdentifier(candidate->url(), url) && !candidate->isDocumentBlocked()) 110 return candidate;
|
/external/chromium_org/tools/telemetry/telemetry/core/ |
util.py | 159 candidate = os.path.join(chrome_root, build_dir, build_type, binary_name) 160 if os.path.isfile(candidate) and os.access(candidate, required_mode): 161 candidate_mtime = os.stat(candidate).st_mtime 163 command = candidate
|
/external/chromium_org/ui/webui/resources/js/cr/ui/table/ |
table_header.js | 191 var candidate; 198 candidate = splitters[i]; 202 candidate = splitters[i]; 205 if (candidate) 206 candidate.startDrag(clientX, true);
|
/external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
p5-var.cpp | 4 struct Derived : Base { }; // expected-note{{candidate constructor (the implicit copy constructor) not viable}} 18 operator Derived&(); // expected-note{{candidate function}} 19 operator Derived2&(); // expected-note{{candidate function}} 35 operator Derived(); // expected-note{{candidate function}} 36 operator Derived2(); // expected-note{{candidate function}}
|