| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ExpandableDictionary.java | 52 static class Node {
56 Node parent;
62 Node[] data;
67 data = new Node[INCREMENT];
70 void add(Node n) {
72 Node[] tempData = new Node[length + INCREMENT];
83 Node word;
87 NextWord(Node word, int frequency) {
146 final int frequency, Node parentNode)
218 Node node = searchNode(mRoots, word, 0, word.length()); local
258 final Node node = roots.data[i]; local
444 Node node; local
474 final Node node = children.data[j]; local
[all...] |
| /packages/inputmethods/PinyinIME/jni/share/ |
| dicttrie.cpp | 86 inline size_t DictTrie::get_son_offset(const LmaNodeGE1 *node) {
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) {
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,
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...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| cgraph.h | 139 /* For nested functions points to function the node is nested in. */
150 /* Pointer to a single unique cgraph node for this function. If the
165 /* Unique id of the node. */
275 /* Next asm node. */
277 /* String for this asm node. */
315 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
325 void cgraph_node_remove_callees (struct cgraph_node *node);
401 void cgraph_remove_link_node (struct cgraph_node *node);
413 void varpool_remove_link_node (struct varpool_node *node);
415 bool varpool_is_auxiliary (struct varpool_node *node);
482 struct varpool_node *node; local
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| cgraph.h | 139 /* For nested functions points to function the node is nested in. */
150 /* Pointer to a single unique cgraph node for this function. If the
167 /* Unique id of the node. */
277 /* Next asm node. */
279 /* String for this asm node. */
317 void cgraph_insert_node_to_hashtable (struct cgraph_node *node);
327 void cgraph_node_remove_callees (struct cgraph_node *node);
405 void cgraph_remove_link_node (struct cgraph_node *node);
417 void varpool_remove_link_node (struct varpool_node *node);
419 bool varpool_is_auxiliary (struct varpool_node *node);
488 struct varpool_node *node; local
[all...] |
| /sdk/ddms/app/src/com/android/ddms/ |
| PrefsDialog.java | 259 PreferenceNode node, subNode; local
265 node = new PreferenceNode("debugger", new DebuggerPrefs());
266 prefMgr.addToRoot(node);
269 //prefMgr.addTo(node.getId(), subNode);
272 node = new PreferenceNode("LogCat", new LogCatPrefs());
273 prefMgr.addToRoot(node);
275 node = new PreferenceNode("misc", new MiscPrefs());
276 prefMgr.addToRoot(node);
278 node = new PreferenceNode("stats", new UsageStatsPrefs());
279 prefMgr.addToRoot(node);
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ |
| AndroidContentAssist.java | 55 import org.w3c.dom.Node;
139 Node currentNode = getNode(viewer, offset);
143 // check to see if we can find a UiElementNode matching this XML node
148 // Should not happen (an XML doc always has at least a doc node). Just give up.
152 if (currentNode.getNodeType() == Node.ELEMENT_NODE) {
161 // We're not editing the current node name, so we might be editing its
166 // We're editing attributes in an element node (either the attributes' names
176 } else if (currentNode.getNodeType() == Node.TEXT_NODE) {
178 // Examine the parent of the text node.
212 * @param node The current node. Must not be null
747 Node node = null; local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/refactorings/extractstring/ |
| ExtractStringRefactoring.java | 80 import org.w3c.dom.Node;
122 * <li> If the target XML exists, find the <resources> node and add the new string ID right after.
123 * If the node is <resources/>, it needs to be opened.
488 Node node = null; local
495 // The structured model gives the us the actual XML Node element where the
496 // offset is. By using this Node, we can find the exact UiElementNode of our
501 for(int offset = mSelectionStart; offset >= 0 && node == null; --offset) {
502 node = (Node) smodel.getIndexedRegion(offset)
[all...] |
| /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/internal/repository/ |
| RepoSource.java | 26 import org.w3c.dom.Node;
487 Node oldRoot = null;
489 for (Node child = oldDoc.getFirstChild(); child != null; child = child.getNextSibling()) {
490 if (child.getNodeType() == Node.ELEMENT_NODE) {
504 Node attr = attrs.getNamedItem(xmlns);
516 // we must have found the root node, and it must have an XML namespace prefix.
527 // Find an inner <tool> node and extract its required parameters
529 Node tool = null;
533 // - an optional <uses-license> node, which we'll skip right now.
541 Node revision = findChild(tool, null, prefix, SdkRepository.NODE_REVISION);
587 Node node = findChild(archive, null, prefix, SdkRepository.NODE_URL); local
673 Element node = rootNode.getOwnerDocument().createElementNS(namespaceUri, nodeName); local
[all...] |
| /system/core/adb/ |
| transport.c | 374 device_tracker* node = *pnode; local
377 while (node) {
378 if (node == tracker) {
379 *pnode = node->next;
382 pnode = &node->next;
383 node = *pnode;
|
| /system/core/init/ |
| devices.c | 105 struct perm_node *node = calloc(1, sizeof(*node)); local
106 if (!node)
109 node->dp.name = strdup(name);
110 if (!node->dp.name)
114 node->dp.attr = strdup(attr);
115 if (!node->dp.attr)
119 node->dp.perm = perm;
120 node->dp.uid = uid;
121 node->dp.gid = gid
135 struct listnode *node; local
164 struct listnode *node; local
[all...] |
| init.c | 465 struct listnode *node; local
466 node = list_head(&act->commands);
467 if (!node)
470 return node_to_item(node, struct command, clist);
475 struct listnode *node; local
476 node = cmd->clist.next;
477 if (!node)
479 if (node == &act->commands)
482 return node_to_item(node, struct command, clist);
|
| /libcore/luni/src/test/java/org/apache/harmony/prefs/tests/java/util/prefs/ |
| PreferencesTest.java | 104 Preferences parent = root.node("java");
108 assertEquals("System Preference Node: " + p.absolutePath(), p
142 assertEquals("System Preference Node: " + p.absolutePath(), p
171 Preferences parent = root.node("java");
175 assertEquals("User Preference Node: " + p.absolutePath(), p.toString());
199 assertEquals("User Preference Node: " + p.absolutePath(), p.toString());
277 prefs = Preferences.userRoot().node("tests");
420 method = "node",
564 p.node(null);
649 Preferences child1 = pref.node("child1")
1828 public Preferences node(String name) { method in class:PreferencesTest.MockPreferences
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 1052 /* allocate a new entry as a cache node */
1131 Entry* node = *pnode; local
1132 *pnode = node->hlink;
1133 entry_free(node);
1216 Entry* node = *pnode; local
[all...] |
| /external/bluetooth/glib/glib/ |
| gconvert.c | 299 * @node: cache bucket's node
306 * @node is not a required argument. If @node is not supplied, we
310 iconv_cache_bucket_expire (GList *node, struct _iconv_cache_bucket *bucket)
314 if (node == NULL)
315 node = g_list_find (iconv_cache_list, bucket);
317 g_assert (node != NULL);
319 if (node->prev)
321 node->prev->next = node->next
352 GList *node, *next; local
[all...] |
| /external/bluetooth/glib/gobject/ |
| gparam.c | 1265 GSList **slists, *node; local
[all...] |
| /external/bluetooth/glib/tests/ |
| sequence-test.c | 26 get_priority (GSequenceNode *node)
28 guint key = GPOINTER_TO_UINT (node);
41 check_node (GSequenceNode *node)
43 if (node)
45 g_assert (node->parent != node);
46 if (node->parent)
47 g_assert (node->parent->left == node || node->parent->right == node)
61 GSequenceNode *node = seq->end_node; local
[all...] |
| testglib.c | 238 node_build_string (GNode *node,
245 c[0] = ((gchar) ((gintptr) (node->data)));
260 GNode *node; local
305 node = g_node_nth_child (node_B, i);
306 g_assert (P2C (node->data) == ('C' + i));
321 * child of 'F', which will cause 'F' to be the last node visited.
353 node = g_node_copy (root);
354 g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == g_node_n_nodes (node, G_TRAVERSE_ALL));
355 g_assert (g_node_max_height (root) == g_node_max_height (node));
357 g_node_traverse (node, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &cstring)
[all...] |
| /external/chromium/sdch/open-vcdiff/src/gtest/src/ |
| gtest-internal-inl.h | 153 // ListNode is a node in a singly-linked list. It consists of an
154 // element and a pointer to the next node. The last node in the list
168 // Creates a node with a given element value. The next pointer is
180 // Gets the element in this node.
184 // Gets the next node in the list.
204 // 1. Deletes every node.
205 ListNode<E> * node = head_; local
206 ListNode<E> * next = node->next();
208 delete node;
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| plurrule.cpp | 1154 RuleChain *node=header; local
1162 while(node!=NULL) {
1163 fKeywordNames.addElement(new UnicodeString(node->keyword), status);
1167 if (node->keyword == PLURAL_KEYWORD_OTHER) {
1170 node=node->next;
|
| /external/clearsilver/util/ |
| neo_hdf.c | 38 * it, we use the HDF node itself as the key, and have specific
196 static int _walk_hdf (HDF *hdf, const char *name, HDF **node)
205 *node = NULL;
210 *node = hdf;
286 return _walk_hdf (hp->top, hp->value, node);
289 *node = hp;
295 HDF *node; local
299 if ((_walk_hdf(hdf, name, &node) == 0) && (node->value != NULL))
301 v = strtol (node->value, &n, 10)
312 HDF *node; local
323 HDF *node; local
351 HDF *node; local
852 HDF *node; local
1080 HDF *node; local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| dict.c | 74 static void dnode_free(dnode_t *node, void *context);
77 * Perform a ``left rotation'' adjustment on the tree. The given node P and
93 /* don't need to check for root node here because root->parent is
94 the sentinel nil node, and root->parent->left points back to root */
135 * node and free everything under it. Used by dict_free().
138 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil)
140 if (node == nil)
142 free_nodes(dict, node->left, nil);
143 free_nodes(dict, node->right, nil);
144 dict->freenode(node, dict->context)
836 dnode_t *node = dict->allocnode(dict->context); local
1032 dnode_t *node = dict_first(dict), *next; local
[all...] |
| profile.c | 147 #define CHECK_MAGIC(node) \
148 if ((node)->magic != PROF_MAGIC_NODE) \
184 (struct profile_node *node);
196 struct profile_node **node);
686 struct profile_node *node; local
829 profile_add_node(state->current_section, tag, value, &node);
831 node->final = 1;
1032 * Each node may represent either a relation or a section header.
1043 * Free a node, and any children
1045 void profile_free_node(struct profile_node *node)
1274 struct profile_node *node; member in struct:profile_iterator
[all...] |
| /external/freetype/src/base/ |
| ftobjs.c | 1970 FT_ListNode node = NULL; local
2300 FT_ListNode node; local
2345 FT_ListNode node = 0; local
2403 FT_ListNode node; local
3751 FT_ListNode node = NULL; local
3798 FT_ListNode node; local
3841 FT_ListNode node; local
3898 FT_ListNode node = 0; local
[all...] |
| /external/icu4c/common/ |
| triedict.cpp | 48 // Node structure for the ternary, uncompressed trie
61 kEndsWord = 0x0001 // This node marks the end of a valid word
81 // Start the trie off with something. Having the root node already present
233 TernaryNode *fRoot; // Root node
265 TernaryNode *node = (TernaryNode *) fNodeStack.peek(); local
273 if (node->low != NULL) {
275 node = (TernaryNode *) fNodeStack.push(node->low, status);
280 emit = (node->flags & kEndsWord) != 0;
281 equal = (node->equal != NULL)
471 const CompactTrieNode *node = getCompactNode(fData, fData->root); local
598 const CompactTrieNode *node = getCompactNode(fHeader, fNodeStack.peeki()); local
766 CompactTrieVerticalNode *node = (CompactTrieVerticalNode *)(bytes+offset); local
950 BuildCompactTrieNode *node; local
1071 BuildCompactTrieNode *node; local
1152 const CompactTrieNode *node = getCompactNode(header, nodeIdx); local
[all...] |
| /external/icu4c/i18n/ |
| plurrule.cpp | 1154 RuleChain *node=header; local
1162 while(node!=NULL) {
1163 fKeywordNames.addElement(new UnicodeString(node->keyword), status);
1167 if (node->keyword == PLURAL_KEYWORD_OTHER) {
1170 node=node->next;
|
