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

12

/packages/apps/UnifiedEmail/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/Gallery2/src/com/android/gallery3d/util/
H A DLinkedNode.java28 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 DProfileData.java38 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/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/
H A Ddynamic_patricia_trie_gc_event_listeners.cpp26 ::onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node, argument
30 bool isUselessPtNode = !node->isTerminal();
31 if (node->isTerminal() && mIsDecayingDict) {
33 ForgettingCurveUtils::getEncodedProbabilityToSave(node->getProbability(),
35 int writingPos = node->getProbabilityFieldPos();
47 } else if (node->isTerminal()) {
49 int writingPos = node->getChildrenPosFieldPos();
57 if (!mWritingHelper->markNodeAsDeleted(node)) {
62 if (node->isTerminal()) {
70 ::onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node, argument
120 onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node, const int *const nodeCodePoints) argument
141 onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node, const int *const nodeCodePoints) argument
[all...]
H A Ddynamic_patricia_trie_gc_event_listeners.h69 bool onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node,
104 bool onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node,
136 bool onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node,
170 bool onVisitingPtNode(const DynamicPatriciaTrieNodeReader *const node,
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/
H A Ddic_node_utils.cpp51 // Traverse node expansion utils //
74 const DicNode *const node, MultiBigramMap *multiBigramMap) {
75 if (node->hasMultipleWords() && !node->isValidMultipleWordSuggestion()) {
78 const int probability = getBigramNodeProbability(dictionaryStructurePolicy, node,
88 const DicNode *const node, MultiBigramMap *multiBigramMap) {
89 const int unigramProbability = node->getProbability();
90 const int wordPos = node->getPos();
91 const int prevWordPos = node->getPrevWordPos();
72 getBigramNodeImprobability( const DictionaryStructureWithBufferPolicy *const dictionaryStructurePolicy, const DicNode *const node, MultiBigramMap *multiBigramMap) argument
86 getBigramNodeProbability( const DictionaryStructureWithBufferPolicy *const dictionaryStructurePolicy, const DicNode *const node, MultiBigramMap *multiBigramMap) argument
H A Ddic_node_utils.h47 const DicNode *const node, MultiBigramMap *const multiBigramMap);
56 const DicNode *const node, MultiBigramMap *multiBigramMap);
H A Ddic_node_priority_queue.h87 DicNode *node = mDicNodesQueue.top(); local
89 DicNodeUtils::initByCopy(node, dest);
91 node->remove();
159 AKLOGI("No unused node found.");
161 AKLOGI("Dump node availability, %d, %d, %d",
/packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/
H A DBuilder.java57 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/native/jni/src/suggest/core/policy/
H A Dweighting.cpp29 static inline void profile(const CorrectionType correctionType, DicNode *const node) { argument
33 PROF_OMISSION(node->mProfiler);
36 PROF_ADDITIONAL_PROXIMITY(node->mProfiler);
39 PROF_SUBSTITUTION(node->mProfiler);
42 PROF_NEW_WORD(node->mProfiler);
45 PROF_MATCH(node->mProfiler);
48 PROF_COMPLETION(node->mProfiler);
51 PROF_TERMINAL(node->mProfiler);
54 PROF_TERMINAL_INSERTION(node->mProfiler);
57 PROF_SPACE_SUBSTITUTION(node
[all...]
/packages/apps/Browser/tests/src/com/android/browser/tests/utils/
H A DMockObserverNode.java73 // If this is the leaf node add the observer
86 MockObserverNode node = mChildren.get(i);
87 if (node.mName.equals(segment)) {
88 node.addObserver(uri, index + 1, observer, notifyForDescendents);
94 MockObserverNode node = new MockObserverNode(segment);
95 mChildren.add(node);
96 node.addObserver(uri, index + 1, observer, notifyForDescendents);
149 // This is the leaf node, notify all observers
159 MockObserverNode node = mChildren.get(i);
160 if (segment == null || node
[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...]
/packages/apps/Gallery2/src/com/android/gallery3d/data/
H A DPathMatcher.java80 Node node = mMap.get(segment);
81 if (node != null) return node;
/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/apps/UnifiedEmail/assets/
H A Dscript.js208 var node;
362 var node;
365 node = nodes[i];
366 if (!conditionFn || conditionFn(node)) {
367 if (node.classList.contains(classToAdd)) {
370 node.classList.add(classToAdd);
372 actionLog.push([node.classList.remove, node.classList, [classToAdd]]);
380 var node;
386 node
[all...]
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
H A DExpandableDictionary.java177 * @param children The node to recursively search for addition. Initially, the root of the tree.
184 * @param parentNode The parent node, for up linking. Initially null, as the root has no parent.
196 final Node node = children.mData[i];
197 if (node.mCode == c) {
198 childNode = node;
281 final Node node = searchNode(mRoots, word, 0, word.length());
282 // If node is null, we didn't find the word, so it's not valid.
283 // If node.mShortcutOnly is true, then it exists as a shortcut but not as a word,
285 // If node.mShortcutOnly is false, then it exists as a word (it may also exist as
287 return (node
360 addWordAndShortcutsFromNode(final Node node, final char[] word, final int depth, final int finalFreq, final ArrayList<SuggestedWordInfo> suggestions) argument
[all...]
/packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/
H A DHtmlTree.java42 * For a string node, begin_[node] = end_[node] = node
43 * For an open tag, begin_[node] = node, end_[node] = the matching end tag
44 * For a close tag, end_[node] = the matching open tag, end_[node] = node
489 getTextPosition(int node) argument
[all...]
/packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/
H A DHtmlTree.java43 * For a string node, begin_[node] = end_[node] = node
44 * For an open tag, begin_[node] = node, end_[node] = the matching end tag
45 * For a close tag, end_[node] = the matching open tag, end_[node] = node
522 getTextPosition(int node) argument
[all...]
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/session/
H A Ddic_traverse_session.h122 void getSearchKeys(const DicNode *node, std::vector<int> *const outputSearchKeyVector) const { argument
127 const int pointerId = node->getInputIndex(i);
135 ProximityType getProximityTypeG(const DicNode *const node, const int childCodePoint) const { argument
141 const int pointerId = node->getInputIndex(i);
/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
/packages/apps/UnifiedEmail/src/com/android/mail/ui/
H A DFolderSelectorAdapter.java195 * special case the root node. If we don't find the parent node, then we pre-create one to fill
198 * Uri, so that we can find it later either to add children or to retrieve a half-created node.
199 * It should be noted that it is only valid to add a child node after the mWrappedObject
207 // Make double-sure we don't accidentally add the root node to the final list
216 TreeNode node = nodeMap.get(folder.folderUri.getComparisonUri());
217 if (node == null) {
218 node = new TreeNode(folderRow);
219 nodeMap.put(folder.folderUri.getComparisonUri(), node);
221 node
[all...]
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
H A DBinaryDictEncoderUtils.java82 * Compute the binary size of the PtNode count for a node array.
150 * the containing node array, and cache it it its 'mCachedSize' member.
152 * @param ptNodeArray the node array to compute the maximum size of.
158 for (PtNode node : ptNodeArray.mData) {
159 final int nodeSize = getPtNodeMaximumSize(node, options);
160 node.mCachedSize = nodeSize;
262 // Removing the node is necessary if the tails are merged, because we would then
263 // add the same node several times when we only want it once. A number of places in
264 // the code also depends on any node being only once in the list.
268 // to merge tails, and removing the node fro
652 makePtNodeFlags(final PtNode node, final int childrenOffset, final FormatOptions formatOptions) argument
[all...]

Completed in 422 milliseconds

12