deleted file mode 100644

@@ -1,16 +0,0 @@

-import functools

-class piecewise_function(object):

-  def __init__(self, fallback):

-    self._conds = []

-    self._fallback = fallback

-#    self.__call__ = functools.wrap(fallback)(self.__call__)

-  def add_piece(self, cond):

-    def _inner(f):

-      self._conds.append((cond,f))

-      return self

-    return _inner

-  def __call__(self, *args, **kwargs):

-    result = self._fallback

-    for cond, func in self._conds:

-      if cond(*args, **kwargs): result = func

-    return result(*args, **kwargs)

@@ -2,6 +2,6 @@ from itertools import*;import sys;j=str.join;c=sys.stdin.read();print j('\n',map

 from itertools import*;import sys;j=str.join;c=sys.stdin.read();print j('\n',[j(' ',[b,j('',islice(repeat('*'),len([x for x in c if x==b])))])for b in map(chr,range(97,122))])

-from itertools import*;import sys;j=str.join;c=sys.stdin.read();print j('\n',[j(' ',[b,j('','*'*c.count(b))])for b in map(chr,range(65,123))])

+import sys;j=str.join;c=sys.stdin.read();print j('\n',[j(' ',[b,j('','*'*c.count(b))])for b in map(chr,range(65,123))])

-module Main where import Data.Char;main=getContents>>=(\b->putStrLn$(map chr[65..122]>>=(\c->c:' ':(take(length$filter(\x->x==c)b)$repeat '*')++"\n")))

\ No newline at end of file

+module Main where import Data.Char;main=getContents>>=(\b->putStrLn$(map chr[65..122]>>=(\c->c:' ':(take(length$filter(\x->x==c)b)$repeat '*')++"\n")))

deleted file mode 100644

@@ -1,7 +0,0 @@

-

-def cmp_dicts(dct, dct1):

-    cp = set()

-    for k in dct.keys():

-        if dct[k] != dct1.get(k,None):

-            cp.add(k)

-    return cp

deleted file mode 100644

@@ -1,21 +0,0 @@

-class LazyLoad(object):

-    def __init__(self, __func_, *args, **kwargs):

-        self.__func = __func_

-        self.__args = list(args)

-        self.__kwargs = kwargs

-    def __get__(self, inst, cls):

-        tb = cls.__dict__

-        nm = [x for x in tb.keys() if id(tb[x]) == id(self)][0]

-        setattr(inst, nm, self.__func(*self.__args, **self.__kwargs))

-        return getattr(inst, nm)

-

-def func(a,b,c):

-    print a,b,c

-    return a+b,c

-

-class a(object):

-    b = LazyLoad(func, 1,2,3)

-    c = LazyLoad(func, 2,3,4)

-    d = LazyLoad(func, 3,4,5)

-    __e = LazyLoad(func, 4,5,6)

-    def __str__(self): return str(self.__e)

\ No newline at end of file

@@ -23,7 +23,7 @@ class IterDict(dict):

   def __delitem__(self, name):

     if name in self.keylist:

       del self.keylist[self.keylist.index(name)]

-	dict.__delitem__(self, name)

+    dict.__delitem__(self, name)

 import itertools

@@ -45,11 +45,11 @@ class PIDmanager(object):

 	def put_task(self, task):

 		pid = self.pid_generator.next()

 		self.queue[pid] = task

-        print pid

+		print pid,

 		if self.tasks == None:

-            self.queue.reset()

+			self.queue.reset()

 			self.tasks = self.queue.keylistiter

-            self.tasks.next()

+			self.tasks.next()

 	@classmethod

 	def run_task(self):

 		if self.tasks != None:

@@ -57,20 +57,20 @@ class PIDmanager(object):

 			task = self.queue[pid]

 			if hasattr(task, '__iter__') and isinstance(task[0], CONT):

 				_, func, args, kwargs, cleanup = task

-                result = []

+				result = []

 				self.queue[pid] = func(*args, **kwargs)

 				cleanup()

-                return self.queue[pid]

+				return self.queue[pid]

 			else:

 				del self.queue[pid]

-                return task

-    @classmethod

-    def run_all(self):

-        try:

-            while 1: self.run_task()

-        except StopIteration:

-            self.queue.reset()

-            self.tasks == None

+				return task

+	@classmethod

+	def run_all(self):

+		try:

+			while 1: self.run_task()

+		except StopIteration:

+			self.queue.reset()

+			self.tasks == None

 def print_many(gen, total=2000, count=0):

@@ -79,9 +79,9 @@ def print_many(gen, total=2000, count=0):

 		return CONT(), print_many, (gen,), dict(total=total, count=count+1), cleanup

-def cleanup(): print

+def cleanup(): print '',

 PIDmanager.put_task( (CONT(), print_many, (itertools.cycle('a'),), dict(total=10), cleanup) )

 PIDmanager.put_task( (CONT(), print_many, (itertools.cycle('b'),), dict(total=10), cleanup) )

-PIDmanager.run_task()

\ No newline at end of file

+PIDmanager.run_task()

@@ -1,8 +1,8 @@

-    def process_chunk(self, chunk):

-        buf = chunk.split(self.__delim)

-        out = []

-        while buf:

-            line = buf.pop(0)

-            if self.__re.search(line):

-                out.append(line)

-        return self.__delim.join(out)

\ No newline at end of file

+ def process_chunk(self, chunk):

+     buf = chunk.split(self.__delim)

+     out = []

+     while buf:

+         line = buf.pop(0)

+         if self.__re.search(line):

+             out.append(line)

+     return self.__delim.join(out)

deleted file mode 100644

@@ -1,54 +0,0 @@

-import functools

-

-def memoize(func):

-    _cache = {}

-    class NULL:pass

-    NULL = NULL()

-    @functools.wraps(func)

-    def _inner(*args, **kwargs):

-        _kwargs = tuple(

-            (k, tuple(v) if hasattr(v, '__iter__') else v) for k,v in kwargs

-        )

-        value = _cache.get((args, _kwargs), NULL)

-        if value is NULL:

-            value = func(*args, **kwargs)

-            _cache[(args,_kwargs)] = value

-        return value

-    _inner.__enter__ = lambda *_: _inner

-    _inner.__exit__ = lambda *_: _cache.clear()

-    _inner.reset = _cache.clear

-    _inner.cache = _cache

-    _inner.orig = func

-    return _inner

-

-class return_if(object):

-    def __init__(self, map):

-        self._map = dict(

-            (tuple(k) if hasattr(k, '__iter__') else (k,),v) for k,v in map.iteritems()

-        )

-        self._func = lambda x:x

-    def _inner(self, *args):

-        if args in self._map: return self._map[args]

-        else: return self._func(*args)

-    def __call__(self, func):

-        self._func = func

-        return self._inner

-

-

-@memoize

-@return_if({1: 1})

-def fact(n):

-    return n*fact(n-1)

-

-

-@return_if({(1,1): 2, (2,2): 3, (3,3):4})

-def sum(a,b):

-    return a+b

-

-

-@memoize

-@return_if({1: 1,2: 1})

-def fib(n):

-    if n < 1: raise ValueError, "not n >= 1"

-    else:

-        return fib(n-1) + fib(n-2)

\ No newline at end of file

deleted file mode 100644

@@ -1,50 +0,0 @@

-

-def f(h):

-  def g(n):

-     if n <= 1: return 1

-     else: return n*h(n-1)

-

-#def e(h):

-#  def

-

-def Y(f):

-  def g(h):

-    def i(x):

-      return f(h(h))(x)

-    return i

-  return g(g)

-

-

-@Y

-def fib(f):

-    def _inner(n):

-        if n in range(2): return 1

-        else: return f(n-1) + f(n-2)

-    return _inner

-

-

-import functools

-

-def bounce(func):

-  @functools.wraps(func)

-  def _inner(arg):

-    result = func(arg)

-    return result(fact)

-  return _inner

-

-class return_if(object):

-    def __init__(self, map):

-        self._map = dict(

-            (tuple(k) if hasattr(k, '__iter__') else (k,),v) for k,v in map.iteritems()

-        )

-        self._func = lambda x:x

-    def _inner(self, *args):

-        if args in self._map: return self._map[args]

-        else: return self._func(*args)

-    def __call__(self, func):

-        self._func = func

-        return self._inner

-@bounce

-@return_if({1: lambda _:1})

-def fact(n):

-    return lambda x: n*x(n-1)