HomeSort by relevance Sort by last modified time
    Searched defs:candidates (Results 101 - 125 of 476) sorted by null

1 2 3 45 6 7 8 91011>>

  /hardware/intel/img/hwcomposer/moorefield_hdmi/common/base/
HwcLayerList.cpp 402 DLOGTRACE("no cursor plane available. candidates %d", cursorCandidates);
408 // need up to number of candidates for plane assignment
453 DLOGTRACE("no overlay plane available. candidates %d", overlayCandidates);
459 // need up to number of candidates for plane assignment
505 VLOGTRACE("no sprite plane available, candidates %d", spriteCandidates);
511 // need up to number of candidates for plane assignment
548 // find a sprit layer that is not candidate but has lower priority than candidates.
557 int candidates = (int)mZOrderConfig.size(); local
561 if (candidates == layers - 1 && spriteLayer != NULL) {
562 // primary plane is configured as sprite, all sprite candidates are offloaded to display plane
    [all...]
  /packages/apps/TvSettings/Settings/src/com/android/tv/settings/device/storage/
FormatActivity.java 263 final List<VolumeInfo> candidates = local
266 for (final VolumeInfo candidate : candidates) {
BackupAppsStepFragment.java 159 final List<VolumeInfo> candidates = local
161 for (final VolumeInfo candidate : candidates) {
StorageFragment.java 146 final List<VolumeInfo> candidates = local
148 for (final VolumeInfo candidate : candidates) {
  /external/jline/
jline-1.0.jar 
  /prebuilts/tools/common/m2/repository/jline/jline/0.9.94/
jline-0.9.94.jar 
  /external/webrtc/webrtc/p2p/client/
basicportallocator.cc 272 // If any of the allocated ports have not completed the candidates allocation,
273 // mark those as error. Since session doesn't need any new candidates
274 // at this stage of the allocation, it's safe to discard any new candidates.
279 // Updating port state to error, which didn't finish allocating candidates
495 // from leaking), we ping from some local candidates even though we don't
496 // signal them. However, if host candidates are also disabled (for example, to
499 // both device enumeration and host candidates being disabled.
514 std::vector<Candidate> candidates; local
515 candidates.push_back(c);
516 SignalCandidatesReady(this, candidates);
566 std::vector<Candidate> candidates; local
    [all...]
  /frameworks/native/services/surfaceflinger/
DisplayDevice.cpp 116 std::vector<ColorMode> candidates; local
119 candidates.push_back(mode);
130 // add other HDR candidates when mode is HDR
134 candidates.push_back(hdrMode);
139 // add other SDR candidates
142 candidates.push_back(sdrMode);
146 return candidates;
151 std::vector<RenderIntent> candidates; local
154 candidates.push_back(intent);
166 // add other HDR candidates when intent is HD
188 std::vector<ColorMode> candidates = getColorModeCandidates(mode); local
201 std::vector<RenderIntent> candidates = getRenderIntentCandidates(intent); local
    [all...]
  /libcore/ojluni/src/main/java/java/security/
Security.java 540 LinkedHashSet<Provider> candidates = new LinkedHashSet<>(5); local
559 candidates = newCandidates;
564 // For each provider in the candidates set, if it
567 for (Iterator<Provider> cansIte = candidates.iterator();
575 candidates = null;
580 if ((candidates == null) || (candidates.isEmpty()))
583 Object[] candidatesArray = candidates.toArray();
843 LinkedHashSet<Provider> candidates = new LinkedHashSet<>(5); local
    [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
SuggestedWords.java 391 @Nonnull final ArrayList<SuggestedWordInfo> candidates) {
392 if (candidates.isEmpty()) {
398 typedWord, candidates, -1 /* startIndexExclusive */);
400 for (int i = 0; i < candidates.size(); ++i) {
402 candidates.get(i).mWord, candidates, i /* startIndexExclusive */); local
409 @Nonnull final ArrayList<SuggestedWordInfo> candidates,
412 for (int i = startIndexExclusive + 1; i < candidates.size(); ++i) {
413 final SuggestedWordInfo previous = candidates.get(i);
418 candidates.remove(i)
    [all...]
  /system/tpm/trunks/
resource_manager.cc 198 // Build a list of candidates by excluding |sessions_to_retain|.
199 std::vector<TPM_HANDLE> candidates; local
205 candidates.push_back(item.first);
208 if (candidates.empty()) {
214 candidates.begin(), candidates.end(), [this](TPM_HANDLE a, TPM_HANDLE b) {
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/
AbstractContactAggregator.java 677 MatchCandidateList candidates = new MatchCandidateList(); local
695 candidates);
734 MatchCandidateList candidates);
    [all...]
  /art/compiler/optimizing/
code_generator.h 856 const ArenaVector<std::pair<InstructionType*, SlowPathCode*>>& candidates = iter->second; local
    [all...]
  /external/icu/icu4c/source/common/
dictbe.cpp 100 int32_t count; // Count of candidates
102 int32_t offset; // Offset in the text of these candidates
112 // Fill the list of candidates if needed, select the longest, and return the number found
113 int32_t candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd );
134 int32_t PossibleWord::candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd ) { function in class:PossibleWord
252 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
255 if (candidates == 1) {
261 else if (candidates > 1) {
268 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
333 int32_t candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
487 int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
563 int32_t candidates = words[(wordsFound + 1) % LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
680 int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
756 int32_t candidates = words[(wordsFound + 1) % BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
885 int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
961 int32_t candidates = words[(wordsFound + 1) % KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
    [all...]
  /external/libtextclassifier/
text-classifier.cc 460 std::vector<AnnotatedSpan> candidates; local
465 &interpreter_manager, &tokens, &candidates)) {
469 if (!RegexChunk(context_unicode, selection_regex_patterns_, &candidates)) {
475 options.locales, ModeFlag_SELECTION, &candidates)) {
480 // Sort candidates according to their position in the input, so that the next
483 std::sort(candidates.begin(), candidates.end(),
489 if (!ResolveConflicts(candidates, context, tokens, &interpreter_manager,
496 if (SpansOverlap(candidates[i].span, click_indices) &&
497 SpansOverlap(candidates[i].span, original_click_indices))
1206 std::vector<AnnotatedSpan> candidates; local
    [all...]
  /external/libvpx/libvpx/vp9/decoder/
vp9_decodemv.c 451 // Make sure all the candidates are properly clamped etc
654 int_mv candidates[2 + MAX_MV_REF_CANDIDATES]; local
655 candidates[0] = bmi[1].as_mv[ref];
656 candidates[1] = bmi[0].as_mv[ref];
657 candidates[2] = mv_list[0];
658 candidates[3] = mv_list[1];
661 if (bmi[2].as_mv[ref].as_int != candidates[n].as_int) {
662 best_sub8x8->as_int = candidates[n].as_int;
  /external/tensorflow/tensorflow/core/grappler/optimizers/
arithmetic_optimizer.cc 340 std::vector<NodeDef*>& candidates = rep_[sig]; local
341 for (auto& candidate : candidates) {
346 candidates.push_back(node);
    [all...]
memory_optimizer.cc 119 // Add inputs and outputs to this subgraph if they are candidates
805 std::map<Costs::NanoSeconds, const NodeDef*> candidates; local
    [all...]
  /packages/apps/Settings/src/com/android/settings/applications/
AppStorageSettings.java 336 final List<VolumeInfo> candidates = context.getPackageManager() local
338 if (candidates.size() > 1) {
339 Collections.sort(candidates, VolumeInfo.getDescriptionComparator());
341 CharSequence[] labels = new CharSequence[candidates.size()];
343 for (int i = 0; i < candidates.size(); i++) {
344 final String volDescrip = storage.getBestVolumeDescription(candidates.get(i));
350 mCandidates = candidates.toArray(new VolumeInfo[candidates.size()]);
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
OpenWnnEN.java 124 /** Delay time(msec.) to start prediction after key input when the candidates view is not shown. */
127 /** Delay time(msec.) to start prediction after key input when the candidates view is shown. */
130 /** {@code Handler} for drawing candidates/displaying tutorial */
761 * and the candidates view is not shown, dismiss the SW-keyboard.
779 * Thread for updating the candidates view
782 int candidates = 0; local
785 candidates = mConverter.predict(mComposingText, 0, -1);
787 /* update the candidates view */
788 if (candidates > 0) {
801 /* update the candidates view *
    [all...]
  /toolchain/binutils/binutils-2.27/opcodes/
aarch64-dis.c 1235 enum aarch64_opnd_qualifier candidates[AARCH64_MAX_QLF_SEQ_NUM]; local
1437 enum aarch64_opnd_qualifier candidates[AARCH64_MAX_QLF_SEQ_NUM]; local
    [all...]
  /external/clang/lib/Sema/
SemaCast.cpp 347 OverloadCandidateSet &candidates = sequence.getFailedCandidateSet(); local
355 if (candidates.empty())
377 candidates.NoteCandidates(S, howManyCandidates, src);
    [all...]
  /external/deqp/external/vulkancts/modules/vulkan/pipeline/
vktPipelineRenderToImageTests.cpp 700 const deUint32 candidates = allowedMemTypeBits & compatibleTypes; local
702 if (candidates == 0)
705 return (deUint32)deCtz32(candidates);
    [all...]
  /external/deqp/modules/glshared/
glsLifetimeTests.cpp 421 const glu::TransferFormat candidates[] = local
429 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(candidates); ++ndx)
431 if (isTextureFormatColorRenderable(renderCtx, candidates[ndx]))
432 return candidates[ndx];
509 const deUint32 candidates[] = local
516 for (int ndx = 0; ndx < DE_LENGTH_OF_ARRAY(candidates); ++ndx)
518 if (isRenderbufferFormatColorRenderable(renderCtx, candidates[ndx]))
519 return candidates[ndx];
    [all...]
  /external/jline/src/src/main/java/jline/
ConsoleReader.java 111 * The number of tab-completion candidates above which a warning will be
112 * prompted before showing all the candidates.
333 * the number of candidates to print without issuing a warning.
340 * @return the number of candidates to print without issing a warning.
927 List candidates = new LinkedList(); local
936 if ((position = comp.complete(bufstr, cursor, candidates)) != -1) {
941 // no candidates? Fail.
942 if (candidates.size() == 0) {
946 return completionHandler.complete(this, candidates, position);
    [all...]

Completed in 1130 milliseconds

1 2 3 45 6 7 8 91011>>