p!ranha?

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>9.7. itertools — Functions creating iterators for efficient looping — Python 2.7.5 documentation</title> <link rel="stylesheet" href="../_static/default.css" type="text/css" /> <link rel="stylesheet" href="../_static/pygments.css" type="text/css" /> <script type="text/javascript"> var DOCUMENTATION_OPTIONS = { URL_ROOT: '../', VERSION: '2.7.5', COLLAPSE_INDEX: false, FILE_SUFFIX: '.html', HAS_SOURCE: true }; </script> <script type="text/javascript" src="../_static/jquery.js"></script> <script type="text/javascript" src="../_static/underscore.js"></script> <script type="text/javascript" src="../_static/doctools.js"></script> <script type="text/javascript" src="../_static/sidebar.js"></script> <link rel="search" type="application/opensearchdescription+xml" title="Search within Python 2.7.5 documentation" href="../_static/opensearch.xml"/> <link rel="author" title="About these documents" href="../about.html" /> <link rel="copyright" title="Copyright" href="../copyright.html" /> <link rel="top" title="Python 2.7.5 documentation" href="../index.html" /> <link rel="up" title="9. Numeric and Mathematical Modules" href="numeric.html" /> <link rel="next" title="9.8. functools — Higher-order functions and operations on callable objects" href="functools.html" /> <link rel="prev" title="9.6. random — Generate pseudo-random numbers" href="random.html" /> <link rel="shortcut icon" type="image/png" href="../_static/py.png" /> <script type="text/javascript" src="../_static/copybutton.js"></script> </head> <body> <div class="related"> <h3>Navigation</h3> <ul> <li class="right" style="margin-right: 10px"> <a href="../genindex.html" title="General Index" accesskey="I">index</a></li> <li class="right" > <a href="../py-modindex.html" title="Python Module Index" >modules</a> |</li> <li class="right" > <a href="functools.html" title="9.8. functools — Higher-order functions and operations on callable objects" accesskey="N">next</a> |</li> <li class="right" > <a href="random.html" title="9.6. random — Generate pseudo-random numbers" accesskey="P">previous</a> |</li> <li><img src="../_static/py.png" alt="" style="vertical-align: middle; margin-top: -1px"/></li> <li><a href="http://www.python.org/">Python</a> »</li> <li> <a href="../index.html">Python 2.7.5 documentation</a> » </li> <li><a href="index.html" >The Python Standard Library</a> »</li> <li><a href="numeric.html" accesskey="U">9. Numeric and Mathematical Modules</a> »</li> </ul> </div> <div class="document"> <div class="documentwrapper"> <div class="bodywrapper"> <div class="body"> <div class="section" id="module-itertools"> <h1>9.7. <a class="reference internal" href="#module-itertools" title="itertools: Functions creating iterators for efficient looping."><tt class="xref py py-mod docutils literal">itertools</tt></a> — Functions creating iterators for efficient looping<a class="headerlink" href="#module-itertools" title="Permalink to this headline">¶</a></h1> New in version 2.3. This module implements a number of <a class="reference internal" href="../glossary.html#term-iterator">iterator</a> building blocks inspired by constructs from APL, Haskell, and SML. Each has been recast in a form suitable for Python. The module standardizes a core set of fast, memory efficient tools that are useful by themselves or in combination. Together, they form an “iterator algebra” making it possible to construct specialized tools succinctly and efficiently in pure Python. For instance, SML provides a tabulation tool: <tt class="docutils literal">tabulate(f)</tt> which produces a sequence <tt class="docutils literal">f(0), f(1), ...</tt>. The same effect can be achieved in Python by combining <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a> and <a class="reference internal" href="#itertools.count" title="itertools.count"><tt class="xref py py-func docutils literal">count()</tt></a> to form <tt class="docutils literal">imap(f, count())</tt>. These tools and their built-in counterparts also work well with the high-speed functions in the <a class="reference internal" href="operator.html#module-operator" title="operator: Functions corresponding to the standard operators."><tt class="xref py py-mod docutils literal">operator</tt></a> module. For example, the multiplication operator can be mapped across two vectors to form an efficient dot-product: <tt class="docutils literal">sum(imap(operator.mul, vector1, vector2))</tt>. Infinite Iterators: <table border="1" class="docutils"> <colgroup> <col width="14%" /> <col width="14%" /> <col width="39%" /> <col width="33%" /> </colgroup> <thead valign="bottom"> <tr class="row-odd"><th class="head">Iterator</th> <th class="head">Arguments</th> <th class="head">Results</th> <th class="head">Example</th> </tr> </thead> <tbody valign="top"> <tr class="row-even"><td><a class="reference internal" href="#itertools.count" title="itertools.count"><tt class="xref py py-func docutils literal">count()</tt></a></td> <td>start, [step]</td> <td>start, start+step, start+2*step, ...</td> <td><tt class="docutils literal">count(10) --> 10 11 12 13 14 ...</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.cycle" title="itertools.cycle"><tt class="xref py py-func docutils literal">cycle()</tt></a></td> <td>p</td> <td>p0, p1, ... plast, p0, p1, ...</td> <td><tt class="docutils literal">cycle('ABCD') --> A B C D A B C D ...</tt></td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.repeat" title="itertools.repeat"><tt class="xref py py-func docutils literal">repeat()</tt></a></td> <td>elem [,n]</td> <td>elem, elem, elem, ... endlessly or up to n times</td> <td><tt class="docutils literal">repeat(10, 3) --> 10 10 10</tt></td> </tr> </tbody> </table> Iterators terminating on the shortest input sequence: <table border="1" class="docutils"> <colgroup> <col width="13%" /> <col width="18%" /> <col width="31%" /> <col width="39%" /> </colgroup> <thead valign="bottom"> <tr class="row-odd"><th class="head">Iterator</th> <th class="head">Arguments</th> <th class="head">Results</th> <th class="head">Example</th> </tr> </thead> <tbody valign="top"> <tr class="row-even"><td><a class="reference internal" href="#itertools.chain" title="itertools.chain"><tt class="xref py py-func docutils literal">chain()</tt></a></td> <td>p, q, ...</td> <td>p0, p1, ... plast, q0, q1, ...</td> <td><tt class="docutils literal">chain('ABC', 'DEF') --> A B C D E F</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.compress" title="itertools.compress"><tt class="xref py py-func docutils literal">compress()</tt></a></td> <td>data, selectors</td> <td>(d[0] if s[0]), (d[1] if s[1]), ...</td> <td><tt class="docutils literal">compress('ABCDEF', [1,0,1,0,1,1]) --> A C E F</tt></td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.dropwhile" title="itertools.dropwhile"><tt class="xref py py-func docutils literal">dropwhile()</tt></a></td> <td>pred, seq</td> <td>seq[n], seq[n+1], starting when pred fails</td> <td><tt class="docutils literal">dropwhile(lambda x: x<5, [1,4,6,4,1]) --> 6 4 1</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.groupby" title="itertools.groupby"><tt class="xref py py-func docutils literal">groupby()</tt></a></td> <td>iterable[, keyfunc]</td> <td>sub-iterators grouped by value of keyfunc(v)</td> <td> </td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.ifilter" title="itertools.ifilter"><tt class="xref py py-func docutils literal">ifilter()</tt></a></td> <td>pred, seq</td> <td>elements of seq where pred(elem) is True</td> <td><tt class="docutils literal">ifilter(lambda x: x%2, range(10)) --> 1 3 5 7 9</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.ifilterfalse" title="itertools.ifilterfalse"><tt class="xref py py-func docutils literal">ifilterfalse()</tt></a></td> <td>pred, seq</td> <td>elements of seq where pred(elem) is False</td> <td><tt class="docutils literal">ifilterfalse(lambda x: x%2, range(10)) --> 0 2 4 6 8</tt></td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.islice" title="itertools.islice"><tt class="xref py py-func docutils literal">islice()</tt></a></td> <td>seq, [start,] stop [, step]</td> <td>elements from seq[start:stop:step]</td> <td><tt class="docutils literal">islice('ABCDEFG', 2, None) --> C D E F G</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a></td> <td>func, p, q, ...</td> <td>func(p0, q0), func(p1, q1), ...</td> <td><tt class="docutils literal">imap(pow, (2,3,10), (5,2,3)) --> 32 9 1000</tt></td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.starmap" title="itertools.starmap"><tt class="xref py py-func docutils literal">starmap()</tt></a></td> <td>func, seq</td> <td>func(*seq[0]), func(*seq[1]), ...</td> <td><tt class="docutils literal">starmap(pow, [(2,5), (3,2), (10,3)]) --> 32 9 1000</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.tee" title="itertools.tee"><tt class="xref py py-func docutils literal">tee()</tt></a></td> <td>it, n</td> <td>it1, it2 , ... itn splits one iterator into n</td> <td> </td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.takewhile" title="itertools.takewhile"><tt class="xref py py-func docutils literal">takewhile()</tt></a></td> <td>pred, seq</td> <td>seq[0], seq[1], until pred fails</td> <td><tt class="docutils literal">takewhile(lambda x: x<5, [1,4,6,4,1]) --> 1 4</tt></td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.izip" title="itertools.izip"><tt class="xref py py-func docutils literal">izip()</tt></a></td> <td>p, q, ...</td> <td>(p[0], q[0]), (p[1], q[1]), ...</td> <td><tt class="docutils literal">izip('ABCD', 'xy') --> Ax By</tt></td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.izip_longest" title="itertools.izip_longest"><tt class="xref py py-func docutils literal">izip_longest()</tt></a></td> <td>p, q, ...</td> <td>(p[0], q[0]), (p[1], q[1]), ...</td> <td><tt class="docutils literal">izip_longest('ABCD', 'xy', fillvalue='-') --> Ax By C- D-</tt></td> </tr> </tbody> </table> Combinatoric generators: <table border="1" class="docutils"> <colgroup> <col width="36%" /> <col width="16%" /> <col width="48%" /> </colgroup> <thead valign="bottom"> <tr class="row-odd"><th class="head">Iterator</th> <th class="head">Arguments</th> <th class="head">Results</th> </tr> </thead> <tbody valign="top"> <tr class="row-even"><td><a class="reference internal" href="#itertools.product" title="itertools.product"><tt class="xref py py-func docutils literal">product()</tt></a></td> <td>p, q, ... [repeat=1]</td> <td>cartesian product, equivalent to a nested for-loop</td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.permutations" title="itertools.permutations"><tt class="xref py py-func docutils literal">permutations()</tt></a></td> <td>p[, r]</td> <td>r-length tuples, all possible orderings, no repeated elements</td> </tr> <tr class="row-even"><td><a class="reference internal" href="#itertools.combinations" title="itertools.combinations"><tt class="xref py py-func docutils literal">combinations()</tt></a></td> <td>p, r</td> <td>r-length tuples, in sorted order, no repeated elements</td> </tr> <tr class="row-odd"><td><a class="reference internal" href="#itertools.combinations_with_replacement" title="itertools.combinations_with_replacement"><tt class="xref py py-func docutils literal">combinations_with_replacement()</tt></a></td> <td>p, r</td> <td>r-length tuples, in sorted order, with repeated elements</td> </tr> <tr class="row-even"><td><tt class="docutils literal">product('ABCD', repeat=2)</tt></td> <td> </td> <td><tt class="docutils literal">AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD</tt></td> </tr> <tr class="row-odd"><td><tt class="docutils literal">permutations('ABCD', 2)</tt></td> <td> </td> <td><tt class="docutils literal">AB AC AD BA BC BD CA CB CD DA DB DC</tt></td> </tr> <tr class="row-even"><td><tt class="docutils literal">combinations('ABCD', 2)</tt></td> <td> </td> <td><tt class="docutils literal">AB AC AD BC BD CD</tt></td> </tr> <tr class="row-odd"><td><tt class="docutils literal">combinations_with_replacement('ABCD', 2)</tt></td> <td> </td> <td><tt class="docutils literal">AA AB AC AD BB BC BD CC CD DD</tt></td> </tr> </tbody> </table> <div class="section" id="itertool-functions"> <h2>9.7.1. Itertool functions<a class="headerlink" href="#itertool-functions" title="Permalink to this headline">¶</a></h2> The following module functions all construct and return iterators. Some provide streams of infinite length, so they should only be accessed by functions or loops that truncate the stream. <dl class="function"> <dt id="itertools.chain"> <tt class="descclassname">itertools.</tt><tt class="descname">chain</tt><big>(</big>*iterables<big>)</big><a class="headerlink" href="#itertools.chain" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that returns elements from the first iterable until it is exhausted, then proceeds to the next iterable, until all of the iterables are exhausted. Used for treating consecutive sequences as a single sequence. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def chain(*iterables): # chain('ABC', 'DEF') --> A B C D E F for it in iterables: for element in it: yield element </pre></div> </div> </dd></dl> <dl class="classmethod"> <dt id="itertools.chain.from_iterable"> classmethod <tt class="descclassname">chain.</tt><tt class="descname">from_iterable</tt><big>(</big>iterable<big>)</big><a class="headerlink" href="#itertools.chain.from_iterable" title="Permalink to this definition">¶</a></dt> <dd>Alternate constructor for <a class="reference internal" href="#itertools.chain" title="itertools.chain"><tt class="xref py py-func docutils literal">chain()</tt></a>. Gets chained inputs from a single iterable argument that is evaluated lazily. Roughly equivalent to: <div class="highlight-python"><div class="highlight"><pre>def from_iterable(iterables): # chain.from_iterable(['ABC', 'DEF']) --> A B C D E F for it in iterables: for element in it: yield element </pre></div> </div> New in version 2.6. </dd></dl> <dl class="function"> <dt id="itertools.combinations"> <tt class="descclassname">itertools.</tt><tt class="descname">combinations</tt><big>(</big>iterable, r<big>)</big><a class="headerlink" href="#itertools.combinations" title="Permalink to this definition">¶</a></dt> <dd>Return r length subsequences of elements from the input iterable. Combinations are emitted in lexicographic sort order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order. Elements are treated as unique based on their position, not on their value. So if the input elements are unique, there will be no repeat values in each combination. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def combinations(iterable, r): # combinations('ABCD', 2) --> AB AC AD BC BD CD # combinations(range(4), 3) --> 012 013 023 123 pool = tuple(iterable) n = len(pool) if r > n: return indices = range(r) yield tuple(pool[i] for i in indices) while True: for i in reversed(range(r)): if indices[i] != i + n - r: break else: return indices[i] += 1 for j in range(i+1, r): indices[j] = indices[j-1] + 1 yield tuple(pool[i] for i in indices) </pre></div> </div> The code for <a class="reference internal" href="#itertools.combinations" title="itertools.combinations"><tt class="xref py py-func docutils literal">combinations()</tt></a> can be also expressed as a subsequence of <a class="reference internal" href="#itertools.permutations" title="itertools.permutations"><tt class="xref py py-func docutils literal">permutations()</tt></a> after filtering entries where the elements are not in sorted order (according to their position in the input pool): <div class="highlight-python"><div class="highlight"><pre>def combinations(iterable, r): pool = tuple(iterable) n = len(pool) for indices in permutations(range(n), r): if sorted(indices) == list(indices): yield tuple(pool[i] for i in indices) </pre></div> </div> The number of items returned is <tt class="docutils literal">n! / r! / (n-r)!</tt> when <tt class="docutils literal">0 <= r <= n</tt> or zero when <tt class="docutils literal">r > n</tt>. New in version 2.6. </dd></dl> <dl class="function"> <dt id="itertools.combinations_with_replacement"> <tt class="descclassname">itertools.</tt><tt class="descname">combinations_with_replacement</tt><big>(</big>iterable, r<big>)</big><a class="headerlink" href="#itertools.combinations_with_replacement" title="Permalink to this definition">¶</a></dt> <dd>Return r length subsequences of elements from the input iterable allowing individual elements to be repeated more than once. Combinations are emitted in lexicographic sort order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order. Elements are treated as unique based on their position, not on their value. So if the input elements are unique, the generated combinations will also be unique. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def combinations_with_replacement(iterable, r): # combinations_with_replacement('ABC', 2) --> AA AB AC BB BC CC pool = tuple(iterable) n = len(pool) if not n and r: return indices = [0] * r yield tuple(pool[i] for i in indices) while True: for i in reversed(range(r)): if indices[i] != n - 1: break else: return indices[i:] = [indices[i] + 1] * (r - i) yield tuple(pool[i] for i in indices) </pre></div> </div> The code for <a class="reference internal" href="#itertools.combinations_with_replacement" title="itertools.combinations_with_replacement"><tt class="xref py py-func docutils literal">combinations_with_replacement()</tt></a> can be also expressed as a subsequence of <a class="reference internal" href="#itertools.product" title="itertools.product"><tt class="xref py py-func docutils literal">product()</tt></a> after filtering entries where the elements are not in sorted order (according to their position in the input pool): <div class="highlight-python"><div class="highlight"><pre>def combinations_with_replacement(iterable, r): pool = tuple(iterable) n = len(pool) for indices in product(range(n), repeat=r): if sorted(indices) == list(indices): yield tuple(pool[i] for i in indices) </pre></div> </div> The number of items returned is <tt class="docutils literal">(n+r-1)! / r! / (n-1)!</tt> when <tt class="docutils literal">n > 0</tt>. New in version 2.7. </dd></dl> <dl class="function"> <dt id="itertools.compress"> <tt class="descclassname">itertools.</tt><tt class="descname">compress</tt><big>(</big>data, selectors<big>)</big><a class="headerlink" href="#itertools.compress" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that filters elements from data returning only those that have a corresponding element in selectors that evaluates to <tt class="docutils literal">True</tt>. Stops when either the data or selectors iterables has been exhausted. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def compress(data, selectors): # compress('ABCDEF', [1,0,1,0,1,1]) --> A C E F return (d for d, s in izip(data, selectors) if s) </pre></div> </div> New in version 2.7. </dd></dl> <dl class="function"> <dt id="itertools.count"> <tt class="descclassname">itertools.</tt><tt class="descname">count</tt><big>(</big>start=0, step=1<big>)</big><a class="headerlink" href="#itertools.count" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that returns evenly spaced values starting with n. Often used as an argument to <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a> to generate consecutive data points. Also, used with <a class="reference internal" href="#itertools.izip" title="itertools.izip"><tt class="xref py py-func docutils literal">izip()</tt></a> to add sequence numbers. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def count(start=0, step=1): # count(10) --> 10 11 12 13 14 ... # count(2.5, 0.5) -> 2.5 3.0 3.5 ... n = start while True: yield n n += step </pre></div> </div> When counting with floating point numbers, better accuracy can sometimes be achieved by substituting multiplicative code such as: <tt class="docutils literal">(start + step * i for i in count())</tt>. Changed in version 2.7: added step argument and allowed non-integer arguments. </dd></dl> <dl class="function"> <dt id="itertools.cycle"> <tt class="descclassname">itertools.</tt><tt class="descname">cycle</tt><big>(</big>iterable<big>)</big><a class="headerlink" href="#itertools.cycle" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator returning elements from the iterable and saving a copy of each. When the iterable is exhausted, return elements from the saved copy. Repeats indefinitely. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def cycle(iterable): # cycle('ABCD') --> A B C D A B C D A B C D ... saved = [] for element in iterable: yield element saved.append(element) while saved: for element in saved: yield element </pre></div> </div> Note, this member of the toolkit may require significant auxiliary storage (depending on the length of the iterable). </dd></dl> <dl class="function"> <dt id="itertools.dropwhile"> <tt class="descclassname">itertools.</tt><tt class="descname">dropwhile</tt><big>(</big>predicate, iterable<big>)</big><a class="headerlink" href="#itertools.dropwhile" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that drops elements from the iterable as long as the predicate is true; afterwards, returns every element. Note, the iterator does not produce any output until the predicate first becomes false, so it may have a lengthy start-up time. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def dropwhile(predicate, iterable): # dropwhile(lambda x: x<5, [1,4,6,4,1]) --> 6 4 1 iterable = iter(iterable) for x in iterable: if not predicate(x): yield x break for x in iterable: yield x </pre></div> </div> </dd></dl> <dl class="function"> <dt id="itertools.groupby"> <tt class="descclassname">itertools.</tt><tt class="descname">groupby</tt><big>(</big>iterable[, key]<big>)</big><a class="headerlink" href="#itertools.groupby" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that returns consecutive keys and groups from the iterable. The key is a function computing a key value for each element. If not specified or is <tt class="docutils literal">None</tt>, key defaults to an identity function and returns the element unchanged. Generally, the iterable needs to already be sorted on the same key function. The operation of <a class="reference internal" href="#itertools.groupby" title="itertools.groupby"><tt class="xref py py-func docutils literal">groupby()</tt></a> is similar to the <tt class="docutils literal">uniq</tt> filter in Unix. It generates a break or new group every time the value of the key function changes (which is why it is usually necessary to have sorted the data using the same key function). That behavior differs from SQL’s GROUP BY which aggregates common elements regardless of their input order. The returned group is itself an iterator that shares the underlying iterable with <a class="reference internal" href="#itertools.groupby" title="itertools.groupby"><tt class="xref py py-func docutils literal">groupby()</tt></a>. Because the source is shared, when the <a class="reference internal" href="#itertools.groupby" title="itertools.groupby"><tt class="xref py py-func docutils literal">groupby()</tt></a> object is advanced, the previous group is no longer visible. So, if that data is needed later, it should be stored as a list: <div class="highlight-python"><div class="highlight"><pre>groups = [] uniquekeys = [] data = sorted(data, key=keyfunc) for k, g in groupby(data, keyfunc): groups.append(list(g)) # Store group iterator as a list uniquekeys.append(k) </pre></div> </div> <a class="reference internal" href="#itertools.groupby" title="itertools.groupby"><tt class="xref py py-func docutils literal">groupby()</tt></a> is equivalent to: <div class="highlight-python"><div class="highlight"><pre>class groupby(object): # [k for k, g in groupby('AAAABBBCCDAABBB')] --> A B C D A B # [list(g) for k, g in groupby('AAAABBBCCD')] --> AAAA BBB CC D def __init__(self, iterable, key=None): if key is None: key = lambda x: x self.keyfunc = key self.it = iter(iterable) self.tgtkey = self.currkey = self.currvalue = object() def __iter__(self): return self def next(self): while self.currkey == self.tgtkey: self.currvalue = next(self.it) # Exit on StopIteration self.currkey = self.keyfunc(self.currvalue) self.tgtkey = self.currkey return (self.currkey, self._grouper(self.tgtkey)) def _grouper(self, tgtkey): while self.currkey == tgtkey: yield self.currvalue self.currvalue = next(self.it) # Exit on StopIteration self.currkey = self.keyfunc(self.currvalue) </pre></div> </div> New in version 2.4. </dd></dl> <dl class="function"> <dt id="itertools.ifilter"> <tt class="descclassname">itertools.</tt><tt class="descname">ifilter</tt><big>(</big>predicate, iterable<big>)</big><a class="headerlink" href="#itertools.ifilter" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that filters elements from iterable returning only those for which the predicate is <tt class="docutils literal">True</tt>. If predicate is <tt class="docutils literal">None</tt>, return the items that are true. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def ifilter(predicate, iterable): # ifilter(lambda x: x%2, range(10)) --> 1 3 5 7 9 if predicate is None: predicate = bool for x in iterable: if predicate(x): yield x </pre></div> </div> </dd></dl> <dl class="function"> <dt id="itertools.ifilterfalse"> <tt class="descclassname">itertools.</tt><tt class="descname">ifilterfalse</tt><big>(</big>predicate, iterable<big>)</big><a class="headerlink" href="#itertools.ifilterfalse" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that filters elements from iterable returning only those for which the predicate is <tt class="docutils literal">False</tt>. If predicate is <tt class="docutils literal">None</tt>, return the items that are false. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def ifilterfalse(predicate, iterable): # ifilterfalse(lambda x: x%2, range(10)) --> 0 2 4 6 8 if predicate is None: predicate = bool for x in iterable: if not predicate(x): yield x </pre></div> </div> </dd></dl> <dl class="function"> <dt id="itertools.imap"> <tt class="descclassname">itertools.</tt><tt class="descname">imap</tt><big>(</big>function, *iterables<big>)</big><a class="headerlink" href="#itertools.imap" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that computes the function using arguments from each of the iterables. If function is set to <tt class="docutils literal">None</tt>, then <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a> returns the arguments as a tuple. Like <a class="reference internal" href="functions.html#map" title="map"><tt class="xref py py-func docutils literal">map()</tt></a> but stops when the shortest iterable is exhausted instead of filling in <tt class="docutils literal">None</tt> for shorter iterables. The reason for the difference is that infinite iterator arguments are typically an error for <a class="reference internal" href="functions.html#map" title="map"><tt class="xref py py-func docutils literal">map()</tt></a> (because the output is fully evaluated) but represent a common and useful way of supplying arguments to <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a>. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def imap(function, *iterables): # imap(pow, (2,3,10), (5,2,3)) --> 32 9 1000 iterables = map(iter, iterables) while True: args = [next(it) for it in iterables] if function is None: yield tuple(args) else: yield function(*args) </pre></div> </div> </dd></dl> <dl class="function"> <dt id="itertools.islice"> <tt class="descclassname">itertools.</tt><tt class="descname">islice</tt><big>(</big>iterable, stop<big>)</big><a class="headerlink" href="#itertools.islice" title="Permalink to this definition">¶</a></dt> <dt> <tt class="descclassname">itertools.</tt><tt class="descname">islice</tt><big>(</big>iterable, start, stop[, step]<big>)</big></dt> <dd>Make an iterator that returns selected elements from the iterable. If start is non-zero, then elements from the iterable are skipped until start is reached. Afterward, elements are returned consecutively unless step is set higher than one which results in items being skipped. If stop is <tt class="docutils literal">None</tt>, then iteration continues until the iterator is exhausted, if at all; otherwise, it stops at the specified position. Unlike regular slicing, <a class="reference internal" href="#itertools.islice" title="itertools.islice"><tt class="xref py py-func docutils literal">islice()</tt></a> does not support negative values for start, stop, or step. Can be used to extract related fields from data where the internal structure has been flattened (for example, a multi-line report may list a name field on every third line). Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def islice(iterable, *args): # islice('ABCDEFG', 2) --> A B # islice('ABCDEFG', 2, 4) --> C D # islice('ABCDEFG', 2, None) --> C D E F G # islice('ABCDEFG', 0, None, 2) --> A C E G s = slice(*args) it = iter(xrange(s.start or 0, s.stop or sys.maxint, s.step or 1)) nexti = next(it) for i, element in enumerate(iterable): if i == nexti: yield element nexti = next(it) </pre></div> </div> If start is <tt class="docutils literal">None</tt>, then iteration starts at zero. If step is <tt class="docutils literal">None</tt>, then the step defaults to one. Changed in version 2.5: accept <tt class="docutils literal">None</tt> values for default start and step. </dd></dl> <dl class="function"> <dt id="itertools.izip"> <tt class="descclassname">itertools.</tt><tt class="descname">izip</tt><big>(</big>*iterables<big>)</big><a class="headerlink" href="#itertools.izip" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that aggregates elements from each of the iterables. Like <a class="reference internal" href="functions.html#zip" title="zip"><tt class="xref py py-func docutils literal">zip()</tt></a> except that it returns an iterator instead of a list. Used for lock-step iteration over several iterables at a time. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def izip(*iterables): # izip('ABCD', 'xy') --> Ax By iterators = map(iter, iterables) while iterators: yield tuple(map(next, iterators)) </pre></div> </div> Changed in version 2.4: When no iterables are specified, returns a zero length iterator instead of raising a <a class="reference internal" href="exceptions.html#exceptions.TypeError" title="exceptions.TypeError"><tt class="xref py py-exc docutils literal">TypeError</tt></a> exception. The left-to-right evaluation order of the iterables is guaranteed. This makes possible an idiom for clustering a data series into n-length groups using <tt class="docutils literal">izip(*[iter(s)]*n)</tt>. <a class="reference internal" href="#itertools.izip" title="itertools.izip"><tt class="xref py py-func docutils literal">izip()</tt></a> should only be used with unequal length inputs when you don’t care about trailing, unmatched values from the longer iterables. If those values are important, use <a class="reference internal" href="#itertools.izip_longest" title="itertools.izip_longest"><tt class="xref py py-func docutils literal">izip_longest()</tt></a> instead. </dd></dl> <dl class="function"> <dt id="itertools.izip_longest"> <tt class="descclassname">itertools.</tt><tt class="descname">izip_longest</tt><big>(</big>*iterables[, fillvalue]<big>)</big><a class="headerlink" href="#itertools.izip_longest" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that aggregates elements from each of the iterables. If the iterables are of uneven length, missing values are filled-in with fillvalue. Iteration continues until the longest iterable is exhausted. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>class ZipExhausted(Exception): pass def izip_longest(*args, **kwds): # izip_longest('ABCD', 'xy', fillvalue='-') --> Ax By C- D- fillvalue = kwds.get('fillvalue') counter = [len(args) - 1] def sentinel(): if not counter[0]: raise ZipExhausted counter[0] -= 1 yield fillvalue fillers = repeat(fillvalue) iterators = [chain(it, sentinel(), fillers) for it in args] try: while iterators: yield tuple(map(next, iterators)) except ZipExhausted: pass </pre></div> </div> If one of the iterables is potentially infinite, then the <a class="reference internal" href="#itertools.izip_longest" title="itertools.izip_longest"><tt class="xref py py-func docutils literal">izip_longest()</tt></a> function should be wrapped with something that limits the number of calls (for example <a class="reference internal" href="#itertools.islice" title="itertools.islice"><tt class="xref py py-func docutils literal">islice()</tt></a> or <a class="reference internal" href="#itertools.takewhile" title="itertools.takewhile"><tt class="xref py py-func docutils literal">takewhile()</tt></a>). If not specified, fillvalue defaults to <tt class="docutils literal">None</tt>. New in version 2.6. </dd></dl> <dl class="function"> <dt id="itertools.permutations"> <tt class="descclassname">itertools.</tt><tt class="descname">permutations</tt><big>(</big>iterable[, r]<big>)</big><a class="headerlink" href="#itertools.permutations" title="Permalink to this definition">¶</a></dt> <dd>Return successive r length permutations of elements in the iterable. If r is not specified or is <tt class="docutils literal">None</tt>, then r defaults to the length of the iterable and all possible full-length permutations are generated. Permutations are emitted in lexicographic sort order. So, if the input iterable is sorted, the permutation tuples will be produced in sorted order. Elements are treated as unique based on their position, not on their value. So if the input elements are unique, there will be no repeat values in each permutation. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def permutations(iterable, r=None): # permutations('ABCD', 2) --> AB AC AD BA BC BD CA CB CD DA DB DC # permutations(range(3)) --> 012 021 102 120 201 210 pool = tuple(iterable) n = len(pool) r = n if r is None else r if r > n: return indices = range(n) cycles = range(n, n-r, -1) yield tuple(pool[i] for i in indices[:r]) while n: for i in reversed(range(r)): cycles[i] -= 1 if cycles[i] == 0: indices[i:] = indices[i+1:] + indices[i:i+1] cycles[i] = n - i else: j = cycles[i] indices[i], indices[-j] = indices[-j], indices[i] yield tuple(pool[i] for i in indices[:r]) break else: return </pre></div> </div> The code for <a class="reference internal" href="#itertools.permutations" title="itertools.permutations"><tt class="xref py py-func docutils literal">permutations()</tt></a> can be also expressed as a subsequence of <a class="reference internal" href="#itertools.product" title="itertools.product"><tt class="xref py py-func docutils literal">product()</tt></a>, filtered to exclude entries with repeated elements (those from the same position in the input pool): <div class="highlight-python"><div class="highlight"><pre>def permutations(iterable, r=None): pool = tuple(iterable) n = len(pool) r = n if r is None else r for indices in product(range(n), repeat=r): if len(set(indices)) == r: yield tuple(pool[i] for i in indices) </pre></div> </div> The number of items returned is <tt class="docutils literal">n! / (n-r)!</tt> when <tt class="docutils literal">0 <= r <= n</tt> or zero when <tt class="docutils literal">r > n</tt>. New in version 2.6. </dd></dl> <dl class="function"> <dt id="itertools.product"> <tt class="descclassname">itertools.</tt><tt class="descname">product</tt><big>(</big>*iterables[, repeat]<big>)</big><a class="headerlink" href="#itertools.product" title="Permalink to this definition">¶</a></dt> <dd>Cartesian product of input iterables. Equivalent to nested for-loops in a generator expression. For example, <tt class="docutils literal">product(A, B)</tt> returns the same as <tt class="docutils literal">((x,y) for x in A for y in B)</tt>. The nested loops cycle like an odometer with the rightmost element advancing on every iteration. This pattern creates a lexicographic ordering so that if the input’s iterables are sorted, the product tuples are emitted in sorted order. To compute the product of an iterable with itself, specify the number of repetitions with the optional repeat keyword argument. For example, <tt class="docutils literal">product(A, repeat=4)</tt> means the same as <tt class="docutils literal">product(A, A, A, A)</tt>. This function is equivalent to the following code, except that the actual implementation does not build up intermediate results in memory: <div class="highlight-python"><div class="highlight"><pre>def product(*args, **kwds): # product('ABCD', 'xy') --> Ax Ay Bx By Cx Cy Dx Dy # product(range(2), repeat=3) --> 000 001 010 011 100 101 110 111 pools = map(tuple, args) * kwds.get('repeat', 1) result = [[]] for pool in pools: result = [x+[y] for x in result for y in pool] for prod in result: yield tuple(prod) </pre></div> </div> New in version 2.6. </dd></dl> <dl class="function"> <dt id="itertools.repeat"> <tt class="descclassname">itertools.</tt><tt class="descname">repeat</tt><big>(</big>object[, times]<big>)</big><a class="headerlink" href="#itertools.repeat" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that returns object over and over again. Runs indefinitely unless the times argument is specified. Used as argument to <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a> for invariant function parameters. Also used with <a class="reference internal" href="#itertools.izip" title="itertools.izip"><tt class="xref py py-func docutils literal">izip()</tt></a> to create constant fields in a tuple record. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def repeat(object, times=None): # repeat(10, 3) --> 10 10 10 if times is None: while True: yield object else: for i in xrange(times): yield object </pre></div> </div> A common use for repeat is to supply a stream of constant values to imap or zip: <div class="highlight-python"><div class="highlight"><pre>>>> list(imap(pow, xrange(10), repeat(2))) [0, 1, 4, 9, 16, 25, 36, 49, 64, 81] </pre></div> </div> </dd></dl> <dl class="function"> <dt id="itertools.starmap"> <tt class="descclassname">itertools.</tt><tt class="descname">starmap</tt><big>(</big>function, iterable<big>)</big><a class="headerlink" href="#itertools.starmap" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that computes the function using arguments obtained from the iterable. Used instead of <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a> when argument parameters are already grouped in tuples from a single iterable (the data has been “pre-zipped”). The difference between <a class="reference internal" href="#itertools.imap" title="itertools.imap"><tt class="xref py py-func docutils literal">imap()</tt></a> and <a class="reference internal" href="#itertools.starmap" title="itertools.starmap"><tt class="xref py py-func docutils literal">starmap()</tt></a> parallels the distinction between <tt class="docutils literal">function(a,b)</tt> and <tt class="docutils literal">function(*c)</tt>. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def starmap(function, iterable): # starmap(pow, [(2,5), (3,2), (10,3)]) --> 32 9 1000 for args in iterable: yield function(*args) </pre></div> </div> Changed in version 2.6: Previously, <a class="reference internal" href="#itertools.starmap" title="itertools.starmap"><tt class="xref py py-func docutils literal">starmap()</tt></a> required the function arguments to be tuples. Now, any iterable is allowed. </dd></dl> <dl class="function"> <dt id="itertools.takewhile"> <tt class="descclassname">itertools.</tt><tt class="descname">takewhile</tt><big>(</big>predicate, iterable<big>)</big><a class="headerlink" href="#itertools.takewhile" title="Permalink to this definition">¶</a></dt> <dd>Make an iterator that returns elements from the iterable as long as the predicate is true. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def takewhile(predicate, iterable): # takewhile(lambda x: x<5, [1,4,6,4,1]) --> 1 4 for x in iterable: if predicate(x): yield x else: break </pre></div> </div> </dd></dl> <dl class="function"> <dt id="itertools.tee"> <tt class="descclassname">itertools.</tt><tt class="descname">tee</tt><big>(</big>iterable[, n=2]<big>)</big><a class="headerlink" href="#itertools.tee" title="Permalink to this definition">¶</a></dt> <dd>Return n independent iterators from a single iterable. Equivalent to: <div class="highlight-python"><div class="highlight"><pre>def tee(iterable, n=2): it = iter(iterable) deques = [collections.deque() for i in range(n)] def gen(mydeque): while True: if not mydeque: # when the local deque is empty newval = next(it) # fetch a new value and for d in deques: # load it to all the deques d.append(newval) yield mydeque.popleft() return tuple(gen(d) for d in deques) </pre></div> </div> Once <a class="reference internal" href="#itertools.tee" title="itertools.tee"><tt class="xref py py-func docutils literal">tee()</tt></a> has made a split, the original iterable should not be used anywhere else; otherwise, the iterable could get advanced without the tee objects being informed. This itertool may require significant auxiliary storage (depending on how much temporary data needs to be stored). In general, if one iterator uses most or all of the data before another iterator starts, it is faster to use <a class="reference internal" href="functions.html#list" title="list"><tt class="xref py py-func docutils literal">list()</tt></a> instead of <a class="reference internal" href="#itertools.tee" title="itertools.tee"><tt class="xref py py-func docutils literal">tee()</tt></a>. New in version 2.4. </dd></dl> </div> <div class="section" id="recipes"> <h2>9.7.2. Recipes<a class="headerlink" href="#recipes" title="Permalink to this headline">¶</a></h2> This section shows recipes for creating an extended toolset using the existing itertools as building blocks. The extended tools offer the same high performance as the underlying toolset. The superior memory performance is kept by processing elements one at a time rather than bringing the whole iterable into memory all at once. Code volume is kept small by linking the tools together in a functional style which helps eliminate temporary variables. High speed is retained by preferring “vectorized” building blocks over the use of for-loops and <a class="reference internal" href="../glossary.html#term-generator">generator</a>s which incur interpreter overhead. <div class="highlight-python"><div class="highlight"><pre>def take(n, iterable): "Return first n items of the iterable as a list" return list(islice(iterable, n)) def tabulate(function, start=0): "Return function(0), function(1), ..." return imap(function, count(start)) def consume(iterator, n): "Advance the iterator n-steps ahead. If n is none, consume entirely." # Use functions that consume iterators at C speed. if n is None: # feed the entire iterator into a zero-length deque collections.deque(iterator, maxlen=0) else: # advance to the empty slice starting at position n next(islice(iterator, n, n), None) def nth(iterable, n, default=None): "Returns the nth item or a default value" return next(islice(iterable, n, None), default) def quantify(iterable, pred=bool): "Count how many times the predicate is true" return sum(imap(pred, iterable)) def padnone(iterable): """Returns the sequence elements and then returns None indefinitely. Useful for emulating the behavior of the built-in map() function. """ return chain(iterable, repeat(None)) def ncycles(iterable, n): "Returns the sequence elements n times" return chain.from_iterable(repeat(tuple(iterable), n)) def dotproduct(vec1, vec2): return sum(imap(operator.mul, vec1, vec2)) def flatten(listOfLists): "Flatten one level of nesting" return chain.from_iterable(listOfLists) def repeatfunc(func, times=None, *args): """Repeat calls to func with specified arguments. Example: repeatfunc(random.random) """ if times is None: return starmap(func, repeat(args)) return starmap(func, repeat(args, times)) def pairwise(iterable): "s -> (s0,s1), (s1,s2), (s2, s3), ..." a, b = tee(iterable) next(b, None) return izip(a, b) def grouper(iterable, n, fillvalue=None): "Collect data into fixed-length chunks or blocks" # grouper('ABCDEFG', 3, 'x') --> ABC DEF Gxx args = [iter(iterable)] * n return izip_longest(fillvalue=fillvalue, *args) def roundrobin(*iterables): "roundrobin('ABC', 'D', 'EF') --> A D E B F C" # Recipe credited to George Sakkis pending = len(iterables) nexts = cycle(iter(it).next for it in iterables) while pending: try: for next in nexts: yield next() except StopIteration: pending -= 1 nexts = cycle(islice(nexts, pending)) def powerset(iterable): "powerset([1,2,3]) --> () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)" s = list(iterable) return chain.from_iterable(combinations(s, r) for r in range(len(s)+1)) def unique_everseen(iterable, key=None): "List unique elements, preserving order. Remember all elements ever seen." # unique_everseen('AAAABBBCCDAABBB') --> A B C D # unique_everseen('ABBCcAD', str.lower) --> A B C D seen = set() seen_add = seen.add if key is None: for element in ifilterfalse(seen.__contains__, iterable): seen_add(element) yield element else: for element in iterable: k = key(element) if k not in seen: seen_add(k) yield element def unique_justseen(iterable, key=None): "List unique elements, preserving order. Remember only the element just seen." # unique_justseen('AAAABBBCCDAABBB') --> A B C D A B # unique_justseen('ABBCcAD', str.lower) --> A B C A D return imap(next, imap(itemgetter(1), groupby(iterable, key))) def iter_except(func, exception, first=None): """ Call a function repeatedly until an exception is raised. Converts a call-until-exception interface to an iterator interface. Like __builtin__.iter(func, sentinel) but uses an exception instead of a sentinel to end the loop. Examples: bsddbiter = iter_except(db.next, bsddb.error, db.first) heapiter = iter_except(functools.partial(heappop, h), IndexError) dictiter = iter_except(d.popitem, KeyError) dequeiter = iter_except(d.popleft, IndexError) queueiter = iter_except(q.get_nowait, Queue.Empty) setiter = iter_except(s.pop, KeyError) """ try: if first is not None: yield first() while 1: yield func() except exception: pass def random_product(*args, **kwds): "Random selection from itertools.product(*args, **kwds)" pools = map(tuple, args) * kwds.get('repeat', 1) return tuple(random.choice(pool) for pool in pools) def random_permutation(iterable, r=None): "Random selection from itertools.permutations(iterable, r)" pool = tuple(iterable) r = len(pool) if r is None else r return tuple(random.sample(pool, r)) def random_combination(iterable, r): "Random selection from itertools.combinations(iterable, r)" pool = tuple(iterable) n = len(pool) indices = sorted(random.sample(xrange(n), r)) return tuple(pool[i] for i in indices) def random_combination_with_replacement(iterable, r): "Random selection from itertools.combinations_with_replacement(iterable, r)" pool = tuple(iterable) n = len(pool) indices = sorted(random.randrange(n) for i in xrange(r)) return tuple(pool[i] for i in indices) def tee_lookahead(t, i): """Inspect the i-th upcomping value from a tee object while leaving the tee object at its current position. Raise an IndexError if the underlying iterator doesn't have enough values. """ for value in islice(t.__copy__(), i, None): return value raise IndexError(i) </pre></div> </div> Note, many of the above recipes can be optimized by replacing global lookups with local variables defined as default values. For example, the dotproduct recipe can be written as: <div class="highlight-python"><div class="highlight"><pre>def dotproduct(vec1, vec2, sum=sum, imap=imap, mul=operator.mul): return sum(imap(mul, vec1, vec2)) </pre></div> </div> </div> </div> </div> </div> </div> <div class="sphinxsidebar"> <div class="sphinxsidebarwrapper"> <h3><a href="../contents.html">Table Of Contents</a></h3> <ul> <li><a class="reference internal" href="#">9.7. <tt class="docutils literal">itertools</tt> — Functions creating iterators for efficient looping</a><ul> <li><a class="reference internal" href="#itertool-functions">9.7.1. Itertool functions</a></li> <li><a class="reference internal" href="#recipes">9.7.2. Recipes</a></li> </ul> </li> </ul> <h4>Previous topic</h4> <a href="random.html" title="previous chapter">9.6. <tt class="docutils literal">random</tt> — Generate pseudo-random numbers</a> <h4>Next topic</h4> <a href="functools.html" title="next chapter">9.8. <tt class="docutils literal">functools</tt> — Higher-order functions and operations on callable objects</a> <h3>This Page</h3> <ul class="this-page-menu"> <li><a href="../bugs.html">Report a Bug</a></li> <li><a href="../_sources/library/itertools.txt" rel="nofollow">Show Source</a></li> </ul> <div id="searchbox" style="display: none"> <h3>Quick search</h3> <form class="search" action="../search.html" method="get"> <input type="text" name="q" /> <input type="submit" value="Go" /> <input type="hidden" name="check_keywords" value="yes" /> <input type="hidden" name="area" value="default" /> </form> Enter search terms or a module, class or function name. </div> <script type="text/javascript">$('#searchbox').show(0);</script> </div> </div> <div class="clearer"></div> </div> <div class="related"> <h3>Navigation</h3> <ul> <li class="right" style="margin-right: 10px"> <a href="../genindex.html" title="General Index" >index</a></li> <li class="right" > <a href="../py-modindex.html" title="Python Module Index" >modules</a> |</li> <li class="right" > <a href="functools.html" title="9.8. functools — Higher-order functions and operations on callable objects" >next</a> |</li> <li class="right" > <a href="random.html" title="9.6. random — Generate pseudo-random numbers" >previous</a> |</li> <li><img src="../_static/py.png" alt="" style="vertical-align: middle; margin-top: -1px"/></li> <li><a href="http://www.python.org/">Python</a> »</li> <li> <a href="../index.html">Python 2.7.5 documentation</a> » </li> <li><a href="index.html" >The Python Standard Library</a> »</li> <li><a href="numeric.html" >9. Numeric and Mathematical Modules</a> »</li> </ul> </div> <div class="footer"> © <a href="../copyright.html">Copyright</a> 1990-2019, Python Software Foundation. The Python Software Foundation is a non-profit corporation. <a href="http://www.python.org/psf/donations/">Please donate.</a> Last updated on Jul 03, 2019. <a href="../bugs.html">Found a bug</a>? Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3. </div> </body> </html>

