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

12 3 4 5 6 7 8 91011>>

  /external/chromium_org/chrome/browser/chromeos/input_method/
candidate_window_constants.h 24 // too narrow when all candidates are short.
28 // too wide when one of candidates are long.
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
WnnEngine.java 59 * @return Plus value if there are candidates; 0 if there is no candidate; minus value if a error occurs.
71 * To get other candidates of each clause, call {@link #makeCandidateListOf(int)}.
74 * @return Plus value if there are candidates; 0 if there is no candidate; minus value if a error occurs.
82 * @return Plus value if there are candidates; 0 if there is no candidate; minus value if a error occurs.
90 * @return Plus value if there are candidates; 0 if there is no candidate; minus value if a error occurs.
119 * candidates to the learning dictionary or update the frequency
180 * This method is used when to make a list of other candidates of
186 * @return Plus value if there are candidates; 0 if there is no candidate; minus value if a error occurs.
  /external/chromium_org/ui/keyboard/resources/elements/
kb-altkey-data.html 58 * Creates a list of alternate candidates to display in a popup on a
61 * @param {number} maxLeftOffset Limits the number of candidates
64 * @param {number} maxRightOffset Limits the number of candidates
68 * to include in the candidates list.
85 // more likely candidates are placed in the center of the popup,
  /external/clang/include/clang/Sema/
TemplateDeduction.h 219 /// For now, assume that the candidates are non-matching specializations.
239 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
244 SmallVector<TemplateSpecCandidate, 16> Candidates;
259 /// \brief Clear out all of the candidates.
264 iterator begin() { return Candidates.begin(); }
265 iterator end() { return Candidates.end(); }
267 size_t size() const { return Candidates.size(); }
268 bool empty() const { return Candidates.empty(); }
273 Candidates.push_back(TemplateSpecCandidate());
274 return Candidates.back()
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/p2p/base/
session.h 116 const Candidates& sent_candidates() const { return sent_candidates_; }
117 const Candidates& unsent_candidates() const { return unsent_candidates_; }
129 void AddSentCandidates(const Candidates& candidates);
130 void AddUnsentCandidates(const Candidates& candidates);
150 bool OnRemoteCandidates(const Candidates& candidates, std::string* error);
158 // Called when a transport signals that it has new candidates.
160 const Candidates& candidates)
    [all...]
portallocatorsessionproxy.cc 151 // If port already has candidates, send this to the clients of proxy
154 if (!port->Candidates().empty()) {
155 proxy->OnCandidatesReady(session_.get(), port->Candidates());
218 const std::vector<Candidate>& candidates) {
222 // all Candidates will have name associated with the common PAS.
225 for (size_t i = 0; i < candidates.size(); ++i) {
226 Candidate new_local_candidate = candidates[i];
turnport_unittest.cc 165 turn_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
175 udp_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
199 udp_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
201 turn_port_->Candidates()[0], Port::ORIGIN_MESSAGE);
260 ASSERT_EQ(1U, turn_port_->Candidates().size());
262 turn_port_->Candidates()[0].address().ipaddr());
263 EXPECT_NE(0, turn_port_->Candidates()[0].address().port());
275 ASSERT_EQ(1U, turn_port_->Candidates().size());
277 turn_port_->Candidates()[0].address().ipaddr());
278 EXPECT_NE(0, turn_port_->Candidates()[0].address().port())
    [all...]
  /frameworks/base/core/java/android/text/method/
LinkMovementMethod.java 110 ClickableSpan[] candidates = buffer.getSpans(first, last, ClickableSpan.class); local
149 for (int i = 0; i < candidates.length; i++) {
150 int end = buffer.getSpanEnd(candidates[i]);
154 beststart = buffer.getSpanStart(candidates[i]);
171 for (int i = 0; i < candidates.length; i++) {
172 int start = buffer.getSpanStart(candidates[i]);
177 bestend = buffer.getSpanEnd(candidates[i]);
  /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/
jsepsessiondescription_unittest.cc 83 cricket::Candidates()))));
91 cricket::Candidates()))));
140 const IceCandidateCollection* ice_candidates = jsep_desc_->candidates(0);
149 EXPECT_EQ(0u, jsep_desc_->candidates(1)->count());
156 EXPECT_EQ(0u, jsep_desc_->candidates(0)->count());
157 const IceCandidateCollection* ice_candidates = jsep_desc_->candidates(1);
174 const IceCandidateCollection* ice_candidates = jsep_desc_->candidates(0);
183 EXPECT_EQ(0u, jsep_desc_->candidates(1)->count());
208 // with candidates.
  /external/chromium_org/android_webview/browser/
icon_helper.cc 50 const std::vector<content::FaviconURL>& candidates) {
52 for (std::vector<content::FaviconURL>::const_iterator i = candidates.begin();
53 i != candidates.end(); ++i) {
  /external/chromium_org/jingle/glue/
utils.h 32 // Helper functions to serialize and deserialize P2P candidates.
  /external/chromium_org/third_party/WebKit/ManualTests/autocorrection/
close-window-when-correction-is-shown.html 37 <p>After seeing the panel with multiple candidates, close the window.</p>
  /external/chromium_org/third_party/WebKit/Source/core/dom/
CustomElementUpgradeCandidateMap.cpp 75 const ListHashSet<Element*>& candidates = m_unresolvedDefinitions.take(descriptor); local
77 for (ElementSet::const_iterator candidate = candidates.begin(); candidate != candidates.end(); ++candidate) {
82 return candidates;
  /external/chromium_org/third_party/skia/src/animator/
thingstodo.txt 4 candidates are scripts
  /external/clang/test/SemaCXX/
ambiguous-conversion-show-overload.cpp 21 // CHECK-NEXT: {{remaining 4 candidates omitted; pass -fshow-overloads=all to show them}}
builtin-ptrtomember-ambig.cpp 20 // FIXME. Why so many built-in candidates?
  /external/llvm/lib/CodeGen/
RegisterScavenging.cpp 287 BitVector &Candidates,
290 int Survivor = Candidates.find_first();
291 assert(Survivor > 0 && "No candidates for scavenging");
306 // Remove any candidates touched by instruction.
310 Candidates.clearBitsNotInMask(MO.getRegMask());
321 Candidates.reset(*AI);
332 if (Candidates.test(Survivor))
335 // All candidates gone?
336 if (Candidates.none())
339 Survivor = Candidates.find_first()
    [all...]
  /external/objenesis/tck/src/org/objenesis/tck/candidates/
ConstructorThrowingException.java 16 package org.objenesis.tck.candidates;
ConstructorWithArguments.java 16 package org.objenesis.tck.candidates;
ConstructorWithMandatoryArguments.java 16 package org.objenesis.tck.candidates;
DefaultPackageConstructor.java 16 package org.objenesis.tck.candidates;
DefaultPrivateConstructor.java 16 package org.objenesis.tck.candidates;
DefaultProtectedConstructor.java 16 package org.objenesis.tck.candidates;
DefaultPublicConstructor.java 16 package org.objenesis.tck.candidates;
NoConstructor.java 16 package org.objenesis.tck.candidates;

Completed in 708 milliseconds

12 3 4 5 6 7 8 91011>>