Consider the sample space \(\Omega = \{1, 2, 3, 4, 5, 6, 7, 8\}\) with probability distribution below. Calculate the probabilities of \(A = \{1, 3, 7, 8\}\text{,}\)\(B = \{2, 3, 6, 7\}\text{,}\)\(A\cup B\text{,}\) and \(A \cap B\text{.}\)
Suppose a die has the values \(1, 2, 3, 4, 5, 6\) on the faces, but the die is not fair. Instead, the probabilities scale by the same amount as the face values. For example, a result of 4 is twice as likely as a result of 2, since 4 is twice as large as 2; a result of 6 is six times more likely than a result of 1; and so on. Write a probability distribution table for this die.
Suppose a die has the values \(1, 2, 3, 4, 5, 6\) on the faces, but the die is not fair. Instead, each even value has an equal probability, each odd value has an equal probability, and the even values are each twice as likely as the odd values to appear on a roll. Write a probability distribution table for this die.
Let \(A = \{1, 2, 3\}\) and \(B = \{3, 4, 5\}\) be events in the sample space \(\Omega = \{1, 2, 3, 4, 5, 6\}\text{.}\) Create a probability distribution for \(\Omega\) so that \(A, B\) are independent.
diff --git a/course/_static/._877.0fa489f1083222d5.js b/course/_static/._877.0fa489f1083222d5.js
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._877.0fa489f1083222d5.js differ
diff --git a/course/_static/._877.0fa489f1083222d5.js.gz b/course/_static/._877.0fa489f1083222d5.js.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._877.0fa489f1083222d5.js.gz differ
diff --git a/course/_static/._877.0fa489f1083222d5.js.map b/course/_static/._877.0fa489f1083222d5.js.map
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._877.0fa489f1083222d5.js.map differ
diff --git a/course/_static/._877.0fa489f1083222d5.js.map.gz b/course/_static/._877.0fa489f1083222d5.js.map.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._877.0fa489f1083222d5.js.map.gz differ
diff --git a/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js differ
diff --git a/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.LICENSE.txt b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.LICENSE.txt
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.LICENSE.txt differ
diff --git a/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.LICENSE.txt.gz b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.LICENSE.txt.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.LICENSE.txt.gz differ
diff --git a/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.gz b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.gz differ
diff --git a/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.map b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.map
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.map differ
diff --git a/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.map.gz b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.map.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runestone.1d6e4aba17c2c7f2.bundle.js.map.gz differ
diff --git a/course/_static/._prefix-runtime.d892923478694492.bundle.js b/course/_static/._prefix-runtime.d892923478694492.bundle.js
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runtime.d892923478694492.bundle.js differ
diff --git a/course/_static/._prefix-runtime.d892923478694492.bundle.js.gz b/course/_static/._prefix-runtime.d892923478694492.bundle.js.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runtime.d892923478694492.bundle.js.gz differ
diff --git a/course/_static/._prefix-runtime.d892923478694492.bundle.js.map b/course/_static/._prefix-runtime.d892923478694492.bundle.js.map
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runtime.d892923478694492.bundle.js.map differ
diff --git a/course/_static/._prefix-runtime.d892923478694492.bundle.js.map.gz b/course/_static/._prefix-runtime.d892923478694492.bundle.js.map.gz
new file mode 100755
index 0000000..d4c6384
Binary files /dev/null and b/course/_static/._prefix-runtime.d892923478694492.bundle.js.map.gz differ
diff --git a/course/_static/877.0fa489f1083222d5.js b/course/_static/877.0fa489f1083222d5.js
new file mode 100755
index 0000000..c7d3e4e
--- /dev/null
+++ b/course/_static/877.0fa489f1083222d5.js
@@ -0,0 +1,2 @@
+(self.webpackChunkWebComponents=self.webpackChunkWebComponents||[]).push([[877],{27377:()=>{Sk.builtinFiles={files:{"src/builtin/this.py":'s = """Gur Mra bs Clguba, ol Gvz Crgref\n\nOrnhgvshy vf orggre guna htyl.\nRkcyvpvg vf orggre guna vzcyvpvg.\nFvzcyr vf orggre guna pbzcyrk.\nPbzcyrk vf orggre guna pbzcyvpngrq.\nSyng vf orggre guna arfgrq.\nFcnefr vf orggre guna qrafr.\nErnqnovyvgl pbhagf.\nFcrpvny pnfrf nera\'g fcrpvny rabhtu gb oernx gur ehyrf.\nNygubhtu cenpgvpnyvgl orngf chevgl.\nReebef fubhyq arire cnff fvyragyl.\nHayrff rkcyvpvgyl fvyraprq.\nVa gur snpr bs nzovthvgl, ershfr gur grzcgngvba gb thrff.\nGurer fubhyq or bar-- naq cersrenoyl bayl bar --boivbhf jnl gb qb vg.\nNygubhtu gung jnl znl abg or boivbhf ng svefg hayrff lbh\'er Qhgpu.\nAbj vf orggre guna arire.\nNygubhtu arire vf bsgra orggre guna *evtug* abj.\nVs gur vzcyrzragngvba vf uneq gb rkcynva, vg\'f n onq vqrn.\nVs gur vzcyrzragngvba vf rnfl gb rkcynva, vg znl or n tbbq vqrn.\nAnzrfcnprf ner bar ubaxvat terng vqrn -- yrg\'f qb zber bs gubfr!"""\n\nd = {}\nfor c in (65, 97):\n for i in range(26):\n d[chr(i+c)] = chr((i+13) % 26 + c)\n\nprint("".join([d.get(c, c) for c in s]))\n',"src/lib/BaseHTTPServer.py":'import _sk_fail; _sk_fail._("BaseHTTPServer")\n',"src/lib/Bastion.py":'import _sk_fail; _sk_fail._("Bastion")\n',"src/lib/CGIHTTPServer.py":'import _sk_fail; _sk_fail._("CGIHTTPServer")\n',"src/lib/ConfigParser.py":'import _sk_fail; _sk_fail._("ConfigParser")\n',"src/lib/Cookie.py":'import _sk_fail; _sk_fail._("Cookie")\n',"src/lib/DocXMLRPCServer.py":'import _sk_fail; _sk_fail._("DocXMLRPCServer")\n',"src/lib/HTMLParser.py":'import _sk_fail; _sk_fail._("HTMLParser")\n',"src/lib/MimeWriter.py":'import _sk_fail; _sk_fail._("MimeWriter")\n',"src/lib/PIL.py":'import image as _image_module\n\n__appname__ = "PIL"\n__author__ = "Marco Sirabella"\n__copyright__ = ""\n__credits__ = ["Marco Sirabella"] # Authors and bug reporters\n__license__ = "GPL"\n__version__ = "1.0"\n__maintainers__ = "Marco Sirabella"\n__email__ = "marco@sirabella.org"\n__status__ = "Prototype" # "Prototype", "Development" or "Production"\n__module__ = "PIL"\n\n\nclass PixelAccess:\n def __init__(self, parent):\n self._parent = parent\n\n def __getitem__(self, key):\n p = self._parent._image.getPixel(*key)\n return p.getRed(), p.getGreen(), p.getBlue()\n\n def __setitem__(self, key, value):\n r, g, b = value\n x, y = key\n self._parent._image.updatePixel(_image_module.Pixel(r, g, b, x, y))\n\n\nclass Image:\n def __init__(self, image):\n self._image = image\n self.size = (self._image.getWidth(), self._image.getHeight())\n\n self.pixels = PixelAccess(self)\n\n def open(filename):\n cls = Image\n self = cls(image=_image_module.Image(filename))\n return self\n\n def load(self):\n return self.pixels\n\n def show(self):\n win = _image_module.ImageWin(*self.size)\n self._image.draw(win)\n',"src/lib/Queue.py":'import _sk_fail; _sk_fail._("Queue")\n',"src/lib/SimpleHTTPServer.py":'import _sk_fail; _sk_fail._("SimpleHTTPServer")\n',"src/lib/SimpleXMLRPCServer.py":'import _sk_fail; _sk_fail._("SimpleXMLRPCServer")\n',"src/lib/SocketServer.py":'import _sk_fail; _sk_fail._("SocketServer")\n',"src/lib/StringIO.py":'r"""File-like objects that read from or write to a string buffer.\n\nThis implements (nearly) all stdio methods.\n\nf = StringIO() # ready for writing\nf = StringIO(buf) # ready for reading\nf.close() # explicitly release resources held\nflag = f.isatty() # always false\npos = f.tell() # get current position\nf.seek(pos) # set current position\nf.seek(pos, mode) # mode 0: absolute; 1: relative; 2: relative to EOF\nbuf = f.read() # read until EOF\nbuf = f.read(n) # read up to n bytes\nbuf = f.readline() # read until end of line (\'\\n\') or EOF\nlist = f.readlines()# list of f.readline() results until EOF\nf.truncate([size]) # truncate file at to at most size (default: current pos)\nf.write(buf) # write at current position\nf.writelines(list) # for line in list: f.write(line)\nf.getvalue() # return whole file\'s contents as a string\n\nNotes:\n- Using a real file is often faster (but less convenient).\n- There\'s also a much faster implementation in C, called cStringIO, but\n it\'s not subclassable.\n- fileno() is left unimplemented so that code which uses it triggers\n an exception early.\n- Seeking far beyond EOF and then writing will insert real null\n bytes that occupy space in the buffer.\n- There\'s a simple test set (see end of this file).\n"""\n\n__all__ = ["StringIO"]\n\ndef _complain_ifclosed(closed):\n if closed:\n raise ValueError("I/O operation on closed file")\n\nclass StringIO:\n """class StringIO([buffer])\n\n When a StringIO object is created, it can be initialized to an existing\n string by passing the string to the constructor. If no string is given,\n the StringIO will start empty.\n\n The StringIO object can accept either Unicode or 8-bit strings, but\n mixing the two may take some care. If both are used, 8-bit strings that\n cannot be interpreted as 7-bit ASCII (that use the 8th bit) will cause\n a UnicodeError to be raised when getvalue() is called.\n """\n def __init__(self, buf = \'\'):\n # Force self.buf to be a string or unicode\n if not isinstance(buf, str):\n buf = str(buf)\n self.buf = buf\n self.len = len(buf)\n self.buflist = []\n self.pos = 0\n self.closed = False\n self.softspace = 0\n\n def __iter__(self):\n return self\n\n def next(self):\n """A file object is its own iterator, for example iter(f) returns f\n (unless f is closed). When a file is used as an iterator, typically\n in a for loop (for example, for line in f: print line), the next()\n method is called repeatedly. This method returns the next input line,\n or raises StopIteration when EOF is hit.\n """\n _complain_ifclosed(self.closed)\n r = self.readline()\n if not r:\n raise StopIteration\n return r\n\n def close(self):\n """Free the memory buffer.\n """\n if not self.closed:\n self.closed = True\n self.buf = None\n self.pos = None\n\n def isatty(self):\n """Returns False because StringIO objects are not connected to a\n tty-like device.\n """\n _complain_ifclosed(self.closed)\n return False\n\n def seek(self, pos, mode = 0):\n """Set the file\'s current position.\n\n The mode argument is optional and defaults to 0 (absolute file\n positioning); other values are 1 (seek relative to the current\n position) and 2 (seek relative to the file\'s end).\n\n There is no return value.\n """\n _complain_ifclosed(self.closed)\n if self.buflist:\n self.buf += \'\'.join(self.buflist)\n self.buflist = []\n if mode == 1:\n pos += self.pos\n elif mode == 2:\n pos += self.len\n self.pos = max(0, pos)\n\n def tell(self):\n """Return the file\'s current position."""\n _complain_ifclosed(self.closed)\n return self.pos\n\n def read(self, n = -1):\n """Read at most size bytes from the file\n (less if the read hits EOF before obtaining size bytes).\n\n If the size argument is negative or omitted, read all data until EOF\n is reached. The bytes are returned as a string object. An empty\n string is returned when EOF is encountered immediately.\n """\n _complain_ifclosed(self.closed)\n if self.buflist:\n self.buf += \'\'.join(self.buflist)\n self.buflist = []\n if n is None or n < 0:\n newpos = self.len\n else:\n newpos = min(self.pos+n, self.len)\n r = self.buf[self.pos:newpos]\n self.pos = newpos\n return r\n\n def readline(self, length=None):\n r"""Read one entire line from the file.\n\n A trailing newline character is kept in the string (but may be absent\n when a file ends with an incomplete line). If the size argument is\n present and non-negative, it is a maximum byte count (including the\n trailing newline) and an incomplete line may be returned.\n\n An empty string is returned only when EOF is encountered immediately.\n\n Note: Unlike stdio\'s fgets(), the returned string contains null\n characters (\'\\0\') if they occurred in the input.\n """\n _complain_ifclosed(self.closed)\n if self.buflist:\n self.buf += \'\'.join(self.buflist)\n self.buflist = []\n i = self.buf.find(\'\\n\', self.pos)\n if i < 0:\n newpos = self.len\n else:\n newpos = i+1\n if length is not None and length >= 0:\n if self.pos + length < newpos:\n newpos = self.pos + length\n r = self.buf[self.pos:newpos]\n self.pos = newpos\n return r\n\n def readlines(self, sizehint = 0):\n """Read until EOF using readline() and return a list containing the\n lines thus read.\n\n If the optional sizehint argument is present, instead of reading up\n to EOF, whole lines totalling approximately sizehint bytes (or more\n to accommodate a final whole line).\n """\n total = 0\n lines = []\n line = self.readline()\n while line:\n lines.append(line)\n total += len(line)\n if 0 < sizehint <= total:\n break\n line = self.readline()\n return lines\n\n def truncate(self, size=None):\n """Truncate the file\'s size.\n\n If the optional size argument is present, the file is truncated to\n (at most) that size. The size defaults to the current position.\n The current file position is not changed unless the position\n is beyond the new file size.\n\n If the specified size exceeds the file\'s current size, the\n file remains unchanged.\n """\n _complain_ifclosed(self.closed)\n if size is None:\n size = self.pos\n elif size < 0:\n raise IOError(22, "Negative size not allowed")\n elif size < self.pos:\n self.pos = size\n self.buf = self.getvalue()[:size]\n self.len = size\n\n def write(self, s):\n """Write a string to the file.\n\n There is no return value.\n """\n _complain_ifclosed(self.closed)\n if not s: return\n # Force s to be a string or unicode\n if not isinstance(s, str):\n s = str(s)\n spos = self.pos\n slen = self.len\n if spos == slen:\n self.buflist.append(s)\n self.len = self.pos = spos + len(s)\n return\n if spos > slen:\n self.buflist.append(\'\\0\'*(spos - slen))\n slen = spos\n newpos = spos + len(s)\n if spos < slen:\n if self.buflist:\n self.buf += \'\'.join(self.buflist)\n self.buflist = [self.buf[:spos], s, self.buf[newpos:]]\n self.buf = \'\'\n if newpos > slen:\n slen = newpos\n else:\n self.buflist.append(s)\n slen = newpos\n self.len = slen\n self.pos = newpos\n\n def writelines(self, iterable):\n """Write a sequence of strings to the file. The sequence can be any\n iterable object producing strings, typically a list of strings. There\n is no return value.\n\n (The name is intended to match readlines(); writelines() does not add\n line separators.)\n """\n write = self.write\n for line in iterable:\n write(line)\n\n def flush(self):\n """Flush the internal buffer\n """\n _complain_ifclosed(self.closed)\n\n def getvalue(self):\n """\n Retrieve the entire contents of the "file" at any time before\n the StringIO object\'s close() method is called.\n\n The StringIO object can accept either Unicode or 8-bit strings,\n but mixing the two may take some care. If both are used, 8-bit\n strings that cannot be interpreted as 7-bit ASCII (that use the\n 8th bit) will cause a UnicodeError to be raised when getvalue()\n is called.\n """\n _complain_ifclosed(self.closed)\n if self.buflist:\n self.buf += \'\'.join(self.buflist)\n self.buflist = []\n return self.buf\n\n # The following two methods implement the PEP343 context management protocol\n # for StringIO objects, allowing them to be used in with statements.\n # In standard Python this is done via inheriting from IOBase\n # Possible pure Python implementation: https://github.com/python/cpython/blob/main/Lib/_pyio.py\n def __enter__(self):\n _complain_ifclosed(self.closed)\n return self\n\n def __exit__(self, *args):\n self.close()\n',"src/lib/UserDict.py":'import _sk_fail; _sk_fail._("UserDict")\n',"src/lib/UserList.py":'import _sk_fail; _sk_fail._("UserList")\n',"src/lib/UserString.py":'import _sk_fail; _sk_fail._("UserString")\n',"src/lib/_LWPCookieJar.py":'import _sk_fail; _sk_fail._("_LWPCookieJar")\n',"src/lib/_MozillaCookieJar.py":'import _sk_fail; _sk_fail._("_MozillaCookieJar")\n',"src/lib/__future__.py":'import _sk_fail;_sk_fail._("__future__")\n',"src/lib/__phello__.foo.py":'import _sk_fail; _sk_fail._("__phello__.foo")\n',"src/lib/_abcoll.py":'import _sk_fail; _sk_fail._("_abcoll")\n',"src/lib/_sk_fail.py":'class NotImplementedImportError(ImportError, NotImplementedError): pass\n\ndef _(name):\n msg = "{} is not yet implemented in Skulpt".format(name)\n raise NotImplementedImportError(msg, name=name)\n',"src/lib/_threading_local.py":'import _sk_fail; _sk_fail._("_threading_local")\n',"src/lib/abc.py":'import _sk_fail; _sk_fail._("abc")\n',"src/lib/aifc.py":'import _sk_fail; _sk_fail._("aifc")\n',"src/lib/altair/__init__.py":'import random\n\ntry:\n from vega_caller import render_graph\nexcept:\n print("Mock render")\n\n def render_graph(js):\n print(js)\n\n\nclass Chart:\n # TODO allow data to be specified as a URL to a CSV or DB or json\n def __init__(self, data, title=None):\n self.title = title\n self.data_id = random.randrange(1000000, 5000000)\n self.dsname = "data-{}".format(self.data_id)\n if isinstance(data, dict):\n self.data = Data(**data)\n else:\n self.data = data\n\n self.json = {}\n self.json["$schema"] = "https://vega.github.io/schema/vega-lite/v2.5.json"\n self.json["data"] = {}\n if self.title:\n self.json["title"] = self.title\n\n self.json["data"] = {"values": self.data.vals}\n self.is_composite = False\n\n # mark can be a simple string or a dictionary\n # "mark": {"color": "green", "opacity": 0.2, "type": "rect"}\n\n def mark_json(self, mark_type, **kwargs):\n if kwargs:\n self.json["mark"] = {}\n self.json["mark"]["type"] = mark_type\n self.json["mark"].update(kwargs)\n else:\n self.json["mark"] = mark_type\n\n return self\n\n def mark_bar(self, **kwargs):\n return self.mark_json("bar", **kwargs)\n\n def mark_point(self, **kwargs):\n return self.mark_json("point", **kwargs)\n\n def mark_line(self, **kwargs):\n return self.mark_json("line", **kwargs)\n\n def mark_rect(self, **kwargs):\n return self.mark_json("rect", **kwargs)\n\n def mark_area(self, **kwargs):\n return self.mark_json("area", **kwargs)\n\n def mark_tick(self, **kwargs):\n return self.mark_json("tick", **kwargs)\n\n def encode(self, x="", y="", color="", size="", tooltip=""):\n self.encoding = {}\n if x:\n if isinstance(x, Axis):\n self.encoding["x"] = x.toJson()\n else:\n self.encoding["x"] = Axis(x).toJson()\n if y:\n if isinstance(y, Axis):\n self.encoding["y"] = y.toJson()\n else:\n self.encoding["y"] = Axis(y).toJson()\n\n # "color": {"type": "nominal", "field": "species"}\n if color:\n field, tp = _get_name_type(color)\n self.encoding["color"] = dict(type=tp, field=field)\n\n # "size": {"type": "quantitative", "field": "Acceleration"}\n if size:\n field, tp = _get_name_type(size)\n self.encoding["size"] = dict(type=tp, field=field)\n\n if tooltip:\n field, tp = _get_name_type(tooltip)\n self.encoding["tooltip"] = dict(type=tp, field=field)\n\n self.json["encoding"] = self.encoding\n return self\n\n def interactive(self):\n iconfig = {\n "selector002": {\n "type": "interval",\n "bind": "scales",\n "encodings": ["x", "y"],\n "on": "[mousedown, window:mouseup] > window:mousemove!",\n "translate": "[mousedown, window:mouseup] > window:mousemove!",\n "zoom": "wheel!",\n "mark": {"fill": "#333", "fillOpacity": 0.125, "stroke": "white"},\n "resolve": "global",\n }\n }\n self.json["selection"] = iconfig\n return self\n\n def display(self):\n render_graph(self.json)\n\n def __add__(self, other):\n return self.add_layer(other, "layer")\n\n def __and__(self, other):\n return self.add_layer(other, "vconcat")\n\n def __or__(self, other):\n return self.add_layer(other, "hconcat")\n\n def add_layer(self, other, lname):\n # multle layers are added by concatenating the new element to the\n # existing layer. If the layer does not exist then initialize\n # it from self.\n if lname not in self.json:\n self.json[lname] = []\n self.json["datasets"] = {}\n temp = {}\n temp["data"] = {"name": self.dsname}\n self.json["datasets"][self.dsname] = self.json["data"]["values"]\n del self.json["data"]\n temp["encoding"] = self.json["encoding"]\n del self.json["encoding"]\n temp["mark"] = self.json["mark"]\n del self.json["mark"]\n self.json[lname].append(temp)\n temp = {}\n self.json["datasets"][other.dsname] = other.json["data"]["values"]\n temp["data"] = {"name": other.dsname}\n temp["encoding"] = other.json["encoding"]\n temp["mark"] = other.json["mark"]\n self.json[lname].append(temp)\n return self\n\n\n# "datasets": {\n# "data-e56e43354d9b8f2ab0d1e90cf27cd47f": [\n# {"a": 4, "b": 1, "c": "r"},\n# {"a": 5, "b": 2, "c": "g"},\n# {"a": 6, "b": 3, "c": "b"}\n# ],\n# "data-a4c3047a15bf9380c2e615cf87648369": [\n# {"a": 1, "b": 4, "c": "r"},\n# {"a": 2, "b": 5, "c": "g"},\n# {"a": 3, "b": 6, "c": "b"}\n# ]\n# }\n\n# TODO: add a rect mark type for a heat map\n\n\ndef _get_name_type(name):\n typed = {"Q": "quantitative", "O": "ordinal", "N": "nominal", "T": "temporal"}\n nt = name.split(":")\n tstring = "quantitative"\n if len(nt) == 2:\n tstring = typed[nt[1]]\n return nt[0], tstring\n\n\nclass Axis:\n def __init__(self, name, bin=False):\n self.aggregate = None\n self.name, self.type = _get_name_type(name)\n if "()" in self.name: # aggregate function\n self.aggregate = self.name.replace("()", "")\n self.name = None\n self.bin = bin\n\n def toJson(self):\n json = {}\n if self.name:\n json["field"] = self.name\n if self.type:\n json["type"] = self.type\n if self.bin:\n json["bin"] = True\n if self.aggregate:\n json["aggregate"] = self.aggregate\n\n return json\n\n\nclass X(Axis):\n pass\n\n\nclass Y(Axis):\n pass\n\n\nclass Data:\n def __init__(self, **kwargs):\n """\n input can be the form of a series of keyword args where\n the keyword is the column name, or a single keyword data\n that is a list of json style records as rows.\n could also accept a csv file? or keywords columns and rows\n This accepts a lot more options that "real altair" to make it easier\n to work with non-DataFrame data sets. Internally:\n self.keys contains the list of column names\n self.vals is a list of dictionaries of the form [{col1:val1, col2:val2, ... coln:valn},\n {col1:val3, col2:val4, ... coln:valn},\n {col1:val5, col2:val6, ... coln:valn}]\n """\n # todo: accept a URL as the argument to read a CSV or JSON file\n if len(kwargs) == 1 and "data" in kwargs:\n self.data = kwargs["data"]\n self.keys = self.data[0].keys()\n self.vals = self.data\n elif len(kwargs) == 2 and ("columns" in kwargs) and ("rows" in kwargs):\n self.keys = kwargs["columns"]\n self.vals = []\n for r in kwargs["rows"]:\n self.vals.append(dict(zip(self.keys, r)))\n else:\n keys = kwargs.keys()\n vals = []\n primary_key = list(keys)[0]\n for ix in range(len(kwargs[primary_key])):\n d = {}\n for key in keys:\n d[key] = kwargs[key][ix]\n vals.append(d)\n self.vals = vals\n self.keys = keys\n\n def __str__(self):\n # header = "\\t".join(self.keys) + "\\n"\n header = ""\n for key in self.keys:\n header += key.center(10) + " "\n header += "\\n"\n template = ""\n for key in self.keys:\n template += "{" + key + ": <10} "\n template += "\\n"\n res = ""\n for row in self.vals:\n res += template.format(**row)\n\n return header + res\n\n\nif __name__ == "__main__":\n d = Data(a=[3, 4, 5], b=[1, 2, 3], c=["r", "g", "b"])\n print(d)\n print(\n type(\n Chart({"a": list("abc"), "b": [1, 2, 3]}).mark_bar().encode(x="a:N", y="b")\n )\n )\n aa = (\n Chart(Data(a=[3, 4, 5], b=[1, 2, 3], c=["r", "g", "b"]))\n .mark_point(color="red")\n .encode(x="b", y="a", color="c:O")\n )\n print("aa = ", aa)\n aa.display()\n\n bb = (\n Chart(Data(a=[1, 2, 3], b=[4, 5, 6], c=["r", "g", "b"]))\n .mark_line()\n .encode(x="b", y="a", color="c:O")\n )\n print("bb = ", bb)\n bb.display()\n print("aa+bb", (aa + bb).display())\n # Chart(Data(a=[1,2,3,2,2,4,5,5,6,7,8,8,8,8,8,9,0,0])).mark_bar().encode(Axis(\'a:Q\', bin=True),y=\'count()\')\n\n\n# todo: see if I can work with the repr of an object to get the behavior that altair gets in notebooks\n# todo: implement a Bin object to specifiy maxbins\n',"src/lib/antigravity.py":'import webbrowser\n\nwebbrowser.open("https://xkcd.com/353/")\n',"src/lib/anydbm.py":'import _sk_fail; _sk_fail._("anydbm")\n',"src/lib/ast.py":'import _sk_fail; _sk_fail._("ast")\n',"src/lib/asynchat.py":'import _sk_fail; _sk_fail._("asynchat")\n',"src/lib/asyncore.py":'import _sk_fail; _sk_fail._("asyncore")\n',"src/lib/atexit.py":'import _sk_fail; _sk_fail._("atexit")\n',"src/lib/audiodev.py":'import _sk_fail; _sk_fail._("audiodev")\n',"src/lib/base64.py":'import _sk_fail; _sk_fail._("base64")\n',"src/lib/bdb.py":'import _sk_fail; _sk_fail._("bdb")\n',"src/lib/binhex.py":'import _sk_fail; _sk_fail._("binhex")\n',"src/lib/bisect.py":'"""Bisection algorithms."""\n\ndef insort_right(a, x, lo=0, hi=None):\n """Insert item x in list a, and keep it sorted assuming a is sorted.\n\n If x is already in a, insert it to the right of the rightmost x.\n\n Optional args lo (default 0) and hi (default len(a)) bound the\n slice of a to be searched.\n """\n\n if lo < 0:\n raise ValueError(\'lo must be non-negative\')\n if hi is None:\n hi = len(a)\n while lo < hi:\n mid = (lo+hi)//2\n if x < a[mid]: hi = mid\n else: lo = mid+1\n a.insert(lo, x)\n\ndef bisect_right(a, x, lo=0, hi=None):\n """Return the index where to insert item x in list a, assuming a is sorted.\n\n The return value i is such that all e in a[:i] have e <= x, and all e in\n a[i:] have e > x. So if x already appears in the list, a.insert(x) will\n insert just after the rightmost x already there.\n\n Optional args lo (default 0) and hi (default len(a)) bound the\n slice of a to be searched.\n """\n\n if lo < 0:\n raise ValueError(\'lo must be non-negative\')\n if hi is None:\n hi = len(a)\n while lo < hi:\n mid = (lo+hi)//2\n if x < a[mid]: hi = mid\n else: lo = mid+1\n return lo\n\ndef insort_left(a, x, lo=0, hi=None):\n """Insert item x in list a, and keep it sorted assuming a is sorted.\n\n If x is already in a, insert it to the left of the leftmost x.\n\n Optional args lo (default 0) and hi (default len(a)) bound the\n slice of a to be searched.\n """\n\n if lo < 0:\n raise ValueError(\'lo must be non-negative\')\n if hi is None:\n hi = len(a)\n while lo < hi:\n mid = (lo+hi)//2\n if a[mid] < x: lo = mid+1\n else: hi = mid\n a.insert(lo, x)\n\n\ndef bisect_left(a, x, lo=0, hi=None):\n """Return the index where to insert item x in list a, assuming a is sorted.\n\n The return value i is such that all e in a[:i] have e < x, and all e in\n a[i:] have e >= x. So if x already appears in the list, a.insert(x) will\n insert just before the leftmost x already there.\n\n Optional args lo (default 0) and hi (default len(a)) bound the\n slice of a to be searched.\n """\n\n if lo < 0:\n raise ValueError(\'lo must be non-negative\')\n if hi is None:\n hi = len(a)\n while lo < hi:\n mid = (lo+hi)//2\n if a[mid] < x: lo = mid+1\n else: hi = mid\n return lo\n\n# Overwrite above definitions with a fast C implementation\ntry:\n from _bisect import *\nexcept ImportError:\n pass\n\n# Create aliases\nbisect = bisect_right\ninsort = insort_right\n',"src/lib/bsddb/__init__.py":'import _sk_fail; _sk_fail._("bsddb")\n',"src/lib/cProfile.py":'import _sk_fail; _sk_fail._("cProfile")\n',"src/lib/cgi.py":'import _sk_fail; _sk_fail._("cgi")\n',"src/lib/cgitb.py":'import _sk_fail; _sk_fail._("cgitb")\n',"src/lib/chunk.py":'import _sk_fail; _sk_fail._("chunk")\n',"src/lib/cmd.py":'import _sk_fail; _sk_fail._("cmd")\n',"src/lib/code.py":'import _sk_fail; _sk_fail._("code")\n',"src/lib/codecs.py":'import _sk_fail; _sk_fail._("codecs")\n',"src/lib/codeop.py":'import _sk_fail; _sk_fail._("codeop")\n',"src/lib/colorsys.py":'import _sk_fail; _sk_fail._("colorsys")\n',"src/lib/commands.py":'import _sk_fail; _sk_fail._("commands")\n',"src/lib/compileall.py":'import _sk_fail; _sk_fail._("compileall")\n',"src/lib/compiler/__init__.py":'import _sk_fail; _sk_fail._("compiler")\n',"src/lib/config/__init__.py":'import _sk_fail; _sk_fail._("config")\n',"src/lib/contextlib.py":'import _sk_fail; _sk_fail._("contextlib")\n',"src/lib/cookielib.py":'import _sk_fail; _sk_fail._("cookielib")\n',"src/lib/copy.py":'"""\nThis file was modified from CPython.\nCopyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,\n2011, 2012, 2013, 2014, 2015 Python Software Foundation; All Rights Reserved\n"""\nimport types\nclass Error(Exception):\n pass\nerror = Error \nclass _EmptyClass:\n pass\ntry:\n long\nexcept NameError:\n long = int\ntry:\n bytes\nexcept NameError:\n bytes = str\n\ndef check_notimplemented_state(x):\n getstate = getattr(x, "__getstate__", None)\n setstate = getattr(x, "__setstate__", None)\n initargs = getattr(x, "__getinitargs__", None)\n if getstate or setstate or initargs:\n raise NotImplementedError("Skulpt does not yet support copying with user-defined __getstate__, __setstate__ or __getinitargs__()")\n\n\ndef copy(x):\n cls = type(x)\n if callable(x):\n return x\n copier = getattr(cls, "__copy__", None)\n if copier:\n return copier(x)\n if cls in (type(None), int, float, bool, str, bytes, tuple, type, frozenset, long):\n return x\n if (cls == list) or (cls == dict) or (cls == set) or (cls == slice):\n return cls(x)\n reductor = getattr(x, "__reduce_ex__", None)\n if reductor:\n rv = reductor(4)\n else:\n reductor = getattr(x, "__reduce__", None)\n if reductor:\n rv = reductor()\n elif str(cls)[1:6] == "class":\n check_notimplemented_state(x)\n copier = _copy_inst\n return copier(x)\n else:\n raise Error("un(shallow)copyable object of type %s" % cls)\n if isinstance(rv, str):\n return x\n return _reconstruct(x, rv, 0)\n\ndef _copy_inst(x):\n if hasattr(x, \'__copy__\'):\n return x.__copy__()\n if hasattr(x, \'__getinitargs__\'):\n args = x.__getinitargs__()\n y = x.__class__(*args)\n else:\n y = _EmptyClass()\n y.__class__ = x.__class__\n if hasattr(x, \'__getstate__\'):\n state = x.__getstate__()\n else:\n state = x.__dict__\n if hasattr(y, \'__setstate__\'):\n y.__setstate__(state)\n else:\n y.__dict__.update(state)\n return y\n\nd = _deepcopy_dispatch = {}\n\ndef deepcopy(x, memo=None, _nil=[]):\n """Deep copy operation on arbitrary Python objects.\n See the module\'s __doc__ string for more info.\n """\n if memo is None:\n memo = {}\n idx = id(x)\n y = memo.get(idx, _nil)\n if y is not _nil:\n return y\n cls = type(x)\n copier = _deepcopy_dispatch.get(cls)\n if copier:\n y = copier(x, memo)\n else:\n try:\n issc = issubclass(cls, type)\n except TypeError: # cls is not a class (old Boost; see SF #502085)\n issc = 0\n if issc:\n y = _deepcopy_atomic(x, memo)\n else:\n copier = getattr(x, "__deepcopy__", None)\n if copier:\n y = copier(memo)\n else:\n reductor = getattr(x, "__reduce_ex__", None)\n if reductor:\n rv = reductor(2)\n else:\n rv = None\n reductor = getattr(x, "__reduce__", None)\n if reductor:\n rv = reductor()\n elif str(cls)[1:6] == "class":\n check_notimplemented_state(x)\n copier = _deepcopy_dispatch["InstanceType"]\n y = copier(x, memo)\n else:\n raise Error(\n "un(deep)copyable object of type %s" % cls)\n if rv is not None:\n y = _reconstruct(x, rv, 1, memo)\n memo[idx] = y\n _keep_alive(x, memo) # Make sure x lives at least as long as d\n return y\n\ndef _deepcopy_atomic(x, memo):\n return x\nd[type(None)] = _deepcopy_atomic\n# d[type(Ellipsis)] = _deepcopy_atomic\nd[type(NotImplemented)] = _deepcopy_atomic\nd[int] = _deepcopy_atomic\nd[float] = _deepcopy_atomic\nd[bool] = _deepcopy_atomic\nd[complex] = _deepcopy_atomic\nd[bytes] = _deepcopy_atomic\nd[str] = _deepcopy_atomic\n# try:\n# d[types.CodeType] = _deepcopy_atomic\n# except AttributeError:\n# pass\nd[type] = _deepcopy_atomic\n# d[types.BuiltinFunctionType] = _deepcopy_atomic\nd[types.FunctionType] = _deepcopy_atomic\n# d[weakref.ref] = _deepcopy_atomic\n\ndef _deepcopy_list(x, memo):\n y = []\n memo[id(x)] = y\n for a in x:\n y.append(deepcopy(a, memo))\n return y\nd[list] = _deepcopy_list\n\ndef _deepcopy_set(x, memo):\n result = set([]) # make empty set\n memo[id(x)] = result # register this set in the memo for loop checking\n for a in x: # go through elements of set\n result.add(deepcopy(a, memo)) # add the copied elements into the new set\n return result # return the new set\nd[set] = _deepcopy_set\n\ndef _deepcopy_frozenset(x, memo):\n result = frozenset(_deepcopy_set(x,memo)) \n memo[id(x)] = result \n return result\nd[frozenset] = _deepcopy_frozenset\n\ndef _deepcopy_tuple(x, memo):\n y = [deepcopy(a, memo) for a in x]\n # We\'re not going to put the tuple in the memo, but it\'s still important we\n # check for it, in case the tuple contains recursive mutable structures.\n try:\n return memo[id(x)]\n except KeyError:\n pass\n for k, j in zip(x, y):\n if k is not j:\n y = tuple(y)\n break\n else:\n y = x\n return y\nd[tuple] = _deepcopy_tuple\n\ndef _deepcopy_dict(x, memo):\n y = {}\n memo[id(x)] = y\n for key, value in x.items():\n y[deepcopy(key, memo)] = deepcopy(value, memo)\n return y\nd[dict] = _deepcopy_dict\n\n# def _deepcopy_method(x, memo): # Copy instance methods\n# y = type(x)(x.im_func, deepcopy(x.im_self, memo), x.im_class);\n# return y\nd[types.MethodType] = _deepcopy_atomic\n\ndef _deepcopy_inst(x, memo):\n if hasattr(x, \'__deepcopy__\'):\n return x.__deepcopy__(memo)\n if hasattr(x, \'__getinitargs__\'):\n args = x.__getinitargs__()\n args = deepcopy(args, memo)\n y = x.__class__(*args)\n else:\n y = _EmptyClass()\n y.__class__ = x.__class__\n memo[id(x)] = y\n if hasattr(x, \'__getstate__\'):\n state = x.__getstate__()\n else:\n state = x.__dict__\n state = deepcopy(state, memo)\n if hasattr(y, \'__setstate__\'):\n y.__setstate__(state)\n else:\n y.__dict__.update(state)\n return y\nd["InstanceType"] = _deepcopy_inst\n\ndef _keep_alive(x, memo):\n """Keeps a reference to the object x in the memo.\n Because we remember objects by their id, we have\n to assure that possibly temporary objects are kept\n alive by referencing them.\n We store a reference at the id of the memo, which should\n normally not be used unless someone tries to deepcopy\n the memo itself...\n """\n try:\n memo[id(memo)].append(x)\n except KeyError:\n # aha, this is the first one :-)\n memo[id(memo)]=[x]\n\ndef _reconstruct(x, info, deep, memo=None):\n if isinstance(info, str):\n return x\n assert isinstance(info, tuple)\n if memo is None:\n memo = {}\n n = len(info)\n assert n in (2, 3, 4, 5)\n callable, args = info[:2]\n if n > 2:\n state = info[2]\n else:\n state = None\n if n > 3:\n listiter = info[3]\n else:\n listiter = None\n if n > 4:\n dictiter = info[4]\n else:\n dictiter = None\n if deep:\n args = deepcopy(args, memo)\n y = callable(*args)\n memo[id(x)] = y\n\n if state is not None:\n if deep:\n state = deepcopy(state, memo)\n if hasattr(y, \'__setstate__\'):\n y.__setstate__(state)\n else:\n if isinstance(state, tuple) and len(state) == 2:\n state, slotstate = state\n else:\n slotstate = None\n if state is not None:\n y.__dict__.update(state)\n if slotstate is not None:\n for key, value in slotstate.items():\n setattr(y, key, value)\n\n if listiter is not None:\n for item in listiter:\n if deep:\n item = deepcopy(item, memo)\n y.append(item)\n if dictiter is not None:\n for key, value in dictiter:\n if deep:\n key = deepcopy(key, memo)\n value = deepcopy(value, memo)\n y[key] = value\n return y\n\ndel d\n\ndel types\n\n# Helper for instance creation without calling __init__\nclass _EmptyClass:\n pass',"src/lib/copy_reg.py":'import _sk_fail; _sk_fail._("copy_reg")\n',"src/lib/csv.py":'import _sk_fail; _sk_fail._("csv")\n',"src/lib/ctypes/__init__.py":'import _sk_fail; _sk_fail._("ctypes")\n',"src/lib/ctypes/macholib/__init__.py":'import _sk_fail; _sk_fail._("macholib")\n',"src/lib/curses/__init__.py":'import _sk_fail; _sk_fail._("curses")\n',"src/lib/dbhash.py":'import _sk_fail; _sk_fail._("dbhash")\n',"src/lib/decimal.py":'import _sk_fail; _sk_fail._("decimal")\n',"src/lib/difflib.py":'import _sk_fail; _sk_fail._("difflib")\n',"src/lib/dircache.py":'import _sk_fail; _sk_fail._("dircache")\n',"src/lib/dis.py":'import _sk_fail; _sk_fail._("dis")\n',"src/lib/distutils/__init__.py":'import _sk_fail; _sk_fail._("distutils")\n',"src/lib/distutils/command/__init__.py":'import _sk_fail; _sk_fail._("command")\n',"src/lib/distutils/tests/__init__.py":'import _sk_fail; _sk_fail._("tests")\n',"src/lib/doctest.py":'import _sk_fail; _sk_fail._("doctest")\n',"src/lib/dumbdbm.py":'import _sk_fail; _sk_fail._("dumbdbm")\n',"src/lib/dummy_thread.py":'import _sk_fail; _sk_fail._("dummy_thread")\n',"src/lib/dummy_threading.py":'import _sk_fail; _sk_fail._("dummy_threading")\n',"src/lib/email/__init__.py":'import _sk_fail; _sk_fail._("email")\n',"src/lib/email/mime/__init__.py":'import _sk_fail; _sk_fail._("mime")\n',"src/lib/email/test/data/__init__.py":'import _sk_fail; _sk_fail._("data")\n',"src/lib/encodings/__init__.py":'import _sk_fail; _sk_fail._("encodings")\n',"src/lib/filecmp.py":'import _sk_fail; _sk_fail._("filecmp")\n',"src/lib/fileinput.py":'import _sk_fail; _sk_fail._("fileinput")\n',"src/lib/fnmatch.py":'import _sk_fail; _sk_fail._("fnmatch")\n',"src/lib/formatter.py":'import _sk_fail; _sk_fail._("formatter")\n',"src/lib/fpformat.py":'import _sk_fail; _sk_fail._("fpformat")\n',"src/lib/fractions.py":'import _sk_fail; _sk_fail._("fractions")\n',"src/lib/ftplib.py":'import _sk_fail; _sk_fail._("ftplib")\n',"src/lib/genericpath.py":'import _sk_fail; _sk_fail._("genericpath")\n',"src/lib/getopt.py":'import _sk_fail; _sk_fail._("getopt")\n',"src/lib/getpass.py":'import _sk_fail; _sk_fail._("getpass")\n',"src/lib/gettext.py":'import _sk_fail; _sk_fail._("gettext")\n',"src/lib/glob.py":'import _sk_fail; _sk_fail._("glob")\n',"src/lib/gzip.py":'import _sk_fail; _sk_fail._("gzip")\n',"src/lib/hashlib.py":'import _sk_fail; _sk_fail._("hashlib")\n',"src/lib/heapq.py":'"""Heap queue algorithm (a.k.a. priority queue).\n\nHeaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for\nall k, counting elements from 0. For the sake of comparison,\nnon-existing elements are considered to be infinite. The interesting\nproperty of a heap is that a[0] is always its smallest element.\n\nUsage:\n\nheap = [] # creates an empty heap\nheappush(heap, item) # pushes a new item on the heap\nitem = heappop(heap) # pops the smallest item from the heap\nitem = heap[0] # smallest item on the heap without popping it\nheapify(x) # transforms list into a heap, in-place, in linear time\nitem = heapreplace(heap, item) # pops and returns smallest item, and adds\n # new item; the heap size is unchanged\n\nOur API differs from textbook heap algorithms as follows:\n\n- We use 0-based indexing. This makes the relationship between the\n index for a node and the indexes for its children slightly less\n obvious, but is more suitable since Python uses 0-based indexing.\n\n- Our heappop() method returns the smallest item, not the largest.\n\nThese two make it possible to view the heap as a regular Python list\nwithout surprises: heap[0] is the smallest item, and heap.sort()\nmaintains the heap invariant!\n"""\n\n# Original code by Kevin O\'Connor, augmented by Tim Peters and Raymond Hettinger\n\n__about__ = """Heap queues\n\n[explanation by François Pinard]\n\nHeaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for\nall k, counting elements from 0. For the sake of comparison,\nnon-existing elements are considered to be infinite. The interesting\nproperty of a heap is that a[0] is always its smallest element.\n\nThe strange invariant above is meant to be an efficient memory\nrepresentation for a tournament. The numbers below are `k\', not a[k]:\n\n 0\n\n 1 2\n\n 3 4 5 6\n\n 7 8 9 10 11 12 13 14\n\n 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30\n\n\nIn the tree above, each cell `k\' is topping `2*k+1\' and `2*k+2\'. In\na usual binary tournament we see in sports, each cell is the winner\nover the two cells it tops, and we can trace the winner down the tree\nto see all opponents s/he had. However, in many computer applications\nof such tournaments, we do not need to trace the history of a winner.\nTo be more memory efficient, when a winner is promoted, we try to\nreplace it by something else at a lower level, and the rule becomes\nthat a cell and the two cells it tops contain three different items,\nbut the top cell "wins" over the two topped cells.\n\nIf this heap invariant is protected at all time, index 0 is clearly\nthe overall winner. The simplest algorithmic way to remove it and\nfind the "next" winner is to move some loser (let\'s say cell 30 in the\ndiagram above) into the 0 position, and then percolate this new 0 down\nthe tree, exchanging values, until the invariant is re-established.\nThis is clearly logarithmic on the total number of items in the tree.\nBy iterating over all items, you get an O(n ln n) sort.\n\nA nice feature of this sort is that you can efficiently insert new\nitems while the sort is going on, provided that the inserted items are\nnot "better" than the last 0\'th element you extracted. This is\nespecially useful in simulation contexts, where the tree holds all\nincoming events, and the "win" condition means the smallest scheduled\ntime. When an event schedule other events for execution, they are\nscheduled into the future, so they can easily go into the heap. So, a\nheap is a good structure for implementing schedulers (this is what I\nused for my MIDI sequencer :-).\n\nVarious structures for implementing schedulers have been extensively\nstudied, and heaps are good for this, as they are reasonably speedy,\nthe speed is almost constant, and the worst case is not much different\nthan the average case. However, there are other representations which\nare more efficient overall, yet the worst cases might be terrible.\n\nHeaps are also very useful in big disk sorts. You most probably all\nknow that a big sort implies producing "runs" (which are pre-sorted\nsequences, which size is usually related to the amount of CPU memory),\nfollowed by a merging passes for these runs, which merging is often\nvery cleverly organised[1]. It is very important that the initial\nsort produces the longest runs possible. Tournaments are a good way\nto that. If, using all the memory available to hold a tournament, you\nreplace and percolate items that happen to fit the current run, you\'ll\nproduce runs which are twice the size of the memory for random input,\nand much better for input fuzzily ordered.\n\nMoreover, if you output the 0\'th item on disk and get an input which\nmay not fit in the current tournament (because the value "wins" over\nthe last output value), it cannot fit in the heap, so the size of the\nheap decreases. The freed memory could be cleverly reused immediately\nfor progressively building a second heap, which grows at exactly the\nsame rate the first heap is melting. When the first heap completely\nvanishes, you switch heaps and start a new run. Clever and quite\neffective!\n\nIn a word, heaps are useful memory structures to know. I use them in\na few applications, and I think it is good to keep a `heap\' module\naround. :-)\n\n--------------------\n[1] The disk balancing algorithms which are current, nowadays, are\nmore annoying than clever, and this is a consequence of the seeking\ncapabilities of the disks. On devices which cannot seek, like big\ntape drives, the story was quite different, and one had to be very\nclever to ensure (far in advance) that each tape movement will be the\nmost effective possible (that is, will best participate at\n"progressing" the merge). Some tapes were even able to read\nbackwards, and this was also used to avoid the rewinding time.\nBelieve me, real good tape sorts were quite spectacular to watch!\nFrom all times, sorting has always been a Great Art! :-)\n"""\n\n__all__ = [\'heappush\', \'heappop\', \'heapify\', \'heapreplace\',\n \'nlargest\', \'nsmallest\', \'heappushpop\']\n\n\ndef heappush(heap, item):\n """Push item onto heap, maintaining the heap invariant."""\n heap.append(item)\n _siftdown(heap, 0, len(heap) - 1)\n\n\ndef heappop(heap):\n """Pop the smallest item off the heap, maintaining the heap invariant."""\n lastelt = heap.pop() # raises appropriate IndexError if heap is empty\n if heap:\n returnitem = heap[0]\n heap[0] = lastelt\n _siftup(heap, 0)\n return returnitem\n return lastelt\n\n\ndef heapreplace(heap, item):\n """Pop and return the current smallest value, and add the new item.\n\n This is more efficient than heappop() followed by heappush(), and can be\n more appropriate when using a fixed-size heap. Note that the value\n returned may be larger than item! That constrains reasonable uses of\n this routine unless written as part of a conditional replacement:\n\n if item > heap[0]:\n item = heapreplace(heap, item)\n """\n returnitem = heap[0] # raises appropriate IndexError if heap is empty\n heap[0] = item\n _siftup(heap, 0)\n return returnitem\n\n\ndef heappushpop(heap, item):\n """Fast version of a heappush followed by a heappop."""\n if heap and heap[0] < item:\n item, heap[0] = heap[0], item\n _siftup(heap, 0)\n return item\n\n\ndef heapify(x):\n """Transform list into a heap, in-place, in O(len(x)) time."""\n n = len(x)\n # Transform bottom-up. The largest index there\'s any point to looking at\n # is the largest with a child index in-range, so must have 2*i + 1 < n,\n # or i < (n-1)/2. If n is even = 2*j, this is (2*j-1)/2 = j-1/2 so\n # j-1 is the largest, which is n//2 - 1. If n is odd = 2*j+1, this is\n # (2*j+1-1)/2 = j so j-1 is the largest, and that\'s again n//2-1.\n for i in reversed(range(n // 2)):\n _siftup(x, i)\n\n\ndef _heappop_max(heap):\n """Maxheap version of a heappop."""\n lastelt = heap.pop() # raises appropriate IndexError if heap is empty\n if heap:\n returnitem = heap[0]\n heap[0] = lastelt\n _siftup_max(heap, 0)\n return returnitem\n return lastelt\n\n\ndef _heapreplace_max(heap, item):\n """Maxheap version of a heappop followed by a heappush."""\n returnitem = heap[0] # raises appropriate IndexError if heap is empty\n heap[0] = item\n _siftup_max(heap, 0)\n return returnitem\n\n\ndef _heapify_max(x):\n """Transform list into a maxheap, in-place, in O(len(x)) time."""\n n = len(x)\n for i in reversed(range(n // 2)):\n _siftup_max(x, i)\n\n# \'heap\' is a heap at all indices >= startpos, except possibly for pos. pos\n# is the index of a leaf with a possibly out-of-order value. Restore the\n# heap invariant.\n\n\ndef _siftdown(heap, startpos, pos):\n newitem = heap[pos]\n # Follow the path to the root, moving parents down until finding a place\n # newitem fits.\n while pos > startpos:\n parentpos = (pos - 1) >> 1\n parent = heap[parentpos]\n if newitem < parent:\n heap[pos] = parent\n pos = parentpos\n continue\n break\n heap[pos] = newitem\n\n# The child indices of heap index pos are already heaps, and we want to make\n# a heap at index pos too. We do this by bubbling the smaller child of\n# pos up (and so on with that child\'s children, etc) until hitting a leaf,\n# then using _siftdown to move the oddball originally at index pos into place.\n#\n# We *could* break out of the loop as soon as we find a pos where newitem <=\n# both its children, but turns out that\'s not a good idea, and despite that\n# many books write the algorithm that way. During a heap pop, the last array\n# element is sifted in, and that tends to be large, so that comparing it\n# against values starting from the root usually doesn\'t pay (= usually doesn\'t\n# get us out of the loop early). See Knuth, Volume 3, where this is\n# explained and quantified in an exercise.\n#\n# Cutting the # of comparisons is important, since these routines have no\n# way to extract "the priority" from an array element, so that intelligence\n# is likely to be hiding in custom comparison methods, or in array elements\n# storing (priority, record) tuples. Comparisons are thus potentially\n# expensive.\n#\n# On random arrays of length 1000, making this change cut the number of\n# comparisons made by heapify() a little, and those made by exhaustive\n# heappop() a lot, in accord with theory. Here are typical results from 3\n# runs (3 just to demonstrate how small the variance is):\n#\n# Compares needed by heapify Compares needed by 1000 heappops\n# -------------------------- --------------------------------\n# 1837 cut to 1663 14996 cut to 8680\n# 1855 cut to 1659 14966 cut to 8678\n# 1847 cut to 1660 15024 cut to 8703\n#\n# Building the heap by using heappush() 1000 times instead required\n# 2198, 2148, and 2219 compares: heapify() is more efficient, when\n# you can use it.\n#\n# The total compares needed by list.sort() on the same lists were 8627,\n# 8627, and 8632 (this should be compared to the sum of heapify() and\n# heappop() compares): list.sort() is (unsurprisingly!) more efficient\n# for sorting.\n\n\ndef _siftup(heap, pos):\n endpos = len(heap)\n startpos = pos\n newitem = heap[pos]\n # Bubble up the smaller child until hitting a leaf.\n childpos = 2 * pos + 1 # leftmost child position\n while childpos < endpos:\n # Set childpos to index of smaller child.\n rightpos = childpos + 1\n if rightpos < endpos and not heap[childpos] < heap[rightpos]:\n childpos = rightpos\n # Move the smaller child up.\n heap[pos] = heap[childpos]\n pos = childpos\n childpos = 2 * pos + 1\n # The leaf at pos is empty now. Put newitem there, and bubble it up\n # to its final resting place (by sifting its parents down).\n heap[pos] = newitem\n _siftdown(heap, startpos, pos)\n\n\ndef _siftdown_max(heap, startpos, pos):\n \'Maxheap variant of _siftdown\'\n newitem = heap[pos]\n # Follow the path to the root, moving parents down until finding a place\n # newitem fits.\n while pos > startpos:\n parentpos = (pos - 1) >> 1\n parent = heap[parentpos]\n if parent < newitem:\n heap[pos] = parent\n pos = parentpos\n continue\n break\n heap[pos] = newitem\n\n\ndef _siftup_max(heap, pos):\n \'Maxheap variant of _siftup\'\n endpos = len(heap)\n startpos = pos\n newitem = heap[pos]\n # Bubble up the larger child until hitting a leaf.\n childpos = 2 * pos + 1 # leftmost child position\n while childpos < endpos:\n # Set childpos to index of larger child.\n rightpos = childpos + 1\n if rightpos < endpos and not heap[rightpos] < heap[childpos]:\n childpos = rightpos\n # Move the larger child up.\n heap[pos] = heap[childpos]\n pos = childpos\n childpos = 2 * pos + 1\n # The leaf at pos is empty now. Put newitem there, and bubble it up\n # to its final resting place (by sifting its parents down).\n heap[pos] = newitem\n _siftdown_max(heap, startpos, pos)\n\n\n# Algorithm notes for nlargest() and nsmallest()\n# ==============================================\n#\n# Make a single pass over the data while keeping the k most extreme values\n# in a heap. Memory consumption is limited to keeping k values in a list.\n#\n# Measured performance for random inputs:\n#\n# number of comparisons\n# n inputs k-extreme values (average of 5 trials) % more than min()\n# ------------- ---------------- --------------------- -----------------\n# 1,000 100 3,317 231.7%\n# 10,000 100 14,046 40.5%\n# 100,000 100 105,749 5.7%\n# 1,000,000 100 1,007,751 0.8%\n# 10,000,000 100 10,009,401 0.1%\n#\n# Theoretical number of comparisons for k smallest of n random inputs:\n#\n# Step Comparisons Action\n# ---- -------------------------- ---------------------------\n# 1 1.66 * k heapify the first k-inputs\n# 2 n - k compare remaining elements to top of heap\n# 3 k * (1 + lg2(k)) * ln(n/k) replace the topmost value on the heap\n# 4 k * lg2(k) - (k/2) final sort of the k most extreme values\n#\n# Combining and simplifying for a rough estimate gives:\n#\n# comparisons = n + k * (log(k, 2) * log(n/k) + log(k, 2) + log(n/k))\n#\n# Computing the number of comparisons for step 3:\n# -----------------------------------------------\n# * For the i-th new value from the iterable, the probability of being in the\n# k most extreme values is k/i. For example, the probability of the 101st\n# value seen being in the 100 most extreme values is 100/101.\n# * If the value is a new extreme value, the cost of inserting it into the\n# heap is 1 + log(k, 2).\n# * The probability times the cost gives:\n# (k/i) * (1 + log(k, 2))\n# * Summing across the remaining n-k elements gives:\n# sum((k/i) * (1 + log(k, 2)) for i in range(k+1, n+1))\n# * This reduces to:\n# (H(n) - H(k)) * k * (1 + log(k, 2))\n# * Where H(n) is the n-th harmonic number estimated by:\n# gamma = 0.5772156649\n# H(n) = log(n, e) + gamma + 1 / (2 * n)\n# http://en.wikipedia.org/wiki/Harmonic_series_(mathematics)#Rate_of_divergence\n# * Substituting the H(n) formula:\n# comparisons = k * (1 + log(k, 2)) * (log(n/k, e) + (1/n - 1/k) / 2)\n#\n# Worst-case for step 3:\n# ----------------------\n# In the worst case, the input data is reversed sorted so that every new element\n# must be inserted in the heap:\n#\n# comparisons = 1.66 * k + log(k, 2) * (n - k)\n#\n# Alternative Algorithms\n# ----------------------\n# Other algorithms were not used because they:\n# 1) Took much more auxiliary memory,\n# 2) Made multiple passes over the data.\n# 3) Made more comparisons in common cases (small k, large n, semi-random input).\n# See the more detailed comparison of approach at:\n# http://code.activestate.com/recipes/577573-compare-algorithms-for-heapqsmallest\n\ndef nsmallest(n, iterable, key=None):\n """Find the n smallest elements in a dataset.\n\n Equivalent to: sorted(iterable, key=key)[:n]\n """\n\n # Short-cut for n==1 is to use min()\n if n == 1:\n it = iter(iterable)\n sentinel = object()\n result = min(it, default=sentinel, key=key)\n return [] if result is sentinel else [result]\n\n # When n>=size, it\'s faster to use sorted()\n try:\n size = len(iterable)\n except (TypeError, AttributeError):\n pass\n else:\n if n >= size:\n return sorted(iterable, key=key)[:n]\n\n # When key is none, use simpler decoration\n if key is None:\n it = iter(iterable)\n # put the range(n) first so that zip() doesn\'t\n # consume one too many elements from the iterator\n result = [(elem, i) for i, elem in zip(range(n), it)]\n if not result:\n return result\n _heapify_max(result)\n top = result[0][0]\n order = n\n _heapreplace = _heapreplace_max\n for elem in it:\n if elem < top:\n _heapreplace(result, (elem, order))\n top, _order = result[0]\n order += 1\n result.sort()\n return [elem for (elem, order) in result]\n\n # General case, slowest method\n it = iter(iterable)\n result = [(key(elem), i, elem) for i, elem in zip(range(n), it)]\n if not result:\n return result\n _heapify_max(result)\n top = result[0][0]\n order = n\n _heapreplace = _heapreplace_max\n for elem in it:\n k = key(elem)\n if k < top:\n _heapreplace(result, (k, order, elem))\n top, _order, _elem = result[0]\n order += 1\n result.sort()\n return [elem for (k, order, elem) in result]\n\n\ndef nlargest(n, iterable, key=None):\n """Find the n largest elements in a dataset.\n\n Equivalent to: sorted(iterable, key=key, reverse=True)[:n]\n """\n\n # Short-cut for n==1 is to use max()\n if n == 1:\n it = iter(iterable)\n sentinel = object()\n result = max(it, default=sentinel, key=key)\n return [] if result is sentinel else [result]\n\n # When n>=size, it\'s faster to use sorted()\n try:\n size = len(iterable)\n except (TypeError, AttributeError):\n pass\n else:\n if n >= size:\n return sorted(iterable, key=key, reverse=True)[:n]\n\n # When key is none, use simpler decoration\n if key is None:\n it = iter(iterable)\n result = [(elem, i) for i, elem in zip(range(0, -n, -1), it)]\n if not result:\n return result\n heapify(result)\n top = result[0][0]\n order = -n\n _heapreplace = heapreplace\n for elem in it:\n if top < elem:\n _heapreplace(result, (elem, order))\n top, _order = result[0]\n order -= 1\n result.sort(reverse=True)\n return [elem for (elem, order) in result]\n\n # General case, slowest method\n it = iter(iterable)\n result = [(key(elem), i, elem) for i, elem in zip(range(0, -n, -1), it)]\n if not result:\n return result\n heapify(result)\n top = result[0][0]\n order = -n\n _heapreplace = heapreplace\n for elem in it:\n k = key(elem)\n if top < k:\n _heapreplace(result, (k, order, elem))\n top, _order, _elem = result[0]\n order -= 1\n result.sort(reverse=True)\n return [elem for (k, order, elem) in result]\n\n\n# If available, use C implementation\ntry:\n from _heapq import *\nexcept ImportError:\n pass\ntry:\n from _heapq import _heapreplace_max\nexcept ImportError:\n pass\ntry:\n from _heapq import _heapify_max\nexcept ImportError:\n pass\ntry:\n from _heapq import _heappop_max\nexcept ImportError:\n pass\n\n\nif __name__ == "__main__":\n\n import doctest # pragma: no cover\n print(doctest.testmod()) # pragma: no cover\n',"src/lib/hmac.py":'import _sk_fail; _sk_fail._("hmac")\n',"src/lib/hotshot/__init__.py":'import _sk_fail; _sk_fail._("hotshot")\n',"src/lib/htmlentitydefs.py":'import _sk_fail; _sk_fail._("htmlentitydefs")\n',"src/lib/htmllib.py":'import _sk_fail; _sk_fail._("htmllib")\n',"src/lib/httplib.py":'import _sk_fail; _sk_fail._("httplib")\n',"src/lib/idlelib/Icons/__init__.py":'import _sk_fail; _sk_fail._("Icons")\n',"src/lib/idlelib/__init__.py":'import _sk_fail; _sk_fail._("idlelib")\n',"src/lib/ihooks.py":'import _sk_fail; _sk_fail._("ihooks")\n',"src/lib/imaplib.py":'import _sk_fail; _sk_fail._("imaplib")\n',"src/lib/imghdr.py":'import _sk_fail; _sk_fail._("imghdr")\n',"src/lib/imputil.py":'import _sk_fail; _sk_fail._("imputil")\n',"src/lib/io.py":'import _sk_fail; _sk_fail._("io")\n',"src/lib/lib-dynload/__init__.py":'import _sk_fail; _sk_fail._("lib-dynload")\n',"src/lib/lib-tk/__init__.py":'import _sk_fail; _sk_fail._("lib-tk")\n',"src/lib/lib2to3/__init__.py":'import _sk_fail; _sk_fail._("lib2to3")\n',"src/lib/lib2to3/fixes/__init__.py":'import _sk_fail; _sk_fail._("fixes")\n',"src/lib/lib2to3/pgen2/__init__.py":'import _sk_fail; _sk_fail._("pgen2")\n',"src/lib/lib2to3/tests/__init__.py":'import _sk_fail; _sk_fail._("tests")\n',"src/lib/linecache.py":'import _sk_fail; _sk_fail._("linecache")\n',"src/lib/locale.py":'import _sk_fail; _sk_fail._("locale")\n',"src/lib/logging/__init__.py":'# Minimal implementation original from CPython 3.9 source code\n\nimport sys, time, re\n\n\n__all__ = [\n "BASIC_FORMAT",\n "BufferingFormatter",\n "CRITICAL",\n "DEBUG",\n "ERROR",\n "FATAL",\n "FileHandler",\n "Filter",\n "Formatter",\n "Handler",\n "INFO",\n "LogRecord",\n "Logger",\n "LoggerAdapter",\n "NOTSET",\n "NullHandler",\n "StreamHandler",\n "WARN",\n "WARNING",\n "addLevelName",\n "basicConfig",\n "captureWarnings",\n "critical",\n "debug",\n "disable",\n "error",\n "exception",\n "fatal",\n "getLevelName",\n "getLogger",\n "getLoggerClass",\n "info",\n "log",\n "makeLogRecord",\n "setLoggerClass",\n "shutdown",\n "warning",\n "getLogRecordFactory",\n "setLogRecordFactory",\n "lastResort",\n "raiseExceptions",\n]\n\n\n_startTime = time.time()\nraiseExceptions = False\nlogThreads = False\nlogMultiprocessing = False\nlogProcesses = False\nlogAsyncioTasks = False\n\n# ---------------------------------------------------------------------------\n# Level related stuff\n# ---------------------------------------------------------------------------\n\nCRITICAL = 50\nFATAL = CRITICAL\nERROR = 40\nWARNING = 30\nWARN = WARNING\nINFO = 20\nDEBUG = 10\nNOTSET = 0\n\n_levelToName = {\n CRITICAL: "CRITICAL",\n ERROR: "ERROR",\n WARNING: "WARNING",\n INFO: "INFO",\n DEBUG: "DEBUG",\n NOTSET: "NOTSET",\n}\n_nameToLevel = {\n "CRITICAL": CRITICAL,\n "FATAL": FATAL,\n "ERROR": ERROR,\n "WARN": WARNING,\n "WARNING": WARNING,\n "INFO": INFO,\n "DEBUG": DEBUG,\n "NOTSET": NOTSET,\n}\n\n\ndef getLevelName(level):\n result = _levelToName.get(level)\n if result is not None:\n return result\n result = _nameToLevel.get(level)\n if result is not None:\n return result\n return "Level %s" % level\n\n\ndef addLevelName(level, levelName):\n _levelToName[level] = levelName\n _nameToLevel[levelName] = level\n\n\ndef _checkLevel(level):\n if isinstance(level, int):\n rv = level\n elif str(level) == level:\n if level not in _nameToLevel:\n raise ValueError("Unknown level: %r" % level)\n rv = _nameToLevel[level]\n else:\n raise TypeError("Level not an integer or a valid string: %r" % level)\n return rv\n\n\nclass _FakeRlock(object):\n def __enter__(self):\n pass\n\n def __exit__(self, exc_type, exc_value, traceback):\n pass\n\n\n_lock = _FakeRlock()\n\n# ---------------------------------------------------------------------------\n# The logging record\n# ---------------------------------------------------------------------------\n\n\nclass LogRecord(object):\n def __init__(\n self,\n name,\n level,\n pathname,\n lineno,\n msg,\n args,\n exc_info,\n func=None,\n sinfo=None,\n **kwargs,\n ):\n ct = time.time()\n self.name = name\n self.msg = msg\n if args and len(args) == 1 and isinstance(args[0], dict) and args[0]:\n args = args[0]\n self.args = args\n self.levelname = getLevelName(level)\n self.levelno = level\n self.pathname = pathname\n self.filename = pathname\n self.module = "Unknown module"\n self.exc_info = exc_info\n self.exc_text = None # used to cache the traceback text\n self.stack_info = sinfo\n self.lineno = lineno\n self.funcName = func\n self.created = ct\n self.msecs = int((ct - int(ct)) * 1000) + 0.0 # see gh-89047\n self.relativeCreated = (self.created - _startTime) * 1000\n self.thread = None\n self.threadName = None\n self.processName = None\n self.process = None\n self.taskName = None\n\n def __repr__(self):\n return \'\' % (\n self.name,\n self.levelno,\n self.pathname,\n self.lineno,\n self.msg,\n )\n\n def getMessage(self):\n msg = str(self.msg)\n if self.args:\n msg = msg % self.args\n return msg\n\n\n#\n# Determine which class to use when instantiating log records.\n#\n_logRecordFactory = LogRecord\n\n\ndef setLogRecordFactory(factory):\n global _logRecordFactory\n _logRecordFactory = factory\n\n\ndef getLogRecordFactory():\n return _logRecordFactory\n\n\ndef makeLogRecord(dict):\n rv = _logRecordFactory(None, None, "", 0, "", (), None, None)\n rv.__dict__.update(dict)\n return rv\n\n\n# ---------------------------------------------------------------------------\n# Formatter classes and functions\n# ---------------------------------------------------------------------------\nclass PercentStyle(object):\n default_format = "%(message)s"\n asctime_format = "%(asctime)s"\n asctime_search = "%(asctime)"\n validation_pattern = re.compile(\n r"%\\(\\w+\\)[#0+ -]*(\\*|\\d+)?(\\.(\\*|\\d+))?[diouxefgcrsa%]", re.I\n )\n\n def __init__(self, fmt, *, defaults=None):\n self._fmt = fmt or self.default_format\n self._defaults = defaults\n\n def usesTime(self):\n return self._fmt.find(self.asctime_search) >= 0\n\n def validate(self):\n if not self.validation_pattern.search(self._fmt):\n raise ValueError(\n "Invalid format \'%s\' for \'%s\' style"\n % (self._fmt, self.default_format[0])\n )\n\n def _format(self, record):\n defaults = self._defaults\n if defaults:\n values = defaults | record.__dict__\n else:\n values = record.__dict__\n return self._fmt % values\n\n def format(self, record):\n try:\n return self._format(record)\n except KeyError as e:\n raise ValueError("Formatting field not found in record: %s" % e)\n\n\nclass StrFormatStyle(PercentStyle):\n default_format = "{message}"\n asctime_format = "{asctime}"\n asctime_search = "{asctime"\n\n fmt_spec = re.compile(\n r"^(.?[<>=^])?[+ -]?#?0?(\\d+|{\\w+})?[,_]?(\\.(\\d+|{\\w+}))?[bcdefgnosx%]?$", re.I\n )\n field_spec = re.compile(r"^(\\d+|\\w+)(\\.\\w+|\\[[^]]+\\])*$")\n\n def _format(self, record):\n defaults = self._defaults\n if defaults:\n values = defaults | record.__dict__\n else:\n values = record.__dict__\n return self._fmt.format(**values)\n\n def validate(self):\n """Validate the input format, ensure it is the correct string formatting style"""\n return # TODO - _str_formatter.parse is not a thing - just assume it\'s valid\n fields = set()\n try:\n for _, fieldname, spec, conversion in _str_formatter.parse(self._fmt):\n if fieldname:\n if not self.field_spec.match(fieldname):\n raise ValueError(\n "invalid field name/expression: %r" % fieldname\n )\n fields.add(fieldname)\n if conversion and conversion not in "rsa":\n raise ValueError("invalid conversion: %r" % conversion)\n if spec and not self.fmt_spec.match(spec):\n raise ValueError("bad specifier: %r" % spec)\n except ValueError as e:\n raise ValueError("invalid format: %s" % e)\n if not fields:\n raise ValueError("invalid format: no fields")\n\n\nclass StringTemplateStyle(PercentStyle):\n default_format = "${message}"\n asctime_format = "${asctime}"\n asctime_search = "${asctime}"\n\n def __init__(self, fmt, *, defaults=None):\n raise NotImplementedError("StringTemplateStyle is not implemented")\n\n\nBASIC_FORMAT = "%(levelname)s:%(name)s:%(message)s"\n\n_STYLES = {\n "%": (PercentStyle, BASIC_FORMAT),\n "{": (StrFormatStyle, "{levelname}:{name}:{message}"),\n "$": (StringTemplateStyle, "${levelname}:${name}:${message}"),\n}\n\n\nclass Formatter(object):\n def converter(self, x):\n return time.localtime(x)\n\n def __init__(self, fmt=None, datefmt=None, style=\'%\', validate=True, *,\n defaults=None):\n if style not in _STYLES:\n raise ValueError("Style must be one of: %s" % ",".join(_STYLES.keys()))\n self._style = _STYLES[style][0](fmt, defaults=defaults)\n if validate:\n self._style.validate()\n\n self._fmt = self._style._fmt\n self.datefmt = datefmt\n\n default_time_format = "%Y-%m-%d %H:%M:%S"\n default_msec_format = "%s,%03d"\n\n def formatTime(self, record, datefmt=None):\n ct = self.converter(record.created)\n if datefmt:\n s = time.strftime(datefmt, ct)\n else:\n s = time.strftime(self.default_time_format, ct)\n if self.default_msec_format:\n s = self.default_msec_format % (s, record.msecs)\n return s\n\n def formatException(self, ei):\n raise NotImplementedError("formatException is not implemented")\n\n def usesTime(self):\n return self._style.usesTime()\n\n def formatMessage(self, record):\n return self._style.format(record)\n\n def formatStack(self, stack_info):\n return stack_info\n\n def format(self, record):\n record.message = record.getMessage()\n if self.usesTime():\n record.asctime = self.formatTime(record, self.datefmt)\n s = self.formatMessage(record)\n if record.exc_info:\n # Cache the traceback text to avoid converting it multiple times\n # (it\'s constant anyway)\n if not record.exc_text:\n record.exc_text = self.formatException(record.exc_info)\n if record.exc_text:\n if s[-1:] != "\\n":\n s = s + "\\n"\n s = s + record.exc_text\n if record.stack_info:\n if s[-1:] != "\\n":\n s = s + "\\n"\n s = s + self.formatStack(record.stack_info)\n return s\n\n\n#\n# The default formatter to use when no other is specified\n#\n_defaultFormatter = Formatter()\n\n\nclass BufferingFormatter(object):\n def __init__(self, linefmt=None):\n if linefmt:\n self.linefmt = linefmt\n else:\n self.linefmt = _defaultFormatter\n\n def formatHeader(self, records):\n return ""\n\n def formatFooter(self, records):\n return ""\n\n def format(self, records):\n rv = ""\n if len(records) > 0:\n rv = rv + self.formatHeader(records)\n for record in records:\n rv = rv + self.linefmt.format(record)\n rv = rv + self.formatFooter(records)\n return rv\n\n\n# ---------------------------------------------------------------------------\n# Filter classes and functions\n# ---------------------------------------------------------------------------\n\n\nclass Filter(object):\n def __init__(self, name=""):\n self.name = name\n self.nlen = len(name)\n\n def filter(self, record):\n if self.nlen == 0:\n return True\n elif self.name == record.name:\n return True\n elif record.name.find(self.name, 0, self.nlen) != 0:\n return False\n return record.name[self.nlen] == "."\n\n\nclass Filterer(object):\n def __init__(self):\n self.filters = []\n\n def addFilter(self, filter):\n if filter not in self.filters:\n self.filters.append(filter)\n\n def removeFilter(self, filter):\n if filter in self.filters:\n self.filters.remove(filter)\n\n def filter(self, record):\n for f in self.filters:\n if hasattr(f, "filter"):\n result = f.filter(record)\n else:\n result = f(record) # assume callable - will raise if not\n if not result:\n return False\n if isinstance(result, LogRecord):\n record = result\n return record\n\n\n# ---------------------------------------------------------------------------\n# Handler classes and functions\n# ---------------------------------------------------------------------------\n\n# _handlers = weakref.WeakValueDictionary() # map of handler names to handlers\n_handlers = {} # map of handler names to handlers\n\n\nclass Handler(Filterer):\n def __init__(self, level=NOTSET):\n Filterer.__init__(self)\n self._name = None\n self.level = _checkLevel(level)\n self.formatter = None\n self._closed = False\n\n def get_name(self):\n return self._name\n\n def set_name(self, name):\n if self._name in _handlers:\n del _handlers[self._name]\n self._name = name\n if name:\n _handlers[name] = self\n\n name = property(get_name, set_name)\n\n def setLevel(self, level):\n self.level = _checkLevel(level)\n\n def format(self, record):\n if self.formatter:\n fmt = self.formatter\n else:\n fmt = _defaultFormatter\n return fmt.format(record)\n\n def emit(self, record):\n raise NotImplementedError("emit must be implemented " "by Handler subclasses")\n\n def handle(self, record):\n rv = self.filter(record)\n if isinstance(rv, LogRecord):\n record = rv\n if rv:\n self.emit(record)\n return rv\n\n def setFormatter(self, fmt):\n self.formatter = fmt\n\n def flush(self):\n pass\n\n def close(self):\n self._closed = True\n if self._name and self._name in _handlers:\n del _handlers[self._name]\n\n def handleError(self, record):\n pass\n\n def __repr__(self):\n level = getLevelName(self.level)\n return "<%s (%s)>" % (self.__class__.__name__, level)\n\n\nclass StreamHandler(Handler):\n terminator = "\\n"\n\n def __init__(self, stream=None):\n Handler.__init__(self)\n if stream is None:\n stream = sys.stderr\n self.stream = stream\n\n def flush(self):\n if self.stream and hasattr(self.stream, "flush"):\n self.stream.flush()\n\n def emit(self, record):\n try:\n msg = self.format(record)\n stream = self.stream\n stream.write(msg + self.terminator)\n self.flush()\n except RecursionError: # See issue 36272\n raise\n except Exception:\n raise # TODO - we can\'t really handle errors so just raise them\n self.handleError(record)\n\n def setStream(self, stream):\n if stream is self.stream:\n result = None\n else:\n result = self.stream\n self.flush()\n self.stream = stream\n return result\n\n def __repr__(self):\n level = getLevelName(self.level)\n name = getattr(self.stream, "name", "")\n # bpo-36015: name can be an int\n name = str(name)\n if name:\n name += " "\n return "<%s %s(%s)>" % (self.__class__.__name__, name, level)\n\n\nclass FileHandler(StreamHandler):\n def __init__(self, filename, mode="a", encoding=None, delay=False, errors=None):\n raise NotImplementedError("FileHandler is not implemented")\n\n\nclass _StderrHandler(StreamHandler):\n def __init__(self, level=NOTSET):\n Handler.__init__(self, level)\n\n @property\n def stream(self):\n return sys.stderr\n\n\n_defaultLastResort = _StderrHandler(WARNING)\nlastResort = _defaultLastResort\n\n# ---------------------------------------------------------------------------\n# Manager classes and functions\n# ---------------------------------------------------------------------------\n\n\nclass PlaceHolder(object):\n def __init__(self, alogger):\n self.loggerMap = {alogger: None}\n\n def append(self, alogger):\n if alogger not in self.loggerMap:\n self.loggerMap[alogger] = None\n\n\ndef setLoggerClass(klass):\n if klass != Logger:\n if not issubclass(klass, Logger):\n raise TypeError("logger not derived from logging.Logger: " + klass.__name__)\n global _loggerClass\n _loggerClass = klass\n\n\ndef getLoggerClass():\n return _loggerClass\n\n\nclass Manager(object):\n def __init__(self, rootnode):\n self.root = rootnode\n self.disable = 0\n self.emittedNoHandlerWarning = False\n self.loggerDict = {}\n self.loggerClass = None\n self.logRecordFactory = None\n\n @property\n def disable(self):\n return self._disable\n\n @disable.setter\n def disable(self, value):\n self._disable = _checkLevel(value)\n\n def getLogger(self, name):\n rv = None\n if not isinstance(name, str):\n raise TypeError("A logger name must be a string")\n if name in self.loggerDict:\n rv = self.loggerDict[name]\n if isinstance(rv, PlaceHolder):\n ph = rv\n rv = (self.loggerClass or _loggerClass)(name)\n rv.manager = self\n self.loggerDict[name] = rv\n self._fixupChildren(ph, rv)\n self._fixupParents(rv)\n else:\n rv = (self.loggerClass or _loggerClass)(name)\n rv.manager = self\n self.loggerDict[name] = rv\n self._fixupParents(rv)\n return rv\n\n def setLoggerClass(self, klass):\n if klass != Logger:\n if not issubclass(klass, Logger):\n raise TypeError(\n "logger not derived from logging.Logger: " + klass.__name__\n )\n self.loggerClass = klass\n\n def setLogRecordFactory(self, factory):\n self.logRecordFactory = factory\n\n def _fixupParents(self, alogger):\n name = alogger.name\n i = name.rfind(".")\n rv = None\n while (i > 0) and not rv:\n substr = name[:i]\n if substr not in self.loggerDict:\n self.loggerDict[substr] = PlaceHolder(alogger)\n else:\n obj = self.loggerDict[substr]\n if isinstance(obj, Logger):\n rv = obj\n else:\n assert isinstance(obj, PlaceHolder)\n obj.append(alogger)\n i = name.rfind(".", 0, i - 1)\n if not rv:\n rv = self.root\n alogger.parent = rv\n\n def _fixupChildren(self, ph, alogger):\n name = alogger.name\n namelen = len(name)\n for c in ph.loggerMap.keys():\n # The if means ... if not c.parent.name.startswith(nm)\n if c.parent.name[:namelen] != name:\n alogger.parent = c.parent\n c.parent = alogger\n\n def _clear_cache(self):\n for logger in self.loggerDict.values():\n if isinstance(logger, Logger):\n logger._cache.clear()\n self.root._cache.clear()\n\n\n# ---------------------------------------------------------------------------\n# Logger classes and functions\n# ---------------------------------------------------------------------------\n\n\nclass Logger(Filterer):\n def __init__(self, name, level=NOTSET):\n Filterer.__init__(self)\n self.name = name\n self.level = _checkLevel(level)\n self.parent = None\n self.propagate = True\n self.handlers = []\n self.disabled = False\n self._cache = {}\n\n def setLevel(self, level):\n self.level = _checkLevel(level)\n self.manager._clear_cache()\n\n def debug(self, msg, *args, **kwargs):\n if self.isEnabledFor(DEBUG):\n self._log(DEBUG, msg, args, **kwargs)\n\n def info(self, msg, *args, **kwargs):\n if self.isEnabledFor(INFO):\n self._log(INFO, msg, args, **kwargs)\n\n def warning(self, msg, *args, **kwargs):\n if self.isEnabledFor(WARNING):\n self._log(WARNING, msg, args, **kwargs)\n\n def error(self, msg, *args, **kwargs):\n if self.isEnabledFor(ERROR):\n self._log(ERROR, msg, args, **kwargs)\n\n def exception(self, msg, *args, exc_info=True, **kwargs):\n self.error(msg, *args, exc_info=exc_info, **kwargs)\n\n def critical(self, msg, *args, **kwargs):\n if self.isEnabledFor(CRITICAL):\n self._log(CRITICAL, msg, args, **kwargs)\n\n fatal = critical\n\n def log(self, level, msg, *args, **kwargs):\n if not isinstance(level, int):\n if raiseExceptions:\n raise TypeError("level must be an integer")\n else:\n return\n if self.isEnabledFor(level):\n self._log(level, msg, args, **kwargs)\n\n def findCaller(self, stack_info=False, stacklevel=1):\n rv = "(unknown file)", 0, "(unknown function)", None\n return rv\n\n def makeRecord(\n self,\n name,\n level,\n fn,\n lno,\n msg,\n args,\n exc_info,\n func=None,\n extra=None,\n sinfo=None,\n ):\n rv = _logRecordFactory(name, level, fn, lno, msg, args, exc_info, func, sinfo)\n if extra is not None:\n for key in extra:\n if (key in ["message", "asctime"]) or (key in rv.__dict__):\n raise KeyError("Attempt to overwrite %r in LogRecord" % key)\n rv.__dict__[key] = extra[key]\n return rv\n\n def _log(\n self,\n level,\n msg,\n args,\n exc_info=None,\n extra=None,\n stack_info=False,\n stacklevel=1,\n ):\n sinfo = None\n fn, lno, func = "(unknown file)", 0, "(unknown function)"\n if exc_info:\n if isinstance(exc_info, BaseException):\n exc_info = (type(exc_info), exc_info, exc_info.__traceback__)\n elif not isinstance(exc_info, tuple):\n exc_info = sys.exc_info()\n record = self.makeRecord(\n self.name, level, fn, lno, msg, args, exc_info, func, extra, sinfo\n )\n self.handle(record)\n\n def handle(self, record):\n if self.disabled:\n return\n maybe_record = self.filter(record)\n if not maybe_record:\n return\n if isinstance(maybe_record, LogRecord):\n record = maybe_record\n self.callHandlers(record)\n\n def addHandler(self, hdlr):\n if hdlr not in self.handlers:\n self.handlers.append(hdlr)\n\n def removeHandler(self, hdlr):\n if hdlr in self.handlers:\n self.handlers.remove(hdlr)\n\n def hasHandlers(self):\n c = self\n rv = False\n while c:\n if c.handlers:\n rv = True\n break\n if not c.propagate:\n break\n else:\n c = c.parent\n return rv\n\n def callHandlers(self, record):\n c = self\n found = 0\n while c:\n for hdlr in c.handlers:\n found = found + 1\n if record.levelno >= hdlr.level:\n hdlr.handle(record)\n if not c.propagate:\n c = None # break out\n else:\n c = c.parent\n if found == 0:\n if lastResort:\n if record.levelno >= lastResort.level:\n lastResort.handle(record)\n elif raiseExceptions and not self.manager.emittedNoHandlerWarning:\n sys.stderr.write(\n "No handlers could be found for logger" \' "%s"\\n\' % self.name\n )\n self.manager.emittedNoHandlerWarning = True\n\n def getEffectiveLevel(self):\n logger = self\n while logger:\n if logger.level:\n return logger.level\n logger = logger.parent\n return NOTSET\n\n def isEnabledFor(self, level):\n if self.disabled:\n return False\n\n try:\n return self._cache[level]\n except KeyError:\n if self.manager.disable >= level:\n is_enabled = self._cache[level] = False\n else:\n is_enabled = self._cache[level] = level >= self.getEffectiveLevel()\n return is_enabled\n\n def getChild(self, suffix):\n if self.root is not self:\n suffix = ".".join((self.name, suffix))\n return self.manager.getLogger(suffix)\n\n\n def getChildren(self):\n\n def _hierlevel(logger):\n if logger is logger.manager.root:\n return 0\n return 1 + logger.name.count(\'.\')\n\n d = self.manager.loggerDict\n return set(item for item in d.values()\n if isinstance(item, Logger) and item.parent is self and\n _hierlevel(item) == 1 + _hierlevel(item.parent))\n\n def __repr__(self):\n level = getLevelName(self.getEffectiveLevel())\n return "<%s %s (%s)>" % (self.__class__.__name__, self.name, level)\n\n\nclass RootLogger(Logger):\n def __init__(self, level):\n Logger.__init__(self, "root", level)\n\n\n_loggerClass = Logger\n\n\nclass LoggerAdapter(object):\n def __init__(self, logger, extra=None):\n self.logger = logger\n self.extra = extra\n\n def process(self, msg, kwargs):\n kwargs["extra"] = self.extra\n return msg, kwargs\n\n def debug(self, msg, *args, **kwargs):\n self.log(DEBUG, msg, *args, **kwargs)\n\n def info(self, msg, *args, **kwargs):\n self.log(INFO, msg, *args, **kwargs)\n\n def warning(self, msg, *args, **kwargs):\n self.log(WARNING, msg, *args, **kwargs)\n\n def error(self, msg, *args, **kwargs):\n self.log(ERROR, msg, *args, **kwargs)\n\n def exception(self, msg, *args, exc_info=True, **kwargs):\n self.log(ERROR, msg, *args, exc_info=exc_info, **kwargs)\n\n def critical(self, msg, *args, **kwargs):\n self.log(CRITICAL, msg, *args, **kwargs)\n\n def log(self, level, msg, *args, **kwargs):\n if self.isEnabledFor(level):\n msg, kwargs = self.process(msg, kwargs)\n self.logger.log(level, msg, *args, **kwargs)\n\n def isEnabledFor(self, level):\n return self.logger.isEnabledFor(level)\n\n def setLevel(self, level):\n self.logger.setLevel(level)\n\n def getEffectiveLevel(self):\n return self.logger.getEffectiveLevel()\n\n def hasHandlers(self):\n return self.logger.hasHandlers()\n\n def _log(self, level, msg, args, **kwargs):\n return self.logger._log(level, msg, args, **kwargs)\n\n @property\n def manager(self):\n return self.logger.manager\n\n @manager.setter\n def manager(self, value):\n self.logger.manager = value\n\n @property\n def name(self):\n return self.logger.name\n\n def __repr__(self):\n logger = self.logger\n level = getLevelName(logger.getEffectiveLevel())\n return "<%s %s (%s)>" % (self.__class__.__name__, logger.name, level)\n\n\nroot = RootLogger(WARNING)\nLogger.root = root\nLogger.manager = Manager(Logger.root)\n\n# ---------------------------------------------------------------------------\n# Configuration classes and functions\n# ---------------------------------------------------------------------------\n\n\ndef basicConfig(**kwargs):\n force = kwargs.pop("force", False)\n encoding = kwargs.pop("encoding", None)\n errors = kwargs.pop("errors", "backslashreplace")\n if force:\n for h in root.handlers[:]:\n root.removeHandler(h)\n h.close()\n if len(root.handlers) == 0:\n handlers = kwargs.pop("handlers", None)\n if handlers is None:\n if "stream" in kwargs and "filename" in kwargs:\n raise ValueError(\n "\'stream\' and \'filename\' should not be " "specified together"\n )\n else:\n if "stream" in kwargs or "filename" in kwargs:\n raise ValueError(\n "\'stream\' or \'filename\' should not be "\n "specified together with \'handlers\'"\n )\n if handlers is None:\n filename = kwargs.pop("filename", None)\n mode = kwargs.pop("filemode", "a")\n if filename:\n if "b" in mode:\n errors = None\n h = FileHandler(filename, mode, encoding=encoding, errors=errors)\n else:\n stream = kwargs.pop("stream", None)\n h = StreamHandler(stream)\n handlers = [h]\n dfs = kwargs.pop("datefmt", None)\n style = kwargs.pop("style", "%")\n if style not in _STYLES:\n raise ValueError("Style must be one of: %s" % ",".join(_STYLES.keys()))\n fs = kwargs.pop("format", _STYLES[style][1])\n fmt = Formatter(fs, dfs, style)\n for h in handlers:\n if h.formatter is None:\n h.setFormatter(fmt)\n root.addHandler(h)\n level = kwargs.pop("level", None)\n if level is not None:\n root.setLevel(level)\n if kwargs:\n keys = ", ".join(kwargs.keys())\n raise ValueError("Unrecognised argument(s): %s" % keys)\n\n\ndef getLogger(name=None):\n if not name or isinstance(name, str) and name == root.name:\n return root\n return Logger.manager.getLogger(name)\n\n\ndef critical(msg, *args, **kwargs):\n if len(root.handlers) == 0:\n basicConfig()\n root.critical(msg, *args, **kwargs)\n\n\nfatal = critical\n\n\ndef error(msg, *args, **kwargs):\n if len(root.handlers) == 0:\n basicConfig()\n root.error(msg, *args, **kwargs)\n\n\ndef exception(msg, *args, exc_info=True, **kwargs):\n error(msg, *args, exc_info=exc_info, **kwargs)\n\n\ndef warning(msg, *args, **kwargs):\n if len(root.handlers) == 0:\n basicConfig()\n root.warning(msg, *args, **kwargs)\n\n\ndef info(msg, *args, **kwargs):\n if len(root.handlers) == 0:\n basicConfig()\n root.info(msg, *args, **kwargs)\n\n\ndef debug(msg, *args, **kwargs):\n if len(root.handlers) == 0:\n basicConfig()\n root.debug(msg, *args, **kwargs)\n\n\ndef log(level, msg, *args, **kwargs):\n if len(root.handlers) == 0:\n basicConfig()\n root.log(level, msg, *args, **kwargs)\n\n\ndef disable(level=CRITICAL):\n root.manager.disable = level\n root.manager._clear_cache()\n\n\ndef shutdown(handlerList=[]):\n raise NotImplementedError("shutdown is not implemented")\n\n\nclass NullHandler(Handler):\n def handle(self, record):\n """Stub."""\n\n def emit(self, record):\n """Stub."""\n\n\ndef captureWarnings(capture):\n raise NotImplementedError("captureWarnings is not implemented")\n',"src/lib/macpath.py":'import _sk_fail; _sk_fail._("macpath")\n',"src/lib/macurl2path.py":'import _sk_fail; _sk_fail._("macurl2path")\n',"src/lib/mailbox.py":'import _sk_fail; _sk_fail._("mailbox")\n',"src/lib/mailcap.py":'import _sk_fail; _sk_fail._("mailcap")\n',"src/lib/markupbase.py":'import _sk_fail; _sk_fail._("markupbase")\n',"src/lib/md5.py":'import _sk_fail; _sk_fail._("md5")\n',"src/lib/mhlib.py":'import _sk_fail; _sk_fail._("mhlib")\n',"src/lib/mimetools.py":'import _sk_fail; _sk_fail._("mimetools")\n',"src/lib/mimetypes.py":'import _sk_fail; _sk_fail._("mimetypes")\n',"src/lib/mimify.py":'import _sk_fail; _sk_fail._("mimify")\n',"src/lib/modulefinder.py":'import _sk_fail; _sk_fail._("modulefinder")\n',"src/lib/multifile.py":'import _sk_fail; _sk_fail._("multifile")\n',"src/lib/multiprocessing/__init__.py":'import _sk_fail; _sk_fail._("multiprocessing")\n',"src/lib/multiprocessing/dummy/__init__.py":'import _sk_fail; _sk_fail._("dummy")\n',"src/lib/mutex.py":'import _sk_fail; _sk_fail._("mutex")\n',"src/lib/netrc.py":'import _sk_fail; _sk_fail._("netrc")\n',"src/lib/new.py":'import _sk_fail; _sk_fail._("new")\n',"src/lib/nntplib.py":'import _sk_fail; _sk_fail._("nntplib")\n',"src/lib/ntpath.py":'import _sk_fail; _sk_fail._("ntpath")\n',"src/lib/nturl2path.py":'import _sk_fail; _sk_fail._("nturl2path")\n',"src/lib/numbers.py":"Number = (int, float, complex)\nIntegral = int\nComplex = complex\n","src/lib/opcode.py":'import _sk_fail; _sk_fail._("opcode")\n',"src/lib/optparse.py":'import _sk_fail; _sk_fail._("optparse")\n',"src/lib/os.py":'import _sk_fail; _sk_fail._("os")\n',"src/lib/os2emxpath.py":'import _sk_fail; _sk_fail._("os2emxpath")\n',"src/lib/pdb.py":'import _sk_fail; _sk_fail._("pdb")\n',"src/lib/pickle.py":'import _sk_fail; _sk_fail._("pickle")\n',"src/lib/pickletools.py":'import _sk_fail; _sk_fail._("pickletools")\n',"src/lib/pipes.py":'import _sk_fail; _sk_fail._("pipes")\n',"src/lib/pkgutil.py":'import _sk_fail; _sk_fail._("pkgutil")\n',"src/lib/platform.py":'import _sk_fail; _sk_fail._("platform")\n',"src/lib/plistlib.py":'import _sk_fail; _sk_fail._("plistlib")\n',"src/lib/popen2.py":'import _sk_fail; _sk_fail._("popen2")\n',"src/lib/poplib.py":'import _sk_fail; _sk_fail._("poplib")\n',"src/lib/posixfile.py":'import _sk_fail; _sk_fail._("posixfile")\n',"src/lib/posixpath.py":'import _sk_fail; _sk_fail._("posixpath")\n',"src/lib/pprint.py":'import _sk_fail; _sk_fail._("pprint")\n',"src/lib/profile.py":'import _sk_fail; _sk_fail._("profile")\n',"src/lib/pstats.py":'import _sk_fail; _sk_fail._("pstats")\n',"src/lib/pty.py":'import _sk_fail; _sk_fail._("pty")\n',"src/lib/py_compile.py":'import _sk_fail; _sk_fail._("py_compile")\n',"src/lib/pyclbr.py":'import _sk_fail; _sk_fail._("pyclbr")\n',"src/lib/pydoc.py":'import _sk_fail; _sk_fail._("pydoc")\n',"src/lib/pydoc_topics.py":'import _sk_fail; _sk_fail._("pydoc_topics")\n',"src/lib/pythonds/__init__.py":"","src/lib/pythonds/basic/__init__.py":'\n#__all__ = ["stack"]\n\n\nfrom .stack import Stack\nfrom .queue import Queue\nfrom .deque import Deque\n\n\n',"src/lib/pythonds/basic/deque.py":"# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005\n#\n# deque.py\n\n\nclass Deque:\n def __init__(self):\n self.items = []\n\n def isEmpty(self):\n return self.items == []\n\n def addFront(self, item):\n self.items.append(item)\n\n def addRear(self, item):\n self.items.insert(0, item)\n\n def removeFront(self):\n return self.items.pop()\n\n def removeRear(self):\n return self.items.pop(0)\n\n def size(self):\n return len(self.items)\n","src/lib/pythonds/basic/queue.py":"# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005\n#\n# queue.py\n\n\nclass Queue:\n def __init__(self):\n self.items = []\n\n def isEmpty(self):\n return self.items == []\n\n def enqueue(self, item):\n self.items.insert(0, item)\n\n def dequeue(self):\n return self.items.pop()\n\n def size(self):\n return len(self.items)\n","src/lib/pythonds/basic/stack.py":"# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005\n#\n# stack.py\n\n\nclass Stack:\n def __init__(self):\n self.items = []\n\n def isEmpty(self):\n return self.items == []\n\n def push(self, item):\n self.items.append(item)\n\n def pop(self):\n return self.items.pop()\n\n def peek(self):\n return self.items[len(self.items) - 1]\n\n def size(self):\n return len(self.items)\n","src/lib/pythonds/graphs/__init__.py":"\n\nfrom .adjGraph import Graph\nfrom .adjGraph import Vertex\nfrom .priorityQueue import PriorityQueue\n","src/lib/pythonds/graphs/adjGraph.py":'#\n# adjGraph\n#\n# Created by Brad Miller on 2005-02-24.\n# Copyright (c) 2005 Brad Miller, David Ranum, Luther College. All rights reserved.\n#\n\nimport sys\nimport os\nimport unittest\n\nclass Graph:\n def __init__(self):\n self.vertices = {}\n self.numVertices = 0\n \n def addVertex(self,key):\n self.numVertices = self.numVertices + 1\n newVertex = Vertex(key)\n self.vertices[key] = newVertex\n return newVertex\n \n def getVertex(self,n):\n if n in self.vertices:\n return self.vertices[n]\n else:\n return None\n\n def __contains__(self,n):\n return n in self.vertices\n \n def addEdge(self,f,t,cost=0):\n if f not in self.vertices:\n nv = self.addVertex(f)\n if t not in self.vertices:\n nv = self.addVertex(t)\n self.vertices[f].addNeighbor(self.vertices[t],cost)\n \n def getVertices(self):\n return list(self.vertices.keys())\n \n def __iter__(self):\n return iter(self.vertices.values())\n \nclass Vertex:\n def __init__(self,num):\n self.id = num\n self.connectedTo = {}\n self.color = \'white\'\n self.dist = sys.maxsize\n self.pred = None\n self.disc = 0\n self.fin = 0\n\n # def __lt__(self,o):\n # return self.id < o.id\n \n def addNeighbor(self,nbr,weight=0):\n self.connectedTo[nbr] = weight\n \n def setColor(self,color):\n self.color = color\n \n def setDistance(self,d):\n self.dist = d\n\n def setPred(self,p):\n self.pred = p\n\n def setDiscovery(self,dtime):\n self.disc = dtime\n \n def setFinish(self,ftime):\n self.fin = ftime\n \n def getFinish(self):\n return self.fin\n \n def getDiscovery(self):\n return self.disc\n \n def getPred(self):\n return self.pred\n \n def getDistance(self):\n return self.dist\n \n def getColor(self):\n return self.color\n \n def getConnections(self):\n return self.connectedTo.keys()\n \n def getWeight(self,nbr):\n return self.connectedTo[nbr]\n \n def __str__(self):\n return str(self.id) + ":color " + self.color + ":disc " + str(self.disc) + ":fin " + str(self.fin) + ":dist " + str(self.dist) + ":pred \\n\\t[" + str(self.pred)+ "]\\n"\n \n def getId(self):\n return self.id\n\nclass adjGraphTests(unittest.TestCase):\n def setUp(self):\n self.tGraph = Graph()\n \n def testMakeGraph(self):\n gFile = open("test.dat")\n for line in gFile:\n fVertex, tVertex = line.split(\'|\')\n fVertex = int(fVertex)\n tVertex = int(tVertex)\n self.tGraph.addEdge(fVertex,tVertex)\n for i in self.tGraph:\n adj = i.getAdj()\n for k in adj:\n print(i, k)\n\n \nif __name__ == \'__main__\':\n unittest.main()\n \n',"src/lib/pythonds/graphs/priorityQueue.py":"# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005\n# \nimport unittest\n\n# this implementation of binary heap takes key value pairs,\n# we will assume that the keys are all comparable\n\nclass PriorityQueue:\n def __init__(self):\n self.heapArray = [(0,0)]\n self.currentSize = 0\n\n def buildHeap(self,alist):\n self.currentSize = len(alist)\n self.heapArray = [(0,0)]\n for i in alist:\n self.heapArray.append(i)\n i = len(alist) // 2 \n while (i > 0):\n self.percDown(i)\n i = i - 1\n \n def percDown(self,i):\n while (i * 2) <= self.currentSize:\n mc = self.minChild(i)\n if self.heapArray[i][0] > self.heapArray[mc][0]:\n tmp = self.heapArray[i]\n self.heapArray[i] = self.heapArray[mc]\n self.heapArray[mc] = tmp\n i = mc\n \n def minChild(self,i):\n if i*2 > self.currentSize:\n return -1\n else:\n if i*2 + 1 > self.currentSize:\n return i*2\n else:\n if self.heapArray[i*2][0] < self.heapArray[i*2+1][0]:\n return i*2\n else:\n return i*2+1\n\n def percUp(self,i):\n while i // 2 > 0:\n if self.heapArray[i][0] < self.heapArray[i//2][0]:\n tmp = self.heapArray[i//2]\n self.heapArray[i//2] = self.heapArray[i]\n self.heapArray[i] = tmp\n i = i//2\n \n def add(self,k):\n self.heapArray.append(k)\n self.currentSize = self.currentSize + 1\n self.percUp(self.currentSize)\n\n def delMin(self):\n retval = self.heapArray[1][1]\n self.heapArray[1] = self.heapArray[self.currentSize]\n self.currentSize = self.currentSize - 1\n self.heapArray.pop()\n self.percDown(1)\n return retval\n \n def isEmpty(self):\n if self.currentSize == 0:\n return True\n else:\n return False\n\n def decreaseKey(self,val,amt):\n # this is a little wierd, but we need to find the heap thing to decrease by\n # looking at its value\n done = False\n i = 1\n myKey = 0\n while not done and i <= self.currentSize:\n if self.heapArray[i][1] == val:\n done = True\n myKey = i\n else:\n i = i + 1\n if myKey > 0:\n self.heapArray[myKey] = (amt,self.heapArray[myKey][1])\n self.percUp(myKey)\n \n def __contains__(self,vtx):\n for pair in self.heapArray:\n if pair[1] == vtx:\n return True\n return False\n \nclass TestBinHeap(unittest.TestCase):\n def setUp(self):\n self.theHeap = PriorityQueue()\n self.theHeap.add((2,'x'))\n self.theHeap.add((3,'y'))\n self.theHeap.add((5,'z'))\n self.theHeap.add((6,'a'))\n self.theHeap.add((4,'d'))\n\n\n def testInsert(self):\n assert self.theHeap.currentSize == 5\n\n def testDelmin(self):\n assert self.theHeap.delMin() == 'x'\n assert self.theHeap.delMin() == 'y'\n \n def testDecKey(self):\n self.theHeap.decreaseKey('d',1)\n assert self.theHeap.delMin() == 'd'\n \nif __name__ == '__main__':\n unittest.main()\n","src/lib/pythonds/trees/__init__.py":"\nfrom .binaryTree import BinaryTree\nfrom .balance import AVLTree\nfrom .bst import BinarySearchTree\nfrom .binheap import BinHeap\n\n\n","src/lib/pythonds/trees/balance.py":"#!/bin/env python3.1\n# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005, 2010\n# \n\nfrom .bst import BinarySearchTree, TreeNode\n\nclass AVLTree(BinarySearchTree):\n '''\n Author: Brad Miller\n Date: 1/15/2005\n Description: Imlement a binary search tree with the following interface\n functions: \n __contains__(y) <==> y in x\n __getitem__(y) <==> x[y]\n __init__()\n __len__() <==> len(x)\n __setitem__(k,v) <==> x[k] = v\n clear()\n get(k)\n has_key(k)\n items() \n keys() \n values()\n put(k,v)\n '''\n\n\n def _put(self,key,val,currentNode):\n if key < currentNode.key:\n if currentNode.hasLeftChild():\n self._put(key,val,currentNode.leftChild)\n else:\n currentNode.leftChild = TreeNode(key,val,parent=currentNode)\n self.updateBalance(currentNode.leftChild)\n else:\n if currentNode.hasRightChild():\n self._put(key,val,currentNode.rightChild)\n else:\n currentNode.rightChild = TreeNode(key,val,parent=currentNode)\n self.updateBalance(currentNode.rightChild) \n\n def updateBalance(self,node):\n if node.balanceFactor > 1 or node.balanceFactor < -1:\n self.rebalance(node)\n return\n if node.parent != None:\n if node.isLeftChild():\n node.parent.balanceFactor += 1\n elif node.isRightChild():\n node.parent.balanceFactor -= 1\n\n if node.parent.balanceFactor != 0:\n self.updateBalance(node.parent)\n\n def rebalance(self,node):\n if node.balanceFactor < 0:\n if node.rightChild.balanceFactor > 0:\n # Do an LR Rotation\n self.rotateRight(node.rightChild)\n self.rotateLeft(node)\n else:\n # single left\n self.rotateLeft(node)\n elif node.balanceFactor > 0:\n if node.leftChild.balanceFactor < 0:\n # Do an RL Rotation\n self.rotateLeft(node.leftChild)\n self.rotateRight(node)\n else:\n # single right\n self.rotateRight(node)\n\n def rotateLeft(self,rotRoot):\n newRoot = rotRoot.rightChild\n rotRoot.rightChild = newRoot.leftChild\n if newRoot.leftChild != None:\n newRoot.leftChild.parent = rotRoot\n newRoot.parent = rotRoot.parent\n if rotRoot.isRoot():\n self.root = newRoot\n else:\n if rotRoot.isLeftChild():\n rotRoot.parent.leftChild = newRoot\n else:\n rotRoot.parent.rightChild = newRoot\n newRoot.leftChild = rotRoot\n rotRoot.parent = newRoot\n rotRoot.balanceFactor = rotRoot.balanceFactor + 1 - min(newRoot.balanceFactor, 0)\n newRoot.balanceFactor = newRoot.balanceFactor + 1 + max(rotRoot.balanceFactor, 0)\n\n\n def rotateRight(self,rotRoot):\n newRoot = rotRoot.leftChild\n rotRoot.leftChild = newRoot.rightChild\n if newRoot.rightChild != None:\n newRoot.rightChild.parent = rotRoot\n newRoot.parent = rotRoot.parent\n if rotRoot.isRoot():\n self.root = newRoot\n else:\n if rotRoot.isRightChild():\n rotRoot.parent.rightChild = newRoot\n else:\n rotRoot.parent.leftChild = newRoot\n newRoot.rightChild = rotRoot\n rotRoot.parent = newRoot\n rotRoot.balanceFactor = rotRoot.balanceFactor - 1 - max(newRoot.balanceFactor, 0)\n newRoot.balanceFactor = newRoot.balanceFactor - 1 + min(rotRoot.balanceFactor, 0)\n \n","src/lib/pythonds/trees/binaryTree.py":"# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005\n# \n\nclass BinaryTree:\n \"\"\"\n A recursive implementation of Binary Tree\n Using links and Nodes approach.\n \"\"\" \n def __init__(self,rootObj):\n self.key = rootObj\n self.leftChild = None\n self.rightChild = None\n\n def insertLeft(self,newNode):\n if self.leftChild == None:\n self.leftChild = BinaryTree(newNode)\n else:\n t = BinaryTree(newNode)\n t.left = self.leftChild\n self.leftChild = t\n \n def insertRight(self,newNode):\n if self.rightChild == None:\n self.rightChild = BinaryTree(newNode)\n else:\n t = BinaryTree(newNode)\n t.right = self.rightChild\n self.rightChild = t\n\n def isLeaf(self):\n return ((not self.leftChild) and (not self.rightChild))\n\n def getRightChild(self):\n return self.rightChild\n\n def getLeftChild(self):\n return self.leftChild\n\n def setRootVal(self,obj):\n self.key = obj\n\n def getRootVal(self,):\n return self.key\n\n def inorder(self):\n if self.leftChild:\n self.leftChild.inorder()\n print(self.key)\n if self.rightChild:\n self.rightChild.inorder()\n\n def postorder(self):\n if self.leftChild:\n self.leftChild.postorder()\n if self.rightChild:\n self.rightChild.postorder()\n print(self.key)\n\n\n def preorder(self):\n print(self.key)\n if self.leftChild:\n self.leftChild.preorder()\n if self.rightChild:\n self.rightChild.preorder()\n\n def printexp(self):\n if self.leftChild:\n print('(')\n self.leftChild.printexp()\n print(self.key)\n if self.rightChild:\n self.rightChild.printexp()\n print(')')\n\n def postordereval(self):\n opers = {'+':operator.add, '-':operator.sub, '*':operator.mul, '/':operator.truediv}\n res1 = None\n res2 = None\n if self.leftChild:\n res1 = self.leftChild.postordereval() #// \\label{peleft}\n if self.rightChild:\n res2 = self.rightChild.postordereval() #// \\label{peright}\n if res1 and res2:\n return opers[self.key](res1,res2) #// \\label{peeval}\n else:\n return self.key\n\ndef inorder(tree):\n if tree != None:\n inorder(tree.getLeftChild())\n print(tree.getRootVal())\n inorder(tree.getRightChild())\n\ndef printexp(tree):\n if tree.leftChild:\n print('(')\n printexp(tree.getLeftChild())\n print(tree.getRootVal())\n if tree.rightChild:\n printexp(tree.getRightChild())\n print(')') \n\ndef printexp(tree):\n sVal = \"\"\n if tree:\n sVal = '(' + printexp(tree.getLeftChild())\n sVal = sVal + str(tree.getRootVal())\n sVal = sVal + printexp(tree.getRightChild()) + ')'\n return sVal\n\ndef postordereval(tree):\n opers = {'+':operator.add, '-':operator.sub, '*':operator.mul, '/':operator.truediv}\n res1 = None\n res2 = None\n if tree:\n res1 = postordereval(tree.getLeftChild()) #// \\label{peleft}\n res2 = postordereval(tree.getRightChild()) #// \\label{peright}\n if res1 and res2:\n return opers[tree.getRootVal()](res1,res2) #// \\label{peeval}\n else:\n return tree.getRootVal()\n\ndef height(tree):\n if tree == None:\n return -1\n else:\n return 1 + max(height(tree.leftChild),height(tree.rightChild))\n\n# t = BinaryTree(7)\n# t.insertLeft(3)\n# t.insertRight(9)\n# inorder(t)\n# import operator\n# x = BinaryTree('*')\n# x.insertLeft('+')\n# l = x.getLeftChild()\n# l.insertLeft(4)\n# l.insertRight(5)\n# x.insertRight(7)\n# print(printexp(x))\n# print(postordereval(x))\n# print(height(x))\n","src/lib/pythonds/trees/binheap.py":"# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005\n# \n\n# this heap takes key value pairs, we will assume that the keys are integers\nclass BinHeap:\n def __init__(self):\n self.heapList = [0]\n self.currentSize = 0\n\n\n def buildHeap(self,alist):\n i = len(alist) // 2\n self.currentSize = len(alist)\n self.heapList = [0] + alist[:]\n print(len(self.heapList), i)\n while (i > 0):\n print(self.heapList, i)\n self.percDown(i)\n i = i - 1\n print(self.heapList,i)\n \n def percDown(self,i):\n while (i * 2) <= self.currentSize:\n mc = self.minChild(i)\n if self.heapList[i] > self.heapList[mc]:\n tmp = self.heapList[i]\n self.heapList[i] = self.heapList[mc]\n self.heapList[mc] = tmp\n i = mc\n \n def minChild(self,i):\n if i * 2 + 1 > self.currentSize:\n return i * 2\n else:\n if self.heapList[i * 2] < self.heapList[i * 2 + 1]:\n return i * 2\n else:\n return i * 2 + 1\n\n def percUp(self,i):\n while i // 2 > 0:\n if self.heapList[i] < self.heapList[i//2]:\n tmp = self.heapList[i // 2]\n self.heapList[i // 2] = self.heapList[i]\n self.heapList[i] = tmp\n i = i // 2\n \n def insert(self,k):\n self.heapList.append(k)\n self.currentSize = self.currentSize + 1\n self.percUp(self.currentSize)\n\n def delMin(self):\n retval = self.heapList[1]\n self.heapList[1] = self.heapList[self.currentSize]\n self.currentSize = self.currentSize - 1\n self.heapList.pop()\n self.percDown(1)\n return retval\n \n def isEmpty(self):\n if currentSize == 0:\n return True\n else:\n return False\n","src/lib/pythonds/trees/bst.py":"#!/bin/env python3.1\n# Bradley N. Miller, David L. Ranum\n# Introduction to Data Structures and Algorithms in Python\n# Copyright 2005, 2010\n# \n\nclass BinarySearchTree:\n '''\n Author: Brad Miller\n Date: 1/15/2005\n Description: Imlement a binary search tree with the following interface\n functions: \n __contains__(y) <==> y in x\n __getitem__(y) <==> x[y]\n __init__()\n __len__() <==> len(x)\n __setitem__(k,v) <==> x[k] = v\n clear()\n get(k)\n items() \n keys() \n values()\n put(k,v)\n in\n del <==> \n '''\n\n def __init__(self):\n self.root = None\n self.size = 0\n \n def put(self,key,val):\n if self.root:\n self._put(key,val,self.root)\n else:\n self.root = TreeNode(key,val)\n self.size = self.size + 1\n\n def _put(self,key,val,currentNode):\n if key < currentNode.key:\n if currentNode.hasLeftChild():\n self._put(key,val,currentNode.leftChild)\n else:\n currentNode.leftChild = TreeNode(key,val,parent=currentNode)\n else:\n if currentNode.hasRightChild():\n self._put(key,val,currentNode.rightChild)\n else:\n currentNode.rightChild = TreeNode(key,val,parent=currentNode)\n \n def __setitem__(self,k,v):\n self.put(k,v)\n\n def get(self,key):\n if self.root:\n res = self._get(key,self.root)\n if res:\n return res.payload\n else:\n return None\n else:\n return None\n \n def _get(self,key,currentNode):\n if not currentNode:\n return None\n elif currentNode.key == key:\n return currentNode\n elif key < currentNode.key:\n return self._get(key,currentNode.leftChild)\n else:\n return self._get(key,currentNode.rightChild)\n \n \n def __getitem__(self,key):\n res = self.get(key)\n if res:\n return res\n else:\n raise KeyError('Error, key not in tree')\n \n\n def __contains__(self,key):\n if self._get(key,self.root):\n return True\n else:\n return False\n \n def length(self):\n return self.size\n\n def __len__(self):\n return self.size\n\n def __iter__(self):\n return self.root.__iter__()\n \n def delete(self,key):\n if self.size > 1:\n nodeToRemove = self._get(key,self.root)\n if nodeToRemove:\n self.remove(nodeToRemove)\n self.size = self.size-1\n else:\n raise KeyError('Error, key not in tree')\n elif self.size == 1 and self.root.key == key:\n self.root = None\n self.size = self.size - 1\n else:\n raise KeyError('Error, key not in tree')\n\n def __delitem__(self,key):\n self.delete(key)\n \n def remove(self,currentNode):\n if currentNode.isLeaf(): #leaf\n if currentNode == currentNode.parent.leftChild:\n currentNode.parent.leftChild = None\n else:\n currentNode.parent.rightChild = None\n elif currentNode.hasBothChildren(): #interior\n succ = currentNode.findSuccessor()\n succ.spliceOut()\n currentNode.key = succ.key\n currentNode.payload = succ.payload\n else: # this node has one child\n if currentNode.hasLeftChild():\n if currentNode.isLeftChild():\n currentNode.leftChild.parent = currentNode.parent\n currentNode.parent.leftChild = currentNode.leftChild\n elif currentNode.isRightChild():\n currentNode.leftChild.parent = currentNode.parent\n currentNode.parent.rightChild = currentNode.leftChild\n else:\n currentNode.replaceNodeData(currentNode.leftChild.key,\n currentNode.leftChild.payload,\n currentNode.leftChild.leftChild,\n currentNode.leftChild.rightChild)\n else:\n if currentNode.isLeftChild():\n currentNode.rightChild.parent = currentNode.parent\n currentNode.parent.leftChild = currentNode.rightChild\n elif currentNode.isRightChild():\n currentNode.rightChild.parent = currentNode.parent\n currentNode.parent.rightChild = currentNode.rightChild\n else:\n currentNode.replaceNodeData(currentNode.rightChild.key,\n currentNode.rightChild.payload,\n currentNode.rightChild.leftChild,\n currentNode.rightChild.rightChild)\n\n def inorder(self):\n self._inorder(self.root)\n\n def _inorder(self,tree):\n if tree != None:\n self._inorder(tree.leftChild)\n print(tree.key)\n self._inorder(tree.rightChild)\n\n def postorder(self):\n self._postorder(self.root)\n\n def _postorder(self, tree):\n if tree:\n self._postorder(tree.rightChild)\n self._postorder(tree.leftChild)\n print(tree.key) \n\n def preorder(self):\n self._preorder(self,self.root)\n\n def _preorder(self,tree):\n if tree:\n print(tree.key) \n self._preorder(tree.leftChild)\n self._preorder(tree.rightChild)\n\n \nclass TreeNode:\n def __init__(self,key,val,left=None,right=None,parent=None):\n self.key = key\n self.payload = val\n self.leftChild = left\n self.rightChild = right\n self.parent = parent\n self.balanceFactor = 0\n \n def hasLeftChild(self):\n return self.leftChild\n\n def hasRightChild(self):\n return self.rightChild\n \n def isLeftChild(self):\n return self.parent and self.parent.leftChild == self\n\n def isRightChild(self):\n return self.parent and self.parent.rightChild == self\n\n def isRoot(self):\n return not self.parent\n\n def isLeaf(self):\n return not (self.rightChild or self.leftChild)\n\n def hasAnyChildren(self):\n return self.rightChild or self.leftChild\n\n def hasBothChildren(self):\n return self.rightChild and self.leftChild\n \n def replaceNodeData(self,key,value,lc,rc):\n self.key = key\n self.payload = value\n self.leftChild = lc\n self.rightChild = rc\n if self.hasLeftChild():\n self.leftChild.parent = self\n if self.hasRightChild():\n self.rightChild.parent = self\n \n def findSuccessor(self):\n succ = None\n if self.hasRightChild():\n succ = self.rightChild.findMin()\n else:\n if self.parent:\n if self.isLeftChild():\n succ = self.parent\n else:\n self.parent.rightChild = None\n succ = self.parent.findSuccessor()\n self.parent.rightChild = self\n return succ\n\n\n def spliceOut(self):\n if self.isLeaf():\n if self.isLeftChild():\n self.parent.leftChild = None\n else:\n self.parent.rightChild = None\n elif self.hasAnyChildren():\n if self.hasLeftChild():\n if self.isLeftChild():\n self.parent.leftChild = self.leftChild\n else:\n self.parent.rightChild = self.leftChild\n self.leftChild.parent = self.parent\n else:\n if self.isLeftChild():\n self.parent.leftChild = self.rightChild\n else:\n self.parent.rightChild = self.rightChild\n self.rightChild.parent = self.parent\n\n def findMin(self):\n current = self\n while current.hasLeftChild():\n current = current.leftChild\n return current\n\n def __iter__(self):\n \"\"\"The standard inorder traversal of a binary tree.\"\"\"\n if self:\n if self.hasLeftChild():\n for elem in self.leftChild:\n yield elem\n yield self.key\n if self.hasRightChild():\n for elem in self.rightChild:\n yield elem\n\n \n","src/lib/pythonds3/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3 import statement\n"""\n\nfrom pythonds3.basic import Stack, Queue, Deque\nfrom pythonds3.graphs import Graph, Vertex\nfrom pythonds3.searching import HashTable\nfrom pythonds3.trees import (\n BinaryTree,\n AVLTree,\n BinarySearchTree,\n BinaryHeap,\n PriorityQueue,\n)\n\n__all__ = [\n "Stack",\n "Queue",\n "Deque",\n "Graph",\n "Vertex",\n "HashTable",\n "BinaryTree",\n "AVLTree",\n "BinarySearchTree",\n "BinaryHeap",\n "BinaryTree",\n "PriorityQueue",\n]\n',"src/lib/pythonds3/basic/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3.basic import statement\n"""\nfrom pythonds3.basic.stack import Stack\nfrom pythonds3.basic.queue import Queue\nfrom pythonds3.basic.deque import Deque\nfrom pythonds3.basic.linked_list import OrderedList\nfrom pythonds3.basic.linked_list import UnorderedList\n\n__all__ = ["Stack", "Queue", "Deque", "OrderedList", "UnorderedList"]\n',"src/lib/pythonds3/basic/deque.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass Deque:\n """Queue implementation as a list"""\n\n def __init__(self):\n """Create new deque"""\n self._items = []\n\n def is_empty(self):\n """Check if the deque is empty"""\n return not bool(self._items)\n\n def add_front(self, item):\n """Add an item to the front of the deque"""\n self._items.append(item)\n\n def add_rear(self, item):\n """Add an item to the rear of the deque"""\n self._items.insert(0, item)\n\n def remove_front(self):\n """Remove an item from the front of the deque"""\n return self._items.pop()\n\n def remove_rear(self):\n """Remove an item from the rear of the deque"""\n return self._items.pop(0)\n\n def size(self):\n """Get the number of items in the deque"""\n return len(self._items)\n',"src/lib/pythonds3/basic/linked_list.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass LinkedListNode:\n """A node of a linked list"""\n\n def __init__(self, node_data):\n self._data = node_data\n self._next = None\n\n def get_data(self):\n """Get node data"""\n return self._data\n\n def set_data(self, node_data):\n """Set node data"""\n self._data = node_data\n\n data = property(get_data, set_data)\n\n def get_next(self):\n """Get next node"""\n return self._next\n\n def set_next(self, node_next):\n """Set next node"""\n self._next = node_next\n\n next = property(get_next, set_next)\n\n def __str__(self):\n """String"""\n return str(self._data)\n\n\nclass LinkedList:\n """Linked List class implementation"""\n\n def __init__(self):\n """Create a linked list"""\n self._head = None\n self._count = 0\n\n def is_empty(self):\n """Is the list empty"""\n return self._head is None\n\n def size(self):\n """Size of the list"""\n return self._count\n\n def __len__(self):\n """Size of the list"""\n return self._count\n\n def __str__(self):\n """List as a string"""\n list_str = "["\n current = self._head\n\n while current:\n list_str += str(current)\n if current.next:\n list_str += ", "\n current = current.next\n list_str += "]"\n return list_str\n\n def add(self, value):\n """Add a new node"""\n pass\n\n def remove(self, value):\n """Remove a node with a specific value"""\n pass\n\n def search(self, value):\n """Search for a node with a specific value"""\n pass\n\n\nclass UnorderedList(LinkedList):\n """Unordered linked list implementation"""\n\n def __init__(self):\n """Create an unordered linked list"""\n LinkedList.__init__(self)\n\n def add(self, value):\n """Add a new node"""\n new_node = LinkedListNode(value)\n new_node.set_next(self._head)\n self._head = new_node\n self._count = self._count + 1\n\n def remove(self, value):\n """Remove a node with a specific value"""\n current = self._head\n prev = None\n\n while current:\n if current.data == value:\n if prev is None:\n self._head = current.next\n else:\n prev.next = current.next\n self._count = self._count - 1\n return\n prev = current\n current = current.next\n raise ValueError("{} is not in the list".format(value))\n\n def search(self, value):\n """Search for a node with a specific value"""\n current = self._head\n\n while current:\n if current.data == value:\n return True\n current = current.next\n return False\n\n\nclass OrderedList(LinkedList):\n """Ordered linked list implementation"""\n\n def __init__(self):\n """Create an Ordered linked list"""\n LinkedList.__init__(self)\n\n def add(self, value):\n """Add a new node"""\n current = self._head\n prev = None\n new_node = LinkedListNode(value)\n\n while current and current.data < value:\n prev = current\n current = current.next\n\n if prev is None:\n new_node.next = self._head\n self._head = new_node\n else:\n new_node.next = current\n prev.next = new_node\n self._count = self._count + 1\n\n def remove(self, value):\n """Remove a node with a specific value"""\n # This is an exercise\n pass\n\n def search(self, value):\n """Search for a node with a specific value"""\n # This is an exercise\n pass\n',"src/lib/pythonds3/basic/queue.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass Queue:\n """Queue implementation as a list"""\n\n def __init__(self):\n """Create new queue"""\n self._items = []\n\n def is_empty(self):\n """Check if the queue is empty"""\n return not bool(self._items)\n\n def enqueue(self, item):\n """Add an item to the queue"""\n self._items.insert(0, item)\n\n def dequeue(self):\n """Remove an item from the queue"""\n return self._items.pop()\n\n def size(self):\n """Get the number of items in the queue"""\n return len(self._items)\n',"src/lib/pythonds3/basic/stack.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass Stack:\n """Stack implementation as a list"""\n\n def __init__(self):\n """Create new stack"""\n self._items = []\n\n def is_empty(self):\n """Check if the stack is empty"""\n return not bool(self._items)\n\n def push(self, item):\n """Add an item to the stack"""\n self._items.append(item)\n\n def pop(self):\n """Remove an item from the stack"""\n return self._items.pop()\n\n def peek(self):\n """Get the value of the top item in the stack"""\n return self._items[-1]\n\n def size(self):\n """Get the number of items in the stack"""\n return len(self._items)\n',"src/lib/pythonds3/graphs/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3.graphs import statement\n"""\nfrom pythonds3.graphs.adjacency_graph import Graph\nfrom pythonds3.graphs.adjacency_graph import Vertex\n\n__all__ = ["Graph"]\n',"src/lib/pythonds3/graphs/adjacency_graph.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\nimport heapq\nimport sys\n\n\nclass Vertex:\n """Graph vertex class"""\n\n def __init__(self, key):\n """Create new vertex"""\n self._key = key\n self._neighbors = {}\n self._color = "white"\n self._distance = sys.maxsize\n self._previous = None\n self._discovery_time = 0\n self._closing_time = 0\n\n def __lt__(self, other):\n """Less than operator required for heapify"""\n return self.key < other.key\n\n def get_key(self):\n """Get vertex key"""\n return self._key\n\n key = property(get_key)\n\n def get_neighbor(self, other):\n """Get the distance (edge weight) to an adjacent node (neighbor)"""\n return self._neighbors.get(other, None)\n\n def set_neighbor(self, other, weight=0):\n """Set the distance (add an edge) to an adjacent node (neighbor)"""\n self._neighbors[other] = weight\n\n def get_neighbors(self):\n """Get all adjacent nodes (neighbors)"""\n return self._neighbors.keys()\n\n def get_color(self):\n """Get vertex color"""\n return self._color\n\n def set_color(self, color):\n """Set vertex color"""\n self._color = color\n\n color = property(get_color, set_color)\n\n def get_distance(self):\n """Get distance"""\n return self._distance\n\n def set_distance(self, distance):\n """Set distance"""\n self._distance = distance\n\n distance = property(get_distance, set_distance)\n\n def get_previous(self):\n """Get previous"""\n return self._previous\n\n def set_previous(self, previous):\n """Set previous"""\n self._previous = previous\n\n previous = property(get_previous, set_previous)\n\n def get_discovery_time(self):\n """Get discovery time"""\n return self._discovery_time\n\n def set_discovery_time(self, discovery_time):\n """Set discovery time"""\n self._discovery_time = discovery_time\n\n discovery_time = property(get_discovery_time, set_discovery_time)\n\n def get_closing_time(self):\n """Get closing time"""\n return self._closing_time\n\n def set_closing_time(self, closing_time):\n """Set closing time"""\n self._closing_time = closing_time\n\n closing_time = property(get_closing_time, set_closing_time)\n\n def __str__(self):\n return "{:^8}|{:^8}|{:^8}|{:^8}|{:^8}| {}".format(\n self._key,\n self._color,\n self._distance,\n self._discovery_time,\n self._closing_time,\n self._previous,\n )\n\n\nclass Graph:\n """Graph as an adjacency matrix"""\n\n def __init__(self):\n self._vertices = {}\n self._edges = {}\n self._time = 0\n\n def __iter__(self):\n """Iterator"""\n return iter(self._vertices.values())\n\n def size(self):\n """Graph\'s size"""\n return len(self._vertices)\n\n def __len__(self):\n """Graph\'s size"""\n return len(self._vertices)\n\n def __contains__(self, key):\n """in operator override"""\n return key in self._vertices\n\n def get_vertex(self, key):\n """Find the vertex in the graph named vert_key"""\n return self._vertices.get(key, None)\n\n def set_vertex(self, key):\n """Add an instance of Vertex to the graph"""\n self._vertices[key] = Vertex(key)\n\n def add_edge(self, from_vertex, to_vertex, weight=0):\n """Add a weighted and directed edge to the graph"""\n if from_vertex not in self._vertices:\n self.set_vertex(from_vertex)\n if to_vertex not in self._vertices:\n self.set_vertex(to_vertex)\n self._vertices[from_vertex].set_neighbor(self._vertices[to_vertex], weight)\n self._edges[(from_vertex, to_vertex)] = weight\n\n def get_vertices(self):\n """Return the list of all vertices in the graph"""\n return self._vertices.keys()\n\n def get_edges(self):\n """Return the list of all edges in the graph"""\n return self._edges.keys()\n\n def reset_distances(self, default_distance=sys.maxsize):\n """Reset distances to test Dijkstra\'s"""\n for vertex in self:\n vertex.distance = default_distance\n\n def bfs(self, start):\n """Breadth First Search"""\n start.distance = 0\n start.previous = None\n vert_queue = [start]\n while vert_queue:\n current_vert = vert_queue.pop(0)\n for neigh in current_vert.get_neighbors():\n if neigh.color == "white":\n neigh.color = "gray"\n neigh.distance = current_vert.distance + 1\n neigh.previous = current_vert\n vert_queue.append(neigh)\n current_vert.color = "black"\n\n def dfs(self):\n """Depth First search"""\n for vertex in self:\n if vertex.color == "white":\n self.dfs_visit(vertex)\n\n def dfs_visit(self, start):\n """DFS helper function"""\n start.color = "gray"\n self._time = self._time + 1\n start.discovery_time = self._time\n for next_vertex in start.get_neighbors():\n if next_vertex.color == "white":\n next_vertex.set_previous(start)\n self.dfs_visit(next_vertex)\n start.color = "black"\n self._time = self._time + 1\n start.closing_time = self._time\n\n def traverse(self, src, dst):\n """Traverse a graph"""\n path = []\n current = self.get_vertex(dst)\n while current:\n path.append(current)\n current = current.previous\n print(\n "Path from {} to {} ({}): {}".format(\n self.get_vertex(src).key,\n self.get_vertex(dst).key,\n self.get_vertex(dst).distance,\n " ".join(vertex.key for vertex in reversed(path)),\n )\n )\n\n def dijkstra(self, start):\n """Dijkstra\'s shortest path algorithm"""\n start.distance = 0\n not_yet_visited = [[start.distance, start]]\n heapq.heapify(not_yet_visited)\n while not_yet_visited:\n current_vertex = heapq.heappop(not_yet_visited)[1]\n for next_vertex in current_vertex.get_neighbors():\n new_distance = current_vertex.distance + current_vertex.get_neighbor(\n next_vertex\n )\n if new_distance < next_vertex.distance:\n next_vertex.distance = new_distance\n next_vertex.previous = current_vertex\n found = False\n for vertex in not_yet_visited:\n if vertex[1].key == next_vertex.key:\n vertex[0] = next_vertex.distance\n heapq.heapify(not_yet_visited)\n found = True\n if not found:\n heapq.heappush(\n not_yet_visited, [next_vertex.distance, next_vertex]\n )\n\n def bellman_ford(self, start):\n """Bellman-Ford shortest path algorithm"""\n start.distance = 0\n for _ in range(len(self._vertices)):\n for edge in self._edges:\n if (\n self.get_vertex(edge[0]).distance + self._edges[edge]\n < self.get_vertex(edge[1]).distance\n ):\n self.get_vertex(edge[1]).distance = (\n self.get_vertex(edge[0]).distance + self._edges[edge]\n )\n self.get_vertex(edge[1]).previous = self.get_vertex(edge[0])\n for edge in self._edges:\n if (\n self.get_vertex(edge[0]).distance + self._edges[edge]\n < self.get_vertex(edge[1]).distance\n ):\n raise ValueError("Graph contains a negative-weight cycle")\n\n def prim(self, start):\n """Prim\'s spanning tree algorithm"""\n start.distance = 0\n not_in_a_tree = [[vertex.distance, vertex] for vertex in self]\n heapq.heapify(not_in_a_tree)\n while not_in_a_tree:\n current_vertex = heapq.heappop(not_in_a_tree)[1]\n for next_vertex in current_vertex.get_neighbors():\n new_distance = current_vertex.get_neighbor(next_vertex)\n if (\n any(item[1] == next_vertex for item in not_in_a_tree)\n and new_distance < next_vertex.distance\n ):\n next_vertex.previous = current_vertex\n next_vertex.distance = new_distance\n for item in not_in_a_tree:\n if item[1] == next_vertex:\n item[0] = new_distance\n heapq.heapify(not_in_a_tree)\n break\n',"src/lib/pythonds3/intro/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3.intro import statement\n"""\nfrom pythonds3.intro.oop import Fraction\n\n__all__ = ["Fraction"]\n',"src/lib/pythonds3/intro/oop.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\ndef gcd(number1, number2):\n """Helper function to simplify fractions"""\n if not isinstance(number1, int) or not isinstance(number2, int):\n raise TypeError("Numerator and denominator must be integers")\n while number1 % number2:\n number1, number2 = number2, number1 % number2\n return number2\n\n\nclass Fraction:\n """Fraction class"""\n\n def __init__(self, new_numer, new_denom):\n try:\n common = gcd(new_numer, new_denom)\n except TypeError:\n raise\n self._numer = new_numer // common\n self._denom = new_denom // common\n\n @property\n def numer(self):\n """Get numerator"""\n return self._numer\n\n @numer.setter\n def set_numer(self, new_numer):\n """Set numerator"""\n self._numer = new_numer\n\n def get_denom(self):\n """Get deniminator"""\n return self._denom\n\n def set_denom(self, new_denom):\n """Set deniminator"""\n self._denom = new_denom\n\n # Another way to create an attribute\n denom = property(get_denom, set_denom)\n\n def __str__(self):\n """Get the string value"""\n if self._numer > self._denom:\n return "{} {}/{}".format(\n self._numer // self._denom, self._numer % self._denom, self._denom\n )\n return "{}/{}".format(self._numer, self._denom)\n\n def __repr__(self):\n """Fraction representation"""\n return "Fraction({}, {})".format(self._numer, self._denom)\n\n def __eq__(self, other):\n """Equality comparison"""\n return self._numer * other.denom == other.numer * self._denom\n\n def __add__(self, other):\n """Add two fractions"""\n new_numer = self._numer * other.denom + self._denom * other.numer\n new_denom = self._denom * other.denom\n return Fraction(new_numer, new_denom)\n',"src/lib/pythonds3/searching/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3.search import statement\n"""\nfrom pythonds3.searching.hash_table import HashTable\n\n__all__ = ["HashTable"]\n',"src/lib/pythonds3/searching/hash_table.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass HashTable:\n """Hash Table implementation"""\n\n def __init__(self, size=16):\n """Create a hash table"""\n self._size = size\n self._slots = [None] * self._size\n self._data = [None] * self._size\n\n def __getitem__(self, key):\n """Magic __get__"""\n return self.get(key)\n\n def __setitem__(self, key, data):\n """Magic __set__"""\n self.put(key, data)\n\n def __len__(self):\n """Magic __len__"""\n return self._size - self._slots.count(None)\n\n def __contains__(self, key):\n """Magin in"""\n return key in self._slots\n\n def _hash_function(self, key, size):\n """Simple hash function"""\n return key % size\n\n def _rehash(self, old_hash, size, step=1):\n """Simple rehash function"""\n return (old_hash + step) % size\n\n def is_empty(self):\n """Check if the table is empty"""\n return self._size == self._slots.count(None)\n\n def size(self):\n """Get number of items in the table"""\n return self._size - self._slots.count(None)\n\n def put(self, key, data):\n """Add an item to the table"""\n hash_value = self._hash_function(key, len(self._slots))\n\n if self._slots[hash_value] is None:\n self._slots[hash_value] = key\n self._data[hash_value] = data\n else:\n if self._slots[hash_value] == key:\n self._data[hash_value] = data # replace\n else:\n j = 0\n next_slot = self._rehash(hash_value, len(self._slots), j)\n while (\n self._slots[next_slot] is not None\n and self._slots[next_slot] != key\n and j < self._size\n ):\n j = j + 1\n next_slot = self._rehash(hash_value, len(self._slots), j)\n\n if self._slots[next_slot] is None:\n self._slots[next_slot] = key\n self._data[next_slot] = data\n elif j == self._size:\n raise Exception("Hash Table is full")\n else:\n self._data[next_slot] = data # replace\n\n def get(self, key):\n """Get an item from the table"""\n start_slot = self._hash_function(key, len(self._slots))\n position = start_slot\n j = 0\n\n while self._slots[position] is not None and j < self._size:\n if self._slots[position] == key:\n return self._data[position]\n j = j + 1\n position = self._rehash(start_slot, len(self._slots), j)\n\n raise KeyError("{} is not in the table".format(key))\n',"src/lib/pythonds3/sorting/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3.sorting import statement\n"""\nfrom pythonds3.sorting.sorting_algorithms import bubble_sort\nfrom pythonds3.sorting.sorting_algorithms import select_sort\nfrom pythonds3.sorting.sorting_algorithms import insert_sort\nfrom pythonds3.sorting.sorting_algorithms import shell_sort\nfrom pythonds3.sorting.sorting_algorithms import merge_sort\nfrom pythonds3.sorting.sorting_algorithms import quick_sort\nfrom pythonds3.sorting.sorting_algorithms import heap_sort\n',"src/lib/pythonds3/sorting/sorting_algorithms.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\nimport heapq\n\n\ndef bubble_sort(lst):\n """Bubble sort"""\n for i in range(len(lst) - 1, 0, -1):\n exchanges = False\n for j in range(i):\n if lst[j] > lst[j + 1]:\n exchanges = True\n lst[j], lst[j + 1] = lst[j + 1], lst[j]\n if not exchanges:\n break\n\n\ndef select_sort(lst):\n """Selection sort"""\n for i, item in enumerate(lst):\n min_idx = len(lst) - 1\n for j in range(i, len(lst)):\n if lst[j] < lst[min_idx]:\n min_idx = j\n if min_idx != i:\n lst[min_idx], lst[i] = lst[i], lst[min_idx]\n\n\ndef insert_sort(lst):\n """Insertion sort"""\n for i in range(1, len(lst)):\n cur_val = lst[i]\n cur_pos = i\n\n while cur_pos > 0 and lst[cur_pos - 1] > cur_val:\n lst[cur_pos] = lst[cur_pos - 1]\n cur_pos = cur_pos - 1\n lst[cur_pos] = cur_val\n\n\ndef shell_sort(lst):\n """Shell sort"""\n sublist_count = len(lst) // 3\n while sublist_count > 0:\n for pos_start in range(sublist_count):\n _gap_insert_sort(lst, pos_start, sublist_count)\n sublist_count = sublist_count // 2\n\n\ndef _gap_insert_sort(lst, start, gap):\n """Shell sort helper function"""\n for i in range(start + gap, len(lst), gap):\n cur_val = lst[i]\n cur_pos = i\n while cur_pos >= gap and lst[cur_pos - gap] > cur_val:\n lst[cur_pos] = lst[cur_pos - gap]\n cur_pos = cur_pos - gap\n lst[cur_pos] = cur_val\n\n\ndef merge_sort(lst):\n """Merge sort"""\n if len(lst) > 1:\n mid = len(lst) // 2\n left_half = lst[:mid]\n right_half = lst[mid:]\n\n merge_sort(left_half)\n merge_sort(right_half)\n\n i, j, k = 0, 0, 0\n while i < len(left_half) and j < len(right_half):\n if left_half[i] <= right_half[j]:\n lst[k] = left_half[i]\n i = i + 1\n else:\n lst[k] = right_half[j]\n j = j + 1\n k = k + 1\n\n while i < len(left_half):\n lst[k] = left_half[i]\n i = i + 1\n k = k + 1\n\n while j < len(right_half):\n lst[k] = right_half[j]\n j = j + 1\n k = k + 1\n\n\ndef quick_sort(lst):\n """Quick sort"""\n _quick_sort_help(lst, 0, len(lst) - 1)\n\n\ndef _quick_sort_help(lst, mark_l, mark_r):\n """Quick sort helper"""\n if mark_l < mark_r:\n split = _quick_sort_part(lst, mark_l, mark_r)\n _quick_sort_help(lst, mark_l, split - 1)\n _quick_sort_help(lst, split + 1, mark_r)\n\n\ndef _quick_sort_part(lst, mark_l, mark_r):\n """Quick sort partition"""\n pivot_val = lst[mark_l]\n mark_l_cur = mark_l + 1\n mark_r_cur = mark_r\n done = False\n\n while not done:\n while mark_l_cur <= mark_r_cur and lst[mark_l_cur] <= pivot_val:\n mark_l_cur = mark_l_cur + 1\n while mark_l_cur <= mark_r_cur and lst[mark_r_cur] >= pivot_val:\n mark_r_cur = mark_r_cur - 1\n if mark_r_cur < mark_l_cur:\n done = True\n else:\n lst[mark_l_cur], lst[mark_r_cur] = lst[mark_r_cur], lst[mark_l_cur]\n lst[mark_l], lst[mark_r_cur] = lst[mark_r_cur], lst[mark_l]\n\n return mark_r_cur\n\n\ndef heap_sort(lst):\n """Heap sort"""\n res = []\n heapq.heapify(lst)\n while lst:\n res.append(heapq.heappop(lst))\n for i in res:\n lst.append(i)\n',"src/lib/pythonds3/trees/__init__.py":'#!/usr/bin/env python3\n"""\npythonds3.trees import statement\n"""\nfrom pythonds3.trees.avl_tree import AVLTree\nfrom pythonds3.trees.binary_search_tree import BinarySearchTree\nfrom pythonds3.trees.binary_heap import BinaryHeap\nfrom pythonds3.trees.binary_tree import BinaryTree\nfrom pythonds3.trees.priority_queue import PriorityQueue\n\n__all__ = ["BinaryTree", "BinaryHeap", "BinarySearchTree", "AVLTree", "PriorityQueue"]\n',"src/lib/pythonds3/trees/avl_tree.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005, 2010\nUpdated by Roman Yasinovskyy, 2017\n"""\n\nfrom pythonds3.trees.binary_search_tree import BinarySearchTree\nfrom pythonds3.trees.binary_search_tree import BinaryTreeNode\n\n\nclass AVLTreeNode(BinaryTreeNode):\n """AVL Tree Node"""\n\n def __init__(self, key, val, balance_factor, left=None, right=None, parent=None):\n """Create an AVL tree node"""\n BinaryTreeNode.__init__(self, key, val, left, right, parent)\n self._balance_factor = balance_factor\n\n def get_balance_factor(self):\n """Get the node balance factor"""\n return self._balance_factor\n\n def set_balance_factor(self, value):\n """Set the node balance factor"""\n self._balance_factor = value\n\n balance_factor = property(get_balance_factor, set_balance_factor)\n\n\nclass AVLTree(BinarySearchTree):\n """AVL tree implementation"""\n\n def __init__(self):\n """Create a new AVL tree"""\n BinarySearchTree.__init__(self)\n\n def put(self, key, value):\n """Add new node"""\n if self._root:\n self._put(key, value, self._root)\n else:\n self._root = AVLTreeNode(key, value, 0)\n self._size = self._size + 1\n\n def _put(self, key, value, current_node):\n """Add a new node to the tree (helper function)"""\n if key < current_node.key:\n if current_node.get_child_left():\n self._put(key, value, current_node.child_left)\n else:\n current_node.child_left = AVLTreeNode(\n key, value, 0, parent=current_node\n )\n self.update_balance(current_node.child_left)\n else:\n if current_node.get_child_right():\n self._put(key, value, current_node.child_right)\n else:\n current_node.child_right = AVLTreeNode(\n key, value, 0, parent=current_node\n )\n self.update_balance(current_node.child_right)\n\n def update_balance(self, node):\n """Update the tree balance"""\n if node.balance_factor > 1 or node.balance_factor < -1:\n self.rebalance(node)\n return\n if node.parent:\n if node.is_child_left():\n node.parent.balance_factor += 1\n elif node.is_child_right():\n node.parent.balance_factor -= 1\n\n if node.parent.balance_factor != 0:\n self.update_balance(node.parent)\n\n def rebalance(self, node):\n """Rebalance the tree"""\n if node.balance_factor < 0:\n if node.child_right.balance_factor > 0:\n # Do an LR Rotation\n self.rotate_right(node.child_right)\n self.rotate_left(node)\n else:\n # single left\n self.rotate_left(node)\n elif node.balance_factor > 0:\n if node.child_left.balance_factor < 0:\n # Do an RL Rotation\n self.rotate_left(node.child_left)\n self.rotate_right(node)\n else:\n # single right\n self.rotate_right(node)\n\n def rotate_left(self, rotation_root):\n """Left rotation"""\n new_root = rotation_root.child_right\n rotation_root.child_right = new_root.child_left\n if new_root.child_left:\n new_root.child_left.parent = rotation_root\n new_root.parent = rotation_root.parent\n if rotation_root.is_root():\n self._root = new_root\n else:\n if rotation_root.is_child_left():\n rotation_root.parent.child_left = new_root\n else:\n rotation_root.parent.child_right = new_root\n new_root.child_left = rotation_root\n rotation_root.parent = new_root\n rotation_root.balance_factor = (\n rotation_root.balance_factor + 1 - min(new_root.balance_factor, 0)\n )\n new_root.balance_factor = (\n new_root.balance_factor + 1 + max(rotation_root.balance_factor, 0)\n )\n\n def rotate_right(self, rotation_root):\n """Right rotation"""\n new_root = rotation_root.child_left\n rotation_root.child_left = new_root.child_right\n if new_root.child_right:\n new_root.child_right.parent = rotation_root\n new_root.parent = rotation_root.parent\n if rotation_root.is_root():\n self._root = new_root\n else:\n if rotation_root.is_child_right():\n rotation_root.parent.child_right = new_root\n else:\n rotation_root.parent.child_left = new_root\n new_root.child_right = rotation_root\n rotation_root.parent = new_root\n rotation_root.balance_factor = (\n rotation_root.balance_factor - 1 - max(new_root.balance_factor, 0)\n )\n new_root.balance_factor = (\n new_root.balance_factor - 1 + min(rotation_root.balance_factor, 0)\n )\n',"src/lib/pythonds3/trees/binary_heap.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass BinaryHeap:\n """Minimal Binary Heap"""\n\n def __init__(self):\n """Create a heap"""\n self._heap = []\n\n def _perc_up(self, cur_idx):\n """Move a node up"""\n while (cur_idx - 1) // 2 >= 0:\n parent_idx = (cur_idx - 1) // 2\n if self._heap[cur_idx] < self._heap[parent_idx]:\n self._heap[cur_idx], self._heap[parent_idx] = (\n self._heap[parent_idx],\n self._heap[cur_idx],\n )\n cur_idx = parent_idx\n\n def _perc_down(self, cur_idx):\n """Move a node down"""\n while 2 * cur_idx + 1 < len(self._heap):\n min_child_idx = self._get_min_child(cur_idx)\n if self._heap[cur_idx] > self._heap[min_child_idx]:\n self._heap[cur_idx], self._heap[min_child_idx] = (\n self._heap[min_child_idx],\n self._heap[cur_idx],\n )\n else:\n return\n cur_idx = min_child_idx\n\n def _get_min_child(self, parent_idx):\n """Get a smaller child"""\n if 2 * parent_idx + 2 > len(self._heap) - 1:\n return 2 * parent_idx + 1\n if self._heap[2 * parent_idx + 1] < self._heap[2 * parent_idx + 2]:\n return 2 * parent_idx + 1\n return 2 * parent_idx + 2\n\n def heapify(self, not_a_heap, show_details=False):\n """Build a heap from any list"""\n self._heap = not_a_heap[:]\n cur_idx = len(self._heap) // 2 - 1\n while cur_idx >= 0:\n self._perc_down(cur_idx)\n cur_idx = cur_idx - 1\n if show_details:\n print(self._heap)\n\n def insert(self, item):\n """Add a new item"""\n self._heap.append(item)\n self._perc_up(len(self._heap) - 1)\n\n def delete(self):\n """Remove an item"""\n self._heap[0], self._heap[-1] = self._heap[-1], self._heap[0]\n result = self._heap.pop()\n self._perc_down(0)\n return result\n\n def is_empty(self):\n """Check if the heap is empty"""\n return not bool(self._heap)\n\n def __len__(self):\n """Get heap size"""\n return len(self._heap)\n\n def __str__(self):\n """Heap as a string"""\n return str(self._heap)\n\n def __contains__(self, item):\n """__contains__in method override"""\n return item in self._heap\n',"src/lib/pythonds3/trees/binary_search_tree.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005, 2010\nUpdated by Roman Yasinovskyy, 2017\n"""\n\n\nclass BinaryTreeNode:\n """Binary Tree Node class"""\n\n def __init__(self, key, value, left=None, right=None, parent=None):\n """Create new Tree Node"""\n self._key = key\n self._value = value\n self._child_left = left\n self._child_right = right\n self._parent = parent\n\n def get_child_left(self):\n """Return the node\'s left child"""\n return self._child_left\n\n def set_child_left(self, node):\n """Assign the node\'s left child"""\n self._child_left = node\n\n child_left = property(get_child_left, set_child_left)\n\n def get_child_right(self):\n """Return the node\'s right child"""\n return self._child_right\n\n def set_child_right(self, node):\n """Assign the node\'s right child"""\n self._child_right = node\n\n child_right = property(get_child_right, set_child_right)\n\n def get_parent(self):\n """Return the node\'s parent"""\n return self._parent\n\n def set_parent(self, node):\n """Assign the node\'s parent"""\n self._parent = node\n\n parent = property(get_parent, set_parent)\n\n def is_child_left(self):\n """Check if the node is a left child"""\n return self._parent and self._parent.child_left == self\n\n def is_child_right(self):\n """Check if the node is a right child"""\n return self._parent and self._parent.child_right == self\n\n def is_root(self):\n """Check if the node is a tree root"""\n return not self._parent\n\n def is_leaf(self):\n """Check if the node is a leaf"""\n return not (self._child_right or self._child_left)\n\n def has_a_child(self):\n """Check if the node has any child"""\n return self._child_right or self._child_left\n\n def has_children(self):\n """Check if the node has both children"""\n return self._child_right and self._child_left\n\n def get_key(self):\n """Get node key"""\n return self._key\n\n def set_key(self, key):\n """Set node key"""\n self._key = key\n\n key = property(get_key, set_key)\n\n def get_value(self):\n """Get node value"""\n return self._value\n\n def set_value(self, value):\n """Set node value"""\n self._value = value\n\n value = property(get_value, set_value)\n\n def replace_payload(self, key, value, left, right):\n """Change node payload"""\n self._key = key\n self._value = value\n self._child_left = left\n self._child_right = right\n if self.child_left:\n self._child_left.parent = self\n if self.child_right:\n self._child_right.parent = self\n\n def find_successor(self):\n """Find the node\'s successor"""\n successor = None\n if self._child_right:\n successor = self._child_right.find_min()\n else:\n if self._parent:\n if self.is_child_left():\n successor = self._parent\n else:\n self._parent.child_right = None\n successor = self._parent.find_successor()\n self._parent.child_right = self\n return successor\n\n def find_min(self):\n """Find the smallest node in the right subtree"""\n current = self\n while current.child_left:\n current = current.child_left\n return current\n\n def splice_out(self):\n """Splice out"""\n if self.is_leaf():\n if self.is_child_left():\n self._parent.child_left = None\n else:\n self._parent.child_right = None\n elif self.has_a_child():\n if self.child_left:\n if self.is_child_left():\n self._parent.child_left = self._child_left\n else:\n self._parent.child_right = self._child_left\n self._child_left.parent = self._parent\n else:\n if self.is_child_left():\n self._parent.child_left = self._child_right\n else:\n self._parent.child_right = self._child_right\n self._child_right.parent = self._parent\n\n def __iter__(self):\n """The standard inorder traversal of a binary tree"""\n if self:\n if self._child_left:\n for elem in self._child_left:\n yield elem\n yield self._key\n if self._child_right:\n for elem in self._child_right:\n yield elem\n\n\nclass BinarySearchTree:\n """Binary search tree implementation"""\n\n def __init__(self):\n self._root = None\n self._size = 0\n\n def __len__(self):\n """Tree size"""\n return self._size\n\n def size(self):\n """Tree size"""\n return self._size\n\n def __iter__(self):\n """Iterator"""\n return self._root.__iter__()\n\n def __getitem__(self, key):\n """[] getter operator override"""\n result = self.get(key)\n if result:\n return result\n raise KeyError("Error, key not in tree")\n\n def get_root(self):\n """Get tree root"""\n return self._root\n\n def set_root(self, node):\n """Set tree root"""\n self._root = node\n\n root = property(get_root, set_root)\n\n def get(self, key):\n """Retrieve a value by the key"""\n if self._root:\n result = self._get(key, self._root)\n if result:\n return result.value\n return None\n else:\n return None\n\n def _get(self, key, current_node):\n """Retrieve a value by the key (helper function)"""\n if not current_node:\n return None\n if current_node.key == key:\n return current_node\n elif key < current_node.key:\n return self._get(key, current_node.child_left)\n else:\n return self._get(key, current_node.child_right)\n\n def __setitem__(self, key, value):\n """[] setter operator override"""\n self.put(key, value)\n\n def put(self, key, value):\n """Add new node"""\n if self._root:\n self._put(key, value, self._root)\n else:\n self._root = BinaryTreeNode(key, value)\n self._size = self._size + 1\n\n def _put(self, key, value, current_node):\n """Add new node (helper function)"""\n if key < current_node.key:\n if current_node.child_left:\n self._put(key, value, current_node.child_left)\n else:\n current_node.child_left = BinaryTreeNode(\n key, value, parent=current_node\n )\n else:\n if current_node.child_right:\n self._put(key, value, current_node.child_right)\n else:\n current_node.child_right = BinaryTreeNode(\n key, value, parent=current_node\n )\n\n def __contains__(self, key):\n """in operator override"""\n return bool(self._get(key, self._root))\n\n def __delitem__(self, key):\n """del operator override"""\n self.delete(key)\n\n def delete(self, key):\n """Remove a node by its key"""\n if self._size > 1:\n node_to_remove = self._get(key, self._root)\n if node_to_remove:\n self._delete(node_to_remove)\n self._size = self._size - 1\n else:\n raise KeyError("Error, key not in tree")\n elif self._size == 1 and self._root.key == key:\n self._root = None\n self._size = self._size - 1\n else:\n raise KeyError("Error, key not in tree")\n\n def _delete(self, current_node):\n """Remove a node by its key (helper function)"""\n if current_node.is_leaf(): # removing a leaf\n if current_node == current_node.parent.child_left:\n current_node.parent.child_left = None\n else:\n current_node.parent.child_right = None\n elif current_node.has_children(): # removing a node with two children\n successor = current_node.find_successor()\n successor.splice_out()\n current_node.key = successor.key\n current_node.value = successor.value\n else: # removing a node with one child\n if current_node.get_child_left():\n if current_node.is_child_left():\n current_node.child_left.parent = current_node.parent\n current_node.parent.child_left = current_node.child_left\n elif current_node.is_child_right():\n current_node.child_left.parent = current_node.parent\n current_node.parent.child_right = current_node.child_left\n else:\n current_node.replace_payload(\n current_node.child_left.key,\n current_node.child_left.value,\n current_node.child_left.child_left,\n current_node.child_left.child_right,\n )\n else:\n if current_node.is_child_left():\n current_node.child_right.parent = current_node.parent\n current_node.parent.child_left = current_node.child_right\n elif current_node.is_child_right():\n current_node.child_right.parent = current_node.parent\n current_node.parent.child_right = current_node.child_right\n else:\n current_node.replace_payload(\n current_node.child_right.key,\n current_node.child_right.value,\n current_node.child_right.child_left,\n current_node.child_right.child_right,\n )\n\n def inorder(self):\n """In-order tree traversal"""\n self._inorder(self._root)\n\n def _inorder(self, tree):\n """In-order tree traversal (helper function)"""\n if tree:\n self._inorder(tree.child_left)\n print(tree.key, end=" ")\n self._inorder(tree.child_right)\n\n def postorder(self):\n """Post-order tree traversal"""\n self._postorder(self._root)\n\n def _postorder(self, tree):\n """Post-order tree traversal (helper function)"""\n if tree:\n self._postorder(tree.child_left)\n self._postorder(tree.child_right)\n print(tree.key, end=" ")\n\n def preorder(self):\n """Pre-order tree traversal"""\n self._preorder(self._root)\n\n def _preorder(self, tree):\n """Pre-order tree traversal (helper function)"""\n if tree:\n print(tree.key, end=" ")\n self._preorder(tree.child_left)\n self._preorder(tree.child_right)\n\n def clear(self):\n """Remove all nodes"""\n while self._root:\n self.delete(self._root.key)\n',"src/lib/pythonds3/trees/binary_tree.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\nimport operator\n\n\nclass BinaryTree:\n """\n A recursive implementation of Binary Tree\n Using links and Nodes approach.\n\n Modified to allow for trees to be constructed from other trees\n rather than always creating a new tree in the insert_feft or insert_right\n """\n\n def __init__(self, key):\n """Create new tree"""\n self._key = key\n self._child_left = None\n self._child_right = None\n\n def get_root_val(self):\n """Get root key value"""\n return self._key\n\n def set_root_val(self, key):\n """Set root key value"""\n self._key = key\n\n root = property(get_root_val, set_root_val)\n\n def get_child_left(self):\n """Get left child"""\n return self._child_left\n\n def set_child_left(self, node):\n """Set left child"""\n self._child_left = node\n\n child_left = property(get_child_left, set_child_left)\n\n def get_child_right(self):\n """Get right child"""\n return self._child_right\n\n def set_child_right(self, node):\n """Set right child"""\n self._child_right = node\n\n child_right = property(get_child_right, set_child_right)\n\n def is_leaf(self):\n """Check if a node is leaf"""\n return (not self._child_left) and (not self._child_right)\n\n def insert_left(self, new_node):\n """Insert left subtree"""\n if isinstance(new_node, BinaryTree):\n new_subtree = new_node\n else:\n new_subtree = BinaryTree(new_node)\n\n if self._child_left:\n new_subtree.set_child_left(self._child_left)\n\n self._child_left = new_subtree\n\n def insert_right(self, new_node):\n """Insert right subtree"""\n if isinstance(new_node, BinaryTree):\n new_subtree = new_node\n else:\n new_subtree = BinaryTree(new_node)\n\n if self._child_right:\n new_subtree.set_child_right(self._child_right)\n self._child_right = new_subtree\n\n def preorder(self):\n """Pre-order tree traversal"""\n print(self._key, end=" ")\n if self._child_left:\n self._child_left.preorder()\n if self._child_right:\n self._child_right.preorder()\n\n def inorder(self):\n """In-order tree traversal"""\n if self._child_left:\n self._child_left.inorder()\n print(self._key, end=" ")\n if self._child_right:\n self._child_right.inorder()\n\n def postorder(self):\n """Post-order tree traversal"""\n if self._child_left:\n self._child_left.postorder()\n if self._child_right:\n self._child_right.postorder()\n print(self._key, end=" ")\n\n def print_exp(self):\n """Print an expression"""\n if self._child_left:\n print("(", end=" ")\n self._child_left.print_exp()\n print(self._key, end=" ")\n if self._child_right:\n self._child_right.print_exp()\n print(")", end=" ")\n\n def postorder_eval(self):\n """Postorder evaluation"""\n operations = {\n "+": operator.add,\n "-": operator.sub,\n "*": operator.mul,\n "/": operator.truediv,\n }\n result_1 = None\n result_2 = None\n if self._child_left:\n result_1 = self._child_left.postorder_eval()\n if self._child_right:\n result_2 = self._child_right.postorder_eval()\n if result_1 and result_2:\n return operations[self._key](result_1, result_2)\n return self._key\n\n def height(self):\n """Height of a tree"""\n if not self._key:\n return -1\n if self._child_left:\n height_left = self._child_left.height()\n else:\n height_left = -1\n\n if self._child_right:\n height_right = self._child_right.height()\n else:\n height_right = -1\n\n return 1 + max(height_left, height_right)\n\n def __len__(self):\n """Size of a tree"""\n return self.size()\n\n def size(self):\n """Count nodes in a tree"""\n if not self._key:\n return 0\n if self._child_left:\n children_left = self._child_left.size()\n else:\n children_left = 0\n\n if self._child_right:\n children_right = self._child_right.size()\n else:\n children_right = 0\n\n return 1 + children_left + children_right\n',"src/lib/pythonds3/trees/priority_queue.py":'#!/usr/bin/env python3\n"""\nBradley N. Miller, David L. Ranum\nProblem Solving with Algorithms and Data Structures using Python\nCopyright 2005\nUpdated by Roman Yasinovskyy, 2017\n"""\n\nfrom pythonds3.trees.binary_heap import BinaryHeap\n\n\nclass PriorityQueue(BinaryHeap):\n """\n This implementation of binary heap takes (key, value) pairs where key signifies priority\n We will assume that the keys are all comparable.\n """\n\n def change_priority(self, new_priority, value):\n """Change the priority"""\n key_to_move = 0\n for i in range(len(self._heap)):\n if self._heap[i][1] == value:\n key_to_move = i\n break\n if key_to_move > -1:\n self._heap[key_to_move] = (new_priority, self._heap[key_to_move][1])\n self._perc_up(key_to_move)\n',"src/lib/pythoned/__init__.py":"","src/lib/pythoned/arboles/__init__.py":"\n\n\nfrom .avl import ArbolAVL\nfrom .abb import ArbolBinarioBusqueda\nfrom .monticuloBinario import MonticuloBinario\n\n\n","src/lib/pythoned/arboles/abb.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n#\n#abb.py\n\nclass ArbolBinarioBusqueda:\n\n def __init__(self):\n self.raiz = None\n self.tamano = 0\n\n def agregar(self,clave,valor):\n if self.raiz:\n self._agregar(clave,valor,self.raiz)\n else:\n self.raiz = NodoArbol(clave,valor)\n self.tamano = self.tamano + 1\n\n def _agregar(self,clave,valor,nodoActual):\n if clave < nodoActual.clave:\n if nodoActual.tieneHijoIzquierdo():\n self._agregar(clave,valor,nodoActual.hijoIzquierdo)\n else:\n nodoActual.hijoIzquierdo = NodoArbol(clave,valor,padre=nodoActual)\n else:\n if nodoActual.tieneHijoDerecho():\n self._agregar(clave,valor,nodoActual.hijoDerecho)\n else:\n nodoActual.hijoDerecho = NodoArbol(clave,valor,padre=nodoActual)\n \n def __setitem__(self,c,v):\n self.agregar(c,v)\n\n def obtener(self,clave):\n if self.raiz:\n res = self._obtener(clave,self.raiz)\n if res:\n return res.cargaUtil\n else:\n return None\n else:\n return None\n\n def _obtener(self,clave,nodoActual):\n \tif not nodoActual:\n \t return None\n \telif nodoActual.clave == clave:\n \t return nodoActual\n \telif clave < nodoActual.clave:\n \t return self._obtener(clave,nodoActual.hijoIzquierdo)\n \telse:\n \t return self._obtener(clave,nodoActual.hijoDerecho) \n\n def __getitem__(self,clave):\n res = self.obtener(clave) \n if res:\n return res\n else:\n raise KeyError('Error, la clave no está en el árbol')\n\n def __contains__(self,clave):\n \tif self._obtener(clave,self.raiz):\n \t return True\n \telse:\n \t return False\n \n def longitud(self):\n return self.tamano\n\n def __len__(self):\n return self.tamano\n\n def __iter__(self):\n return self.raiz.__iter__()\n\n def eliminar(self,clave):\n if self.tamano > 1:\n nodoAEliminar = self._obtener(clave,self.raiz)\n \t if nodoAEliminar:\n \t self.remover(nodoAEliminar)\n \t self.tamano = self.tamano-1\n \t else:\n \t raise KeyError('Error, la clave no está en el árbol')\n elif self.tamano == 1 and self.raiz.clave == clave:\n \t self.raiz = None\n \t self.tamano = self.tamano - 1\n else:\n \t raise KeyError('Error, la clave no está en el árbol')\n\n def __delitem__(self,clave):\n self.eliminar(clave)\n\n def remover(self,nodoActual):\n if nodoActual.esHoja(): #hoja\n if nodoActual == nodoActual.padre.hijoIzquierdo:\n nodoActual.padre.hijoIzquierdo = None\n else:\n nodoActual.padre.hijoDerecho = None\n elif nodoActual.tieneAmbosHijos(): #interior\n suc = nodoActual.encontrarSucesor()\n suc.empalmar()\n nodoActual.clave = suc.clave\n nodoActual.cargaUtil = suc.cargaUtil\n\n else: # este nodo tiene un (1) hijo\n if nodoActual.tieneHijoIzquierdo():\n if nodoActual.esHijoIzquierdo():\n nodoActual.hijoIzquierdo.padre = nodoActual.padre\n nodoActual.padre.hijoIzquierdo = nodoActual.hijoIzquierdo\n elif nodoActual.esHijoDerecho():\n nodoActual.hijoIzquierdo.padre = nodoActual.padre\n nodoActual.padre.hijoDerecho = nodoActual.hijoIzquierdo\n else:\n nodoActual.reemplazarDatoDeNodo(nodoActual.hijoIzquierdo.clave, nodoActual.hijoIzquierdo.cargaUtil, nodoActual.hijoIzquierdo.hijoIzquierdo, nodoActual.hijoIzquierdo.hijoDerecho)\n else:\n if nodoActual.esHijoIzquierdo():\n nodoActual.hijoDerecho.padre = nodoActual.padre\n nodoActual.padre.hijoIzquierdo = nodoActual.hijoDerecho\n elif nodoActual.esHijoDerecho():\n nodoActual.hijoDerecho.padre = nodoActual.padre\n nodoActual.padre.hijoDerecho = nodoActual.hijoDerecho\n else:\n nodoActual.reemplazarDatoDeNodo(nodoActual.hijoDerecho.clave, nodoActual.hijoDerecho.cargaUtil, nodoActual.hijoDerecho.hijoIzquierdo, nodoActual.hijoDerecho.hijoDerecho)\n\n def inorden(self):\n self._inorden(self.raiz)\n\n def _inorden(self,arbol):\n if arbol != None:\n self._inorden(arbol.hijoIzquierdo)\n print(arbol.clave)\n self._inorden(arbol.hijoDerecho)\n\n def postorden(self):\n self._postorden(self.raiz)\n\n def _postorden(self, arbol):\n if arbol:\n self._postorden(arbol.hijoDerecho)\n self._postorden(arbol.hijoIzquierdo)\n print(arbol.clave) \n\n def preorden(self):\n self._preorden(self,self.raiz)\n\n def _preorden(self,arbol):\n if arbol:\n print(arbol.clave) \n self._preorden(arbol.hijoIzquierdo)\n self._preorden(arbol.hijoDerecho)\n\n\nclass NodoArbol:\n def __init__(self,clave,valor,izquierdo=None,derecho=None,padre=None):\n self.clave = clave\n self.cargaUtil = valor\n self.hijoIzquierdo = izquierdo\n self.hijoDerecho = derecho\n self.padre = padre\n self.factorEquilibrio = 0\n\n def tieneHijoIzquierdo(self):\n return self.hijoIzquierdo\n \n def tieneHijoDerecho(self):\n return self.hijoDerecho\n\n def esHijoIzquierdo(self):\n return self.padre and self.padre.hijoIzquierdo == self\n \n def esHijoDerecho(self):\n return self.padre and self.padre.hijoDerecho == self\n\n def esRaiz(self):\n return not self.padre\n\n def esHoja(self):\n return not (self.hijoDerecho or self.hijoIzquierdo)\n\n def tieneAlgunHijo(self):\n return self.hijoDerecho or self.hijoIzquierdo\n\n def tieneAmbosHijos(self):\n return self.hijoDerecho and self.hijoIzquierdo\n\n def reemplazarDatoDeNodo(self,clave,valor,hizq,hder):\n self.clave = clave\n self.cargaUtil = valor\n self.hijoIzquierdo = hizq\n self.hijoDerecho = hder\n if self.tieneHijoIzquierdo():\n self.hijoIzquierdo.padre = self\n if self.tieneHijoDerecho():\n self.hijoDerecho.padre = self \n\n def encontrarSucesor(self):\n suc = None\n if self.tieneHijoDerecho():\n suc = self.hijoDerecho.encontrarMin()\n else:\n if self.padre:\n if self.esHijoIzquierdo():\n suc = self.padre\n else:\n self.padre.hijoDerecho = None\n suc = self.padre.encontrarSucesor()\n self.padre.hijoDerecho = self\n return suc\n\n def empalmar(self):\n if self.esHoja():\n if self.esHijoIzquierdo():\n self.padre.hijoIzquierdo = None\n else:\n self.padre.hijoDerecho = None\n elif self.tieneAlgunHijo():\n if self.tieneHijoIzquierdo():\n if self.esHijoIzquierdo():\n self.padre.hijoIzquierdo = self.hijoIzquierdo\n else:\n self.padre.hijoDerecho = self.hijoIzquierdo\n self.hijoIzquierdo.padre = self.padre\n else:\n if self.esHijoIzquierdo():\n self.padre.hijoIzquierdo = self.hijoDerecho\n else:\n self.padre.hijoDerecho = self.hijoDerecho\n self.hijoDerecho.padre = self.padre\n\n def encontrarMin(self):\n actual = self\n while actual.tieneHijoIzquierdo():\n actual = actual.hijoIzquierdo\n return actual\n\n def __iter__(self):\n if self:\n \t if self.tieneHijoIzquierdo():\n \t for elem in self.hijoIzquierdo:\n \t\t yield elem\n yield self.clave\n \t if self.tieneHijoDerecho():\n for elem in self.hijoDerecho:\n \t\t yield elem\n","src/lib/pythoned/arboles/arbolBinario.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n# \n#arbolBinario.py\n\nclass ArbolBinario:\n def __init__(self,objetoRaiz):\n self.clave = objetoRaiz\n self.hijoIzquierdo = None\n self.hijoDerecho = None\n \n def insertarIzquierdo(self,nuevoNodo):\n if self.hijoIzquierdo == None:\n self.hijoIzquierdo = ArbolBinario(nuevoNodo)\n else: \n t = ArbolBinario(nuevoNodo)\n t.hijoIzquierdo = self.hijoIzquierdo\n self.hijoIzquierdo = t\n\n def insertarDerecho(self,nuevoNodo):\n if self.hijoDerecho == None:\n self.hijoDerecho = ArbolBinario(nuevoNodo)\n else:\n t = ArbolBinario(nuevoNodo)\n t.hijoDerecho = self.hijoDerecho\n self.hijoDerecho = t\n\n def esHoja(self):\n return ((not self.hijoIzquierdo) and (not self.hijoDerecho))\n\n def obtenerHijoDerecho(self):\n return self.hijoDerecho\n \n def obtenerHijoIzquierdo(self):\n return self.hijoIzquierdo\n \n def asignarValorRaiz(self,obj):\n self.clave = obj\n\n def obtenerValorRaiz(self):\n return self.clave\n\n def inorden(self):\n if self.hijoIzquierdo:\n self.hijoIzquierdo.inorden()\n print(self.clave)\n if self.hijoDerecho:\n self.hijoDerecho.inorden()\n\n def postorden(self):\n if self.hijoIzquierdo:\n self.hijoIzquierdo.postorden()\n if self.hijoDerecho:\n self.hijoDerecho.postorden()\n print(self.clave)\n\n def preorden(self):\n print(self.clave)\n if self.hijoIzquierdo:\n self.hijoIzquierdo.preorden()\n if self.hijoDerecho:\n self.hijoDerecho.preorden()\n\n def imprimirExpresion(self):\n if self.hijoIzquierdo:\n print('(', end=' ')\n self.hijoIzquierdo.imprimirExpresion()\n print(self.clave, end=' ')\n if self.hijoDerecho:\n self.hijoDerecho.imprimirExpresion()\n print(')', end=' ')\n\n def evalPostorden(self):\n opers = {'+':operator.add, '-':operator.sub, '*':operator.mul, '/':operator.truediv}\n res1 = None\n res2 = None\n if self.hijoIzquierdo:\n res1 = self.hijoIzquierdo.evalPostorden() #// \\label{peleft}\n if self.hijoDerecho:\n res2 = self.hijoDerecho.evalPostorden() #// \\label{peright}\n if res1 and res2:\n return opers[self.clave](res1,res2) #// \\label{peeval}\n else:\n return self.clave\n\ndef inorden(arbol):\n if arbol != None:\n inorden(arbol.obtenerHijoIzquierdo())\n print(arbol.obtenerValorRaiz())\n inorden(arbol.obtenerHijoDerecho())\n\ndef imprimirExpresion(arbol):\n if arbol.hijoIzquierdo:\n print('(', end=' ')\n imprimirExpresion(arbol.obtenerHijoIzquierdo())\n print(arbol.obtenerValorRaiz(), end=' ')\n if arbol.hijoDerecho:\n imprimirExpresion(arbol.obtenerHijoDerecho())\n print(')', end=' ') \n\ndef imprimirExpresion(arbol):\n valorCadena = \"\"\n if arbol:\n valorCadena = '(' + imprimirExpresion(arbol.obtenerHijoIzquierdo())\n valorCadena = valorCadena + str(arbol.obtenerValorRaiz())\n valorCadena = valorCadena + imprimirExpresion(arbol.obtenerHijoDerecho())+')'\n return valorCadena\n\ndef evalPostorden(arbol):\n operadores = {'+':operator.add, '-':operator.sub, '*':operator.mul, '/':operator.truediv}\n res1 = None\n res2 = None\n if arbol:\n res1 = evalPostorden(arbol.obtenerHijoIzquierdo()) #// \\label{peleft}\n res2 = evalPostorden(arbol.obtenerHijoDerecho()) #// \\label{peright}\n if res1 and res2:\n return operadores[arbol.obtenerValorRaiz()](res1,res2) #// \\label{peeval}\n else:\n return arbol.obtenerValorRaiz()\n\ndef altura(arbol):\n if arbol == None:\n return -1\n else:\n return 1 + max(altura(arbol.hijoIzquierdo),altura(arbol.hijoDerecho))\n\nt = ArbolBinario(7)\nt.insertarIzquierdo(3)\nt.insertarDerecho(9)\ninorden(t)\nimport operator\nx = ArbolBinario('*')\nx.insertarIzquierdo('+')\nl = x.obtenerHijoIzquierdo()\nl.insertarIzquierdo(4)\nl.insertarDerecho(5)\nx.insertarDerecho(7)\nprint(imprimirExpresion(x))\nprint(evalPostorden(x))\nprint(altura(x))\n","src/lib/pythoned/arboles/avl.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n#\n#avl.py\n\nfrom .abb import ArbolBinarioBusqueda, NodoArbol\n\nclass ArbolAVL(ArbolBinarioBusqueda):\n\n def _agregar(self,clave,valor,nodoActual):\n \tif clave < nodoActual.clave:\n \t if nodoActual.tieneHijoIzquierdo():\n \t\tself._agregar(clave,valor,nodoActual.hijoIzquierdo)\n \t else:\n \t\tnodoActual.hijoIzquierdo = NodoArbol(clave,valor,padre=nodoActual)\n \t\tself.actualizarEquilibrio(nodoActual.hijoIzquierdo)\n \telse:\n \t if nodoActual.tieneHijoDerecho():\n \t\tself._agregar(clave,valor,nodoActual.hijoDerecho)\n \t else:\n \t\tnodoActual.hijoDerecho = NodoArbol(clave,valor,padre=nodoActual)\n \t\tself.actualizarEquilibrio(nodoActual.hijoDerecho)\n\n def actualizarEquilibrio(self,nodo):\n \tif nodo.factorEquilibrio > 1 or nodo.factorEquilibrio < -1:\n \t self.reequilibrar(nodo) \n \t return\n \tif nodo.padre != None:\n \t if nodo.esHijoIzquierdo():\n \t\t nodo.padre.factorEquilibrio += 1\n \t elif nodo.esHijoDerecho():\n \t\t nodo.padre.factorEquilibrio -= 1\n\n \t if nodo.padre.factorEquilibrio != 0:\n \t\t self.actualizarEquilibrio(nodo.padre)\n\n def reequilibrar(self,nodo):\n if nodo.factorEquilibrio < 0:\n\t if nodo.hijoDerecho.factorEquilibrio > 0:\n\t self.rotarDerecha(nodo.hijoDerecho)\n\t self.rotarIzquierda(nodo)\n\t else:\n\t self.rotarIzquierda(nodo)\n elif nodo.factorEquilibrio > 0:\n\t if nodo.hijoIzquierdo.factorEquilibrio < 0:\n\t self.rotarIzquierda(nodo.hijoIzquierdo)\n\t self.rotarDerecha(nodo)\n\t else:\n\t self.rotarDerecha(nodo)\n \n def rotarIzquierda(self,rotRaiz):\n \tnuevaRaiz = rotRaiz.hijoDerecho\n \trotRaiz.hijoDerecho = nuevaRaiz.hijoIzquierdo\n \tif nuevaRaiz.hijoIzquierdo != None:\n \t nuevaRaiz.hijoIzquierdo.padre = rotRaiz\n \tnuevaRaiz.padre = rotRaiz.padre\n \tif rotRaiz.esRaiz():\n \t self.raiz = nuevaRaiz\n \telse:\n \t if rotRaiz.esHijoIzquierdo():\n \t rotRaiz.padre.hijoIzquierdo = nuevaRaiz\n \t else:\n \t \trotRaiz.padre.hijoDerecho = nuevaRaiz\n \tnuevaRaiz.hijoIzquierdo = rotRaiz\n \trotRaiz.padre = nuevaRaiz\n \trotRaiz.factorEquilibrio = rotRaiz.factorEquilibrio + 1 - min(nuevaRaiz.factorEquilibrio, 0)\n \tnuevaRaiz.factorEquilibrio = nuevaRaiz.factorEquilibrio + 1 + max(rotRaiz.factorEquilibrio, 0)\n\n def rotarDerecha(self,rotRaiz):\n nuevaRaiz = rotRaiz.hijoIzquierdo\n rotRaiz.hijoIzquierdo = nuevaRaiz.hijoDerecho\n if nuevaRaiz.hijoDerecho != None:\n nuevaRaiz.hijoDerecho.padre = rotRaiz\n nuevaRaiz.padre = rotRaiz.padre\n if rotRaiz.esRaiz():\n self.raiz = nuevaRaiz\n else:\n if rotRaiz.esHijoDerecho():\n rotRaiz.padre.hijoDerecho = nuevaRaiz\n else:\n rotRaiz.padre.hijoIzquierdo = nuevaRaiz\n nuevaRaiz.hijoDerecho = rotRaiz\n rotRaiz.padre = nuevaRaiz\n rotRaiz.factorEquilibrio = rotRaiz.factorEquilibrio - 1 - max(nuevaRaiz.factorEquilibrio, 0)\n nuevaRaiz.factorEquilibrio = nuevaRaiz.factorEquilibrio - 1 + min(rotRaiz.factorEquilibrio, 0) \n\n","src/lib/pythoned/arboles/monticuloBinario.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n# \n#monticuloBinario.py\n\nclass MonticuloBinario:\n def __init__(self):\n self.listaMonticulo = [0]\n self.tamanoActual = 0\n\n def construirMonticulo(self,unaLista):\n i = len(unaLista) // 2\n self.tamanoActual = len(unaLista)\n self.listaMonticulo = [0] + unaLista[:]\n print(len(self.listaMonticulo), i)\n while (i > 0):\n print(self.listaMonticulo, i)\n self.infiltAbajo(i)\n i = i - 1\n print(self.listaMonticulo,i)\n \n def infiltAbajo(self,i):\n while (i * 2) <= self.tamanoActual:\n hm = self.hijoMin(i)\n if self.listaMonticulo[i] > self.listaMonticulo[hm]:\n tmp = self.listaMonticulo[i]\n self.listaMonticulo[i] = self.listaMonticulo[hm]\n self.listaMonticulo[hm] = tmp\n i = hm\n \n def hijoMin(self,i):\n if i * 2 + 1 > self.tamanoActual:\n return i * 2\n else:\n if self.listaMonticulo[i * 2] < self.listaMonticulo[i * 2 + 1]:\n return i * 2\n else:\n return i * 2 + 1\n\n def infiltArriba(self,i):\n while i // 2 > 0:\n if self.listaMonticulo[i] < self.listaMonticulo[i//2]:\n tmp = self.listaMonticulo[i // 2]\n self.listaMonticulo[i // 2] = self.listaMonticulo[i]\n self.listaMonticulo[i] = tmp\n i = i // 2\n \n def insertar(self,k):\n self.listaMonticulo.append(k)\n self.tamanoActual = self.tamanoActual + 1\n self.infiltArriba(self.tamanoActual)\n\n def eliminarMin(self):\n valorSacado = self.listaMonticulo[1]\n self.listaMonticulo[1] = self.listaMonticulo[self.tamanoActual]\n self.tamanoActual = self.tamanoActual - 1\n self.listaMonticulo.pop()\n self.infiltAbajo(1)\n return valorSacado\n \n def estaVacio(self):\n if tamanoActual == 0:\n return True\n else:\n return False\n","src/lib/pythoned/basicas/__init__.py":'\n#__all__ = ["pila"]\n\n\nfrom .pila import Pila\nfrom .cola import Cola\nfrom .coladoble import ColaDoble\n\n\n',"src/lib/pythoned/basicas/cola.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n#\n#cola.py\n\nclass Cola:\n def __init__(self):\n self.items = []\n\n def estaVacia(self):\n return self.items == []\n\n def agregar(self, item):\n self.items.insert(0,item)\n\n def avanzar(self):\n return self.items.pop()\n\n def tamano(self):\n return len(self.items)\n","src/lib/pythoned/basicas/coladoble.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n# \n#coladoble.py\n\nclass ColaDoble:\n def __init__(self):\n self.items = []\n\n def estaVacia(self):\n return self.items == []\n\n def agregarFrente(self, item):\n self.items.append(item)\n\n def agregarFinal(self, item):\n self.items.insert(0,item)\n\n def removerFrente(self):\n return self.items.pop()\n\n def removerFinal(self):\n return self.items.pop(0)\n\n def tamano(self):\n return len(self.items)\n","src/lib/pythoned/basicas/pila.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n# \n#pila.py\n\nclass Pila:\n def __init__(self):\n self.items = []\n\n def estaVacia(self):\n return self.items == []\n\n def incluir(self, item):\n self.items.append(item)\n\n def extraer(self):\n return self.items.pop()\n\n def inspeccionar(self):\n return self.items[len(self.items)-1]\n\n def tamano(self):\n return len(self.items)\n","src/lib/pythoned/grafos/__init__.py":"\n\nfrom .grafoAdy import Grafo\nfrom .grafoAdy import Vertice\nfrom .colaPrioridad import ColaPrioridad\n","src/lib/pythoned/grafos/colaPrioridad.py":"# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n# \n#colaPrioridad.py\n\nclass ColaPrioridad:\n def __init__(self):\n self.arregloMonticulo = [(0,0)]\n self.tamanoActual = 0\n\n def construirMonticulo(self,unaLista):\n self.tamanoActual = len(unaLista)\n self.arregloMonticulo = [(0,0)]\n for i in unaLista:\n self.arregloMonticulo.append(i)\n i = len(unaLista) // 2 \n while (i > 0):\n self.infiltAbajo(i)\n i = i - 1\n \n def infiltAbajo(self,i):\n while (i * 2) <= self.tamanoActual:\n hm = self.hijoMin(i)\n if self.arregloMonticulo[i][0] > self.arregloMonticulo[hm][0]:\n tmp = self.arregloMonticulo[i]\n self.arregloMonticulo[i] = self.arregloMonticulo[hm]\n self.arregloMonticulo[hm] = tmp\n i = hm\n \n def hijoMin(self,i):\n if i*2 > self.tamanoActual:\n return -1\n else:\n if i*2 + 1 > self.tamanoActual:\n return i*2\n else:\n if self.arregloMonticulo[i*2][0] < self.arregloMonticulo[i*2+1][0]:\n return i*2\n else:\n return i*2+1\n\n def infiltArriba(self,i):\n while i // 2 > 0:\n if self.arregloMonticulo[i][0] < self.arregloMonticulo[i//2][0]:\n tmp = self.arregloMonticulo[i//2]\n self.arregloMonticulo[i//2] = self.arregloMonticulo[i]\n self.arregloMonticulo[i] = tmp\n i = i//2\n \n def insertar(self,k):\n self.arregloMonticulo.append(k)\n self.tamanoActual = self.tamanoActual + 1\n self.infiltArriba(self.tamanoActual)\n\n def eliminarMin(self):\n valorSacado = self.arregloMonticulo[1][1]\n self.arregloMonticulo[1] = self.arregloMonticulo[self.tamanoActual]\n self.tamanoActual = self.tamanoActual - 1\n self.arregloMonticulo.pop()\n self.infiltAbajo(1)\n return valorSacado\n \n def estaVacia(self):\n if self.tamanoActual == 0:\n return True\n else:\n return False\n\n def decrementarClave(self,valor,nuevo):\n hecho = False\n i = 1\n miClave = 0\n while not hecho and i <= self.tamanoActual:\n if self.arregloMonticulo[i][1] == valor:\n hecho = True\n miClave = i\n else:\n i = i + 1\n if miClave > 0:\n self.arregloMonticulo[miClave] = (nuevo,self.arregloMonticulo[miClave][1])\n self.infiltArriba(miClave)\n \n def __contains__(self,vertice):\n for pareja in self.arregloMonticulo:\n if pareja[1] == vertice:\n return True\n return False \n\n","src/lib/pythoned/grafos/grafoAdy.py":'# Bradley N. Miller, David L. Ranum\n# Solución de problemas con algoritmos y estructuras de datos usando Python\n# Copyright 2014\n#\n#grafoAdy.py\n\n\nimport sys\n\nclass Grafo:\n def __init__(self):\n self.listaVertices = {}\n self.numVertices = 0\n \n def agregarVertice(self,clave):\n self.numVertices = self.numVertices + 1\n nuevoVertice = Vertice(clave)\n self.listaVertices[clave] = nuevoVertice\n return nuevoVertice\n \n def obtenerVertice(self,n):\n if n in self.listaVertices:\n return self.listaVertices[n]\n else:\n return None\n\n def __contains__(self,n):\n return n in self.listaVertices\n \n def agregarArista(self,de,a,costo=0):\n if de not in self.listaVertices:\n nv = self.agregarVertice(de)\n if a not in self.listaVertices:\n nv = self.agregarVertice(a)\n self.listaVertices[de].agregarVecino(self.listaVertices[a],costo)\n \n def obtenerVertices(self):\n return list(self.listaVertices.keys())\n \n def __iter__(self):\n return iter(self.listaVertices.values())\n \nclass Vertice:\n def __init__(self,clave):\n self.id = clave\n self.conectadoA = {}\n self.color = \'blanco\'\n self.dist = sys.maxsize\n self.predecesor = None\n self.desc = 0\n self.fin = 0\n\n # def __lt__(self,o):\n # return self.id < o.id\n \n def agregarVecino(self,vecino,ponderacion=0):\n self.conectadoA[vecino] = ponderacion\n \n def asignarColor(self,color):\n self.color = color\n \n def asignarDistancia(self,d):\n self.dist = d\n\n def asignarPredecesor(self,p):\n self.predecesor = p\n\n def asignarDescubrimiento(self,tiempoDescubrimiento):\n self.desc = tiempoDescubrimiento\n \n def asignarFinalizacion(self,tiempoFinalizacion):\n self.fin = tiempoFinalizacion\n \n def obtenerFinalizacion(self):\n return self.fin\n \n def obtenerDescubrimiento(self):\n return self.desc\n \n def obtenerPredecesor(self):\n return self.predecesor\n \n def obtenerDistancia(self):\n return self.dist\n \n def obtenerColor(self):\n return self.color\n \n def obtenerConexiones(self):\n return self.conectadoA.keys()\n \n def obtenerPonderacion(self,vecino):\n return self.conectadoA[vecino]\n \n def __str__(self):\n return str(self.id) + ":color " + self.color + ":desc " + str(self.desc) + ":fin " + str(self.fin) + ":distancia " + str(self.dist) + ":predecesor \\n\\t[" + str(self.predecesor)+ "]\\n"\n \n def obtenerId(self):\n return self.id\n',"src/lib/quopri.py":'import _sk_fail; _sk_fail._("quopri")\n',"src/lib/random.py":"from _random import *\nfrom math import floor as _floor, isfinite as _isfinite\nfrom itertools import accumulate as _accumulate, repeat as _repeat\nfrom bisect import bisect as _bisect\n\ndef choices(population, weights=None, *, cum_weights=None, k=1):\n '''Return a k sized list of population elements chosen with replacement.\n\n If the relative weights or cumulative weights are not specified,\n the selections are made with equal probability.\n\n '''\n n = len(population)\n if cum_weights is None:\n if weights is None:\n floor = _floor\n n += 0.0 # convert to float for a small speed improvement\n return [population[floor(random() * n)] for i in _repeat(None, k)]\n try:\n cum_weights = list(_accumulate(weights))\n except TypeError:\n if not isinstance(weights, int):\n raise\n k = weights\n raise TypeError(\n 'The number of choices must be a keyword argument: k=' + k\n )\n elif weights is not None:\n raise TypeError('Cannot specify both weights and cumulative weights')\n if len(cum_weights) != n:\n raise ValueError('The number of weights does not match the population')\n total = cum_weights[-1] + 0.0 # convert to float\n if total <= 0.0:\n raise ValueError('Total of weights must be greater than zero')\n if not _isfinite(total):\n raise ValueError('Total of weights must be finite')\n bisect = _bisect\n hi = n - 1\n return [population[bisect(cum_weights, random() * total, 0, hi)]\n for i in _repeat(None, k)]","src/lib/repr.py":'import _sk_fail; _sk_fail._("repr")\n',"src/lib/requests.py":'# most restricted version\n"""\nThis solution works in runestone - however it is much more limited.\nAn error does not occur in the same way in the textbook as it does\nfor the command line. Since HTTPError is not currently available in\nRunestone, I had to change the exception.\nDecode and Encode are not available in Runestone, so there might be\nissues with reponses.\nDoes not use the status attribute for urlopen, would be nice to have\nthat back.\nDoes not work on regular web pages (like google or the michigan daily) because of cross-site scripting limits.\n"""\nfrom urllib.request import urlopen\nimport json\n\nclass Response:\n def __init__(self, data, url):\n self.text = data\n self.url = url\n\n def json(self):\n try:\n return json.loads(self.text)\n except:\n return {"error": "Response not interpretable as json. Try printing the .text attribute"}\n\n def __str__(self):\n return "".format(self.url)\n\n\nurl_subs = {" ": "+",\n "!": "%21",\n \'"\': "%22",\n "#": "%23",\n "$": "%24",\n "\'": "%27",\n "(": "%28",\n ")": "%29",\n "*": "%2A",\n "+": "%2B",\n ",": "%2C",\n "/": "%2F",\n ":": "%3A",\n ";": "%3B",\n "=": "%3D",\n "?": "%3F",\n "@": "%40",\n "[": "%5B",\n "]": "%5D",\n }\n\ndef _subst(s, substitutions=url_subs):\n res = ""\n for c in str(s):\n if c in substitutions:\n res += substitutions[c]\n else:\n res += c\n return res\n\n\ndef requestURL(baseurl, params={}):\n try:\n if len(params) == 0:\n return baseurl\n complete_url = baseurl + "?"\n pairs = ["{}={}".format(_subst(k), _subst(params[k])) for k in params]\n complete_url += "&".join(pairs)\n return complete_url\n except:\n return None\n\ndef get(baseurl, params={}):\n full_url = requestURL(baseurl, params)\n if not full_url:\n text_data = "
"},e=\'This page requires a browser that supports WebGL. Click here to upgrade your browser.\';return t.Context=Sk.misceval.buildClass(t,(function(n,t){t.__init__=new Sk.builtin.func((function(n,t){var i=document.getElementById(t.v),r=function(n,t){var i=document.getElementById(n);if(t||(t=i.getElementsByTagName("canvas")[0]),t){var r=function(n){for(var t=["webgl","experimental-webgl","webkit-3d","moz-webgl"],e=null,i=0;i7||7==a.Chrome[0]&&a.Chrome[1]>0||7==a.Chrome[0]&&0==a.Chrome[1]&&a.Chrome[2]>=521)?i.innerHTML=makeFailHTML(\'It doesn\\\'t appear your computer can support WebGL. Click here for more information.\'):i.innerHTML=makeFailHTML(e)}return r}i.innerHTML=makeFailHTML(e)}(t.v,i);if(!r)throw new Error("Your browser does not appear to support WebGL.");for(var u in n.gl=r,r.__proto__)if("number"==typeof r.__proto__[u])Sk.abstr.objectSetItem(n.$d,new Sk.builtin.str(u),r.__proto__[u]);else if("function"==typeof r.__proto__[u])switch(u){case"bufferData":case"clearColor":case"drawArrays":case"getAttribLocation":case"getUniformLocation":case"shaderSource":case"uniformMatrix4fv":case"vertexAttribPointer":case"viewport":break;default:!function(t){Sk.abstr.objectSetItem(n.$d,new Sk.builtin.str(u),new Sk.builtin.func((function(){return r.__proto__[t].apply(r,arguments)})))}(u)}r.clearColor(100/255,149/255,237/255,1),r.clear(r.COLOR_BUFFER_BIT)})),t.tp$getattr=Sk.generic.getAttr,t.bufferData=new Sk.builtin.func((function(n,t,e,i){n.gl.bufferData(t,e.v,i)})),t.clearColor=new Sk.builtin.func((function(n,t,e,i,r){n.gl.clearColor(Sk.builtin.asnum$(t),Sk.builtin.asnum$(e),Sk.builtin.asnum$(i),Sk.builtin.asnum$(r))})),t.getAttribLocation=new Sk.builtin.func((function(n,t,e){return n.gl.getAttribLocation(t,e.v)})),t.getUniformLocation=new Sk.builtin.func((function(n,t,e){return n.gl.getUniformLocation(t,e.v)})),t.shaderSource=new Sk.builtin.func((function(n,t,e){n.gl.shaderSource(t,e.v)})),t.drawArrays=new Sk.builtin.func((function(n,t,e,i){n.gl.drawArrays(Sk.builtin.asnum$(t),Sk.builtin.asnum$(e),Sk.builtin.asnum$(i))})),t.vertexAttribPointer=new Sk.builtin.func((function(n,t,e,i,r,u,a){n.gl.vertexAttribPointer(t,Sk.builtin.asnum$(e),Sk.builtin.asnum$(i),r,Sk.builtin.asnum$(u),Sk.builtin.asnum$(a))})),t.viewport=new Sk.builtin.func((function(n,t,e,i,r){n.gl.viewport(Sk.builtin.asnum$(t),Sk.builtin.asnum$(e),Sk.builtin.asnum$(i),Sk.builtin.asnum$(r))})),t.uniformMatrix4fv=new Sk.builtin.func((function(n,t,e,i){n.gl.uniformMatrix4fv(Sk.builtin.asnum$(t),e,i.v)})),t.setDrawFunc=new Sk.builtin.func((function(n,t){var e=(new Date).getTime();setInterval((function(){Sk.misceval.callsimArray(t,[n,(new Date).getTime()-e])}),1e3/60)}))}),"Context",[]),t.Float32Array=Sk.misceval.buildClass(t,(function(n,t){t.__init__=new Sk.builtin.func((function(n,t){n.v="number"==typeof t?new Float32Array(t):new Float32Array(Sk.ffi.remapToJs(t))})),t.__repr__=new Sk.builtin.func((function(n){for(var t=[],e=0;e0&&(i=(l/=v)*l,a=(s/=v)*s,c=(m/=v)*m,u=l*s,r=s*m,f=m*l,o=l*_,k=s*_,S=m*_,y=1-w,(b=Sk.misceval.callsimArray(n.Mat44)).elements[0]=y*i+w,b.elements[1]=y*u-S,b.elements[2]=y*f+k,b.elements[3]=0,b.elements[4]=y*u+S,b.elements[5]=y*a+w,b.elements[6]=y*r-o,b.elements[7]=0,b.elements[8]=y*f-k,b.elements[9]=y*r+o,b.elements[10]=y*c+w,b.elements[11]=0,b.elements[12]=0,b.elements[13]=0,b.elements[14]=0,b.elements[15]=1,b=b.multiply(e),e.elements=b.elements);return e})),t.multiply=new Sk.builtin.func((function(e,t){for(var l=Sk.misceval.callsimArray(n.Mat44),s=0;s<4;s++)l.elements[4*s+0]=e.elements[4*s+0]*t.elements[0]+e.elements[4*s+1]*t.elements[4]+e.elements[4*s+2]*t.elements[8]+e.elements[4*s+3]*t.elements[12],l.elements[4*s+1]=e.elements[4*s+0]*t.elements[1]+e.elements[4*s+1]*t.elements[5]+e.elements[4*s+2]*t.elements[9]+e.elements[4*s+3]*t.elements[13],l.elements[4*s+2]=e.elements[4*s+0]*t.elements[2]+e.elements[4*s+1]*t.elements[6]+e.elements[4*s+2]*t.elements[10]+e.elements[4*s+3]*t.elements[14],l.elements[4*s+3]=e.elements[4*s+0]*t.elements[3]+e.elements[4*s+1]*t.elements[7]+e.elements[4*s+2]*t.elements[11]+e.elements[4*s+3]*t.elements[15];return e.elements=l.elements,e})),t.lookAt=new Sk.builtin.func((function(e,t,l,s,m,i,a,c,u,r){var f=[t-m,l-i,s-a],o=Math.sqrt(f[0]*f[0]+f[1]*f[1]+f[2]*f[2]);o&&(f[0]/=o,f[1]/=o,f[2]/=o);var k=[c,u,r],S=[];S[0]=k[1]*f[2]-k[2]*f[1],S[1]=-k[0]*f[2]+k[2]*f[0],S[2]=k[0]*f[1]-k[1]*f[0],k[0]=f[1]*S[2]-f[2]*S[1],k[1]=-f[0]*S[2]+f[2]*S[0],k[2]=f[0]*S[1]-f[1]*S[0],(o=Math.sqrt(S[0]*S[0]+S[1]*S[1]+S[2]*S[2]))&&(S[0]/=o,S[1]/=o,S[2]/=o),(o=Math.sqrt(k[0]*k[0]+k[1]*k[1]+k[2]*k[2]))&&(k[0]/=o,k[1]/=o,k[2]/=o);var y=Sk.misceval.callsimArray(n.Mat44);return y.elements[0]=S[0],y.elements[4]=S[1],y.elements[8]=S[2],y.elements[12]=0,y.elements[1]=k[0],y.elements[5]=k[1],y.elements[9]=k[2],y.elements[13]=0,y.elements[2]=f[0],y.elements[6]=f[1],y.elements[10]=f[2],y.elements[14]=0,y.elements[3]=0,y.elements[7]=0,y.elements[11]=0,y.elements[15]=1,y=y.multiply(e),e.elements=y.elements,e.translate(-t,-l,-s),e}))}),"Mat44",[]),n.Mat33=Sk.misceval.buildClass(n,(function(e,n){n.__init__=new Sk.builtin.func((function(e){Sk.misceval.callsimArray(n.loadIdentity,[e])})),n.loadIdentity=new Sk.builtin.func((function(e){e.elements=[1,0,0,0,1,0,0,0,1]}))}),"Mat33",[]),n.Vec3=Sk.misceval.buildClass(n,(function(e,t){t.__init__=new Sk.builtin.func((function(e,n,t,l){e.x=n,e.y=t,e.z=l})),t.__sub__=new Sk.builtin.func((function(e,t){return Sk.misceval.callsimArray(n.Vec3,[e.x-t.x,e.y-t.y,e.z-t.z])}))}),"Vec3",[]),n.cross=new Sk.builtin.func((function(e,t){return Sk.asserts.assert(e instanceof n.Vec3&&t instanceof n.Vec3),Sk.misceval.callsimArray(n.Vec3,[e.y*t.z-e.z*t.y,e.z*t.x-e.x*t.z,e.x*t.y-e.y*t.x])})),n};',"src/lib/webgl/matrix4.js":"var $builtinmodule=function(n){var r={},t=new Float32Array(3),a=new Float32Array(3),u=new Float32Array(3),e=(new Float32Array(4),new Float32Array(4),new Float32Array(4),new Float32Array(16),new Float32Array(16),new Float32Array(16),function(n,r){for(var t=0,a=r.length,u=0;u1e-5)for(u=0;u{const n=e.$d;var r={},Buffer=function(t,e){var r=e||n.ARRAY_BUFFER,i=n.createBuffer();if(this.target=r,this.buf=i,this.set(t),this.numComponents_=t.numComponents,this.numElements_=t.numElements,this.totalComponents_=this.numComponents_*this.numElements_,t.buffer instanceof Float32Array)this.type_=n.FLOAT;else if(t.buffer instanceof Uint8Array)this.type_=n.UNSIGNED_BYTE;else if(t.buffer instanceof Int8Array)this.type_=n._BYTE;else if(t.buffer instanceof Uint16Array)this.type_=n.UNSIGNED_SHORT;else{if(!(t.buffer instanceof Int16Array))throw"unhandled type:"+typeof t.buffer;this.type_=n.SHORT}};return Buffer.prototype.set=function(t){n.bindBuffer(this.target,this.buf),n.bufferData(this.target,t.buffer,n.STATIC_DRAW)},Buffer.prototype.type=function(){return this.type_},Buffer.prototype.numComponents=function(){return this.numComponents_},Buffer.prototype.numElements=function(){return this.numElements_},Buffer.prototype.totalComponents=function(){return this.totalComponents_},Buffer.prototype.buffer=function(){return this.buf},Buffer.prototype.stride=function(){return 0},Buffer.prototype.offset=function(){return 0},r.Model=Sk.misceval.buildClass(r,(function(e,r){r.__init__=new Sk.builtin.func((function(e,r,i,f){e.buffers={};var setBuffer=function(t,r){var i="indices"==t?n.ELEMENT_ARRAY_BUFFER:n.ARRAY_BUFFER;let f=e.buffers[t];f?f.set(r):f=new Buffer(r,i),e.buffers[t]=f};for(t in i)setBuffer(t,i[t]);var o={},s=0;for(var u in f)o[u]=s++;e.mode=n.TRIANGLES,e.textures=f.v,e.textureUnits=o,e.shader=r})),r.drawPrep=new Sk.builtin.func((function(t,e){var r=t.shader,i=t.buffers,f=t.textures;for(var o in e=Sk.ffi.remapToJs(e),Sk.misceval.callsimArray(r.use,[r]),i){var s=i[o];if("indices"==o)n.bindBuffer(n.ELEMENT_ARRAY_BUFFER,s.buffer());else{var u=r.attrib[o];u&&u(s)}}for(var a in f){var m=t.textureUnits[a];r.setUniform$impl(r,f,m),f[a].bindToUnit(m)}for(var p in e)r.setUniform$impl(r,p,e[p])})),r.draw=new Sk.builtin.func((function(t,e,r){var i=t.shader;e=Sk.ffi.remapToJs(e);for(let n in e)i.setUniform$impl(i,n,e[n]);if(r)for(var f in r){var o=t.textureUnits[f];i.setUniform$impl(i,f,o),r[f].bindToUnit(o)}var s=t.buffers;n.drawElements(t.mode,s.indices.totalComponents(),n.UNSIGNED_SHORT,0)}))}),"Model",[]),r}))};',"src/lib/webgl/primitives.js":'var $builtinmodule=function(t){var n={},AttribBuffer=function(t,n,e){e=e||"Float32Array";var r=window[e];n.length?(this.buffer=new r(n),n=this.buffer.length/t,this.cursor=n):(this.buffer=new r(t*n),this.cursor=0),this.numComponents=t,this.numElements=n,this.type=e};return AttribBuffer.prototype.stride=function(){return 0},AttribBuffer.prototype.offset=function(){return 0},AttribBuffer.prototype.getElement=function(t){for(var n=t*this.numComponents,e=[],r=0;r{"use strict";__webpack_require__.d(__webpack_exports__,{A:()=>JSActiveCode});var _activecode_js__WEBPACK_IMPORTED_MODULE_0__=__webpack_require__(54215);class JSActiveCode extends _activecode_js__WEBPACK_IMPORTED_MODULE_0__.K{constructor(e){super(e)}outputfun(e){$(this.output).css("visibility","visible");var t="[";if("object"==typeof e&&e.length)for(var n=0;n"};this.saveCode=await this.manage_scrubber(saveCode),$(this.eContainer).remove(),$(this.output).text(""),$(this.outDiv).show({duration:700,queue:!1});try{eval(prog),this.errinfo="success"}catch(e){this.addErrorMessage(e),this.errinfo=e}}addErrorMessage(e){this.errLastRun=!0;var t=$("
").html("Error");this.eContainer=this.outerDiv.appendChild(document.createElement("div")),this.eContainer.setAttribute("aria-live","polite"),this.eContainer.setAttribute("aria-atomic","true"),this.eContainer.setAttribute("role","log"),this.eContainer.className="error alert alert-danger",this.eContainer.id=this.divid+"_errinfo",this.eContainer.appendChild(t[0]);var n=this.eContainer.appendChild(document.createElement("pre")),i=e.toString();setTimeout((()=>{n.innerHTML=i}),10),console.log("Runtime Error: "+e.toString())}}},30691:(e,t,n)=>{"use strict";n.d(t,{A:()=>i});class i{constructor(e,t){const n="===============================================================================";let i,r,s,o=e.split(n);o.length>2?(i=o[0],r=o[1],s=o[2]):(i=o[0],r="",s=o[1]);let a="\n",l=i.split("\n").slice(2);a="Program output:\n";for(let e of l)a+=e+"\n";if(a+=n+"\n",""!=r.trim()){let e=r.split("\n");a+="Test messages:";for(let t of e)a+=t+"\n";a+=n+"\n"}let u=s.split("\n");a+="Test results:";for(let e of u)a+=e+"\n";a=a.trim(),this.stdout=a;let c=new RegExp("\\[doctest\\] assertions: (?\\d+?) \\| (?\\d+?) passed \\| (?\\d+?) failed","g"),d=[...s.matchAll(c)];if(d.length>0){let e=d[0];this.pct=100*e.groups.passed/e.groups.tests;let n=document.createElement("span");n.innerHTML=e[0].replace("[doctest] ",""),this.pctString=n,this.passed=parseInt(e.groups.passed),this.failed=parseInt(e.groups.failed);let i=document.createElement("div");i.classList.add("unittest-results");let r=document.createElement("table");r.classList.add("ac-feedback"),i.appendChild(r),i.setAttribute("id",`${t}_unit_results`);let s=document.createElement("tr");s.innerHTML=`
Result
${$.i18n("msg_activecode_assertions_checked")}
Passed:
Failed:
`,r.appendChild(s);let o=document.createElement("tr"),a=document.createElement("td");a.classList.add("ac-feedback"),100==this.pct?(a.innerHTML=$.i18n("msg_activecode_passed"),a.classList.add("ac-feedback-pass")):(a.innerHTML=$.i18n("msg_activecode_failed"),a.classList.add("ac-feedback-fail")),o.appendChild(a),r.appendChild(o),a=document.createElement("td"),a.innerHTML=this.passed+this.failed,a.classList.add("ac-feedback"),o.appendChild(a),a=document.createElement("td"),a.innerHTML=this.passed,a.classList.add("ac-feedback"),o.appendChild(a),a=document.createElement("td"),a.innerHTML=this.failed,a.classList.add("ac-feedback"),o.appendChild(a),r.appendChild(o),this.table=i}}}},32756:()=>{$.i18n().load({"pt-br":{msg_activecode_load_history:"Carregar histórico",msg_activecode_audio_tour:"Tour de áudio",msg_activecode_loaded_code:"Código salvo carregado.",msg_activecode_no_saved_code:"Não há código salvo.",msg_activecode_run_code:"Executar",msg_activecode_show_feedback:"Exibir Feedbacks",msg_activecode_show_code:"Mostrar Código",msg_activecode_hide_code:"Ocultar Código",msg_activecode_show_codelens:"Mostrar CodeLens",msg_activecode_show_in_codelens:"Mostrar em CodeLens",msg_activecode_hide_codelens:"Ocultar Codelens",msg_activecode_reformat:"Reformatar",msg_activecode_parse_error:"Um erro de Parse significa que Python não entende a sintaxe da linha que a mensagem de erro aponta. Exemplos comuns são esquecer vírgulas entre argumentos ou esquecer ':' em um comando for.",msg_activecode_parse_error_fix:"Para corrigir um erro de Parse, você só precisa olhar cuidadosamente a linha com o erro e possivelmente a linha antes dela. Tenha certeza que estão de acordo com todas as regras de Python.",msg_activecode_type_error:"Erros de tipagem ocorrem mais frequentemente quando uma expressão tenta combinar dois objetos com tipos que não deveriam ser combinados. Como elevar uma String a uma potência.",msg_activecode_type_error_fix:"Para corrigir um erro de tipagem você provavelmente precisará percorrer seu código e ter certeza de que as variáveis possuem os tipos que você espera que elas tenham. Pode ser útil imprimir cada variável ao longo do caminho para checar se elas possuem o valor que você acha que deveriam ter.",msg_activecode_name_error:"Um erro de nome quase sempre significa que você usou uma variável antes dela ter um valor. Frequentemente isso pode ser um erro de digitação, então cheque a ortografia cuidadosamente.",msg_activecode_name_error_fix:"Cheque o lado direito das atribuições e suas chamadas de funções, são os lugares mais prováveis de encontrar um erro de nome.",msg_activecode_value_error:"Um erro de valor ocorre mais frequentemente quando uma função está esperando um tipo mas você passa um parâmetro de outro tipo.",msg_activecode_value_error_fix:"A mensagem de erro te dá uma boa dica sobre o nome da função e o valor incorreto. Leia atentamente a mensagem de erro e volte à variável que contém o valor problemático.",msg_activecode_attribute_error:"Essa mensagem de erro está te dizendo que o objeto do lado esquerdo do ponto não tem o atributo ou método do seu lado direito.",msg_activecode_attribute_error_fix:"A variante mais comum dessa mensagem é que o objeto indefinido não tem o atributo X. Isso diz que o objeto do lado esquerdo do ponto não é o que você pensa. Rastreie essa variável e imprima-a em vários lugares até descobrir onde ela se torna indefinida. Caso contrário, cheque se há erro de digitação no atributo do lado direito do ponto.",msg_activecode_token_error:"Na maioria das vezes este erro indica que você esqueceu de fechar um parênteses ou aspas.",msg_activecode_token_error_fix:"Cheque cada linha do seu programa e certifique-se de que todos os parênteses estão fechados.",msg_activecode_time_limit_error:"Seu programa está demorando muito. Os programas deste livro deveriam rodar em menos de 10 segundos. Isso provavelmente indica que seu programa está em um loop infinito.",msg_activecode_time_limit_error_fix:"Imprima mensagens em algumas linhas para descobrir se seu programa está em um loop infinito. Caso não esteja, você pode aumentar o tempo limite de execução com o comando sys.setExecutionLimit(ms)",msg_activecode_general_error:"Seu programa está demorando muito. Os programas deste livro deveriam rodar em menos de 30 segundos. Isso provavelmente indica que seu programa está em um loop infinito.",msg_activecode_general_error_fix:"Imprima mensagens em algumas linhas para descobrir se seu programa está em um loop infinito. Caso não esteja, você pode aumentar o tempo limite de execução com o comando sys.setExecutionLimit(ms)",msg_activecode_syntax_error:"Esta mensagem indica que Python não entendeu a sintaxe de um comando. Alguns exemplos são atribuição de um literal, ou uma chamada de função",msg_activecode_syntax_error_fix:"Cheque as atribuições de seu programa e certifique-se de que o lado esquerdo é uma variável, e não um literal ou função.",msg_activecode_key_error:"Esta mensagem indica que você está tentando acessar um elemento cuja chave não existe no dicionário.",msg_activecode_key_error_fix:"Você pode ter um erro de digitação no nome da sua chave. É uma boa prática checar se a chave existe usando um comando 'if (chave) in meu_dicionario'. Você também pode usar o comando 'meu_dicionario.get(chave, valorPadrão)' para obter o valor padrão ao invés de um erro caso a chave não exista.",msg_activecode_index_error:"Você está tentando acessar um índice além do final de uma string ou lista. Por exemplo, se sua lista possui 3 elementos nela e você tenta acessar o item na posição 3 ou mais.",msg_activecode_index_error_fix:"Lembre-se que o primeiro elemento de uma lista ou string está no índice 0, normalmente esta mensagem é exibida porque você errou o índice por 1. Em uma lista de tamanho 3, o último índice válido é 2",msg_activecode_uri_error:"",msg_activecode_uri_error_fix:"",msg_activecode_import_error:"Esta mensagem indica que você está tentando importar um módulo que não existe",msg_activecode_import_error_fix:"Um problema pode ser apenas um erro de digitação. Também pode ser que você está tentando importar um módulo que existe em Python 'real', mas não existe neste livro. Se este é o caso, por favor envie um pedido para ter esse módulo adicionado.",msg_activecode_reference_error:"Isso parece ser um erro interno, especialmente se a mensagem faz referência ao console.",msg_activecode_reference_error_fix:"Tente atualizar a página. Se o erro persistir, envie um relatório de bug junto com seu código",msg_activecode_zero_division_error:"Isso diz que você está tentando dividir por 0. Normalmente é porque o valor da variável no denominador de uma divisão tem o valor 0",msg_activecode_zero_division_error_fix:"Você pode proteger contra dividir por 0 com um comando 'if', ou você pode precisar reavaliar suas suposições sobre os valores das variáveis, pois um comando anterior pode ter inesperadamente atribuído o valor 0 a essa variável.",msg_activecode_range_error:"Esta mensagem quase sempre aparece na forma de 'Tamanho máximo da pilha de chamadas excedido'.",msg_activecode_range_error_fix:"Isso sempre ocorre quando uma função chama ela mesma. Provavelmente você não está fazendo isso de propósito, exceto no capítulo sobre recursão. Se você está nesse capítulo, então provavelmente ainda não identificou um bom caso base.",msg_activecode_internal_error:"Um erro interno pode significar que você desencadeou um bug no nosso Python",msg_activecode_internal_error_fix:"Reporte este erro como um bug, juntamente com seu código",msg_activecode_indentation_error:"Este erro ocorre quando você não indentou seu código devidamente. Isso é mais provável de ocorrer como parte de um comando if, for, while ou def.",msg_activecode_indentation_error_fix:"Cheque seus comandos if, def, for e while para ter certeza de que as linhas estão devidamente indentadas abaixo delas. Outra fonte deste erro é copiar e colar código em que você acidentalmente deixou restos de código que não pertencem mais ali.",msg_activecode_not_implemented_error:"Este erro ocorre quando você tenta usar uma função embutida de Python que não foi implementada nesta versão browser de Python.",msg_activecode_not_implemented_error_fix:"Por enquanto a única maneira de consertar isso é não usando a função. Podem haver soluções alternativas. Se você realmente precisa desta função embutida, envie-nos um relatório de bug e digac omo está tentando usar a função.",msg_activecode_file_not_found:"Arquivo não encontrado: '$1'",msg_activecode_no_file_or_dir:"[Erro nº 2] Arquivo ou diretório inexistente: '$1'",msg_activecode_starting:"Clique no botão de execução para começar $1",msg_activecode_playing:"Executando $1",msg_activecode_loading_audio:"Carregando áudio. Por favor, espere. Se o tour não começar logo, clique em 'Stop Tour' e tente novamente.",msg_activecode_pause_current_audio:"Pausar áudio atual",msg_activecode_pause_audio:"Pausar áudio",msg_activecode_play_paused_audio:"Reproduzir áudio pausado",msg_activecode_audio_paused:"$1 foi pausado. Clique no botão de execução para retomar o tour.",msg_activecode_input_prg:"Entrada para o programa",msg_activecode_were_compiling_err:"Houveram erros ao compilar seu código. Veja abaixo.",msg_activecode_time_limit_exc:"Limite de tempo excedido no seu programa",msg_activecode_server_err:"Um erro de servidor ocorreu",msg_activecode_compiling_running:"Compilando e executando seu código...",msg_activecode_server_comm_err:"Erro ao comunicar com o servidor.",msg_activecode_save_run:"Salvar & Executar",msg_activecode_render:"Salvar & Renderizar",msg_activecode_assertion_error:"Um erro de asserção ocorre quando python encontra um comando 'assert'. Python avalia a expressão do lado direito; se é verdadeira, o programa continua normalmente. Se é falsa, python gera um erro e para a execução.",msg_activecode_assertion_error_fix:"Cheque a expressão do lado direito de 'assert'. Essa expressão é falsa e é preciso verificar o motivo. Você pode querer imprimir cada parte da expressão e entender porque é falsa.",msg_activecode_load_db:"Carregando banco de dados..."}})},35358:(e,t,n)=>{var i={"./af":25177,"./af.js":25177,"./ar":61509,"./ar-dz":41488,"./ar-dz.js":41488,"./ar-kw":58676,"./ar-kw.js":58676,"./ar-ly":42353,"./ar-ly.js":42353,"./ar-ma":24496,"./ar-ma.js":24496,"./ar-sa":82682,"./ar-sa.js":82682,"./ar-tn":89756,"./ar-tn.js":89756,"./ar.js":61509,"./az":95533,"./az.js":95533,"./be":28959,"./be.js":28959,"./bg":47777,"./bg.js":47777,"./bm":54903,"./bm.js":54903,"./bn":61290,"./bn.js":61290,"./bo":31545,"./bo.js":31545,"./br":11470,"./br.js":11470,"./bs":44429,"./bs.js":44429,"./ca":7306,"./ca.js":7306,"./cs":56464,"./cs.js":56464,"./cv":73635,"./cv.js":73635,"./cy":64226,"./cy.js":64226,"./da":93601,"./da.js":93601,"./de":77853,"./de-at":26111,"./de-at.js":26111,"./de-ch":54697,"./de-ch.js":54697,"./de.js":77853,"./dv":60708,"./dv.js":60708,"./el":54691,"./el.js":54691,"./en-au":53872,"./en-au.js":53872,"./en-ca":28298,"./en-ca.js":28298,"./en-gb":56195,"./en-gb.js":56195,"./en-ie":66584,"./en-ie.js":66584,"./en-nz":79402,"./en-nz.js":79402,"./eo":32934,"./eo.js":32934,"./es":97650,"./es-do":20838,"./es-do.js":20838,"./es-us":56575,"./es-us.js":56575,"./es.js":97650,"./et":3035,"./et.js":3035,"./eu":3508,"./eu.js":3508,"./fa":119,"./fa.js":119,"./fi":90527,"./fi.js":90527,"./fo":52477,"./fo.js":52477,"./fr":85498,"./fr-ca":26435,"./fr-ca.js":26435,"./fr-ch":37892,"./fr-ch.js":37892,"./fr.js":85498,"./fy":37071,"./fy.js":37071,"./gd":70217,"./gd.js":70217,"./gl":77329,"./gl.js":77329,"./gom-latn":93383,"./gom-latn.js":93383,"./gu":95050,"./gu.js":95050,"./he":11713,"./he.js":11713,"./hi":43861,"./hi.js":43861,"./hr":26308,"./hr.js":26308,"./hu":90609,"./hu.js":90609,"./hy-am":17160,"./hy-am.js":17160,"./id":74063,"./id.js":74063,"./is":89374,"./is.js":89374,"./it":88383,"./it.js":88383,"./ja":23827,"./ja.js":23827,"./jv":89722,"./jv.js":89722,"./ka":41794,"./ka.js":41794,"./kk":27088,"./kk.js":27088,"./km":96870,"./km.js":96870,"./kn":84451,"./kn.js":84451,"./ko":63164,"./ko.js":63164,"./ky":78474,"./ky.js":78474,"./lb":79680,"./lb.js":79680,"./lo":15867,"./lo.js":15867,"./lt":45766,"./lt.js":45766,"./lv":69532,"./lv.js":69532,"./me":58076,"./me.js":58076,"./mi":41848,"./mi.js":41848,"./mk":30306,"./mk.js":30306,"./ml":73739,"./ml.js":73739,"./mr":86169,"./mr.js":86169,"./ms":73386,"./ms-my":92297,"./ms-my.js":92297,"./ms.js":73386,"./mt":77075,"./mt.js":77075,"./my":72264,"./my.js":72264,"./nb":22274,"./nb.js":22274,"./ne":8235,"./ne.js":8235,"./nl":92572,"./nl-be":43784,"./nl-be.js":43784,"./nl.js":92572,"./nn":54566,"./nn.js":54566,"./pa-in":29849,"./pa-in.js":29849,"./pl":94418,"./pl.js":94418,"./pt":79834,"./pt-br":48303,"./pt-br.js":48303,"./pt.js":79834,"./ro":24457,"./ro.js":24457,"./ru":82271,"./ru.js":82271,"./sd":1221,"./sd.js":1221,"./se":33478,"./se.js":33478,"./si":17538,"./si.js":17538,"./sk":5784,"./sk.js":5784,"./sl":46637,"./sl.js":46637,"./sq":86794,"./sq.js":86794,"./sr":45719,"./sr-cyrl":3322,"./sr-cyrl.js":3322,"./sr.js":45719,"./ss":56e3,"./ss.js":56e3,"./sv":41011,"./sv.js":41011,"./sw":40748,"./sw.js":40748,"./ta":11025,"./ta.js":11025,"./te":11885,"./te.js":11885,"./tet":28861,"./tet.js":28861,"./th":55802,"./th.js":55802,"./tl-ph":29231,"./tl-ph.js":29231,"./tlh":31052,"./tlh.js":31052,"./tr":85096,"./tr.js":85096,"./tzl":79846,"./tzl.js":79846,"./tzm":81765,"./tzm-latn":97711,"./tzm-latn.js":97711,"./tzm.js":81765,"./uk":16618,"./uk.js":16618,"./ur":57777,"./ur.js":57777,"./uz":57609,"./uz-latn":72475,"./uz-latn.js":72475,"./uz.js":57609,"./vi":21135,"./vi.js":21135,"./x-pseudo":64051,"./x-pseudo.js":64051,"./yo":82218,"./yo.js":82218,"./zh-cn":52648,"./zh-cn.js":52648,"./zh-hk":1632,"./zh-hk.js":1632,"./zh-tw":50304,"./zh-tw.js":50304};function r(e){var t=s(e);return n(t)}function s(e){if(!n.o(i,e)){var t=new Error("Cannot find module '"+e+"'");throw t.code="MODULE_NOT_FOUND",t}return i[e]}r.keys=function(){return Object.keys(i)},r.resolve=s,e.exports=r,r.id=35358},39234:()=>{},43337:()=>{jQuery.fn.highlight=function(e){function t(e,n){var i=0;if(3==e.nodeType){var r=e.data.toUpperCase().indexOf(n);if(r>=0){var s=document.createElement("span");s.className="highlight";var o=e.splitText(r),a=(o.splitText(n.length),o.cloneNode(!0));s.appendChild(a),o.parentNode.replaceChild(s,o),i=1}}else if(1==e.nodeType&&e.childNodes&&!/(script|style)/i.test(e.tagName))for(var l=0;l{},49494:function(e,t,n){(function(){"use strict";var e=e||{};e.scope={},e.ASSUME_ES5=!1,e.ASSUME_NO_NATIVE_MAP=!1,e.ASSUME_NO_NATIVE_SET=!1,e.SIMPLE_FROUND_POLYFILL=!1,e.ISOLATE_POLYFILLS=!1,e.FORCE_POLYFILL_PROMISE=!1,e.FORCE_POLYFILL_PROMISE_WHEN_NO_UNHANDLED_REJECTION=!1,e.defineProperty=e.ASSUME_ES5||"function"==typeof Object.defineProperties?Object.defineProperty:function(e,t,n){return e==Array.prototype||e==Object.prototype||(e[t]=n.value),e},e.getGlobal=function(e){e=["object"==typeof globalThis&&globalThis,e,"object"==typeof window&&window,"object"==typeof self&&self,"object"==typeof n.g&&n.g];for(var t=0;t(t=t||0)&&(t=Math.max(t+i,0));t\\|~\\xAC\\xB1\\xD7\\xF7\\u03F6\\u0606-\\u0608\\u2044\\u2052\\u207A-\\u207C\\u208A-\\u208C\\u2118\\u2140-\\u2144\\u214B\\u2190-\\u2194\\u219A\\u219B\\u21A0\\u21A3\\u21A6\\u21AE\\u21CE\\u21CF\\u21D2\\u21D4\\u21F4-\\u22FF\\u2320\\u2321\\u237C\\u239B-\\u23B3\\u23DC-\\u23E1\\u25B7\\u25C1\\u25F8-\\u25FF\\u266F\\u27C0-\\u27C4\\u27C7-\\u27E5\\u27F0-\\u27FF\\u2900-\\u2982\\u2999-\\u29D7\\u29DC-\\u29FB\\u29FE-\\u2AFF\\u2B30-\\u2B44\\u2B47-\\u2B4C\\uFB29\\uFE62\\uFE64-\\uFE66\\uFF0B\\uFF1C-\\uFF1E\\uFF5C\\uFF5E\\uFFE2\\uFFE9-\\uFFEC",So:"\\xA6\\xA9\\xAE\\xB0\\u0482\\u058D\\u058E\\u060E\\u060F\\u06DE\\u06E9\\u06FD\\u06FE\\u07F6\\u09FA\\u0B70\\u0BF3-\\u0BF8\\u0BFA\\u0C7F\\u0D4F\\u0D79\\u0F01-\\u0F03\\u0F13\\u0F15-\\u0F17\\u0F1A-\\u0F1F\\u0F34\\u0F36\\u0F38\\u0FBE-\\u0FC5\\u0FC7-\\u0FCC\\u0FCE\\u0FCF\\u0FD5-\\u0FD8\\u109E\\u109F\\u1390-\\u1399\\u166D\\u1940\\u19DE-\\u19FF\\u1B61-\\u1B6A\\u1B74-\\u1B7C\\u2100\\u2101\\u2103-\\u2106\\u2108\\u2109\\u2114\\u2116\\u2117\\u211E-\\u2123\\u2125\\u2127\\u2129\\u212E\\u213A\\u213B\\u214A\\u214C\\u214D\\u214F\\u218A\\u218B\\u2195-\\u2199\\u219C-\\u219F\\u21A1\\u21A2\\u21A4\\u21A5\\u21A7-\\u21AD\\u21AF-\\u21CD\\u21D0\\u21D1\\u21D3\\u21D5-\\u21F3\\u2300-\\u2307\\u230C-\\u231F\\u2322-\\u2328\\u232B-\\u237B\\u237D-\\u239A\\u23B4-\\u23DB\\u23E2-\\u2426\\u2440-\\u244A\\u249C-\\u24E9\\u2500-\\u25B6\\u25B8-\\u25C0\\u25C2-\\u25F7\\u2600-\\u266E\\u2670-\\u2767\\u2794-\\u27BF\\u2800-\\u28FF\\u2B00-\\u2B2F\\u2B45\\u2B46\\u2B4D-\\u2B73\\u2B76-\\u2B95\\u2B97-\\u2BFF\\u2CE5-\\u2CEA\\u2E50\\u2E51\\u2E80-\\u2E99\\u2E9B-\\u2EF3\\u2F00-\\u2FD5\\u2FF0-\\u2FFB\\u3004\\u3012\\u3013\\u3020\\u3036\\u3037\\u303E\\u303F\\u3190\\u3191\\u3196-\\u319F\\u31C0-\\u31E3\\u3200-\\u321E\\u322A-\\u3247\\u3250\\u3260-\\u327F\\u328A-\\u32B0\\u32C0-\\u33FF\\u4DC0-\\u4DFF\\uA490-\\uA4C6\\uA828-\\uA82B\\uA836\\uA837\\uA839\\uAA77-\\uAA79\\uFDFD\\uFFE4\\uFFE8\\uFFED\\uFFEE\\uFFFC\\uFFFD",Zl:"\\u2028",Zp:"\\u2029",Zs:" \\xA0\\u1680\\u2000-\\u200A\\u202F\\u205F\\u3000"}).C=e.Cc+e.Cf+e.Cs+e.Co+e.Cn,e.L=e.Lu+e.Ll+e.Lt+e.Lm+e.Mn+e.Lo,e.LC=e.Lu+e.Ll+e.Lt,e.M=e.Mn+e.Mc+e.Me,e.N=e.Nd+e.Nl+e.No,e.P=e.Pc+e.Pd+e.Ps+e.Pe+e.Pi+e.Pf+e.Po,e.S=e.Sm+e.Sc+e.Sk+e.So,e.Z=e.Zs+e.Zl+e.Zp,e.w="_"+e.L+e.N,e.b="(?:["+e.w+"](?:[^"+e.w+"]|$)|(?:^|[^"+e.w+"])["+e.w+"])",e.bOut="(?=[^"+e.w+"]|$)",e.bIn="(?:^|[^"+e.w+"])",e.bInCapture="(?:^|([^"+e.w+"]))",e.B="(?:["+e.w+"]["+e.w+"]|[^"+e.w+"][^"+e.w+"])",e.d=e.N,t.default=e},function(e,t,n){n(3),Sk.global.strftime=n(4),n(5),n(7),n(8),n(10),n(11),n(12),n(13),n(14),n(15),n(16),n(17),n(18),n(19),[Sk.builtin.object,Sk.builtin.type].forEach((e=>{Sk.abstr.setUpSlots(e),Sk.abstr.setUpMethods(e),Sk.abstr.setUpGetSets(e),Sk.abstr.setUpClassMethods(e)})),n(20),n(21),n(22),[Sk.builtin.str,Sk.builtin.none,Sk.builtin.NotImplemented,Sk.builtin.object].forEach((e=>{(e=e.prototype).__doc__=e.hasOwnProperty("tp$doc")?new Sk.builtin.str(e.tp$doc):Sk.builtin.none.none$})),n(23),n(24),n(25),n(26),n(27),n(28),n(29),n(30),n(32),n(33),n(34),n(35),n(36),n(37),n(38),n(39),n(40),n(41),n(42),n(43),n(44),n(45),n(46),n(47),n(48),n(49),n(50),n(51),n(52),n(53),n(54),n(55),n(56),n(57),n(58),n(59),n(60),n(61),n(62),n(63),n(64),n(65),n(66),n(67)},function(e,t,n){(function(e){var t={build:{githash:"0fe28593db57ef5bdfe04e372d61c5fb2b10d235",date:"2025-07-31T16:07:07.506Z"}};t.global=void 0!==e?e:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},t.exportSymbol=function(e,n){e=e.split(".");var i,r=t.global;for(i=0;i=e||0===t||4<=t)return"th";switch(t){case 1:return"st";case 2:return"nd";case 3:return"rd"}}function o(e){"undefined"!=typeof console&&"function"==typeof console.warn&&console.warn(e)}var a={de_DE:{identifier:"de-DE",days:"Sonntag Montag Dienstag Mittwoch Donnerstag Freitag Samstag".split(" "),shortDays:"So Mo Di Mi Do Fr Sa".split(" "),months:"Januar Februar März April Mai Juni Juli August September Oktober November Dezember".split(" "),shortMonths:"Jan Feb Mär Apr Mai Jun Jul Aug Sep Okt Nov Dez".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d.%m.%Y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},en_CA:{identifier:"en-CA",days:"Sunday Monday Tuesday Wednesday Thursday Friday Saturday".split(" "),shortDays:"Sun Mon Tue Wed Thu Fri Sat".split(" "),months:"January February March April May June July August September October November December".split(" "),shortMonths:"Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec".split(" "),ordinalSuffixes:"st nd rd th th th th th th th th th th th th th th th th th st nd rd th th th th th th th st".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d/%m/%y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%r",x:"%D"}},en_US:{identifier:"en-US",days:"Sunday Monday Tuesday Wednesday Thursday Friday Saturday".split(" "),shortDays:"Sun Mon Tue Wed Thu Fri Sat".split(" "),months:"January February March April May June July August September October November December".split(" "),shortMonths:"Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec".split(" "),ordinalSuffixes:"st nd rd th th th th th th th th th th th th th th th th th st nd rd th th th th th th th st".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%m/%d/%y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%r",x:"%D"}},es_MX:{identifier:"es-MX",days:"domingo lunes martes miércoles jueves viernes sábado".split(" "),shortDays:"dom lun mar mié jue vie sáb".split(" "),months:"enero febrero marzo abril mayo junio julio agosto septiembre octubre noviembre diciembre".split(" "),shortMonths:"ene feb mar abr may jun jul ago sep oct nov dic".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d/%m/%Y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},fr_FR:{identifier:"fr-FR",days:"dimanche lundi mardi mercredi jeudi vendredi samedi".split(" "),shortDays:"dim. lun. mar. mer. jeu. ven. sam.".split(" "),months:"janvier février mars avril mai juin juillet août septembre octobre novembre décembre".split(" "),shortMonths:"janv. févr. mars avril mai juin juil. août sept. oct. nov. déc.".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d/%m/%Y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},it_IT:{identifier:"it-IT",days:"domenica lunedì martedì mercoledì giovedì venerdì sabato".split(" "),shortDays:"dom lun mar mer gio ven sab".split(" "),months:"gennaio febbraio marzo aprile maggio giugno luglio agosto settembre ottobre novembre dicembre".split(" "),shortMonths:"gen feb mar apr mag giu lug ago set ott nov dic".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d/%m/%Y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},nl_NL:{identifier:"nl-NL",days:"zondag maandag dinsdag woensdag donderdag vrijdag zaterdag".split(" "),shortDays:"zo ma di wo do vr za".split(" "),months:"januari februari maart april mei juni juli augustus september oktober november december".split(" "),shortMonths:"jan feb mrt apr mei jun jul aug sep okt nov dec".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d-%m-%y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},pt_BR:{identifier:"pt-BR",days:"domingo segunda terça quarta quinta sexta sábado".split(" "),shortDays:"Dom Seg Ter Qua Qui Sex Sáb".split(" "),months:"janeiro fevereiro março abril maio junho julho agosto setembro outubro novembro dezembro".split(" "),shortMonths:"Jan Fev Mar Abr Mai Jun Jul Ago Set Out Nov Dez".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X %Z",D:"%d-%m-%Y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},ru_RU:{identifier:"ru-RU",days:"Воскресенье Понедельник Вторник Среда Четверг Пятница Суббота".split(" "),shortDays:"Вс Пн Вт Ср Чт Пт Сб".split(" "),months:"Январь Февраль Март Апрель Май Июнь Июль Август Сентябрь Октябрь Ноябрь Декабрь".split(" "),shortMonths:"янв фев мар апр май июн июл авг сен окт ноя дек".split(" "),AM:"AM",PM:"PM",am:"am",pm:"pm",formats:{c:"%a %d %b %Y %X",D:"%d.%m.%y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},tr_TR:{identifier:"tr-TR",days:"Pazar Pazartesi Salı Çarşamba Perşembe Cuma Cumartesi".split(" "),shortDays:"Paz Pzt Sal Çrş Prş Cum Cts".split(" "),months:"Ocak Şubat Mart Nisan Mayıs Haziran Temmuz Ağustos Eylül Ekim Kasım Aralık".split(" "),shortMonths:"Oca Şub Mar Nis May Haz Tem Ağu Eyl Eki Kas Ara".split(" "),AM:"ÖÖ",PM:"ÖS",am:"ÖÖ",pm:"ÖS",formats:{c:"%a %d %b %Y %X %Z",D:"%d-%m-%Y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%T",x:"%D"}},zh_CN:{identifier:"zh-CN",days:"星期日 星期一 星期二 星期三 星期四 星期五 星期六".split(" "),shortDays:"日一二三四五六".split(""),months:"一月份 二月份 三月份 四月份 五月份 六月份 七月份 八月份 九月份 十月份 十一月份 十二月份".split(" "),shortMonths:"一月 二月 三月 四月 五月 六月 七月 八月 九月 十月 十一月 十二月".split(" "),AM:"上午",PM:"下午",am:"上午",pm:"下午",formats:{c:"%a %d %b %Y %X %Z",D:"%d/%m/%y",F:"%Y-%m-%d",R:"%H:%M",r:"%I:%M:%S %p",T:"%H:%M:%S",v:"%e-%b-%Y",X:"%r",x:"%D"}}},l=a.en_US,u=new function e(u,c,d){function f(e,a,l,u){for(var c="",d=null,h=!1,p=e.length,b=!1,g=0;ga.getHours()?l.am:l.pm;break;case 82:c+=f(l.formats.R,a,l,u);break;case 83:c+=t(a.getSeconds(),d);break;case 84:c+=f(l.formats.T,a,l,u);break;case 85:c+=t(r(a,"sunday"),d);break;case 87:c+=t(r(a,"monday"),d);break;case 88:c+=f(l.formats.X,a,l,u);break;case 89:c+=a.getFullYear();break;case 90:c+=_&&0===m?"GMT":(d=(d=(d=a).toString().match(/\(([\w\s]+)\)/))&&d[1])||"";break;case 97:c+=l.shortDays[a.getDay()];break;case 98:case 104:c+=l.shortMonths[a.getMonth()];break;case 99:c+=f(l.formats.c,a,l,u);break;case 100:c+=t(a.getDate(),d);break;case 101:c+=t(a.getDate(),null==d?" ":d);break;case 106:d=new Date(a.getFullYear(),0,1),c+=n(d=Math.ceil((a.getTime()-d.getTime())/864e5));break;case 107:c+=t(a.getHours(),null==d?" ":d);break;case 108:c+=t(i(a.getHours()),null==d?" ":d);break;case 109:c+=t(a.getMonth()+1,d);break;case 110:c+="\n";break;case 111:d=a.getDate(),c=l.ordinalSuffixes?c+(String(d)+(l.ordinalSuffixes[d-1]||s(d))):c+(String(d)+s(d));break;case 112:c+=12>a.getHours()?l.AM:l.PM;break;case 114:c+=f(l.formats.r,a,l,u);break;case 115:c+=Math.floor(u/1e3);break;case 116:c+="\t";break;case 117:c+=0===(d=a.getDay())?7:d;break;case 118:c+=f(l.formats.v,a,l,u);break;case 119:c+=a.getDay();break;case 120:c+=f(l.formats.x,a,l,u);break;case 121:c+=t(h=a.getFullYear()%100,d);break;case 122:_&&0===m?c+=b?"+00:00":"+0000":(d=0!==m?m/6e4:-a.getTimezoneOffset(),h=b?":":"",k=Math.abs(d%60),c+=(0>d?"-":"+")+t(Math.floor(Math.abs(d/60)))+h+t(k));break;default:h&&(c+="%"),c+=e[g]}d=null,h=!1}else 37===k?h=!0:c+=e[g]}return c}var h,p=u||l,m=c||0,_=d||!1,b=0,g=function(e,t){if(t){var n=t.getTime();if(_){var i=6e4*(t.getTimezoneOffset()||0);6e4*((t=new Date(n+i+m)).getTimezoneOffset()||0)!==i&&(t=6e4*(t.getTimezoneOffset()||0),t=new Date(n+t+m))}}else(n=Date.now())>b?(b=n,h=new Date(b),n=b,_&&(h=new Date(b+6e4*(h.getTimezoneOffset()||0)+m))):n=b,t=h;return f(e,t,p,n)};return g.localize=function(t){return new e(t||p,m,_)},g.localizeByIdentifier=function(e){var t=a[e];return t?g.localize(t):(o('[WARNING] No locale found with identifier "'+e+'".'),g)},g.timezone=function(t){var n=m,i=_,r=typeof t;return"number"!==r&&"string"!==r||(i=!0,"string"===r?n=(n="-"===t[0]?-1:1)*(60*(r=parseInt(t.slice(1,3),10))+(t=parseInt(t.slice(3,5),10)))*6e4:"number"===r&&(n=6e4*t)),new e(p,n,i)},g.utc=function(){return new e(p,m,!0)},g}(l,0,!1);void 0!==e?e.exports=u:(function(){return this||(0,eval)("this")}()).strftime=u,"function"!=typeof Date.now&&(Date.now=function(){return+new Date})}()},function(e,t,n){e=n(6);const i=Sk.global.JSBI=void 0!==Sk.global.BigInt?{}:e;void 0===Sk.global.BigInt?(i.__isBigInt||(i.__isBigInt=e=>e instanceof i),i.powermod=(e,t,n)=>{const r=i.BigInt(1);let s=r;for(t=i.greaterThan(t,i.__ZERO)?t:i.unaryMinus(t);i.greaterThan(t,i.__ZERO);)i.bitwiseAnd(t,r)&&(s=i.remainder(i.multiply(s,e),n)),t=i.signedRightShift(t,r),e=i.remainder(i.multiply(e,e),n);return s}):Object.assign(i,{BigInt:Sk.global.BigInt,toNumber:e=>Number(e),toString:e=>e.toString(),__isBigInt:e=>"bigint"==typeof e,unaryMinus:e=>-e,bitwiseNot:e=>~e,bitwiseAnd:(e,t)=>e&t,bitwiseOr:(e,t)=>e|t,bitwiseXor:(e,t)=>e^t,exponentiate:(e,t)=>{const n=i.BigInt(1);let r=n;for(t=t>i.__ZERO?t:-t;t>i.__ZERO;)t&n&&(r*=e),t>>=n,e*=e;return r},powermod:(e,t,n)=>{const r=i.BigInt(1);let s=r;for(t=t>i.__ZERO?t:-t;t>i.__ZERO;)t&r&&(s=s*e%n),t>>=r,e=e*e%n;return s},multiply:(e,t)=>e*t,divide:(e,t)=>e/t,remainder:(e,t)=>e%t,add:(e,t)=>e+t,subtract:(e,t)=>e-t,leftShift:(e,t)=>e<e>>t,unsignedRightShift:(e,t)=>e>>>t,lessThan:(e,t)=>ee<=t,greaterThan:(e,t)=>e>t,greaterThanOrEqual:(e,t)=>e>=t,equal:(e,t)=>e===t,notEqual:(e,t)=>e!==t}),i.__ZERO=i.BigInt(0),i.__MAX_SAFE=i.BigInt(Number.MAX_SAFE_INTEGER),i.__MIN_SAFE=i.BigInt(-Number.MAX_SAFE_INTEGER),i.numberIfSafe=e=>i.lessThan(e,i.__MAX_SAFE)&&i.greaterThan(e,i.__MIN_SAFE)?i.toNumber(e):e,i.BigUp=e=>i.__isBigInt(e)?e:i.BigInt(e)},function(e,t,n){e.exports=function(){var e=Math.imul,t=Math.clz32,n=Math.abs,i=Math.max,r=Math.floor;class s extends Array{constructor(e,t){if(super(e),this.sign=t,e>s.__kMaxLength)throw new RangeError("Maximum BigInt size exceeded")}static BigInt(e){var t=Number.isFinite;if("number"==typeof e){if(0===e)return s.__zero();if(s.__isOneDigitInt(e))return 0>e?s.__oneDigit(-e,!0):s.__oneDigit(e,!1);if(!t(e)||r(e)!==e)throw new RangeError("The number "+e+" cannot be converted to BigInt because it is not an integer");return s.__fromDouble(e)}if("string"==typeof e){if(null===(t=s.__fromString(e)))throw new SyntaxError("Cannot convert "+e+" to a BigInt");return t}if("boolean"==typeof e)return!0===e?s.__oneDigit(1,!1):s.__zero();if("object"==typeof e)return e.constructor===s?e:(e=s.__toPrimitive(e),s.BigInt(e));throw new TypeError("Cannot convert "+e+" to a BigInt")}toDebugString(){const e=["BigInt["];for(const t of this)e.push((t?(t>>>0).toString(16):t)+", ");return e.push("]"),e.join("")}toString(e){if(2>(e=void 0===e?10:e)||36>>12;const l=a-12;for(t=12<=a?0:i<<20+a,a=20+a,0>>30-l,t=i<>>30-a,a-=30;return 1!==(i=s.__decideRounding(e,a,o,i))&&(0!==i||1&~t)||0!=(t=t+1>>>0)||!(0!=++r>>>20&&(r=0,1023<++n))?(e=e.sign?-2147483648:0,n=n+1023<<20,s.__kBitConversionInts[1]=e|n|r,s.__kBitConversionInts[0]=t,s.__kBitConversionDouble[0]):e.sign?-1/0:1/0}static unaryMinus(e){if(0===e.length)return e;const t=e.__copy();return t.sign=!e.sign,t}static bitwiseNot(e){return e.sign?s.__absoluteSubOne(e).__trim():s.__absoluteAddOne(e,!0)}static exponentiate(e,t){if(t.sign)throw new RangeError("Exponent must be positive");if(0===t.length)return s.__oneDigit(1,!1);if(0===e.length)return e;if(1===e.length&&1===e.__digit(0))return!e.sign||1&t.__digit(0)?e:s.unaryMinus(e);if(1=s.__kMaxLengthBits)throw new RangeError("BigInt too big");if(1===e.length&&2===e.__digit(0)){var n=1+(0|t/30);return(e=new s(n,e.sign&&!!(1&t))).__initializeDigits(),e.__setDigit(n-1,1<>=1;0!==t;t>>=1)i=s.multiply(i,i),1&t&&(n=null===n?i:s.multiply(n,i));return n}static multiply(e,t){if(0===e.length)return e;if(0===t.length)return t;var n=e.length+t.length;30<=e.__clzmsd()+t.__clzmsd()&&n--,(n=new s(n,e.sign!==t.sign)).__initializeDigits();for(let i=0;is.__absoluteCompare(e,t))return s.__zero();const n=e.sign!==t.sign,i=t.__unsignedDigit(0);if(1===t.length&&32767>=i){if(1===i)return n===e.sign?e:s.unaryMinus(e);e=s.__absoluteDivSmall(e,i,null)}else e=s.__absoluteDivLarge(e,t,!0,!1);return e.sign=n,e.__trim()}static remainder(e,t){if(0===t.length)throw new RangeError("Division by zero");if(0>s.__absoluteCompare(e,t))return e;const n=t.__unsignedDigit(0);return 1===t.length&&32767>=n?1===n||0===(t=s.__absoluteModSmall(e,n))?s.__zero():s.__oneDigit(t,e.sign):((t=s.__absoluteDivLarge(e,t,!1,!0)).sign=e.sign,t.__trim())}static add(e,t){const n=e.sign;return n===t.sign?s.__absoluteAdd(e,t,n):0<=s.__absoluteCompare(e,t)?s.__absoluteSub(e,t,n):s.__absoluteSub(t,e,!n)}static subtract(e,t){const n=e.sign;return n===t.sign?0<=s.__absoluteCompare(e,t)?s.__absoluteSub(e,t,n):s.__absoluteSub(t,e,!n):s.__absoluteAdd(e,t,n)}static leftShift(e,t){return 0===t.length||0===e.length?e:t.sign?s.__rightShiftByAbsolute(e,t):s.__leftShiftByAbsolute(e,t)}static signedRightShift(e,t){return 0===t.length||0===e.length?e:t.sign?s.__leftShiftByAbsolute(e,t):s.__rightShiftByAbsolute(e,t)}static unsignedRightShift(){throw new TypeError("BigInts have no unsigned right shift; use >> instead")}static lessThan(e,t){return 0>s.__compareToBigInt(e,t)}static lessThanOrEqual(e,t){return 0>=s.__compareToBigInt(e,t)}static greaterThan(e,t){return 0(e=r(e)))throw new RangeError("Invalid value: not (convertible to) a safe integer");if(0===e)return s.__zero();if(e>=s.__kMaxLengthBits)return t;const n=0|(e+29)/30;if(t.length(e=r(e)))throw new RangeError("Invalid value: not (convertible to) a safe integer");if(0===e)return s.__zero();if(t.sign){if(e>s.__kMaxLengthBits)throw new RangeError("BigInt too big");return s.__truncateAndSubFromPowerOfTwo(e,t,!1)}if(e>=s.__kMaxLengthBits)return t;const n=0|(e+29)/30;if(t.length>>i?s.__truncateToNBits(e,t):t}static ADD(e,t){if(e=s.__toPrimitive(e),t=s.__toPrimitive(t),"string"==typeof e)return"string"!=typeof t&&(t=t.toString()),e+t;if("string"==typeof t)return e.toString()+t;if(e=s.__toNumeric(e),t=s.__toNumeric(t),s.__isBigInt(e)&&s.__isBigInt(t))return s.add(e,t);if("number"==typeof e&&"number"==typeof t)return e+t;throw new TypeError("Cannot mix BigInt and other types, use explicit conversions")}static LT(e,t){return s.__compare(e,t,0)}static LE(e,t){return s.__compare(e,t,1)}static GT(e,t){return s.__compare(e,t,2)}static GE(e,t){return s.__compare(e,t,3)}static EQ(e,t){for(;;){if(s.__isBigInt(e))return s.__isBigInt(t)?s.equal(e,t):s.EQ(t,e);if("number"==typeof e){if(s.__isBigInt(t))return s.__equalToNumber(t,e);if("object"!=typeof t)return e==t;t=s.__toPrimitive(t)}else if("string"==typeof e){if(s.__isBigInt(t))return null!==(e=s.__fromString(e))&&s.equal(e,t);if("object"!=typeof t)return e==t;t=s.__toPrimitive(t)}else if("boolean"==typeof e){if(s.__isBigInt(t))return s.__equalToNumber(t,+e);if("object"!=typeof t)return e==t;t=s.__toPrimitive(t)}else if("symbol"==typeof e){if(s.__isBigInt(t))return!1;if("object"!=typeof t)return e==t;t=s.__toPrimitive(t)}else{if("object"!=typeof e)return e==t;if("object"==typeof t&&t.constructor!==s)return e==t;e=s.__toPrimitive(e)}}}static NE(e,t){return!s.EQ(e,t)}static __zero(){return new s(0,!1)}static __oneDigit(e,t){return(t=new s(1,t)).__setDigit(0,e),t}__copy(){const e=new s(this.length,this.sign);for(let t=0;tt)t=-t-1;else{if(0===n)return-1;n--,i=e.__digit(n),t=29}if(!(i&(t=1<>>20)-1023,n=1+(0|t/30);e=new s(n,0>e);let i,r=1048575&s.__kBitConversionInts[1]|1048576,o=s.__kBitConversionInts[0];if(20>(t%=30)){var a=20-t;i=a+32,t=r>>>a,r=r<<32-a|o>>>a,o<<=32-a}else 20===t?(i=32,t=r,r=o):(i=32-(a=t-20),t=r<>>32-a,r=o<>>2,r=r<<30|o>>>2,o<<=30):t=0,e.__setDigit(n,t);return e.__trim()}static __isWhitespace(e){return!!(13>=e&&9<=e)||(159>=e?32==e:131071>=e?160==e||5760==e:196607>=e?10>=(e&=131071)||40==e||41==e||47==e||95==e||4096==e:65279==e)}static __fromString(e,t){t=void 0===t?0:t;let n=0;const i=e.length;let r=0;if(r===i)return s.__zero();let o=e.charCodeAt(r);for(;s.__isWhitespace(o);){if(++r===i)return s.__zero();o=e.charCodeAt(r)}if(43===o){if(++r===i)return null;o=e.charCodeAt(r),n=1}else if(45===o){if(++r===i)return null;o=e.charCodeAt(r),n=-1}if(0===t){if(t=10,48===o){if(++r===i)return s.__zero();if(o=e.charCodeAt(r),88===o||120===o){if(t=16,++r===i)return null;o=e.charCodeAt(r)}else if(79===o||111===o){if(t=8,++r===i)return null;o=e.charCodeAt(r)}else if(66===o||98===o){if(t=2,++r===i)return null;o=e.charCodeAt(r)}}}else if(16===t&&48===o){if(++r===i)return s.__zero();if(o=e.charCodeAt(r),88===o||120===o){if(++r===i)return null;o=e.charCodeAt(r)}}if(0!=n&&10!==t)return null;for(;48===o;){if(++r===i)return s.__zero();o=e.charCodeAt(r)}var a=i-r;let l=s.__kMaxBitsPerChar[t];var u=s.__kBitsPerCharTableMultiplier-1;if(a>1073741824/l)return null;a=new s(0|(29+(l*a+u>>>s.__kBitsPerCharTableShift))/30,!1);const c=10>t?t:10,d=10>>0>>0>>s.__kBitsPerCharTableShift)/30)}while(!f)}else{l>>=s.__kBitsPerCharTableShift,t=[];var f=[],h=!1;do{for(var p=0,m=0;;){if(o-48>>>0>>0>>l-s)}if(0!==r){if(i>=e.length)throw Error("implementation bug");e.__setDigit(i++,r)}for(;i>>1)+(85&i))>>>2)+(51&i))>>>4)+(15&i),--t;const r=e.__digit(n-1);var o=s.__clz30(r),a=0|(30*n-o+i-1)/i;if(e.sign&&a++,268435456>>(u=i-u),u=30-u;u>=i;)o[a--]=s.__kConversionChars[l&t],l>>>=i,u-=i}for(o[a--]=s.__kConversionChars[(l|r<>>i-u;0!==l;)o[a--]=s.__kConversionChars[l&t],l>>>=i;if(e.sign&&(o[a--]="-"),-1!=a)throw Error("implementation bug");return o.join("")}static __toStringGeneric(e,t,n){var i=e.length;if(0===i)return"";if(1===i)return t=e.__unsignedDigit(0).toString(t),!1===n&&e.sign&&(t="-"+t),t;var r=30*i-s.__clz30(e.__digit(i-1));i=s.__kMaxBitsPerChar[t]-1,i=1+(0|((r*=s.__kBitsPerCharTableMultiplier)+(i-1))/i)>>1;var o=(r=s.exponentiate(s.__oneDigit(t,!1),s.__oneDigit(i,!1))).__unsignedDigit(0);if(1===r.length&&32767>=o){(r=new s(e.length,!1)).__initializeDigits();var a=0;for(let t=2*e.length-1;0<=t;t--)a=a<<15|e.__halfDigit(t),r.__setHalfDigit(t,0|a/o),a=0|a%o;o=a.toString(t)}else r=(o=s.__absoluteDivLarge(e,r,!0,!0)).quotient,o=o.remainder.__trim(),o=s.__toStringGeneric(o,t,!0);for(r.__trim(),t=s.__toStringGeneric(r,t,!0);o.lengthe?s.__absoluteLess(n):0}static __compareToNumber(e,t){if(s.__isOneDigitInt(t)){const i=e.sign,r=0>t;if(i!==r)return s.__unequalSign(i);if(0===e.length){if(r)throw Error("implementation bug");return 0===t?0:-1}return 1t?s.__absoluteGreater(i):et)return s.__unequalSign(n);if(0===t)throw Error("implementation bug: should be handled elsewhere");if(0===e.length)return-1;if(s.__kBitConversionDouble[0]=t,2047==(t=2047&s.__kBitConversionInts[1]>>>20))throw Error("implementation bug: handled elsewhere");var i=t-1023;if(0>i)return s.__absoluteGreater(n);t=e.length;var r=e.__digit(t-1),o=s.__clz30(r),a=30*t-o;if(a<(i+=1))return s.__absoluteLess(n);if(a>i)return s.__absoluteGreater(n);i=1048576|1048575&s.__kBitConversionInts[1];let l=s.__kBitConversionInts[0];if((o=29-o)!=(0|(a-1)%30))throw Error("implementation bug");if(20>o){var u=20-o;o=u+32,a=i>>>u,i=i<<32-u|l>>>u,l<<=32-u}else 20===o?(o=32,a=i,i=l):(o=32-(u=o-20),a=i<>>32-u,i=l<>>=0)>(a>>>=0))return s.__absoluteGreater(n);if(r>>2,i=i<<30|l>>>2,l<<=30):a=0,(r=e.__unsignedDigit(t))>a)return s.__absoluteGreater(n);if(rt&&e.__unsignedDigit(0)===n(t):0===s.__compareToDouble(e,t)}static __comparisonResultToBool(e,t){return 0===t?0>e:1===t?0>=e:2===t?0t;case 3:return e>=t}if(s.__isBigInt(e)&&"string"==typeof t)return null!==(t=s.__fromString(t))&&s.__comparisonResultToBool(s.__compareToBigInt(e,t),n);if("string"==typeof e&&s.__isBigInt(t))return null!==(e=s.__fromString(e))&&s.__comparisonResultToBool(s.__compareToBigInt(e,t),n);if(e=s.__toNumeric(e),t=s.__toNumeric(t),s.__isBigInt(e)){if(s.__isBigInt(t))return s.__comparisonResultToBool(s.__compareToBigInt(e,t),n);if("number"!=typeof t)throw Error("implementation bug");return s.__comparisonResultToBool(s.__compareToNumber(e,t),n)}if("number"!=typeof e)throw Error("implementation bug");if(s.__isBigInt(t))return s.__comparisonResultToBool(s.__compareToNumber(t,e),2^n);if("number"!=typeof t)throw Error("implementation bug");return 0===n?et:3===n?e>=t:void 0}__clzmsd(){return s.__clz30(this.__digit(this.length-1))}static __absoluteAdd(e,t,n){if(e.length>>30,n.__setDigit(r,1073741823&s)}for(;r>>30,n.__setDigit(r,1073741823&t);return r>>30,n.__setDigit(r,1073741823&s)}for(;r>>30,n.__setDigit(r,1073741823&t);return n.__trim()}static __absoluteAddOne(e,t,n){n=void 0===n?null:n;const i=e.length;null===n?n=new s(i,t):n.sign=t,t=1;for(let r=0;r>>30,n.__setDigit(r,1073741823&i)}return 0!=t&&n.__setDigitGrow(i,1),n}static __absoluteSubOne(e,t){const n=e.length,i=new s(t=t||n,!1);let r=1;for(let t=0;t>>30,i.__setDigit(t,1073741823&n)}if(0!=r)throw Error("implementation bug");for(e=n;en?0:e.__unsignedDigit(n)>t.__unsignedDigit(n)?1:-1}static __multiplyAccumulate(e,t,n,i){if(0!==t){var r=32767&t,o=t>>>15,a=t=0;for(let d,f=0;f>>15;l=s.__imul(u,r),u=s.__imul(u,o);const h=s.__imul(c,r);d+=a+l+t,t=d>>>30,d&=1073741823,d+=((32767&u)<<15)+((32767&h)<<15),t+=d>>>30,a=(c=s.__imul(c,o))+(u>>>15)+(h>>>15),n.__setDigit(i,1073741823&d)}for(;0!=t||0!==a;i++)e=n.__digit(i),e+=t+a,a=0,t=e>>>30,n.__setDigit(i,1073741823&e)}}static __internalMultiplyAdd(e,t,n,i,r){let o=0;for(let u=0;u>>15,t)))<<15)+o+n)>>>30,o=a>>>15,r.__setDigit(u,1073741823&l)}if(r.length>i)for(r.__setDigit(i++,n+o);ithis.length&&(n=this.length);const i=32767&e;e>>>=15;let r=0;for(let u=0;u>>15;o=s.__imul(a,i),a=s.__imul(a,e);const n=s.__imul(l,i);r=(o=t+o+r)>>>30,o&=1073741823,r+=(o+=((32767&a)<<15)+((32767&n)<<15))>>>30,t=(l=s.__imul(l,e))+(a>>>15)+(n>>>15),this.__setDigit(u,1073741823&o)}if(0!=r||0!==t)throw Error("implementation bug")}static __absoluteDivSmall(e,t,n){null===(n=void 0===n?null:n)&&(n=new s(e.length,!1));let i=0;for(let r,s=2*e.length-1;0<=s;s-=2){r=(i<<15|e.__halfDigit(s))>>>0;const o=0|r/t;i=0|r%t,r=(i<<15|e.__halfDigit(s-1))>>>0;const a=0|r/t;i=0|r%t,n.__setDigit(s>>>1,o<<15|a)}return n}static __absoluteModSmall(e,t){let n=0;for(let i=2*e.length-1;0<=i;i--)n=0|((n<<15|e.__halfDigit(i))>>>0)%t;return n}static __absoluteDivLarge(e,t,n,i){const r=t.__halfDigitLength(),o=t.length;var a=e.__halfDigitLength()-r;let l=null;n&&(l=new s(a+2>>>1,!1),l.__initializeDigits());const u=new s(r+2>>>1,!1);u.__initializeDigits();const c=s.__clz15(t.__halfDigit(r-1));0>>0)/d,a=0|a%d;const n=t.__halfDigit(r-2),o=e.__halfDigit(c+r-2);for(;s.__imul(i,n)>>>0>(a<<16|o)>>>0&&(i--,!(32767<(a+=d))););}s.__internalMultiplyAdd(t,i,0,o,u),0!==(a=e.__inplaceSub(u,c,r+1))&&(a=e.__inplaceAdd(t,c,r),e.__setHalfDigit(c+r,32767&e.__halfDigit(c+r)+a),i--),n&&(1&c?f=i<<15:l.__setDigit(c>>>1,f|i))}if(i)return e.__inplaceRightShift(c),n?{quotient:l,remainder:e}:e;if(n)return l;throw Error("unreachable")}static __clz15(e){return s.__clz30(e)-15}__inplaceAdd(e,t,n){let i=0;for(let r=0;r>>15,this.__setHalfDigit(t+r,32767&n)}return i}__inplaceSub(e,t,n){let i=0;if(1&t){t>>=1;for(var r=this.__digit(t),s=32767&r,o=0;o>>1;o++){var a=e.__digit(o);i=1&(r=(r>>>15)-(32767&a)-i)>>>15,this.__setDigit(t+o,(32767&r)<<15|32767&s),i=1&(s=(32767&(r=this.__digit(t+o+1)))-(a>>>15)-i)>>>15}const l=(r>>>15)-(32767&(a=e.__digit(o)))-i;if(i=1&l>>>15,this.__setDigit(t+o,(32767&l)<<15|32767&s),t+o+1>=this.length)throw new RangeError("out of bounds");!(1&n)&&(i=1&(s=(32767&(r=this.__digit(t+o+1)))-(a>>>15)-i)>>>15,this.__setDigit(t+e.length,1073709056&r|32767&s))}else{for(t>>=1,s=0;s>>15,i=1&(r=(r>>>15)-(a>>>15)-i)>>>15,this.__setDigit(t+s,(32767&r)<<15|32767&o);i=1&(r=(32767&(o=this.__digit(t+s)))-(32767&(e=e.__digit(s)))-i)>>>15,a=0,!(1&n)&&(i=1&(a=(o>>>15)-(e>>>15)-i)>>>15),this.__setDigit(t+s,(32767&a)<<15|32767&r)}return i}__inplaceRightShift(e){if(0!==e){var t=this.__digit(0)>>>e,n=this.length-1;for(let i=0;i>>e}this.__setDigit(n,t)}}static __specialLeftShift(e,t,n){const i=e.length,r=new s(i+n,!1);if(0===t){for(t=0;t>>30-t}return 0n)throw new RangeError("BigInt too big");t=0|n/30;var i=n%30;const r=e.length,o=0!==i&&0!=e.__digit(r-1)>>>30-i;var a=r+t+(o?1:0);if(n=new s(a,e.sign),0===i){for(i=0;i>>30-i}if(o)n.__setDigit(r+t,a);else if(0!==a)throw Error("implementation bug")}return n.__trim()}static __rightShiftByAbsolute(e,t){var n=e.length,i=e.sign,r=s.__toShiftAmount(t);if(0>r)return s.__rightShiftByMaximum(i);var o=r%30,a=n-(t=0|r/30);if(0>=a)return s.__rightShiftByMaximum(i);if(r=!1,i)if(e.__digit(t)&(1<>>o,n=n-t-1,l=0;l>>o}i.__setDigit(n,a)}return r&&(i=s.__absoluteAddOne(i,!0,i)),i.__trim()}static __rightShiftByMaximum(e){return e?s.__oneDigit(1,!0):s.__zero()}static __toShiftAmount(e){return 1s.__kMaxLengthBits?-1:e}static __toPrimitive(e,t){if(t=void 0===t?"default":t,"object"!=typeof e||e.constructor===s)return e;if("undefined"!=typeof Symbol&&"symbol"==typeof Symbol.toPrimitive){const n=e[Symbol.toPrimitive];if(n){if("object"!=typeof(e=n(t)))return e;throw new TypeError("Cannot convert object to primitive value")}}if((t=e.valueOf)&&"object"!=typeof(t=t.call(e)))return t;if((t=e.toString)&&"object"!=typeof(e=t.call(e)))return e;throw new TypeError("Cannot convert object to primitive value")}static __toNumeric(e){return s.__isBigInt(e)?e:+e}static __isBigInt(e){return"object"==typeof e&&null!==e&&e.constructor===s}static __truncateToNBits(e,t){var n=0|(e+29)/30;const i=new s(n,t.sign);--n;for(let e=0;e>>e),i.__setDigit(n,t),i.__trim()}static __truncateAndSubFromPowerOfTwo(e,t,n){var i=Math.min,r=0|(e+29)/30;n=new s(r,n);let o=0;var a=0;for(i=i(--r,t.length);o>>30,n.__setDigit(o,1073741823&e)}for(;o>>e,a=(e=1<<32-e)-t-a,a&=e-1),n.__setDigit(r,a),n.__trim()}__digit(e){return this[e]}__unsignedDigit(e){return this[e]>>>0}__setDigit(e,t){this[e]=0|t}__setDigitGrow(e,t){this[e]=0|t}__halfDigitLength(){const e=this.length;return 32767>=this.__unsignedDigit(e-1)?2*e-1:2*e}__halfDigit(e){return 32767&this[e>>>1]>>>15*(1&e)}__setHalfDigit(e,t){const n=e>>>1,i=this.__digit(n);this.__setDigit(n,1&e?32767&i|t<<15:1073709056&i|32767&t)}static __digitPow(e,t){let n=1;for(;0>>=1,e*=e;return n}static __isOneDigitInt(e){return(1073741823&e)===e}}return s.__kMaxLength=33554432,s.__kMaxLengthBits=s.__kMaxLength<<5,s.__kMaxBitsPerChar=[0,0,32,51,64,75,83,90,96,102,107,111,115,119,122,126,128,131,134,136,139,141,143,145,147,149,151,153,154,156,158,159,160,162,163,165,166],s.__kBitsPerCharTableShift=5,s.__kBitsPerCharTableMultiplier=1<>>0)/t)},s.__imul=e||function(e,t){return 0|e*t},s}()},function(e,t){[..."abc"].flat(),"a".matchAll(/a/g)},function(e,t,n){(function(e,t){!function(e){function n(e){delete o[e]}function i(e){if(a)setTimeout(i,0,e);else{var t=o[e];if(t){a=!0;try{var r=t.callback,s=t.args;switch(s.length){case 0:r();break;case 1:r(s[0]);break;case 2:r(s[0],s[1]);break;case 3:r(s[0],s[1],s[2]);break;default:r.apply(void 0,s)}}finally{n(e),a=!1}}}}if(!e.setImmediate){var r,s=1,o={},a=!1,l=e.document,u=Object.getPrototypeOf&&Object.getPrototypeOf(e);u=u&&u.setTimeout?u:e,"[object process]"==={}.toString.call(e.process)?r=function(e){t.nextTick((function(){i(e)}))}:function(){if(e.postMessage&&!e.importScripts){var t=!0,n=e.onmessage;return e.onmessage=function(){t=!1},e.postMessage("","*"),e.onmessage=n,t}}()?(c="setImmediate$"+Math.random()+"$",d=function(t){t.source===e&&"string"==typeof t.data&&0===t.data.indexOf(c)&&i(+t.data.slice(c.length))},e.addEventListener?e.addEventListener("message",d,!1):e.attachEvent("onmessage",d),r=function(t){e.postMessage(c+t,"*")}):e.MessageChannel?function(){var e=new MessageChannel;e.port1.onmessage=function(e){i(e.data)},r=function(t){e.port2.postMessage(t)}}():l&&"onreadystatechange"in l.createElement("script")?function(){var e=l.documentElement;r=function(t){var n=l.createElement("script");n.onreadystatechange=function(){i(t),n.onreadystatechange=null,e.removeChild(n),n=null},e.appendChild(n)}}():r=function(e){setTimeout(i,0,e)},u.setImmediate=function(e){"function"!=typeof e&&(e=new Function(""+e));for(var t=Array(arguments.length-1),n=0;n the object's type\ntype(name, bases, dict) -> a new type",tp$call:function(e,t){if(this===Sk.builtin.type){if(1===e.length&&(void 0===t||!t.length))return e[0].ob$type;if(3!==e.length)throw new Sk.builtin.TypeError("type() takes 1 or 3 arguments")}let n=this.prototype.tp$new(e,t);if(n.$isSuspension)return Sk.misceval.chain(n,(i=>{if(n=i,n.ob$type.$isSubType(this))return n.tp$init(e,t)}),(()=>n));if(n.ob$type.$isSubType(this)){const i=n.tp$init(e,t);return void 0!==i&&i.$isSuspension?Sk.misceval.chain(i,(()=>n)):n}return n},tp$new:function(e,t){if(3!==e.length){if(1===e.length&&(void 0===t||!t.length))return e[0].ob$type;throw new Sk.builtin.TypeError("type() takes 1 or 3 arguments")}const s=e[0];var o=e[1];const l=e[2];if("dict"!==l.tp$name)throw new Sk.builtin.TypeError("type() argument 3 must be dict, not "+Sk.abstr.typeName(l));if(!Sk.builtin.checkString(s))throw new Sk.builtin.TypeError("type() argument 1 must be str, not "+Sk.abstr.typeName(s));if("tuple"!==o.tp$name)throw new Sk.builtin.TypeError("type() argument 2 must be tuple, not "+Sk.abstr.typeName(o));o=o.sk$asarray(),function(e,t,n,s){const o=function(e){function t(e){return e.sk$solidBase||e.sk$solidSlotBase?e:t(e.prototype.tp$base)}let n,i,r,s;0===e.length&&e.push(Sk.builtin.object);for(let o=0;o{if(!Sk.builtin.checkString(e))throw new Sk.builtin.TypeError("__slots__ items must be strings, not '"+Sk.abstr.typeName(e)+"'");if(!e.$isIdentifier())throw new Sk.builtin.TypeError("__slots__ must be identifiers");if("__dict__"===e.v){if(f)throw new Sk.builtin.TypeError("__dict__ slot disallowed: we already got one");d=!0}else c.add(Sk.mangleName(s,e).v)})),function(e,t){const n=t.prototype,i=n.sk$nslots||0;Object.defineProperty(n,"sk$nslots",{value:i+e.length,writable:!0}),e.length&&Object.defineProperty(t,"sk$solidSlotBase",{value:!0,writable:!0}),e.forEach(((e,r)=>{r+=i;const s=Sk.builtin.str.$fixReserved(e);n[s]=new Sk.builtin.getset_descriptor(t,{$get(){const t=this.$s[r];if(void 0===t)throw new Sk.builtin.AttributeError(e);return t},$set(e){this.$s[r]=e}})}))}(o=[...c].sort(((e,t)=>e.localeCompare(t))),e)),d&&!f&&(u.__dict__=new Sk.builtin.getset_descriptor(e,a),f=!0),Object.defineProperties(u,{ht$slots:{value:o||null,writable:!0},sk$hasDict:{value:f,writable:!0}}),l.$items().forEach((e=>{var[t,n]=e;if(Sk.builtin.checkString(t)){if(c&&c.has(t.v))throw new Sk.builtin.ValueError("'"+t.toString()+"' in __slots__ conflicts with class variable");u[t.$mangled]=n}})),u.hasOwnProperty("__qualname__")){if(o=u.__qualname__,!Sk.builtin.checkString(o))throw new Sk.builtin.TypeError("type __qualname__ must be a str, not '"+Sk.abstr.typeName(o)+"'");u.ht$qualname=o}return n(o=e.prototype,"__init_subclass__","classmethod"),n(o,"__new__","staticmethod"),n(o,"__class_getitem__","classmethod"),e.$allocateSlots(),function(e){const t=e.prototype;Object.keys(t).forEach((n=>{const i=Sk.abstr.lookupSpecial(t[n],Sk.builtin.str.$setname);if(void 0!==i){const r=Sk.unfixReserved(n);try{Sk.misceval.callsimArray(i,[e,new Sk.builtin.str(r)])}catch(i){throw(n=new Sk.builtin.RuntimeError("Error calling __set_name__ on '"+Sk.abstr.typeName(t[n])+"' instance '"+r+"' in '"+e.prototype.tp$name+"'")).$cause=i,n}}}))}(e),function(e,t){e=new Sk.builtin.super_(e,e).tp$getattr(Sk.builtin.str.$initsubclass),Sk.misceval.callsimArray(e,[],t)}(e,t),e},tp$init:function(e,t){if(e&&1==e.length&&t&&t.length)throw new Sk.builtin.TypeError("type.__init__() takes no keyword arguments");if(3!=e.length&&1!=e.length)throw new Sk.builtin.TypeError("type.__init__() takes 1 or 3 arguments");return Sk.builtin.object.prototype.tp$init.call(this,[])},tp$getattr:function(e,t){var n=this.ob$type;const i=n.$typeLookup(e);let r;return void 0!==i&&(r=i.tp$descr_get,void 0!==r&&void 0!==i.tp$descr_set)?r.call(i,this,n,t):void 0!==(e=this.$typeLookup(e))?void 0!==(n=e.tp$descr_get)?t=n.call(e,null,this,t):e:void 0!==r?r.call(i,this,n,t):void 0!==i?i:void 0},tp$setattr:function(e,t,n){if(!this.sk$klass){if(void 0!==t)throw new Sk.builtin.TypeError("can't set attributes of built-in/extension type '"+this.prototype.tp$name+"'");throw new Sk.builtin.TypeError("can't delete attributes on type object '"+this.prototype.tp$name+"'")}const i=this.ob$type.$typeLookup(e);if(void 0!==i){const e=i.tp$descr_set;if(e)return e.call(i,this,t,n)}if(n=e.$mangled,void 0===t){if(!(t=this.prototype).hasOwnProperty(n))throw new Sk.builtin.AttributeError("type object '"+this.prototype.tp$name+"' has no attribute '"+e.$jsstr()+"'");delete t[n],void 0!==(e=Sk.dunderToSkulpt[n])&&(delete this.prototype[e],t.sk$prototypical||this.$allocateGetterSlot(n))}else this.prototype[n]=t,n in Sk.dunderToSkulpt&&this.$allocateSlot(n,t)},$r:function(){let e=this.prototype.__module__,t="",n="class";return e&&Sk.builtin.checkString(e)?t=e.v+".":e=null,e||this.sk$klass||Sk.__future__.class_repr||(n="type"),new Sk.builtin.str("<"+n+" '"+t+this.prototype.tp$name+"'>")}},writable:!0},tp$methods:{value:null,writable:!0},tp$classmethods:{value:null,writable:!0},tp$getsets:{value:null,writable:!0},sk$type:{value:!0},$isSubType:{value:function(e){return this===e||this.prototype instanceof e||!this.prototype.sk$prototypical&&this.prototype.tp$mro.includes(e)}},$allocateSlot:{value:function(e,t){const n=(e=Sk.slots[e]).$slot_name,i=this.prototype;i.hasOwnProperty(n)&&delete i[n],Object.defineProperty(i,n,{value:e.$slot_func(t),writable:!0,configurable:!0})}},$allocateSlots:{value:function(){const e=this.prototype;this.prototype.sk$prototypical?Object.keys(e).forEach((t=>{t in Sk.slots&&this.$allocateSlot(t,e[t])})):Object.keys(Sk.slots).forEach((t=>{e.hasOwnProperty(t)?this.$allocateSlot(t,e[t]):this.$allocateGetterSlot(t)})),e.hasOwnProperty("__eq__")&&!e.hasOwnProperty("__hash__")&&(e.tp$hash=e.__hash__=Sk.builtin.none.none$)}},$allocateGetterSlot:{value:function(e){const t=Sk.slots[e].$slot_name,n=this.prototype;n.hasOwnProperty(t)||Object.defineProperty(n,t,{configurable:!0,get(){const e=n.tp$mro;for(let n=1;nnew Sk.builtin.dict([]),$flags:{FastCall:!0}}};const a={$get(){const e=s(this.ob$type);return void 0!==e?e.tp$descr_get(this,this.ob$type):Sk.generic.getSetDict.$get.call(this)},$set(e){const t=s(this.ob$type);return void 0!==t?t.tp$descr_set(this,e):void 0!==e?Sk.generic.getSetDict.$set.call(this,e):void(this.$d=new Sk.builtin.dict([]))},$doc:"dictionary for instance variables (if defined)",$name:"__dict__"}},function(e,t){Sk.generic={},Sk.generic.getAttr=function(e,t){let n;const i=this.ob$type,r=i.$typeLookup(e);if(void 0!==r&&(n=r.tp$descr_get,void 0!==n&&void 0!==r.tp$descr_set))return n.call(r,this,i,t);const s=this.$d;return void 0!==s&&void 0!==(e=s.quick$lookup(e))?e:void 0!==n?n.call(r,this,i,t):void 0!==r?r:void 0},Sk.exportSymbol("Sk.generic.getAttr",Sk.generic.getAttr),Sk.generic.setAttr=function(e,t,n){var i=this.ob$type.$typeLookup(e);if(null!=i){const e=i.tp$descr_set;if(e)return e.call(i,this,t,n)}if(null!=(n=this.$d)){if(n.dict$setItem){if(void 0!==t)return n.dict$setItem(e,t);if(n.dict$delItem(e))throw new Sk.builtin.AttributeError("'"+Sk.abstr.typeName(this)+"' object has no attribute '"+e.$jsstr()+"'");return}if("object"==typeof n&&!n.sk$object){if(i=e.$mangled,void 0!==t)return void(n[i]=t);if(void 0!==n[i])return void delete n[i]}}throw new Sk.builtin.AttributeError(this.sk$attrError()+" has no attribute '"+e.$jsstr()+"'")},Sk.exportSymbol("Sk.generic.setAttr",Sk.generic.setAttr),Sk.generic.new=function(e){return function(t,n){return this.constructor===e?new this.constructor:(t=new this.constructor,e.call(t),t)}},Sk.generic.newMethodDef={$meth(e,t){const n=this.prototype;if(1>e.length)throw e=n.tp$name,new Sk.builtin.TypeError(e+".__new__(): not enough arguments");var i=e.shift();if(void 0===i.sk$type)throw e=n.tp$name,new Sk.builtin.TypeError(e+"__new__(X): X is not a type object ("+Sk.abstr.typeName(i)+")");if(!i.$isSubType(this))throw e=n.tp$name,i=i.prototype.tp$name,new Sk.builtin.TypeError(e+".__new__("+i+"): "+i+" is not a subtype of "+e);const r=i.prototype.sk$staticNew.prototype;if(r.tp$new!==n.tp$new)throw e=n.tp$name,i=i.prototype.tp$name,new Sk.builtin.TypeError(e+".__new__("+i+") is not safe, use "+r.tp$name+".__new__()");return n.tp$new.call(i.prototype,e,t)},$flags:{FastCall:!0},$textsig:"($type, *args, **kwargs)",$name:"__new__"},Sk.generic.selfIter=function(){return this},Sk.generic.iterNextWithArrayCheckSize=function(){if(this.$seq.length!==this.$orig.get$size()){const e=this.tp$name.split("_")[0];throw new Sk.builtin.RuntimeError(e+" changed size during iteration")}if(!(this.$index>=this.$seq.length))return this.$seq[this.$index++]},Sk.generic.iterNextWithArray=function(){const e=this.$seq[this.$index++];return void 0===e&&(this.tp$iternext=()=>{}),e},Sk.generic.iterLengthHintWithArrayMethodDef={$meth:function(){return new Sk.builtin.int_(this.$seq.length-this.$index)},$flags:{NoArgs:!0}},Sk.generic.iterReverseLengthHintMethodDef={$meth:function(){return new Sk.builtin.int_(this.$index)},$flags:{NoArgs:!0}},Sk.generic.getSetDict={$get(){return this.$d},$set(e){if(void 0===e)throw new Sk.builtin.TypeError("cannot delete __dict__");if(!(e instanceof Sk.builtin.dict))throw new Sk.builtin.TypeError("__dict__ must be set to a dictionary, not a '"+Sk.abstr.typeName(e)+"'");this.$d=e},$doc:"dictionary for instance variables (if defined)",$name:"__dict__"},Sk.generic.seqCompare=function(e,t){if(this===e&&Sk.misceval.opAllowsEquality(t))return!0;if(!(e instanceof this.sk$builtinBase))return Sk.builtin.NotImplemented.NotImplemented$;const n=this.v;let i;if(e=e.v,n.length!==e.length&&("Eq"===t||"NotEq"===t))return"Eq"!==t;for(i=0;i=r||i>=s)switch(t){case"Lt":return rs;case"GtE":return r>=s;default:Sk.asserts.fail()}return"Eq"!==t&&("NotEq"===t||Sk.misceval.richCompareBool(n[i],e[i],t))},Sk.generic.classGetItem={__class_getitem__:{$meth(e){return new Sk.builtin.GenericAlias(this,e)},$flags:{OneArg:!0}}}},function(e,t){Sk.builtin.pyCheckArgs=function(e,t,n,i,r,s){if(t=t.length,void 0===i&&(i=1/0),r&&--t,s&&--t,ti)throw new Sk.builtin.TypeError((n===i?e+"() takes exactly "+n+" arguments":ti)throw new Sk.builtin.TypeError((n===i?e+"() takes exactly "+n+" arguments":t"};const s={Add:"+",Sub:"-",Mult:"*",MatMult:"@",Div:"/",FloorDiv:"//",Mod:"%",DivMod:"divmod()",Pow:"** or pow()",LShift:"<<",RShift:">>",BitAnd:"&",BitXor:"^",BitOr:"|"},o={UAdd:"+",USub:"-",Invert:"~"};Sk.abstr.numberBinOp=function(e,t,n){var r;if(!(r=i(e,t,n)))throw e=Sk.abstr.typeName(e),t=Sk.abstr.typeName(t),new Sk.builtin.TypeError("unsupported operand type(s) for "+s[n]+": '"+e+"' and '"+t+"'");return r},Sk.exportSymbol("Sk.abstr.numberBinOp",Sk.abstr.numberBinOp),Sk.abstr.numberInplaceBinOp=function(e,t,n){var i;if(!(i=r(e,t,n)))throw e=Sk.abstr.typeName(e),t=Sk.abstr.typeName(t),new Sk.builtin.TypeError("unsupported operand type(s) for "+s[n]+"=: '"+e+"' and '"+t+"'");return i},Sk.exportSymbol("Sk.abstr.numberInplaceBinOp",Sk.abstr.numberInplaceBinOp),Sk.abstr.numberUnaryOp=function(e,t){if("Not"===t)return Sk.misceval.isTrue(e)?Sk.builtin.bool.false$:Sk.builtin.bool.true$;e:{switch(t){case"USub":var n=e.nb$negative;break e;case"UAdd":n=e.nb$positive;break e;case"Invert":n=e.nb$invert;break e}n=void 0}if(!(n=void 0!==n?n.call(e):void 0))throw e=Sk.abstr.typeName(e),new Sk.builtin.TypeError("bad operand type for unary "+o[t]+": '"+e+"'");return n},Sk.exportSymbol("Sk.abstr.numberUnaryOp",Sk.abstr.numberUnaryOp),Sk.abstr.fixSeqIndex_=function(e,t){return 0>(t=Sk.builtin.asnum$(t))&&e.sq$length&&(t+=e.sq$length()),t},Sk.abstr.sequenceContains=function(e,t,n){return e.sq$contains?e.sq$contains(t,n):(e=Sk.misceval.iterFor(Sk.abstr.iter(e),(function(e){return!(e!==t&&!Sk.misceval.richCompareBool(e,t,"Eq"))&&new Sk.misceval.Break(!0)}),!1),n?e:Sk.misceval.retryOptionalSuspensionOrThrow(e))},Sk.abstr.sequenceConcat=function(e,t){if(e.sq$concat)return e.sq$concat(t);if(Sk.builtin.checkSequence(e)&&Sk.builtin.checkSequence(t)&&void 0!==(t=i(e,t,"Add")))return t;throw new Sk.builtin.TypeError("'"+Sk.abstr.typeName(e)+"' object can't be concatenated")},Sk.abstr.sequenceInPlaceConcat=function(e,t){if(e.sq$inplace_concat)return e.sq$inplace_concat(t);if(e.sq$concat)return e.sq$concat(t);if(Sk.builtin.checkSequence(e)&&Sk.builtin.checkSequence(t)&&void 0!==(t=r(e,t,"Add")))return t;throw new Sk.builtin.TypeError("'"+Sk.abstr.typeName(e)+"' object can't be concatenated")},Sk.abstr.sequenceGetIndexOf=function(e,t){if(e.index)return Sk.misceval.callsimArray(e.index,[e,t]);let n=0;for(let i=Sk.abstr.iter(e),r=i.tp$iternext();void 0!==r;r=i.tp$iternext()){if(Sk.misceval.richCompareBool(t,r,"Eq"))return new Sk.builtin.int_(n);n+=1}throw new Sk.builtin.ValueError("sequence.index(x): x not in sequence")},Sk.abstr.sequenceGetCountOf=function(e,t){if(e.count)return Sk.misceval.callsimArray(e.count,[e,t]);let n=0;for(let i=Sk.abstr.iter(e),r=i.tp$iternext();void 0!==r;r=i.tp$iternext())Sk.misceval.richCompareBool(t,r,"Eq")&&(n+=1);return new Sk.builtin.int_(n)},Sk.abstr.sequenceGetItem=function(e,t,n){return"number"==typeof t&&(t=new Sk.builtin.int_(t)),Sk.abstr.objectGetItem(e,t,n)},Sk.abstr.sequenceSetItem=function(e,t,n,i){return"number"==typeof t&&(t=new Sk.builtin.int_(t)),Sk.abstr.objectSetItem(e,t,n,i)},Sk.abstr.sequenceDelItem=function(e,t,n){return Sk.abstr.objectDelItem(e,t,n)},Sk.abstr.sequenceGetSlice=function(e,t,n){return Sk.abstr.objectGetItem(e,new Sk.builtin.slice(t,n))},Sk.abstr.sequenceDelSlice=function(e,t,n){return Sk.abstr.objectDelItem(e,new Sk.builtin.slice(t,n))},Sk.abstr.sequenceSetSlice=function(e,t,n,i){return Sk.abstr.objectSetItem(e,new Sk.builtin.slice(t,n))},Sk.abstr.sequenceUnpack=function(e,t,n,i){if(!Sk.builtin.checkIterable(e))throw new Sk.builtin.TypeError("cannot unpack non-iterable "+Sk.abstr.typeName(e)+" object");const r=Sk.abstr.iter(e),s=[];let o,a=0;return 0{if(s.push(e),++a===t)return new Sk.misceval.Break}))),Sk.misceval.chain(o,(()=>{if(s.length{if(void 0!==e)throw new Sk.builtin.ValueError("too many values to unpack (expected "+t+")");return s}));const e=[];return Sk.misceval.chain(Sk.misceval.iterFor(r,(t=>{e.push(t)})),(()=>{const i=e.length+t-n;if(0>i)throw new Sk.builtin.ValueError("not enough values to unpack (expected at least "+n+", got "+(n+i)+")");return s.push(new Sk.builtin.list(e.slice(0,i))),s.push(...e.slice(i)),s}))}))},Sk.abstr.mappingUnpackIntoKeywordArray=function(e,t,n){if(!(t instanceof Sk.builtin.dict)){var i=Sk.abstr.lookupSpecial(t,Sk.builtin.str.$keys);if(void 0===i)throw new Sk.builtin.TypeError("Object is not a mapping");return Sk.misceval.chain(Sk.misceval.callsimOrSuspendArray(i),(i=>Sk.misceval.iterFor(Sk.abstr.iter(i),(i=>{if(!Sk.builtin.checkString(i))throw new Sk.builtin.TypeError((n.$qualname?n.$qualname+"() ":"")+"keywords must be strings");return Sk.misceval.chain(t.mp$subscript(i,!0),(t=>{e.push(i.v),e.push(t)}))}))))}t.$items().forEach((t=>{var[i,r]=t;if(!Sk.builtin.checkString(i))throw new Sk.builtin.TypeError((n.$qualname?n.$qualname+"() ":"")+"keywords must be strings");e.push(i.v),e.push(r)}))},Sk.abstr.keywordArrayFromPyDict=function(e){const t=[];return e.$items().forEach((e=>{var[n,i]=e;if(!Sk.builtin.checkString(n))throw new Sk.builtin.TypeError("keywords must be strings");t.push(n.toString()),t.push(i)})),t},Sk.abstr.keywordArrayToPyDict=function(e){const t=new Sk.builtin.dict;for(let n=0;n