ÿØÿà�JFIF������ÿápExif��II*������[������¼ p!ranha?
Server IP : 172.67.145.202  /  Your IP : 172.70.188.20
Web Server : Apache/2.2.15 (CentOS)
System : Linux GA 2.6.32-431.1.2.0.1.el6.x86_64 #1 SMP Fri Dec 13 13:06:13 UTC 2013 x86_64
User : apache ( 48)
PHP Version : 5.6.38
Disable Function : NONE
MySQL : ON  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : ON  |  Sudo : ON  |  Pkexec : OFF
Directory :  /proc/self/root/usr/lib64/python2.6/

Upload File :
Curr3nt_D!r [ Writeable ] D0cum3nt_r0Ot [ Writeable ]

 
Command :
Current File : /proc/self/root/usr/lib64/python2.6/difflib.py
"""
Module difflib -- helpers for computing deltas between objects.

Function get_close_matches(word, possibilities, n=3, cutoff=0.6):
    Use SequenceMatcher to return list of the best "good enough" matches.

Function context_diff(a, b):
    For two lists of strings, return a delta in context diff format.

Function ndiff(a, b):
    Return a delta: the difference between `a` and `b` (lists of strings).

Function restore(delta, which):
    Return one of the two sequences that generated an ndiff delta.

Function unified_diff(a, b):
    For two lists of strings, return a delta in unified diff format.

Class SequenceMatcher:
    A flexible class for comparing pairs of sequences of any type.

Class Differ:
    For producing human-readable deltas from sequences of lines of text.

Class HtmlDiff:
    For producing HTML side by side comparison with change highlights.
"""

__all__ = ['get_close_matches', 'ndiff', 'restore', 'SequenceMatcher',
           'Differ','IS_CHARACTER_JUNK', 'IS_LINE_JUNK', 'context_diff',
           'unified_diff', 'HtmlDiff', 'Match']

import heapq
from collections import namedtuple as _namedtuple
from functools import reduce

Match = _namedtuple('Match', 'a b size')

def _calculate_ratio(matches, length):
    if length:
        return 2.0 * matches / length
    return 1.0

class SequenceMatcher:

    """
    SequenceMatcher is a flexible class for comparing pairs of sequences of
    any type, so long as the sequence elements are hashable.  The basic
    algorithm predates, and is a little fancier than, an algorithm
    published in the late 1980's by Ratcliff and Obershelp under the
    hyperbolic name "gestalt pattern matching".  The basic idea is to find
    the longest contiguous matching subsequence that contains no "junk"
    elements (R-O doesn't address junk).  The same idea is then applied
    recursively to the pieces of the sequences to the left and to the right
    of the matching subsequence.  This does not yield minimal edit
    sequences, but does tend to yield matches that "look right" to people.

    SequenceMatcher tries to compute a "human-friendly diff" between two
    sequences.  Unlike e.g. UNIX(tm) diff, the fundamental notion is the
    longest *contiguous* & junk-free matching subsequence.  That's what
    catches peoples' eyes.  The Windows(tm) windiff has another interesting
    notion, pairing up elements that appear uniquely in each sequence.
    That, and the method here, appear to yield more intuitive difference
    reports than does diff.  This method appears to be the least vulnerable
    to synching up on blocks of "junk lines", though (like blank lines in
    ordinary text files, or maybe "<P>" lines in HTML files).  That may be
    because this is the only method of the 3 that has a *concept* of
    "junk" <wink>.

    Example, comparing two strings, and considering blanks to be "junk":

    >>> s = SequenceMatcher(lambda x: x == " ",
    ...                     "private Thread currentThread;",
    ...                     "private volatile Thread currentThread;")
    >>>

    .ratio() returns a float in [0, 1], measuring the "similarity" of the
    sequences.  As a rule of thumb, a .ratio() value over 0.6 means the
    sequences are close matches:

    >>> print round(s.ratio(), 3)
    0.866
    >>>

    If you're only interested in where the sequences match,
    .get_matching_blocks() is handy:

    >>> for block in s.get_matching_blocks():
    ...     print "a[%d] and b[%d] match for %d elements" % block
    a[0] and b[0] match for 8 elements
    a[8] and b[17] match for 21 elements
    a[29] and b[38] match for 0 elements

    Note that the last tuple returned by .get_matching_blocks() is always a
    dummy, (len(a), len(b), 0), and this is the only case in which the last
    tuple element (number of elements matched) is 0.

    If you want to know how to change the first sequence into the second,
    use .get_opcodes():

    >>> for opcode in s.get_opcodes():
    ...     print "%6s a[%d:%d] b[%d:%d]" % opcode
     equal a[0:8] b[0:8]
    insert a[8:8] b[8:17]
     equal a[8:29] b[17:38]

    See the Differ class for a fancy human-friendly file differencer, which
    uses SequenceMatcher both to compare sequences of lines, and to compare
    sequences of characters within similar (near-matching) lines.

    See also function get_close_matches() in this module, which shows how
    simple code building on SequenceMatcher can be used to do useful work.

    Timing:  Basic R-O is cubic time worst case and quadratic time expected
    case.  SequenceMatcher is quadratic time for the worst case and has
    expected-case behavior dependent in a complicated way on how many
    elements the sequences have in common; best case time is linear.

    Methods:

    __init__(isjunk=None, a='', b='')
        Construct a SequenceMatcher.

    set_seqs(a, b)
        Set the two sequences to be compared.

    set_seq1(a)
        Set the first sequence to be compared.

    set_seq2(b)
        Set the second sequence to be compared.

    find_longest_match(alo, ahi, blo, bhi)
        Find longest matching block in a[alo:ahi] and b[blo:bhi].

    get_matching_blocks()
        Return list of triples describing matching subsequences.

    get_opcodes()
        Return list of 5-tuples describing how to turn a into b.

    ratio()
        Return a measure of the sequences' similarity (float in [0,1]).

    quick_ratio()
        Return an upper bound on .ratio() relatively quickly.

    real_quick_ratio()
        Return an upper bound on ratio() very quickly.
    """

    def __init__(self, isjunk=None, a='', b=''):
        """Construct a SequenceMatcher.

        Optional arg isjunk is None (the default), or a one-argument
        function that takes a sequence element and returns true iff the
        element is junk.  None is equivalent to passing "lambda x: 0", i.e.
        no elements are considered to be junk.  For example, pass
            lambda x: x in " \\t"
        if you're comparing lines as sequences of characters, and don't
        want to synch up on blanks or hard tabs.

        Optional arg a is the first of two sequences to be compared.  By
        default, an empty string.  The elements of a must be hashable.  See
        also .set_seqs() and .set_seq1().

        Optional arg b is the second of two sequences to be compared.  By
        default, an empty string.  The elements of b must be hashable. See
        also .set_seqs() and .set_seq2().
        """

        # Members:
        # a
        #      first sequence
        # b
        #      second sequence; differences are computed as "what do
        #      we need to do to 'a' to change it into 'b'?"
        # b2j
        #      for x in b, b2j[x] is a list of the indices (into b)
        #      at which x appears; junk elements do not appear
        # fullbcount
        #      for x in b, fullbcount[x] == the number of times x
        #      appears in b; only materialized if really needed (used
        #      only for computing quick_ratio())
        # matching_blocks
        #      a list of (i, j, k) triples, where a[i:i+k] == b[j:j+k];
        #      ascending & non-overlapping in i and in j; terminated by
        #      a dummy (len(a), len(b), 0) sentinel
        # opcodes
        #      a list of (tag, i1, i2, j1, j2) tuples, where tag is
        #      one of
        #          'replace'   a[i1:i2] should be replaced by b[j1:j2]
        #          'delete'    a[i1:i2] should be deleted
        #          'insert'    b[j1:j2] should be inserted
        #          'equal'     a[i1:i2] == b[j1:j2]
        # isjunk
        #      a user-supplied function taking a sequence element and
        #      returning true iff the element is "junk" -- this has
        #      subtle but helpful effects on the algorithm, which I'll
        #      get around to writing up someday <0.9 wink>.
        #      DON'T USE!  Only __chain_b uses this.  Use isbjunk.
        # isbjunk
        #      for x in b, isbjunk(x) == isjunk(x) but much faster;
        #      it's really the __contains__ method of a hidden dict.
        #      DOES NOT WORK for x in a!
        # isbpopular
        #      for x in b, isbpopular(x) is true iff b is reasonably long
        #      (at least 200 elements) and x accounts for more than 1% of
        #      its elements.  DOES NOT WORK for x in a!

        self.isjunk = isjunk
        self.a = self.b = None
        self.set_seqs(a, b)

    def set_seqs(self, a, b):
        """Set the two sequences to be compared.

        >>> s = SequenceMatcher()
        >>> s.set_seqs("abcd", "bcde")
        >>> s.ratio()
        0.75
        """

        self.set_seq1(a)
        self.set_seq2(b)

    def set_seq1(self, a):
        """Set the first sequence to be compared.

        The second sequence to be compared is not changed.

        >>> s = SequenceMatcher(None, "abcd", "bcde")
        >>> s.ratio()
        0.75
        >>> s.set_seq1("bcde")
        >>> s.ratio()
        1.0
        >>>

        SequenceMatcher computes and caches detailed information about the
        second sequence, so if you want to compare one sequence S against
        many sequences, use .set_seq2(S) once and call .set_seq1(x)
        repeatedly for each of the other sequences.

        See also set_seqs() and set_seq2().
        """

        if a is self.a:
            return
        self.a = a
        self.matching_blocks = self.opcodes = None

    def set_seq2(self, b):
        """Set the second sequence to be compared.

        The first sequence to be compared is not changed.

        >>> s = SequenceMatcher(None, "abcd", "bcde")
        >>> s.ratio()
        0.75
        >>> s.set_seq2("abcd")
        >>> s.ratio()
        1.0
        >>>

        SequenceMatcher computes and caches detailed information about the
        second sequence, so if you want to compare one sequence S against
        many sequences, use .set_seq2(S) once and call .set_seq1(x)
        repeatedly for each of the other sequences.

        See also set_seqs() and set_seq1().
        """

        if b is self.b:
            return
        self.b = b
        self.matching_blocks = self.opcodes = None
        self.fullbcount = None
        self.__chain_b()

    # For each element x in b, set b2j[x] to a list of the indices in
    # b where x appears; the indices are in increasing order; note that
    # the number of times x appears in b is len(b2j[x]) ...
    # when self.isjunk is defined, junk elements don't show up in this
    # map at all, which stops the central find_longest_match method
    # from starting any matching block at a junk element ...
    # also creates the fast isbjunk function ...
    # b2j also does not contain entries for "popular" elements, meaning
    # elements that account for more than 1% of the total elements, and
    # when the sequence is reasonably large (>= 200 elements); this can
    # be viewed as an adaptive notion of semi-junk, and yields an enormous
    # speedup when, e.g., comparing program files with hundreds of
    # instances of "return NULL;" ...
    # note that this is only called when b changes; so for cross-product
    # kinds of matches, it's best to call set_seq2 once, then set_seq1
    # repeatedly

    def __chain_b(self):
        # Because isjunk is a user-defined (not C) function, and we test
        # for junk a LOT, it's important to minimize the number of calls.
        # Before the tricks described here, __chain_b was by far the most
        # time-consuming routine in the whole module!  If anyone sees
        # Jim Roskind, thank him again for profile.py -- I never would
        # have guessed that.
        # The first trick is to build b2j ignoring the possibility
        # of junk.  I.e., we don't call isjunk at all yet.  Throwing
        # out the junk later is much cheaper than building b2j "right"
        # from the start.
        b = self.b
        n = len(b)
        self.b2j = b2j = {}
        populardict = {}
        for i, elt in enumerate(b):
            if elt in b2j:
                indices = b2j[elt]
                if n >= 200 and len(indices) * 100 > n:
                    populardict[elt] = 1
                    del indices[:]
                else:
                    indices.append(i)
            else:
                b2j[elt] = [i]

        # Purge leftover indices for popular elements.
        for elt in populardict:
            del b2j[elt]

        # Now b2j.keys() contains elements uniquely, and especially when
        # the sequence is a string, that's usually a good deal smaller
        # than len(string).  The difference is the number of isjunk calls
        # saved.
        isjunk = self.isjunk
        junkdict = {}
        if isjunk:
            for d in populardict, b2j:
                for elt in d.keys():
                    if isjunk(elt):
                        junkdict[elt] = 1
                        del d[elt]

        # Now for x in b, isjunk(x) == x in junkdict, but the
        # latter is much faster.  Note too that while there may be a
        # lot of junk in the sequence, the number of *unique* junk
        # elements is probably small.  So the memory burden of keeping
        # this dict alive is likely trivial compared to the size of b2j.
        self.isbjunk = junkdict.__contains__
        self.isbpopular = populardict.__contains__

    def find_longest_match(self, alo, ahi, blo, bhi):
        """Find longest matching block in a[alo:ahi] and b[blo:bhi].

        If isjunk is not defined:

        Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where
            alo <= i <= i+k <= ahi
            blo <= j <= j+k <= bhi
        and for all (i',j',k') meeting those conditions,
            k >= k'
            i <= i'
            and if i == i', j <= j'

        In other words, of all maximal matching blocks, return one that
        starts earliest in a, and of all those maximal matching blocks that
        start earliest in a, return the one that starts earliest in b.

        >>> s = SequenceMatcher(None, " abcd", "abcd abcd")
        >>> s.find_longest_match(0, 5, 0, 9)
        Match(a=0, b=4, size=5)

        If isjunk is defined, first the longest matching block is
        determined as above, but with the additional restriction that no
        junk element appears in the block.  Then that block is extended as
        far as possible by matching (only) junk elements on both sides.  So
        the resulting block never matches on junk except as identical junk
        happens to be adjacent to an "interesting" match.

        Here's the same example as before, but considering blanks to be
        junk.  That prevents " abcd" from matching the " abcd" at the tail
        end of the second sequence directly.  Instead only the "abcd" can
        match, and matches the leftmost "abcd" in the second sequence:

        >>> s = SequenceMatcher(lambda x: x==" ", " abcd", "abcd abcd")
        >>> s.find_longest_match(0, 5, 0, 9)
        Match(a=1, b=0, size=4)

        If no blocks match, return (alo, blo, 0).

        >>> s = SequenceMatcher(None, "ab", "c")
        >>> s.find_longest_match(0, 2, 0, 1)
        Match(a=0, b=0, size=0)
        """

        # CAUTION:  stripping common prefix or suffix would be incorrect.
        # E.g.,
        #    ab
        #    acab
        # Longest matching block is "ab", but if common prefix is
        # stripped, it's "a" (tied with "b").  UNIX(tm) diff does so
        # strip, so ends up claiming that ab is changed to acab by
        # inserting "ca" in the middle.  That's minimal but unintuitive:
        # "it's obvious" that someone inserted "ac" at the front.
        # Windiff ends up at the same place as diff, but by pairing up
        # the unique 'b's and then matching the first two 'a's.

        a, b, b2j, isbjunk = self.a, self.b, self.b2j, self.isbjunk
        besti, bestj, bestsize = alo, blo, 0
        # find longest junk-free match
        # during an iteration of the loop, j2len[j] = length of longest
        # junk-free match ending with a[i-1] and b[j]
        j2len = {}
        nothing = []
        for i in xrange(alo, ahi):
            # look at all instances of a[i] in b; note that because
            # b2j has no junk keys, the loop is skipped if a[i] is junk
            j2lenget = j2len.get
            newj2len = {}
            for j in b2j.get(a[i], nothing):
                # a[i] matches b[j]
                if j < blo:
                    continue
                if j >= bhi:
                    break
                k = newj2len[j] = j2lenget(j-1, 0) + 1
                if k > bestsize:
                    besti, bestj, bestsize = i-k+1, j-k+1, k
            j2len = newj2len

        # Extend the best by non-junk elements on each end.  In particular,
        # "popular" non-junk elements aren't in b2j, which greatly speeds
        # the inner loop above, but also means "the best" match so far
        # doesn't contain any junk *or* popular non-junk elements.
        while besti > alo and bestj > blo and \
              not isbjunk(b[bestj-1]) and \
              a[besti-1] == b[bestj-1]:
            besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
        while besti+bestsize < ahi and bestj+bestsize < bhi and \
              not isbjunk(b[bestj+bestsize]) and \
              a[besti+bestsize] == b[bestj+bestsize]:
            bestsize += 1

        # Now that we have a wholly interesting match (albeit possibly
        # empty!), we may as well suck up the matching junk on each
        # side of it too.  Can't think of a good reason not to, and it
        # saves post-processing the (possibly considerable) expense of
        # figuring out what to do with it.  In the case of an empty
        # interesting match, this is clearly the right thing to do,
        # because no other kind of match is possible in the regions.
        while besti > alo and bestj > blo and \
              isbjunk(b[bestj-1]) and \
              a[besti-1] == b[bestj-1]:
            besti, bestj, bestsize = besti-1, bestj-1, bestsize+1
        while besti+bestsize < ahi and bestj+bestsize < bhi and \
              isbjunk(b[bestj+bestsize]) and \
              a[besti+bestsize] == b[bestj+bestsize]:
            bestsize = bestsize + 1

        return Match(besti, bestj, bestsize)

    def get_matching_blocks(self):
        """Return list of triples describing matching subsequences.

        Each triple is of the form (i, j, n), and means that
        a[i:i+n] == b[j:j+n].  The triples are monotonically increasing in
        i and in j.  New in Python 2.5, it's also guaranteed that if
        (i, j, n) and (i', j', n') are adjacent triples in the list, and
        the second is not the last triple in the list, then i+n != i' or
        j+n != j'.  IOW, adjacent triples never describe adjacent equal
        blocks.

        The last triple is a dummy, (len(a), len(b), 0), and is the only
        triple with n==0.

        >>> s = SequenceMatcher(None, "abxcd", "abcd")
        >>> s.get_matching_blocks()
        [Match(a=0, b=0, size=2), Match(a=3, b=2, size=2), Match(a=5, b=4, size=0)]
        """

        if self.matching_blocks is not None:
            return self.matching_blocks
        la, lb = len(self.a), len(self.b)

        # This is most naturally expressed as a recursive algorithm, but
        # at least one user bumped into extreme use cases that exceeded
        # the recursion limit on their box.  So, now we maintain a list
        # ('queue`) of blocks we still need to look at, and append partial
        # results to `matching_blocks` in a loop; the matches are sorted
        # at the end.
        queue = [(0, la, 0, lb)]
        matching_blocks = []
        while queue:
            alo, ahi, blo, bhi = queue.pop()
            i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
            # a[alo:i] vs b[blo:j] unknown
            # a[i:i+k] same as b[j:j+k]
            # a[i+k:ahi] vs b[j+k:bhi] unknown
            if k:   # if k is 0, there was no matching block
                matching_blocks.append(x)
                if alo < i and blo < j:
                    queue.append((alo, i, blo, j))
                if i+k < ahi and j+k < bhi:
                    queue.append((i+k, ahi, j+k, bhi))
        matching_blocks.sort()

        # It's possible that we have adjacent equal blocks in the
        # matching_blocks list now.  Starting with 2.5, this code was added
        # to collapse them.
        i1 = j1 = k1 = 0
        non_adjacent = []
        for i2, j2, k2 in matching_blocks:
            # Is this block adjacent to i1, j1, k1?
            if i1 + k1 == i2 and j1 + k1 == j2:
                # Yes, so collapse them -- this just increases the length of
                # the first block by the length of the second, and the first
                # block so lengthened remains the block to compare against.
                k1 += k2
            else:
                # Not adjacent.  Remember the first block (k1==0 means it's
                # the dummy we started with), and make the second block the
                # new block to compare against.
                if k1:
                    non_adjacent.append((i1, j1, k1))
                i1, j1, k1 = i2, j2, k2
        if k1:
            non_adjacent.append((i1, j1, k1))

        non_adjacent.append( (la, lb, 0) )
        self.matching_blocks = non_adjacent
        return map(Match._make, self.matching_blocks)

    def get_opcodes(self):
        """Return list of 5-tuples describing how to turn a into b.

        Each tuple is of the form (tag, i1, i2, j1, j2).  The first tuple
        has i1 == j1 == 0, and remaining tuples have i1 == the i2 from the
        tuple preceding it, and likewise for j1 == the previous j2.

        The tags are strings, with these meanings:

        'replace':  a[i1:i2] should be replaced by b[j1:j2]
        'delete':   a[i1:i2] should be deleted.
                    Note that j1==j2 in this case.
        'insert':   b[j1:j2] should be inserted at a[i1:i1].
                    Note that i1==i2 in this case.
        'equal':    a[i1:i2] == b[j1:j2]

        >>> a = "qabxcd"
        >>> b = "abycdf"
        >>> s = SequenceMatcher(None, a, b)
        >>> for tag, i1, i2, j1, j2 in s.get_opcodes():
        ...    print ("%7s a[%d:%d] (%s) b[%d:%d] (%s)" %
        ...           (tag, i1, i2, a[i1:i2], j1, j2, b[j1:j2]))
         delete a[0:1] (q) b[0:0] ()
          equal a[1:3] (ab) b[0:2] (ab)
        replace a[3:4] (x) b[2:3] (y)
          equal a[4:6] (cd) b[3:5] (cd)
         insert a[6:6] () b[5:6] (f)
        """

        if self.opcodes is not None:
            return self.opcodes
        i = j = 0
        self.opcodes = answer = []
        for ai, bj, size in self.get_matching_blocks():
            # invariant:  we've pumped out correct diffs to change
            # a[:i] into b[:j], and the next matching block is
            # a[ai:ai+size] == b[bj:bj+size].  So we need to pump
            # out a diff to change a[i:ai] into b[j:bj], pump out
            # the matching block, and move (i,j) beyond the match
            tag = ''
            if i < ai and j < bj:
                tag = 'replace'
            elif i < ai:
                tag = 'delete'
            elif j < bj:
                tag = 'insert'
            if tag:
                answer.append( (tag, i, ai, j, bj) )
            i, j = ai+size, bj+size
            # the list of matching blocks is terminated by a
            # sentinel with size 0
            if size:
                answer.append( ('equal', ai, i, bj, j) )
        return answer

    def get_grouped_opcodes(self, n=3):
        """ Isolate change clusters by eliminating ranges with no changes.

        Return a generator of groups with upto n lines of context.
        Each group is in the same format as returned by get_opcodes().

        >>> from pprint import pprint
        >>> a = map(str, range(1,40))
        >>> b = a[:]
        >>> b[8:8] = ['i']     # Make an insertion
        >>> b[20] += 'x'       # Make a replacement
        >>> b[23:28] = []      # Make a deletion
        >>> b[30] += 'y'       # Make another replacement
        >>> pprint(list(SequenceMatcher(None,a,b).get_grouped_opcodes()))
        [[('equal', 5, 8, 5, 8), ('insert', 8, 8, 8, 9), ('equal', 8, 11, 9, 12)],
         [('equal', 16, 19, 17, 20),
          ('replace', 19, 20, 20, 21),
          ('equal', 20, 22, 21, 23),
          ('delete', 22, 27, 23, 23),
          ('equal', 27, 30, 23, 26)],
         [('equal', 31, 34, 27, 30),
          ('replace', 34, 35, 30, 31),
          ('equal', 35, 38, 31, 34)]]
        """

        codes = self.get_opcodes()
        if not codes:
            codes = [("equal", 0, 1, 0, 1)]
        # Fixup leading and trailing groups if they show no changes.
        if codes[0][0] == 'equal':
            tag, i1, i2, j1, j2 = codes[0]
            codes[0] = tag, max(i1, i2-n), i2, max(j1, j2-n), j2
        if codes[-1][0] == 'equal':
            tag, i1, i2, j1, j2 = codes[-1]
            codes[-1] = tag, i1, min(i2, i1+n), j1, min(j2, j1+n)

        nn = n + n
        group = []
        for tag, i1, i2, j1, j2 in codes:
            # End the current group and start a new one whenever
            # there is a large range with no changes.
            if tag == 'equal' and i2-i1 > nn:
                group.append((tag, i1, min(i2, i1+n), j1, min(j2, j1+n)))
                yield group
                group = []
                i1, j1 = max(i1, i2-n), max(j1, j2-n)
            group.append((tag, i1, i2, j1 ,j2))
        if group and not (len(group)==1 and group[0][0] == 'equal'):
            yield group

    def ratio(self):
        """Return a measure of the sequences' similarity (float in [0,1]).

        Where T is the total number of elements in both sequences, and
        M is the number of matches, this is 2.0*M / T.
        Note that this is 1 if the sequences are identical, and 0 if
        they have nothing in common.

        .ratio() is expensive to compute if you haven't already computed
        .get_matching_blocks() or .get_opcodes(), in which case you may
        want to try .quick_ratio() or .real_quick_ratio() first to get an
        upper bound.

        >>> s = SequenceMatcher(None, "abcd", "bcde")
        >>> s.ratio()
        0.75
        >>> s.quick_ratio()
        0.75
        >>> s.real_quick_ratio()
        1.0
        """

        matches = reduce(lambda sum, triple: sum + triple[-1],
                         self.get_matching_blocks(), 0)
        return _calculate_ratio(matches, len(self.a) + len(self.b))

    def quick_ratio(self):
        """Return an upper bound on ratio() relatively quickly.

        This isn't defined beyond that it is an upper bound on .ratio(), and
        is faster to compute.
        """

        # viewing a and b as multisets, set matches to the cardinality
        # of their intersection; this counts the number of matches
        # without regard to order, so is clearly an upper bound
        if self.fullbcount is None:
            self.fullbcount = fullbcount = {}
            for elt in self.b:
                fullbcount[elt] = fullbcount.get(elt, 0) + 1
        fullbcount = self.fullbcount
        # avail[x] is the number of times x appears in 'b' less the
        # number of times we've seen it in 'a' so far ... kinda
        avail = {}
        availhas, matches = avail.__contains__, 0
        for elt in self.a:
            if availhas(elt):
                numb = avail[elt]
            else:
                numb = fullbcount.get(elt, 0)
            avail[elt] = numb - 1
            if numb > 0:
                matches = matches + 1
        return _calculate_ratio(matches, len(self.a) + len(self.b))

    def real_quick_ratio(self):
        """Return an upper bound on ratio() very quickly.

        This isn't defined beyond that it is an upper bound on .ratio(), and
        is faster to compute than either .ratio() or .quick_ratio().
        """

        la, lb = len(self.a), len(self.b)
        # can't have more matches than the number of elements in the
        # shorter sequence
        return _calculate_ratio(min(la, lb), la + lb)

def get_close_matches(word, possibilities, n=3, cutoff=0.6):
    """Use SequenceMatcher to return list of the best "good enough" matches.

    word is a sequence for which close matches are desired (typically a
    string).

    possibilities is a list of sequences against which to match word
    (typically a list of strings).

    Optional arg n (default 3) is the maximum number of close matches to
    return.  n must be > 0.

    Optional arg cutoff (default 0.6) is a float in [0, 1].  Possibilities
    that don't score at least that similar to word are ignored.

    The best (no more than n) matches among the possibilities are returned
    in a list, sorted by similarity score, most similar first.

    >>> get_close_matches("appel", ["ape", "apple", "peach", "puppy"])
    ['apple', 'ape']
    >>> import keyword as _keyword
    >>> get_close_matches("wheel", _keyword.kwlist)
    ['while']
    >>> get_close_matches("apple", _keyword.kwlist)
    []
    >>> get_close_matches("accept", _keyword.kwlist)
    ['except']
    """

    if not n >  0:
        raise ValueError("n must be > 0: %r" % (n,))
    if not 0.0 <= cutoff <= 1.0:
        raise ValueError("cutoff must be in [0.0, 1.0]: %r" % (cutoff,))
    result = []
    s = SequenceMatcher()
    s.set_seq2(word)
    for x in possibilities:
        s.set_seq1(x)
        if s.real_quick_ratio() >= cutoff and \
           s.quick_ratio() >= cutoff and \
           s.ratio() >= cutoff:
            result.append((s.ratio(), x))

    # Move the best scorers to head of list
    result = heapq.nlargest(n, result)
    # Strip scores for the best n matches
    return [x for score, x in result]

def _count_leading(line, ch):
    """
    Return number of `ch` characters at the start of `line`.

    Example:

    >>> _count_leading('   abc', ' ')
    3
    """

    i, n = 0, len(line)
    while i < n and line[i] == ch:
        i += 1
    return i

class Differ:
    r"""
    Differ is a class for comparing sequences of lines of text, and
    producing human-readable differences or deltas.  Differ uses
    SequenceMatcher both to compare sequences of lines, and to compare
    sequences of characters within similar (near-matching) lines.

    Each line of a Differ delta begins with a two-letter code:

        '- '    line unique to sequence 1
        '+ '    line unique to sequence 2
        '  '    line common to both sequences
        '? '    line not present in either input sequence

    Lines beginning with '? ' attempt to guide the eye to intraline
    differences, and were not present in either input sequence.  These lines
    can be confusing if the sequences contain tab characters.

    Note that Differ makes no claim to produce a *minimal* diff.  To the
    contrary, minimal diffs are often counter-intuitive, because they synch
    up anywhere possible, sometimes accidental matches 100 pages apart.
    Restricting synch points to contiguous matches preserves some notion of
    locality, at the occasional cost of producing a longer diff.

    Example: Comparing two texts.

    First we set up the texts, sequences of individual single-line strings
    ending with newlines (such sequences can also be obtained from the
    `readlines()` method of file-like objects):

    >>> text1 = '''  1. Beautiful is better than ugly.
    ...   2. Explicit is better than implicit.
    ...   3. Simple is better than complex.
    ...   4. Complex is better than complicated.
    ... '''.splitlines(1)
    >>> len(text1)
    4
    >>> text1[0][-1]
    '\n'
    >>> text2 = '''  1. Beautiful is better than ugly.
    ...   3.   Simple is better than complex.
    ...   4. Complicated is better than complex.
    ...   5. Flat is better than nested.
    ... '''.splitlines(1)

    Next we instantiate a Differ object:

    >>> d = Differ()

    Note that when instantiating a Differ object we may pass functions to
    filter out line and character 'junk'.  See Differ.__init__ for details.

    Finally, we compare the two:

    >>> result = list(d.compare(text1, text2))

    'result' is a list of strings, so let's pretty-print it:

    >>> from pprint import pprint as _pprint
    >>> _pprint(result)
    ['    1. Beautiful is better than ugly.\n',
     '-   2. Explicit is better than implicit.\n',
     '-   3. Simple is better than complex.\n',
     '+   3.   Simple is better than complex.\n',
     '?     ++\n',
     '-   4. Complex is better than complicated.\n',
     '?            ^                     ---- ^\n',
     '+   4. Complicated is better than complex.\n',
     '?           ++++ ^                      ^\n',
     '+   5. Flat is better than nested.\n']

    As a single multi-line string it looks like this:

    >>> print ''.join(result),
        1. Beautiful is better than ugly.
    -   2. Explicit is better than implicit.
    -   3. Simple is better than complex.
    +   3.   Simple is better than complex.
    ?     ++
    -   4. Complex is better than complicated.
    ?            ^                     ---- ^
    +   4. Complicated is better than complex.
    ?           ++++ ^                      ^
    +   5. Flat is better than nested.

    Methods:

    __init__(linejunk=None, charjunk=None)
        Construct a text differencer, with optional filters.

    compare(a, b)
        Compare two sequences of lines; generate the resulting delta.
    """

    def __init__(self, linejunk=None, charjunk=None):
        """
        Construct a text differencer, with optional filters.

        The two optional keyword parameters are for filter functions:

        - `linejunk`: A function that should accept a single string argument,
          and return true iff the string is junk. The module-level function
          `IS_LINE_JUNK` may be used to filter out lines without visible
          characters, except for at most one splat ('#').  It is recommended
          to leave linejunk None; as of Python 2.3, the underlying
          SequenceMatcher class has grown an adaptive notion of "noise" lines
          that's better than any static definition the author has ever been
          able to craft.

        - `charjunk`: A function that should accept a string of length 1. The
          module-level function `IS_CHARACTER_JUNK` may be used to filter out
          whitespace characters (a blank or tab; **note**: bad idea to include
          newline in this!).  Use of IS_CHARACTER_JUNK is recommended.
        """

        self.linejunk = linejunk
        self.charjunk = charjunk

    def compare(self, a, b):
        r"""
        Compare two sequences of lines; generate the resulting delta.

        Each sequence must contain individual single-line strings ending with
        newlines. Such sequences can be obtained from the `readlines()` method
        of file-like objects.  The delta generated also consists of newline-
        terminated strings, ready to be printed as-is via the writeline()
        method of a file-like object.

        Example:

        >>> print ''.join(Differ().compare('one\ntwo\nthree\n'.splitlines(1),
        ...                                'ore\ntree\nemu\n'.splitlines(1))),
        - one
        ?  ^
        + ore
        ?  ^
        - two
        - three
        ?  -
        + tree
        + emu
        """

        cruncher = SequenceMatcher(self.linejunk, a, b)
        for tag, alo, ahi, blo, bhi in cruncher.get_opcodes():
            if tag == 'replace':
                g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
            elif tag == 'delete':
                g = self._dump('-', a, alo, ahi)
            elif tag == 'insert':
                g = self._dump('+', b, blo, bhi)
            elif tag == 'equal':
                g = self._dump(' ', a, alo, ahi)
            else:
                raise ValueError, 'unknown tag %r' % (tag,)

            for line in g:
                yield line

    def _dump(self, tag, x, lo, hi):
        """Generate comparison results for a same-tagged range."""
        for i in xrange(lo, hi):
            yield '%s %s' % (tag, x[i])

    def _plain_replace(self, a, alo, ahi, b, blo, bhi):
        assert alo < ahi and blo < bhi
        # dump the shorter block first -- reduces the burden on short-term
        # memory if the blocks are of very different sizes
        if bhi - blo < ahi - alo:
            first  = self._dump('+', b, blo, bhi)
            second = self._dump('-', a, alo, ahi)
        else:
            first  = self._dump('-', a, alo, ahi)
            second = self._dump('+', b, blo, bhi)

        for g in first, second:
            for line in g:
                yield line

    def _fancy_replace(self, a, alo, ahi, b, blo, bhi):
        r"""
        When replacing one block of lines with another, search the blocks
        for *similar* lines; the best-matching pair (if any) is used as a
        synch point, and intraline difference marking is done on the
        similar pair. Lots of work, but often worth it.

        Example:

        >>> d = Differ()
        >>> results = d._fancy_replace(['abcDefghiJkl\n'], 0, 1,
        ...                            ['abcdefGhijkl\n'], 0, 1)
        >>> print ''.join(results),
        - abcDefghiJkl
        ?    ^  ^  ^
        + abcdefGhijkl
        ?    ^  ^  ^
        """

        # don't synch up unless the lines have a similarity score of at
        # least cutoff; best_ratio tracks the best score seen so far
        best_ratio, cutoff = 0.74, 0.75
        cruncher = SequenceMatcher(self.charjunk)
        eqi, eqj = None, None   # 1st indices of equal lines (if any)

        # search for the pair that matches best without being identical
        # (identical lines must be junk lines, & we don't want to synch up
        # on junk -- unless we have to)
        for j in xrange(blo, bhi):
            bj = b[j]
            cruncher.set_seq2(bj)
            for i in xrange(alo, ahi):
                ai = a[i]
                if ai == bj:
                    if eqi is None:
                        eqi, eqj = i, j
                    continue
                cruncher.set_seq1(ai)
                # computing similarity is expensive, so use the quick
                # upper bounds first -- have seen this speed up messy
                # compares by a factor of 3.
                # note that ratio() is only expensive to compute the first
                # time it's called on a sequence pair; the expensive part
                # of the computation is cached by cruncher
                if cruncher.real_quick_ratio() > best_ratio and \
                      cruncher.quick_ratio() > best_ratio and \
                      cruncher.ratio() > best_ratio:
                    best_ratio, best_i, best_j = cruncher.ratio(), i, j
        if best_ratio < cutoff:
            # no non-identical "pretty close" pair
            if eqi is None:
                # no identical pair either -- treat it as a straight replace
                for line in self._plain_replace(a, alo, ahi, b, blo, bhi):
                    yield line
                return
            # no close pair, but an identical pair -- synch up on that
            best_i, best_j, best_ratio = eqi, eqj, 1.0
        else:
            # there's a close pair, so forget the identical pair (if any)
            eqi = None

        # a[best_i] very similar to b[best_j]; eqi is None iff they're not
        # identical

        # pump out diffs from before the synch point
        for line in self._fancy_helper(a, alo, best_i, b, blo, best_j):
            yield line

        # do intraline marking on the synch pair
        aelt, belt = a[best_i], b[best_j]
        if eqi is None:
            # pump out a '-', '?', '+', '?' quad for the synched lines
            atags = btags = ""
            cruncher.set_seqs(aelt, belt)
            for tag, ai1, ai2, bj1, bj2 in cruncher.get_opcodes():
                la, lb = ai2 - ai1, bj2 - bj1
                if tag == 'replace':
                    atags += '^' * la
                    btags += '^' * lb
                elif tag == 'delete':
                    atags += '-' * la
                elif tag == 'insert':
                    btags += '+' * lb
                elif tag == 'equal':
                    atags += ' ' * la
                    btags += ' ' * lb
                else:
                    raise ValueError, 'unknown tag %r' % (tag,)
            for line in self._qformat(aelt, belt, atags, btags):
                yield line
        else:
            # the synch pair is identical
            yield '  ' + aelt

        # pump out diffs from after the synch point
        for line in self._fancy_helper(a, best_i+1, ahi, b, best_j+1, bhi):
            yield line

    def _fancy_helper(self, a, alo, ahi, b, blo, bhi):
        g = []
        if alo < ahi:
            if blo < bhi:
                g = self._fancy_replace(a, alo, ahi, b, blo, bhi)
            else:
                g = self._dump('-', a, alo, ahi)
        elif blo < bhi:
            g = self._dump('+', b, blo, bhi)

        for line in g:
            yield line

    def _qformat(self, aline, bline, atags, btags):
        r"""
        Format "?" output and deal with leading tabs.

        Example:

        >>> d = Differ()
        >>> results = d._qformat('\tabcDefghiJkl\n', '\tabcdefGhijkl\n',
        ...                      '  ^ ^  ^      ', '  ^ ^  ^      ')
        >>> for line in results: print repr(line)
        ...
        '- \tabcDefghiJkl\n'
        '? \t ^ ^  ^\n'
        '+ \tabcdefGhijkl\n'
        '? \t ^ ^  ^\n'
        """

        # Can hurt, but will probably help most of the time.
        common = min(_count_leading(aline, "\t"),
                     _count_leading(bline, "\t"))
        common = min(common, _count_leading(atags[:common], " "))
        common = min(common, _count_leading(btags[:common], " "))
        atags = atags[common:].rstrip()
        btags = btags[common:].rstrip()

        yield "- " + aline
        if atags:
            yield "? %s%s\n" % ("\t" * common, atags)

        yield "+ " + bline
        if btags:
            yield "? %s%s\n" % ("\t" * common, btags)

# With respect to junk, an earlier version of ndiff simply refused to
# *start* a match with a junk element.  The result was cases like this:
#     before: private Thread currentThread;
#     after:  private volatile Thread currentThread;
# If you consider whitespace to be junk, the longest contiguous match
# not starting with junk is "e Thread currentThread".  So ndiff reported
# that "e volatil" was inserted between the 't' and the 'e' in "private".
# While an accurate view, to people that's absurd.  The current version
# looks for matching blocks that are entirely junk-free, then extends the
# longest one of those as far as possible but only with matching junk.
# So now "currentThread" is matched, then extended to suck up the
# preceding blank; then "private" is matched, and extended to suck up the
# following blank; then "Thread" is matched; and finally ndiff reports
# that "volatile " was inserted before "Thread".  The only quibble
# remaining is that perhaps it was really the case that " volatile"
# was inserted after "private".  I can live with that <wink>.

import re

def IS_LINE_JUNK(line, pat=re.compile(r"\s*#?\s*$").match):
    r"""
    Return 1 for ignorable line: iff `line` is blank or contains a single '#'.

    Examples:

    >>> IS_LINE_JUNK('\n')
    True
    >>> IS_LINE_JUNK('  #   \n')
    True
    >>> IS_LINE_JUNK('hello\n')
    False
    """

    return pat(line) is not None

def IS_CHARACTER_JUNK(ch, ws=" \t"):
    r"""
    Return 1 for ignorable character: iff `ch` is a space or tab.

    Examples:

    >>> IS_CHARACTER_JUNK(' ')
    True
    >>> IS_CHARACTER_JUNK('\t')
    True
    >>> IS_CHARACTER_JUNK('\n')
    False
    >>> IS_CHARACTER_JUNK('x')
    False
    """

    return ch in ws


def unified_diff(a, b, fromfile='', tofile='', fromfiledate='',
                 tofiledate='', n=3, lineterm='\n'):
    r"""
    Compare two sequences of lines; generate the delta as a unified diff.

    Unified diffs are a compact way of showing line changes and a few
    lines of context.  The number of context lines is set by 'n' which
    defaults to three.

    By default, the diff control lines (those with ---, +++, or @@) are
    created with a trailing newline.  This is helpful so that inputs
    created from file.readlines() result in diffs that are suitable for
    file.writelines() since both the inputs and outputs have trailing
    newlines.

    For inputs that do not have trailing newlines, set the lineterm
    argument to "" so that the output will be uniformly newline free.

    The unidiff format normally has a header for filenames and modification
    times.  Any or all of these may be specified using strings for
    'fromfile', 'tofile', 'fromfiledate', and 'tofiledate'.  The modification
    times are normally expressed in the format returned by time.ctime().

    Example:

    >>> for line in unified_diff('one two three four'.split(),
    ...             'zero one tree four'.split(), 'Original', 'Current',
    ...             'Sat Jan 26 23:30:50 1991', 'Fri Jun 06 10:20:52 2003',
    ...             lineterm=''):
    ...     print line
    --- Original Sat Jan 26 23:30:50 1991
    +++ Current Fri Jun 06 10:20:52 2003
    @@ -1,4 +1,4 @@
    +zero
     one
    -two
    -three
    +tree
     four
    """

    started = False
    for group in SequenceMatcher(None,a,b).get_grouped_opcodes(n):
        if not started:
            yield '--- %s %s%s' % (fromfile, fromfiledate, lineterm)
            yield '+++ %s %s%s' % (tofile, tofiledate, lineterm)
            started = True
        i1, i2, j1, j2 = group[0][1], group[-1][2], group[0][3], group[-1][4]
        yield "@@ -%d,%d +%d,%d @@%s" % (i1+1, i2-i1, j1+1, j2-j1, lineterm)
        for tag, i1, i2, j1, j2 in group:
            if tag == 'equal':
                for line in a[i1:i2]:
                    yield ' ' + line
                continue
            if tag == 'replace' or tag == 'delete':
                for line in a[i1:i2]:
                    yield '-' + line
            if tag == 'replace' or tag == 'insert':
                for line in b[j1:j2]:
                    yield '+' + line

# See http://www.unix.org/single_unix_specification/
def context_diff(a, b, fromfile='', tofile='',
                 fromfiledate='', tofiledate='', n=3, lineterm='\n'):
    r"""
    Compare two sequences of lines; generate the delta as a context diff.

    Context diffs are a compact way of showing line changes and a few
    lines of context.  The number of context lines is set by 'n' which
    defaults to three.

    By default, the diff control lines (those with *** or ---) are
    created with a trailing newline.  This is helpful so that inputs
    created from file.readlines() result in diffs that are suitable for
    file.writelines() since both the inputs and outputs have trailing
    newlines.

    For inputs that do not have trailing newlines, set the lineterm
    argument to "" so that the output will be uniformly newline free.

    The context diff format normally has a header for filenames and
    modification times.  Any or all of these may be specified using
    strings for 'fromfile', 'tofile', 'fromfiledate', and 'tofiledate'.
    The modification times are normally expressed in the format returned
    by time.ctime().  If not specified, the strings default to blanks.

    Example:

    >>> print ''.join(context_diff('one\ntwo\nthree\nfour\n'.splitlines(1),
    ...       'zero\none\ntree\nfour\n'.splitlines(1), 'Original', 'Current',
    ...       'Sat Jan 26 23:30:50 1991', 'Fri Jun 06 10:22:46 2003')),
    *** Original Sat Jan 26 23:30:50 1991
    --- Current Fri Jun 06 10:22:46 2003
    ***************
    *** 1,4 ****
      one
    ! two
    ! three
      four
    --- 1,4 ----
    + zero
      one
    ! tree
      four
    """

    started = False
    prefixmap = {'insert':'+ ', 'delete':'- ', 'replace':'! ', 'equal':'  '}
    for group in SequenceMatcher(None,a,b).get_grouped_opcodes(n):
        if not started:
            yield '*** %s %s%s' % (fromfile, fromfiledate, lineterm)
            yield '--- %s %s%s' % (tofile, tofiledate, lineterm)
            started = True

        yield '***************%s' % (lineterm,)
        if group[-1][2] - group[0][1] >= 2:
            yield '*** %d,%d ****%s' % (group[0][1]+1, group[-1][2], lineterm)
        else:
            yield '*** %d ****%s' % (group[-1][2], lineterm)
        visiblechanges = [e for e in group if e[0] in ('replace', 'delete')]
        if visiblechanges:
            for tag, i1, i2, _, _ in group:
                if tag != 'insert':
                    for line in a[i1:i2]:
                        yield prefixmap[tag] + line

        if group[-1][4] - group[0][3] >= 2:
            yield '--- %d,%d ----%s' % (group[0][3]+1, group[-1][4], lineterm)
        else:
            yield '--- %d ----%s' % (group[-1][4], lineterm)
        visiblechanges = [e for e in group if e[0] in ('replace', 'insert')]
        if visiblechanges:
            for tag, _, _, j1, j2 in group:
                if tag != 'delete':
                    for line in b[j1:j2]:
                        yield prefixmap[tag] + line

def ndiff(a, b, linejunk=None, charjunk=IS_CHARACTER_JUNK):
    r"""
    Compare `a` and `b` (lists of strings); return a `Differ`-style delta.

    Optional keyword parameters `linejunk` and `charjunk` are for filter
    functions (or None):

    - linejunk: A function that should accept a single string argument, and
      return true iff the string is junk.  The default is None, and is
      recommended; as of Python 2.3, an adaptive notion of "noise" lines is
      used that does a good job on its own.

    - charjunk: A function that should accept a string of length 1. The
      default is module-level function IS_CHARACTER_JUNK, which filters out
      whitespace characters (a blank or tab; note: bad idea to include newline
      in this!).

    Tools/scripts/ndiff.py is a command-line front-end to this function.

    Example:

    >>> diff = ndiff('one\ntwo\nthree\n'.splitlines(1),
    ...              'ore\ntree\nemu\n'.splitlines(1))
    >>> print ''.join(diff),
    - one
    ?  ^
    + ore
    ?  ^
    - two
    - three
    ?  -
    + tree
    + emu
    """
    return Differ(linejunk, charjunk).compare(a, b)

def _mdiff(fromlines, tolines, context=None, linejunk=None,
           charjunk=IS_CHARACTER_JUNK):
    r"""Returns generator yielding marked up from/to side by side differences.

    Arguments:
    fromlines -- list of text lines to compared to tolines
    tolines -- list of text lines to be compared to fromlines
    context -- number of context lines to display on each side of difference,
               if None, all from/to text lines will be generated.
    linejunk -- passed on to ndiff (see ndiff documentation)
    charjunk -- passed on to ndiff (see ndiff documentation)

    This function returns an interator which returns a tuple:
    (from line tuple, to line tuple, boolean flag)

    from/to line tuple -- (line num, line text)
        line num -- integer or None (to indicate a context separation)
        line text -- original line text with following markers inserted:
            '\0+' -- marks start of added text
            '\0-' -- marks start of deleted text
            '\0^' -- marks start of changed text
            '\1' -- marks end of added/deleted/changed text

    boolean flag -- None indicates context separation, True indicates
        either "from" or "to" line contains a change, otherwise False.

    This function/iterator was originally developed to generate side by side
    file difference for making HTML pages (see HtmlDiff class for example
    usage).

    Note, this function utilizes the ndiff function to generate the side by
    side difference markup.  Optional ndiff arguments may be passed to this
    function and they in turn will be passed to ndiff.
    """
    import re

    # regular expression for finding intraline change indices
    change_re = re.compile('(\++|\-+|\^+)')

    # create the difference iterator to generate the differences
    diff_lines_iterator = ndiff(fromlines,tolines,linejunk,charjunk)

    def _make_line(lines, format_key, side, num_lines=[0,0]):
        """Returns line of text with user's change markup and line formatting.

        lines -- list of lines from the ndiff generator to produce a line of
                 text from.  When producing the line of text to return, the
                 lines used are removed from this list.
        format_key -- '+' return first line in list with "add" markup around
                          the entire line.
                      '-' return first line in list with "delete" markup around
                          the entire line.
                      '?' return first line in list with add/delete/change
                          intraline markup (indices obtained from second line)
                      None return first line in list with no markup
        side -- indice into the num_lines list (0=from,1=to)
        num_lines -- from/to current line number.  This is NOT intended to be a
                     passed parameter.  It is present as a keyword argument to
                     maintain memory of the current line numbers between calls
                     of this function.

        Note, this function is purposefully not defined at the module scope so
        that data it needs from its parent function (within whose context it
        is defined) does not need to be of module scope.
        """
        num_lines[side] += 1
        # Handle case where no user markup is to be added, just return line of
        # text with user's line format to allow for usage of the line number.
        if format_key is None:
            return (num_lines[side],lines.pop(0)[2:])
        # Handle case of intraline changes
        if format_key == '?':
            text, markers = lines.pop(0), lines.pop(0)
            # find intraline changes (store change type and indices in tuples)
            sub_info = []
            def record_sub_info(match_object,sub_info=sub_info):
                sub_info.append([match_object.group(1)[0],match_object.span()])
                return match_object.group(1)
            change_re.sub(record_sub_info,markers)
            # process each tuple inserting our special marks that won't be
            # noticed by an xml/html escaper.
            for key,(begin,end) in sub_info[::-1]:
                text = text[0:begin]+'\0'+key+text[begin:end]+'\1'+text[end:]
            text = text[2:]
        # Handle case of add/delete entire line
        else:
            text = lines.pop(0)[2:]
            # if line of text is just a newline, insert a space so there is
            # something for the user to highlight and see.
            if not text:
                text = ' '
            # insert marks that won't be noticed by an xml/html escaper.
            text = '\0' + format_key + text + '\1'
        # Return line of text, first allow user's line formatter to do its
        # thing (such as adding the line number) then replace the special
        # marks with what the user's change markup.
        return (num_lines[side],text)

    def _line_iterator():
        """Yields from/to lines of text with a change indication.

        This function is an iterator.  It itself pulls lines from a
        differencing iterator, processes them and yields them.  When it can
        it yields both a "from" and a "to" line, otherwise it will yield one
        or the other.  In addition to yielding the lines of from/to text, a
        boolean flag is yielded to indicate if the text line(s) have
        differences in them.

        Note, this function is purposefully not defined at the module scope so
        that data it needs from its parent function (within whose context it
        is defined) does not need to be of module scope.
        """
        lines = []
        num_blanks_pending, num_blanks_to_yield = 0, 0
        while True:
            # Load up next 4 lines so we can look ahead, create strings which
            # are a concatenation of the first character of each of the 4 lines
            # so we can do some very readable comparisons.
            while len(lines) < 4:
                try:
                    lines.append(diff_lines_iterator.next())
                except StopIteration:
                    lines.append('X')
            s = ''.join([line[0] for line in lines])
            if s.startswith('X'):
                # When no more lines, pump out any remaining blank lines so the
                # corresponding add/delete lines get a matching blank line so
                # all line pairs get yielded at the next level.
                num_blanks_to_yield = num_blanks_pending
            elif s.startswith('-?+?'):
                # simple intraline change
                yield _make_line(lines,'?',0), _make_line(lines,'?',1), True
                continue
            elif s.startswith('--++'):
                # in delete block, add block coming: we do NOT want to get
                # caught up on blank lines yet, just process the delete line
                num_blanks_pending -= 1
                yield _make_line(lines,'-',0), None, True
                continue
            elif s.startswith(('--?+', '--+', '- ')):
                # in delete block and see a intraline change or unchanged line
                # coming: yield the delete line and then blanks
                from_line,to_line = _make_line(lines,'-',0), None
                num_blanks_to_yield,num_blanks_pending = num_blanks_pending-1,0
            elif s.startswith('-+?'):
                # intraline change
                yield _make_line(lines,None,0), _make_line(lines,'?',1), True
                continue
            elif s.startswith('-?+'):
                # intraline change
                yield _make_line(lines,'?',0), _make_line(lines,None,1), True
                continue
            elif s.startswith('-'):
                # delete FROM line
                num_blanks_pending -= 1
                yield _make_line(lines,'-',0), None, True
                continue
            elif s.startswith('+--'):
                # in add block, delete block coming: we do NOT want to get
                # caught up on blank lines yet, just process the add line
                num_blanks_pending += 1
                yield None, _make_line(lines,'+',1), True
                continue
            elif s.startswith(('+ ', '+-')):
                # will be leaving an add block: yield blanks then add line
                from_line, to_line = None, _make_line(lines,'+',1)
                num_blanks_to_yield,num_blanks_pending = num_blanks_pending+1,0
            elif s.startswith('+'):
                # inside an add block, yield the add line
                num_blanks_pending += 1
                yield None, _make_line(lines,'+',1), True
                continue
            elif s.startswith(' '):
                # unchanged text, yield it to both sides
                yield _make_line(lines[:],None,0),_make_line(lines,None,1),False
                continue
            # Catch up on the blank lines so when we yield the next from/to
            # pair, they are lined up.
            while(num_blanks_to_yield < 0):
                num_blanks_to_yield += 1
                yield None,('','\n'),True
            while(num_blanks_to_yield > 0):
                num_blanks_to_yield -= 1
                yield ('','\n'),None,True
            if s.startswith('X'):
                raise StopIteration
            else:
                yield from_line,to_line,True

    def _line_pair_iterator():
        """Yields from/to lines of text with a change indication.

        This function is an iterator.  It itself pulls lines from the line
        iterator.  Its difference from that iterator is that this function
        always yields a pair of from/to text lines (with the change
        indication).  If necessary it will collect single from/to lines
        until it has a matching pair from/to pair to yield.

        Note, this function is purposefully not defined at the module scope so
        that data it needs from its parent function (within whose context it
        is defined) does not need to be of module scope.
        """
        line_iterator = _line_iterator()
        fromlines,tolines=[],[]
        while True:
            # Collecting lines of text until we have a from/to pair
            while (len(fromlines)==0 or len(tolines)==0):
                from_line, to_line, found_diff =line_iterator.next()
                if from_line is not None:
                    fromlines.append((from_line,found_diff))
                if to_line is not None:
                    tolines.append((to_line,found_diff))
            # Once we have a pair, remove them from the collection and yield it
            from_line, fromDiff = fromlines.pop(0)
            to_line, to_diff = tolines.pop(0)
            yield (from_line,to_line,fromDiff or to_diff)

    # Handle case where user does not want context differencing, just yield
    # them up without doing anything else with them.
    line_pair_iterator = _line_pair_iterator()
    if context is None:
        while True:
            yield line_pair_iterator.next()
    # Handle case where user wants context differencing.  We must do some
    # storage of lines until we know for sure that they are to be yielded.
    else:
        context += 1
        lines_to_write = 0
        while True:
            # Store lines up until we find a difference, note use of a
            # circular queue because we only need to keep around what
            # we need for context.
            index, contextLines = 0, [None]*(context)
            found_diff = False
            while(found_diff is False):
                from_line, to_line, found_diff = line_pair_iterator.next()
                i = index % context
                contextLines[i] = (from_line, to_line, found_diff)
                index += 1
            # Yield lines that we have collected so far, but first yield
            # the user's separator.
            if index > context:
                yield None, None, None
                lines_to_write = context
            else:
                lines_to_write = index
                index = 0
            while(lines_to_write):
                i = index % context
                index += 1
                yield contextLines[i]
                lines_to_write -= 1
            # Now yield the context lines after the change
            lines_to_write = context-1
            while(lines_to_write):
                from_line, to_line, found_diff = line_pair_iterator.next()
                # If another change within the context, extend the context
                if found_diff:
                    lines_to_write = context-1
                else:
                    lines_to_write -= 1
                yield from_line, to_line, found_diff


_file_template = """
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
          "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

<html>

<head>
    <meta http-equiv="Content-Type"
          content="text/html; charset=ISO-8859-1" />
    <title></title>
    <style type="text/css">%(styles)s
    </style>
</head>

<body>
    %(table)s%(legend)s
</body>

</html>"""

_styles = """
        table.diff {font-family:Courier; border:medium;}
        .diff_header {background-color:#e0e0e0}
        td.diff_header {text-align:right}
        .diff_next {background-color:#c0c0c0}
        .diff_add {background-color:#aaffaa}
        .diff_chg {background-color:#ffff77}
        .diff_sub {background-color:#ffaaaa}"""

_table_template = """
    <table class="diff" id="difflib_chg_%(prefix)s_top"
           cellspacing="0" cellpadding="0" rules="groups" >
        <colgroup></colgroup> <colgroup></colgroup> <colgroup></colgroup>
        <colgroup></colgroup> <colgroup></colgroup> <colgroup></colgroup>
        %(header_row)s
        <tbody>
%(data_rows)s        </tbody>
    </table>"""

_legend = """
    <table class="diff" summary="Legends">
        <tr> <th colspan="2"> Legends </th> </tr>
        <tr> <td> <table border="" summary="Colors">
                      <tr><th> Colors </th> </tr>
                      <tr><td class="diff_add">&nbsp;Added&nbsp;</td></tr>
                      <tr><td class="diff_chg">Changed</td> </tr>
                      <tr><td class="diff_sub">Deleted</td> </tr>
                  </table></td>
             <td> <table border="" summary="Links">
                      <tr><th colspan="2"> Links </th> </tr>
                      <tr><td>(f)irst change</td> </tr>
                      <tr><td>(n)ext change</td> </tr>
                      <tr><td>(t)op</td> </tr>
                  </table></td> </tr>
    </table>"""

class HtmlDiff(object):
    """For producing HTML side by side comparison with change highlights.

    This class can be used to create an HTML table (or a complete HTML file
    containing the table) showing a side by side, line by line comparison
    of text with inter-line and intra-line change highlights.  The table can
    be generated in either full or contextual difference mode.

    The following methods are provided for HTML generation:

    make_table -- generates HTML for a single side by side table
    make_file -- generates complete HTML file with a single side by side table

    See tools/scripts/diff.py for an example usage of this class.
    """

    _file_template = _file_template
    _styles = _styles
    _table_template = _table_template
    _legend = _legend
    _default_prefix = 0

    def __init__(self,tabsize=8,wrapcolumn=None,linejunk=None,
                 charjunk=IS_CHARACTER_JUNK):
        """HtmlDiff instance initializer

        Arguments:
        tabsize -- tab stop spacing, defaults to 8.
        wrapcolumn -- column number where lines are broken and wrapped,
            defaults to None where lines are not wrapped.
        linejunk,charjunk -- keyword arguments passed into ndiff() (used to by
            HtmlDiff() to generate the side by side HTML differences).  See
            ndiff() documentation for argument default values and descriptions.
        """
        self._tabsize = tabsize
        self._wrapcolumn = wrapcolumn
        self._linejunk = linejunk
        self._charjunk = charjunk

    def make_file(self,fromlines,tolines,fromdesc='',todesc='',context=False,
                  numlines=5):
        """Returns HTML file of side by side comparison with change highlights

        Arguments:
        fromlines -- list of "from" lines
        tolines -- list of "to" lines
        fromdesc -- "from" file column header string
        todesc -- "to" file column header string
        context -- set to True for contextual differences (defaults to False
            which shows full differences).
        numlines -- number of context lines.  When context is set True,
            controls number of lines displayed before and after the change.
            When context is False, controls the number of lines to place
            the "next" link anchors before the next change (so click of
            "next" link jumps to just before the change).
        """

        return self._file_template % dict(
            styles = self._styles,
            legend = self._legend,
            table = self.make_table(fromlines,tolines,fromdesc,todesc,
                                    context=context,numlines=numlines))

    def _tab_newline_replace(self,fromlines,tolines):
        """Returns from/to line lists with tabs expanded and newlines removed.

        Instead of tab characters being replaced by the number of spaces
        needed to fill in to the next tab stop, this function will fill
        the space with tab characters.  This is done so that the difference
        algorithms can identify changes in a file when tabs are replaced by
        spaces and vice versa.  At the end of the HTML generation, the tab
        characters will be replaced with a nonbreakable space.
        """
        def expand_tabs(line):
            # hide real spaces
            line = line.replace(' ','\0')
            # expand tabs into spaces
            line = line.expandtabs(self._tabsize)
            # relace spaces from expanded tabs back into tab characters
            # (we'll replace them with markup after we do differencing)
            line = line.replace(' ','\t')
            return line.replace('\0',' ').rstrip('\n')
        fromlines = [expand_tabs(line) for line in fromlines]
        tolines = [expand_tabs(line) for line in tolines]
        return fromlines,tolines

    def _split_line(self,data_list,line_num,text):
        """Builds list of text lines by splitting text lines at wrap point

        This function will determine if the input text line needs to be
        wrapped (split) into separate lines.  If so, the first wrap point
        will be determined and the first line appended to the output
        text line list.  This function is used recursively to handle
        the second part of the split line to further split it.
        """
        # if blank line or context separator, just add it to the output list
        if not line_num:
            data_list.append((line_num,text))
            return

        # if line text doesn't need wrapping, just add it to the output list
        size = len(text)
        max = self._wrapcolumn
        if (size <= max) or ((size -(text.count('\0')*3)) <= max):
            data_list.append((line_num,text))
            return

        # scan text looking for the wrap point, keeping track if the wrap
        # point is inside markers
        i = 0
        n = 0
        mark = ''
        while n < max and i < size:
            if text[i] == '\0':
                i += 1
                mark = text[i]
                i += 1
            elif text[i] == '\1':
                i += 1
                mark = ''
            else:
                i += 1
                n += 1

        # wrap point is inside text, break it up into separate lines
        line1 = text[:i]
        line2 = text[i:]

        # if wrap point is inside markers, place end marker at end of first
        # line and start marker at beginning of second line because each
        # line will have its own table tag markup around it.
        if mark:
            line1 = line1 + '\1'
            line2 = '\0' + mark + line2

        # tack on first line onto the output list
        data_list.append((line_num,line1))

        # use this routine again to wrap the remaining text
        self._split_line(data_list,'>',line2)

    def _line_wrapper(self,diffs):
        """Returns iterator that splits (wraps) mdiff text lines"""

        # pull from/to data and flags from mdiff iterator
        for fromdata,todata,flag in diffs:
            # check for context separators and pass them through
            if flag is None:
                yield fromdata,todata,flag
                continue
            (fromline,fromtext),(toline,totext) = fromdata,todata
            # for each from/to line split it at the wrap column to form
            # list of text lines.
            fromlist,tolist = [],[]
            self._split_line(fromlist,fromline,fromtext)
            self._split_line(tolist,toline,totext)
            # yield from/to line in pairs inserting blank lines as
            # necessary when one side has more wrapped lines
            while fromlist or tolist:
                if fromlist:
                    fromdata = fromlist.pop(0)
                else:
                    fromdata = ('',' ')
                if tolist:
                    todata = tolist.pop(0)
                else:
                    todata = ('',' ')
                yield fromdata,todata,flag

    def _collect_lines(self,diffs):
        """Collects mdiff output into separate lists

        Before storing the mdiff from/to data into a list, it is converted
        into a single line of text with HTML markup.
        """

        fromlist,tolist,flaglist = [],[],[]
        # pull from/to data and flags from mdiff style iterator
        for fromdata,todata,flag in diffs:
            try:
                # store HTML markup of the lines into the lists
                fromlist.append(self._format_line(0,flag,*fromdata))
                tolist.append(self._format_line(1,flag,*todata))
            except TypeError:
                # exceptions occur for lines where context separators go
                fromlist.append(None)
                tolist.append(None)
            flaglist.append(flag)
        return fromlist,tolist,flaglist

    def _format_line(self,side,flag,linenum,text):
        """Returns HTML markup of "from" / "to" text lines

        side -- 0 or 1 indicating "from" or "to" text
        flag -- indicates if difference on line
        linenum -- line number (used for line number column)
        text -- line text to be marked up
        """
        try:
            linenum = '%d' % linenum
            id = ' id="%s%s"' % (self._prefix[side],linenum)
        except TypeError:
            # handle blank lines where linenum is '>' or ''
            id = ''
        # replace those things that would get confused with HTML symbols
        text=text.replace("&","&amp;").replace(">","&gt;").replace("<","&lt;")

        # make space non-breakable so they don't get compressed or line wrapped
        text = text.replace(' ','&nbsp;').rstrip()

        return '<td class="diff_header"%s>%s</td><td nowrap="nowrap">%s</td>' \
               % (id,linenum,text)

    def _make_prefix(self):
        """Create unique anchor prefixes"""

        # Generate a unique anchor prefix so multiple tables
        # can exist on the same HTML page without conflicts.
        fromprefix = "from%d_" % HtmlDiff._default_prefix
        toprefix = "to%d_" % HtmlDiff._default_prefix
        HtmlDiff._default_prefix += 1
        # store prefixes so line format method has access
        self._prefix = [fromprefix,toprefix]

    def _convert_flags(self,fromlist,tolist,flaglist,context,numlines):
        """Makes list of "next" links"""

        # all anchor names will be generated using the unique "to" prefix
        toprefix = self._prefix[1]

        # process change flags, generating middle column of next anchors/links
        next_id = ['']*len(flaglist)
        next_href = ['']*len(flaglist)
        num_chg, in_change = 0, False
        last = 0
        for i,flag in enumerate(flaglist):
            if flag:
                if not in_change:
                    in_change = True
                    last = i
                    # at the beginning of a change, drop an anchor a few lines
                    # (the context lines) before the change for the previous
                    # link
                    i = max([0,i-numlines])
                    next_id[i] = ' id="difflib_chg_%s_%d"' % (toprefix,num_chg)
                    # at the beginning of a change, drop a link to the next
                    # change
                    num_chg += 1
                    next_href[last] = '<a href="#difflib_chg_%s_%d">n</a>' % (
                         toprefix,num_chg)
            else:
                in_change = False
        # check for cases where there is no content to avoid exceptions
        if not flaglist:
            flaglist = [False]
            next_id = ['']
            next_href = ['']
            last = 0
            if context:
                fromlist = ['<td></td><td>&nbsp;No Differences Found&nbsp;</td>']
                tolist = fromlist
            else:
                fromlist = tolist = ['<td></td><td>&nbsp;Empty File&nbsp;</td>']
        # if not a change on first line, drop a link
        if not flaglist[0]:
            next_href[0] = '<a href="#difflib_chg_%s_0">f</a>' % toprefix
        # redo the last link to link to the top
        next_href[last] = '<a href="#difflib_chg_%s_top">t</a>' % (toprefix)

        return fromlist,tolist,flaglist,next_href,next_id

    def make_table(self,fromlines,tolines,fromdesc='',todesc='',context=False,
                   numlines=5):
        """Returns HTML table of side by side comparison with change highlights

        Arguments:
        fromlines -- list of "from" lines
        tolines -- list of "to" lines
        fromdesc -- "from" file column header string
        todesc -- "to" file column header string
        context -- set to True for contextual differences (defaults to False
            which shows full differences).
        numlines -- number of context lines.  When context is set True,
            controls number of lines displayed before and after the change.
            When context is False, controls the number of lines to place
            the "next" link anchors before the next change (so click of
            "next" link jumps to just before the change).
        """

        # make unique anchor prefixes so that multiple tables may exist
        # on the same page without conflict.
        self._make_prefix()

        # change tabs to spaces before it gets more difficult after we insert
        # markkup
        fromlines,tolines = self._tab_newline_replace(fromlines,tolines)

        # create diffs iterator which generates side by side from/to data
        if context:
            context_lines = numlines
        else:
            context_lines = None
        diffs = _mdiff(fromlines,tolines,context_lines,linejunk=self._linejunk,
                      charjunk=self._charjunk)

        # set up iterator to wrap lines that exceed desired width
        if self._wrapcolumn:
            diffs = self._line_wrapper(diffs)

        # collect up from/to lines and flags into lists (also format the lines)
        fromlist,tolist,flaglist = self._collect_lines(diffs)

        # process change flags, generating middle column of next anchors/links
        fromlist,tolist,flaglist,next_href,next_id = self._convert_flags(
            fromlist,tolist,flaglist,context,numlines)

        s = []
        fmt = '            <tr><td class="diff_next"%s>%s</td>%s' + \
              '<td class="diff_next">%s</td>%s</tr>\n'
        for i in range(len(flaglist)):
            if flaglist[i] is None:
                # mdiff yields None on separator lines skip the bogus ones
                # generated for the first line
                if i > 0:
                    s.append('        </tbody>        \n        <tbody>\n')
            else:
                s.append( fmt % (next_id[i],next_href[i],fromlist[i],
                                           next_href[i],tolist[i]))
        if fromdesc or todesc:
            header_row = '<thead><tr>%s%s%s%s</tr></thead>' % (
                '<th class="diff_next"><br /></th>',
                '<th colspan="2" class="diff_header">%s</th>' % fromdesc,
                '<th class="diff_next"><br /></th>',
                '<th colspan="2" class="diff_header">%s</th>' % todesc)
        else:
            header_row = ''

        table = self._table_template % dict(
            data_rows=''.join(s),
            header_row=header_row,
            prefix=self._prefix[1])

        return table.replace('\0+','<span class="diff_add">'). \
                     replace('\0-','<span class="diff_sub">'). \
                     replace('\0^','<span class="diff_chg">'). \
                     replace('\1','</span>'). \
                     replace('\t','&nbsp;')

del re

def restore(delta, which):
    r"""
    Generate one of the two sequences that generated a delta.

    Given a `delta` produced by `Differ.compare()` or `ndiff()`, extract
    lines originating from file 1 or 2 (parameter `which`), stripping off line
    prefixes.

    Examples:

    >>> diff = ndiff('one\ntwo\nthree\n'.splitlines(1),
    ...              'ore\ntree\nemu\n'.splitlines(1))
    >>> diff = list(diff)
    >>> print ''.join(restore(diff, 1)),
    one
    two
    three
    >>> print ''.join(restore(diff, 2)),
    ore
    tree
    emu
    """
    try:
        tag = {1: "- ", 2: "+ "}[int(which)]
    except KeyError:
        raise ValueError, ('unknown delta choice (must be 1 or 2): %r'
                           % which)
    prefixes = ("  ", tag)
    for line in delta:
        if line[:2] in prefixes:
            yield line[2:]

def _test():
    import doctest, difflib
    return doctest.testmod(difflib)

if __name__ == "__main__":
    _test()
N4m3
5!z3
L45t M0d!f!3d
0wn3r / Gr0up
P3Rm!55!0n5
0pt!0n5
..
--
September 02 2020 02:15:09
0 / 0
0555
bsddb
--
October 20 2018 03:04:04
0 / 0
0755
compiler
--
October 20 2018 03:04:04
0 / 0
0755
config
--
October 20 2018 03:04:02
0 / 0
0755
ctypes
--
October 20 2018 03:04:04
0 / 0
0755
curses
--
October 20 2018 03:04:04
0 / 0
0755
distutils
--
October 20 2018 03:04:04
0 / 0
0755
email
--
October 20 2018 03:04:04
0 / 0
0755
encodings
--
October 20 2018 03:04:04
0 / 0
0755
hotshot
--
October 20 2018 03:04:04
0 / 0
0755
idlelib
--
October 20 2018 03:04:04
0 / 0
0755
json
--
October 20 2018 03:04:04
0 / 0
0755
lib-dynload
--
October 20 2018 03:04:03
0 / 0
0755
lib2to3
--
October 20 2018 03:04:04
0 / 0
0755
logging
--
October 20 2018 03:04:04
0 / 0
0755
multiprocessing
--
October 20 2018 03:04:04
0 / 0
0755
plat-linux2
--
October 20 2018 03:04:04
0 / 0
0755
site-packages
--
October 20 2018 03:07:35
0 / 0
0755
sqlite3
--
October 20 2018 03:04:04
0 / 0
0755
test
--
October 20 2018 03:04:04
0 / 0
0755
wsgiref
--
October 20 2018 03:04:04
0 / 0
0755
xml
--
October 20 2018 03:04:04
0 / 0
0755
BaseHTTPServer.py
21.459 KB
November 22 2010 21:03:35
0 / 0
0644
BaseHTTPServer.pyc
21.069 KB
August 18 2016 15:14:32
0 / 0
0644
BaseHTTPServer.pyo
21.069 KB
August 18 2016 15:14:32
0 / 0
0644
Bastion.py
5.609 KB
November 22 2010 21:03:35
0 / 0
0644
Bastion.pyc
6.511 KB
August 18 2016 15:14:32
0 / 0
0644
Bastion.pyo
6.511 KB
August 18 2016 15:14:32
0 / 0
0644
CGIHTTPServer.py
12.474 KB
November 22 2010 21:03:35
0 / 0
0644
CGIHTTPServer.pyc
10.566 KB
August 18 2016 15:14:32
0 / 0
0644
CGIHTTPServer.pyo
10.566 KB
August 18 2016 15:14:32
0 / 0
0644
ConfigParser.py
25.38 KB
November 22 2010 21:03:35
0 / 0
0644
ConfigParser.pyc
23.306 KB
August 18 2016 15:14:32
0 / 0
0644
ConfigParser.pyo
23.306 KB
August 18 2016 15:14:32
0 / 0
0644
Cookie.py
25.046 KB
August 18 2016 15:14:14
0 / 0
0644
Cookie.pyc
21.896 KB
August 18 2016 15:14:32
0 / 0
0644
Cookie.pyo
21.896 KB
August 18 2016 15:14:32
0 / 0
0644
DocXMLRPCServer.py
10.351 KB
November 22 2010 21:03:35
0 / 0
0644
DocXMLRPCServer.pyc
9.724 KB
August 18 2016 15:14:33
0 / 0
0644
DocXMLRPCServer.pyo
9.618 KB
August 18 2016 15:14:38
0 / 0
0644
HTMLParser.py
13.258 KB
November 22 2010 21:03:35
0 / 0
0644
HTMLParser.pyc
11.971 KB
August 18 2016 15:14:33
0 / 0
0644
HTMLParser.pyo
11.67 KB
August 18 2016 15:14:38
0 / 0
0644
MimeWriter.py
6.33 KB
November 22 2010 21:03:35
0 / 0
0644
MimeWriter.pyc
7.21 KB
August 18 2016 15:14:33
0 / 0
0644
MimeWriter.pyo
7.21 KB
August 18 2016 15:14:33
0 / 0
0644
Queue.py
8.373 KB
November 22 2010 21:03:35
0 / 0
0644
Queue.pyc
9.226 KB
August 18 2016 15:14:33
0 / 0
0644
Queue.pyo
9.226 KB
August 18 2016 15:14:33
0 / 0
0644
SimpleHTTPServer.py
7.248 KB
November 22 2010 21:03:35
0 / 0
0644
SimpleHTTPServer.pyc
7.584 KB
August 18 2016 15:14:33
0 / 0
0644
SimpleHTTPServer.pyo
7.584 KB
August 18 2016 15:14:33
0 / 0
0644
SimpleXMLRPCServer.py
21.477 KB
November 22 2010 21:03:35
0 / 0
0644
SimpleXMLRPCServer.pyc
19.173 KB
August 18 2016 15:14:33
0 / 0
0644
SimpleXMLRPCServer.pyo
19.173 KB
August 18 2016 15:14:33
0 / 0
0644
SocketServer.py
21.803 KB
November 22 2010 21:03:35
0 / 0
0644
SocketServer.pyc
22.601 KB
August 18 2016 15:14:33
0 / 0
0644
SocketServer.pyo
22.601 KB
August 18 2016 15:14:33
0 / 0
0644
StringIO.py
10.372 KB
November 22 2010 21:03:35
0 / 0
0644
StringIO.pyc
11.262 KB
August 18 2016 15:14:33
0 / 0
0644
StringIO.pyo
11.262 KB
August 18 2016 15:14:33
0 / 0
0644
UserDict.py
5.643 KB
November 22 2010 21:03:35
0 / 0
0644
UserDict.pyc
8.684 KB
August 18 2016 15:14:33
0 / 0
0644
UserDict.pyo
8.684 KB
August 18 2016 15:14:33
0 / 0
0644
UserList.py
3.559 KB
November 22 2010 21:03:35
0 / 0
0644
UserList.pyc
6.448 KB
August 18 2016 15:14:33
0 / 0
0644
UserList.pyo
6.448 KB
August 18 2016 15:14:33
0 / 0
0644
UserString.py
9.464 KB
November 22 2010 21:03:35
0 / 0
0755
UserString.pyc
14.572 KB
August 18 2016 15:14:33
0 / 0
0644
UserString.pyo
14.572 KB
August 18 2016 15:14:33
0 / 0
0644
_LWPCookieJar.py
6.399 KB
November 22 2010 21:03:35
0 / 0
0644
_LWPCookieJar.pyc
5.47 KB
August 18 2016 15:14:33
0 / 0
0644
_LWPCookieJar.pyo
5.47 KB
August 18 2016 15:14:33
0 / 0
0644
_MozillaCookieJar.py
5.673 KB
November 22 2010 21:03:35
0 / 0
0644
_MozillaCookieJar.pyc
4.411 KB
August 18 2016 15:14:33
0 / 0
0644
_MozillaCookieJar.pyo
4.371 KB
August 18 2016 15:14:38
0 / 0
0644
__future__.py
4.277 KB
November 22 2010 21:03:35
0 / 0
0644
__future__.pyc
4.134 KB
August 18 2016 15:14:33
0 / 0
0644
__future__.pyo
4.134 KB
August 18 2016 15:14:33
0 / 0
0644
__phello__.foo.py
0.063 KB
November 22 2010 21:03:35
0 / 0
0644
__phello__.foo.pyc
0.122 KB
August 18 2016 15:14:33
0 / 0
0644
__phello__.foo.pyo
0.122 KB
August 18 2016 15:14:33
0 / 0
0644
_abcoll.py
13.908 KB
November 22 2010 21:03:35
0 / 0
0644
_abcoll.pyc
21.085 KB
August 18 2016 15:14:33
0 / 0
0644
_abcoll.pyo
21.085 KB
August 18 2016 15:14:33
0 / 0
0644
_strptime.py
19.291 KB
November 22 2010 21:03:35
0 / 0
0644
_strptime.pyc
14.615 KB
August 18 2016 15:14:33
0 / 0
0644
_strptime.pyo
14.615 KB
August 18 2016 15:14:33
0 / 0
0644
_threading_local.py
6.947 KB
November 22 2010 21:03:35
0 / 0
0644
_threading_local.pyc
6.235 KB
August 18 2016 15:14:33
0 / 0
0644
_threading_local.pyo
6.235 KB
August 18 2016 15:14:33
0 / 0
0644
abc.py
6.869 KB
November 22 2010 21:03:35
0 / 0
0644
abc.pyc
5.929 KB
August 18 2016 15:14:33
0 / 0
0644
abc.pyo
5.872 KB
August 18 2016 15:14:38
0 / 0
0644
aifc.py
32.41 KB
November 22 2010 21:03:35
0 / 0
0644
aifc.pyc
28.871 KB
August 18 2016 15:14:33
0 / 0
0644
aifc.pyo
28.871 KB
August 18 2016 15:14:33
0 / 0
0644
anydbm.py
2.559 KB
November 22 2010 21:03:35
0 / 0
0644
anydbm.pyc
2.71 KB
August 18 2016 15:14:33
0 / 0
0644
anydbm.pyo
2.71 KB
August 18 2016 15:14:33
0 / 0
0644
ast.py
11.081 KB
November 22 2010 21:03:35
0 / 0
0644
ast.pyc
12.48 KB
August 18 2016 15:14:33
0 / 0
0644
ast.pyo
12.48 KB
August 18 2016 15:14:33
0 / 0
0644
asynchat.py
11.135 KB
November 22 2010 21:03:35
0 / 0
0644
asynchat.pyc
8.532 KB
August 18 2016 15:14:33
0 / 0
0644
asynchat.pyo
8.532 KB
August 18 2016 15:14:33
0 / 0
0644
asyncore.py
19.591 KB
November 22 2010 21:03:35
0 / 0
0644
asyncore.pyc
18.02 KB
August 18 2016 15:14:33
0 / 0
0644
asyncore.pyo
18.02 KB
August 18 2016 15:14:33
0 / 0
0644
atexit.py
1.665 KB
November 22 2010 21:03:35
0 / 0
0644
atexit.pyc
2.163 KB
August 18 2016 15:14:33
0 / 0
0644
atexit.pyo
2.163 KB
August 18 2016 15:14:33
0 / 0
0644
audiodev.py
7.419 KB
November 22 2010 21:03:35
0 / 0
0644
audiodev.pyc
8.337 KB
August 18 2016 15:14:33
0 / 0
0644
audiodev.pyo
8.337 KB
August 18 2016 15:14:33
0 / 0
0644
base64.py
11.069 KB
November 22 2010 21:03:35
0 / 0
0755
base64.pyc
10.745 KB
August 18 2016 15:14:33
0 / 0
0644
base64.pyo
10.745 KB
August 18 2016 15:14:33
0 / 0
0644
bdb.py
20.114 KB
November 22 2010 21:03:35
0 / 0
0644
bdb.pyc
18.132 KB
August 18 2016 15:14:33
0 / 0
0644
bdb.pyo
18.132 KB
August 18 2016 15:14:33
0 / 0
0644
binhex.py
14.529 KB
November 22 2010 21:03:35
0 / 0
0644
binhex.pyc
15.503 KB
August 18 2016 15:14:33
0 / 0
0644
binhex.pyo
15.503 KB
August 18 2016 15:14:33
0 / 0
0644
bisect.py
2.6 KB
November 22 2010 21:03:35
0 / 0
0644
bisect.pyc
3.099 KB
August 18 2016 15:14:33
0 / 0
0644
bisect.pyo
3.099 KB
August 18 2016 15:14:33
0 / 0
0644
cProfile.py
6.188 KB
November 22 2010 21:03:35
0 / 0
0755
cProfile.pyc
6.093 KB
August 18 2016 15:14:33
0 / 0
0644
cProfile.pyo
6.093 KB
August 18 2016 15:14:33
0 / 0
0644
calendar.py
22.568 KB
November 22 2010 21:03:35
0 / 0
0644
calendar.pyc
27.505 KB
August 18 2016 15:14:33
0 / 0
0644
calendar.pyo
27.505 KB
August 18 2016 15:14:33
0 / 0
0644
cgi.py
33.67 KB
November 22 2010 21:03:35
0 / 0
0755
cgi.pyc
32.049 KB
August 18 2016 15:14:33
0 / 0
0644
cgi.pyo
32.049 KB
August 18 2016 15:14:33
0 / 0
0644
cgitb.py
11.87 KB
November 22 2010 21:03:35
0 / 0
0644
cgitb.pyc
12.169 KB
August 18 2016 15:14:33
0 / 0
0644
cgitb.pyo
12.169 KB
August 18 2016 15:14:33
0 / 0
0644
chunk.py
5.246 KB
November 22 2010 21:03:35
0 / 0
0644
chunk.pyc
5.513 KB
August 18 2016 15:14:33
0 / 0
0644
chunk.pyo
5.513 KB
August 18 2016 15:14:33
0 / 0
0644
cmd.py
14.611 KB
November 22 2010 21:03:35
0 / 0
0644
cmd.pyc
13.627 KB
August 18 2016 15:14:33
0 / 0
0644
cmd.pyo
13.627 KB
August 18 2016 15:14:33
0 / 0
0644
code.py
9.978 KB
November 22 2010 21:03:35
0 / 0
0644
code.pyc
10.183 KB
August 18 2016 15:14:33
0 / 0
0644
code.pyo
10.183 KB
August 18 2016 15:14:33
0 / 0
0644
codecs.py
34.439 KB
November 22 2010 21:03:35
0 / 0
0644
codecs.pyc
35.86 KB
August 18 2016 15:14:33
0 / 0
0644
codecs.pyo
35.86 KB
August 18 2016 15:14:33
0 / 0
0644
codeop.py
5.858 KB
November 22 2010 21:03:35
0 / 0
0644
codeop.pyc
6.48 KB
August 18 2016 15:14:33
0 / 0
0644
codeop.pyo
6.48 KB
August 18 2016 15:14:33
0 / 0
0644
collections.py
13.408 KB
November 22 2010 21:03:35
0 / 0
0644
collections.pyc
14.123 KB
August 18 2016 15:14:33
0 / 0
0644
collections.pyo
14.071 KB
August 18 2016 15:14:38
0 / 0
0644
colorsys.py
3.378 KB
November 22 2010 21:03:35
0 / 0
0644
colorsys.pyc
3.946 KB
August 18 2016 15:14:33
0 / 0
0644
colorsys.pyo
3.946 KB
August 18 2016 15:14:33
0 / 0
0644
commands.py
2.483 KB
November 22 2010 21:03:35
0 / 0
0644
commands.pyc
2.431 KB
August 18 2016 15:14:33
0 / 0
0644
commands.pyo
2.431 KB
August 18 2016 15:14:33
0 / 0
0644
compileall.py
5.161 KB
November 22 2010 21:03:35
0 / 0
0644
compileall.pyc
4.88 KB
August 18 2016 15:14:33
0 / 0
0644
compileall.pyo
4.88 KB
August 18 2016 15:14:33
0 / 0
0644
contextlib.py
4.039 KB
November 22 2010 21:03:35
0 / 0
0644
contextlib.pyc
4.054 KB
August 18 2016 15:14:33
0 / 0
0644
contextlib.pyo
4.054 KB
August 18 2016 15:14:33
0 / 0
0644
cookielib.py
62.941 KB
November 22 2010 21:03:35
0 / 0
0644
cookielib.pyc
53.951 KB
August 18 2016 15:14:33
0 / 0
0644
cookielib.pyo
53.765 KB
August 18 2016 15:14:38
0 / 0
0644
copy.py
10.915 KB
November 22 2010 21:03:35
0 / 0
0644
copy.pyc
11.401 KB
August 18 2016 15:14:33
0 / 0
0644
copy.pyo
11.308 KB
August 18 2016 15:14:38
0 / 0
0644
copy_reg.py
6.641 KB
November 22 2010 21:03:35
0 / 0
0644
copy_reg.pyc
5.057 KB
August 18 2016 15:14:33
0 / 0
0644
copy_reg.pyo
5.012 KB
August 18 2016 15:14:38
0 / 0
0644
crypt.py
2.177 KB
November 22 2010 21:03:35
0 / 0
0644
crypt.pyc
2.983 KB
August 18 2016 15:14:33
0 / 0
0644
crypt.pyo
2.983 KB
August 18 2016 15:14:33
0 / 0
0644
csv.py
15.361 KB
November 22 2010 21:03:35
0 / 0
0644
csv.pyc
12.916 KB
August 18 2016 15:14:33
0 / 0
0644
csv.pyo
12.916 KB
August 18 2016 15:14:33
0 / 0
0644
dbhash.py
0.522 KB
November 22 2010 21:03:35
0 / 0
0644
dbhash.pyc
0.742 KB
August 18 2016 15:14:33
0 / 0
0644
dbhash.pyo
0.742 KB
August 18 2016 15:14:33
0 / 0
0644
decimal.py
194.603 KB
November 22 2010 21:03:35
0 / 0
0644
decimal.pyc
152.032 KB
August 18 2016 15:14:33
0 / 0
0644
decimal.pyo
151.968 KB
August 18 2016 15:14:39
0 / 0
0644
difflib.py
79.18 KB
August 18 2016 15:14:10
0 / 0
0644
difflib.pyc
59.759 KB
August 18 2016 15:14:33
0 / 0
0644
difflib.pyo
59.706 KB
August 18 2016 15:14:39
0 / 0
0644
dircache.py
1.1 KB
November 22 2010 21:03:35
0 / 0
0644
dircache.pyc
1.547 KB
August 18 2016 15:14:33
0 / 0
0644
dircache.pyo
1.547 KB
August 18 2016 15:14:33
0 / 0
0644
dis.py
6.298 KB
November 22 2010 21:03:35
0 / 0
0644
dis.pyc
6.217 KB
August 18 2016 15:14:33
0 / 0
0644
dis.pyo
6.217 KB
August 18 2016 15:14:33
0 / 0
0644
doctest.py
99.137 KB
November 22 2010 21:03:35
0 / 0
0644
doctest.pyc
79.096 KB
August 18 2016 15:14:34
0 / 0
0644
doctest.pyo
78.814 KB
August 18 2016 15:14:39
0 / 0
0644
dumbdbm.py
8.613 KB
November 22 2010 21:03:35
0 / 0
0644
dumbdbm.pyc
6.431 KB
August 18 2016 15:14:34
0 / 0
0644
dumbdbm.pyo
6.431 KB
August 18 2016 15:14:34
0 / 0
0644
dummy_thread.py
4.314 KB
November 22 2010 21:03:35
0 / 0
0644
dummy_thread.pyc
5.286 KB
August 18 2016 15:14:34
0 / 0
0644
dummy_thread.pyo
5.286 KB
August 18 2016 15:14:34
0 / 0
0644
dummy_threading.py
2.738 KB
November 22 2010 21:03:35
0 / 0
0644
dummy_threading.pyc
1.267 KB
August 18 2016 15:14:34
0 / 0
0644
dummy_threading.pyo
1.267 KB
August 18 2016 15:14:34
0 / 0
0644
filecmp.py
9.248 KB
November 22 2010 21:03:35
0 / 0
0644
filecmp.pyc
9.406 KB
August 18 2016 15:14:34
0 / 0
0644
filecmp.pyo
9.406 KB
August 18 2016 15:14:34
0 / 0
0644
fileinput.py
13.812 KB
November 22 2010 21:03:35
0 / 0
0644
fileinput.pyc
14.578 KB
August 18 2016 15:14:34
0 / 0
0644
fileinput.pyo
14.578 KB
August 18 2016 15:14:34
0 / 0
0644
fnmatch.py
3.163 KB
November 22 2010 21:03:35
0 / 0
0644
fnmatch.pyc
3.495 KB
August 18 2016 15:14:34
0 / 0
0644
fnmatch.pyo
3.495 KB
August 18 2016 15:14:34
0 / 0
0644
formatter.py
14.562 KB
November 22 2010 21:03:35
0 / 0
0644
formatter.pyc
18.851 KB
August 18 2016 15:14:34
0 / 0
0644
formatter.pyo
18.851 KB
August 18 2016 15:14:34
0 / 0
0644
fpformat.py
4.589 KB
November 22 2010 21:03:35
0 / 0
0644
fpformat.pyc
4.624 KB
August 18 2016 15:14:34
0 / 0
0644
fpformat.pyo
4.624 KB
August 18 2016 15:14:34
0 / 0
0644
fractions.py
19.603 KB
November 22 2010 21:03:35
0 / 0
0644
fractions.pyc
17.694 KB
August 18 2016 15:14:34
0 / 0
0644
fractions.pyo
17.694 KB
August 18 2016 15:14:34
0 / 0
0644
ftplib.py
28.513 KB
November 22 2010 21:03:35
0 / 0
0644
ftplib.pyc
27.835 KB
August 18 2016 15:14:34
0 / 0
0644
ftplib.pyo
27.835 KB
August 18 2016 15:14:34
0 / 0
0644
functools.py
2.111 KB
November 22 2010 21:03:35
0 / 0
0644
functools.pyc
1.882 KB
August 18 2016 15:14:34
0 / 0
0644
functools.pyo
1.882 KB
August 18 2016 15:14:34
0 / 0
0644
genericpath.py
2.949 KB
November 22 2010 21:03:35
0 / 0
0644
genericpath.pyc
3.215 KB
August 18 2016 15:14:34
0 / 0
0644
genericpath.pyo
3.215 KB
August 18 2016 15:14:34
0 / 0
0644
getopt.py
7.156 KB
November 22 2010 21:03:35
0 / 0
0644
getopt.pyc
6.572 KB
August 18 2016 15:14:34
0 / 0
0644
getopt.pyo
6.526 KB
August 18 2016 15:14:39
0 / 0
0644
getpass.py
5.404 KB
November 22 2010 21:03:35
0 / 0
0644
getpass.pyc
4.643 KB
August 18 2016 15:14:34
0 / 0
0644
getpass.pyo
4.643 KB
August 18 2016 15:14:34
0 / 0
0644
gettext.py
19.5 KB
November 22 2010 21:03:35
0 / 0
0644
gettext.pyc
15.391 KB
August 18 2016 15:14:34
0 / 0
0644
gettext.pyo
15.391 KB
August 18 2016 15:14:34
0 / 0
0644
glob.py
2.196 KB
November 22 2010 21:03:35
0 / 0
0644
glob.pyc
2.353 KB
August 18 2016 15:14:34
0 / 0
0644
glob.pyo
2.353 KB
August 18 2016 15:14:34
0 / 0
0644
gzip.py
16.361 KB
November 22 2010 21:03:35
0 / 0
0644
gzip.pyc
14.049 KB
August 18 2016 15:14:34
0 / 0
0644
gzip.pyo
14.049 KB
August 18 2016 15:14:34
0 / 0
0644
hashlib.py
4.323 KB
November 22 2010 21:03:35
0 / 0
0644
hashlib.pyc
3.888 KB
August 18 2016 15:14:34
0 / 0
0644
hashlib.pyo
3.888 KB
August 18 2016 15:14:34
0 / 0
0644
heapq.py
15.62 KB
November 22 2010 21:03:35
0 / 0
0644
heapq.pyc
12.396 KB
August 18 2016 15:14:34
0 / 0
0644
heapq.pyo
12.396 KB
August 18 2016 15:14:34
0 / 0
0644
hmac.py
4.425 KB
November 22 2010 21:03:35
0 / 0
0644
hmac.pyc
4.403 KB
August 18 2016 15:14:34
0 / 0
0644
hmac.pyo
4.403 KB
August 18 2016 15:14:34
0 / 0
0644
htmlentitydefs.py
17.631 KB
November 22 2010 21:03:35
0 / 0
0644
htmlentitydefs.pyc
6.222 KB
August 18 2016 15:14:34
0 / 0
0644
htmlentitydefs.pyo
6.222 KB
August 18 2016 15:14:34
0 / 0
0644
htmllib.py
12.567 KB
November 22 2010 21:03:35
0 / 0
0644
htmllib.pyc
19.906 KB
August 18 2016 15:14:34
0 / 0
0644
htmllib.pyo
19.906 KB
August 18 2016 15:14:34
0 / 0
0644
httplib.py
46.774 KB
November 22 2010 21:03:35
0 / 0
0644
httplib.pyc
36.174 KB
August 18 2016 15:14:34
0 / 0
0644
httplib.pyo
35.982 KB
August 18 2016 15:14:39
0 / 0
0644
ihooks.py
17.043 KB
November 22 2010 21:03:35
0 / 0
0644
ihooks.pyc
20.349 KB
August 18 2016 15:14:34
0 / 0
0644
ihooks.pyo
20.271 KB
August 18 2016 15:14:39
0 / 0
0644
imaplib.py
46.651 KB
November 22 2010 21:03:35
0 / 0
0644
imaplib.pyc
44.165 KB
August 18 2016 15:14:34
0 / 0
0644
imaplib.pyo
41.479 KB
August 18 2016 15:14:39
0 / 0
0644
imghdr.py
3.461 KB
November 22 2010 21:03:35
0 / 0
0644
imghdr.pyc
4.79 KB
August 18 2016 15:14:34
0 / 0
0644
imghdr.pyo
4.79 KB
August 18 2016 15:14:34
0 / 0
0644
imputil.py
25.399 KB
November 22 2010 21:03:35
0 / 0
0644
imputil.pyc
15.661 KB
August 18 2016 15:14:34
0 / 0
0644
imputil.pyo
15.493 KB
August 18 2016 15:14:39
0 / 0
0644
inspect.py
37.294 KB
November 22 2010 21:03:35
0 / 0
0644
inspect.pyc
36.294 KB
August 18 2016 15:14:34
0 / 0
0644
inspect.pyo
36.294 KB
August 18 2016 15:14:34
0 / 0
0644
io.py
64.614 KB
November 22 2010 21:03:35
0 / 0
0644
io.pyc
61.564 KB
August 18 2016 15:14:34
0 / 0
0644
io.pyo
61.564 KB
August 18 2016 15:14:34
0 / 0
0644
keyword.py
1.95 KB
November 22 2010 21:03:35
0 / 0
0755
keyword.pyc
2.067 KB
August 18 2016 15:14:34
0 / 0
0644
keyword.pyo
2.067 KB
August 18 2016 15:14:34
0 / 0
0644
linecache.py
4.031 KB
November 22 2010 21:03:35
0 / 0
0644
linecache.pyc
3.191 KB
August 18 2016 15:14:35
0 / 0
0644
linecache.pyo
3.191 KB
August 18 2016 15:14:35
0 / 0
0644
locale.py
80.736 KB
November 22 2010 21:03:35
0 / 0
0644
locale.pyc
45.582 KB
August 18 2016 15:14:35
0 / 0
0644
locale.pyo
45.582 KB
August 18 2016 15:14:35
0 / 0
0644
macpath.py
6.106 KB
November 22 2010 21:03:35
0 / 0
0644
macpath.pyc
7.526 KB
August 18 2016 15:14:35
0 / 0
0644
macpath.pyo
7.526 KB
August 18 2016 15:14:35
0 / 0
0644
macurl2path.py
3.198 KB
November 22 2010 21:03:35
0 / 0
0644
macurl2path.pyc
2.759 KB
August 18 2016 15:14:35
0 / 0
0644
macurl2path.pyo
2.759 KB
August 18 2016 15:14:35
0 / 0
0644
mailbox.py
74.047 KB
August 18 2016 15:14:11
0 / 0
0644
mailbox.pyc
74.286 KB
August 18 2016 15:14:35
0 / 0
0644
mailbox.pyo
74.238 KB
August 18 2016 15:14:40
0 / 0
0644
mailcap.py
7.253 KB
November 22 2010 21:03:35
0 / 0
0644
mailcap.pyc
7.024 KB
August 18 2016 15:14:35
0 / 0
0644
mailcap.pyo
7.024 KB
August 18 2016 15:14:35
0 / 0
0644
markupbase.py
14.014 KB
November 22 2010 21:03:35
0 / 0
0644
markupbase.pyc
9.242 KB
August 18 2016 15:14:35
0 / 0
0644
markupbase.pyo
9.053 KB
August 18 2016 15:14:40
0 / 0
0644
md5.py
0.4 KB
November 22 2010 21:03:35
0 / 0
0644
md5.pyc
0.369 KB
August 18 2016 15:14:35
0 / 0
0644
md5.pyo
0.369 KB
August 18 2016 15:14:35
0 / 0
0644
mhlib.py
32.65 KB
November 22 2010 21:03:35
0 / 0
0644
mhlib.pyc
33.337 KB
August 18 2016 15:14:35
0 / 0
0644
mhlib.pyo
33.337 KB
August 18 2016 15:14:35
0 / 0
0644
mimetools.py
7 KB
November 22 2010 21:03:35
0 / 0
0644
mimetools.pyc
8.125 KB
August 18 2016 15:14:35
0 / 0
0644
mimetools.pyo
8.125 KB
August 18 2016 15:14:35
0 / 0
0644
mimetypes.py
18.381 KB
November 22 2010 21:03:35
0 / 0
0644
mimetypes.pyc
16.477 KB
August 18 2016 15:14:35
0 / 0
0644
mimetypes.pyo
16.477 KB
August 18 2016 15:14:35
0 / 0
0644
mimify.py
14.672 KB
November 22 2010 21:03:35
0 / 0
0755
mimify.pyc
11.933 KB
August 18 2016 15:14:35
0 / 0
0644
mimify.pyo
11.933 KB
August 18 2016 15:14:35
0 / 0
0644
modulefinder.py
23.714 KB
November 22 2010 21:03:35
0 / 0
0644
modulefinder.pyc
18.562 KB
August 18 2016 15:14:35
0 / 0
0644
modulefinder.pyo
18.476 KB
August 18 2016 15:14:40
0 / 0
0644
multifile.py
4.707 KB
November 22 2010 21:03:35
0 / 0
0644
multifile.pyc
5.351 KB
August 18 2016 15:14:35
0 / 0
0644
multifile.pyo
5.308 KB
August 18 2016 15:14:40
0 / 0
0644
mutex.py
1.822 KB
November 22 2010 21:03:35
0 / 0
0644
mutex.pyc
2.467 KB
August 18 2016 15:14:35
0 / 0
0644
mutex.pyo
2.467 KB
August 18 2016 15:14:35
0 / 0
0644
netrc.py
4.015 KB
November 22 2010 21:03:35
0 / 0
0644
netrc.pyc
3.518 KB
August 18 2016 15:14:35
0 / 0
0644
netrc.pyo
3.518 KB
August 18 2016 15:14:35
0 / 0
0644
new.py
0.689 KB
November 22 2010 21:03:35
0 / 0
0644
new.pyc
0.889 KB
August 18 2016 15:14:35
0 / 0
0644
new.pyo
0.889 KB
August 18 2016 15:14:35
0 / 0
0644
nntplib.py
20.967 KB
November 22 2010 21:03:35
0 / 0
0644
nntplib.pyc
20.683 KB
August 18 2016 15:14:35
0 / 0
0644
nntplib.pyo
20.683 KB
August 18 2016 15:14:35
0 / 0
0644
ntpath.py
17.336 KB
November 22 2010 21:03:35
0 / 0
0644
ntpath.pyc
11.348 KB
August 18 2016 15:14:35
0 / 0
0644
ntpath.pyo
11.302 KB
August 18 2016 15:14:40
0 / 0
0644
nturl2path.py
2.187 KB
November 22 2010 21:03:35
0 / 0
0644
nturl2path.pyc
1.735 KB
August 18 2016 15:14:35
0 / 0
0644
nturl2path.pyo
1.735 KB
August 18 2016 15:14:35
0 / 0
0644
numbers.py
10.03 KB
November 22 2010 21:03:35
0 / 0
0644
numbers.pyc
13.637 KB
August 18 2016 15:14:35
0 / 0
0644
numbers.pyo
13.637 KB
August 18 2016 15:14:35
0 / 0
0644
opcode.py
5.125 KB
November 22 2010 21:03:35
0 / 0
0644
opcode.pyc
5.778 KB
August 18 2016 15:14:35
0 / 0
0644
opcode.pyo
5.778 KB
August 18 2016 15:14:35
0 / 0
0644
optparse.py
59.423 KB
November 22 2010 21:03:35
0 / 0
0644
optparse.pyc
52.968 KB
August 18 2016 15:14:35
0 / 0
0644
optparse.pyo
52.888 KB
August 18 2016 15:14:40
0 / 0
0644
ordereddict.py
0.035 KB
August 18 2016 15:13:34
0 / 0
0644
ordereddict.pyc
0.181 KB
August 18 2016 15:14:35
0 / 0
0644
ordereddict.pyo
0.181 KB
August 18 2016 15:14:35
0 / 0
0644
os.py
25.197 KB
November 22 2010 21:03:35
0 / 0
0644
os.pyc
25.203 KB
August 18 2016 15:14:35
0 / 0
0644
os.pyo
25.203 KB
August 18 2016 15:14:35
0 / 0
0644
os2emxpath.py
4.495 KB
November 22 2010 21:03:35
0 / 0
0644
os2emxpath.pyc
4.43 KB
August 18 2016 15:14:35
0 / 0
0644
os2emxpath.pyo
4.43 KB
August 18 2016 15:14:35
0 / 0
0644
pdb.doc
7.714 KB
May 11 2008 14:17:13
0 / 0
0644
pdb.py
44.271 KB
November 22 2010 21:03:35
0 / 0
0755
pdb.pyc
42.786 KB
August 18 2016 15:14:35
0 / 0
0644
pdb.pyo
42.786 KB
August 18 2016 15:14:35
0 / 0
0644
pickle.py
43.761 KB
November 22 2010 21:03:35
0 / 0
0644
pickle.pyc
37.739 KB
August 18 2016 15:14:35
0 / 0
0644
pickle.pyo
37.539 KB
August 18 2016 15:14:40
0 / 0
0644
pickletools.py
72.605 KB
November 22 2010 21:03:35
0 / 0
0644
pickletools.pyc
55.804 KB
August 18 2016 15:14:35
0 / 0
0644
pickletools.pyo
54.928 KB
August 18 2016 15:14:40
0 / 0
0644
pipes.py
9.421 KB
November 22 2010 21:03:35
0 / 0
0644
pipes.pyc
9.238 KB
August 18 2016 15:14:35
0 / 0
0644
pipes.pyo
9.238 KB
August 18 2016 15:14:35
0 / 0
0644
pkgutil.py
19.532 KB
November 22 2010 21:03:35
0 / 0
0644
pkgutil.pyc
18.574 KB
August 18 2016 15:14:35
0 / 0
0644
pkgutil.pyo
18.574 KB
August 18 2016 15:14:35
0 / 0
0644
platform.py
51.386 KB
November 22 2010 21:03:35
0 / 0
0755
platform.pyc
37.872 KB
August 18 2016 15:14:35
0 / 0
0644
platform.pyo
37.872 KB
August 18 2016 15:14:35
0 / 0
0644
plistlib.py
14.829 KB
November 22 2010 21:03:35
0 / 0
0644
plistlib.pyc
18.877 KB
August 18 2016 15:14:35
0 / 0
0644
plistlib.pyo
18.789 KB
August 18 2016 15:14:40
0 / 0
0644
popen2.py
8.219 KB
November 22 2010 21:03:35
0 / 0
0644
popen2.pyc
8.852 KB
August 18 2016 15:14:35
0 / 0
0644
popen2.pyo
8.809 KB
August 18 2016 15:14:40
0 / 0
0644
poplib.py
12.524 KB
November 22 2010 21:03:35
0 / 0
0644
poplib.pyc
13.104 KB
August 18 2016 15:14:35
0 / 0
0644
poplib.pyo
13.104 KB
August 18 2016 15:14:35
0 / 0
0644
posixfile.py
7.815 KB
November 22 2010 21:03:35
0 / 0
0644
posixfile.pyc
7.543 KB
August 18 2016 15:14:35
0 / 0
0644
posixfile.pyo
7.543 KB
August 18 2016 15:14:35
0 / 0
0644
posixpath.py
12.812 KB
November 22 2010 21:03:35
0 / 0
0644
posixpath.pyc
10.926 KB
August 18 2016 15:14:35
0 / 0
0644
posixpath.pyo
10.926 KB
August 18 2016 15:14:35
0 / 0
0644
pprint.py
11.652 KB
November 22 2010 21:03:35
0 / 0
0644
pprint.pyc
10.15 KB
August 18 2016 15:14:35
0 / 0
0644
pprint.pyo
9.979 KB
August 18 2016 15:14:40
0 / 0
0644
profile.py
22.959 KB
November 22 2010 21:03:35
0 / 0
0755
profile.pyc
16.289 KB
August 18 2016 15:14:35
0 / 0
0644
profile.pyo
16.05 KB
August 18 2016 15:14:40
0 / 0
0644
pstats.py
26.67 KB
November 22 2010 21:03:35
0 / 0
0644
pstats.pyc
24.746 KB
August 18 2016 15:14:35
0 / 0
0644
pstats.pyo
24.746 KB
August 18 2016 15:14:35
0 / 0
0644
pty.py
4.755 KB
November 22 2010 21:03:35
0 / 0
0644
pty.pyc
4.804 KB
August 18 2016 15:14:35
0 / 0
0644
pty.pyo
4.804 KB
August 18 2016 15:14:35
0 / 0
0644
py_compile.py
5.501 KB
November 22 2010 21:03:35
0 / 0
0644
py_compile.pyc
6.4 KB
August 18 2016 15:14:35
0 / 0
0644
py_compile.pyo
6.4 KB
August 18 2016 15:14:35
0 / 0
0644
pyclbr.py
12.971 KB
November 22 2010 21:03:35
0 / 0
0644
pyclbr.pyc
9.504 KB
August 18 2016 15:14:35
0 / 0
0644
pyclbr.pyo
9.504 KB
August 18 2016 15:14:35
0 / 0
0644
pydoc.py
90.266 KB
November 22 2010 21:03:35
0 / 0
0755
pydoc.pyc
88.918 KB
August 18 2016 15:14:35
0 / 0
0644
pydoc.pyo
88.852 KB
August 18 2016 15:14:40
0 / 0
0644
pydoc_topics.py
413.209 KB
November 22 2010 21:03:35
0 / 0
0644
pydoc_topics.pyc
398.035 KB
August 18 2016 15:14:35
0 / 0
0644
pydoc_topics.pyo
398.035 KB
August 18 2016 15:14:35
0 / 0
0644
quopri.py
6.809 KB
November 22 2010 21:03:35
0 / 0
0755
quopri.pyc
6.531 KB
August 18 2016 15:14:35
0 / 0
0644
quopri.pyo
6.531 KB
August 18 2016 15:14:35
0 / 0
0644
random.py
31.217 KB
November 22 2010 21:03:35
0 / 0
0644
random.pyc
24.518 KB
August 18 2016 15:14:35
0 / 0
0644
random.pyo
24.518 KB
August 18 2016 15:14:35
0 / 0
0644
re.py
12.662 KB
November 22 2010 21:03:35
0 / 0
0644
re.pyc
12.855 KB
August 18 2016 15:14:35
0 / 0
0644
re.pyo
12.855 KB
August 18 2016 15:14:35
0 / 0
0644
repr.py
4.195 KB
November 22 2010 21:03:35
0 / 0
0644
repr.pyc
5.307 KB
August 18 2016 15:14:35
0 / 0
0644
repr.pyo
5.307 KB
August 18 2016 15:14:35
0 / 0
0644
rexec.py
19.68 KB
November 22 2010 21:03:35
0 / 0
0644
rexec.pyc
23.652 KB
August 18 2016 15:14:35
0 / 0
0644
rexec.pyo
23.652 KB
August 18 2016 15:14:35
0 / 0
0644
rfc822.py
32.515 KB
November 22 2010 21:03:35
0 / 0
0644
rfc822.pyc
31.357 KB
August 18 2016 15:14:35
0 / 0
0644
rfc822.pyo
31.357 KB
August 18 2016 15:14:35
0 / 0
0644
rlcompleter.py
5.729 KB
November 22 2010 21:03:35
0 / 0
0644
rlcompleter.pyc
5.931 KB
August 18 2016 15:14:35
0 / 0
0644
rlcompleter.pyo
5.931 KB
August 18 2016 15:14:35
0 / 0
0644
robotparser.py
6.85 KB
November 22 2010 21:03:35
0 / 0
0644
robotparser.pyc
7.668 KB
August 18 2016 15:14:35
0 / 0
0644
robotparser.pyo
7.668 KB
August 18 2016 15:14:35
0 / 0
0644
runpy.py
5.286 KB
November 22 2010 21:03:35
0 / 0
0644
runpy.pyc
3.886 KB
August 18 2016 15:14:35
0 / 0
0644
runpy.pyo
3.886 KB
August 18 2016 15:14:35
0 / 0
0644
sched.py
4.972 KB
November 22 2010 21:03:35
0 / 0
0644
sched.pyc
4.888 KB
August 18 2016 15:14:35
0 / 0
0644
sched.pyo
4.888 KB
August 18 2016 15:14:35
0 / 0
0644
sets.py
18.604 KB
November 22 2010 21:03:35
0 / 0
0644
sets.pyc
16.599 KB
August 18 2016 15:14:35
0 / 0
0644
sets.pyo
16.599 KB
August 18 2016 15:14:35
0 / 0
0644
sgmllib.py
17.465 KB
November 22 2010 21:03:35
0 / 0
0644
sgmllib.pyc
15.232 KB
August 18 2016 15:14:35
0 / 0
0644
sgmllib.pyo
15.232 KB
August 18 2016 15:14:35
0 / 0
0644
sha.py
0.435 KB
November 22 2010 21:03:35
0 / 0
0644
sha.pyc
0.411 KB
August 18 2016 15:14:35
0 / 0
0644
sha.pyo
0.411 KB
August 18 2016 15:14:35
0 / 0
0644
shelve.py
7.889 KB
November 22 2010 21:03:35
0 / 0
0644
shelve.pyc
10.055 KB
August 18 2016 15:14:35
0 / 0
0644
shelve.pyo
10.055 KB
August 18 2016 15:14:35
0 / 0
0644
shlex.py
10.876 KB
November 22 2010 21:03:35
0 / 0
0644
shlex.pyc
7.529 KB
August 18 2016 15:14:35
0 / 0
0644
shlex.pyo
7.529 KB
August 18 2016 15:14:35
0 / 0
0644
shutil.py
8.43 KB
November 22 2010 21:03:35
0 / 0
0644
shutil.pyc
9.331 KB
August 18 2016 15:14:35
0 / 0
0644
shutil.pyo
9.331 KB
August 18 2016 15:14:35
0 / 0
0644
site.py
18.737 KB
November 22 2010 21:03:35
0 / 0
0644
site.pyc
18.384 KB
August 18 2016 15:14:35
0 / 0
0644
site.pyo
18.384 KB
August 18 2016 15:14:35
0 / 0
0644
smtpd.py
18.477 KB
November 22 2010 21:03:35
0 / 0
0755
smtpd.pyc
15.809 KB
August 18 2016 15:14:35
0 / 0
0644
smtpd.pyo
15.809 KB
August 18 2016 15:14:35
0 / 0
0644
smtplib.py
30.199 KB
November 22 2010 21:03:35
0 / 0
0755
smtplib.pyc
29.04 KB
August 18 2016 15:14:35
0 / 0
0644
smtplib.pyo
29.04 KB
August 18 2016 15:14:35
0 / 0
0644
sndhdr.py
5.833 KB
November 22 2010 21:03:35
0 / 0
0644
sndhdr.pyc
7.246 KB
August 18 2016 15:14:35
0 / 0
0644
sndhdr.pyo
7.246 KB
August 18 2016 15:14:35
0 / 0
0644
socket.py
19.677 KB
November 22 2010 21:03:35
0 / 0
0644
socket.pyc
15.751 KB
August 18 2016 15:14:35
0 / 0
0644
socket.pyo
15.668 KB
August 18 2016 15:14:40
0 / 0
0644
sre.py
0.375 KB
November 22 2010 21:03:35
0 / 0
0644
sre.pyc
0.507 KB
August 18 2016 15:14:35
0 / 0
0644
sre.pyo
0.507 KB
August 18 2016 15:14:35
0 / 0
0644
sre_compile.py
16.12 KB
November 22 2010 21:03:35
0 / 0
0644
sre_compile.pyc
11.214 KB
August 18 2016 15:14:35
0 / 0
0644
sre_compile.pyo
11.104 KB
August 18 2016 15:14:40
0 / 0
0644
sre_constants.py
6.97 KB
November 22 2010 21:03:35
0 / 0
0644
sre_constants.pyc
5.95 KB
August 18 2016 15:14:35
0 / 0
0644
sre_constants.pyo
5.95 KB
August 18 2016 15:14:35
0 / 0
0644
sre_parse.py
26.248 KB
November 22 2010 21:03:35
0 / 0
0644
sre_parse.pyc
19.234 KB
August 18 2016 15:14:35
0 / 0
0644
sre_parse.pyo
19.234 KB
August 18 2016 15:14:35
0 / 0
0644
ssl.py
14.476 KB
November 22 2010 21:03:35
0 / 0
0644
ssl.pyc
13.353 KB
August 18 2016 15:14:35
0 / 0
0644
ssl.pyo
13.353 KB
August 18 2016 15:14:35
0 / 0
0644
stat.py
1.678 KB
November 22 2010 21:03:35
0 / 0
0644
stat.pyc
2.64 KB
August 18 2016 15:14:35
0 / 0
0644
stat.pyo
2.64 KB
August 18 2016 15:14:35
0 / 0
0644
statvfs.py
0.877 KB
November 22 2010 21:03:35
0 / 0
0644
statvfs.pyc
0.605 KB
August 18 2016 15:14:35
0 / 0
0644
statvfs.pyo
0.605 KB
August 18 2016 15:14:35
0 / 0
0644
string.py
20.259 KB
November 22 2010 21:03:35
0 / 0
0644
string.pyc
19.596 KB
August 18 2016 15:14:35
0 / 0
0644
string.pyo
19.596 KB
August 18 2016 15:14:35
0 / 0
0644
stringold.py
12.157 KB
November 22 2010 21:03:35
0 / 0
0644
stringold.pyc
12.298 KB
August 18 2016 15:14:35
0 / 0
0644
stringold.pyo
12.298 KB
August 18 2016 15:14:35
0 / 0
0644
stringprep.py
13.205 KB
November 22 2010 21:03:35
0 / 0
0644
stringprep.pyc
14.186 KB
August 18 2016 15:14:35
0 / 0
0644
stringprep.pyo
14.113 KB
August 18 2016 15:14:40
0 / 0
0644
struct.py
0.08 KB
November 22 2010 21:03:35
0 / 0
0644
struct.pyc
0.233 KB
August 18 2016 15:14:35
0 / 0
0644
struct.pyo
0.233 KB
August 18 2016 15:14:35
0 / 0
0644
subprocess.py
56.587 KB
November 22 2010 21:03:35
0 / 0
0644
subprocess.pyc
40.108 KB
August 18 2016 15:14:35
0 / 0
0644
subprocess.pyo
40.053 KB
August 18 2016 15:14:40
0 / 0
0644
sunau.py
16.149 KB
November 22 2010 21:03:35
0 / 0
0644
sunau.pyc
17.648 KB
August 18 2016 15:14:35
0 / 0
0644
sunau.pyo
17.648 KB
August 18 2016 15:14:35
0 / 0
0644
sunaudio.py
1.366 KB
November 22 2010 21:03:35
0 / 0
0644
sunaudio.pyc
1.95 KB
August 18 2016 15:14:35
0 / 0
0644
sunaudio.pyo
1.95 KB
August 18 2016 15:14:35
0 / 0
0644
symbol.py
2.002 KB
November 22 2010 21:03:35
0 / 0
0755
symbol.pyc
2.954 KB
August 18 2016 15:14:35
0 / 0
0644
symbol.pyo
2.954 KB
August 18 2016 15:14:35
0 / 0
0644
symtable.py
7.726 KB
November 22 2010 21:03:35
0 / 0
0644
symtable.pyc
12.313 KB
August 18 2016 15:14:35
0 / 0
0644
symtable.pyo
12.187 KB
August 18 2016 15:14:40
0 / 0
0644
tabnanny.py
11.073 KB
November 22 2010 21:03:35
0 / 0
0755
tabnanny.pyc
8.138 KB
August 18 2016 15:14:35
0 / 0
0644
tabnanny.pyo
8.138 KB
August 18 2016 15:14:35
0 / 0
0644
tarfile.py
84.81 KB
August 18 2016 15:14:12
0 / 0
0644
tarfile.pyc
71.794 KB
August 18 2016 15:14:35
0 / 0
0644
tarfile.pyo
71.794 KB
August 18 2016 15:14:35
0 / 0
0644
telnetlib.py
21.297 KB
November 22 2010 21:03:35
0 / 0
0644
telnetlib.pyc
19.446 KB
August 18 2016 15:14:35
0 / 0
0644
telnetlib.pyo
19.446 KB
August 18 2016 15:14:35
0 / 0
0644
tempfile.py
17.357 KB
November 22 2010 21:03:35
0 / 0
0644
tempfile.pyc
19.112 KB
August 18 2016 15:14:35
0 / 0
0644
tempfile.pyo
19.112 KB
August 18 2016 15:14:35
0 / 0
0644
textwrap.py
16.493 KB
November 22 2010 21:03:35
0 / 0
0644
textwrap.pyc
11.516 KB
August 18 2016 15:14:37
0 / 0
0644
textwrap.pyo
11.426 KB
August 18 2016 15:14:43
0 / 0
0644
this.py
0.979 KB
November 22 2010 21:03:35
0 / 0
0644
this.pyc
1.212 KB
August 18 2016 15:14:37
0 / 0
0644
this.pyo
1.212 KB
August 18 2016 15:14:37
0 / 0
0644
threading.py
31.063 KB
November 22 2010 21:03:35
0 / 0
0644
threading.pyc
27.492 KB
August 18 2016 15:14:37
0 / 0
0644
threading.pyo
25.469 KB
August 18 2016 15:14:43
0 / 0
0644
timeit.py
11.722 KB
August 18 2016 15:14:11
0 / 0
0644
timeit.pyc
11.55 KB
August 18 2016 15:14:37
0 / 0
0644
timeit.pyo
11.55 KB
August 18 2016 15:14:37
0 / 0
0644
toaiff.py
3.068 KB
November 22 2010 21:03:35
0 / 0
0644
toaiff.pyc
3.061 KB
August 18 2016 15:14:37
0 / 0
0644
toaiff.pyo
3.061 KB
August 18 2016 15:14:37
0 / 0
0644
token.py
2.878 KB
November 22 2010 21:03:35
0 / 0
0755
token.pyc
3.75 KB
August 18 2016 15:14:37
0 / 0
0644
token.pyo
3.75 KB
August 18 2016 15:14:37
0 / 0
0644
tokenize.py
15.943 KB
November 22 2010 21:03:35
0 / 0
0644
tokenize.pyc
13.689 KB
August 18 2016 15:14:37
0 / 0
0644
tokenize.pyo
13.599 KB
August 18 2016 15:14:43
0 / 0
0644
trace.py
29.614 KB
August 18 2016 15:14:12
0 / 0
0644
trace.pyc
22.511 KB
August 18 2016 15:14:37
0 / 0
0644
trace.pyo
22.45 KB
August 18 2016 15:14:43
0 / 0
0644
traceback.py
10.948 KB
November 22 2010 21:03:35
0 / 0
0644
traceback.pyc
11.403 KB
August 18 2016 15:14:37
0 / 0
0644
traceback.pyo
11.403 KB
August 18 2016 15:14:37
0 / 0
0644
tty.py
0.858 KB
November 22 2010 21:03:35
0 / 0
0644
tty.pyc
1.286 KB
August 18 2016 15:14:37
0 / 0
0644
tty.pyo
1.286 KB
August 18 2016 15:14:37
0 / 0
0644
types.py
2.269 KB
November 22 2010 21:03:35
0 / 0
0644
types.pyc
2.559 KB
August 18 2016 15:14:37
0 / 0
0644
types.pyo
2.559 KB
August 18 2016 15:14:37
0 / 0
0644
unittest.py
30.427 KB
August 18 2016 15:14:11
0 / 0
0644
unittest.pyc
34.045 KB
August 18 2016 15:14:37
0 / 0
0644
unittest.pyo
34.045 KB
August 18 2016 15:14:37
0 / 0
0644
urllib.py
57.639 KB
November 22 2010 21:03:35
0 / 0
0644
urllib.pyc
50.145 KB
August 18 2016 15:14:37
0 / 0
0644
urllib.pyo
50.053 KB
August 18 2016 15:14:43
0 / 0
0644
urllib2.py
49.387 KB
November 22 2010 21:03:35
0 / 0
0644
urllib2.pyc
44.74 KB
August 18 2016 15:14:37
0 / 0
0644
urllib2.pyo
44.648 KB
August 18 2016 15:14:43
0 / 0
0644
urlparse.py
13.389 KB
November 22 2010 21:03:35
0 / 0
0644
urlparse.pyc
13.127 KB
August 18 2016 15:14:37
0 / 0
0644
urlparse.pyo
13.127 KB
August 18 2016 15:14:37
0 / 0
0644
user.py
1.589 KB
November 22 2010 21:03:35
0 / 0
0644
user.pyc
1.695 KB
August 18 2016 15:14:37
0 / 0
0644
user.pyo
1.695 KB
August 18 2016 15:14:37
0 / 0
0644
uu.py
5.803 KB
November 22 2010 21:03:35
0 / 0
0755
uu.pyc
4.138 KB
August 18 2016 15:14:37
0 / 0
0644
uu.pyo
4.138 KB
August 18 2016 15:14:37
0 / 0
0644
uuid.py
20.453 KB
November 22 2010 21:03:35
0 / 0
0644
uuid.pyc
20.78 KB
August 18 2016 15:14:37
0 / 0
0644
uuid.pyo
20.78 KB
August 18 2016 15:14:37
0 / 0
0644
warnings.py
13.84 KB
November 22 2010 21:03:35
0 / 0
0644
warnings.pyc
12.736 KB
August 18 2016 15:14:37
0 / 0
0644
warnings.pyo
11.919 KB
August 18 2016 15:14:43
0 / 0
0644
wave.py
17.531 KB
November 22 2010 21:03:35
0 / 0
0644
wave.pyc
18.98 KB
August 18 2016 15:14:37
0 / 0
0644
wave.pyo
18.98 KB
August 18 2016 15:14:37
0 / 0
0644
weakref.py
9.851 KB
November 22 2010 21:03:35
0 / 0
0644
weakref.pyc
13.062 KB
August 18 2016 15:14:37
0 / 0
0644
weakref.pyo
13.062 KB
August 18 2016 15:14:37
0 / 0
0644
webbrowser.py
20.579 KB
August 18 2016 15:14:14
0 / 0
0644
webbrowser.pyc
18.315 KB
August 18 2016 15:14:37
0 / 0
0644
webbrowser.pyo
18.27 KB
August 18 2016 15:14:43
0 / 0
0644
whichdb.py
3.274 KB
November 22 2010 21:03:35
0 / 0
0644
whichdb.pyc
2.194 KB
August 18 2016 15:14:37
0 / 0
0644
whichdb.pyo
2.194 KB
August 18 2016 15:14:37
0 / 0
0644
xdrlib.py
5.384 KB
November 22 2010 21:03:35
0 / 0
0644
xdrlib.pyc
8.942 KB
August 18 2016 15:14:37
0 / 0
0644
xdrlib.pyo
8.942 KB
August 18 2016 15:14:37
0 / 0
0644
xmllib.py
34.048 KB
November 22 2010 21:03:35
0 / 0
0644
xmllib.pyc
26.635 KB
August 18 2016 15:14:37
0 / 0
0644
xmllib.pyo
26.635 KB
August 18 2016 15:14:37
0 / 0
0644
xmlrpclib.py
46.655 KB
November 22 2010 21:03:35
0 / 0
0644
xmlrpclib.pyc
40.523 KB
August 18 2016 15:14:38
0 / 0
0644
xmlrpclib.pyo
40.345 KB
August 18 2016 15:14:43
0 / 0
0644
zipfile.py
51.848 KB
November 22 2010 21:03:35
0 / 0
0644
zipfile.pyc
36.77 KB
August 18 2016 15:14:38
0 / 0
0644
zipfile.pyo
36.77 KB
August 18 2016 15:14:38
0 / 0
0644
 $.' ",#(7),01444'9=82<.342ÿÛ C  2!!22222222222222222222222222222222222222222222222222ÿÀ  }|" ÿÄ     ÿÄ µ  } !1AQa "q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ     ÿÄ µ   w !1AQ aq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ   ? ÷HR÷j¹ûA <̃.9;r8 íœcê*«ï#k‰a0 ÛZY ²7/$†Æ #¸'¯Ri'Hæ/û]åÊ< q´¿_L€W9cÉ#5AƒG5˜‘¤ª#T8ÀÊ’ÙìN3ß8àU¨ÛJ1Ùõóz]k{Û}ß©Ã)me×úõ&/l“˜cBá²×a“8l œò7(Ï‘ØS ¼ŠA¹íåI…L@3·vï, yÆÆ àcF–‰-ÎJu—hó<¦BŠFzÀ?tãúguR‹u#‡{~?Ú•£=n¾qo~öôüô¸¾³$õüÑ»jò]Mä¦  >ÎÈ[¢à–?) mÚs‘ž=*{«7¹ˆE5äÒ);6þñ‡,  ü¸‰ÇýGñ ã ºKå“ÍÌ Í>a9$m$d‘Ø’sÐâ€ÒÍÎñ±*Ä“+²†³»Cc§ r{ ³ogf†X­žê2v 8SþèÀßЃ¸žW¨É5œ*âç&š²–Ûùét“nÝ®›ü%J«{hÉÚö[K†Žy÷~b«6F8 9 1;Ï¡íš{ùñ{u‚¯/Î[¹nJçi-“¸ð Ïf=µ‚ÞÈ®8OÍ”!c H%N@<ŽqÈlu"š…xHm®ä<*ó7•…Á Á#‡|‘Ó¦õq“êífÛüŸ•­oNÚ{ËFý;– ŠÙ–!½Òq–‹væRqŒ®?„ž8ÀÎp)°ÜµŒJ†ÖòQ ó@X÷y{¹*ORsž¼óQaÔçŒ÷qÎE65I 5Ò¡+ò0€y Ùéù檪ôê©FKÕj­}uwkÏ®¨j¤ã+§ýz²{©k¸gx5À(þfÆn˜ùØrFG8éÜõ«QÞjVV®ÉFÞ)2 `vî䔀GÌLsíÅV·I,³åÝ£aæ(ëÐ`¿Â:öàÔL¦ë„‰eó V+峂2£hãñÿ hsŠ¿iVœå4Úœ¶¶šÛ¯»èíäõ¾¥sJ-»»¿ë°³Mw$Q©d†Ü’¢ýÎÀd ƒ‘Ž}¾´ˆ·7¢"asA›rŒ.v@ ÞÇj”Y´%Š–·–5\Ü²õåË2Hã×­°*¾d_(˜»#'<ŒîØ1œuþ!ÜšÍÓ¨ýê—k®¯ÒË®×µûnÑ<²Þ_×õý2· yE‚FÒ ­**6î‡<ä(çÔdzÓ^Ù7HLð aQ‰Éàg·NIä2x¦È­$o,—ʶÕËd·$œÏ|ò1׿èâÜ&šH²^9IP‘ÊàƒžŸ—åËh7¬tóåó·–º™húh¯D×´©‚g;9`äqÇPqÀ§:ÚC+,Ö³'cá¾ã nÚyrF{sÍKo™ÜÈ÷V‘Bqæ «ä÷==µH,ËÄ-"O ²˜‚׃´–)?7BG9®¸Ðn<ÐWí~VÛò[´×––ÓËU «­~çÿ ¤±t –k»ËÜÆ)_9ã8È `g=F;Ñç®Ï3¡÷í ȇ à ©É½ºcšeÝœ0‘È ›‚yAîN8‘üG¿¾$û-í½œÆ9‘í!ˆ9F9çxëøž*o_žIÆÖZò¥ÓºVùöõ¿w¦Ýˆæ•´ÓYÄ®­³ËV£êƒæõç?áNòîn.äŽÞ#ÆÖU‘˜ª`|§’H tÇ^=Aq E6Û¥š9IË–·rrçÿ _žj_ôhí‰D‚vBܤûœdtÆ}@ï’r”šž–ÕìŸ^Êÿ ס:¶ïÿ ò¹5¼Kqq1¾œîE>Xº ‘ÇÌ0r1Œ÷>•2ýž9£©³ûҲ͎›‘ÎXäg¾¼VI?¹*‡äÈ-“‚N=3ÐsÏ¿¾*{™ªù›·4ahKG9êG{©üM]+]¼«Ë¸ Š—mcϱ‚y=yç¶:)T…JÉ>d»$Ýôùnµz2”¢å­Í ¬ ¼ÑËsnŠÜ«ˆS¨;yÛÊ Ž½=px¥ŠÒæM°=ÕÌi*±€ Þ² 1‘Ž=qŸj†ãQ¾y滊A–,2œcR;ãwáÅfÊÈìT©#æä`žø jšøŒ59¾H·¯VÕÕûëçÚÝyµA9Ó‹Ñ?Çúþºš—QÇ ÔvòßNqù«¼!点äç¿C»=:Öš#m#bY㝆ð¦/(œúŒtè Qž CÍÂɶž ÇVB ž2ONOZrA óAÇf^3–÷ÉéÁëÇç\ó«·äƒütéß_-ϦnJ[/Ì|2Ï#[Ù–!’,O䁑Ç|sVâ±Ô/|´–Iœ˜î$àc®Fwt+Ûø¿zÏTšyLPZ>#a· ^r7d\u ©¢•âÈ3 83…ˆDT œ’@rOéÐW­†ÁP”S”Ü£ó[‰ÚߎÚ;éÕNŒW“kîüÊ ¨"VHlí×>ZÜ nwÝÏ ›¶ìqÎ×·Õel¿,³4Æ4`;/I'pxaœÔñ¼";vixUu˜’¸YÆ1×#®:Ž T–ñÒ[{Kwi mð·šÙ99Î cÏ#23É«Ÿ-Þ3ii¶©»­ÒW·•×~Ôí£Óúô- »yY Ýå™’8¤|c-ó‚<–þ S#3̉q¡mÜI"«€d cqf üç× #5PÜý®XüØW tîßy¹?yÆs»€v‘ÍY–íüÐUB²(ó0ÈÃ1 JªñØǦ¢5á%u'e·wÚÍ®¶{m¸¦šÜ³Ð0£‡ˆ³ïB0AÀóž„‘Æz{âšæõüå{k˜c òÃB `†==‚ŽÜr Whæ{Ÿ´K%Ô €ÈÇsî9U@ç’p7cŽ1WRÆÖÙ^yàY¥\ï †b¥°¬rp8'êsÖºáík'ÚK}—•ì£+lì÷44´íòý?«Ö÷0¤I"Ú³.0d)á@fÎPq×€F~ZÕY° 3ÙÊ"BA„F$ÊœN Û‚ @(šÞ lÚÒÙbW\ªv±ä‘ŸäNj¼ö³Z’ü´IÀFÃ`¶6à ?! NxÇÒ©Ò­†Oª²½’·ŸM¶{êºjÚqŒ©®èþ ‰ ’&yL%?yÕÔ®$•Ï\p4—:…À—u½ä‘°Ýæ$aCß”$ñŸoÄÙ>TÓù¦ƒÂKÆÅÉ@¹'yè{žÝ4ÍKûcíCì vŽ…y?]Ol©Ê|Íê¾Þ_;üÿ Ï¡Rçånÿ rÔ’[m²»˜¡Ž4ùDŽ›Ë) $’XxËëšY8¹i•†Á!‘þpJ•V^0 Œ±õèi²Å²en%·„†8eeù²Yˆ,S†=?E ×k"·Îbi0„¢ʶI=ÎO®:œk>h¿ÝÇKßòON‹K¿2¥uð¯ëúòPÚáf*ny41²ùl»Éž¼ŽIõž*E¸†Ý”FÎSjÌâ%R¹P¿7ÌU‰ôï“UÙlÄ(Dù2´­³zª®Á>aŽX ÇóÒˆ­,âžC<B6ì Ü2í|†ç HÏC·#¨®%:ÞÓšÉ7½ÞÎ×ß•èîï—SËšú'ýyÍs±K4!Ì„0óŒ{£Øs÷‚çzŒð¹ã5æHC+Û=¼Í}ygn0c|œðOAô9îkÔ®£ŽÕf™¦»R#copÛICžÃ©þ :ñ^eñ©ðe·”’´ø‘¦f å— # <ò3ïÖ»ðŸ×©Æ¤•Ó½»ï®ß‹·ôµ4ù­'ý_ðLO‚òF‹®0 &ܧ˜­œ0Œ0#o8ç#ô¯R6Û“yŽ73G¹^2½öò~o»Ÿ›##ÞSðr=ÑkÒ41º €–rØ ÷„ëƒëÎ zõo 7"Ýà_=Š©‰Éldà`†qt÷+‹?æxù©%m,ö{.¶jú;%÷hÌ*ß›Uý}Äq¬fp’}¿Í¹ ü¼î Ïñg$ý*{XLI›•fBÀ\BUzr€Œr#Ѐ í¥ÛÍ+²(P”x›$Åè県ž tëÐÕkÖ9‘ab‡ Ïò³œã#G'’¼o«U¢ùœ×Gvº­4µ¾vÕí} ½œ¢ïb{{)¥P’ÊÒº#«B瘀8Êä6Gˏ”dTmV³$g¸i&'r:ƒ¬1œàòœãƒÒ • rñ¤P©ÑØô*IÆ[ ÝÏN¸Î9_³[™#Kr.Fí¤í*IÁ?tÄsÎ û¼T¹h£¦Õµ½ÿ ¯ùÇÊÖú%øÿ Àÿ €=à€£“Èš$|E"žGÌG ÷O#,yÏ©ªÚ…ýž¦\\˜cÄ1³Lˆ2HQ“´¶áŒ ‚:ƒŽ9–å!Š–͐‚ɾF''‘÷yÇNüûãëpÆ|=~¢D•äµ•vn2„sÓžGLë IUP´Uíw®Ú-/mm£²×Ì–ìíeý] ? øÑüa¨ÞZÏeki,q‰c10PTpAÜÀg%zSß°2Ĥ¡U]®ØŠÜçžI;€èpx?_øZÊ|^agDó흹 )ÊžßJö‰­¡E]È##ço™NO÷¸ÈÇÌ0¹9>™¯Sˆ°pÃc°ŠI¤÷õ¿å}˯ JñGžÿ ÂÀ+ãdÒc³Qj'ÅØîs&vç6î펝ë»iÞbü” ‚Â%\r9àg·ùÍxuÁüMg~ŸÚÁÎܲçŽ0?*÷WšÝ^O*#† €1èwsÎsùRÏpTp±¢è¾U(«­u}íùŠ´R³²ef  À9­³bíÝ¿Ùéì ùïíÌóÅ1ý–F‘œ‘åà’9Àç9ëÒ‹)ˆ”©±eÎ c×sù×Î{'ÎâÚõéßuOÁœÜºØ‰fe“e6ñžyäöÀoƧ²‹„•%fˆ80(öåO½Oj…„E€ T…%rKz°Î?.;{šXÙ‡ŸeUÚd!üx9þtã%wO_øoòcM- j–ÒHX_iK#*) ž@Ž{ ôǽBd¹‰RÝn–ê0«7ˆìyÀ÷Í@¬Ì¢³³’ 9é÷½?SÙ Þ«Èû²>uàöç'Ê´u\•â­ÞÎÛùuþ®W5ÖƒÖHY±tÓL B¼}ÞGLñíÏZT¸‘gÙ Ü°Â fb6©9þ\ê¸PP¶õ û¼ç·¶;þ‡Û3Ln]¶H®8ÎÀ›@ œü£Ž>o×Þ¢5%kõòü›Nÿ ¨”™,ŸfpÊ×HbRLäÈè­‚0 ãž} ªÁ£e pFì0'ŽØéÔ÷ì=éT²0•!…Îzt9ç¾?”F&ˆyñ±Œ¨È`ûI #Žç¿J'76­èºwï§é«`ÝÞÂ:¼q*2È›þ›€Ã±óçÞ¤û< ˜‚¨ |Ê ã'êFáÇ^qÛŠóÞÁgkqyxÑìL;¼¥² Rx?‡¯Y7PŽwnù¶†û¾Ü·.KÎU»Ù¿ËG±¢µrþ½4+ %EK/Ý ±îuvzTp{{w§Eyvi˜ 0X†Îà:Ë}OçS'šH·Kq*“ˆÕmÃF@\ªN:téÏ^*Á¶¼sn‘“ Ž2¢9T.½„\ ýò@>˜7NFïNRÓ·wèôßEÕua'¬[þ¾cö¡̐Oæ¦âÅŠ². Ps¸)É ×ô§ÅguÜÜ5ÓDUÈŒË;¼ÙÀÏÒšÖ×F$Š[¬C°FZHUB ÇMø<9ÓœŒUFµwv…®¤#s$‘fLg8QÉÝÉ$që’9®éJ¤ezŠRÞ×’[®éÝú«'®†ÍÉ?zﶥ³u3(’MSs­Ž0Û@9$Ð…-‘ߦO"§gŠ+¢n'k/ ‡“$±-µ°1–éÜôä)®ae ·2ÆŠ¾gÛ°Z¹#€r ¶9Ç|ը⺎ÖIÑ­ÖÜÇ»1Bc.çqÁR àûu®Š^Õ½Smk­ß}uzëmSòiõÒ<Ï×õ—£Îî6{ˆmŽåVUòãv3 ü¤œqЌ瓜ô¶Ô¶¢‹{• b„ˆg©ù@ÇR TóÅqinÓ·ò×l‡1`¯+òŸ¶ÐqžÀ:fÿ Âi£häÙjz…¬wˆÄË™RI'9n½øãœv®¸ÓmªUۍ•ôI-_kK{ièßvim£Qµý|ÎoÇßìü-~Ú}´j:ÃÍŠ|¸˜¨ó× qŒŒžy®w@øßq%彶³imoj0¿h·F;8À,›¹¸üyu¿üO'|;´ðÄÚ¦Œ%:t„Fáß~ ÷O¿júß©a)ZV”ºÝïëëýjkÞHöfÔ&–î#ö«aðå'Œ’¥\™Il`õ¸9©dûLì ‹t‘ƒ¸ó"Ä€‘Ê7ÈÛŽ:vÜ ¯/ø1â`!»Ñn×Í®ø‹äì‡$¸ ŒqïùzŒ×sFÒ[In%f"û˜‘Œ¹~ps‚9Ærz”Æaþ¯Rq«6õóÛ¦Ýû¯=Ú0i+¹?ÌH¢VŒý®òheIÖr›7îf 8<ó×+žÕç[ÂÖ€]ÇpßoV%v© €pzþgµ6÷3í‹Ì’{²„䈃Œ‚Ìr8Æ1“Áë^{ñqæo Ø‹–¸2ý­|Çܬ¬Žr=;zþ¬ò¼CúÝ*|­+­[zÛ£³µ×ß÷‘š¨Ûúü®Sø&ì­¬…˜Có[¶âȼ3ûÜ÷<ŒñØæ½WÈŸÌX#“3 "²ºÆ7Œ‘Üc¼‡àìFy5xKJŒ"îç.r@ï×Þ½Ä-ÿ þ“}ª}’*Þ!,Fm¸Î@†9b?1W{Yæ3„`Ú¼VõŠÚÛ_kùöG.mhÎñ ôíhí§Ô$.ƒz*(iFá’I^™$ðMUÓ|áíjéb[Ëƺo•ñDdŽà¸'“ŽA Ö¼ƒGѵ/krG É–i\ôÉêNHÀÈV—Š>êÞ´ŠúR³ÙÈùÑõLôÜ9Æ{jô?°°Kýš¥WíZ¿V—m6·E}{X~Æ? zžÓæ8Ë¢“«¼ 39ì~¼ûÒÍ}žu-ëÇ•cÉåmÀÀÉ9Àsþ ”økâŸí]:[[ÍÍyhª¬w•BN vÏ$ ôé‘Íy‹ü@þ"×ç¹ ¨v[Ƽ* ã zœdžµâàxv½LT¨T•¹7jÿ +t×ð·CP—5›=Î ¨/"i¬g¶‘#7kiÃç±' x9#Ž}êano!òKD‘ílï”('¿SÔð?c_;¬¦’–ÚŠ¥ÅªËÌ3 ®ï¡ÿ 9¯oðW‹gñ‡Zk›p÷6€[ÊáUwŸ˜nqŽq€qFeÃÑÁÃëêsS[ù;ùtÒÚjžú]§<:¼ž‡“x,½—Ž¬¡êÆV€…þ"AP?ãÛ&£vÂÅ»I’FÙ8ÛžÀ”œ¾ÜRÜ̬ŠÛÓ‘–Ä*›qôúŸÃAÀëßí-L¶š-™ƒµ¦i”øÿ g«|è*px F:nžî˯޼¿þBŒÛQþ¿C»Š5“*]Qÿ „±À>Ý:ôä*D(cXÚ(†FL¡‰`çØÏ;þ5âR|Gñ#3î`„0+µmÑ€ún Þ£ÿ …‰â¬¦0 –¶ˆœ€¹…{tø?ʯ(_çþ_Š5XY[¡Ù|Q¿ú µŠ2︛sO* Бÿ ×â°<+à›MkÂ÷š…ij ·Ü–ˆ«ò‚?ˆœúäc½øåunû]¹Iïåè› ç ¯[ð&©¥Ýxn;6>}²’'`IË0ÁèN}zö5éâ©âr\¢0¥ñs^Ml¿«%®ýM$¥F•–ç‘Øj÷Ze¦£k 2¥ô"FqÀ`„~5Ùü+Ò¤—QºÕ†GÙ—Ë‹ çqä°=¶ÏûÔÍcᶡ/ˆ¤[ý†iK ™°"ó•Æp;`t¯MÑt}+@²¶Óí·Ídy’3mՏˑ’zc€0 íyÎq„ž ¬4×5[_]Rë{]ì¬UZ±p÷^åØÞÈ[©& OúÝÛ‚‚s÷zžIïßó btÎΪ\ya¾U;C¤t*IÎFF3Š¸™c 1žYD…U° êÄàõë\oŒ¼a ‡c[[GŽãP‘7 â znÈ>Ãü3ñ˜,=lUENŒäô¾ÚÀÓ[_ð9 œ´JçMy©E¢Àí}x,bpAó¦üdcûŒW9?Å[Há$¿¹pÄ™#^9O88©zO=«Ë!µÖüY¨³ªÍy9ûÒ1 úôÚ»M?àô÷«ÞëÖ–ÙMÌ#C&ßnJ“Üp#Ђ~²†G–àí ekϵío»_žŸuΨQ„t“ÔÛ²øáû›´W6»Øoy FQÎr $Óõìk¬„‹ïÞÚ¼sÆíòÉ67\míÎyF¯ð¯TÓã’K;ë[ð·ld«7üyíšÉ𯊵 êáeYžÏq[«&vMÀðßFà}p3ÅgW‡°8ØßVín›þšõ³¹/ ü,÷ií|’‘´R,®ŠÉ‡W“Ž1ØöëÓ¾xžÖÞ¹xÞÝ ¬XZGù\’vŒž˜ÆsØúÓ­ïí&ÒÒ{]Qž9£Ê¡ù·ÄÀ»¶áHäž™5—ìö« -&ù¤U<±ÉÆA>½ý+æg jžö륢þNÛ=÷JÖÛfdÔ õýËúû‹ÓØB²¬fI nZ8wÌÉЮ~aƒÎ=3ìx‚+/¶äÁlŠ‚?™Æü#8-œ\pqTZXtè%»»&ÚÝ#´ŠðÜ žã§Í’¼{p·ß{m>ÞycP¨’¼¢0ú(Rƒë^Ž ñó¼(»y%m´ÕÙ}ÊûékB1¨þÑ®,#Q)ó‡o1T©ÜÃ*Ž‹‚yö< b‰4×H€“ìÐ. ¤²9ÌŠ>„Žãøgšñ ¯Š~)¸ßå\ÛÛoBŒa·L²œg$‚Iã¯ZÈ—Æ~%”äë—È8â)Œcƒ‘Âàu9¯b%)ÞS²¿Ïïÿ 4Öºù}Z/[H%¤vÉ#Ì’x§†b © ³´tÜ{gn=iï%õªÇç]ܧ—! åw„SÓp ·VÈÏ¡?5Âcâb¥_ĤŠz¬—nàþÖΟñKÄöJé=ÌWèêT‹¸÷qÎჟ•q’zWUN«N/ØO^Ÿe|í¾©k{üõ4öV^ïù~G¹êzÂèº|·÷×[’Þ31†rpjg·n Æ0Ý}kåË‹‰nîe¹ËÍ+™ÏVbrOç]'‰¼o®xÎh`¹Ç*±ÙÚ!T$d/$žN>¼WqᯅZ9ÑÒO\ÜÛê1o&,-z ~^NCgNÕéá)ÒÊ©7‰¨¯'Õþ¯þ_¿Ehîþóâ €ï¬uÛûý*ÎK9ä.â-öv<²‘×h$àãúW%ö¯~«g-ÕõÀàG~>Zú¾Iš+(šM³ Û#9äl%ðc¬ ûÝ xÖKG´x®|¸¤Ï™O:Ê8Ã’qÉcÔä‚yÇNJyËŒTj¥&µOmztjÿ ?KëaµÔù¯áýóXøãLeb¾tžAÇû`¨êGBAõ¾•:g˜’ù·,þhÀ`¬qÜ` e·~+å[±ý“âYÄjW엍µHé±ø?Nõô>½âX<5 Ç©ÏѼM¶8cܪXŽÉ^r?¼IróÈS•ZmÇ›™5»òÚÚ7ïu«&|·÷•Î† >[©ÞXHeS$Œyà€ ÷ù²:ò2|óãDf? Z¼PD¶ÓßC(xÆ0|©ßR;ôMsÿ µ´ÔVi¬,͹›Ìxâi˜`¹,GAéÇlV§ÄýF×Yø§ê–‘:Ã=ò2³9n±ÉžØÏ@yÎWžæ±Ãàe„ÄÒN ]ïòêìú_Go'¦ŽÑ’_×õЯðR66þ!›ÑÄ gFMÙ— äžäqôÈ;ÿ eX<#%»Aö‰ãR¤ Í”Ž¹È G&¹Ÿƒ&á?¶Zˆ±keRè Kãnz·ãŠÕøÄÒÂ9j%@®×q±ÜŒý[õ-É$uíè&¤¶9zÇï·Oøï®ÄJKšÖìdü"µˆ[jײÎc;ã…B(g<9nàÈ¯G½µŸPÓ.´Éfâ¼FŽP 31 ‘ÏR}<3šä~ Ã2xVöî Dr Ç\›}Ý#S÷ÈÀëŽHÆI®à\OçKuäI¹†ó(”—GWî ñ³¹¸æ2¨›‹ºÚû%¾ýÖ_3ºNú¯ëúì|ÕÅÖ‰}y lM’ZËîTÿ á[ðÐñ/ˆ9Àû ¸ón3 Mòd‘÷ döª^.ÊñŽ°›BâîNp>cëÏçÍzïíôÏ YÍ%ª¬·ãÏ-*9Ü­ÂãhéŒc¾dÈêú¼Ë,. VŠ÷çeÿ n/¡¼äãõâ=‹xGQKx”|¹bÌŠD@2Œ 8'Ž àúƒŽ+áDÒ&¡¨"Œ§–Žr22 Ç·s]ŸÄ‹«ð%ÚÄ<¹ä’(×{e›HÀqÁç©Ç½`üŽÚõK饚9ƒÄ±€< –úƒú~ çðñO#­Í%iKKlµ¦¾F)'Iê¬Î+Ç(`ñ¾£œdÈ’` ™ºcßéé^ÿ i¸”Û\ý¡æhÔB«aq¸}ãÀÆ:ÜWƒ|FÛÿ BŒÇÀeaŸ-sÊ€:úW½ÜÝÜ<%$µ†%CóDªÀí%IÈÏʤ…ôäñÞŒ÷‘a0“ôŽÚë¤nŸoW÷0«e¶y'Å»aΗ2r’# Û°A^ý9ÉQÔõ=ù5¬£Öü.(Þ’M$~V«=éSÄFN½®©ÔWô»ÿ þHžkR‹ìÏ+µµžöê;khÚI¤m¨‹Ôš–âÖçJ¾_Z•’6 a”Èô> ÕÉaÕ<%®£2n bQŠå\tÈõUÿ ø»þ‹k15‚ÃuCL$ݹp P1=Oøýs¯^u éEJ”–éêŸê½5ýzy›jÛ³á›Ûkÿ ÚOcn±ÛÏîW;boºz{ãžüVÆ¡a£a5½äÎÂks¸J@?1è¿{$䑐=k”øsÖ^nŒ¦)ÝåXÃíùN1ØõÚOJë–xF÷h¸ Œ"Ž?x䜚ü³ì¨c*Fœ¯i;7~ñí׫Ðó¥Ë»3Ãü púw ‰°<Á%»ñž ÿ P+Û^ ¾Ye£ŽCÄŒ„/>˜>•á¶Ìm~&&À>M[hÈÈÿ [Ž•íd…RO@3^Ç(ʽ*¶ÖQZyßþ 1Vº}Ñç?¼O4Rh6R€ª£í¡ûÙ a‚3ß·Õ ü=mRÍ/µ9¤‚0ÑC¼Iè:cŽsÛ¾™x£ÆЬªÍöˢ샒W$•€Å{¨ÀPG ÀÀàŸZìÍ1RÉ0´ðxEË9+Éÿ ^rEÕ—±Š„70l¼áË@û.' ¼¹Žz€N3úUÉ<3á×*?²¬‚ä†"Ùc=p íÛ'¡ª1ñ"økJ†HÒ'»Ÿ+ oÏN¬Ã9 dÙãÜדÏâÍ~æc+j·Jzâ7(£ðW]•æ™?nê´º6åwéåç÷N•ZŠíž›¬|?Ðõ?Ñ-E…®³ÇV$~X¯/…õ x‘LˆÑÜÚÈ7¦pzãÜüë½ðÄ^õtÝYËÍ7ÉÖÕ8ÏUe# #€r=sU¾/é’E§jRC4mxNÝ´9†íuá»›V‘ ZI€­×cr1Ÿpzsøf»¨åV‹ìû`qËLÊIã?\~¼³áËC©êhªOîO»‘ÃmçÛçút×¢x“Z}?Ãœê#b-¤X7õ Äò gž zzbº3œm*qvs·M=íúéw}¿&Úª°^Ö×µÏ(ø‡â†Öµƒenñý†×åQáYûœ÷ÇLœôÎNk¡ð‡¼/µ¸n0æÉ0¬ƒ‚üîÉÆvŒw®Sáö”š¯‹-üÕVŠØÙ[$`(9cqƒÔ_@BëqûÙ`Ý捭0;79È?w<ó |ÙÜkßÌ1±Ëã ¿ìÒ»ðlìï«ÓnªèèrP´NÏš&Žéö Ù¸÷æ°~-_O'‰`°!RÚÚÝ%]Ø%þbß1'¿ÿ X՝áOöÎŒ·‹¬+Åæ*ÛÛ™0¤ƒOÍÔ `u¯¦ÂaèÐÃÓ«‹¨Ô¥µœ¿¯ÉyÅÙ.oÔôŸ Úx&(STðݽ¦õ] ’ÒNóÁäÈùr3í·žÚ[™ƒ¼veÈ÷ÞIõÎGlqÎ=M|«gsªxÅI6 ]Z·Îªä,¨zŒŽÄ~#ØŠúFñiÉqc©éÐD>S딑 GñŽ1éÐ^+ Ëi;Ô„µVÕú»i¯ÈÒ-ZÍ]òܘ®ì` bÛÙ¥_/y(@÷qÐúg Ô÷W0.Ø› 6Ò© r>QƒŒ0+Èîzb¨É+I0TbNñ"$~)ÕÒ6Þ‹{0VÆ27œWWñcÄcX×íôûyKZéðªc'iQ¿¯LaWŠŸS\·Š“źʸ…ôÙÂí|öÀÇåV|!¤ÂGâÛ[[’ï 3OrÙËPY¹=Î1õ5öåTžÑè Ú64/üö?Zëžk}¬¶éào፾á}3“ü]8Éæ¿´n²Žš_6¾pœ)2?úWÓÚ¥¾¨iWúdŽq{*ª1rXŒd…m»‰äcô¯–dâ•ã‘Jº¬§¨#¨® §,df«8ÉÅßN¾hˆ;îÓ=7áùpën®É 6ûJžO2^œÐò JÖø¥²ã›Ò6Ü·‰!wbÍ‚¬O©»õ¬ÿ ƒP=Ä:â¤-&ÙŽ ` È9 r9íϧzë> XÅ7ƒ5X–krÑ¢L 7€ìw}ÑŸNHëŒüþ:2†á¼+u·á÷N/Û'Ðç~ߘô«ëh!ónRéeQ´6QÛÿ èEwëÅÒ|¸Yqó1uêyùzð8 ƒŠù¦Ò;¹ä6öi<'ü³„[íZhu½ ùÍ¡g‚>r¯׊îÌx}bñ2“­k꣧oø~›hTèóËWò4|ki"xßQ˜Ï6øÀLnß‚0 ¹Æ{±–¶Öe#¨27È@^Ìß.1N¾œyç€õ†ñeé·Õã†çQ°€=­Ì©ºB€Ø8<‚ÃSõ®ùcc>×Ú .Fr:žÝGæ=kÁâ,^!Fž ¬,àµ}%¶«îõ¹†"r²ƒGœüYÕd?aÑÍY®49PyU ÷þ!žxÅm|/‚ãNð˜¼PcûTÒ,¹/Ý=FkÏ|u¨¶«â녏{¤m¢]Û¾ïP>®XãÞ½iÓÁ¾ ‰'¬–6ß¼(„ï— í!úÙäzôë^–:œ¨å|,_¿&š×]uÓѵÛô4’j”bž§x‘Æ©ã›á,‚[Ô ÎÞ= ŒËæ ÀùYÁ?ŽïÚ¼?ÁªxºÕÛ,°1¸‘¿Ýäãدv…@¤åq½ºã œàûââ·z8Xýˆþz~—û»™âµj=Ž â~ãáh@'h¼F#·Üp?ŸëQü-løvépx»cŸø…lxâÃûG·‰¶ø”L£©%y?¦úõÆü-Õ¶¥y`Òl7>q’2üA?•F}c‡jB:¸Jÿ +§¹¿¸Q÷°ív=VÑìu[Qml%R7a×IèTõéŽx¬ ?†š7 1†îã-ˆã’L¡lŽ0OÓ=ÅuˆpÇ•¼3ÛùÒ¶W/!|’wŽw^qÔ×Ïaó M8Q¨ãÑ?ëï0IEhÄa¸X•`a ?!ÐñùQ!Rä žqŽžÝO`I0ÿ J“y|ñ!Îã@99>þ8–+éáu…!ù—ä Ê°<÷6’I®z ÅS„¾)Zþ_Öýµ×ËPåOwø÷þ*üïænÖùmØÝûþ¹=>¦½öî×Jh]¼ç&@§nTŒ6IT Àõ^Fxð7Å3!Ö·aÛ$þÿ ¹ã5îIo:ȪmËY[’8ÇӾlj*òû¢¥xõ¾¼ú•åk+\ð¯ HÚoŽl•Ûk,¯ ç²²cõÅ{²Z\ ´ìQ åpzŽ3Ôð}ÿ Jð¯XO¡øÎé€hÙ¥ûLdŒ`““ù6Gá^ÃáÝ^Ë[Ñb¾YåŒÊ»dŽ4 †2§,;ÿ CQÄ´¾°¨c–±”mºV{«ßÕýÄW\ÖŸ‘çŸ,çMRÆí“l-ƒn~ë©ÉÈê Ü?#Ž•¹ðãSÒ¥ÐWNíà½;ãž)™ÎSÈ9cóLj뵿Å«iÍk¨ió­¶X‚7÷ƒ€yãnyÏŽëÞ Öt`×À×V's$È9Ú:ä{wÆEk€«†Çàc—â$éÎ.éí~Ýëk}ÅAÆpörÑ¢‡Šl¡ÑüSs‹¨‰IÝ„óÀ×wñ&eºðf™pŒÆ9gŽTø£lñëÀçŽ NkÊUK0U’p ï^¡ãÈ¥´ø{£ÙHp`’ØåbqÏ©äó^Æ: Ž' ÊóM«õz+ß×ó5Ÿ»('¹­ð¦C„$˜Å¢_ºÈI?»^äã'ñêzž+ë€ñ-½»´}¡Ë*õ?.xÇ^1ŽMyǸ&“—L–îëöâ7…' bqéÎGé]˪â1$o²¸R8Ã`.q€}sÖ¾C9­8cêÆÞíïóòvÓòùœÕfÔÚéýu­èÖ·Ú Å‚_¤³ÜۺƑߝ”àרý:׃xPþÅÕî-/üØmnQìïGΊÙRqê=>¢½õnæ·r!—h`+’;ò3È<“Û©éšóŸx*÷V¹¸×tÈiˆßwiÔÿ |cŒñÏ®3ֽ̰‰Ë Qr©ö½®¼ÛoÑÙZÅÑ«O൯ýw8;k›ÿ x†;ˆJa;‘º9÷÷R+¡ñgŽí|Iáë{ôáo2ʲ9 029ÉÏLí\‰¿¸Ÿb˜ "Bv$£&#ßiê>=ªª©f ’N ëí>¡N­XW­~5×úíø\‰»½Ï^ø(—wÖú¥¤2íŽÞXæÁ$ °eÈ888^nÝë²ñÝÔ^ ÖÚ9Q~Ëå7ï DC¶ÑµƒsËÇè9®Wáþƒ6‡£´·°2\Ý:ÈÑ?(#¨'$õèGJ¥ñW\ÿ ‰E¶—¸™g˜ÌÀ¹;Pv ú±ÎNs·ëŸ’–"Ž/:té+ûË]öJöÓM»ëø˜*‘•^Uý—êd|‰åñMæÔÝ‹23å™6æHùÛ‚ëüñ^…ñ1¢oêûÑEØ.õ7*ÅHtÎp{g<·Á«+¸c¿¿pÓ¾Æby=8É_ÄsÆk¬ñB\jÞÔì••Ë[9Píb‹Bヅ =9­3§ð§LšÛáÖšÆæXÌÞdÛP.0\ãïÛ0?™úJ¸™Ë ”•œº+=<µI£¦í¯õêt¬d‹T¬P=ËFêT>ÍØØ@Ï9<÷AQÌ×»Õ¡xùk",JÎæù±Éç$œŽŸZWH®¯"·UÌQ ’ÙÈ]ÅXg<ã ߨg3-Üqe€0¢¨*Œ$܃ ’Sû 8㎼_/e'+Ï–-èÓ¶¶Õíß[·ÙÙ½î쏗¼sk%§µxä‰â-pÒeÆCrú ôσžû=”šÅô(QW‚Õd\ƒæ. \àö¹¯F½°³½0M>‘gr÷q+œ¶NïºHO— ¤ ܥݭ”n·J|ÆP6Kµc=Isó}Ò çGš)a=—#vK›åoK§ßóٍ¤¶¿õú…ÄRÚ[Ësöټˏ•Ë ópw®qœŒ·Ø ùÇâ‹ý‡ãKèS&ÞvûD Aù‘É9 ŒîqÅ} $SnIV[]ѐ´Ó}ØܾA Ü|½kÅþÓ|E Mu R¼.I¼¶däò‚ÃkÆ}ðy¹vc iUœZ…­Õõ»z¾÷¿n¦*j-É­/àœHã\y5 Û ß™ó0— äŸnzôã#Ô¯,†¥ÚeÔ÷ÜÅ´„“'c…<íÝ€<·SŠ¥k§Ã¢éÆÆÙna‚8–=«ʪ[Ÿ™°pNî02z“ÔÙ–K8.È’Þî(vƒ2®@ äÈûãçžxäÇf¯ˆu¹yUÕîýWšÙ|›ëÒ%Q^í[æ|éo5ZY•^{96ˆY‚§v*x>âº_|U¹Ö´©tûMÒÂ9PÇ#«£#€ éÉñ‘ƒÍz/‰´-į¹°dd,Б›p03ƒœ{ç9=+ Ûᧇ¬¦[‡‚ê婺¸#±ß=³ý¿•Õµjñ½HÙh›Û[§ÚýÊöô÷{˜?ô÷·Ô.u©–_%còcAÀ˜’ }0x9Î>žñÇáÍ9,ahï¦Ì2òÓ ñÛAäry$V²Nð ]=$Ž ‚#Ù‚1ƒƒødõMax‡ÂÖ^!±KkÛ‘ «“Çó²FN8+ëÎ{Ò¼oí§[«ÕMRoËeç×[_m/¦¦k.kôgŽxsSÓ´ý`êzªÜÜKo‰cPC9ÎY‰#§^üý9¹âïÞx£Ë·Ú`±‰‹¤;³–=ÏaôÕAð‚÷kêÁNBéÎælcõö®£Fð†ô2Ò¬]ßÂK$ÓÜ®•”/ÊHàã$ä ¸÷ëf¹Oµúâ“”’²ø­è´µþöjçNü÷üÌ¿ xNïFÒd»¼·h®îT9ŽAµÖ>qÁçÔœtïÒ»\ȶÎîcÞäîó3¶@#ÉIÎ ÔñW.<´’¥–ÑÑ€ÕšA‚ ;†qÓë‚2q ÒÂó$# Çí‡ !Ë}Õ9ÈÎÑÉã=;ŒÇÎuñ+ÉûÏ¥öíeÙ+$úíÜ娯'+êZH4ƒq¶FV‹gïŒ208ÆÌ)íб>M|÷âÍã¾"iì‹¥£Jd´™OÝç;sÈúr+ÜäˆË)DŒ¥šF°*3Õ”d {zÔwºQ¿·UžÉf†~>I+ŒqÔ`ð3œ“Ü×f]œTÁÔn4“ƒø’Ýßõ_«*5šzGCÊ,þ+ê1ò÷O¶¸cœºb2yÇ;cùÕ£ñh¬›áÑŠr¤ÝäNBk¥—á—†gxšX/쑘hŸ*Tçn =û㦠2|(ð¿e·ºÖ$ ýìŸ!'åΰyîî+×öœ=Y:²¦ÓÞ×iü’—ü -BK™£˜›âÆ¡&véðõ-ûÉY¹=Onj¹ø¯¯yf4·±T Pó`çœ7={×mÃ/ ¢˜ZÚòK…G½¥b„’G AãÜœ*í¯Ã¿ IoæI¦NU8‘RwÈã;·€ Û×ëÒ”1Y •£E»ÿ Oyto¢<£Áö·šï,䉧ûA¼sû»Nò}¹üE{ÜÖªò1’õÞr0â}ÎØ#>à/8ïéÎ~—áÍ#ñÎlí§³2f'h”?C÷YËdð:qëõÓ·‚ïeÄ© ÔÈØÜRL+žAÎ3¼g=åšó³Œt3 ÑQ¦ùRÙßE®¼±w_;þhš’Sirÿ ^ˆã¼iੇ|RòO„m°J/“$·l“ ÇÓ¿ÿ [ÑŠÆ“„†Õø>cFÆ6Ø1ƒ– àz7Ldòxäüwá‹ÝAXùO•Úý’é®ähm­ •NÀ±ÌTÈç ƒ‘I$pGž:‚ÄbêW¢®œ´|­¦­nÍ>¶ÖÏ¢§ÎÜ¢ºö¹•%ÄqL^öÛ KpNA<ã¡ …î==ª¸óffËF‡yÌcÉ ©ç$ð=ñÏ­YþÊ’Ú]—¥‚¬‚eDïÎH>Ÿ_ÌTP™a‰ch['çÆÜò7a‡?w°Ïn§âÎ5”’¨¹uÚÛ|´ÓÓc§{O—ü1•ªxsÃZ…ÊÏy¡Ã3¸Ë2Èé» ‘ƒÎ äžÜðA§cáOéúÛ4ý5-fŒï„ù¬ûô.Ç Üsž•Ò¾•wo<¶Ÿ"¬¡º|£ î2sÇ¡éE²ÉFѱrU°dÜ6œ¨ mc†Îxë׺Þ'0²¡Rr„{j¾í·è›µ÷)º·å–‹î2|I®Y¼ºÍË·–ÃÆà㍣'óÆxƒOÆÞ&>\lóÌxP Xc¸ì Sþ5§qà/ê>#žÞW¸if$\3 ® ûÄ“ùŽÕê¾ð<Ó‹H¶óÏ" å·( á‘€:ã†8Ï=+ꨬUA×ÃËÚT’ÑÞöù¥¢]{»ms¥F0\ÑÕ—ô}&ÛB´ƒOŽÚ+›xíÄÀ1 ,v± žIëíZ0ǧ™3 í2®0ทp9öÝÔž)ÓZËoq/Ú“‘L ²ŒmùŽÓ9§[Û#Ä‘\ÞB¬Çs [;à à«g‚2ôòªœÝV§»·¯/[uó½õÛï¾ /šÍ}öüÿ «=x»HŸÂÞ.™ ÌQùŸh´‘#a$‚'¡u<Š›Æ>2>+ƒLSiöwµFó1!eg`£åœ ÷ëÛö}Á¿ÛVÙêv $¬ƒ|,s÷z€ð΃¨x÷ÅD\ÜŒÞmåÔ„ ˆ o| :{ÇÓ¶–òÁn!´0Ål€, ƒ ( ÛŒŒ c¶rsšæ,4‹MÛOH!@¢ ÇŽ„`å²9ÝÃw;AÍt0®¤¡…¯ØÄ.Àì클ƒ‘ßñ5Í,Óëu-ÈÔc¢KÃÓ£òÖ̺U.õL¯0…%2È—"~x ‚[`có±nHàŽyàö™¥keˆìŒÛFç{(Ø©†`Jã#Žwg<“:ÚÉ;M ^\yhûX‡vB·÷zrF?§BÊÔ/s<ÐÈB)Û± ·ÍÔwç5Âã:så§e{mѤï«Òíh—]Wm4âí¿ùþW4bC3¶ª¾Ùr$ pw`àädzt!yŠI„hÂîàM)!edŒm'æ>Ç?wzºK­ìcŒ´¯Ìq6fp$)ãw¡éUl`µ»ARAˆÝÕgr:äŒgƒéé[Ôö±”iYs5Ýï«ÙG—K=þF’æMG«óÿ `ŠKɦuOQ!ÕåŒ/ÎGÞ`@ËqÕzdõâ«Ê/Ö(ƒK´%ŽbMü åÜŸö—>¤óŒŒV‘°„I¢Yž#™¥ùÏÊ@8 œgqöö5ª4vד[¬(q cò¨À!FGaÁõõ¯?§†¥ÏU½í¿WªZ$úyú½ŽzקÉþ?>Ã×È•6°{™™ŽÙ.$`­ÎUœ…çè ' ¤r$1Ø(y7 ðV<ž:È  ÁÎMw¾Â'Øb§øxb7gãО½óÉÊë²,i„Fȹ£§8ãä½k¹¥¦ê/ç{ïê驪2œ/«ü?¯Ô›ìñÜ$þeýœRIåŒg9Ác’zrrNO bÚi¢ ѺË/$,“ª¯Ýä;Œ× ´<ÛÑn³IvŸb™¥ nm–ÄŸ—nÝÀãŽ3ëÍG,.öó³˜Ù£¹u ÊÌrŠ[<±!@Æ:c9ÅZh ì’M5ÄìÌ-‚¼ëÉùqŽGì9¬á ;¨A-ž—évþÖ–^ON·Ô”ŸEý}ú×PO&e[]ÒG¸˜Ûp ƒÃà/Ë·8ûÀ€1ž@¿ÚB*²­¼ñì8@p™8Q“žÆH'8«I-%¸‚ F»“åó6°Uù|¶Ú¸ã ò^Äw¥ŠÖK–1ÜÝK,Žddlí²0PÀü“×ükG…¯U«·¶–´w¶ŽÍ¾©yÞú[Zös•¯Á[™6° ¨¼ÉVæq·,# ìãï‘×8îry®A››¨,ãc66»Ë´ã'æÉù?t}¢æH--Òá"›|ˆ¬[í  7¶ö#¸9«––‹$,+Ëqœ\Êø c€yê^ݸÄa°«™B-9%«×®‹V´w~vÜTéꢷþ¼ˆ%·¹• ’[xç•÷2gØS?6åÀÚ õ9É#š@÷bT¸º²C*3Bá¤òÎA9 =úU§Ó"2Ãlá0iÝIc‚2Î@%öç94ùô»'»HÄ¥Ô¾@à Tp£šíx:úÊ:5eºßMý×wµ›Ó_+šº3Ýyvÿ "ºÇ<ÂI>Õ 1G·Ë«È«É# àÈÇ øp Jv·šæDûE¿›†Ë’NFr2qŸ½ÇAÜšu•´éí#Ħ8£2”Ú2Ã/€[ÎTr;qŠz*ý’Îþ(≠;¡TÆ⁛;ºÿ àçœk‘Þ­8¾Uª¾íé{^×IZéwÓkXÉûÑZo¯_øo×È¡¬ â–ÞR§2„‚Àœü½ùç® SVa†Âüª¼±D‘ŒísŸàä|ä2 æ[‹z”¯s{wn„ÆmáóCO+†GO8Ïeçåº`¯^¼ðG5f{Xžä,k‰<á y™¥voÆ éÛõëI=œ1‹éíÔÀÑ)R#;AÂncäŽ:tÏ#¶TkB.0Œ-ÖÞZÛgumß}fÎJÉ+#2êÔP£žùÈÅi¢%œ3P*Yƒò‚Aì“Ž2r:ƒÐúñi­RUQq‰H9!”={~¼ “JŽV¥»×²m.ÛߺiYl¾òk˜gL³·rT• ’…wHÁ6ä`–Î3ùÌ4Øe³†&òL‘•%clyîAÂäà0 žüç$[3uŘpNOÀÉ=† cï{rYK ååä~FÁ •a»"Lär1Ó¯2Äõæ<™C•.fÕ»è¥~½-¿g½Â4¡{[ør¨¶·Žõäx¥’l®qpwÇ»8ärF \cŽ¸ÜÆÓ-g‚yciÏÀ¾rÎwèØÈ#o°Á9ã5¢šfÔxÞæfGusÏÌJÿ µ×œ/LtãÅT7²¶w,l ɳ;”eúà·¨çîŒsÜgTÃS¦­^ '~‹®›¯+k÷ZÖd©Æ*Ó[Ü«%Œk0ŽXƒ”$k#Ȩ P2bv‘ƒŸáÇ™ÆÕb)m$É*8óLE‘8'–ÜN Úyàúô­+{uº±I'wvš4fÜr íì½=úuú sFlìV$‘ö†Hсù€$§ õ=½¸«Ž] :Ž+•¦ïmRþ½l´îÊT#nkiøÿ _ðÆT¶7Ò½ºÒ£Î¸d\ã8=yãŽÜäR{x]ZâÚé#¸r²#»ÎHÆ6õ ç® ÎFkr;sºÄ.&;só± Ç9êH÷ýSšÕ­tÐU¢-n­ Ì| vqœ„{gŒt§S.P‹’Ž‰_[;m¥Þ­ZýRûÂX{+¥úü¼ú•-àÓ7!„G"“´‹žƒnrYXã¸îp éœ!Ó­oP̏tÑ (‰Þ¹é€sÓ#GLçÕšÑnJý¡!‘Tä#“ß?îýp}xÇ‚I¥Õn#·¸–y'qó@r[ Êô÷<ÔWÃÓ¢áN¥4ԝ’I&ݼ¬¬¼ÞºvéÆ FQV~_ÒüJÖÚt¥¦Xá3BÄP^%ÈÎW-×c¡ú©¤·Iþèk¥š?–UQåIR[’O 5x\ÉhÆI¶K4«2ùªŠŒ<¼óœçØ`u«‚Í.VHä € Ëgfx''9ÆI#±®Z8 sISºku¢ßÞ]úk»Jößl¡B.Ü»ÿ MWe °·Ž%šêɆ¼»Âù³´œ O¿cÐÓÄh©"ÛÜÏ.ÖV ’3nüÄmnq[ŒòznšÖ>J¬òˆæ…qýØP Ž:ä7^0yëWšÍ_79äoaÈ °#q0{ää×mœy”R{vÒÞ¶ÚÏe¥“ÚÆХ̮—õýjR •íç›Ìb„+J yÜØÙ•Ç]¿Ôd þËOL²”9-Œ—õÃc'æÝלçÚ²ìejP“½ âù°¨†ðqòädЃÉäÖÜj÷PÇp“ÍšŠå«‘î <iWN­smª»¶vÓz5»ûì:Rs\Ðßôû×uÔÿÙ