1.9.3: can now clone large LinkedHashMap

pom.xml

@@ -9,7 +9,7 @@
 	<groupId>uk.com.robust-it</groupId>
 	<artifactId>cloning</artifactId>
 	<packaging>bundle</packaging>
-	<version>1.9.2</version>
+	<version>1.9.3</version>
 	<name>cloning</name>
 	<url>https://code.google.com/p/cloning/</url>
 	<description><![CDATA[

src/main/java/com/rits/cloning/Cloner.java

@@ -94,6 +94,7 @@ protected void registerFastCloners() {
 		fastCloners.put(HashSet.class, new FastClonerHashSet());
 		fastCloners.put(HashMap.class, new FastClonerHashMap());
 		fastCloners.put(TreeMap.class, new FastClonerTreeMap());
+		fastCloners.put(LinkedHashMap.class, new FastClonerLinkedHashMap());
 		fastCloners.put(ConcurrentHashMap.class, new FastClonerConcurrentHashMap());
 	}
 

src/main/java/com/rits/cloning/FastClonerLinkedHashMap.java

@@ -0,0 +1,24 @@
+package com.rits.cloning;
+
+import java.util.LinkedHashMap;
+import java.util.Map;
+
+/**
+ * @author kostantinos.kougios
+ *
+ * 21 May 2009
+ */
+public class FastClonerLinkedHashMap implements IFastCloner {
+	@SuppressWarnings({"unchecked", "rawtypes"})
+	public Object clone(final Object t, final IDeepCloner cloner, final Map<Object, Object> clones) {
+		final LinkedHashMap<?, ?> al = (LinkedHashMap) t;
+		final LinkedHashMap result = new LinkedHashMap();
+		for (final Map.Entry e : al.entrySet()) {
+			final Object key = cloner.deepClone(e.getKey(), clones);
+			final Object value = cloner.deepClone(e.getValue(), clones);
+
+			result.put(key, value);
+		}
+		return result;
+	}
+}

src/test/java/com/rits/tests/cloning/TestCloner.java

@@ -776,4 +776,32 @@ public void testUnregisterFastCloner() {
         cloner.unregisterFastCloner(HashMap.class);
         cloner.registerFastCloner(HashMap.class, new FastClonerHashMap());
     }
+
+	public void testEmptyLinkedHashMap() {
+		LinkedHashMap<Integer, Integer> m = new LinkedHashMap<Integer, Integer>();
+		LinkedHashMap<Integer, Integer> cloned = cloner.deepClone(m);
+		assertEquals(m, cloned);
+	}
+
+	public void testLinkedHashMap() {
+		LinkedHashMap<Integer, Integer> m = new LinkedHashMap<Integer, Integer>();
+		for (int i = 1; i < 10000; i++) {
+			m.put(i, i * 2);
+		}
+		LinkedHashMap<Integer, Integer> cloned = cloner.deepClone(m);
+		assertEquals(m, cloned);
+	}
+
+	public void testLinkedHashMapIterationOrder() {
+		LinkedHashMap<Integer, Integer> m = new LinkedHashMap<Integer, Integer>();
+		for (int i = 1000; i >= 1; i--) {
+			m.put(i, i * 2);
+		}
+		LinkedHashMap<Integer, Integer> cloned = cloner.deepClone(m);
+		Iterator<Integer> it = cloned.keySet().iterator();
+		for (int i = 1000; i >= 1; i--) {
+			assertEquals((Integer) i, it.next());
+		}
+	}
+
 }