| /external/google-tv-pairing-protocol/cpp/ |
| autogen.sh | 22 for candidate in "$@"; do
23 if "$candidate" --version >/dev/null 2>&1; then
24 echo "$candidate"
28 echo "$candidate" # the last one in $@
|
| /external/skia/src/core/ |
| SkTDynamicHash.h | 94 T* candidate = fArray[index]; local
95 if (Empty() == candidate) {
98 if (Deleted() != candidate && GetKey(*candidate) == key) {
99 return candidate;
148 const T* candidate = fArray[index]; local
149 if (Empty() == candidate || Deleted() == candidate || GetKey(*candidate) == key) {
212 const T* candidate = fArray[index] local
231 const T* candidate = fArray[index]; local
[all...] |
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 14 // Compare the two nodes and return true if node1 is a better candidate than
25 auto candidate = nodes_.end(); local
30 if ((candidate == nodes_.end()) || CompareNodes(*iterator, *candidate)) {
31 candidate = iterator;
36 if (candidate != nodes_.end()) {
37 ScheduleGraphNode *result = *candidate;
38 nodes_.erase(candidate);
50 auto candidate = nodes_.begin(); local
51 std::advance(candidate, isolate()->random_number_generator()->NextInt
196 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); local
[all...] |
| /external/webrtc/webrtc/examples/objc/AppRTCDemo/ |
| ARDSignalingMessage.m | 46 if ([typeString isEqualToString:@"candidate"]) {
47 RTCICECandidate *candidate =
49 message = [[ARDICECandidateMessage alloc] initWithCandidate:candidate];
72 @synthesize candidate = _candidate;
74 - (instancetype)initWithCandidate:(RTCICECandidate *)candidate {
76 _candidate = candidate;
|
| /external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
| PhoneNumberMatcher.java | 220 * @param leniency the leniency to use when evaluating candidate phone numbers
252 CharSequence candidate = text.subSequence(start, matcher.end()); local
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) {
276 Matcher trailingCharsMatcher = pattern.matcher(candidate);
278 candidate = candidate.subSequence(0, trailingCharsMatcher.start())
[all...] |
| /external/v8/src/heap/ |
| mark-compact-inl.h | 89 JSFunction** CodeFlusher::GetNextCandidateSlot(JSFunction* candidate) {
91 HeapObject::RawField(candidate, JSFunction::kNextFunctionLinkOffset));
95 JSFunction* CodeFlusher::GetNextCandidate(JSFunction* candidate) {
96 Object* next_candidate = candidate->next_function_link();
101 void CodeFlusher::SetNextCandidate(JSFunction* candidate,
103 candidate->set_next_function_link(next_candidate, UPDATE_WEAK_WRITE_BARRIER);
107 void CodeFlusher::ClearNextCandidate(JSFunction* candidate, Object* undefined) {
108 DCHECK(undefined->IsUndefined(candidate->GetIsolate()));
109 candidate->set_next_function_link(undefined, SKIP_WRITE_BARRIER);
114 SharedFunctionInfo* candidate) {
[all...] |
| /hardware/intel/img/hwcomposer/merrifield/common/base/ |
| VsyncManager.cpp | 170 bool VsyncManager::enableVsync(int candidate)
177 IDisplayDevice *device = getDisplayDevice(candidate);
179 ETRACE("invalid vsync source candidate %d", candidate);
184 mVsyncSource = candidate;
188 if (candidate != IDisplayDevice::DEVICE_PRIMARY) {
189 WTRACE("failed to enable vsync on display %d, fall back to primary", candidate);
|
| VsyncManager.h | 43 inline bool enableVsync(int candidate);
|
| /external/clang/include/clang/Sema/ |
| TypoCorrection.h | 263 /// candidate is viable, without ranking potentially viable candidates.
266 /// The default predicate always returns true if the candidate is not a type
270 virtual bool ValidateCandidate(const TypoCorrection &candidate);
273 /// to a candidate (where a lower value represents a better candidate), or
274 /// returning InvalidDistance if the candidate is not at all viable. For
275 /// validation callbacks that only need to determine if a candidate is viable,
278 virtual unsigned RankCandidate(const TypoCorrection &candidate) {
279 return (!MatchesTypo(candidate) && ValidateCandidate(candidate))
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_program_pair.c | 42 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].Used = 1
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ |
| Primes.java | 139 * 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)
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.subtract(TWO)
[all...] |
| /external/mockito/src/org/mockito/internal/invocation/ |
| InvocationMatcher.java | 77 public boolean hasSimilarMethod(Invocation candidate) {
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) {
99 Method m2 = candidate.getMethod();
|
| InvocationsFinder.java | 176 Invocation candidate = null; local
179 candidate = candidate != null ? candidate : i;
181 candidate = null;
184 return candidate;
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| CandidateFilter.java | 46 String str = word.candidate;
|
| UserDictionaryToolsList.java | 409 wnnWordSearch.candidate = focusString.toString();
412 wnnWordSearch.candidate = focusPairString.toString();
579 int len = getword.candidate.length();
583 if (searchword.candidate.equals(getword.candidate)) {
586 delword.candidate = searchword.candidate;
697 UserDictionaryToolsListFocus candidate = new UserDictionaryToolsListFocus(this); local
698 candidate.setId(i+MAX_WORD_COUNT);
699 candidate.setWidth(system_width/2)
[all...] |
| /art/test/150-loadlibrary/src/ |
| Main.java | 36 String candidate = p + libName; local
37 if (new File(candidate).exists()) {
38 fileName = candidate;
|
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableSet.java | 50 Object candidate = table[i & mask]; local
51 if (candidate == null) {
54 if (candidate.equals(target)) {
|
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/util/ |
| TypeProtoUtils.java | 98 public static boolean extendsFrom(@Nonnull TypeProto candidate, @Nonnull String possibleSuper) {
99 if (candidate.getType().equals(possibleSuper)) {
102 for (TypeProto superProto: getSuperclassChain(candidate)) {
|
| /external/webrtc/talk/app/webrtc/ |
| jsep.h | 41 class Candidate;
54 // Class representation of an ICE candidate.
61 // identification" as defined in [RFC 3388] for m-line this candidate is
65 // candidate is assocated with.
67 virtual const cricket::Candidate& candidate() const = 0;
68 // Creates a SDP-ized form of this candidate.
87 // Returns true if an equivalent |candidate| exist in the collection.
88 virtual bool HasCandidate(const IceCandidateInterface* candidate) const = 0;
110 // Adds the specified candidate to the description
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_mvref_common.c | 127 static INLINE int_mv get_sub_block_mv(const MODE_INFO *candidate, int which_mv,
129 return block_idx >= 0 && candidate->mbmi.sb_type < BLOCK_8X8
130 ? candidate->bmi[idx_n_column_to_subblock[block_idx][search_col == 0]]
132 : candidate->mbmi.mv[which_mv];
190 // to try and find candidate reference vectors.
220 const MB_MODE_INFO *const candidate = &candidate_mi->mbmi; local
222 context_counter += mode_2_counter[candidate->mode];
225 if (candidate->ref_frame[0] == ref_frame)
227 else if (candidate->ref_frame[1] == ref_frame)
238 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row local
264 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row local
[all...] |
| /external/junit/src/org/junit/experimental/theories/ |
| ParameterSignature.java | 43 public boolean canAcceptType(Class<?> candidate) {
44 return type.isAssignableFrom(candidate);
75 Annotation candidate= findDeepAnnotation(each.annotationType()
77 if (candidate != null)
78 return annotationType.cast(candidate);
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_mvref_common.c | 15 // 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->mv[1], refmv_count, mv_ref_list, Done)
104 const MB_MODE_INFO *const candidate = &xd->mi[mv_ref->col + mv_ref->row local
[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/ceres-solver/internal/ceres/ |
| canonical_views_clustering.cc | 70 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);
|
| /packages/apps/TvSettings/Settings/src/com/android/tv/settings/device/storage/ |
| MoveAppStepFragment.java | 111 for (final VolumeInfo candidate : mCandidateVolumes) {
112 if (!candidate.isMountedWritable()) {
115 final File path = candidate.getPath();
118 .title(mStorageManager.getBestVolumeDescription(candidate))
121 .checked(TextUtils.equals(mCurrentVolume.getId(), candidate.getId()))
123 .id(mCandidateVolumes.indexOf(candidate))
|
