rem dead code

Author: Alex Peck

BitFaster.Caching/Lfu/LfuNode.cs

@@ -18,13 +18,6 @@ public LfuNode(K k, V v)
             this.Value = v;
         }
 
-        public LfuNode(LfuNodeList<K, V> list, K k, V v)
-        {
-            this.list = list;
-            this.Key = k;
-            this.Value = v;
-        }
-
         public readonly K Key;
 
         public V Value { get; set; }

BitFaster.Caching/Lfu/LfuNodeList.cs

@@ -26,11 +26,6 @@ public LfuNode<K, V> First
             get { return head; }
         }
 
-        public LfuNode<K, V> Last
-        {
-            get { return head?.prev; }
-        }
-
         public void MoveToEnd(LfuNode<K, V> node)
         {
             this.Remove(node);
@@ -71,21 +66,6 @@ public void RemoveFirst()
             InternalRemoveNode(head);
         }
 
-        public void Clear()
-        {
-            LfuNode<K, V> current = head;
-
-            while (current != null)
-            {
-                LfuNode<K, V> temp = current;
-                current = current.Next;
-                temp.Invalidate();
-            }
-
-            head = null;
-            count = 0;
-        }
-
         private void InternalInsertNodeToEmptyList(LfuNode<K, V> newNode)
         {
             newNode.next = newNode;