1 files changed, 132 insertions, 0 deletions
diff --git a/framework/src/ant/apache-ant-1.9.6/src/main/org/apache/tools/ant/util/LinkedHashtable.java b/framework/src/ant/apache-ant-1.9.6/src/main/org/apache/tools/ant/util/LinkedHashtable.java
new file mode 100644
index 00000000..73fc83c6
--- /dev/null
+++ b/framework/src/ant/apache-ant-1.9.6/src/main/org/apache/tools/ant/util/LinkedHashtable.java
@@ -0,0 +1,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();
+    }
+}