Hopiu/linkchecker
1
0
Fork 0
mirror of https://github.com/Hopiu/linkchecker.git synced 2026-05-04 21:04:41 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

added caseless dict classes

Browse source 
git-svn-id: https://linkchecker.svn.sourceforge.net/svnroot/linkchecker/trunk/linkchecker@3128 e7d03fd6-7b0d-0410-9947-9c21f3af8025
This commit is contained in:
calvin 2006-04-24 20:13:29 +00:00
parent bae6c90f43
commit f9a59e616d
1 changed files with 82 additions and 73 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

155
linkcheck/containers.py
View file

@ -25,41 +25,33 @@ class SetList (list):
"""
def append (self, item):
"""
Append only if not already there.
"""
"""Append only if not already there."""
if item not in self:
super(SetList, self).append(item)
def extend (self, itemlist):
"""
Extend while eliminating duplicates by appending item for item.
"""
"""Extend while eliminating duplicates by appending item for item."""
for item in itemlist:
self.append(item)
def insert (self, index, item):
"""
Insert item at given index only if it is not already there.
"""
"""Insert item at given index only if it is not already there."""
if item not in self:
super(SetList, self).insert(index, item)
def __setitem__ (self, index, item):
"""
Set new value, and eliminate a possible duplicate value.
"""
"""Set new value, and eliminate a possible duplicate value."""
# search index i with self[i] == item
delidx = -1
for i in range(len(self)):
if self[i] == item and i != index:
delidx = i
# break here, there can be only one duplicate
# stop here, there can be only one duplicate
break
# insert new value
# set new value
super(SetList, self).__setitem__(index, item)
# remove duplicate
if delidx != -1:
# remove duplicate
del self[delidx]
@ -70,66 +62,48 @@ class ListDict (dict):
"""
def __init__ (self):
"""
Initialize sorted key list.
"""
"""Initialize sorted key list."""
super(ListDict, self).__init__()
# sorted list of keys
self._keys = []
def __setitem__ (self, key, value):
"""
Add key,value to dict, append key to sorted list.
"""
"""Add key,value to dict, append key to sorted list."""
if not self.has_key(key):
self._keys.append(key)
super(ListDict, self).__setitem__(key, value)
def __delitem__ (self, key):
"""
Remove key from dict.
"""
"""Remove key from dict."""
self._keys.remove(key)
super(ListDict, self).__delitem__(key)
def values (self):
"""
Return sorted list of values.
"""
"""Return sorted list of values."""
return [self[k] for k in self._keys]
def items (self):
"""
Return sorted list of items.
"""
"""Return sorted list of items."""
return [(k, self[k]) for k in self._keys]
def keys (self):
"""
Return sorted list of keys.
"""
"""Return sorted list of keys."""
return self._keys[:]
def itervalues (self):
"""
Return iterator over sorted values.
"""
"""Return iterator over sorted values."""
return iter(self.values())
def iteritems (self):
"""return iterator over sorted items"""
"""Return iterator over sorted items."""
return iter(self.items())
def iterkeys (self):
"""
Return iterator over sorted keys.
"""
"""Return iterator over sorted keys."""
return iter(self.keys())
def clear (self):
"""
Remove all dict entries.
"""
"""Remove all dict entries."""
self._keys = []
super(ListDict, self).clear()
@ -144,6 +118,61 @@ class ListDict (dict):
return self[key]
class CaselessDict (dict):
"""A dictionary ignoring the case of keys (which must be strings)."""
def __init__ (self):
dict.__init__(self)
def __getitem__ (self, key):
assert isinstance(key, basestring)
return dict.__getitem__(self, key.lower())
def __setitem__ (self, key, value):
assert isinstance(key, basestring)
dict.__setitem__(self, key.lower(), value)
def __contains__ (self, key):
assert isinstance(key, basestring)
return dict.__contains__(self, key.lower())
def has_key (self, key):
assert isinstance(key, basestring)
return dict.has_key(self, key.lower())
def get (self, key, def_val=None):
assert isinstance(key, basestring)
return dict.get(self, key.lower(), def_val)
def setdefault (self, key, def_val=None):
assert isinstance(key, basestring)
return dict.setdefault(self, key.lower(), def_val)
def update (self, other):
for k, v in other.items():
dict.__setitem__(self, k.lower(), v)
def fromkeys (self, iterable, value=None):
d = CaselessDict()
for k in iterable:
dict.__setitem__(d, k.lower(), value)
return d
def pop (self, key, def_val=None):
assert isinstance(key, basestring)
return dict.pop(self, key.lower(), def_val)
class CaselessSortedDict (CaselessDict):
"""Caseless dictionary with sorted keys."""
def keys (self):
return sorted(super(CaselessSortedDict, self).keys())
def items (self):
return [(x, self[x]) for x in self.keys()]
class Node (object):
"""
Internal node with pointers to sisters.
@ -188,29 +217,21 @@ class LRU (object):
self[key] = value
def __contains__ (self, obj):
"""
Look if obj is in the queue.
"""
"""Look if obj is in the queue."""
return obj in self.d
def has_key (self, obj):
"""
Look if obj is in the queue.
"""
"""Look if obj is in the queue."""
return self.d.has_key(obj)
def __getitem__ (self, obj):
"""
Get stored object data, and mark it as LRU.
"""
"""Get stored object data, and mark it as LRU."""
a = self.d[obj].me
self[a[0]] = a[1]
return a[1]
def __setitem__ (self, obj, val):
"""
Set given object data, and mark it as LRU.
"""
"""Set given object data, and mark it as LRU."""
if obj in self.d:
del self[obj]
nobj = Node(self.last, (obj, val))
@ -233,9 +254,7 @@ class LRU (object):
del a
def __delitem__ (self, obj):
"""
Remove object from queue.
"""
"""Remove object from queue."""
nobj = self.d[obj]
if nobj.prev:
nobj.prev.next = nobj.next
@ -248,9 +267,7 @@ class LRU (object):
del self.d[obj]
def __iter__ (self):
"""
Iterate over stored object values.
"""
"""Iterate over stored object values."""
cur = self.first
while cur != None:
cur2 = cur.next
@ -258,9 +275,7 @@ class LRU (object):
cur = cur2
def iteritems (self):
"""
Iterate over stored object items.
"""
"""Iterate over stored object items."""
cur = self.first
while cur != None:
cur2 = cur.next
@ -268,22 +283,16 @@ class LRU (object):
cur = cur2
def iterkeys (self):
"""
Iterate over stored object keys.
"""
"""Iterate over stored object keys."""
return iter(self.d)
def itervalues (self):
"""
Iterate over stored object values.
"""
"""Iterate over stored object values."""
for dummy, j in self.iteritems():
yield j
def keys (self):
"""
Iterate over stored object keys.
"""
"""Iterate over stored object keys."""
return self.d.keys()
def setdefault (self, key, failobj=None):