1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
package org.apache.tools.ant.util;
import java.util.Collection;
import java.util.Enumeration;
import java.util.Hashtable;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
/**
* Subclass of Hashtable that wraps a LinkedHashMap to provide
* predictable iteration order.
*
* <p>This is not a general purpose class but has been written because
* the protected members of {@link org.apache.tools.ant.taskdefs.Copy
* Copy} prohibited later revisions from using a more predictable
* collection.</p>
*
* <p>Methods are synchronized to keep Hashtable's contract.</p>
*
* @since Ant 1.8.2
*/
public class LinkedHashtable<K, V> extends Hashtable<K, V> {
private static final long serialVersionUID = 1L;
private final LinkedHashMap<K, V> map;
public LinkedHashtable() {
map = new LinkedHashMap<K, V>();
}
public LinkedHashtable(int initialCapacity) {
map = new LinkedHashMap<K, V>(initialCapacity);
}
public LinkedHashtable(int initialCapacity, float loadFactor) {
map = new LinkedHashMap<K, V>(initialCapacity, loadFactor);
}
public LinkedHashtable(Map<K, V> m) {
map = new LinkedHashMap<K, V>(m);
}
public synchronized void clear() {
map.clear();
}
public boolean contains(Object value) {
return containsKey(value);
}
public synchronized boolean containsKey(Object value) {
return map.containsKey(value);
}
public synchronized boolean containsValue(Object value) {
return map.containsValue(value);
}
public Enumeration<V> elements() {
return CollectionUtils.asEnumeration(values().iterator());
}
public synchronized Set<Map.Entry<K, V>> entrySet() {
return map.entrySet();
}
public synchronized boolean equals(Object o) {
return map.equals(o);
}
public synchronized V get(Object k) {
return map.get(k);
}
public synchronized int hashCode() {
return map.hashCode();
}
public synchronized boolean isEmpty() {
return map.isEmpty();
}
public Enumeration<K> keys() {
return CollectionUtils.asEnumeration(keySet().iterator());
}
public synchronized Set<K> keySet() {
return map.keySet();
}
public synchronized V put(K k, V v) {
return map.put(k, v);
}
public synchronized void putAll(Map<? extends K, ? extends V> m) {
map.putAll(m);
}
public synchronized V remove(Object k) {
return map.remove(k);
}
public synchronized int size() {
return map.size();
}
public synchronized String toString() {
return map.toString();
}
public synchronized Collection<V> values() {
return map.values();
}
}
|
