Searched refs:node (Results 1 - 16 of 16) sorted by relevance

/packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/
H A DAddressListParserVisitor.java7 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/Mms/src/com/android/mms/dom/
H A DNodeListImpl.java38 * 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...]
H A DNamedNodeMapImpl.java35 Node node = null;
38 node = mNodes.elementAt(i);
42 return node;
58 Node node = getNamedItem(name);
59 if (node == null) {
62 mNodes.remove(node);
64 return node;
/packages/apps/Calendar/src/com/android/calendar/
H A DCalendarApplication.java29 * The Screen class defines a node in a linked list. This list contains
31 * coming earlier in the list. The "next" pointer of the head node
46 // Adds the given node to the list after this one
47 public void insert(Screen node) { argument
48 node.next = next;
49 node.previous = this;
50 next.previous = node;
51 next = node;
54 // Removes this node from the list it is in.
/packages/apps/Email/src/org/apache/james/mime4j/field/address/
H A DBuilder.java58 public AddressList buildAddressList(ASTaddress_list node) { argument
60 for (int i = 0; i < node.jjtGetNumChildren(); i++) {
61 ASTaddress childNode = (ASTaddress) node.jjtGetChild(i);
68 private Address buildAddress(ASTaddress node) { argument
69 ChildNodeIterator it = new ChildNodeIterator(node);
98 private MailboxList buildGroupBody(ASTgroup_body node) { argument
100 ChildNodeIterator it = new ChildNodeIterator(node);
111 private Mailbox buildMailbox(ASTmailbox node) { argument
112 ChildNodeIterator it = new ChildNodeIterator(node);
128 private NamedMailbox buildNameAddr(ASTname_addr node) { argument
149 buildAngleAddr(ASTangle_addr node) argument
168 buildRoute(ASTroute node) argument
181 buildAddrSpec(ASTaddr_spec node) argument
184 buildAddrSpec(DomainList route, ASTaddr_spec node) argument
192 buildString(SimpleNode node, boolean stripSpaces) argument
[all...]
/packages/inputmethods/PinyinIME/jni/share/
H A Ddicttrie.cpp86 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 Dspellingtrie.cpp260 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 Ddictbuilder.cpp585 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 Dmatrixsearch.cpp217 // 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 Dndbdic.c100 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/PinyinIME/jni/include/
H A Ddicttrie.h65 // An quick index from spelling id to the LmaNodeLE0 node buffer, or
97 // Get the offset of sons for a node.
98 inline size_t get_son_offset(const LmaNodeGE1 *node);
100 // Get the offset of homonious ids for a node.
101 inline size_t get_homo_idx_buf_offset(const LmaNodeGE1 *node);
110 // Given a LmaNodeLE0 node, extract the lemmas specified by it, and fill
114 LmaNodeLE0 *node);
116 // Given a LmaNodeGE1 node, extract the lemmas specified by it, and fill
121 size_t homo_buf_off, LmaNodeGE1 *node,
H A Ddictbuilder.h108 // Update the offset of sons for a node.
109 void set_son_offset(LmaNodeGE1 *node, size_t offset);
111 // Update the offset of homophonies' ids for a node.
112 void set_homo_id_buf_offset(LmaNodeGE1 *node, size_t offset);
133 // parent is the parent node to update the necessary information
H A Dspellingtrie.h31 // The spelling id for each node. If you need more bits to store
92 // The root node of the spelling tree
95 // If a none qwerty key such as a fnction key like ENTER is given, this node
96 // will be used to indicate that this is not a QWERTY node.
99 // If a splitter key is pressed, this node will be used to indicate that this
118 // How many node used to build the trie.
124 void free_son_trie(SpellingNode* node);
169 // average_score is the average_score of all spellings. The dumb node is
/packages/apps/Mms/src/com/android/mms/ui/
H A DSlideshowActivity.java117 Node node = map.item(j);
118 if (node == null) {
121 String attrName = node.getNodeName();
129 if (node instanceof AttrImpl) {
130 value = ((AttrImpl)node).getValue();
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
H A DExpandableDictionary.java208 final Node node = children.data[j];
209 if (node.code == currentChar) {
211 if (node.terminal) {
212 return node.frequency;
215 if (node.children != null) {
216 int freq = getWordFrequencyRec(node.children, word, offset + 1, length);
231 * @param roots node whose children have to be search for matches
261 final Node node = roots.data[i];
262 final char c = node.code;
264 final boolean terminal = node
[all...]
/packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/
H A Dnj_lib.h120 NJ_UINT8 *node; member in struct:__anon5

Completed in 501 milliseconds