Searched defs:candidate (Results 1 - 25 of 154) sorted by relevance

1234567

/external/webrtc/talk/app/webrtc/objc/
H A DRTCICECandidate+Internal.h35 webrtc::IceCandidateInterface* candidate; variable
37 - (id)initWithCandidate:(const webrtc::IceCandidateInterface*)candidate;
/external/elfutils/lib/
H A Dnext_prime.c35 is_prime (size_t candidate) argument
41 while (sq < candidate && candidate % divn != 0)
51 return candidate % divn != 0;
/external/mockito/src/org/mockito/exceptions/stacktrace/
H A DStackTraceCleaner.java25 * @param candidate element of the actual stack trace
28 boolean isOut(StackTraceElement candidate); argument
/external/webrtc/webrtc/examples/objc/AppRTCDemo/
H A DARDSignalingMessage.h34 @property(nonatomic, readonly) RTCICECandidate *candidate; variable
36 - (instancetype)initWithCandidate:(RTCICECandidate *)candidate;
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/util/
H A DTypeProtoUtils.java98 public static boolean extendsFrom(@Nonnull TypeProto candidate, @Nonnull String possibleSuper) { argument
99 if (candidate.getType().equals(possibleSuper)) {
102 for (TypeProto superProto: getSuperclassChain(candidate)) {
/external/v8/src/compiler/
H A Djs-inlining-heuristic.cc54 // Quick check on source code length to avoid parsing large candidate.
59 // Quick check on the size of the AST to avoid parsing large candidate.
91 // In the general case we remember the candidate for later.
101 // We inline at most one candidate in every iteration of the fixpoint.
108 Candidate candidate = *i; local
110 // Make sure we don't try to inline dead candidate nodes.
111 if (!candidate.node->IsDead()) {
112 Reduction r = inliner_.ReduceJSCall(candidate.node, candidate.function);
114 cumulative_count_ += candidate
[all...]
H A Dinstruction-scheduler.cc135 auto candidate = ready_list.end(); local
138 // Look for the best candidate to schedule.
143 if ((candidate == ready_list.end()) ||
144 CompareNodes(*iterator, *candidate)) {
145 candidate = iterator;
150 if (candidate != ready_list.end()) {
151 sequence()->AddInstruction((*candidate)->instruction());
153 for (auto successor : (*candidate)->successors()) {
157 cycle + (*candidate)->latency()));
164 ready_list.erase(candidate);
[all...]
/external/webrtc/talk/app/webrtc/
H A Djsepicecandidate.h36 #include "webrtc/p2p/base/candidate.h"
45 const cricket::Candidate& candidate);
49 void SetCandidate(const cricket::Candidate& candidate) { argument
50 candidate_ = candidate;
55 virtual const cricket::Candidate& candidate() const { function in class:webrtc::JsepIceCandidate
77 virtual bool HasCandidate(const IceCandidateInterface* candidate) const;
79 virtual void add(JsepIceCandidate* candidate) { argument
80 candidates_.push_back(candidate);
H A Djsepicecandidate.cc57 const cricket::Candidate& candidate)
60 candidate_(candidate) {
85 const IceCandidateInterface* candidate) const {
89 if ((*it)->sdp_mid() == candidate->sdp_mid() &&
90 (*it)->sdp_mline_index() == candidate->sdp_mline_index() &&
91 (*it)->candidate().IsEquivalent(candidate->candidate())) {
55 JsepIceCandidate(const std::string& sdp_mid, int sdp_mline_index, const cricket::Candidate& candidate) argument
H A Djsepsessiondescription.cc120 const IceCandidateInterface* candidate) {
121 if (!candidate || candidate->sdp_mline_index() < 0)
124 if (!GetMediasectionIndex(candidate, &mediasection_index)) {
137 cricket::Candidate updated_candidate = candidate->candidate();
146 new JsepIceCandidate(candidate->sdp_mid(),
178 const IceCandidateInterface* candidate,
180 if (!candidate || !index) {
183 *index = static_cast<size_t>(candidate
119 AddCandidate( const IceCandidateInterface* candidate) argument
177 GetMediasectionIndex( const IceCandidateInterface* candidate, size_t* index) argument
[all...]
/external/objenesis/tck/src/org/objenesis/tck/
H A DTCK.java30 * This TCK accepts a set of candidate classes (class it attempts to instantiate) and a set of
31 * Objenesis implementations. It then tries instantiating every candidate with every Objenesis
37 * // register candidate classes.
61 * Register a candidate class to attempt to instantiate.
110 private void runTest(Reporter reporter, Class candidate, Objenesis objenesis, argument
113 Object instance = objenesis.newInstance(candidate);
114 boolean success = instance != null && instance.getClass() == candidate;
/external/v8/src/
H A Dversion.cc16 #define CANDIDATE_STRING " (candidate)"
47 const char* candidate = IsCandidate() ? " (candidate)" : ""; local
55 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate,
59 GetMajor(), GetMinor(), GetBuild(), candidate,
69 const char* candidate = IsCandidate() ? "-candidate" : ""; local
72 GetMajor(), GetMinor(), GetBuild(), GetPatch(), candidate);
75 GetMajor(), GetMinor(), GetBuild(), candidate);
/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/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_program_pair.c42 int candidate = -1; local
88 candidate = i;
93 candidate = RC_PAIR_PRESUB_SRC;
94 } else if (candidate < 0 || (rgb && rgb_used > 2)
99 /* candidate >= 0 */
102 pair->RGB.Src[candidate].Used = 1;
103 pair->RGB.Src[candidate].File = file;
104 pair->RGB.Src[candidate].Index = index;
105 if (candidate == RC_PAIR_PRESUB_SRC) {
115 pair->Alpha.Src[candidate]
[all...]
/external/mockito/src/org/mockito/internal/invocation/
H A DInvocationMatcher.java77 public boolean hasSimilarMethod(Invocation candidate) { argument
79 String currentMethodName = candidate.getMethod().getName();
82 final boolean isUnverified = !candidate.isVerified();
83 final boolean mockIsTheSame = getInvocation().getMock() == candidate.getMock();
84 final boolean methodEquals = hasSameMethod(candidate);
90 final boolean overloadedButSameArgs = !methodEquals && safelyArgumentsMatch(candidate.getArguments());
95 public boolean hasSameMethod(Invocation candidate) { argument
99 Method m2 = candidate.getMethod();
/external/v8/test/cctest/
H A Dtest-version.cc40 bool candidate, const char* soname) {
45 Version::candidate_ = candidate;
54 int patch, bool candidate,
61 SetVersion(major, minor, build, patch, candidate, "");
69 SetVersion(major, minor, build, patch, candidate, soname);
81 "0.0.0 (candidate) SIMULATOR", "libv8-0.0.0-candidate.so");
84 "1.0.0 (candidate) SIMULATOR", "libv8-1.0.0-candidate.so");
87 "1.0.0.1 (candidate) SIMULATO
39 SetVersion(int major, int minor, int build, int patch, bool candidate, const char* soname) argument
53 CheckVersion(int major, int minor, int build, int patch, bool candidate, const char* expected_version_string, const char* expected_generic_soname) argument
[all...]
/external/ceres-solver/internal/ceres/
H A Dcanonical_views_clustering.cc70 double ComputeClusteringQualityDifference(const int candidate,
159 // Computes the difference in the quality score if 'candidate' were
162 const int candidate,
166 options_.view_score_weight * graph_->VertexWeight(candidate);
168 // Compute how much the quality score changes if the candidate view
171 const IntSet& neighbors = graph_->Neighbors(candidate);
177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
189 graph_->EdgeWeight(centers[i], candidate);
161 ComputeClusteringQualityDifference( const int candidate, const vector<int>& centers) const argument
/external/libvpx/libvpx/vp9/common/
H A Dvp9_mvref_common.c15 // to try and find candidate reference vectors.
42 const MB_MODE_INFO *const candidate = &candidate_mi->mbmi; local
44 context_counter += mode_2_counter[candidate->mode];
47 if (candidate->ref_frame[0] == ref_frame)
50 else if (candidate->ref_frame[1] == ref_frame)
62 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row * local
66 if (candidate->ref_frame[0] == ref_frame)
67 ADD_MV_REF_LIST(candidate->mv[0], refmv_count, mv_ref_list, Done);
68 else if (candidate->ref_frame[1] == ref_frame)
69 ADD_MV_REF_LIST(candidate
104 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row local
[all...]
H A Dvp9_mvref_common.h137 static INLINE int_mv get_sub_block_mv(const MODE_INFO *candidate, int which_mv, argument
139 return block_idx >= 0 && candidate->mbmi.sb_type < BLOCK_8X8
140 ? candidate->bmi[idx_n_column_to_subblock[block_idx][search_col == 0]]
142 : candidate->mbmi.mv[which_mv];
/external/v8/src/heap/
H A Dmark-compact-inl.h102 JSFunction** CodeFlusher::GetNextCandidateSlot(JSFunction* candidate) { argument
104 HeapObject::RawField(candidate, JSFunction::kNextFunctionLinkOffset));
108 JSFunction* CodeFlusher::GetNextCandidate(JSFunction* candidate) { argument
109 Object* next_candidate = candidate->next_function_link();
114 void CodeFlusher::SetNextCandidate(JSFunction* candidate, argument
116 candidate->set_next_function_link(next_candidate, UPDATE_WEAK_WRITE_BARRIER);
120 void CodeFlusher::ClearNextCandidate(JSFunction* candidate, Object* undefined) { argument
122 candidate->set_next_function_link(undefined, SKIP_WRITE_BARRIER);
127 SharedFunctionInfo* candidate) {
128 Object* next_candidate = candidate
126 GetNextCandidate( SharedFunctionInfo* candidate) argument
133 SetNextCandidate(SharedFunctionInfo* candidate, SharedFunctionInfo* next_candidate) argument
139 ClearNextCandidate(SharedFunctionInfo* candidate) argument
[all...]
H A Dobjects-visiting.cc193 // Check whether to keep the candidate in the list.
194 T* candidate = reinterpret_cast<T*>(list); local
213 candidate = reinterpret_cast<T*>(retained);
214 tail = candidate;
220 WeakListVisitor<T>::VisitPhantomObject(heap, candidate);
224 list = WeakListVisitor<T>::WeakNext(candidate);
237 T* candidate = reinterpret_cast<T*>(list); local
238 list = WeakListVisitor<T>::WeakNext(candidate);
239 WeakListVisitor<T>::SetWeakNext(candidate, undefined);
/external/webrtc/webrtc/examples/androidapp/src/org/appspot/apprtc/
H A DAppRTCClient.java57 * Send Ice candidate to the other participant.
59 public void sendLocalIceCandidate(final IceCandidate candidate); argument
111 * Callback fired once remote Ice candidate is received.
113 public void onRemoteIceCandidate(final IceCandidate candidate); argument
/external/boringssl/src/crypto/bn/
H A Dprime.c454 int BN_primality_test(int *is_probably_prime, const BIGNUM *candidate, argument
457 switch (BN_is_prime_fasttest_ex(candidate, checks, ctx, do_trial_division, cb)) {
470 int BN_is_prime_ex(const BIGNUM *candidate, int checks, BN_CTX *ctx, BN_GENCB *cb) { argument
471 return BN_is_prime_fasttest_ex(candidate, checks, ctx, 0, cb);
678 /* In the case that the candidate prime is a single word then
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/
H A DPrimes.java139 * information about a composite candidate, which may be useful when generating or validating
142 * @param candidate
150 public static MROutput enhancedMRProbablePrimeTest(BigInteger candidate, SecureRandom random, int iterations) argument
152 checkCandidate(candidate, "candidate");
163 if (candidate.bitLength() == 2)
167 if (!candidate.testBit(0))
172 BigInteger w = candidate;
173 BigInteger wSubOne = candidate.subtract(ONE);
174 BigInteger wSubTwo = candidate
253 hasAnySmallFactors(BigInteger candidate) argument
276 isMRProbablePrime(BigInteger candidate, SecureRandom random, int iterations) argument
330 isMRProbablePrimeToBase(BigInteger candidate, BigInteger base) argument
[all...]
/external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/
H A DPhoneNumberMatcher.java220 * @param leniency the leniency to use when evaluating candidate phone numbers
252 CharSequence candidate = text.subSequence(start, matcher.end());
257 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate);
259 PhoneNumberMatch match = extractMatch(candidate, start);
264 index = start + candidate.length();
272 * Trims away any characters after the first match of {@code pattern} in {@code candidate},
275 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { argument
276 Matcher trailingCharsMatcher = pattern.matcher(candidate);
278 candidate
314 extractMatch(CharSequence candidate, int offset) argument
348 extractInnerMatch(String candidate, int offset) argument
386 parseAndVerify(String candidate, int offset) argument
574 checkNumberGroupingIsValid( PhoneNumber number, String candidate, PhoneNumberUtil util, NumberGroupingChecker checker) argument
598 containsMoreThanOneSlashInNationalNumber(PhoneNumber number, String candidate) argument
624 containsOnlyValidXChars( PhoneNumber number, String candidate, PhoneNumberUtil util) argument
[all...]

Completed in 1165 milliseconds

1234567