/packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
H A D | AddressListParserVisitor.java | 7 public Object visit(SimpleNode node, Object data); argument 8 public Object visit(ASTaddress_list node, Object data); argument 9 public Object visit(ASTaddress node, Object data); argument 10 public Object visit(ASTmailbox node, Object data); argument 11 public Object visit(ASTname_addr node, Object data); argument 12 public Object visit(ASTgroup_body node, Object data); argument 13 public Object visit(ASTangle_addr node, Object data); argument 14 public Object visit(ASTroute node, Object data); argument 15 public Object visit(ASTphrase node, Object data); argument 16 public Object visit(ASTaddr_spec node, Objec argument 17 visit(ASTlocal_part node, Object data) argument 18 visit(ASTdomain node, Object data) argument [all...] |
/packages/apps/Email/src/com/android/email/view/ |
H A D | NonLockingScrollView.java | 101 private void excludeChildrenFromInterceptions(View node) { argument 104 if (node instanceof WebView) { 105 mChildrenNeedingAllTouches.add(node); 106 } else if (node instanceof ViewGroup) { 107 ViewGroup viewGroup = (ViewGroup) node;
|
/packages/apps/Gallery2/src/com/android/gallery3d/util/ |
H A D | LinkedNode.java | 28 public void insert(LinkedNode node) { argument 29 node.mNext = mNext; 30 mNext.mPrev = node; 31 node.mPrev = this; 32 mNext = node; 46 public void insertLast(T node) { argument 47 mHead.mPrev.insert(node); 58 public T nextOf(T node) { argument 59 return (T) (node.mNext == mHead ? null : node 62 previousOf(T node) argument [all...] |
H A D | ProfileData.java | 38 public int id; // this is the name of this node, mapped from mNameToId 55 mRoot = new Node(null, -1); // The id of the root node is unused. 80 Node node = mRoot; 82 if (node.children == null) { 83 node.children = new ArrayList<Node>(); 87 ArrayList<Node> children = node.children; 93 children.add(new Node(node, id)); 96 node = children.get(j); 99 node.sampleCount++; 131 private void writeOneStack(Node node, in argument 140 writeAllStacks(Node node, int depth) argument [all...] |
/packages/apps/Mms/src/com/android/mms/dom/ |
H A D | NodeListImpl.java | 38 * children of a root node with a given tag name. 52 * Constructs a NodeList for a given static node list. 53 * @param nodes The static node list. 73 Node node = null; 77 node = mSearchNodes.get(index); 83 node = mStaticNodes.get(index); 88 return node; 97 * This method fills the live node list. 101 private void fillList(Node node) { argument 104 if (node [all...] |
/packages/apps/Email/src/org/apache/james/mime4j/field/address/ |
H A D | Builder.java | 57 public AddressList buildAddressList(ASTaddress_list node) {
argument 59 for (int i = 0; i < node.jjtGetNumChildren(); i++) {
60 ASTaddress childNode = (ASTaddress) node.jjtGetChild(i);
67 private Address buildAddress(ASTaddress node) {
argument 68 ChildNodeIterator it = new ChildNodeIterator(node);
97 private MailboxList buildGroupBody(ASTgroup_body node) {
argument 99 ChildNodeIterator it = new ChildNodeIterator(node);
110 private Mailbox buildMailbox(ASTmailbox node) {
argument 111 ChildNodeIterator it = new ChildNodeIterator(node);
127 private NamedMailbox buildNameAddr(ASTname_addr node) {
argument 148 buildAngleAddr(ASTangle_addr node) argument 167 buildRoute(ASTroute node) argument 180 buildAddrSpec(ASTaddr_spec node) argument 183 buildAddrSpec(DomainList route, ASTaddr_spec node) argument 191 buildString(SimpleNode node, boolean stripSpaces) argument [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
H A D | ExpandableDictionary.java | 214 final Node node = children.mData[i]; 215 if (node.mCode == c) { 216 childNode = node; 314 final Node node = searchNode(mRoots, word, 0, word.length()); 315 // If node is null, we didn't find the word, so it's not valid. 316 // If node.mShortcutOnly is true, then it exists as a shortcut but not as a word, 318 // If node.mShortcutOnly is false, then it exists as a word (it may also exist as 320 return (node == null) ? false : !node.mShortcutOnly; 350 final Node node 391 addWordAndShortcutsFromNode(final Node node, final char[] word, final int depth, final int finalFreq, final ArrayList<SuggestedWordInfo> suggestions) argument [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
H A D | FusionDictionary.java | 35 * A node of the dictionary, containing several CharGroups. 37 * A node is but an ordered array of CharGroups, which essentially contain all the 88 * be seen as a traditional "trie node", except it can hold several characters at the 330 * Sanity check for a node. 332 * This method checks that all CharGroups in a node are ordered as expected. 335 private void checkStack(Node node) { argument 336 ArrayList<CharGroup> stack = node.mData; 408 // No node at this point to accept the word. Create one. 419 // The new word is a prefix of an existing word, but the node on which it 426 // We only have to create a new node an 525 findInsertionIndex(final Node node, int character) argument 543 findIndexOfChar(final Node node, int character) argument 553 findWordInTree(Node node, final String s) argument 600 countCharGroups(final Node node) argument 617 countNodes(final Node node) argument 630 hasBigramsInternal(final Node node) argument [all...] |
H A D | BinaryDictInputOutput.java | 306 + FormatSpec.MAX_CHARGROUPS_IN_A_NODE + " groups in a node (found " + count 312 * Compute the binary size of the group count for a node 313 * @param node the node 316 private static int getGroupCountSize(final Node node) { argument 317 return getGroupCountSize(node.mData.size()); 372 * Compute the maximum size of a node, assuming 3-byte addresses for everything, and caches 373 * it in the 'actualSize' member of the node. 375 * @param node the node t 378 setNodeMaximumSize(final Node node, final FormatOptions options) argument 473 flattenTreeInner(final ArrayList<Node> list, final Node node) argument 526 computeActualNodeSize(final Node node, final FusionDictionary dict, final FormatOptions formatOptions) argument 898 writePlacedNode(final FusionDictionary dict, byte[] buffer, final Node node, final FormatOptions formatOptions) argument [all...] |
/packages/inputmethods/PinyinIME/jni/share/ |
H A D | dictbuilder.cpp | 585 lma_nds_used_num_le0_ = 1; // The root node 597 // Move the node data and homo data to the DictTrie 647 void DictBuilder::set_son_offset(LmaNodeGE1 *node, size_t offset) { argument 648 node->son_1st_off_l = static_cast<uint16>(offset); 649 node->son_1st_off_h = static_cast<unsigned char>(offset >> 16); 652 void DictBuilder:: set_homo_id_buf_offset(LmaNodeGE1 *node, size_t offset) { argument 653 node->homo_idx_buf_off_l = static_cast<uint16>(offset); 654 node->homo_idx_buf_off_h = static_cast<unsigned char>(offset >> 16); 866 // Construct a node 1065 printf(".. total lemma node numbe [all...] |
H A D | spellingtrie.cpp | 260 void SpellingTrie::free_son_trie(SpellingNode* node) { argument 261 if (NULL == node) 264 for (size_t pos = 0; pos < node->num_of_son; pos++) { 265 free_son_trie(node->first_son + pos); 268 if (NULL != node->first_son) 269 delete [] node->first_son; 477 // Construct a node
|
H A D | dicttrie.cpp | 86 inline size_t DictTrie::get_son_offset(const LmaNodeGE1 *node) { argument 87 return ((size_t)node->son_1st_off_l + ((size_t)node->son_1st_off_h << 16)); 90 inline size_t DictTrie::get_homo_idx_buf_offset(const LmaNodeGE1 *node) { argument 91 return ((size_t)node->homo_idx_buf_off_l + 92 ((size_t)node->homo_idx_buf_off_h << 16)); 316 LmaNodeLE0 *node) { 319 for (size_t homo = 0; homo < (size_t)node->num_of_homo; homo++) { 320 lpi_items[lpi_num].id = get_lemma_id(node->homo_idx_buf_off + 334 size_t homo_buf_off, LmaNodeGE1 *node, 315 fill_lpi_buffer(LmaPsbItem lpi_items[], size_t lpi_max, LmaNodeLE0 *node) argument 333 fill_lpi_buffer(LmaPsbItem lpi_items[], size_t lpi_max, size_t homo_buf_off, LmaNodeGE1 *node, uint16 lma_len) argument 403 LmaNodeLE0 *node = root_; local 466 LmaNodeLE0 *node = root_ + p_mark.node_offset + ext_pos; local 543 LmaNodeGE1 *node = nodes_ge1_ + p_mark.node_offset + ext_pos; local 603 void *node = root_ + splid_le0_index_[splids[0] - kFullSplIdStart]; local 698 LmaNodeLE0 *node = node_fr_le0[node_fr_pos]; local 730 LmaNodeLE0 *node = node_fr_le0[node_fr_pos]; local 761 LmaNodeGE1 *node = node_fr_ge1[node_fr_pos]; local [all...] |
H A D | matrixsearch.cpp | 217 // Update the node, and make it to be a starting node 218 MatrixNode *node = mtrx_nd_pool_ + matrix_[0].mtrx_nd_pos; local 219 node->id = 0; 220 node->score = 0; 221 node->from = NULL; 222 node->step = 0; 223 node->dmi_fr = (PoolPosType)-1; 228 matrix_[0].mtrx_nd_fixed = node; 694 printf("-----------------%d\'th DMI node begi [all...] |
/packages/inputmethods/OpenWnn/libs/libwnnDictionary/engine/ |
H A D | ndbdic.c | 100 static NJ_INT16 search_yomi_node(NJ_UINT8 operation, NJ_UINT8 *node, 552 NJ_UINT8 *root, *now, *node, *node_mid; local 580 node = NULL; 611 node = root; 757 node = now; 766 node = now; 793 now = node; 796 if ((node == NULL) || !(NODE_DATA_EXIST(node))) { 799 (node ! 1541 NJ_UINT8 *root, *now, *node, *node_mid; local 1975 search_yomi_node(NJ_UINT8 operation, NJ_UINT8 *node, NJ_UINT8 *now, NJ_UINT16 idx_no, NJ_CHAR *yomi, NJ_UINT16 yomilen, NJ_UINT8 * root, NJ_UINT8 * node_mid, NJ_UINT16 bit_left, NJ_UINT16 bit_data, NJ_UINT8 * data_top, NJ_INT16 ytbl_cnt, NJ_UINT16 y, NJ_UINT8 * ytbl_top, NJ_CACHE_INFO * storebuf, NJ_UINT8 ** con_node, NJ_UINT32 * data_offset) argument 2255 NJ_UINT8 *node; local [all...] |
/packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/ |
H A D | nj_lib.h | 120 NJ_UINT8 *node; member in struct:__anon23
|