Searched defs:Entry (Results 26 - 50 of 59) sorted by relevance

123

/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/util/
H A DCharArrayIntMap.java39 static class Entry extends BaseEntry { class in class:CharArrayIntMap
43 Entry _next;
45 public Entry(char[] ch, int start, int length, int hash, int value, Entry next) { method in class:CharArrayIntMap.Entry
70 private Entry[] _table;
75 _table = new Entry[_capacity];
147 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
178 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
188 Entry e = _table[bucketIndex];
189 _table[bucketIndex] = new Entry(c
[all...]
H A DStringIntMap.java33 protected static final Entry NULL_ENTRY = new Entry(null, 0, -1, null);
37 protected static class Entry extends BaseEntry { class in class:StringIntMap
39 Entry _next;
41 public Entry(String key, int hash, int value, Entry next) { method in class:StringIntMap.Entry
48 protected Entry _lastEntry = NULL_ENTRY;
50 protected Entry[] _table;
60 _table = new Entry[_capacity];
124 for (Entry
[all...]
H A DLocalNameQualifiedNamesMap.java39 public static class Entry { class in class:LocalNameQualifiedNamesMap
44 Entry _next;
46 public Entry(String key, int hash, Entry next) { method in class:LocalNameQualifiedNamesMap.Entry
65 private Entry[] _table;
70 _table = new Entry[_capacity];
129 public final Entry obtainEntry(String key) {
133 final Entry entry = _readOnlyMap.getEntry(key, hash);
140 for (Entry e = _table[tableIndex]; e != null; e = e._next) {
149 public final Entry obtainDynamicEntr
[all...]
/openjdk7/jdk/test/java/util/zip/ZipFile/
H A DAssortment.java57 private static class Entry { class in class:Assortment
64 Entry(String name, method in class:Assortment.Entry
181 List<Entry> entries = new ArrayList<Entry>();
184 entries.add(new Entry("meta-iNf/ManIfEst.Mf",
191 entries.add(new Entry("", ZipEntry.STORED, null, null, ""));
198 entries.add(new Entry(uniquify(name), method, data,
207 for (Entry e : entries)
218 for (Entry e : entries)
232 for (Entry
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/jaxp/validation/
H A DSoftReferenceGrammarPool.java58 protected Entry [] fGrammars = null;
75 fGrammars = new Entry[TABLE_SIZE];
81 fGrammars = new Entry[initialCapacity];
164 for (Entry entry = fGrammars[index]; entry != null; entry = entry.next) {
173 Entry entry = new Entry(hash, index, desc, grammar, fGrammars[index], fReferenceQueue);
192 for (Entry entry = fGrammars[index]; entry != null; entry = entry.next) {
220 for (Entry entry = fGrammars[index]; entry != null; entry = entry.next) {
242 for (Entry entry = fGrammars[index]; entry != null ; entry = entry.next) {
353 private Grammar removeEntry(Entry entr
386 static final class Entry { class in class:SoftReferenceGrammarPool
395 protected Entry(int hash, int bucket, XMLGrammarDescription desc, Grammar grammar, Entry next, ReferenceQueue queue) { method in class:SoftReferenceGrammarPool.Entry
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/
H A DRowFilter.java48 * view. The <code>Entry</code> argument can be used to obtain the values in
54 * public boolean include(Entry&lt;? extends Object, ? extends Object&gt; entry) {
74 * public boolean include(Entry&lt;? extends PersonModel, ? extends Integer&gt; entry) {
306 public abstract boolean include(Entry<? extends M, ? extends I> entry);
317 * An <code>Entry</code> object is passed to instances of
320 * An <code>Entry</code> object contains information about the model
330 public static abstract class Entry<M, I> { class in class:RowFilter
332 * Creates an <code>Entry</code>.
334 public Entry() { method in class:RowFilter.Entry
407 public boolean include(Entry<
[all...]
/openjdk7/jdk/src/share/classes/sun/awt/util/
H A DIdentityLinkedList.java93 private transient Entry<E> header = new Entry<E>(null, null, null);
230 for (Entry<E> e = header.next; e != header; e = e.next) {
280 Entry<E> successor = (index==size ? header : entry(index));
281 Entry<E> predecessor = successor.previous;
283 Entry<E> e = new Entry<E>((E)a[i], successor, predecessor);
297 Entry<E> e = header.next;
299 Entry<E> next = e.next;
333 Entry<
747 private static class Entry<E> { class in class:IdentityLinkedList
752 Entry(E element, Entry<E> next, Entry<E> previous) { method in class:IdentityLinkedList.Entry
[all...]
/openjdk7/jdk/src/share/classes/java/lang/
H A DThreadLocal.java146 ThreadLocalMap.Entry e = map.getEntry(this);
271 static class Entry extends WeakReference<ThreadLocal> { class in class:ThreadLocal.ThreadLocalMap
275 Entry(ThreadLocal k, Object v) { method in class:ThreadLocal.ThreadLocalMap.Entry
290 private Entry[] table;
329 table = new Entry[INITIAL_CAPACITY];
331 table[i] = new Entry(firstKey, firstValue);
343 Entry[] parentTable = parentMap.table;
346 table = new Entry[len];
349 Entry e = parentTable[j];
354 Entry
[all...]
H A DClassValue.java101 Entry<?>[] cache;
102 Entry<T> e = probeHomeLocation(cache = getCacheCarefully(type), this);
104 // invariant: e is null or an Entry with readable Entry.version and Entry.value
187 private static Entry<?>[] getCacheCarefully(Class<?> type) {
188 // racing type.classValueMap{.cacheArray} : null => new Entry[X] <=> new Entry[Y]
191 Entry<?>[] cache = map.getCache();
193 // invariant: returned value is safe to dereference and check for an Entry
323 static class Entry<T> extends WeakReference<Version<T>> { class in class:ClassValue
325 Entry(Version<T> version, T value) { method in class:ClassValue.Entry
331 Entry(Version<T> version) { method in class:ClassValue.Entry
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DEnumMap.java28 import java.util.Map.Entry;
370 private transient Set<Map.Entry<K,V>> entrySet = null;
463 public Set<Map.Entry<K,V>> entrySet() {
464 Set<Map.Entry<K,V>> es = entrySet;
471 private class EntrySet extends AbstractSet<Map.Entry<K,V>> {
472 public Iterator<Map.Entry<K,V>> iterator() {
477 if (!(o instanceof Map.Entry))
479 Map.Entry entry = (Map.Entry)o;
483 if (!(o instanceof Map.Entry))
582 private class Entry implements Map.Entry<K,V> { class in class:EnumMap.EntryIterator
585 private Entry(int index) { method in class:EnumMap.EntryIterator.Entry
[all...]
H A DLinkedHashMap.java70 * <p>The {@link #removeEldestEntry(Map.Entry)} method may be overridden to
157 private transient Entry<K,V> header;
241 header = new Entry<>(-1, null, null, null);
251 void transfer(HashMap.Entry[] newTable, boolean rehash) {
253 for (Entry<K,V> e = header.after; e != header; e = e.after) {
274 for (Entry e = header.after; e != header; e = e.after)
278 for (Entry e = header.after; e != header; e = e.after)
301 Entry<K,V> e = (Entry<K,V>)getEntry(key);
320 private static class Entry< class in class:LinkedHashMap
324 Entry(int hash, K key, V value, HashMap.Entry<K,V> next) { method in class:LinkedHashMap.Entry
[all...]
H A DHashtable.java132 private transient Entry<K,V>[] table;
261 table = new Entry[initialCapacity];
368 Entry tab[] = table;
370 for (Entry<K,V> e = tab[i] ; e != null ; e = e.next) {
406 Entry tab[] = table;
409 for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
433 Entry tab[] = table;
436 for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
461 Entry<K,V>[] oldMap = table;
471 Entry<
1038 private static class Entry<K,V> implements Map.Entry<K,V> { class in class:Hashtable
1044 protected Entry(int hash, K key, V value, Entry<K,V> next) { method in class:Hashtable.Entry
[all...]
H A DIdentityHashMap.java503 for (Entry<? extends K, ? extends V> e : m.entrySet())
669 * <tt>Map.Entry</tt> instances in the set returned by this map's
833 extends IdentityHashMapIterator<Map.Entry<K,V>>
835 private Entry lastReturnedEntry = null;
837 public Map.Entry<K,V> next() {
838 lastReturnedEntry = new Entry(nextIndex());
850 private class Entry implements Map.Entry<K,V> { class in class:IdentityHashMap.EntryIterator
853 private Entry(int index) { method in class:IdentityHashMap.EntryIterator.Entry
881 if (!(o instanceof Map.Entry))
[all...]
H A DHashMap.java149 static final Entry<?,?>[] EMPTY_TABLE = {};
154 transient Entry<K,V>[] table = (Entry<K,V>[]) EMPTY_TABLE;
320 table = new Entry[capacity];
421 Entry<K,V> entry = getEntry(key);
437 for (Entry<K,V> e = table[0]; e != null; e = e.next) {
461 final Entry<K,V> getEntry(Object key) {
467 for (Entry<K,V> e = table[indexFor(hash, table.length)];
498 for (Entry<K,V> e = table[i]; e != null; e = e.next) {
517 for (Entry<
805 static class Entry<K,V> implements Map.Entry<K,V> { class in class:HashMap
814 Entry(int h, K k, V v, Entry<K,V> n) { method in class:HashMap.Entry
[all...]
H A DWeakHashMap.java155 Entry<K,V>[] table;
249 private Entry<K,V>[] newTable(int n) {
250 return (Entry<K,V>[]) new Entry[n];
389 Entry<K,V> e = (Entry<K,V>) x;
392 Entry<K,V> prev = table[i];
393 Entry<K,V> p = prev;
395 Entry<K,V> next = p.next;
417 private Entry<
777 private static class Entry<K,V> extends WeakReference<Object> implements Map.Entry<K,V> { class in class:WeakHashMap
785 Entry(Object key, V value, method in class:WeakHashMap.Entry
[all...]
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/
H A DLinkedHashMap.java100 private transient Entry table[];
105 private transient Entry header;
151 table = new Entry[initialCapacity];
153 header = new Entry(-1, null, null, null);
208 for (Entry e = header.after; e != header; e = e.after)
212 for (Entry e = header.after; e != header; e = e.after)
226 Entry tab[] = table;
230 for (Entry e = tab[index]; e != null; e = e.next)
234 for (Entry e = tab[0]; e != null; e = e.next)
253 Entry
737 private static class Entry implements Map.Entry { class in class:LinkedHashMap
747 Entry(int hash, Object key, Object value, Entry next) { method in class:LinkedHashMap.Entry
[all...]
/openjdk7/jdk/make/tools/src/build/tools/charsetmapping/
H A DUtils.java44 public static class Entry { class in class:Utils
49 public Entry () {} method in class:Utils.Entry
50 public Entry (int bytes, int cp, int cp2) { method in class:Utils.Entry
91 protected Entry parse(Matcher matcher, Entry mapping) {
102 public Entry next() throws Exception {
103 return next(new Entry());
107 public Entry next(Entry mapping) throws Exception {
/openjdk7/hotspot/test/compiler/6865031/
H A DTest.java165 protected Entry<V>[] table;
176 table = new Entry[DEFAULT_INITIAL_CAPACITY];
204 Entry e = (Entry) r;
209 Entry<V> prev = table[i];
210 Entry<V> p = prev;
213 Entry<V> next = p.next;
237 private Entry<V>[] getTable()
286 Entry<V>[] tab = getTable();
288 Entry<
501 protected static class Entry<V> class in class:WeakPool
510 Entry(final V key, final ReferenceQueue<V> queue, final int hash, final Entry<V> next) method in class:WeakPool.Entry
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/util/
H A DQNameMap.java64 transient Entry<V>[] table = new Entry[DEFAULT_INITIAL_CAPACITY];
88 private Set<Entry<V>> entrySet = null;
92 table = new Entry[DEFAULT_INITIAL_CAPACITY];
117 for (Entry<V> e = table[i]; e != null; e = e.next) {
147 Entry<V> e = getEntry(nsUri,localPart);
190 for( Entry<? extends V> e : map.entrySet() )
224 Entry<V> e = table[bucketIndex];
225 table[bucketIndex] = new Entry<V>(hash, nsUri, localName, value, e);
237 Entry[] oldTabl
346 public static final class Entry<V> { class in class:QNameMap
360 Entry(int h, String nsUri, String localName, V v, Entry<V> n) { method in class:QNameMap.Entry
[all...]
/openjdk7/jdk/src/share/classes/sun/misc/
H A DSoftCache.java351 private class Entry implements Map.Entry { class in class:SoftCache
352 private Map.Entry ent;
354 from flushing the value while this Entry
357 Entry(Map.Entry ent, Object value) { method in class:SoftCache.Entry
375 if (! (o instanceof Map.Entry)) return false;
376 Map.Entry e = (Map.Entry)o;
398 Entry nex
[all...]
/openjdk7/jdk/src/share/classes/java/security/
H A DKeyStore.java42 * Each type of entry implements the <code>KeyStore.Entry</code> interface.
43 * Three basic <code>KeyStore.Entry</code> implementations are provided:
351 public static interface Entry { } interface in class:KeyStore
359 public static final class PrivateKeyEntry implements Entry {
486 public static final class SecretKeyEntry implements Entry {
530 public static final class TrustedCertificateEntry implements Entry {
1253 * Gets a keystore <code>Entry</code> for the specified alias
1256 * @param alias get the keystore <code>Entry</code> for this alias
1258 * used to protect the <code>Entry</code>,
1261 * @return the keystore <code>Entry</cod
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/util/
H A DQNameMap.java64 transient Entry<V>[] table = new Entry[DEFAULT_INITIAL_CAPACITY];
88 private Set<Entry<V>> entrySet = null;
92 table = new Entry[DEFAULT_INITIAL_CAPACITY];
114 for (Entry<V> e = table[i]; e != null; e = e.next) {
140 Entry<V> e = getEntry(nsUri,localPart);
183 for( Entry<? extends V> e : map.entrySet() )
189 for (Map.Entry<QName, ? extends V> e : map.entrySet()) {
225 Entry<V> e = table[bucketIndex];
226 table[bucketIndex] = new Entry<
364 public static final class Entry<V> { class in class:QNameMap
378 Entry(int h, String nsUri, String localName, V v, Entry<V> n) { method in class:QNameMap.Entry
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/code/
H A DScope.java59 Entry[] table;
68 public Entry elems;
82 private static final Entry sentinel = new Entry(null, null, null, null);
90 public static final Scope emptyScope = new Scope(null, null, new Entry[]{});
95 private Scope(Scope next, Symbol owner, Entry[] table) {
104 private Scope(Scope next, Symbol owner, Entry[] table, int nelems) {
113 this(null, owner, new Entry[INITIAL_SIZE]);
154 Entry e = table[hash];
171 Entry[] oldtabl
455 public static class Entry { class in class:Scope
477 public Entry(Symbol sym, Entry shadowed, Entry sibling, Scope scope) { method in class:Scope.Entry
[all...]
/openjdk7/jdk/src/share/classes/sun/nio/cs/
H A DCharsetMapping.java59 Entry[] b2cComp;
60 Entry[] c2bComp;
94 public char[] decodeComposite(Entry comp, char[] cc) {
122 public boolean isCompositeBase(Entry comp) {
129 public int encodeComposite(Entry comp) {
145 public static class Entry { class in class:CharsetMapping
151 static Comparator<Entry> comparatorBytes =
152 new Comparator<Entry>() {
153 public int compare(Entry m1, Entry m
[all...]
/openjdk7/langtools/test/tools/javac/tree/
H A DTreePosTest.java547 Entry e = new Entry(file, check, encl, self);
568 showEntry((Entry) entries.getSelectedItem());
611 private void showEntry(Entry e) {
747 private class Entry { class in class:TreePosTest.Viewer
748 Entry(JavaFileObject file, String check, Info encl, Info self) { method in class:TreePosTest.Viewer.Entry

Completed in 702 milliseconds

123