HomeSort by relevance Sort by last modified time
    Searched full:candidates (Results 351 - 375 of 702) sorted by null

<<11121314151617181920>>

  /external/chromium/third_party/libjingle/source/talk/p2p/base/
port.cc 526 if (local_candidate_index_ < port_->candidates().size())
527 return port_->candidates()[local_candidate_index_];
port.h 136 const std::vector<Candidate>& candidates() const { return candidates_; } function in class:cricket::Port
  /external/chromium_org/third_party/WebKit/Source/core/editing/
VisiblePosition.cpp 577 // We canonicalize to the first of two equivalent candidates, but the second of the two candidates
  /external/chromium_org/third_party/opus/src/silk/
SigProc_FIX.h 254 const opus_int32 search_thres1_Q16, /* I First stage threshold for lag candidates 0 - 1 */
255 const opus_int search_thres2_Q15, /* I Final threshold for lag candidates 0 - 1 */
    [all...]
NSQ.c 297 /* Find two quantization level candidates and measure their rate-distortion */
  /external/chromium_org/third_party/opus/src/silk/fixed/
pitch_analysis_core_FIX.c 78 const opus_int32 search_thres1_Q16, /* I First stage threshold for lag candidates 0 - 1 */
79 const opus_int search_thres2_Q15, /* I Final threshold for lag candidates 0 - 1 */
    [all...]
  /external/chromium_org/third_party/opus/src/silk/float/
pitch_analysis_core_FLP.c 73 const silk_float search_thres1, /* I First stage threshold for lag candidates 0 - 1 */
74 const silk_float search_thres2, /* I Final threshold for lag candidates 0 - 1 */
  /external/clang/lib/Sema/
CodeCompleteConsumer.cpp 490 OverloadCandidate *Candidates,
494 = Candidates[I].CreateSignatureString(CurrentArg, SemaRef,
  /external/clang/tools/libclang/
CIndexCodeCompletion.cpp 620 OverloadCandidate *Candidates,
625 = Candidates[I].CreateSignatureString(CurrentArg, S, getAllocator(),
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
qgain795.cpp 135 g_pitch_cand[] -- Word16 array -- Pitch gain candidates (3), Q14
209 Word16 g_pitch_cand[], /* i : Pitch gain candidates (3), Q14 */
319 /* loop through LTP gain candidates */
838 Word16 g_pitch_cand[3]; /* pitch gain candidates Q14 */
    [all...]
  /packages/inputmethods/PinyinIME/jni/share/
matrixsearch.cpp 759 // Choose a candidate, and give new candidates for next step.
786 lpi_total_ = 0; // Clean all other candidates.
    [all...]
  /external/chromium_org/v8/src/
mark-compact.cc 799 Candidate candidates[kMaxMaxEvacuationCandidates]; local
858 candidates[count++] = Candidate(fragmentation, p);
863 candidates[i].fragmentation() < least->fragmentation()) {
864 least = candidates + i;
877 AddEvacuationCandidate(candidates[i].page());
881 PrintF("Collected %d evacuation candidates for space %s\n",
    [all...]
  /external/v8/src/
mark-compact.cc 555 Candidate candidates[kMaxMaxEvacuationCandidates]; local
611 candidates[count++] = Candidate(fragmentation, p);
616 candidates[i].fragmentation() < least->fragmentation()) {
617 least = candidates + i;
630 AddEvacuationCandidate(candidates[i].page());
634 PrintF("Collected %d evacuation candidates for space %s\n",
    [all...]
  /external/clang/include/clang/Basic/
Diagnostic.h 179 OverloadsShown ShowOverloads; // Which overload candidates to show.
475 /// \brief Specify which overload candidates to show when overload resolution
478 /// By default, we show all candidates.
    [all...]
  /external/llvm/lib/Analysis/IPA/
InlineCost.cpp 341 // Also handle SROA candidates here, we already know that the GEP is
382 // Also look for SROA candidates here.
546 // Finally check for SROA candidates in comparisons.
    [all...]
  /development/samples/devbytes/animation/ListViewDraggingAnimation/src/com/example/android/listviewdragginganimation/
DynamicListView.java 512 * and determines whether they are potential candidates for a cell swap.
  /external/apache-http/src/org/apache/http/message/
BasicTokenIterator.java 52 // most likely candidates at the beginning of the collection
  /external/chromium_org/remoting/protocol/
jingle_messages_unittest.cc 206 EXPECT_EQ(message.candidates.size(), 2U);