Searched defs:children (Results 1 - 6 of 6) sorted by relevance
/packages/apps/Email/src/com/android/email/view/ |
H A D | NonLockingScrollView.java | 35 * we want to delegate those touches to children as normal, even in the middle of a drag. This is 53 * Whether or not the contents of this view is being dragged by one of the children in 59 * The list of children who should always receive touch events, and not have them intercepted. 87 // Don't intercept events - pass them on to children as normal. 102 // If additional types of children should be excluded (e.g. horizontal scrolling banners), 117 private static boolean isEventOverChild(MotionEvent ev, ArrayList<View> children) { argument 122 for (View child : children) {
|
/packages/apps/Email/emailcommon/src/org/apache/james/mime4j/field/address/parser/ |
H A D | SimpleNode.java | 7 protected Node[] children; field in class:SimpleNode 30 if (children == null) { 31 children = new Node[i + 1]; 32 } else if (i >= children.length) { 34 System.arraycopy(children, 0, c, 0, children.length); 35 children = c; 37 children[i] = n; 41 return children[i]; 45 return (children [all...] |
/packages/apps/Gallery2/src/com/android/gallery3d/data/ |
H A D | MtpContext.java | 124 List<MtpObjectInfo> children) { 129 for (MtpObjectInfo child : children) { 139 return success == children.size(); 123 copyAlbum(String deviceName, String albumName, List<MtpObjectInfo> children) argument
|
/packages/inputmethods/LatinIME/tools/makedict/src/com/android/inputmethod/latin/ |
H A D | FusionDictionary.java | 71 * A group of characters, with a frequency, shortcuts, bigrams, and children. 76 * of the trie trie; as such, it can be a terminal, and it can have children. 80 * bigrams, but a non-terminal may not. Moreover, children, if present, are null. 101 final ArrayList<WeightedString> bigrams, final int frequency, final Node children) { 105 mChildren = children; 478 // if (!isEqual(aGroup.children, bGroup.children)) return false; 489 // if (null != group.children) { 490 // String pseudoHash = getPseudoHash(group.children); 498 // if (isEqual(group.children, simila 100 CharGroup(final int[] chars, final ArrayList<WeightedString> bigrams, final int frequency, final Node children) argument [all...] |
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
H A D | ExpandableDictionary.java | 160 private void addWordRec(NodeArray children, final String word, final int depth, argument 165 // Does children have the current character? 166 final int childrenLength = children.mLength; 169 final Node node = children.mData[i]; 179 children.add(childNode); 256 * @param roots node whose children have to be search for matches 291 final NodeArray children = node.mChildren; 307 if (children != null) { 308 getWordsRec(children, codes, word, depth + 1, true, snr, inputIndex, 315 if (children ! 407 searchWord(NodeArray children, String word, int depth, Node parentNode) argument 523 searchNode(final NodeArray children, final CharSequence word, final int offset, final int length) argument [all...] |
/packages/apps/Exchange/src/com/android/exchange/adapter/ |
H A D | ContactsSyncAdapter.java | 373 ArrayList<String> children = new ArrayList<String>(); 497 childrenParser(children); 607 if (!children.isEmpty()) { 608 ops.addChildren(entity, children); 654 private void childrenParser(ArrayList<String> children) throws IOException { argument 658 if (children.size() < EasChildren.MAX_CHILDREN) { 659 children.add(getValue()); 1182 public void addChildren(Entity entity, ArrayList<String> children) { argument 1185 for (String child: children) {
|
Completed in 149 milliseconds