aboutsummaryrefslogtreecommitdiffstats
path: root/mako/util.py
diff options
context:
space:
mode:
authorMike Bayer <mike_mp@zzzcomputing.com>2012-07-07 20:52:31 -0400
committerMike Bayer <mike_mp@zzzcomputing.com>2012-07-07 20:52:31 -0400
commit0f58ab39bf6753492e565a85f9f436d476a550b1 (patch)
tree241293f5643da3d12148af15af3c81a79ea8c59e /mako/util.py
parent936efb91e23058a0450eea823489514f4d422a51 (diff)
downloadexternal_python_mako-0f58ab39bf6753492e565a85f9f436d476a550b1.tar.gz
external_python_mako-0f58ab39bf6753492e565a85f9f436d476a550b1.tar.bz2
external_python_mako-0f58ab39bf6753492e565a85f9f436d476a550b1.zip
epic trailing whitespace removal
Diffstat (limited to 'mako/util.py')
-rw-r--r--mako/util.py44
1 files changed, 22 insertions, 22 deletions
diff --git a/mako/util.py b/mako/util.py
index dc070a0..df4bf4b 100644
--- a/mako/util.py
+++ b/mako/util.py
@@ -35,7 +35,7 @@ except ImportError:
if win32 or jython:
time_func = time.clock
else:
- time_func = time.time
+ time_func = time.time
def function_named(fn, name):
"""Return a function with a given __name__.
@@ -87,13 +87,13 @@ class PluginLoader(object):
else:
import pkg_resources
for impl in pkg_resources.iter_entry_points(
- self.group,
+ self.group,
name):
self.impls[name] = impl.load
return impl.load()
else:
raise exceptions.RuntimeException(
- "Can't load plugin %s %s" %
+ "Can't load plugin %s %s" %
(self.group, name))
def register(self, name, modulepath, objname):
@@ -106,9 +106,9 @@ class PluginLoader(object):
def verify_directory(dir):
"""create and/or verify a filesystem directory."""
-
+
tries = 0
-
+
while not os.path.exists(dir):
try:
tries += 1
@@ -170,16 +170,16 @@ class SetLikeDict(dict):
"""a dictionary that has some setlike methods on it"""
def union(self, other):
"""produce a 'union' of this dict and another (at the key level).
-
+
values in the second dict take precedence over that of the first"""
x = SetLikeDict(**self)
x.update(other)
return x
class FastEncodingBuffer(object):
- """a very rudimentary buffer that is faster than StringIO,
+ """a very rudimentary buffer that is faster than StringIO,
but doesn't crash on unicode data like cStringIO."""
-
+
def __init__(self, encoding=None, errors='strict', unicode=False):
self.data = collections.deque()
self.encoding = encoding
@@ -190,11 +190,11 @@ class FastEncodingBuffer(object):
self.unicode = unicode
self.errors = errors
self.write = self.data.append
-
+
def truncate(self):
self.data = collections.deque()
self.write = self.data.append
-
+
def getvalue(self):
if self.encoding:
return self.delim.join(self.data).encode(self.encoding,
@@ -205,12 +205,12 @@ class FastEncodingBuffer(object):
class LRUCache(dict):
"""A dictionary-like object that stores a limited number of items,
discarding lesser used items periodically.
-
+
this is a rewrite of LRUCache from Myghty to use a periodic timestamp-based
paradigm so that synchronization is not really needed. the size management
is inexact.
"""
-
+
class _Item(object):
def __init__(self, key, value):
self.key = key
@@ -218,26 +218,26 @@ class LRUCache(dict):
self.timestamp = time_func()
def __repr__(self):
return repr(self.value)
-
+
def __init__(self, capacity, threshold=.5):
self.capacity = capacity
self.threshold = threshold
-
+
def __getitem__(self, key):
item = dict.__getitem__(self, key)
item.timestamp = time_func()
return item.value
-
+
def values(self):
return [i.value for i in dict.values(self)]
-
+
def setdefault(self, key, value):
if key in self:
return self[key]
else:
self[key] = value
return value
-
+
def __setitem__(self, key, value):
item = dict.get(self, key)
if item is None:
@@ -246,10 +246,10 @@ class LRUCache(dict):
else:
item.value = value
self._manage_size()
-
+
def _manage_size(self):
while len(self) > self.capacity + self.capacity * self.threshold:
- bytime = sorted(dict.values(self),
+ bytime = sorted(dict.values(self),
key=operator.attrgetter('timestamp'), reverse=True)
for item in bytime[self.capacity:]:
try:
@@ -313,14 +313,14 @@ def parse_encoding(fp):
def sorted_dict_repr(d):
"""repr() a dictionary with the keys in order.
-
+
Used by the lexer unit test to compare parse trees based on strings.
-
+
"""
keys = d.keys()
keys.sort()
return "{" + ", ".join(["%r: %r" % (k, d[k]) for k in keys]) + "}"
-
+
def restore__ast(_ast):
"""Attempt to restore the required classes to the _ast module if it
appears to be missing them