| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| CandidatesViewManager.java | 23 * The interface of candidates view manager used by {@link OpenWnn}.
28 /** Size of candidates view (normal) */
30 /** Size of candidates view (full) */
32 /** Size of candidates view (close/non-display) */
57 * Initialize the candidates view.
63 * @return The candidates view created in the initialize process; {@code null} if cannot create a candidates view.
68 * Get the candidates view being used currently.
70 * @return The candidates view; {@code null} if no candidates view is used currently
[all...] |
| 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.
|
| TextCandidatesViewManager.java | 53 * The default candidates view manager class using {@link EditText}.
73 /** Maximum number of displaying candidates par one line (full view mode) */
76 /** Body view of the candidates list */
82 /** Button displayed bottom of the view when there are more candidates. */
86 /** Layout for the candidates list on normal view */
88 /** Layout for the candidates list on full view */
106 /** Whether hide the view if there is no candidates */
108 /** The converter to be get candidates from and notice the selected candidate to. */
110 /** Limitation of displaying candidates */
118 /** Number of candidates displaying *
[all...] |
| CandidateFilter.java | 20 * The filter class for candidates.
21 * This class is used for filtering candidates by {link WnnEngine}.
|
| OpenWnnEvent.java | 44 * This event makes {@link OpenWnn} to display conversion candidates from {@link ComposingText}.
51 * This event makes {@link OpenWnn} to display prediction candidates from {@link ComposingText}.
56 * List candidates (normal view).
58 * This event changes the candidates view's size
63 * List candidates (wide view).
65 * This event changes the candidates view's size
110 * Focus to the candidates view.
115 * Focus out from the candidates view.
|
| /system/media/mca/filterfw/java/android/filterfw/core/ |
| RandomScheduler.java | 43 Vector<Filter> candidates = new Vector<Filter>(); local
46 candidates.add(filter);
48 if (candidates.size() > 0) {
49 int r = mRand.nextInt(candidates.size());
50 return candidates.elementAt(r);
|
| /external/chromium/third_party/libjingle/source/talk/p2p/base/ |
| rawtransport.cc | 56 Candidates* candidates,
70 candidates->push_back(candidate);
77 const Candidates& candidates,
81 cand = candidates.begin();
82 cand != candidates.end();
|
| p2ptransport.cc | 81 Candidates* candidates,
84 // candidates according to XEP-176.
94 candidates->push_back(candidate);
157 const Candidates& candidates,
161 // candidates according to XEP-176.
162 for (std::vector<Candidate>::const_iterator iter = candidates.begin();
163 iter != candidates.end(); ++iter) {
|
| p2ptransport.h | 62 Candidates* candidates,
65 const Candidates& candidates,
|
| rawtransport.h | 49 Candidates* candidates,
52 const Candidates& candidates,
|
| rawtransportchannel.cc | 175 PortAllocatorSession *session, const std::vector<Candidate>& candidates) {
177 ASSERT(candidates.size() >= 1);
180 Candidate c = candidates[candidates.size() - 1];
187 if (stun_port_->candidates().size() < 2)
192 if (stun_port_->candidates()[0].address() ==
193 stun_port_->candidates()[1].address()) {
209 if (relay_port_->candidates().size() > 0)
235 ASSERT(port_->candidates().size() >= 1);
236 ASSERT(port_->candidates()[0].protocol() == "udp")
[all...] |
| sessionmessages.cc | 282 Candidates* candidates,
290 candidates, error);
298 TransportInfo tinfo(CN_OTHER, NS_GINGLE_P2P, Candidates());
301 &tinfo.candidates, error))
307 // If we don't have media, no need to separate the candidates.
313 // If we have media, separate the candidates. Create the
314 // TransportInfo here to avoid copying the candidates.
315 TransportInfo audio_tinfo(CN_AUDIO, NS_GINGLE_P2P, Candidates());
316 TransportInfo video_tinfo(CN_VIDEO, NS_GINGLE_P2P, Candidates());
[all...] |
| sessionmessages.h | 49 typedef std::vector<Candidate> Candidates;
110 const Candidates& candidates)
113 candidates(candidates) {}
117 Candidates candidates; member in struct:cricket::TransportInfo
|
| transport.h | 78 typedef std::vector<Candidate> Candidates;
80 // Used to parse and serialize (write) transport candidates. For
88 Candidates* candidates,
91 const Candidates& candidates,
171 // Handles sending of ready candidates and receiving of remote candidates.
174 void OnRemoteCandidates(const std::vector<Candidate>& candidates);
|
| p2ptransportchannel.h | 30 // connections which are combinations of candidates from each end (Alice and
31 // Bob each have candidates, one candidate from Alice and one candidate from
35 // kick off a process of determining more candidates and more connections.
65 // P2PTransportChannel manages the candidates and connection process to keep
124 const std::vector<Candidate>& candidates);
|
| transportchannelimpl.h | 64 // Handles sending and receiving of candidates. The Transport
65 // receives the candidates and may forward them to the relevant
68 // Note: Since candidates are delivered asynchronously to the
|
| /external/icu4c/common/ |
| dictbe.cpp | 111 int count; // Count of candidates
113 int32_t offset; // Offset in the text of these candidates
121 // Fill the list of candidates if needed, select the longest, and return the number found
122 int candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd );
148 PossibleWord::candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd ) { function in class:PossibleWord
265 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
268 if (candidates == 1) {
274 else if (candidates > 1) {
281 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
342 int candidates = words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
[all...] |
| /external/clang/test/Sema/ |
| overloadable-complex.c | 34 char *cp = promote_or_convert(fc); // expected-error{{call to 'promote_or_convert' is ambiguous; candidates are:}}
35 int *ip2 = promote_or_convert(f); // expected-error{{call to 'promote_or_convert' is ambiguous; candidates are:}}
|
| /frameworks/base/core/java/android/text/method/ |
| LinkMovementMethod.java | 105 ClickableSpan[] candidates = buffer.getSpans(first, last, ClickableSpan.class); local
144 for (int i = 0; i < candidates.length; i++) {
145 int end = buffer.getSpanEnd(candidates[i]);
149 beststart = buffer.getSpanStart(candidates[i]);
166 for (int i = 0; i < candidates.length; i++) {
167 int start = buffer.getSpanStart(candidates[i]);
172 bestend = buffer.getSpanEnd(candidates[i]);
|
| /external/clang/test/SemaCXX/ |
| builtin-ptrtomember-ambig.cpp | 20 // FIXME. Why so many built-in candidates?
|
| overload-member-call.cpp | 35 g(0); // expected-error{{call to 'g' is ambiguous; candidates are:}}
44 xv.f(0); // expected-error{{no matching member function for call to 'f'; candidates are:}}
45 xvp->f(0); // expected-error{{no matching member function for call to 'f'; candidates are:}}
53 X::g(0); // expected-error{{call to 'g' is ambiguous; candidates are:}}
70 // Tests the exact text used to note the candidates
|
| /external/llvm/lib/CodeGen/ |
| RegisterScavenging.cpp | 266 BitVector &Candidates,
269 int Survivor = Candidates.find_first();
270 assert(Survivor > 0 && "No candidates for scavenging");
285 // Remove any candidates touched by instruction.
297 Candidates.reset(MO.getReg());
299 Candidates.reset(*R);
310 if (Candidates.test(Survivor))
313 // All candidates gone?
314 if (Candidates.none())
317 Survivor = Candidates.find_first()
[all...] |
| /external/skia/src/animator/ |
| thingstodo.txt | 4 candidates are scripts
|
| /external/webkit/Source/WebCore/manual-tests/autocorrection/ |
| close-window-when-correction-is-shown.html | 37 <p>After seeing the panel with multiple candidates, close the window.</p>
|
| /packages/inputmethods/PinyinIME/jni/include/ |
| pinyinime.h | 88 * @return The number of candidates.
100 * @return The number of candidates.
116 * @return The number of candidates.
154 * the end of all spelling ids, new candidates will be provided from the
156 * spelling ids, there will be only one new candidates, or the whole fixed
160 * @return The number of candidates. If after the selection, the whole result
168 * @return The number of candidates.
|