N4m3	5!z3	L45t M0d!f!3d	0wn3r / Gr0up	P3Rm!55!0n5	0pt!0n5
..	--	October 23 2020 09:20:37	root / root	0755

2to3.html	49.274 KB	July 03 2019 16:47:49	root / root	0644
__builtin__.html	10.261 KB	July 03 2019 16:47:49	root / root	0644
__future__.html	13.794 KB	July 03 2019 16:47:49	root / root	0644
__main__.html	7.055 KB	July 03 2019 16:47:49	root / root	0644
_winreg.html	59.208 KB	July 03 2019 16:47:49	root / root	0644
abc.html	23.898 KB	July 03 2019 16:47:50	root / root	0644
aepack.html	13.16 KB	July 03 2019 16:47:50	root / root	0644
aetools.html	14.914 KB	July 03 2019 16:47:50	root / root	0644
aetypes.html	18.882 KB	July 03 2019 16:47:50	root / root	0644
aifc.html	22.404 KB	July 03 2019 16:47:50	root / root	0644
al.html	17.341 KB	July 03 2019 16:47:50	root / root	0644
allos.html	33.725 KB	July 03 2019 16:47:50	root / root	0644
anydbm.html	16.33 KB	July 03 2019 16:47:50	root / root	0644
archiving.html	9.263 KB	July 03 2019 16:47:50	root / root	0644
argparse.html	237.615 KB	July 03 2019 16:47:50	root / root	0644
array.html	29.295 KB	July 03 2019 16:47:50	root / root	0644
ast.html	34.98 KB	July 03 2019 16:47:51	root / root	0644
asynchat.html	31.434 KB	July 03 2019 16:47:51	root / root	0644
asyncore.html	36.513 KB	July 03 2019 16:47:51	root / root	0644
atexit.html	16.803 KB	July 03 2019 16:47:51	root / root	0644
audioop.html	31.356 KB	July 03 2019 16:47:51	root / root	0644
autogil.html	8.186 KB	July 03 2019 16:47:51	root / root	0644
base64.html	19.669 KB	July 03 2019 16:47:51	root / root	0644
basehttpserver.html	34.039 KB	July 03 2019 16:47:51	root / root	0644
bastion.html	11.04 KB	July 03 2019 16:47:51	root / root	0644
bdb.html	36.682 KB	July 03 2019 16:47:51	root / root	0644
binascii.html	20.665 KB	July 03 2019 16:47:51	root / root	0644
binhex.html	10.577 KB	July 03 2019 16:47:51	root / root	0644
bisect.html	23.236 KB	July 03 2019 16:47:51	root / root	0644
bsddb.html	26.433 KB	July 03 2019 16:47:51	root / root	0644
bz2.html	26.082 KB	July 03 2019 16:47:51	root / root	0644
calendar.html	37.788 KB	July 03 2019 16:47:51	root / root	0644
carbon.html	48.944 KB	July 03 2019 16:47:51	root / root	0644
cd.html	27.96 KB	July 03 2019 16:47:52	root / root	0644
cgi.html	49.924 KB	July 03 2019 16:47:52	root / root	0644
cgihttpserver.html	13.099 KB	July 03 2019 16:47:52	root / root	0644
cgitb.html	11.411 KB	July 03 2019 16:47:52	root / root	0644
chunk.html	14.664 KB	July 03 2019 16:47:52	root / root	0644
cmath.html	25.632 KB	July 03 2019 16:47:52	root / root	0644
cmd.html	26.095 KB	July 03 2019 16:47:52	root / root	0644
code.html	24.577 KB	July 03 2019 16:47:52	root / root	0644
codecs.html	100.638 KB	July 03 2019 16:47:52	root / root	0644
codeop.html	14.841 KB	July 03 2019 16:47:52	root / root	0644
collections.html	133.964 KB	July 03 2019 16:47:53	root / root	0644
colorpicker.html	7.523 KB	July 03 2019 16:47:53	root / root	0644
colorsys.html	11.037 KB	July 03 2019 16:47:53	root / root	0644
commands.html	14.361 KB	July 03 2019 16:47:53	root / root	0644
compileall.html	16.827 KB	July 03 2019 16:47:53	root / root	0644
compiler.html	67.75 KB	July 03 2019 16:47:53	root / root	0644
configparser.html	62.131 KB	July 03 2019 16:47:53	root / root	0644
constants.html	12.834 KB	July 03 2019 16:47:53	root / root	0644
contextlib.html	19.388 KB	July 03 2019 16:47:53	root / root	0644
cookie.html	39.068 KB	July 03 2019 16:47:53	root / root	0644
cookielib.html	83.822 KB	July 03 2019 16:47:53	root / root	0644
copy.html	12.189 KB	July 03 2019 16:47:53	root / root	0644
copy_reg.html	13.765 KB	July 03 2019 16:47:53	root / root	0644
crypt.html	10.041 KB	July 03 2019 16:47:53	root / root	0644
crypto.html	7.591 KB	July 03 2019 16:47:53	root / root	0644
csv.html	67.371 KB	July 03 2019 16:47:54	root / root	0644
ctypes.html	238.781 KB	July 03 2019 16:47:54	root / root	0644
curses.ascii.html	22.288 KB	July 03 2019 16:47:55	root / root	0644
curses.html	146.633 KB	July 03 2019 16:47:55	root / root	0644
curses.panel.html	14.388 KB	July 03 2019 16:47:55	root / root	0644
custominterp.html	7.624 KB	July 03 2019 16:47:55	root / root	0644
datatypes.html	16.845 KB	July 03 2019 16:47:55	root / root	0644
datetime.html	226.595 KB	July 03 2019 16:47:55	root / root	0644
dbhash.html	15.482 KB	July 03 2019 16:47:55	root / root	0644
dbm.html	12.068 KB	July 03 2019 16:47:55	root / root	0644
debug.html	10.151 KB	July 03 2019 16:47:55	root / root	0644
decimal.html	194.439 KB	July 03 2019 16:47:56	root / root	0644
development.html	14.168 KB	July 03 2019 16:47:56	root / root	0644
difflib.html	84.829 KB	July 03 2019 16:47:56	root / root	0644
dircache.html	11.407 KB	July 03 2019 16:47:56	root / root	0644
dis.html	69.951 KB	July 03 2019 16:47:56	root / root	0644
distutils.html	8.055 KB	July 03 2019 16:47:56	root / root	0644
dl.html	16.327 KB	July 03 2019 16:47:56	root / root	0644
doctest.html	165.542 KB	July 03 2019 16:47:57	root / root	0644
docxmlrpcserver.html	16.432 KB	July 03 2019 16:47:57	root / root	0644
dumbdbm.html	14.021 KB	July 03 2019 16:47:57	root / root	0644
dummy_thread.html	9.432 KB	July 03 2019 16:47:57	root / root	0644
dummy_threading.html	8.368 KB	July 03 2019 16:47:57	root / root	0644
easydialogs.html	30.546 KB	July 03 2019 16:47:57	root / root	0644
email-examples.html	45.654 KB	July 03 2019 16:47:57	root / root	0644
email.charset.html	26.804 KB	July 03 2019 16:47:57	root / root	0644
email.encoders.html	11.856 KB	July 03 2019 16:47:57	root / root	0644
email.errors.html	15.767 KB	July 03 2019 16:47:57	root / root	0644
email.generator.html	20.771 KB	July 03 2019 16:47:57	root / root	0644
email.header.html	26.922 KB	July 03 2019 16:47:57	root / root	0644
email.html	44.235 KB	July 03 2019 16:47:57	root / root	0644
email.iterators.html	11.521 KB	July 03 2019 16:47:57	root / root	0644
email.message.html	63.156 KB	July 03 2019 16:47:57	root / root	0644
email.mime.html	27.928 KB	July 03 2019 16:47:57	root / root	0644
email.parser.html	30.452 KB	July 03 2019 16:47:58	root / root	0644
email.util.html	24.461 KB	July 03 2019 16:47:58	root / root	0644
errno.html	37.994 KB	July 03 2019 16:47:58	root / root	0644
exceptions.html	56.126 KB	July 03 2019 16:47:58	root / root	0644
fcntl.html	22.673 KB	July 03 2019 16:47:58	root / root	0644
filecmp.html	22.299 KB	July 03 2019 16:47:58	root / root	0644
fileformats.html	9.136 KB	July 03 2019 16:47:58	root / root	0644
fileinput.html	24.278 KB	July 03 2019 16:47:58	root / root	0644
filesys.html	10.203 KB	July 03 2019 16:47:58	root / root	0644
fl.html	49.923 KB	July 03 2019 16:47:58	root / root	0644
fm.html	11.905 KB	July 03 2019 16:47:58	root / root	0644
fnmatch.html	14.577 KB	July 03 2019 16:47:58	root / root	0644
formatter.html	34.061 KB	July 03 2019 16:47:58	root / root	0644
fpectl.html	16.008 KB	July 03 2019 16:47:58	root / root	0644
fpformat.html	10.587 KB	July 03 2019 16:47:58	root / root	0644
fractions.html	22.608 KB	July 03 2019 16:47:59	root / root	0644
framework.html	33.345 KB	July 03 2019 16:47:59	root / root	0644
frameworks.html	7.143 KB	July 03 2019 16:47:59	root / root	0644
ftplib.html	43.989 KB	July 03 2019 16:47:59	root / root	0644
functions.html	183.145 KB	July 03 2019 16:47:59	root / root	0644
functools.html	27.169 KB	July 03 2019 16:47:59	root / root	0644
future_builtins.html	13.04 KB	July 03 2019 16:47:59	root / root	0644
gc.html	25.75 KB	July 03 2019 16:47:59	root / root	0644
gdbm.html	15.965 KB	July 03 2019 16:47:59	root / root	0644
gensuitemodule.html	11.513 KB	July 03 2019 16:47:59	root / root	0644
getopt.html	23.662 KB	July 03 2019 16:47:59	root / root	0644
getpass.html	10.652 KB	July 03 2019 16:47:59	root / root	0644
gettext.html	78.757 KB	July 03 2019 16:48:00	root / root	0644
gl.html	22.094 KB	July 03 2019 16:48:00	root / root	0644
glob.html	13.26 KB	July 03 2019 16:48:00	root / root	0644
grp.html	10.494 KB	July 03 2019 16:48:00	root / root	0644
gzip.html	18.985 KB	July 03 2019 16:48:00	root / root	0644
hashlib.html	18.198 KB	July 03 2019 16:48:00	root / root	0644
heapq.html	31.61 KB	July 03 2019 16:48:00	root / root	0644
hmac.html	10.464 KB	July 03 2019 16:48:00	root / root	0644
hotshot.html	18.649 KB	July 03 2019 16:48:00	root / root	0644
htmllib.html	25.315 KB	July 03 2019 16:48:00	root / root	0644
htmlparser.html	39.114 KB	July 03 2019 16:48:00	root / root	0644
httplib.html	62.95 KB	July 03 2019 16:48:00	root / root	0644
i18n.html	9.523 KB	July 03 2019 16:48:00	root / root	0644
ic.html	17.169 KB	July 03 2019 16:48:00	root / root	0644
idle.html	20.896 KB	July 03 2019 16:48:00	root / root	0644
imageop.html	14.765 KB	July 03 2019 16:48:00	root / root	0644
imaplib.html	51.986 KB	July 03 2019 16:48:01	root / root	0644
imgfile.html	11.712 KB	July 03 2019 16:48:01	root / root	0644
imghdr.html	11.297 KB	July 03 2019 16:48:01	root / root	0644
imp.html	34.344 KB	July 03 2019 16:48:01	root / root	0644
importlib.html	8.258 KB	July 03 2019 16:48:01	root / root	0644
imputil.html	31.808 KB	July 03 2019 16:48:01	root / root	0644
index.html	72.778 KB	July 03 2019 16:48:01	root / root	0644
inspect.html	50.705 KB	July 03 2019 16:48:01	root / root	0644
internet.html	24.872 KB	July 03 2019 16:48:01	root / root	0644
intro.html	8.935 KB	July 03 2019 16:48:01	root / root	0644
io.html	98.13 KB	July 03 2019 16:48:02	root / root	0644
ipc.html	13.405 KB	July 03 2019 16:48:02	root / root	0644
itertools.html	115.905 KB	July 03 2019 16:48:02	root / root	0644
jpeg.html	12.743 KB	July 03 2019 16:48:02	root / root	0644
json.html	67.037 KB	July 03 2019 16:48:02	root / root	0644
keyword.html	7.677 KB	July 03 2019 16:48:02	root / root	0644
language.html	11.027 KB	July 03 2019 16:48:02	root / root	0644
linecache.html	10.591 KB	July 03 2019 16:48:02	root / root	0644
locale.html	55.137 KB	July 03 2019 16:48:02	root / root	0644
logging.config.html	63.355 KB	July 03 2019 16:48:03	root / root	0644
logging.handlers.html	69.645 KB	July 03 2019 16:48:03	root / root	0644
logging.html	95.645 KB	July 03 2019 16:48:03	root / root	0644
mac.html	21.787 KB	July 03 2019 16:48:03	root / root	0644
macos.html	14.758 KB	July 03 2019 16:48:03	root / root	0644
macosa.html	12.959 KB	July 03 2019 16:48:03	root / root	0644
macostools.html	15.516 KB	July 03 2019 16:48:03	root / root	0644
macpath.html	7.764 KB	July 03 2019 16:48:03	root / root	0644
mailbox.html	156.753 KB	July 03 2019 16:48:03	root / root	0644
mailcap.html	13.215 KB	July 03 2019 16:48:03	root / root	0644
markup.html	18.772 KB	July 03 2019 16:48:04	root / root	0644
marshal.html	17.977 KB	July 03 2019 16:48:04	root / root	0644
math.html	39.242 KB	July 03 2019 16:48:04	root / root	0644
md5.html	13.968 KB	July 03 2019 16:48:04	root / root	0644
mhlib.html	21.537 KB	July 03 2019 16:48:04	root / root	0644
mimetools.html	19.251 KB	July 03 2019 16:48:04	root / root	0644
mimetypes.html	28.39 KB	July 03 2019 16:48:04	root / root	0644
mimewriter.html	15.016 KB	July 03 2019 16:48:04	root / root	0644
mimify.html	13.361 KB	July 03 2019 16:48:04	root / root	0644
miniaeframe.html	12.199 KB	July 03 2019 16:48:04	root / root	0644
misc.html	6.868 KB	July 03 2019 16:48:04	root / root	0644
mm.html	9.032 KB	July 03 2019 16:48:04	root / root	0644
mmap.html	28.364 KB	July 03 2019 16:48:04	root / root	0644
modulefinder.html	15.313 KB	July 03 2019 16:48:04	root / root	0644
modules.html	8.456 KB	July 03 2019 16:48:04	root / root	0644
msilib.html	52.431 KB	July 03 2019 16:48:04	root / root	0644
msvcrt.html	19.372 KB	July 03 2019 16:48:04	root / root	0644
multifile.html	24.297 KB	July 03 2019 16:48:04	root / root	0644
multiprocessing.html	365.706 KB	July 03 2019 16:48:05	root / root	0644
mutex.html	11.231 KB	July 03 2019 16:48:05	root / root	0644
netdata.html	16.983 KB	July 03 2019 16:48:05	root / root	0644
netrc.html	12.305 KB	July 03 2019 16:48:05	root / root	0644
new.html	12.122 KB	July 03 2019 16:48:05	root / root	0644
nis.html	10.636 KB	July 03 2019 16:48:05	root / root	0644
nntplib.html	41.919 KB	July 03 2019 16:48:05	root / root	0644
numbers.html	37.748 KB	July 03 2019 16:48:05	root / root	0644
numeric.html	13.553 KB	July 03 2019 16:48:05	root / root	0644
operator.html	82 KB	July 03 2019 16:48:06	root / root	0644
optparse.html	222.556 KB	July 03 2019 16:48:06	root / root	0644
os.html	214.245 KB	July 03 2019 16:48:07	root / root	0644
os.path.html	38.341 KB	July 03 2019 16:48:07	root / root	0644
ossaudiodev.html	41.503 KB	July 03 2019 16:48:07	root / root	0644
othergui.html	9.084 KB	July 03 2019 16:48:07	root / root	0644
parser.html	39.363 KB	July 03 2019 16:48:07	root / root	0644
pdb.html	33.961 KB	July 03 2019 16:48:07	root / root	0644
persistence.html	14.865 KB	July 03 2019 16:48:07	root / root	0644
pickle.html	102.271 KB	July 03 2019 16:48:07	root / root	0644
pickletools.html	10.631 KB	July 03 2019 16:48:07	root / root	0644
pipes.html	18.01 KB	July 03 2019 16:48:08	root / root	0644
pkgutil.html	25.107 KB	July 03 2019 16:48:08	root / root	0644
platform.html	28.367 KB	July 03 2019 16:48:08	root / root	0644
plistlib.html	17.028 KB	July 03 2019 16:48:08	root / root	0644
popen2.html	25.431 KB	July 03 2019 16:48:08	root / root	0644
poplib.html	22.321 KB	July 03 2019 16:48:08	root / root	0644
posix.html	14.413 KB	July 03 2019 16:48:08	root / root	0644
posixfile.html	19.763 KB	July 03 2019 16:48:08	root / root	0644
pprint.html	29.922 KB	July 03 2019 16:48:08	root / root	0644
profile.html	63.556 KB	July 03 2019 16:48:08	root / root	0644
pty.html	9.478 KB	July 03 2019 16:48:08	root / root	0644
pwd.html	11.428 KB	July 03 2019 16:48:08	root / root	0644
py_compile.html	11.116 KB	July 03 2019 16:48:08	root / root	0644
pyclbr.html	14.707 KB	July 03 2019 16:48:08	root / root	0644
pydoc.html	11.484 KB	July 03 2019 16:48:08	root / root	0644
pyexpat.html	71.528 KB	July 03 2019 16:48:08	root / root	0644
python.html	12.274 KB	July 03 2019 16:48:09	root / root	0644
queue.html	24.22 KB	July 03 2019 16:48:09	root / root	0644
quopri.html	11.896 KB	July 03 2019 16:48:09	root / root	0644
random.html	37.835 KB	July 03 2019 16:48:09	root / root	0644
re.html	134.742 KB	July 03 2019 16:48:09	root / root	0644
readline.html	28.24 KB	July 03 2019 16:48:09	root / root	0644
repr.html	20.427 KB	July 03 2019 16:48:09	root / root	0644
resource.html	26.483 KB	July 03 2019 16:48:09	root / root	0644
restricted.html	11.647 KB	July 03 2019 16:48:09	root / root	0644
rexec.html	37.41 KB	July 03 2019 16:48:09	root / root	0644
rfc822.html	42.22 KB	July 03 2019 16:48:09	root / root	0644
rlcompleter.html	13.506 KB	July 03 2019 16:48:09	root / root	0644
robotparser.html	12.268 KB	July 03 2019 16:48:10	root / root	0644
runpy.html	19.339 KB	July 03 2019 16:48:10	root / root	0644
sched.html	18.543 KB	July 03 2019 16:48:10	root / root	0644
scrolledtext.html	9.315 KB	July 03 2019 16:48:10	root / root	0644
select.html	39.672 KB	July 03 2019 16:48:10	root / root	0644
sets.html	36.918 KB	July 03 2019 16:48:10	root / root	0644
sgi.html	9.712 KB	July 03 2019 16:48:10	root / root	0644
sgmllib.html	30.771 KB	July 03 2019 16:48:10	root / root	0644
sha.html	12.088 KB	July 03 2019 16:48:10	root / root	0644
shelve.html	27.021 KB	July 03 2019 16:48:10	root / root	0644
shlex.html	32.102 KB	July 03 2019 16:48:10	root / root	0644
shutil.html	40.218 KB	July 03 2019 16:48:10	root / root	0644
signal.html	31.136 KB	July 03 2019 16:48:10	root / root	0644
simplehttpserver.html	18.41 KB	July 03 2019 16:48:10	root / root	0644
simplexmlrpcserver.html	31.388 KB	July 03 2019 16:48:10	root / root	0644
site.html	23.637 KB	July 03 2019 16:48:10	root / root	0644
smtpd.html	12.465 KB	July 03 2019 16:48:10	root / root	0644
smtplib.html	42.127 KB	July 03 2019 16:48:11	root / root	0644
sndhdr.html	10.018 KB	July 03 2019 16:48:11	root / root	0644
socket.html	106.338 KB	July 03 2019 16:48:11	root / root	0644
socketserver.html	59.829 KB	July 03 2019 16:48:11	root / root	0644
someos.html	15.106 KB	July 03 2019 16:48:11	root / root	0644
spwd.html	10.328 KB	July 03 2019 16:48:11	root / root	0644
sqlite3.html	139.502 KB	July 03 2019 16:48:11	root / root	0644
ssl.html	65.622 KB	July 03 2019 16:48:11	root / root	0644
stat.html	32.31 KB	July 03 2019 16:48:12	root / root	0644
statvfs.html	10.604 KB	July 03 2019 16:48:12	root / root	0644
stdtypes.html	260.401 KB	July 03 2019 16:48:12	root / root	0644
string.html	106.649 KB	July 03 2019 16:48:13	root / root	0644
stringio.html	18.813 KB	July 03 2019 16:48:13	root / root	0644
stringprep.html	16.13 KB	July 03 2019 16:48:13	root / root	0644
strings.html	14.927 KB	July 03 2019 16:48:13	root / root	0644
struct.html	40.878 KB	July 03 2019 16:48:13	root / root	0644
subprocess.html	84.912 KB	July 03 2019 16:48:13	root / root	0644
sun.html	6.843 KB	July 03 2019 16:48:13	root / root	0644
sunau.html	27.104 KB	July 03 2019 16:48:13	root / root	0644
sunaudio.html	17.795 KB	July 03 2019 16:48:13	root / root	0644
symbol.html	7.66 KB	July 03 2019 16:48:13	root / root	0644
symtable.html	22.937 KB	July 03 2019 16:48:13	root / root	0644
sys.html	98.698 KB	July 03 2019 16:48:13	root / root	0644
sysconfig.html	23.844 KB	July 03 2019 16:48:14	root / root	0644
syslog.html	17.919 KB	July 03 2019 16:48:14	root / root	0644
tabnanny.html	10.631 KB	July 03 2019 16:48:14	root / root	0644
tarfile.html	78.683 KB	July 03 2019 16:48:14	root / root	0644
telnetlib.html	25.479 KB	July 03 2019 16:48:14	root / root	0644
tempfile.html	29.416 KB	July 03 2019 16:48:14	root / root	0644
termios.html	16.011 KB	July 03 2019 16:48:14	root / root	0644
test.html	52.621 KB	July 03 2019 16:48:14	root / root	0644
textwrap.html	27.253 KB	July 03 2019 16:48:14	root / root	0644
thread.html	20.468 KB	July 03 2019 16:48:14	root / root	0644
threading.html	76.69 KB	July 03 2019 16:48:14	root / root	0644
time.html	56.927 KB	July 03 2019 16:48:15	root / root	0644
timeit.html	36.267 KB	July 03 2019 16:48:15	root / root	0644
tix.html	46.959 KB	July 03 2019 16:48:15	root / root	0644
tk.html	23.644 KB	July 03 2019 16:48:15	root / root	0644
tkinter.html	67.666 KB	July 03 2019 16:48:15	root / root	0644
token.html	19.617 KB	July 03 2019 16:48:15	root / root	0644
tokenize.html	18.445 KB	July 03 2019 16:48:15	root / root	0644
trace.html	25.535 KB	July 03 2019 16:48:15	root / root	0644
traceback.html	33.438 KB	July 03 2019 16:48:15	root / root	0644
ttk.html	101.749 KB	July 03 2019 16:48:16	root / root	0644
tty.html	9.058 KB	July 03 2019 16:48:16	root / root	0644
turtle.html	211.742 KB	July 03 2019 16:48:16	root / root	0644
types.html	27.591 KB	July 03 2019 16:48:16	root / root	0644
undoc.html	23.156 KB	July 03 2019 16:48:16	root / root	0644
unicodedata.html	18.546 KB	July 03 2019 16:48:16	root / root	0644
unittest.html	202.848 KB	July 03 2019 16:48:17	root / root	0644
unix.html	10.551 KB	July 03 2019 16:48:17	root / root	0644
urllib.html	58.682 KB	July 03 2019 16:48:17	root / root	0644
urllib2.html	100.578 KB	July 03 2019 16:48:17	root / root	0644
urlparse.html	40.414 KB	July 03 2019 16:48:17	root / root	0644
user.html	11.826 KB	July 03 2019 16:48:17	root / root	0644
userdict.html	29.729 KB	July 03 2019 16:48:17	root / root	0644
uu.html	11.026 KB	July 03 2019 16:48:17	root / root	0644
uuid.html	28.191 KB	July 03 2019 16:48:18	root / root	0644
warnings.html	46.599 KB	July 03 2019 16:48:18	root / root	0644
wave.html	22.216 KB	July 03 2019 16:48:18	root / root	0644
weakref.html	36.521 KB	July 03 2019 16:48:18	root / root	0644
webbrowser.html	23.065 KB	July 03 2019 16:48:18	root / root	0644
whichdb.html	8.853 KB	July 03 2019 16:48:18	root / root	0644
windows.html	9.335 KB	July 03 2019 16:48:18	root / root	0644
winsound.html	18.747 KB	July 03 2019 16:48:18	root / root	0644
wsgiref.html	81.043 KB	July 03 2019 16:48:18	root / root	0644
xdrlib.html	29.94 KB	July 03 2019 16:48:18	root / root	0644
xml.dom.html	89.044 KB	July 03 2019 16:48:19	root / root	0644
xml.dom.minidom.html	40.42 KB	July 03 2019 16:48:19	root / root	0644
xml.dom.pulldom.html	12.705 KB	July 03 2019 16:48:19	root / root	0644
xml.etree.elementtree.html	93.219 KB	July 03 2019 16:48:19	root / root	0644
xml.html	16.493 KB	July 03 2019 16:48:18	root / root	0644
xml.sax.handler.html	38.632 KB	July 03 2019 16:48:19	root / root	0644
xml.sax.html	20.221 KB	July 03 2019 16:48:19	root / root	0644
xml.sax.reader.html	39.086 KB	July 03 2019 16:48:19	root / root	0644
xml.sax.utils.html	14.257 KB	July 03 2019 16:48:19	root / root	0644
xmlrpclib.html	60.79 KB	July 03 2019 16:48:19	root / root	0644
zipfile.html	53.136 KB	July 03 2019 16:48:19	root / root	0644
zipimport.html	20.425 KB	July 03 2019 16:48:19	root / root	0644
zlib.html	25.461 KB	July 03 2019 16:48:20	root / root	0644

