2003-03-12 07:26:59 +01:00
|
|
|
#!/usr/bin/env python
|
|
|
|
|
|
|
|
###
|
|
|
|
# Copyright (c) 2002, Jeremiah Fincher
|
|
|
|
# All rights reserved.
|
|
|
|
#
|
|
|
|
# Redistribution and use in source and binary forms, with or without
|
|
|
|
# modification, are permitted provided that the following conditions are met:
|
|
|
|
#
|
|
|
|
# * Redistributions of source code must retain the above copyright notice,
|
|
|
|
# this list of conditions, and the following disclaimer.
|
|
|
|
# * Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
# this list of conditions, and the following disclaimer in the
|
|
|
|
# documentation and/or other materials provided with the distribution.
|
|
|
|
# * Neither the name of the author of this software nor the name of
|
|
|
|
# contributors to this software may be used to endorse or promote products
|
|
|
|
# derived from this software without specific prior written consent.
|
|
|
|
#
|
|
|
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
# POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
###
|
|
|
|
|
2003-08-07 04:48:44 +02:00
|
|
|
## from __future__ import generators
|
2003-03-12 07:26:59 +01:00
|
|
|
|
2003-08-23 07:53:20 +02:00
|
|
|
"""
|
|
|
|
Fixes stuff that Python should have but doesn't.
|
|
|
|
"""
|
|
|
|
|
2003-03-12 07:26:59 +01:00
|
|
|
import sys
|
|
|
|
import string
|
|
|
|
|
|
|
|
sys.path.insert(0, 'others')
|
|
|
|
|
|
|
|
string.ascii = string.maketrans('', '')
|
|
|
|
|
|
|
|
def ignore(*args, **kwargs):
|
|
|
|
"""Simply ignore the arguments sent to it."""
|
|
|
|
pass
|
|
|
|
|
|
|
|
def catch(f, *args, **kwargs):
|
2003-04-09 20:12:38 +02:00
|
|
|
"""Catches all exceptions raises by f."""
|
2003-03-12 07:26:59 +01:00
|
|
|
try:
|
2003-04-03 08:57:01 +02:00
|
|
|
return f(*args, **kwargs)
|
2003-03-12 07:26:59 +01:00
|
|
|
except:
|
2003-04-03 09:00:51 +02:00
|
|
|
return None
|
2003-03-12 07:26:59 +01:00
|
|
|
|
|
|
|
|
|
|
|
class IterableMap(object):
|
|
|
|
"""Define .iteritems() in a class and subclass this to get the other iters.
|
|
|
|
"""
|
|
|
|
def iteritems(self):
|
|
|
|
raise NotImplementedError
|
|
|
|
|
|
|
|
def iterkeys(self):
|
|
|
|
for (key, _) in self.iteritems():
|
|
|
|
yield key
|
|
|
|
|
|
|
|
def itervalues(self):
|
|
|
|
for (_, value) in self.iteritems():
|
|
|
|
yield value
|
|
|
|
|
|
|
|
def items(self):
|
2003-04-05 12:26:26 +02:00
|
|
|
return list(self.iteritems())
|
2003-03-12 07:26:59 +01:00
|
|
|
|
|
|
|
def keys(self):
|
2003-04-05 12:26:26 +02:00
|
|
|
return list(self.iterkeys())
|
2003-03-12 07:26:59 +01:00
|
|
|
|
|
|
|
def values(self):
|
2003-04-05 12:26:26 +02:00
|
|
|
return list(self.itervalues())
|
2003-03-12 07:26:59 +01:00
|
|
|
|
|
|
|
def __len__(self):
|
|
|
|
ret = 0
|
|
|
|
for _ in self.iteritems():
|
|
|
|
ret += 1
|
|
|
|
return ret
|
|
|
|
|
2003-04-05 12:26:26 +02:00
|
|
|
def __nonzero__(self):
|
|
|
|
for _ in self.iteritems():
|
|
|
|
return True
|
|
|
|
return False
|
|
|
|
|
2003-03-12 07:26:59 +01:00
|
|
|
def mktemp(suffix=''):
|
2003-04-09 20:12:38 +02:00
|
|
|
"""Gives a decent random string, suitable for a filename."""
|
2003-03-12 07:26:59 +01:00
|
|
|
import sha
|
|
|
|
import md5
|
|
|
|
import time
|
|
|
|
import random
|
|
|
|
r = random.Random()
|
|
|
|
m = md5.md5(suffix)
|
|
|
|
r.seed(time.time())
|
|
|
|
s = str(r.getstate())
|
|
|
|
for x in xrange(0, random.randrange(400), random.randrange(1, 5)):
|
|
|
|
m.update(str(x))
|
|
|
|
m.update(s)
|
|
|
|
m.update(str(time.time()))
|
|
|
|
s = m.hexdigest()
|
|
|
|
return sha.sha(s + str(time.time())).hexdigest() + suffix
|
|
|
|
|
|
|
|
def reviter(L):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Iterates through a list in reverse."""
|
2003-03-12 07:26:59 +01:00
|
|
|
for i in xrange(len(L) - 1, -1, -1):
|
|
|
|
yield L[i]
|
|
|
|
|
|
|
|
def window(L, size):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Returns a sliding 'window' through the list L of size size."""
|
2003-04-03 10:17:57 +02:00
|
|
|
if size < 1:
|
|
|
|
raise ValueError, 'size <= 0 unallowed.'
|
2003-03-12 07:26:59 +01:00
|
|
|
for i in xrange(len(L) - (size-1)):
|
|
|
|
yield L[i:i+size]
|
2003-03-25 21:21:12 +01:00
|
|
|
|
2003-08-07 08:13:11 +02:00
|
|
|
def ilen(iterator):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Returns the length of an iterator."""
|
2003-08-07 08:13:11 +02:00
|
|
|
i = 0
|
|
|
|
for _ in iterator:
|
|
|
|
i += 1
|
|
|
|
return i
|
|
|
|
|
2003-08-17 08:24:58 +02:00
|
|
|
def group(seq, groupSize, noneFill=True):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Groups a given sequence into sublists of length groupSize."""
|
2003-08-11 09:12:41 +02:00
|
|
|
ret = []
|
|
|
|
L = []
|
|
|
|
i = groupSize
|
|
|
|
for elt in seq:
|
|
|
|
if i > 0:
|
|
|
|
L.append(elt)
|
|
|
|
else:
|
|
|
|
ret.append(L)
|
|
|
|
i = groupSize
|
|
|
|
L = []
|
|
|
|
L.append(elt)
|
|
|
|
i -= 1
|
|
|
|
if L:
|
2003-08-17 08:24:58 +02:00
|
|
|
if noneFill:
|
|
|
|
while len(L) < groupSize:
|
|
|
|
L.append(None)
|
2003-08-11 09:12:41 +02:00
|
|
|
ret.append(L)
|
|
|
|
return ret
|
2003-07-31 08:20:58 +02:00
|
|
|
|
2003-03-25 21:21:12 +01:00
|
|
|
def itersplit(iterable, isSeparator, yieldEmpty=False):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Splits an iterator based on a predicate isSeparator."""
|
2003-03-25 21:21:12 +01:00
|
|
|
acc = []
|
|
|
|
for element in iterable:
|
|
|
|
if isSeparator(element):
|
2003-03-28 03:34:03 +01:00
|
|
|
if acc or yieldEmpty:
|
2003-03-25 21:21:12 +01:00
|
|
|
yield acc
|
|
|
|
acc = []
|
|
|
|
else:
|
|
|
|
acc.append(element)
|
2003-03-28 03:34:03 +01:00
|
|
|
if acc or yieldEmpty:
|
2003-03-25 21:21:12 +01:00
|
|
|
yield acc
|
|
|
|
|
2003-04-05 15:35:25 +02:00
|
|
|
def flatten(seq, strings=False):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Flattens a list of lists into a single list. See the test for examples.
|
|
|
|
"""
|
2003-04-05 15:35:25 +02:00
|
|
|
for elt in seq:
|
|
|
|
if not strings and type(elt) == str or type(elt) == unicode:
|
|
|
|
yield elt
|
|
|
|
else:
|
|
|
|
try:
|
|
|
|
for x in flatten(elt):
|
|
|
|
yield x
|
|
|
|
except TypeError:
|
|
|
|
yield elt
|
2003-04-11 09:10:55 +02:00
|
|
|
|
2003-04-20 19:17:50 +02:00
|
|
|
def partition(p, L):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Partitions a list L based on a predicate p. Returns a (yes,no) tuple"""
|
2003-04-20 19:17:50 +02:00
|
|
|
no = []
|
|
|
|
yes = []
|
|
|
|
for elt in L:
|
|
|
|
if p(elt):
|
|
|
|
yes.append(elt)
|
|
|
|
else:
|
|
|
|
no.append(elt)
|
|
|
|
return (yes, no)
|
2003-07-30 23:47:21 +02:00
|
|
|
|
|
|
|
def flip((x, y)):
|
2003-08-23 07:53:20 +02:00
|
|
|
"""Flips a two-tuple around. (x, y) becomes (y, x)."""
|
2003-07-30 23:47:21 +02:00
|
|
|
return (y, x)
|
2003-08-20 18:26:23 +02:00
|
|
|
|
2003-03-24 09:41:19 +01:00
|
|
|
# vim:set shiftwidth=4 tabstop=8 expandtab textwidth=78:
|