Searched defs:find (Results 1 - 12 of 12) sorted by relevance

/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/support/
H A DI.java4 String find(String key); method in interface:I
H A DA.java10 public String find(String key) { method in class:A
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/support/
H A DA.java27 public String find(String key) { method in class:A
H A DI.java21 String find(String key); method in interface:I
/libcore/ojluni/src/main/java/sun/security/util/
H A DAlgorithmDecomposer.java136 private static void hasLoop(Set<String> elements, String find, String replace) { argument
137 if (elements.contains(find)) {
141 elements.remove(find);
/libcore/luni/src/main/java/javax/xml/datatype/
H A DFactoryFinder.java179 * @param factoryId Name of the factory to find, same as a property name
186 static Object find(String factoryId, String fallbackClassName) throws ConfigurationError { method in class:FactoryFinder
227 * Try to find provider using Jar Service Provider Mechanism
/libcore/ojluni/src/main/java/sun/misc/
H A DRegexpPool.java111 p = p.find(re.charAt(i));
121 p = p.find(re.charAt(i));
157 /** Identical to match except that it will only find matches to
211 p = p.find(s.charAt(i));
222 p = p.find(s.charAt(i));
294 RegexpNode find(char C) { method in class:RegexpNode
/libcore/ojluni/src/main/java/java/util/regex/
H A DMatcher.java47 * <li><p> The {@link #find find} method scans the input sequence looking for
149 * Reflects whether a match has been found during the most recent find
201 * find matches with.
453 * Attempts to find the next subsequence of the input sequence that matches
467 public boolean find() { method in class:Matcher
475 * Resets this matcher and then attempts to find the next subsequence of
481 * invocations of the {@link #find()} method will start at the first
492 public boolean find(int start) { method in class:Matcher
597 * {@link #appendTail appendTail} and {@link #find fin
[all...]
/libcore/ojluni/src/main/java/sun/net/ftp/
H A DFtpReplyCode.java240 public static FtpReplyCode find(int v) { method in class:FtpReplyCode
/libcore/ojluni/src/main/java/java/nio/file/
H A DFiles.java742 // find a decendent that exists
754 // unable to find existing parent
3681 public static Stream<Path> find(Path start, method in class:Files
/libcore/ojluni/src/main/java/java/util/
H A DHashMap.java1854 final TreeNode<K,V> find(int h, Object k, Class<?> kc) { method in class:HashMap.TreeNode
1873 else if ((q = pr.find(h, k, kc)) != null)
1882 * Calls find for root node.
1885 return ((parent != null) ? root() : this).find(h, k, null);
1991 (q = ch.find(h, k, kc)) != null) ||
1993 (q = ch.find(h, k, kc)) != null))
2053 while ((sl = s.left) != null) // find successor
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java660 Node<K,V> find(int h, Object k) { method in class:ConcurrentHashMap.Node
952 return (p = e.find(h, key)) != null ? p.val : null;
2238 Node<K,V> find(int h, Object k) { method in class:ConcurrentHashMap.ForwardingNode
2256 return e.find(h, k);
2273 Node<K,V> find(int h, Object k) { method in class:ConcurrentHashMap.ReservationNode
2731 Node<K,V> find(int h, Object k) { method in class:ConcurrentHashMap.TreeNode
2896 final Node<K,V> find(int h, Object k) { method in class:ConcurrentHashMap.TreeBin
3020 while ((sl = s.left) != null) // find successor

Completed in 255 milliseconds