diff --git a/pom.xml b/pom.xml
index 12c3c243a..7f9b04132 100644
--- a/pom.xml
+++ b/pom.xml
@@ -407,6 +407,7 @@
 				<version>3.0.0</version>
 				<configuration>
 					<failOnError>true</failOnError>
+					<excludePackageNames>mssql.googlecode.*</excludePackageNames>
 				</configuration>
 				<executions>
 					<execution>
diff --git a/src/main/java/mssql/googlecode/concurrentlinkedhashmap/Linked.java b/src/main/java/mssql/googlecode/concurrentlinkedhashmap/Linked.java
new file mode 100644
index 000000000..21fbc533f
--- /dev/null
+++ b/src/main/java/mssql/googlecode/concurrentlinkedhashmap/Linked.java
@@ -0,0 +1,27 @@
+package mssql.googlecode.concurrentlinkedhashmap;
+
+import java.util.Deque;
+
+/**
+ * An element that is linked on the {@link Deque}.
+ */
+interface Linked<T extends Linked<T>> {
+
+  /**
+   * Retrieves the previous element or <tt>null</tt> if either the element is
+   * unlinked or the first element on the deque.
+   */
+  T getPrevious();
+
+  /** Sets the previous element or <tt>null</tt> if there is no link. */
+  void setPrevious(T prev);
+
+  /**
+   * Retrieves the next element or <tt>null</tt> if either the element is
+   * unlinked or the last element on the deque.
+   */
+  T getNext();
+
+  /** Sets the next element or <tt>null</tt> if there is no link. */
+  void setNext(T next);
+}
diff --git a/src/main/java/mssql/googlecode/concurrentlinkedhashmap/LinkedDeque.java b/src/main/java/mssql/googlecode/concurrentlinkedhashmap/LinkedDeque.java
index 2bb23ea78..ffa048c9f 100644
--- a/src/main/java/mssql/googlecode/concurrentlinkedhashmap/LinkedDeque.java
+++ b/src/main/java/mssql/googlecode/concurrentlinkedhashmap/LinkedDeque.java
@@ -434,27 +434,3 @@ public void remove() {
     abstract E computeNext();
   }
 }
-
-/**
- * An element that is linked on the {@link Deque}.
- */
-interface Linked<T extends Linked<T>> {
-
-  /**
-   * Retrieves the previous element or <tt>null</tt> if either the element is
-   * unlinked or the first element on the deque.
-   */
-  T getPrevious();
-
-  /** Sets the previous element or <tt>null</tt> if there is no link. */
-  void setPrevious(T prev);
-
-  /**
-   * Retrieves the next element or <tt>null</tt> if either the element is
-   * unlinked or the last element on the deque.
-   */
-  T getNext();
-
-  /** Sets the next element or <tt>null</tt> if there is no link. */
-  void setNext(T next);
-}