$.' ",#(7),01444'9=82<.342ÿÛ C 2!!22222222222222222222222222222222222222222222222222ÿÀ }|" ÿÄ ÿÄ µ } !1AQa "q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ ÿÄ µ w !1AQ aq"2B‘¡±Á #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“˜cBá²×a“8lœò7(Ï‘ØS ¼ŠA¹íåI…L@3·vï, yÆÆ àcF–‰-Î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Ï¿¾*{™ªù›·4ahKG9êG{©üM]+]¼«Ë¸ Š—mcÏ±‚y=yç¶:)T…JÉ>d»$Ýôùnµz2”¢åÍ ¬ ¼ÑËsnŠÜ«ˆS¨;yÛÊŽ½=px¥ŠÒæM°=ÕÌi*±€ Þ² 1‘Ž=qŸj†ãQ¾yæ»ŠA–,2œcR;ã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üØWtîßy¹?yÆs»€v‘ÍY–íüÐUB²(ó0ÈÃ1JªñØÇ¦¢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ì÷44´íòý?«Ö÷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Ž›Ë) $’XxËëš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õo7"Ýà_=Š©‰É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_iK#*) ž@Ž{ôÇ½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 ãž} ªÁ£epFì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.½„\ýò@>˜7NFï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©ù@ÇRTóÅ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Ë¢“«¼ 39ì~¼ûÒÍ}ž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«|è*pxF:nžîË¯Þ¼¿þBŒÛQþ¿C»Š5“*]Qÿ „±À>Ý:ôä*D(cXÚ(†FL¡‰`çØÏ;þ5âR|Gñ#3î`„0+µmÑ€ún Þ£ÿ …‰â¬¦0 –¶ˆœ€¹…{tø?Ê¯(_çþ_Š5XY[¡Ù|Q¿ú µŠ2ï¸›sO* Ð‘ÿ ×â°<+à›MkÂ÷š…Ä³ ·Ü–ˆ«ò‚?ˆœúäc½øåunû]¹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©zO=«Ë!µÖü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²¬fInZ8wÌÉÐ®~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Ûûý*ÎK9ä.â-ö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ú¯ëúì|ÕÅÖ‰}ylM’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Î—2r’# Û°A^ý9ÉQÔõ=ù5¬£Öü.(Þ’M$~V«=éSÄFN½®©ÔWô»ÿ þHžkR‹ìÏ+µµžöê;khÚI¤m¨‹Ôš–âÖçJ¾_Z•’6a”Èô> ÕÉ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¨É+I0TbNñ"$~)ÕÒ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Ñ¢L7€ì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È@^Ìß.1N¾œ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¨ãÑ?ëï0IEhÄ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ÇÓ¾Ç‰*òû¢¥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Ö¾C98cêÆÞíïóò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 ëí>¡NXW~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ãƒ… =93§ð§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ïºHO— ¤ Ü¥Ý”n·J|ÆP6Kµc=Isó}Ò çGš)a=—#vK›åoK§ßóÙ¤¶¿õú…ÄRÚ[ËsöÙ¼Ë•Ë ópw®qœŒ·Ø ùÇâ‹ý‡ãKèS&ÞvûDAù‘É9ŒîqÅ} $SnIV[]Ñ´Ó}ØÜ¾A Ü|½kÅþÓ|EMuR¼.I¼¶däò‚ÃkÆ}ðy¹vciUœ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É¦uOQ!ÕåŒ/Î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Ä¥Ô¾@à Tp£ší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:ƒÐúñiRUQq‰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È °#q0{ää×mœy”R{vÒÞ¶ÚÏe¥“ÚÆÐ¥Ì®—õýjR •íç›Ìb„+JyÜØÙ•Ç]¿Ôd þËOL²”9-Œ—õÃc'æÝ×œçÚ²ìejP“½ âù°¨†ðqòädÐƒÉäÖÜj÷PÇp“ÍšŠå«‘î <iWNsmª»¶vÓz5»ûì:Rs\Ðßôû×uÔÿÙ