| /external/clang/test/CXX/temp/temp.decls/temp.class/temp.static/ |
| p1.cpp | 15 struct X2 { }; // expected-note{{candidate constructor (the implicit copy constructor) not viable}}
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| p2.cpp | 13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function template not viable: requires at least 1 argument, but 0 were provided}}
|
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| p6.cpp | 4 template<class T> void apply(T x, void (*f)(T)) { f(x); } // expected-note 2 {{candidate template ignored: deduced conflicting types for parameter 'T'}}\
53 // expected-note {{candidate template ignored: couldn't infer template argument 'T'}}
99 template<typename R, typename T> void f1(R (&)(T) , T); // expected-note{{candidate template ignored: couldn't infer template argument 'R'}}
100 template<typename R, typename T> void f2(R (* const&)(T), T); // expected-note{{candidate template ignored: couldn't infer template argument 'R'}}
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p15.cpp | 4 NonDefaultConstructible(const NonDefaultConstructible&); // expected-note{{candidate constructor}}
|
| /external/clang/test/SemaCXX/ |
| explicit.cpp | 43 class Y { }; // expected-note {{candidate constructor (the implicit copy constructor) not viable: no known conversion from 'Z' to 'const Y &' for 1st argument}} \
44 expected-note {{candidate constructor (the implicit move constructor) not viable: no known conversion from 'Z' to 'Y &&' for 1st argument}} \
45 expected-note {{candidate constructor (the implicit copy constructor) not viable: no known conversion from 'Z' to 'const Y &' for 1st argument}} \
46 expected-note {{candidate constructor (the implicit move constructor) not viable: no known conversion from 'Z' to 'Y &&' for 1st argument}}
|
| type-dependent-exprs.cpp | 7 void g(int); // expected-note{{candidate function}}
|
| blocks.cpp | 87 struct B { // expected-note 2 {{candidate constructor}}
89 B(int); // expected-note {{candidate constructor}}
|
| dr1301.cpp | 2 struct A { // expected-note 2{{candidate}}
3 A(int); // expected-note {{candidate}}
|
| /external/clang/test/SemaTemplate/ |
| instantiate-exception-spec-cxx11.cpp | 98 template <typename T> void f1(T) throw(typename T::exception); // expected-note {{candidate}}
99 template <typename T> void f1(T, int = 0) throw(typename T::noitpecxe); // expected-note {{candidate}}
101 template <typename T> void f2(T) noexcept(T::throws); // expected-note {{candidate}}
102 template <typename T> void f2(T, int = 0) noexcept(T::sworht); // expected-note {{candidate}}
|
| instantiate-subscript.cpp | 9 long &operator[](long); // expected-note{{candidate function}}
|
| derived.cpp | 7 template<typename T> void Foo2(vector2<const T*> V) {} // expected-note{{candidate template ignored: can't deduce a type for 'T' which would make 'const T' equal 'int'}}
8 template<typename T> void Foo(vector<const T*> V) {} // expected-note {{candidate template ignored: can't deduce a type for 'T' which would make 'const T' equal 'int'}}
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 388 /// If this queue only has one ready candidate, return it. As a side effect,
469 SchedCandidate &Candidate,
528 /// Pick the best candidate from the top queue.
535 SchedCandidate &Candidate) {
541 // BestSU remains NULL if no top candidates beat the best existing candidate.
549 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
551 // Initialize the candidate if needed.
552 if (!Candidate.SU) {
553 Candidate.SU = *I;
554 Candidate.RPDelta = RPDelta
[all...] |
| /external/chromium_org/chrome/browser/chromeos/input_method/ |
| candidate_window_view_unittest.cc | 21 "Sample Candidate 1",
22 "Sample Candidate 2",
23 "Sample Candidate 3"
68 const std::string& candidate,
72 EXPECT_EQ(candidate, UTF16ToUTF8(row->candidate_label_->text()));
127 // Select the last candidate.
136 // Make sure the test doesn't crash if the candidate window reduced
337 // Initialize with a shortcut mode candidate window.
350 // Initialize with a no shortcut mode candidate window.
366 // Initialize with a no shortcut mode candidate window
[all...] |
| /external/llvm/docs/ |
| ReleaseProcess.rst | 24 * Test and benchmark each release candidate, comparing to the previous release and candidates
28 * Make sure the critical bugs get fixed and merged to the next release candidate
31 should be fixed before the next candidate and what can wait until the next release.
60 To run the script on a specific release candidate run::
82 * On the final candidate you just need Release builds, and that's the binary directory you'll have to pack.
119 It should have no new regressions, compared to the previous release or release candidate. You don't need to fix
163 When the Release Manager sends you the release candidate, download all sources,
169 * Download the current candidate sources from where the release manager points you
178 Once the release manages announces that the latest candidate is the good one, you
196 If you found regressions or failures when comparing a release candidate with th
[all...] |
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| ClusterManager.java | 196 // assign each candidate to a semantic cluster and check if new semantic
198 for (LocationCluster candidate : mLocationClusters) {
199 if (candidate.hasSemanticId() ||
200 candidate.hasSemanticClusterId() ||
201 !candidate.passThreshold(SEMANTIC_CLUSTER_THRESHOLD)) {
209 float distance = cluster.distanceToCluster(candidate);
219 // if candidate doesn't belong to any semantic cluster, create a new
222 candidate.generateSemanticId(mSemanticClusterCount++);
223 mSemanticClusters.add(candidate);
225 candidate.setSemanticClusterId(bestClusterId)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 67 double ComputeClusteringQualityDifference(const int candidate,
156 // Computes the difference in the quality score if 'candidate' were
159 const int candidate,
163 options_.view_score_weight * graph_->VertexWeight(candidate);
165 // Compute how much the quality score changes if the candidate view
168 const IntSet& neighbors = graph_->Neighbors(candidate);
174 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
186 graph_->EdgeWeight(centers[i], candidate);
|
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| 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();
|
| candidate.h | 37 // Candidate for ICE based connection discovery.
39 class Candidate {
41 Candidate() : preference_(0), generation_(0) {}
42 Candidate(const std::string& name, const std::string& protocol,
101 // Determines whether this candidate is equivalent to the given one.
102 bool IsEquivalent(const Candidate& c) const {
|
| /external/chromium_org/content/common/android/ |
| address_parser_internal.h | 55 // Number of digits found in the current result candidate.
59 // to the current result candidate.
|
| /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/objc/ |
| RTCICECandidate+Internal.h | 35 webrtc::IceCandidateInterface* candidate; variable
37 - (id)initWithCandidate:(const webrtc::IceCandidateInterface*)candidate;
|
| /external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.udecl/ |
| p8.cpp | 9 void foo(Opaque0); // expected-note 2 {{candidate function}}
39 void foo(Opaque0); // expected-note 2 {{candidate function}}
|
| /external/clang/test/Misc/ |
| include-stack-for-note-flag.cpp | 18 // STACK: note: candidate function not viable
25 // STACKLESS: note: candidate function not viable
|
| /external/chromium_org/ash/wm/ |
| solo_window_tracker.cc | 148 aura::Window* candidate = candidates[i]; local
150 if (candidate == ignore_window ||
151 !IsValidCandidate(candidate) ||
152 !GetTargetVisibility(candidate)) {
158 // candidate (and there are no visible docked windows).
162 solo_window_ = candidate;
|
| /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/java/src/org/webrtc/ |
| PeerConnection.java | 71 /** Triggered when a new ICE candidate has been found. */
72 public void onIceCandidate(IceCandidate candidate);
142 public boolean addIceCandidate(IceCandidate candidate) {
144 candidate.sdpMid, candidate.sdpMLineIndex, candidate.sdp);
|
| /external/chromium_org/tools/vim/ |
| ninja-build.vim | 31 candidate = os.path.dirname(path_to_current_buffer())
38 while candidate and not all(
39 [os.path.isdir(os.path.join(candidate, fp)) for fp in fingerprints]):
40 candidate = os.path.dirname(candidate)
41 return candidate
|
