HomeSort by relevance Sort by last modified time
    Searched full:candidate (Results 126 - 150 of 973) sorted by null

1 2 3 4 56 7 8 91011>>

  /frameworks/base/core/tests/coretests/src/android/view/
FocusFinderTest.java 238 * A non-candidate (even a much closer one) is always a worse choice
239 * than a real candidate.
250 Rect candidate = new Rect(src); local
251 candidate.offset(-(4 * src.width()), 0);
252 assertDirectionIsCandidate(View.FOCUS_LEFT, src, candidate);
254 assertBetterCandidate(View.FOCUS_LEFT, src, candidate, nonCandidate);
320 * down (and not those next to but still a candidate because
457 new Rect(0, 0, 20, 1)); // candidate
462 new Rect(0, -1, 20, 0)); // candidate
467 new Rect(-1, 0, 0, 20)); // candidate
    [all...]
  /external/objenesis/tck/src/org/objenesis/tck/
TCK.java 30 * 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,
113 Object instance = objenesis.newInstance(candidate);
114 boolean success = instance != null && instance.getClass() == candidate;
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/
CandidatesViewManager.java 52 * Attribute of a word (a candidate in the history list)
57 * Attribute of a word (the best candidate)
97 * @param type The candidate view type,
141 * Get candidate is focused now.
143 * @return the Candidate is focused of a flag.
148 * Select candidate that has focus.
169 text.setText(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...]
UserDictionaryToolsEdit.java 77 /** The constant for notifying dialog (The length of specified stroke or candidate exceeds the limit) */
150 mBeforeEditWnnWord.candidate = ((TextView)sFocusingPairView).getText().toString();
197 /* Text changed listener for the candidate text */
250 String candidate = mCandidateEditText.getText().toString(); local
251 if (addDictionary(stroke, candidate)) {
262 String candidate = mCandidateEditText.getText().toString(); local
263 if (addDictionary(stroke, candidate)) {
266 addDictionary(mBeforeEditWnnWord.stroke, mBeforeEditWnnWord.candidate);
334 * @param candidate The string of the word
337 private boolean addDictionary(String stroke, String candidate) {
    [all...]
  /packages/inputmethods/PinyinIME/jni/include/
pinyinime.h 130 * Get a candidate(or choice) string.
132 * @param cand_id The id to get a candidate. Started from 0. Usually, id 0
133 * is a sentence-level candidate.
134 * @param cand_str The buffer to store the candidate.
153 * Choose a candidate and make it fixed. If the candidate does not match
155 * first unfixed position. If the candidate matches the end of the all
159 * @param cand_id The id of candidate to select and make it fixed.
161 * string has been fixed, there will be only one candidate.
  /external/chromium/chrome/browser/profiles/
profile_manager.cc 170 Profile* candidate = iter->second->profile.get(); local
171 if (candidate->GetRuntimeId() == profile_id)
172 return candidate;
173 if (candidate->HasOffTheRecordProfile()) {
174 candidate = candidate->GetOffTheRecordProfile();
175 if (candidate->GetRuntimeId() == profile_id)
176 return candidate;
187 Profile* candidate = iter->second->profile.get(); local
188 if (candidate == profile |
    [all...]
  /external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.udecl/
p1.cpp 7 class foo {}; // expected-note {{candidate}}
8 test<0> foo(foo); // expected-note {{candidate}}
15 test<2> foo(class ::foo); // expected-note {{candidate}} \
  /external/clang/test/SemaCXX/
deleted-function.cpp 5 void fn() = delete; // expected-note {{candidate function has been explicitly deleted}}
14 void ov(int) {} // expected-note {{candidate function}}
15 void ov(double) = delete; // expected-note {{candidate function has been explicitly deleted}}
explicit.cpp 43 class Y { }; // expected-note {{candidate constructor (the implicit copy constructor) not viable: no known conversion from 'Z' to 'const Y &' for 1st argument}} \
44 expected-note {{candidate constructor (the implicit move constructor) not viable: no known conversion from 'Z' to 'Y &&' for 1st argument}} \
45 expected-note {{candidate constructor (the implicit copy constructor) not viable: no known conversion from 'Z' to 'const Y &' for 1st argument}} \
46 expected-note {{candidate constructor (the implicit move constructor) not viable: no known conversion from 'Z' to 'Y &&' for 1st argument}}
type-dependent-exprs.cpp 7 void g(int); // expected-note{{candidate function}}
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/
armVCM4P10_CompareMotionCostToMV.c 72 * [in] mvX x coordinate of the candidate motion vector in 1/4 pel units
73 * [in] mvY y coordinate of the candidate motion vector in 1/4 pel units
75 * [in] candSAD Candidate SAD
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/
ImagePoint.java 78 for (FilterPoint candidate : mRedEyeRep.getCandidates()) {
79 drawPoint(candidate, canvas, originalToScreen, originalRotateToScreen, paint);
85 FilterPoint candidate, Canvas canvas, Matrix originalToScreen,
  /build/core/
build_id.mk 17 # (like "MAIN") or a branch name and a release candidate
  /external/chromium/third_party/libjingle/source/talk/p2p/base/
transportchannelimpl.h 39 class Candidate;
73 const Candidate&> SignalCandidateReady;
74 virtual void OnCandidate(const Candidate& candidate) = 0;
  /external/clang/test/CXX/over/over.match/over.match.funcs/over.match.oper/
p3.cpp 6 // non-member candidate."
  /external/clang/test/CXX/temp/temp.decls/temp.class/temp.static/
p1-inst.cpp 17 struct CannotInit { }; // expected-note{{candidate constructor (the implicit copy constructor) not viable}}
p1.cpp 15 struct X2 { }; // expected-note{{candidate constructor (the implicit copy constructor) not viable}}
  /external/clang/test/CXX/temp/temp.decls/temp.variadic/
p2.cpp 13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function template not viable: requires at least 1 argument, but 0 were provided}}
  /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
p6.cpp 4 template<class T> void apply(T x, void (*f)(T)) { f(x); } // expected-note 2 {{candidate template ignored: deduced conflicting types for parameter 'T'}}\
53 // expected-note {{candidate template ignored: couldn't infer template argument 'T'}}
99 template<typename R, typename T> void f1(R (&)(T) , T); // expected-note{{candidate template ignored: couldn't infer template argument 'R'}}
100 template<typename R, typename T> void f2(R (* const&)(T), T); // expected-note{{candidate template ignored: couldn't infer template argument 'R'}}
  /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/
p15.cpp 4 NonDefaultConstructible(const NonDefaultConstructible&); // expected-note{{candidate constructor}}
  /external/clang/test/SemaTemplate/
explicit-instantiation.cpp 28 struct NotDefaultConstructible { // expected-note{{candidate constructor (the implicit copy constructor)}}
29 NotDefaultConstructible(int); // expected-note{{candidate constructor}}
52 template<typename T, typename U> void f2(T, U*) { } // expected-note{{candidate}}
53 template<typename T, typename U> void f2(T*, U) { } // expected-note{{candidate}}
instantiate-exception-spec-cxx11.cpp 98 template <typename T> void f1(T) throw(typename T::exception); // expected-note {{candidate}}
99 template <typename T> void f1(T, int = 0) throw(typename T::noitpecxe); // expected-note {{candidate}}
101 template <typename T> void f2(T) noexcept(T::throws); // expected-note {{candidate}}
102 template <typename T> void f2(T, int = 0) noexcept(T::sworht); // expected-note {{candidate}}
instantiate-subscript.cpp 9 long &operator[](long); // expected-note{{candidate function}}
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 387 /// If this queue only has one ready candidate, return it. As a side effect,
468 SchedCandidate &Candidate,
527 /// Pick the best candidate from the top queue.
534 SchedCandidate &Candidate) {
540 // BestSU remains NULL if no top candidates beat the best existing candidate.
548 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
550 // Initialize the candidate if needed.
551 if (!Candidate.SU) {
552 Candidate.SU = *I;
553 Candidate.RPDelta = RPDelta
    [all...]

Completed in 506 milliseconds

1 2 3 4 56 7 8 91011>>