hosting/server/util.py [22:133]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
def cons(a, b):
    return (a,) + b

def car(l):
    return l[0]

def first(l):
    return car(l)
    
def cdr(l):
    return l[1:]

def rest(l):
    return cdr(l)

def cadr(l):
    return car(cdr(l))

def cddr(l):
    return cdr(cdr(l))

def caddr(l):
    return car(cddr(l))

def cdddr(l):
    return cdr(cdr(cdr(l)))

def cadddr(l):
    return car(cdddr(l))

def append(a, b):
    return a + b

def reverse(l):
    r = list(l)
    r.reverse()
    return tuple(r)

def isNull(l):
    if isinstance(l, streampair):
        return l.isNull()
    return l is None or l == ()

def isSymbol(v):
    return isinstance(v, basestring) and v[0:1] == "'"

def isString(v):
    return isinstance(v, basestring) and v[0:1] != "'"

def isList(v):
    if getattr(v, '__iter__', False) == False:
        return False
    if isinstance(v, basestring) or isinstance(v, dict):
        return False
    return True

def isTaggedList(v, t):
    return isList(v) and not isNull(v) and car(v) == t


# Scheme-like streams
class streampair(object):
    def __init__(self, car, cdr):
        self.car = car
        self.cdr = cdr

    def __repr__(self):
        return repr(self[0:len(self)])

    def isNull(self):
        return self.cdr == ()

    def __len__(self):
        if self.cdr == ():
            return 0
        return 1 + len(self.cdr())

    def __getitem__(self, i):
        if i == 0:
            return self.car
        return self.cdr()[i - 1]

    def __getslice__(self, i, j):
        if isNull(self):
            return ()
        if i > 0:
            if j == maxint:
                return self.cdr()[i - 1: j]
            return self.cdr()[i - 1: j - 1]
        if j == maxint:
            return self
        if j == 0:
            return (self.car,)
        return (self.car,) + self.cdr()[: j - 1]

    def __eq__(self, other):
        sl = len(self)
        ol = len(other)
        if sl != ol:
            return False
        return self[0: sl] == other[0: ol]

    def __ne__(self, other):
        return not self.__eq__(other)

def cons_stream(car, cdr):
    return streampair(car, cdr)


# Scheme-like associations
def assoc(k, l):
    if l == ():
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



modules/wsgi/util.py [22:133]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
def cons(a, b):
    return (a,) + b

def car(l):
    return l[0]

def first(l):
    return car(l)
    
def cdr(l):
    return l[1:]

def rest(l):
    return cdr(l)

def cadr(l):
    return car(cdr(l))

def cddr(l):
    return cdr(cdr(l))

def caddr(l):
    return car(cddr(l))

def cdddr(l):
    return cdr(cdr(cdr(l)))

def cadddr(l):
    return car(cdddr(l))

def append(a, b):
    return a + b

def reverse(l):
    r = list(l)
    r.reverse()
    return tuple(r)

def isNull(l):
    if isinstance(l, streampair):
        return l.isNull()
    return l is None or l == ()

def isSymbol(v):
    return isinstance(v, basestring) and v[0:1] == "'"

def isString(v):
    return isinstance(v, basestring) and v[0:1] != "'"

def isList(v):
    if getattr(v, '__iter__', False) == False:
        return False
    if isinstance(v, basestring) or isinstance(v, dict):
        return False
    return True

def isTaggedList(v, t):
    return isList(v) and not isNull(v) and car(v) == t


# Scheme-like streams
class streampair(object):
    def __init__(self, car, cdr):
        self.car = car
        self.cdr = cdr

    def __repr__(self):
        return repr(self[0:len(self)])

    def isNull(self):
        return self.cdr == ()

    def __len__(self):
        if self.cdr == ():
            return 0
        return 1 + len(self.cdr())

    def __getitem__(self, i):
        if i == 0:
            return self.car
        return self.cdr()[i - 1]

    def __getslice__(self, i, j):
        if isNull(self):
            return ()
        if i > 0:
            if j == maxint:
                return self.cdr()[i - 1: j]
            return self.cdr()[i - 1: j - 1]
        if j == maxint:
            return self
        if j == 0:
            return (self.car,)
        return (self.car,) + self.cdr()[: j - 1]

    def __eq__(self, other):
        sl = len(self)
        ol = len(other)
        if sl != ol:
            return False
        return self[0: sl] == other[0: ol]

    def __ne__(self, other):
        return not self.__eq__(other)

def cons_stream(car, cdr):
    return streampair(car, cdr)


# Scheme-like associations
def assoc(k, l):
    if l == ():
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -