Drop unused files and code.

1 files changed, 0 insertions, 75 deletions

diff --git a/minidinstall/OrderedDict.py b/minidinstall/OrderedDict.py
deleted file mode 100644
index dab57db..0000000
--- a/minidinstall/OrderedDict.py
+++ /dev/null
@@ -1,75 +0,0 @@
-# OrderedDict -*- mode: python; coding: utf-8 -*-
-#
-# This class functions almost exactly like UserDict.  However, when using
-# the sequence methods, it returns items in the same order in which they
-# were added, instead of some random order.
-#
-# Copyright (c) 2001 Adam Heath <doogie@debian.org>
-#
-# This file is free software; you can redistribute it and/or modify it
-# under the terms of the GNU General Public License as published by
-# the Free Software Foundation; either version 2 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful, but
-# WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-# General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program; if not, write to the Free Software
-# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-
-from collections import UserDict
-
-class OrderedDict(UserDict):
-    __order=[]
-
-    def __init__(self, dict=None):
-        UserDict.__init__(self)
-        self.__order=[]
-        if dict and dict.__class__:
-            self.update(dict)
-
-    def __cmp__(self, dict):
-        if isinstance(dict, OrderedDict):
-            ret=cmp(self.__order, dict.__order)
-            if not ret:
-                ret=UserDict.__cmp__(self, dict)
-            return ret
-        else:
-            return UserDict.__cmp__(self, dict)
-
-    def __setitem__(self, key, value):
-        if key not in self:
-            self.__order.append(key)
-        UserDict.__setitem__(self, key, value)
-
-    def __delitem__(self, key):
-        if key in self:
-            del self.__order[self.__order.index(key)]
-        UserDict.__delitem__(self, key)
-
-    def clear(self):
-        self.__order=[]
-        UserDict.clear(self)
-
-    def copy(self):
-        if self.__class__ is OrderedDict:
-            return OrderedDict(self)
-        return self.copy()
-
-    def keys(self):
-        return self.__order
-
-    def items(self):
-        return list(map(lambda x, self=self: (x, self.__getitem__(x)), self.__order))
-
-    def values(self):
-        return list(map(lambda x, self=self: self.__getitem__(x), self.__order))
-
-    def update(self, dict):
-        for (k, v) in list(dict.items()):
-            self.__setitem__(k, v)
-
-# vim:ts=4:sw=4:et: