| /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 | 65 double ComputeClusteringQualityDifference(const int candidate,
154 // Computes the difference in the quality score if 'candidate' were
157 const int candidate,
161 options_.view_score_weight * graph_->VertexWeight(candidate);
163 // Compute how much the quality score changes if the candidate view
166 const IntSet& neighbors = graph_->Neighbors(candidate);
172 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
184 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 {
|
| 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/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/clang/test/SemaCXX/ |
| dr1301.cpp | 2 struct A { // expected-note 2{{candidate}}
3 A(int); // expected-note {{candidate}}
|
| trailing-return-0x.cpp | 75 auto f1(T t) -> decltype(f1(t)) {} // expected-note{{candidate template ignored}}
82 auto f2(T t) -> decltype(f2(&t)) {} // expected-note{{candidate template ignored}}
|
| 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}}
|
| conversion-function.cpp | 61 Flop(const Flip&); // expected-note{{candidate constructor}}
64 operator Flop() const; // expected-note{{candidate function}}
82 operator int(); // expected-note {{candidate function}}
87 operator char(); // expected-note {{candidate function}}
148 operator A<T, typename sneaky_int<T>::type>&() const; // expected-note{{candidate function}}
189 operator YRef(); // expected-note{{candidate function}}
192 struct X { // expected-note{{candidate constructor (the implicit copy constructor) not}}
|
| cxx0x-initializer-stdinitializerlist.cpp | 89 void ambiguous(std::initializer_list<A>); // expected-note {{candidate}}
90 void ambiguous(std::initializer_list<B>); // expected-note {{candidate}}
93 one ov2(std::initializer_list<int>); // expected-note {{candidate}}
94 two ov2(std::initializer_list<C>); // expected-note {{candidate}}
207 // expected-note@-1 {{candidate template ignored: couldn't resolve reference to overloaded function 'f'}}
|
| /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/clang/include/clang/Sema/ |
| TypoCorrection.h | 228 /// candidate is viable, without ranking potentially viable candidates.
231 virtual bool ValidateCandidate(const TypoCorrection &candidate) {
236 /// to a candidate (where a lower value represents a better candidate), or
237 /// returning InvalidDistance if the candidate is not at all viable. For
238 /// validation callbacks that only need to determine if a candidate is viable,
241 virtual unsigned RankCandidate(const TypoCorrection &candidate) {
242 return ValidateCandidate(candidate) ? 0 : InvalidDistance;
262 virtual bool ValidateCandidate(const TypoCorrection &candidate) {
263 return candidate.getCorrectionDeclAs<C>()
[all...] |
| Overload.h | 580 /// This conversion candidate was not considered because it
585 /// This conversion candidate is not viable because its result
589 /// This conversion function template specialization candidate is not
593 /// (CUDA) This candidate was not viable because the callee
599 /// OverloadCandidate - A single candidate in an overload set (C++ 13.3).
601 /// Function - The actual function that this candidate
602 /// represents. When NULL, this is a built-in candidate
613 // built-in overload candidate. Only valid when Function is NULL.
619 /// Surrogate - The conversion function for which this candidate
629 /// The FixIt hints which can be used to fix the Bad 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/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/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/clang/unittests/Tooling/ |
| TestVisitor.h | 186 : Candidate(Name, LineNumber, ColumnNumber), Found(false) {}
189 if (Candidate.Matches(Name, Location)) {
192 } else if (!Found && Candidate.PartiallyMatches(Name, Location)) {
201 << "Expected \"" << Candidate.ExpectedName
202 << "\" at " << Candidate.LineNumber
203 << ":" << Candidate.ColumnNumber << PartialMatches;
206 MatchCandidate Candidate;
|
| /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/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/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
| p5-0x.cpp | 20 operator T(); // expected-note 2{{candidate function}}
115 operator B(); // expected-note{{candidate function}}
116 operator int&(); // expected-note{{candidate function}}
135 void int_rvalue_ref(int&&); // expected-note{{candidate function not viable: no known conversion from 'ConvertsTo<int &>' to 'int &&' for 1st argument}} \
136 // expected-note{{candidate function not viable: no known conversion from 'ConvertsTo<float &>' to 'int &&' for 1st argument}}
|
| 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}}
|
| /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] == '-'))
|
| /packages/inputmethods/PinyinIME/src/com/android/inputmethod/pinyin/ |
| CandidateView.java | 38 * View to show candidate list. There two candidate view instances which are
58 * The height to draw candidate content.
69 * Balloon hint for candidate press/release.
84 * Listener used to notify IME that user clicks a candidate, or navigate
106 * Active candidate position in this page.
111 * Used to decided whether the active candidate should be highlighted or
113 * string), the highlight in candidate view should be removed.
186 * Rectangle used to draw the active candidate.
191 * Left and right margins for a candidate. It is specified in xml, and i
[all...] |
