Lines Matching defs:and
2 * Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
52 * A kit of methods and classes useful for manipulating XML trees in
53 * memory. They are very compact and easy to use. An XML element
55 * for its name, each attribute name and value, and each sub-element.
60 * There are viewing and conversion operators to and from various
181 * // finders, removers, and replacers do addContent of each filtered value
182 * // (i.e., TokenLists and anonymous Elements are broken out into their parts)
233 * --- parsing and printing
263 * XMLKit.and(Filter&Filter | Filter[])
295 // hashCode and equals must be more distinctive than Lists.
305 // Child elements and attr keys and values are never null.
339 /** An empty element with the given name and attributes.
350 /** An empty element with the given name and sub-elements.
361 /** An empty element with the given name, attributes, and sub-elements.
451 /** Returns new Element(this), and also recursively copies sub-elements. */
504 * and by query functions which return multiple values,
574 /** True if name, attributes, and elements are the same. */
582 // elements must be equal and ordered
656 // Finally, elements should be equal and ordered,
657 // and the first difference rules.
953 // Filter and merge.
1011 /** Clears out all sub-elements, and replaces them by the given text.
1033 * pre-existing text, and to do so efficiently even if there
1039 * Internal token boundaries in the original text, and in the new
1042 * or new String may be created to join the last old and first
1053 * StringBuffer containing both its and the first new token.
1067 * space is virtually present also, and will be observed if
1443 // removeAllInTree(f) == replaceAll(replaceInTree(and(f,emptyF)))
1444 // removeAllInTree(f,S) == replaceAll(replaceInTree(and(content(f,S),emptyF)))
1476 replaceAll(replaceInTree(and(content(f, sink), emptyFilter())));
1858 * The name of each sub-element is the attribute key, and the text
1859 * This is a fresh copy, and can be updated with affecting the original.
1980 * Disregards name, sub-elements, and ordering of attributes.
2123 // reorder keys and values
2136 Notes on whitespace and tokenization.
2144 Internally, we need addToken (intervening blank) and addText
2607 // Reallocate and open up at parts[pos] to at least len empty places.
2614 // There must be at least len nulls between elems and attrs.
2890 * value for false, and the original object value for true.
2971 * (Note that an attribute is missing if and only if its value is null.)
3113 public static Filter and(final Filter f0, final Filter f1) {
3114 return and(new Filter[]{f0, f1});
3117 public static Filter and(final Filter... fs) {
3179 * and where each non-null result is passed as the argument
3236 * findInTree(f) == replaceInTree(and(f, selfFilter())).
3456 /** Call the filter on each list element x, and replace x with the
3514 * to the collection, and return the number of parts.
3515 * Otherwise, add e to the collection, and return one.
3850 // Ignore. We will miss the comments and whitespace.
4159 * Otherwise, return a Double if str spells a double value and contains '.' or 'e'.
4312 replaceInTree(and(not(elementFilter()), emptyFilter()),
4313 and(testSizeF, makeAnonF));