HomeSort by relevance Sort by last modified time
    Searched full:candidates (Results 1 - 25 of 257) sorted by null

1 2 3 4 5 6 7 8 91011

  /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.
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 */
744 * and the candidates view is not shown, dismiss the SW-keyboard.
762 * Thread for updating the candidates view
765 int candidates = 0; local
768 candidates = mConverter.predict(mComposingText, 0, -1);
770 /* update the candidates view */
771 if (candidates > 0) {
784 /* update the candidates view *
    [all...]
  /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...]
  /frameworks/base/core/java/android/text/method/
LinkMovementMethod.java 104 ClickableSpan[] candidates = buffer.getSpans(first, last, ClickableSpan.class); local
143 for (int i = 0; i < candidates.length; i++) {
144 int end = buffer.getSpanEnd(candidates[i]);
148 beststart = buffer.getSpanStart(candidates[i]);
165 for (int i = 0; i < candidates.length; i++) {
166 int start = buffer.getSpanStart(candidates[i]);
171 bestend = buffer.getSpanEnd(candidates[i]);
  /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.
  /libcore/luni/src/main/java/org/apache/harmony/security/utils/
JarUtils.java 188 private static X509Certificate[] createChain(X509Certificate signer, X509Certificate[] candidates) {
201 issuerCert = findCert(issuer, candidates);
215 private static X509Certificate findCert(Principal issuer, X509Certificate[] candidates) {
216 for (int i = 0; i < candidates.length; i++) {
217 if (issuer.equals(candidates[i].getSubjectDN())) {
218 return candidates[i];
  /external/webkit/WebKitTools/CodeCoverage/
run-generate-coverage-data 173 def generate_covs(candidates):
181 print candidates.keys()
182 for dir in candidates.keys():
184 for dep in candidates[dir].keys():
217 candidates = map(lambda x: parse_dependency_file(x,base_dir,[]), depends) variable
219 # Build a number of sources from the candidates. This is a Set for the poor
223 for (_,dir,deps) in candidates:
234 print "Found %d candidates" % (len(sources))
  /packages/inputmethods/PinyinIME/src/com/android/inputmethod/pinyin/
CandidateView.java 53 * The width to draw candidates.
96 * If true, update the arrow status when drawing candidates.
128 * The Drawable used to display as separators between candidates.
133 * Color to draw normal candidates generated by IME.
138 * Color to draw normal candidates Recommended by application.
143 * Color to draw the normal(not highlighted) candidates, it can be one of
149 * Color to draw the active(highlighted) candidates, including candidates
150 * from IME and candidates from application.
155 * Text size to draw candidates generated by IME
    [all...]
  /external/chromium/third_party/icu/source/common/
dictbe.cpp 116 int count; // Count of candidates
118 int32_t offset; // Offset in the text of these candidates
126 // Fill the list of candidates if needed, select the longest, and return the number found
127 int candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd );
153 PossibleWord::candidates( UText *text, const TrieWordDictionary *dict, int32_t rangeEnd ) { function in class:PossibleWord
270 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
273 if (candidates == 1) {
279 else if (candidates > 1) {
286 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)
347 int candidates = words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); local
    [all...]
  /packages/inputmethods/LatinIME/java/res/layout/
candidates.xml 30 android:id="@+id/candidates"
  /external/wpa_supplicant/
preauth.c 173 * address. This is usually called for PMKSA candidates found from scan results
287 * rsn_preauth_candidate_process - Process PMKSA candidates
290 * Go through the PMKSA candidates and start pre-authentication if a candidate
291 * without an existing PMKSA cache entry is found. Processed candidates will be
342 "candidates");
353 * This function is used to add PMKSA candidates for RSN pre-authentication. It
355 * candidates, i.e., EVENT_PMKID_CANDIDATE events to wpa_supplicant_event().
423 * rsn_preauth_scan_results - Process scan results to find PMKSA candidates
443 * TODO: is it ok to free all candidates? What about the entries
469 * Give less priority to candidates found from norma
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/rsn_supp/
preauth.c 173 * address. This is usually called for PMKSA candidates found from scan results
287 * rsn_preauth_candidate_process - Process PMKSA candidates
290 * Go through the PMKSA candidates and start pre-authentication if a candidate
291 * without an existing PMKSA cache entry is found. Processed candidates will be
344 "candidates");
355 * This function is used to add PMKSA candidates for RSN pre-authentication. It
357 * candidates, i.e., EVENT_PMKID_CANDIDATE events to wpa_supplicant_event().
426 * rsn_preauth_scan_results - Process scan results to find PMKSA candidates
445 * TODO: is it ok to free all candidates? What about the entries
474 * Give less priority to candidates found from norma
    [all...]
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/
KanaConverter.java 475 /** List of the generated candidates */
525 /* Create pseudo candidates for all keyboard type */
536 /* Create pseudo candidates for Qwerty keyboard */
539 /* Create pseudo candidates for 12key */
541 /* Create pseudo candidates for half width numeric */
551 /* Create pseudo candidates for full width numeric */
556 /* Create pseudo candidates for half width alphabet */
565 /* Create pseudo candidates for full width alphabet */
586 /* Create pseudo candidates for half width alphabet */
593 /* Create pseudo candidates for the full width alphabet *
    [all...]
OpenWnnClauseConverterJAJP.java 49 /** candidates of conversion */
123 * @return The candidates of conversion; {@code null} if an error occurs.
135 /* clear the candidates list */
253 * @param all Get all candidates or not
281 /* get candidates of stem in a clause */
311 * Add valid clause to the candidates list.
318 * @param all Get all candidates or not
524 * @param all Get all candidates or not
OpenWnnEngineJAJP.java 79 /** Limitation of predicted candidates */
97 /** Number of output candidates */
101 * Where to get the next candidates from.<br>
118 /** Whether displaying single clause candidates or not */
229 /* get candidates by single clause conversion */
237 /* end of candidates by single clause conversion */
241 /* get candidates from Kana converter */
284 * Clear work area that hold candidates information.
  /external/apache-http/src/org/apache/commons/codec/
Decoder.java 48 * candidates are that the parameter passed to this
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/generators/
DSAKeyPairGenerator.java 53 // B.1.2 Key Pair Generation by Testing Candidates
  /libcore/luni/src/main/java/org/apache/xml/utils/
StringBufferPool.java 25 * String buffers are good candidates for pooling, because of
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/EN/
OpenWnnEngineEN.java 39 /** Limitation of predicted candidates */
52 /** Number of output candidates */
135 /* get the default candidates */
157 * Add a word to the candidates list if there is no duplication.
202 * capitalization information to adjust the candidates
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
ContactAggregator.java 485 MatchCandidateList candidates = new MatchCandidateList(); local
489 aggregateContact(db, rawContactId, accountType, accountName, currentContactId, candidates,
519 MatchCandidateList candidates, ContactMatcher matcher, ContentValues values) {
532 candidates.clear();
537 contactId = pickBestMatchBasedOnData(db, rawContactId, candidates, matcher);
1790 MatchCandidateList candidates = new MatchCandidateList(); local
    [all...]
  /frameworks/base/core/java/android/inputmethodservice/
InputMethodService.java 87 * a basic framework for standard UI elements (input view, candidates view,
103 * <li>The candidates view, if currently shown, is placed above the soft
136 * <h3>Candidates View</h3>
140 * be selected for use. This is accomplished with the candidates view, and
142 * to instantiate your own view implementing your candidates UI.</p>
144 * <p>Management of the candidates view is a little different than the input
145 * view, because the candidates view tends to be more transient, being shown
146 * only when there are possible candidates for the current text being entered
147 * by the user. To control whether the candidates view is shown, you use
165 * input and candidates views.</p
    [all...]

Completed in 903 milliseconds

1 2 3 4 5 6 7 8 91011