Searched defs:tokens (Results 1 - 3 of 3) sorted by relevance

/packages/providers/ContactsProvider/src/com/android/providers/contacts/
H A DHanziToPinyin.java125 * Convert the input to a array of tokens. The sequence of ASCII or Unknown characters without
130 ArrayList<Token> tokens = new ArrayList<Token>();
132 // return empty tokens.
133 return tokens;
149 addToken(sb, tokens, tokenType);
155 addToken(sb, tokens, tokenType);
157 tokens.add(token);
161 addToken(sb, tokens, tokenType);
169 addToken(sb, tokens, tokenType);
171 return tokens;
174 addToken( final StringBuilder sb, final ArrayList<Token> tokens, final int tokenType) argument
[all...]
H A DNameSplitter.java234 // Iterate over tokens, skipping over empty ones and marking tokens that
319 * Parses a full name and returns components as a list of tokens.
321 public int tokenize(String[] tokens, String fullName) { argument
335 tokens[count++] = tokenizer.mTokens[i];
395 NameTokenizer tokens = new NameTokenizer(fullName);
396 parsePrefix(name, tokens);
398 // If the name consists of just one or two tokens, treat them as first/last name,
400 if (tokens.mEndPointer > 2) {
401 parseSuffix(name, tokens);
715 parsePrefix(Name name, NameTokenizer tokens) argument
733 parseSuffix(Name name, NameTokenizer tokens) argument
792 parseLastName(Name name, NameTokenizer tokens) argument
847 parseMiddleName(Name name, NameTokenizer tokens) argument
865 parseGivenNames(Name name, NameTokenizer tokens) argument
[all...]
/packages/providers/CalendarProvider/src/com/android/providers/calendar/
H A DCalendarProvider2.java317 * A regex for describing how we split search queries into tokens. Keeps
1164 * Splits the search query into individual search tokens based on whitespace
1169 * @return an array of tokens from the search query
1213 String constructSearchWhere(String[] tokens) { argument
1214 if (tokens.length == 0) {
1219 for (int j = 0; j < tokens.length; j++) {
1231 if (j < tokens.length - 1) {
1239 String[] constructSearchArgs(String[] tokens, long rangeBegin, long rangeEnd) { argument
1241 int numArgs = tokens.length * numCols + 2;
1246 for (int j = 0; j < tokens
[all...]

Completed in 57 milliseconds