/openjdk7/jdk/src/share/classes/sun/management/ |
H A D | LazyCompositeData.java | 67 public Object[] getAll(String[] keys) { argument 68 return compositeData().getAll(keys);
|
/openjdk7/jdk/src/share/classes/sun/net/www/ |
H A D | HeaderParser.java | 43 * keys are converted to lower case, vals are left as is.... 67 * create a new HeaderParser from this, whose keys (and corresponding values) 213 public Iterator keys () { method in class:HeaderParser 222 Iterator k = keys();
|
H A D | MessageHeader.java | 51 private String keys[]; field in class:MessageHeader 67 keys = null; 82 if (keys[i] == null) 86 if (k.equalsIgnoreCase(keys[i])) 95 if ((keys[i] == k) || 96 (k != null && k.equalsIgnoreCase(keys[i]))) 103 return keys[n]; 126 if (keys[i] == null) 133 if (k.equalsIgnoreCase(keys[i])) 149 if (k.equalsIgnoreCase(keys[ [all...] |
/openjdk7/langtools/test/tools/javac/diags/ |
H A D | ArgTypeCompilerFactory.java | 73 * scanned for resource keys. Not all diagnostic keys are generated 94 boolean run(PrintWriter out, Set<String> keys, boolean raw, List<String> opts, List<File> files) { argument 95 assert out != null && keys == null; 127 boolean run(PrintWriter out, Set<String> keys, boolean raw, List<String> opts, List<File> files) { argument 128 assert out != null && keys == null; 161 boolean run(PrintWriter out, Set<String> keys, boolean raw, List<String> opts, List<File> files) { argument 162 assert out != null && keys == null;
|
H A D | Example.java | 54 * for information about the test, such as what resource keys it 136 * Get the set of resource keys that this test declares it will generate 144 * Get the set of resource keys that this test generates when it is run. 168 Set<String> keys = new TreeSet<String>(); 170 run(null, keys, true, verbose); 174 return keys; 181 private void run(PrintWriter out, Set<String> keys, boolean raw, boolean verbose) argument 220 c.run(out, keys, raw, opts, srcFiles); 336 abstract boolean run(PrintWriter out, Set<String> keys, boolean raw, argument 349 * scanned for resource keys 370 run(PrintWriter out, Set<String> keys, boolean raw, List<String> opts, List<File> files) argument 412 scanForKeys(JCDiagnostic d, Set<String> keys) argument 441 run(PrintWriter out, Set<String> keys, boolean raw, List<String> opts, List<File> files) argument 475 scanForKeys(String text, Set<String> keys) argument 491 run(PrintWriter out, Set<String> keys, boolean raw, List<String> opts, List<File> files) argument 534 preRegister(Context c, final Set<String> keys) argument [all...] |
/openjdk7/jdk/src/share/classes/javax/sql/rowset/ |
H A D | CachedRowSet.java | 1284 * object, the keys defined by this method and the resulting constraints are 1288 * @param keys an array of <code>int</code> indicating the columns that form 1299 public void setKeyColumns(int[] keys) throws SQLException; argument
|
/openjdk7/jdk/src/share/classes/javax/swing/ |
H A D | LookAndFeel.java | 348 * Creates a {@code InputMapUIResource} from <code>keys</code>. This is 350 * invoking {@code loadKeyBindings(map, keys)}, and returning the 353 * @param keys alternating pairs of {@code keystroke-action key} 360 public static InputMap makeInputMap(Object[] keys) { argument 362 loadKeyBindings(retMap, keys); 368 * <code>keys</code>. This is a convenience method for creating a 370 * loadKeyBindings(map, keys)}, and returning the {@code 375 * @param keys alternating pairs of {@code keystroke-action key} 386 Object[] keys) { 388 loadKeyBindings(retMap, keys); 385 makeComponentInputMap(JComponent c, Object[] keys) argument 431 loadKeyBindings(InputMap retMap, Object[] keys) argument [all...] |
H A D | DefaultRowSorter.java | 160 * The sort keys. 176 * Maximum number of sort keys. 249 * unsortable by directly setting the sort keys. The default is 286 * Sets the sort keys. This creates a copy of the supplied 289 * If the sort keys have changed this triggers a sort. 327 * Returns the current sort keys. This returns an unmodifiable 328 * {@code non-null List}. If you need to change the sort keys, 339 * Sets the maximum number of sort keys. The number of sort keys 352 * 2. Because the maximum number of sort keys ha 696 cacheSortKeys(List<? extends SortKey> keys) argument [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/text/ |
H A D | TextLayoutStrategy.java | 501 Object[] ka = keys.toArray(); 533 * Returns the keys of all attributes defined on the 538 return keys; 543 static Set<Attribute> keys; field in class:TextLayoutStrategy.AttributedSegment 546 keys = new HashSet<Attribute>(); 547 keys.add(TextAttribute.FONT); 548 keys.add(TextAttribute.RUN_DIRECTION); 549 keys.add(TextAttribute.NUMERIC_SHAPING);
|
/openjdk7/jdk/src/share/classes/java/util/prefs/ |
H A D | Preferences.java | 874 * Returns all of the keys that have an associated value in this 883 * @return an array of the keys that have an associated value in this 891 public abstract String[] keys() throws BackingStoreException; method in class:Preferences
|
H A D | AbstractPreferences.java | 324 * invokes {@link #keys()} to obtain an array of keys, and 335 String[] keys = keys(); 336 for (int i=0; i<keys.length; i++) 337 remove(keys[i]); 667 * Implements the <tt>keys</tt> method as per the specification in 668 * {@link Preferences#keys()}. 673 * @return an array of the keys that have an associated value in this 681 public String[] keys() throw method in class:AbstractPreferences [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jmx/mbeanserver/ |
H A D | Repository.java | 112 private final String[] keys; field in class:Repository.ObjectNamePattern 153 this.keys = new String[len]; 157 keys[i] = entry.getKey(); 179 (name.getKeyPropertyList().size() != keys.length)) 186 for (int i = keys.length - 1; i >= 0 ; i--) { 190 String v = name.getKeyProperty(keys[i]); 197 pattern.isPropertyValuePattern(keys[i])) {
|
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/c14n/implementations/ |
H A D | NameSpaceSymbTable.java | 323 String[] keys; field in class:SymbMap 326 keys=new String[free]; 330 Object oldKey = keys[index]; 331 keys[index] = key; 353 Object[] set = keys; 376 int oldCapacity = keys.length; 377 String oldKeys[] = keys; 380 keys = new String[newCapacity]; 387 keys[index] = o; 402 copy.keys [all...] |
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/keys/content/ |
H A D | X509Data.java | 21 package com.sun.org.apache.xml.internal.security.keys.content; 29 import com.sun.org.apache.xml.internal.security.keys.content.x509.XMLX509CRL; 30 import com.sun.org.apache.xml.internal.security.keys.content.x509.XMLX509Certificate; 31 import com.sun.org.apache.xml.internal.security.keys.content.x509.XMLX509IssuerSerial; 32 import com.sun.org.apache.xml.internal.security.keys.content.x509.XMLX509SKI; 33 import com.sun.org.apache.xml.internal.security.keys.content.x509.XMLX509SubjectName;
|
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/keys/keyresolver/ |
H A D | KeyResolver.java | 23 package com.sun.org.apache.xml.internal.security.keys.keyresolver; 34 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.DSAKeyValueResolver; 35 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.RSAKeyValueResolver; 36 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.RetrievalMethodResolver; 37 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.X509CertificateResolver; 38 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.X509IssuerSerialResolver; 39 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.X509SKIResolver; 40 import com.sun.org.apache.xml.internal.security.keys.keyresolver.implementations.X509SubjectNameResolver; 41 import com.sun.org.apache.xml.internal.security.keys.storage.StorageResolver; 163 * available to <I>all</I> {@link com.sun.org.apache.xml.internal.security.keys [all...] |
/openjdk7/hotspot/test/compiler/6865031/ |
H A D | Test.java | 358 * number of keys in this map reaches its threshold. 547 private List<MyList> keys; field in class:MultiSynonymKey 550 keys = new ArrayList<MyList>(); 554 keys = Arrays.asList(arg); 558 return keys;
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/ |
H A D | MethodVisitor.java | 340 * @param keys the values of the keys. 342 * the beginning of the handler block for the <tt>keys[i]</tt> key. 344 void visitLookupSwitchInsn(Label dflt, int[] keys, Label[] labels); argument
|
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/ |
H A D | main.cpp | 220 static const char* keys[] = { local 233 for (int i = 0; keys[i] != null; i++) { 234 const char* key = keys[i];
|
/openjdk7/jdk/src/share/classes/sun/security/krb5/ |
H A D | EncryptionKey.java | 59 * were capable of using keys with the same characteristics were 138 * @returns an array of secret keys or null if none were found. 195 * Generate a list of keys using the given principal and password. 343 // check for key parity and weak keys 363 // check for weak keys 521 public static EncryptionKey findKey(int etype, EncryptionKey[] keys) argument 523 return findKey(etype, null, keys); 528 * findKey(type, kvno, keys). Always returns true if either input 547 public static EncryptionKey findKey(int etype, Integer kvno, EncryptionKey[] keys) argument 558 for (int i = 0; i < keys [all...] |
H A D | KrbApReq.java | 130 * @param keys <code>EncrtyptionKey</code>s to decrypt the message; 138 EncryptionKey[] keys, 144 authenticate(keys, initiator); 152 * @param keys <code>EncrtyptionKey</code>s to decrypt the message; 164 authenticate(keys, initiator); 266 private void authenticate(EncryptionKey[] keys, InetAddress initiator) argument 270 EncryptionKey dkey = EncryptionKey.findKey(encPartKeyType, kvno, keys); 137 KrbApReq(byte[] message, EncryptionKey[] keys, InetAddress initiator) argument
|
/openjdk7/jdk/src/share/classes/sun/security/krb5/internal/crypto/ |
H A D | EType.java | 246 * those etypes for which there are corresponding keys. 247 * Used in scenario we have some keys from a keytab with etypes 250 * we have keys. 252 public static int[] getDefaults(String configName, EncryptionKey[] keys) argument 262 if (EncryptionKey.findKey(answer[i], keys) != null) { 269 for (int i = 0; i < keys.length; i++) { 270 keystr.append(toString(keys[i].getEType())); 274 "Do not have keys of types listed in " + configName + 275 " available; only have keys of following type: " +
|
/openjdk7/jdk/test/java/util/Map/ |
H A D | Collisions.java | 161 Object[] keys = (Object[]) keys_desc[1]; 163 testMap(map, desc, keys); 171 private static <T> void testMap(Map<T, T> map, String keys_desc, T[] keys) { argument 174 testInsertion(map, keys_desc, keys); 176 if (keys[0] instanceof HashableInteger) { 177 testIntegerIteration((Map<HashableInteger, HashableInteger>) map, (HashableInteger[]) keys); 179 testStringIteration((Map<String, String>) map, (String[]) keys); 182 testContainsKey(map, keys_desc, keys); 184 testRemove(map, keys_desc, keys); 187 testInsertion(map, keys_desc, keys); 201 testInsertion(Map<T, T> map, String keys_desc, T[] keys) argument 216 testIntegerIteration(Map<HashableInteger, HashableInteger> map, HashableInteger[] keys) argument 246 testStringIteration(Map<String, String> map, String[] keys) argument 281 testContainsKey(Map<T, T> map, String keys_desc, T[] keys) argument 288 testRemove(Map<T, T> map, String keys_desc, T[] keys) argument 301 testKeysIteratorRemove(Map<T, T> map, String keys_desc, T[] keys) argument 316 testValuesIteratorRemove(Map<T, T> map, String keys_desc, T[] keys) argument 331 testEntriesIteratorRemove(Map<T, T> map, String keys_desc, T[] keys) argument [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | Mode.java | 160 * A mapping between key names and keys. 247 public void processPatterns(Hashtable keys) { argument 248 _keys = keys; 290 flattenAlternative(pattern, template, keys); 303 Hashtable keys) { 316 flattenAlternative(alt.getLeft(), template, keys); 317 flattenAlternative(alt.getRight(), template, keys); 563 Enumeration templates = _namedTemplates.keys(); 569 templates = _neededTemplates.keys(); 587 final Enumeration templates = _neededTemplates.keys(); 301 flattenAlternative(Pattern pattern, Template template, Hashtable keys) argument [all...] |
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | Hashtable.java | 30 * This class implements a hash table, which maps keys to values. Any 34 * objects used as keys must implement the <code>hashCode</code> 67 * the numbers as keys: 90 * The Enumerations returned by Hashtable's keys and elements methods are 168 * used for String keys. Alternative hashing reduces the incidence of 169 * collisions due to weak hash code calculation for String keys. 217 * hash code of keys to make hash collisions harder to find. 301 * Returns the number of keys in this hashtable. 303 * @return the number of keys in this hashtable. 310 * Tests if this hashtable maps no keys t 328 public synchronized Enumeration<K> keys() { method in class:Hashtable [all...] |
/openjdk7/jdk/test/java/util/concurrent/ConcurrentHashMap/ |
H A D | MapCheck.java | 322 for (Enumeration en = ht.keys(); en.hasMoreElements(); ) { 346 Enumeration en = ht.keys(); 607 static void shuffle(Object[] keys) { argument 608 int size = keys.length; 611 Object t = keys[i-1]; 612 keys[i-1] = keys[r]; 613 keys[r] = t;
|