[
  {
    "path": ".github/workflows/documentation.yaml",
    "content": "name: documentation\non:\n  push:\n    branches:\n    - main\n\njobs:\n  build-docs:\n    runs-on: ubuntu-22.04\n    steps:\n      # Set up dependencies\n      - uses: actions/checkout@v3\n      - uses: actions/setup-python@v4\n        with:\n          python-version: '3.10.11'\n          cache: 'pip'\n      - run: python3 -m pip install mkdocs==1.4.2 mkdocstrings==0.21.2 \"mkdocstrings[python]>=0.18\"\n\n      # Deploy docs\n      - name: Deploy documentation\n        run: mkdocs gh-deploy --force\n"
  },
  {
    "path": ".github/workflows/json_to_md.py",
    "content": "import json\nimport sys\n\n\ndef to_markdown(data):\n    markdown = \"\"\n    for key, value in data.items():\n        markdown += f\"**{key}:**\\n\\n\"\n        if isinstance(value, dict):\n            markdown += \"| Key | Value |\\n| --- | --- |\\n\"\n            for nested_key, nested_value in value.items():\n                nested_value = (\n                    round(nested_value, 3)\n                    if isinstance(nested_value, float)\n                    else {k: round(v, 3) for k, v in nested_value.items()}\n                    if isinstance(nested_value, dict)\n                    else nested_value\n                )\n                markdown += f\"| {nested_key} | {nested_value} |\\n\"\n        elif isinstance(value, list) and all(isinstance(item, dict) for item in value):\n            if value:\n                headers = sorted(set().union(*[item.keys() for item in value]))\n                markdown += \"| \" + \" | \".join(headers) + \" |\\n| \" + \" | \".join([\"---\"] * len(headers)) + \" |\\n\"\n                for item in value:\n                    value_list = [\n                        \"{:.3e}\".format(float(item.get(header, \"\"))) if not str(item.get(header, \"\")).isdigit() else str(item.get(header, \"\"))\n                        for header in headers\n                    ]\n                    markdown += \"| \" + \" | \".join(value_list) + \" |\\n\"\n            else:\n                markdown += \"(empty list)\\n\"\n        else:\n            markdown += f\"{value}\\n\"\n        markdown += \"\\n\"\n    return markdown\n\n\ndef json_to_markdown(json_fp, md_fp):\n    \"\"\"Convert a json file to markdown.\"\"\"\n    # Read JSON file\n    with open(json_fp, \"r\") as file:\n        data = json.load(file)\n\n    # Convert to markdown\n    markdown = to_markdown(data)\n\n    # Save to markdown file\n    with open(md_fp, \"w\") as file:\n        file.write(markdown)\n    return markdown\n\n\nif __name__ == \"__main__\":\n    # Check if the correct number of arguments is provided\n    if len(sys.argv) < 3:\n        print(\"Usage: python script.py <json_file> <output_file>\")\n        sys.exit(1)\n\n    # Get the JSON file path and output Markdown file path from command-line arguments\n    json_file = sys.argv[1]\n    md_file = sys.argv[2]\n\n    # Call the JSON to Markdown conversion function\n    json_to_markdown(json_file, md_file)\n"
  },
  {
    "path": ".github/workflows/serve.yaml",
    "content": "name: serve\non:\n  workflow_dispatch:  # manual\n  push:\n    branches:\n    - main\npermissions: write-all\n\njobs:\n  serve:\n    runs-on: ubuntu-22.04\n    steps:\n\n      # Configure AWS credentials\n      - name: Configure AWS credentials\n        uses: aws-actions/configure-aws-credentials@v2\n        with:\n          role-to-assume: arn:aws:iam::593241322649:role/github-actions-madewithml\n          role-session-name: s3access\n          aws-region: us-west-2\n\n      # Set up dependencies\n      - uses: actions/checkout@v3\n      - uses: actions/setup-python@v4\n        with:\n          python-version: '3.10.11'\n          cache: 'pip'\n      - run: python3 -m pip install anyscale==0.5.131 typer==0.9.0\n\n      # Serve model\n      - name: Serve model\n        run: |\n          export ANYSCALE_HOST=${{ secrets.ANYSCALE_HOST }}\n          export ANYSCALE_CLI_TOKEN=${{ secrets.ANYSCALE_CLI_TOKEN }}\n          anyscale service rollout --service-config-file deploy/services/serve_model.yaml\n"
  },
  {
    "path": ".github/workflows/workloads.yaml",
    "content": "name: workloads\non:\n  workflow_dispatch:  # manual\n  pull_request:\n    branches:\n    - main\npermissions: write-all\n\njobs:\n  workloads:\n    runs-on: ubuntu-22.04\n    steps:\n\n      # Configure AWS credentials\n      - name: Configure AWS credentials\n        uses: aws-actions/configure-aws-credentials@v2\n        with:\n          role-to-assume: arn:aws:iam::593241322649:role/github-actions-madewithml\n          role-session-name: s3access\n          aws-region: us-west-2\n\n      # Set up dependencies\n      - uses: actions/checkout@v3\n      - uses: actions/setup-python@v4\n        with:\n          python-version: '3.10.11'\n          cache: 'pip'\n      - run: python3 -m pip install anyscale==0.5.131 typer==0.9.0\n\n      # Run workloads\n      - name: Workloads\n        run: |\n          export ANYSCALE_HOST=${{ secrets.ANYSCALE_HOST }}\n          export ANYSCALE_CLI_TOKEN=${{ secrets.ANYSCALE_CLI_TOKEN }}\n          anyscale jobs submit deploy/jobs/workloads.yaml --wait\n\n      # Read results from S3\n      - name: Read results from S3\n        run: |\n          mkdir results\n          aws s3 cp s3://madewithml/${{ github.actor }}/results/ results/ --recursive\n          python .github/workflows/json_to_md.py results/training_results.json results/training_results.md\n          python .github/workflows/json_to_md.py results/evaluation_results.json results/evaluation_results.md\n\n      # Comment results to PR\n      - name: Comment training results on PR\n        uses: thollander/actions-comment-pull-request@v2\n        with:\n          filePath: results/training_results.md\n      - name: Comment evaluation results on PR\n        uses: thollander/actions-comment-pull-request@v2\n        with:\n          filePath: results/evaluation_results.md\n"
  },
  {
    "path": ".gitignore",
    "content": "# Data\nlogs/\nstores/\nmlflow/\nresults/\nworkspaces/\nefs/\n\n# VSCode\n.vscode/\n.idea\n\n# Byte-compiled / optimized / DLL files\n__pycache__/\n*.py[cod]\n*$py.class\n\n# C extensions\n*.so\n\n# Distribution / packaging\n.Python\nbuild/\ndevelop-eggs/\ndist/\ndownloads/\neggs/\n.eggs/\nlib/\nlib64/\nparts/\nsdist/\nvar/\nwheels/\npip-wheel-metadata/\nshare/python-wheels/\n*.egg-info/\n.installed.cfg\n*.egg\nMANIFEST\n\n# PyInstaller\n*.manifest\n*.spec\n\n# Installer logs\npip-log.txt\npip-delete-this-directory.txt\n\n# Unit test / coverage reports\nhtmlcov/\n.tox/\n.nox/\n.coverage\n.coverage.*\n.cache\nnosetests.xml\ncoverage.xml\n*.cover\n*.py,cover\n.hypothesis/\n.pytest_cache/\n\n# Flask:\ninstance/\n.webassets-cache\n\n# Scrapy:\n.scrapy\n\n# Sphinx\ndocs/_build/\n\n# PyBuilder\ntarget/\n\n# IPython\n.ipynb_checkpoints\nprofile_default/\nipython_config.py\n\n# pyenv\n.python-version\n\n# PEP 582\n__pypackages__/\n\n# Celery\ncelerybeat-schedule\ncelerybeat.pid\n\n# Environment\n.env\n.venv\nenv/\nvenv/\nENV/\nenv.bak/\nvenv.bak/\n\n# mkdocs\nsite/\n\n# Airflow\nairflow/airflow.db\n\n# MacOS\n.DS_Store\n\n# Clean up\n.trash/\n"
  },
  {
    "path": ".pre-commit-config.yaml",
    "content": "# See https://pre-commit.com for more information\n# See https://pre-commit.com/hooks.html for more hooks\nrepos:\n-   repo: https://github.com/pre-commit/pre-commit-hooks\n    rev: v4.5.0\n    hooks:\n    -   id: trailing-whitespace\n    -   id: end-of-file-fixer\n    -   id: check-merge-conflict\n    -   id: check-yaml\n    -   id: check-added-large-files\n        args: ['--maxkb=1000']\n        exclude: \"notebooks\"\n    -   id: check-yaml\n        exclude: \"mkdocs.yml\"\n-   repo: local\n    hooks:\n    -   id: clean\n        name: clean\n        entry: make\n        args: [\"clean\"]\n        language: system\n        pass_filenames: false\n"
  },
  {
    "path": "LICENSE",
    "content": "MIT License\n\nCopyright (c) 2023 Made With ML\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n"
  },
  {
    "path": "Makefile",
    "content": "# Makefile\nSHELL = /bin/bash\n\n# Styling\n.PHONY: style\nstyle:\n\tblack .\n\tflake8\n\tpython3 -m isort .\n\tpyupgrade\n\n# Cleaning\n.PHONY: clean\nclean: style\n\tpython notebooks/clear_cell_nums.py\n\tfind . -type f -name \"*.DS_Store\" -ls -delete\n\tfind . | grep -E \"(__pycache__|\\.pyc|\\.pyo)\" | xargs rm -rf\n\tfind . | grep -E \".pytest_cache\" | xargs rm -rf\n\tfind . | grep -E \".ipynb_checkpoints\" | xargs rm -rf\n\trm -rf .coverage*\n"
  },
  {
    "path": "README.md",
    "content": "<div align=\"center\">\n<h1><img width=\"30\" src=\"https://madewithml.com/static/images/rounded_logo.png\">&nbsp;<a href=\"https://madewithml.com/\">Made With ML</a></h1>\nDesign · Develop · Deploy · Iterate\n<br>\nJoin 40K+ developers in learning how to responsibly deliver value with ML.\n    <br>\n</div>\n\n<br>\n\n<div align=\"center\">\n    <a target=\"_blank\" href=\"https://madewithml.com/\"><img src=\"https://img.shields.io/badge/Subscribe-40K-brightgreen\"></a>&nbsp;\n    <a target=\"_blank\" href=\"https://github.com/GokuMohandas/Made-With-ML\"><img src=\"https://img.shields.io/github/stars/GokuMohandas/Made-With-ML.svg?style=social&label=Star\"></a>&nbsp;\n    <a target=\"_blank\" href=\"https://www.linkedin.com/in/goku\"><img src=\"https://img.shields.io/badge/style--5eba00.svg?label=LinkedIn&logo=linkedin&style=social\"></a>&nbsp;\n    <a target=\"_blank\" href=\"https://twitter.com/GokuMohandas\"><img src=\"https://img.shields.io/twitter/follow/GokuMohandas.svg?label=Follow&style=social\"></a>\n    <br>\n    🔥&nbsp; Among the <a href=\"https://github.com/GokuMohandas/Made-With-ML\" target=\"_blank\">top ML repositories</a> on GitHub\n</div>\n\n<br>\n<hr>\n\n## Lessons\n\nLearn how to combine machine learning with software engineering to design, develop, deploy and iterate on production-grade ML applications.\n\n- Lessons: https://madewithml.com/\n- Code: [GokuMohandas/Made-With-ML](https://github.com/GokuMohandas/Made-With-ML)\n\n<a href=\"https://madewithml.com/#course\">\n  <img src=\"https://madewithml.com/static/images/lessons.png\" alt=\"lessons\">\n</a>\n\n## Overview\n\nIn this course, we'll go from experimentation (design + development) to production (deployment + iteration). We'll do this iteratively by motivating the components that will enable us to build a *reliable* production system.\n\n<blockquote>\n  <img width=20 src=\"https://upload.wikimedia.org/wikipedia/commons/thumb/0/09/YouTube_full-color_icon_%282017%29.svg/640px-YouTube_full-color_icon_%282017%29.svg.png\">&nbsp; Be sure to watch the video below for a quick overview of what we'll be building.\n</blockquote>\n\n<div align=\"center\">\n  <a href=\"https://youtu.be/AWgkt8H8yVo\"><img src=\"https://img.youtube.com/vi/AWgkt8H8yVo/0.jpg\" alt=\"Course overview video\"></a>\n</div>\n\n<br>\n\n- **💡 First principles**: before we jump straight into the code, we develop a first principles understanding for every machine learning concept.\n- **💻 Best practices**: implement software engineering best practices as we develop and deploy our machine learning models.\n- **📈 Scale**: easily scale ML workloads (data, train, tune, serve) in Python without having to learn completely new languages.\n- **⚙️ MLOps**: connect MLOps components (tracking, testing, serving, orchestration, etc.) as we build an end-to-end machine learning system.\n- **🚀 Dev to Prod**: learn how to quickly and reliably go from development to production without any changes to our code or infra management.\n- **🐙 CI/CD**: learn how to create mature CI/CD workflows to continuously train and deploy better models in a modular way that integrates with any stack.\n\n## Audience\n\nMachine learning is not a separate industry, instead, it's a powerful way of thinking about data that's not reserved for any one type of person.\n\n- **👩‍💻 All developers**: whether software/infra engineer or data scientist, ML is increasingly becoming a key part of the products that you'll be developing.\n- **👩‍🎓 College graduates**: learn the practical skills required for industry and bridge gap between the university curriculum and what industry expects.\n- **👩‍💼 Product/Leadership**: who want to develop a technical foundation so that they can build amazing (and reliable) products powered by machine learning.\n\n## Set up\n\nBe sure to go through the [course](https://madewithml/#course) for a much more detailed walkthrough of the content on this repository. We will have instructions for both local laptop and Anyscale clusters for the sections below, so be sure to toggle the ► dropdown based on what you're using (Anyscale instructions will be toggled on by default). If you do want to run this course with Anyscale, where we'll provide the **structure**, **compute (GPUs)** and **community** to learn everything in one day, join our next upcoming live cohort → [sign up here](https://4190urw86oh.typeform.com/madewithml)!\n\n### Cluster\n\nWe'll start by setting up our cluster with the environment and compute configurations.\n\n<details>\n  <summary>Local</summary><br>\n  Your personal laptop (single machine) will act as the cluster, where one CPU will be the head node and some of the remaining CPU will be the worker nodes. All of the code in this course will work in any personal laptop though it will be slower than executing the same workloads on a larger cluster.\n</details>\n\n<details open>\n  <summary>Anyscale</summary><br>\n\n  We can create an [Anyscale Workspace](https://docs.anyscale.com/develop/workspaces/get-started) using the [webpage UI](https://console.anyscale.com/o/madewithml/workspaces/add/blank).\n\n  ```md\n  - Workspace name: `madewithml`\n  - Project: `madewithml`\n  - Cluster environment name: `madewithml-cluster-env`\n  # Toggle `Select from saved configurations`\n  - Compute config: `madewithml-cluster-compute-g5.4xlarge`\n  ```\n\n  > Alternatively, we can use the [CLI](https://docs.anyscale.com/reference/anyscale-cli) to create the workspace via `anyscale workspace create ...`\n\n</details>\n\n<details>\n  <summary>Other (cloud platforms, K8s, on-prem)</summary><br>\n\n  If you don't want to do this course locally or via Anyscale, you have the following options:\n\n  - On [AWS and GCP](https://docs.ray.io/en/latest/cluster/vms/index.html#cloud-vm-index). Community-supported Azure and Aliyun integrations also exist.\n  - On [Kubernetes](https://docs.ray.io/en/latest/cluster/kubernetes/index.html#kuberay-index), via the officially supported KubeRay project.\n  - Deploy Ray manually [on-prem](https://docs.ray.io/en/latest/cluster/vms/user-guides/launching-clusters/on-premises.html#on-prem) or onto platforms [not listed here](https://docs.ray.io/en/latest/cluster/vms/user-guides/community/index.html#ref-cluster-setup).\n\n</details>\n\n### Git setup\n\nCreate a repository by following these instructions: [Create a new repository](https://github.com/new) → name it `Made-With-ML` → Toggle `Add a README file` (**very important** as this creates a `main` branch) → Click `Create repository` (scroll down)\n\nNow we're ready to clone the repository that has all of our code:\n\n```bash\ngit clone https://github.com/GokuMohandas/Made-With-ML.git .\n```\n\n### Credentials\n\n```bash\ntouch .env\n```\n```bash\n# Inside .env\nGITHUB_USERNAME=\"CHANGE_THIS_TO_YOUR_USERNAME\"  # ← CHANGE THIS\n```\n```bash\nsource .env\n```\n\n### Virtual environment\n\n<details>\n  <summary>Local</summary><br>\n\n  ```bash\n  export PYTHONPATH=$PYTHONPATH:$PWD\n  python3 -m venv venv  # recommend using Python 3.10\n  source venv/bin/activate  # on Windows: venv\\Scripts\\activate\n  python3 -m pip install --upgrade pip setuptools wheel\n  python3 -m pip install -r requirements.txt\n  pre-commit install\n  pre-commit autoupdate\n  ```\n\n  > Highly recommend using Python `3.10` and using [pyenv](https://github.com/pyenv/pyenv) (mac) or [pyenv-win](https://github.com/pyenv-win/pyenv-win) (windows).\n\n</details>\n\n<details open>\n  <summary>Anyscale</summary><br>\n\n  Our environment with the appropriate Python version and libraries is already all set for us through the cluster environment we used when setting up our Anyscale Workspace. So we just need to run these commands:\n  ```bash\n  export PYTHONPATH=$PYTHONPATH:$PWD\n  pre-commit install\n  pre-commit autoupdate\n  ```\n\n</details>\n\n## Notebook\n\nStart by exploring the [jupyter notebook](notebooks/madewithml.ipynb) to interactively walkthrough the core machine learning workloads.\n\n<div align=\"center\">\n  <img src=\"https://madewithml.com/static/images/mlops/systems-design/workloads.png\">\n</div>\n\n<details>\n  <summary>Local</summary><br>\n\n  ```bash\n  # Start notebook\n  jupyter lab notebooks/madewithml.ipynb\n```\n\n</details>\n\n<details open>\n  <summary>Anyscale</summary><br>\n\n  Click on the Jupyter icon &nbsp;<img width=15 src=\"https://upload.wikimedia.org/wikipedia/commons/thumb/3/38/Jupyter_logo.svg/1200px-Jupyter_logo.svg.png\">&nbsp; at the top right corner of our Anyscale Workspace page and this will open up our JupyterLab instance in a new tab. Then navigate to the `notebooks` directory and open up the `madewithml.ipynb` notebook.\n\n</details>\n\n\n## Scripts\n\nNow we'll execute the same workloads using the clean Python scripts following software engineering best practices (testing, documentation, logging, serving, versioning, etc.) The code we've implemented in our notebook will be refactored into the following scripts:\n\n```bash\nmadewithml\n├── config.py\n├── data.py\n├── evaluate.py\n├── models.py\n├── predict.py\n├── serve.py\n├── train.py\n├── tune.py\n└── utils.py\n```\n\n**Note**: Change the `--num-workers`, `--cpu-per-worker`, and `--gpu-per-worker` input argument values below based on your system's resources. For example, if you're on a local laptop, a reasonable configuration would be `--num-workers 6 --cpu-per-worker 1 --gpu-per-worker 0`.\n\n### Training\n```bash\nexport EXPERIMENT_NAME=\"llm\"\nexport DATASET_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\"\nexport TRAIN_LOOP_CONFIG='{\"dropout_p\": 0.5, \"lr\": 1e-4, \"lr_factor\": 0.8, \"lr_patience\": 3}'\npython madewithml/train.py \\\n    --experiment-name \"$EXPERIMENT_NAME\" \\\n    --dataset-loc \"$DATASET_LOC\" \\\n    --train-loop-config \"$TRAIN_LOOP_CONFIG\" \\\n    --num-workers 1 \\\n    --cpu-per-worker 3 \\\n    --gpu-per-worker 1 \\\n    --num-epochs 10 \\\n    --batch-size 256 \\\n    --results-fp results/training_results.json\n```\n\n### Tuning\n```bash\nexport EXPERIMENT_NAME=\"llm\"\nexport DATASET_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\"\nexport TRAIN_LOOP_CONFIG='{\"dropout_p\": 0.5, \"lr\": 1e-4, \"lr_factor\": 0.8, \"lr_patience\": 3}'\nexport INITIAL_PARAMS=\"[{\\\"train_loop_config\\\": $TRAIN_LOOP_CONFIG}]\"\npython madewithml/tune.py \\\n    --experiment-name \"$EXPERIMENT_NAME\" \\\n    --dataset-loc \"$DATASET_LOC\" \\\n    --initial-params \"$INITIAL_PARAMS\" \\\n    --num-runs 2 \\\n    --num-workers 1 \\\n    --cpu-per-worker 3 \\\n    --gpu-per-worker 1 \\\n    --num-epochs 10 \\\n    --batch-size 256 \\\n    --results-fp results/tuning_results.json\n```\n\n### Experiment tracking\n\nWe'll use [MLflow](https://mlflow.org/) to track our experiments and store our models and the [MLflow Tracking UI](https://www.mlflow.org/docs/latest/tracking.html#tracking-ui) to view our experiments. We have been saving our experiments to a local directory but note that in an actual production setting, we would have a central location to store all of our experiments. It's easy/inexpensive to spin up your own MLflow server for all of your team members to track their experiments on or use a managed solution like [Weights & Biases](https://wandb.ai/site), [Comet](https://www.comet.ml/), etc.\n\n```bash\nexport MODEL_REGISTRY=$(python -c \"from madewithml import config; print(config.MODEL_REGISTRY)\")\nmlflow server -h 0.0.0.0 -p 8080 --backend-store-uri $MODEL_REGISTRY\n```\n\n<details>\n  <summary>Local</summary><br>\n\n  If you're running this notebook on your local laptop then head on over to <a href=\"http://localhost:8080/\" target=\"_blank\">http://localhost:8080/</a> to view your MLflow dashboard.\n\n</details>\n\n<details open>\n  <summary>Anyscale</summary><br>\n\n  If you're on <a href=\"https://docs.anyscale.com/develop/workspaces/get-started\" target=\"_blank\">Anyscale Workspaces</a>, then we need to first expose the port of the MLflow server. Run the following command on your Anyscale Workspace terminal to generate the public URL to your MLflow server.\n\n  ```bash\n  APP_PORT=8080\n  echo https://$APP_PORT-port-$ANYSCALE_SESSION_DOMAIN\n  ```\n\n</details>\n\n### Evaluation\n```bash\nexport EXPERIMENT_NAME=\"llm\"\nexport RUN_ID=$(python madewithml/predict.py get-best-run-id --experiment-name $EXPERIMENT_NAME --metric val_loss --mode ASC)\nexport HOLDOUT_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/holdout.csv\"\npython madewithml/evaluate.py \\\n    --run-id $RUN_ID \\\n    --dataset-loc $HOLDOUT_LOC \\\n    --results-fp results/evaluation_results.json\n```\n```json\n{\n  \"timestamp\": \"June 09, 2023 09:26:18 AM\",\n  \"run_id\": \"6149e3fec8d24f1492d4a4cabd5c06f6\",\n  \"overall\": {\n    \"precision\": 0.9076136428670714,\n    \"recall\": 0.9057591623036649,\n    \"f1\": 0.9046792827719773,\n    \"num_samples\": 191.0\n  },\n...\n```\n\n### Inference\n```bash\nexport EXPERIMENT_NAME=\"llm\"\nexport RUN_ID=$(python madewithml/predict.py get-best-run-id --experiment-name $EXPERIMENT_NAME --metric val_loss --mode ASC)\npython madewithml/predict.py predict \\\n    --run-id $RUN_ID \\\n    --title \"Transfer learning with transformers\" \\\n    --description \"Using transformers for transfer learning on text classification tasks.\"\n```\n```json\n[{\n  \"prediction\": [\n    \"natural-language-processing\"\n  ],\n  \"probabilities\": {\n    \"computer-vision\": 0.0009767753,\n    \"mlops\": 0.0008223939,\n    \"natural-language-processing\": 0.99762577,\n    \"other\": 0.000575123\n  }\n}]\n```\n\n### Serving\n\n<details>\n  <summary>Local</summary><br>\n\n  ```bash\n  # Start\n  ray start --head\n  ```\n\n  ```bash\n  # Set up\n  export EXPERIMENT_NAME=\"llm\"\n  export RUN_ID=$(python madewithml/predict.py get-best-run-id --experiment-name $EXPERIMENT_NAME --metric val_loss --mode ASC)\n  python madewithml/serve.py --run_id $RUN_ID\n  ```\n\n  Once the application is running, we can use it via cURL, Python, etc.:\n\n  ```python\n  # via Python\n  import json\n  import requests\n  title = \"Transfer learning with transformers\"\n  description = \"Using transformers for transfer learning on text classification tasks.\"\n  json_data = json.dumps({\"title\": title, \"description\": description})\n  requests.post(\"http://127.0.0.1:8000/predict\", data=json_data).json()\n  ```\n\n  ```bash\n  ray stop  # shutdown\n  ```\n\n</details>\n\n<details open>\n  <summary>Anyscale</summary><br>\n\n  In Anyscale Workspaces, Ray is already running so we don't have to manually start/shutdown like we have to do locally.\n\n  ```bash\n  # Set up\n  export EXPERIMENT_NAME=\"llm\"\n  export RUN_ID=$(python madewithml/predict.py get-best-run-id --experiment-name $EXPERIMENT_NAME --metric val_loss --mode ASC)\n  python madewithml/serve.py --run_id $RUN_ID\n  ```\n\n  Once the application is running, we can use it via cURL, Python, etc.:\n\n  ```python\n  # via Python\n  import json\n  import requests\n  title = \"Transfer learning with transformers\"\n  description = \"Using transformers for transfer learning on text classification tasks.\"\n  json_data = json.dumps({\"title\": title, \"description\": description})\n  requests.post(\"http://127.0.0.1:8000/predict\", data=json_data).json()\n  ```\n\n</details>\n\n### Testing\n```bash\n# Code\npython3 -m pytest tests/code --verbose --disable-warnings\n\n# Data\nexport DATASET_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\"\npytest --dataset-loc=$DATASET_LOC tests/data --verbose --disable-warnings\n\n# Model\nexport EXPERIMENT_NAME=\"llm\"\nexport RUN_ID=$(python madewithml/predict.py get-best-run-id --experiment-name $EXPERIMENT_NAME --metric val_loss --mode ASC)\npytest --run-id=$RUN_ID tests/model --verbose --disable-warnings\n\n# Coverage\npython3 -m pytest tests/code --cov madewithml --cov-report html --disable-warnings  # html report\npython3 -m pytest tests/code --cov madewithml --cov-report term --disable-warnings  # terminal report\n```\n\n## Production\n\nFrom this point onwards, in order to deploy our application into production, we'll need to either be on Anyscale or on a [cloud VM](https://docs.ray.io/en/latest/cluster/vms/index.html#cloud-vm-index) / [on-prem](https://docs.ray.io/en/latest/cluster/vms/user-guides/launching-clusters/on-premises.html#on-prem) cluster you manage yourself (w/ Ray). If not on Anyscale, the commands will be [slightly different](https://docs.ray.io/en/latest/cluster/running-applications/job-submission/index.html) but the concepts will be the same.\n\n> If you don't want to set up all of this yourself, we highly recommend joining our [upcoming live cohort](https://4190urw86oh.typeform.com/madewithml){:target=\"_blank\"} where we'll provide an environment with all of this infrastructure already set up for you so that you just focused on the machine learning.\n\n<div align=\"center\">\n  <img src=\"https://madewithml.com/static/images/mlops/jobs_and_services/manual.png\">\n</div>\n\n### Authentication\n\nThese credentials below are **automatically** set for us if we're using Anyscale Workspaces. We **do not** need to set these credentials explicitly on Workspaces but we do if we're running this locally or on a cluster outside of where our Anyscale Jobs and Services are configured to run.\n\n``` bash\nexport ANYSCALE_HOST=https://console.anyscale.com\nexport ANYSCALE_CLI_TOKEN=$YOUR_CLI_TOKEN  # retrieved from Anyscale credentials page\n```\n\n### Cluster environment\n\nThe cluster environment determines **where** our workloads will be executed (OS, dependencies, etc.) We've already created this [cluster environment](./deploy/cluster_env.yaml) for us but this is how we can create/update one ourselves.\n\n```bash\nexport CLUSTER_ENV_NAME=\"madewithml-cluster-env\"\nanyscale cluster-env build deploy/cluster_env.yaml --name $CLUSTER_ENV_NAME\n```\n\n### Compute configuration\n\nThe compute configuration determines **what** resources our workloads will be executes on. We've already created this [compute configuration](./deploy/cluster_compute.yaml) for us but this is how we can create it ourselves.\n\n```bash\nexport CLUSTER_COMPUTE_NAME=\"madewithml-cluster-compute-g5.4xlarge\"\nanyscale cluster-compute create deploy/cluster_compute.yaml --name $CLUSTER_COMPUTE_NAME\n```\n\n### Anyscale jobs\n\nNow we're ready to execute our ML workloads. We've decided to combine them all together into one [job](./deploy/jobs/workloads.yaml) but we could have also created separate jobs for each workload (train, evaluate, etc.) We'll start by editing the `$GITHUB_USERNAME` slots inside our [`workloads.yaml`](./deploy/jobs/workloads.yaml) file:\n```yaml\nruntime_env:\n  working_dir: .\n  upload_path: s3://madewithml/$GITHUB_USERNAME/jobs  # <--- CHANGE USERNAME (case-sensitive)\n  env_vars:\n    GITHUB_USERNAME: $GITHUB_USERNAME  # <--- CHANGE USERNAME (case-sensitive)\n```\n\nThe `runtime_env` here specifies that we should upload our current `working_dir` to an S3 bucket so that all of our workers when we execute an Anyscale Job have access to the code to use. The `GITHUB_USERNAME` is used later to save results from our workloads to S3 so that we can retrieve them later (ex. for serving).\n\nNow we're ready to submit our job to execute our ML workloads:\n```bash\nanyscale job submit deploy/jobs/workloads.yaml\n```\n\n### Anyscale Services\n\nAnd after our ML workloads have been executed, we're ready to launch our serve our model to production. Similar to our Anyscale Jobs configs, be sure to change the `$GITHUB_USERNAME` in [`serve_model.yaml`](./deploy/services/serve_model.yaml).\n\n```yaml\nray_serve_config:\n  import_path: deploy.services.serve_model:entrypoint\n  runtime_env:\n    working_dir: .\n    upload_path: s3://madewithml/$GITHUB_USERNAME/services  # <--- CHANGE USERNAME (case-sensitive)\n    env_vars:\n      GITHUB_USERNAME: $GITHUB_USERNAME  # <--- CHANGE USERNAME (case-sensitive)\n```\n\nNow we're ready to launch our service:\n```bash\n# Rollout service\nanyscale service rollout -f deploy/services/serve_model.yaml\n\n# Query\ncurl -X POST -H \"Content-Type: application/json\" -H \"Authorization: Bearer $SECRET_TOKEN\" -d '{\n  \"title\": \"Transfer learning with transformers\",\n  \"description\": \"Using transformers for transfer learning on text classification tasks.\"\n}' $SERVICE_ENDPOINT/predict/\n\n# Rollback (to previous version of the Service)\nanyscale service rollback -f $SERVICE_CONFIG --name $SERVICE_NAME\n\n# Terminate\nanyscale service terminate --name $SERVICE_NAME\n```\n\n### CI/CD\n\nWe're not going to manually deploy our application every time we make a change. Instead, we'll automate this process using GitHub Actions!\n\n<div align=\"center\">\n  <img src=\"https://madewithml.com/static/images/mlops/cicd/cicd.png\">\n</div>\n\n1. Create a new github branch to save our changes to and execute CI/CD workloads:\n```bash\ngit remote set-url origin https://github.com/$GITHUB_USERNAME/Made-With-ML.git  # <-- CHANGE THIS to your username\ngit checkout -b dev\n```\n\n2. We'll start by adding the necessary credentials to the [`/settings/secrets/actions`](https://github.com/GokuMohandas/Made-With-ML/settings/secrets/actions) page of our GitHub repository.\n\n``` bash\nexport ANYSCALE_HOST=https://console.anyscale.com\nexport ANYSCALE_CLI_TOKEN=$YOUR_CLI_TOKEN  # retrieved from https://console.anyscale.com/o/madewithml/credentials\n```\n\n3. Now we can make changes to our code (not on `main` branch) and push them to GitHub. But in order to push our code to GitHub, we'll need to first authenticate with our credentials before pushing to our repository:\n\n```bash\ngit config --global user.name $GITHUB_USERNAME  # <-- CHANGE THIS to your username\ngit config --global user.email you@example.com  # <-- CHANGE THIS to your email\ngit add .\ngit commit -m \"\"  # <-- CHANGE THIS to your message\ngit push origin dev\n```\n\nNow you will be prompted to enter your username and password (personal access token). Follow these steps to get personal access token: [New GitHub personal access token](https://github.com/settings/tokens/new) → Add a name → Toggle `repo` and `workflow` → Click `Generate token` (scroll down) → Copy the token and paste it when prompted for your password.\n\n4. Now we can start a PR from this branch to our `main` branch and this will trigger the [workloads workflow](/.github/workflows/workloads.yaml). If the workflow (Anyscale Jobs) succeeds, this will produce comments with the training and evaluation results directly on the PR.\n\n<div align=\"center\">\n  <img src=\"https://madewithml.com/static/images/mlops/cicd/comments.png\">\n</div>\n\n5. If we like the results, we can merge the PR into the `main` branch. This will trigger the [serve workflow](/.github/workflows/serve.yaml) which will rollout our new service to production!\n\n### Continual learning\n\nWith our CI/CD workflow in place to deploy our application, we can now focus on continually improving our model. It becomes really easy to extend on this foundation to connect to scheduled runs (cron), [data pipelines](https://madewithml.com/courses/mlops/data-engineering/), drift detected through [monitoring](https://madewithml.com/courses/mlops/monitoring/), [online evaluation](https://madewithml.com/courses/mlops/evaluation/#online-evaluation), etc. And we can easily add additional context such as comparing any experiment with what's currently in production (directly in the PR even), etc.\n\n<div align=\"center\">\n  <img src=\"https://madewithml.com/static/images/mlops/cicd/continual.png\">\n</div>\n\n## FAQ\n\n### Jupyter notebook kernels\n\nIssues with configuring the notebooks with jupyter? By default, jupyter will use the kernel with our virtual environment but we can also manually add it to jupyter:\n```bash\npython3 -m ipykernel install --user --name=venv\n```\nNow we can open up a notebook → Kernel (top menu bar) → Change Kernel → `venv`. To ever delete this kernel, we can do the following:\n```bash\njupyter kernelspec list\njupyter kernelspec uninstall venv\n```\n"
  },
  {
    "path": "datasets/dataset.csv",
    "content": "id,created_on,title,description,tag\n6,2020-02-20 06:43:18,Comparison between YOLO and RCNN on real world videos,Bringing theory to experiment is cool. We can easily train models in colab and find the results in minutes.,computer-vision\n7,2020-02-20 06:47:21,\"Show, Infer & Tell: Contextual Inference for Creative Captioning\",\"The beauty of the work lies in the way it architects the fundamental idea that humans look at the overall image and then individual pieces of it.\n\",computer-vision\n9,2020-02-24 16:24:45,Awesome Graph Classification,\"A collection of important graph embedding, classification and representation learning papers with implementations.\",other\n15,2020-02-28 23:55:26,Awesome Monte Carlo Tree Search,A curated list of Monte Carlo tree search papers with implementations. ,other\n25,2020-03-07 23:04:31,AttentionWalk,\"A PyTorch Implementation of \"\"Watch Your Step: Learning Node Embeddings via Graph Attention\"\" (NeurIPS 2018). \",other\n27,2020-03-07 23:18:15,APPNP and PPNP,\"A PyTorch implementation of \"\"Predict then Propagate: Graph Neural Networks meet Personalized PageRank\"\" (ICLR 2019). \",other\n28,2020-03-07 23:23:46,Attributed Social Network Embedding,\"A sparsity aware and memory efficient implementation of \"\"Attributed Social Network Embedding\"\" (TKDE 2018). \",other\n29,2020-03-07 23:45:38,Signed Graph Convolutional Network,\"A PyTorch implementation of \"\"Signed Graph Convolutional Network\"\" (ICDM 2018). \",other\n45,2020-03-08 00:39:08,SimGNN,\"A PyTorch implementation of \"\"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation\"\" (WSDM 2019). \",other\n61,2020-03-16 17:35:22,Using JAX to Improve Separable Image Filters,Optimizing the filters to improve the filtered images for computer vision tasks.,computer-vision\n65,2020-03-19 18:42:05,Coloring Greyscale Images,Coloring black and white images with neural networks.,computer-vision\n67,2020-03-19 19:04:43,Fruit Detection using Convolution Neural Networks in TensorFlow,\"Trained a Convolutional Neural Network Model to predict fruits of over 100+ Classes (types) with a training accuracy of over 95%, and testing accuracy of over 9\",computer-vision\n73,2020-03-19 23:45:14,Face Verification,Implementation of Siamese Neural network model used for face verification. The dataset used for this task is IMDB-WIKI-face images Dataset.,computer-vision\n77,2020-03-20 03:23:27,Sign Language Interpreter using Deep Learning,\"A sign language interpreter using live video feed from the camera. The project was completed in 24 hours as part of HackUNT-19, the University of North Texas's \",computer-vision\n78,2020-03-20 03:32:09,The Illustrated Self-Supervised Learning,A visual introduction to self-supervised learning methods in Computer Vision,computer-vision\n81,2020-03-20 06:07:56,GradCAM for the BreaKHis Dataset,An NBDev package for fine-tuning ResNets to visualize gradient-weighted class activation for the BreaKHis dataset.,computer-vision\n85,2020-03-20 17:35:59,Message Passing GNNs C++,C++ implementation using Eigen for the forward pass of Graph Convolutional Neural Networks.,other\n89,2020-03-20 18:17:31,Rethinking Batch Normalization in Transformers,\"We found that NLP batch statistics exhibit large variance throughout training, which leads to poor BN performance.\",natural-language-processing\n91,2020-03-20 18:30:04,Pytest Board,Continuous pytest runner with awesome visualization.,mlops\n92,2020-03-20 18:43:50,Image Spam Buster - Kreate Hackathon,\"\"\"Spam Buster\"\" for user generated IMAGE content.\",computer-vision\n98,2020-03-20 19:16:43,Bachelorette Predictor,Predict the Bachelorette winners from profile images.,computer-vision\n99,2020-03-20 21:32:14,Gender Change of People's Face using CycleGAN,CycleGAN architecture in Keras and train the model with CelebA faces dataset to perform gender change on people's faces.,computer-vision\n101,2020-03-21 04:19:04,ELECTRA: Pre-training Text Encoders as Discriminators,PyTorch implementation of the electra model from the paper: ELECTRA - Pre-training Text Encoders as Discriminators Rather Than Generators,natural-language-processing\n108,2020-03-21 23:17:38,Tuned ALBERT (ensemble model),Top 6 in Squad 2.0,natural-language-processing\n109,2020-03-21 23:25:33,iyasai: Book Recommendation System,Recommender system for books and stories that could help you and your loved ones lift up your mood whenever you are facing stress or unpleasant situations.,natural-language-processing\n112,2020-03-21 23:58:46,Learning to See before Learning to Act: Visual Pre-training,We find that pre-training on vision tasks significantly improves generalization and sample efficiency for learning to manipulate objects.,computer-vision\n115,2020-03-22 01:26:14,SOLT: Data Augmentation for Deep Learning,\"Data augmentation library for Deep Learning, which supports images, segmentation masks, labels and key points.\",computer-vision\n116,2020-03-22 01:37:27,PCDet: 3D Point Cloud Detection,PCDet Toolbox in PyTorch for 3D Object Detection from Point Cloud,computer-vision\n117,2020-03-22 01:47:09,SiamFC++: Towards Robust and Accurate Visual Tracking,\"Implementation of a series of basic algorithms which is useful for video understanding, including Single Object Tracking (SOT), Video Object Segmentation (VOS).\",computer-vision\n118,2020-03-22 21:46:52,Sinext,Sign language to text with OpenCV and MNIST sign-language dataset,computer-vision\n120,2020-03-24 04:38:08,Gliding Vertex on Horizontal Bounding Box for Object Detection,Gliding vertex on the horizontal bounding box for multi-oriented object detection.,computer-vision\n121,2020-03-24 04:56:38,Deep Reinforcement Learning in TensorFlow2,deep-rl-tf2 is a repository that implements a variety of polular Deep-RL algorithms using TF2. The key to this repo is an easy to understand code. ,other\n122,2020-03-24 17:51:35,Custom Classifier on Top of Bert-like Language Model,Take pre-trained language model and build custom classifier on top of it.,natural-language-processing\n123,2020-03-24 18:20:55,Using Different Decoding Methods for LM with Transformers,A look at different decoding methods for generate subsequent tokens in language modeling.,natural-language-processing\n124,2020-03-24 21:12:12,Unsupervised Toolbox,\"Unsupervised learning Tool box : A micro framework for State of the Art Methods and models for unsupervised learning for NLU / NLG\n\",natural-language-processing\n128,2020-03-25 15:21:34,Multimodal Brain Tumor Segmentation,Segmentation of gliomas in pre-operative MRI scans. Use the provided clinically-acquired training data to produce segmentation labels.,computer-vision\n133,2020-03-25 20:21:26,A Survey of Long-Term Context in Transformers,Over the past two years the NLP community has developed a veritable zoo of methods to combat expensive multi-head self-attention.,natural-language-processing\n137,2020-03-27 14:39:53,Debugging Neural Networks with PyTorch and W&B,A closer look at debugging common issues when training neural networks.,mlops\n138,2020-03-27 14:50:02,BachGAN: High-Res Image Synthesis from Salient Object Layout,We propose a new task towards more practical application for image generation - high-quality image synthesis from salient object layout. ,computer-vision\n140,2020-03-28 07:49:03,Visual Paper Summary: ALBERT(A Lite BERT),An illustrated summary of ALBERT paper and how it improves BERT and makes it resource efficient,natural-language-processing\n145,2020-03-30 04:14:44,Controllable Person Image Synthesis with Attribute-Decomposed GAN,\"A novel generative model for controllable person image synthesis, which can produce realistic person images with desired human attributes.\",computer-vision\n147,2020-03-30 05:39:57,Back Translation for Text Augmentation with Google Sheets,Learn how to augment existing labeled text data for free using Google Sheets.,natural-language-processing\n148,2020-03-30 14:13:46,An Illustrated Guide to Graph Neural Networks,A breakdown of the inner workings of GNNs.,other\n150,2020-04-01 08:26:46,The Illustrated FixMatch for Semi-Supervised Learning,Learn how to leverage unlabeled data using FixMatch for semi-supervised learning,computer-vision\n152,2020-04-01 15:38:58,A Two-Step Graph Convolutional Decoder for Molecule Generation,A simple auto-encoder framework for molecule generation.,other\n157,2020-04-03 01:56:32,TransMoMo: Invariance-Driven Unsupervised Motion Retargeting,A lightweight video motion retargeting approach that is capable of transferring motion of a person in a source video realistically to another video of a target ,computer-vision\n158,2020-04-03 04:41:07,Tracking Objects as Points,Simultaneous object detection and tracking using center points.,computer-vision\n159,2020-04-03 14:57:11,Drifter-ML,A machine learning testing framework for sklearn and pandas.  The goal is to help folks assess whether things have changed over time.,mlops\n162,2020-04-03 20:17:50,Natural Language Processing News,Get the highlights from Natural Language Processing & Machine Learning research & industry straight to your inbox every month.,natural-language-processing\n163,2020-04-03 20:21:13,NLP Newsletter,\"Democratizing Artificial Intelligence Research, Education, and Technologies.\",natural-language-processing\n168,2020-04-04 17:54:28,Self-Supervised Scene De-occlusion,\"We investigate the problem of scene de-occlusion, which aims to recover the underlying occlusion ordering and complete the invisible parts of occluded objects.\",computer-vision\n173,2020-04-05 03:00:05,Design Patterns for Production NLP Systems,Designs and tips for designing NLP production systems.,natural-language-processing\n181,2020-04-05 14:56:34,Talking-Heads Attention,\"A variation on multi-head attention which includes linear projections across the attention-heads dimension, immediately before and after the softmax operation.\",natural-language-processing\n183,2020-04-05 17:50:10,What does a CNN see?,First super clean notebook showcasing @TensorFlow 2.0. An example of end-to-end DL with interpretability.,computer-vision\n219,2020-04-06 14:10:22,Natural Language Processing: Pretraining - d2l,\"An interactive deep learning book with code, math, and discussions, based on the NumPy interface.\",natural-language-processing\n224,2020-04-06 16:48:44,Understanding Convolutional Neural Networks for NLP,More recently we’ve also started to apply CNNs to problems in Natural Language Processing and gotten some interesting results.,natural-language-processing\n234,2020-04-06 17:42:52,An Overview of Semantic Image Segmentation,Image segmentation is a computer vision task in which we label specific regions of an image according to what's being shown.,computer-vision\n237,2020-04-06 18:02:48,Common Architectures in Convolutional Neural Networks,\"In this post, I'll discuss commonly used architectures for convolutional networks. \",computer-vision\n238,2020-04-06 18:37:33,Googletrans,Googletrans: Free and Unlimited Google translate API for Python. Translates totally free of charge.,natural-language-processing\n239,2020-04-06 18:39:48,Prophet: Forecasting At Scale,Tool for producing high quality forecasts for time series data that has multiple seasonality with linear or non-linear growth.,other\n250,2020-04-06 19:24:06,Doccano,Open source text annotation tool for machine learning practitioner. ,natural-language-processing\n251,2020-04-06 19:28:58,BRAT: Rapid Annotation Tool,BRAT (brat rapid annotation tool) is based on the stav visualiser which was originally made in order to visualise BioNLP'11 Shared Task data.,natural-language-processing\n252,2020-04-06 20:23:46,Word Embeddings,This tutorial introduces word embeddings. It contains complete code to train word embeddings from scratch on a small dataset.,natural-language-processing\n253,2020-04-06 20:26:27,On Word Embeddings,This post presents the most well-known models for learning word embeddings based on language modeling.,natural-language-processing\n254,2020-04-06 20:28:43,NLP for Developers: Word Embeddings | Rasa,\"In this video, Rasa Developer Advocate Rachael will talk about what word embeddings are, how they work, when they're used and some  common errors. \",natural-language-processing\n255,2020-04-06 20:30:27,NLP for Developers: Transformers | Rasa,\"In this video, Rasa Developer Advocate Rachael will talk about what transformers are, how they work, when they're used and some  common errors. \",natural-language-processing\n256,2020-04-06 20:42:05,A Visual Guide to Using BERT for the First Time,Tutorial for how to use a variant of BERT to classify sentences.,natural-language-processing\n257,2020-04-06 20:45:45,The Illustrated GPT-2 (Visualizing Transformer Language Models),Visuals explaining the inner-workings of transformers.,natural-language-processing\n259,2020-04-06 20:51:58,The Illustrated Word2vec,\"In this post, we’ll go over the concept of embedding, and the mechanics of generating embeddings with word2vec. \",natural-language-processing\n260,2020-04-06 20:55:32,\"The Illustrated BERT, ELMo, and co.\",How NLP cracked transfer learning.,natural-language-processing\n261,2020-04-06 21:00:34,The Illustrated Transformer,\"In this post, we will look at The Transformer – a model that uses attention to boost the speed with which these models can be trained.\",natural-language-processing\n262,2020-04-06 21:11:40,Visualizing A Neural Machine Translation Model,Mechanics of seq2seq models with attention.,natural-language-processing\n269,2020-04-06 22:46:54,Attention Mechanism,\"Main concepts behind Attention, including an implementation of a sequence-to-sequence Attention model, followed by the application of Attention in Transformers.\",natural-language-processing\n270,2020-04-06 22:50:30,Attention? Attention!,\"In this post, we are gonna look into how attention was invented, and various attention mechanisms and models, such as transformer and SNAIL.\",natural-language-processing\n271,2020-04-06 22:58:47,The Annotated Transformer,In this post I present an “annotated” version of the paper in the form of a line-by-line implementation. ,natural-language-processing\n272,2020-04-06 23:38:26,The Annotated GPT-2,GPT-2 explained with visualization and PyTorch code.,natural-language-processing\n273,2020-04-06 23:41:52,Transformers - Hugging Face,🤗 Transformers: State-of-the-art Natural Language Processing for TensorFlow 2.0 and PyTorch. ,natural-language-processing\n277,2020-04-07 00:30:33,Curriculum for Reinforcement Learning,\"Curriculum learning applied to reinforcement learning, with a few exceptions of supervised learning.\",other\n278,2020-04-07 00:34:46,Self-Supervised Representation Learning,What if we can get labels for free for unlabelled data and train unsupervised dataset in a supervised manner? ,computer-vision\n279,2020-04-07 00:36:55,Evolution Strategies,Evolutionary algorithms refer to a division of population-based optimization algorithms inspired by natural selection. ,other\n280,2020-04-07 00:38:25,Meta Reinforcement Learning,Explore cases when we try to “meta-learn” Reinforcement Learning (RL) tasks by developing an agent that can solve unseen tasks fast and efficiently.,other\n281,2020-04-07 00:40:59,Generalized Language Models,Trend in large unsupervised pre-trained language models which have achieved amazing SOTA results on a variety of language tasks.,natural-language-processing\n284,2020-04-07 00:57:12,Policy Gradient Algorithms,\"In this post, we are going to look deep into policy gradient, why it works, and many new policy gradient algorithms proposed in recent years.\",other\n286,2020-04-07 03:49:15,Object Detection for Dummies,\"We will go through several basic concepts, algorithms, and popular deep learning models for image processing and object detection.\",computer-vision\n287,2020-04-07 03:59:53,Learning Word Embedding,This post introduces several models for learning word embedding and how their loss functions are designed for the purpose.,natural-language-processing\n290,2020-04-07 13:38:36,GANSpace: Discovering Interpretable GAN Controls,This paper describes a simple technique to analyze Generative Adversarial Networks (GANs) and create interpretable controls for image synthesis.,computer-vision\n291,2020-04-07 14:07:59,Kornia: Differentiable Computer Vision Library for PyTorch,Set of routines and differentiable modules to solve generic computer vision problems. ,computer-vision\n294,2020-04-07 15:36:13,PyTorch Geometric ,Geometric deep learning extension library for PyTorch.,other\n295,2020-04-07 15:40:00,DGL: Deep Graph Library,\"Python package built to ease deep learning on graph, on top of existing DL frameworks. \",other\n306,2020-04-07 20:07:28,BERT Research - Key Concepts & Sources,Video series on BERT's key concepts and sources.,natural-language-processing\n307,2020-04-07 20:11:29,GLUE Explained: Understanding BERT Through Benchmarks,In this post we take a look at an important NLP benchmark used to evaluate BERT and other transfer learning models!,natural-language-processing\n308,2020-04-07 23:22:18,TinyBERT,TinyBERT is 7.5x smaller and 9.4x faster on inference than BERT-base and achieves competitive performances in the tasks of natural language understanding.,natural-language-processing\n313,2020-04-08 00:02:27,NVIDIA Neural Modules: NeMo,A toolkit for conversational AI.,natural-language-processing\n315,2020-04-08 00:10:21,VoTT: Visual Object Tagging Tool,An electron app for building end to end Object Detection Models from Images and Videos.,computer-vision\n316,2020-04-08 00:12:26,Clinical BERT,Repository for Publicly Available Clinical BERT Embeddings,natural-language-processing\n318,2020-04-08 00:16:55,Computer Vision Annotation Tool (CVAT),\"Free, online, interactive video and image annotation tool for computer vision.\",computer-vision\n319,2020-04-08 00:19:04,LabelImg,🖍️ A graphical image annotation tool and label object bounding boxes in images.,computer-vision\n327,2020-04-08 14:16:28,How to Steal Modern NLP Systems with Gibberish?,\"It’s possible to steal BERT-based models without any real training data, even using gibberish word sequences.\",natural-language-processing\n334,2020-04-08 15:04:28,BioWordVec & BioSentVec,Pre-trained embeddings for biomedical words and sentences,natural-language-processing\n335,2020-04-08 15:07:44,BioBERT: a pre-trained biomedical language representation model ,\"Code for fine-tuning BioBERT for biomedical text mining tasks such as biomedical NER, relation extraction, QA, etc.\",natural-language-processing\n341,2020-04-08 15:42:56,How to Unit Test Machine Learning Code,Wouldn’t suck to have to throw away perfectly good ideas because our implementations were buggy?,mlops\n343,2020-04-08 15:52:19,Machine Learning Systems Design,Designing a machine learning system.,mlops\n345,2020-04-08 16:14:23,HMTL: Hierarchical Multi-Task Learning,🌊 A State-of-the-Art neural network model for several NLP tasks based on PyTorch and AllenNLP,natural-language-processing\n347,2020-04-08 16:26:05,The State of Transfer Learning in NLP,This post expands on the NAACL 2019 tutorial on Transfer Learning in NLP. It highlights key insights and takeaways and provides updates based on recent work.,natural-language-processing\n349,2020-04-08 16:35:52,The Dark Secrets of BERT,How much of the linguistically interpretable self-attention patterns that are presumed to be its strength are actually used to solve downstream tasks?,natural-language-processing\n364,2020-04-08 17:53:15,Named Entity Recognition Tagging,\"In this post, we go through an example from Natural Language Processing, in which we learn how to load text data and perform NER tagging for each token.\",natural-language-processing\n372,2020-04-08 18:22:46,An introduction to Q-Learning: Reinforcement Learning,Q-Learning algorithm along with an implementation in Python using Numpy.,other\n378,2020-04-08 19:37:57,Ray,Ray is a fast and simple framework for building and running distributed applications.,other\n380,2020-04-08 21:05:06,Graph Nets,\"PyTorch Implementation and Explanation of Graph Representation Learning papers involving DeepWalk, GCN, GraphSAGE, ChebNet & GAT.\",other\n388,2020-04-08 21:36:39,ConvNet Playground,An interactive visualization for exploring Convolutional Neural Networks applied to the task of semantic image search.,computer-vision\n392,2020-04-08 21:53:06,Embedding Projector,\"Visualization of high dimensional data, namely embeddings.\",natural-language-processing\n395,2020-04-08 22:12:24,Word2Viz: Explore Word Analogies,Interactive visualization of word analogies in GloVe.,natural-language-processing\n397,2020-04-08 22:17:06,Image-to-Image Translation with Conditional Adversarial Networks,Tensorflow port of Image-to-Image Translation with Conditional Adversarial Nets,computer-vision\n401,2020-04-08 22:29:09,\"Quick, Draw\",Can a neural network learn to recognize doodling?,computer-vision\n403,2020-04-08 22:44:04,A 2019 Guide to Speech Synthesis with Deep Learning,A look at recent deep learning based speech synthesis research and techniques.,natural-language-processing\n408,2020-04-08 23:03:13,FlashTorch,Visualization toolkit for neural networks in PyTorch,computer-vision\n411,2020-04-08 23:11:09,W&B: Weights and Biases,Track model training at scale.,mlops\n419,2020-04-09 00:41:03,Text Feature Selection for Causal Inference,\"Identifying the linguistic features that cause people to act a certain way after reading a text, regardless of confounding variables, is something people do.\",natural-language-processing\n423,2020-04-09 00:57:49,3D Ken Burns Effect from a Single Image,Implementation of 3D Ken Burns Effect from a Single Image using PyTorch.,computer-vision\n424,2020-04-09 01:02:59,Sparse Sinkhorn Attention,A new efficient and sparse method for learning to attend based on differentiable sorting of internal representations.,natural-language-processing\n425,2020-04-09 01:41:48,Backtester,A backtesting framework for timeseries data.,other\n427,2020-04-09 18:57:01,An Overview of Early Vision in InceptionV1,\"A guided tour of the first five layers of InceptionV1,\ntaxonomized into “neuron groups.”\",computer-vision\n428,2020-04-10 04:57:53,AiLight: Automatic  Highlighting Using BERT,\"Automatically highlight pdfs using BERT embeddings and clustering.\nhttps://anishthite.github.io/ailight\",natural-language-processing\n430,2020-04-10 15:28:43,Controlling Text Generation with Plug and Play Language Models,\"This article discusses an alternative approach to controlled text generation, titled the Plug and Play Language Model (PPLM).\",natural-language-processing\n431,2020-04-10 15:35:00,Genomic ULMFiT,ULMFiT for Genomic Sequence Data,natural-language-processing\n432,2020-04-10 15:39:29,Self-Supervised Learning and Computer Vision,\"So, what do you do if there are no pre-trained models in your domain? \",computer-vision\n434,2020-04-10 15:51:52,scispaCy,A full spaCy pipeline and models for scientific/biomedical documents.,natural-language-processing\n439,2020-04-10 17:33:38,Universal Adversarial Triggers for Attacking and Analyzing NLP,We create short phrases that cause a specific model prediction when concatenated to 𝘢𝘯𝘺 input from a dataset. ,natural-language-processing\n440,2020-04-10 17:39:19,lazynlp,Library to scrape and clean web pages to create massive datasets.,natural-language-processing\n443,2020-04-10 17:51:39,AllenNLP Interpret,A Framework for Explaining Predictions of NLP Models,natural-language-processing\n445,2020-04-10 18:00:50,Natural Language Processing With spaCy in Python,A comprehensive guide to NLP with spaCy.,natural-language-processing\n446,2020-04-10 18:45:15,Tips for Successfully Training Transformers on Small Datasets,It turns out that you can easily train transformers on small datasets when you use tricks (and have the patience to train a very long time).,natural-language-processing\n448,2020-04-10 19:14:59,🦄 How to build a SOTA Conversational AI with Transfer Learning,Train a dialog agent leveraging transfer Learning from an OpenAI GPT and GPT-2 Transformer language model.,natural-language-processing\n452,2020-04-10 20:18:20,CS224n: Natural Language Processing with Deep Learning,\"In this course, students will gain a thorough introduction to cutting-edge research in Deep Learning for NLP.\",natural-language-processing\n453,2020-04-10 20:23:21,CS231n: Convolutional Neural Networks for Visual Recognition,\"Deep dive into details of the deep learning architectures with a focus on learning end-to-end models for these tasks, particularly image classification.\",computer-vision\n455,2020-04-10 20:31:09,Illustrated: Self-Attention,Step-by-step guide to self-attention with illustrations and code.,natural-language-processing\n459,2020-04-10 21:05:32,Beyond the Pixel Plane: Sensing and Learning in 3d,Recent deep learning techniques that enable 3D object classification and semantic segmentation.,computer-vision\n462,2020-04-11 16:52:35,A Visual Guide to Self-Labelling Images,A self-supervised method to generate labels via simultaneous clustering and representation learning,computer-vision\n465,2020-04-13 02:18:51,3D Photography using Context-aware Layered Depth Inpainting,A multi-layer representation for novel view synthesis that contains hallucinated color and depth structures in regions occluded in the original view. ,computer-vision\n466,2020-04-13 18:48:40,Tokenizers: How Machines Read,A survey of different tokenization strategies in NLP.,natural-language-processing\n467,2020-04-13 19:43:35,Practical Text Classification With Python and Keras,You will get a grasp of current advancements of (deep) neural networks and how they can be applied to text.,natural-language-processing\n468,2020-04-13 19:45:46,Text Classification With Torchtext,This example shows how to train a supervised learning algorithm for classification using one of these TextClassification datasets.,natural-language-processing\n469,2020-04-13 21:17:44,Understanding Text With Bert,Building a machine reading comprehension system using the latest advances in deep learning for NLP.,natural-language-processing\n470,2020-04-13 21:38:20,Transfer Learning with T5: the Text-To-Text Transfer Transformer,\"In the paper, we demonstrate how to achieve state-of-the-art results on multiple NLP tasks using a text-to-text transformer pre-trained on a large text corpus.\",natural-language-processing\n471,2020-04-13 21:48:48,Building a COVID-19 Project Recommendation System,\"How to create a GitHub open source repo recommendation system web app with MLflow, Sagemaker, and Booklet.ai.\",natural-language-processing\n473,2020-04-13 22:33:21,Neural Machine Translation With Attention,This notebook trains a sequence to sequence (seq2seq) model for Spanish to English translation. ,natural-language-processing\n474,2020-04-13 22:48:49,PyTorch Tutorial for Deep Learning Researchers,This repository provides tutorial code for deep learning researchers to learn PyTorch. ,computer-vision\n476,2020-04-14 00:40:10,Show and Tell: A Neural Image Caption Generator,A TensorFlow implementation of the image-to-text model.,computer-vision\n477,2020-04-14 01:46:32,SimpleGAN,A Tensorflow-based framework to ease the training of generative models,computer-vision\n478,2020-04-14 02:41:43,Semantic Segmentation on MIT ADE20K dataset in PyTorch,Pytorch implementation for Semantic Segmentation/Scene Parsing on MIT ADE20K dataset.,computer-vision\n480,2020-04-14 03:46:09,ViLBERT-MT: Multi-Task Vision & Language Representation Learning,A single ViLBERT Multi-Task model can perform 8 different vision and language tasks learnt from 12 datasets!,computer-vision\n481,2020-04-14 03:50:18,Training an Image Classifier in PyTorch,\"Torchvision, that has data loaders for common datasets such as Imagenet, CIFAR10, MNIST, etc. and data transformers for images, vizualization and data loaders.\",computer-vision\n482,2020-04-14 17:28:37,A Visual Exploration of DeepCluster,DeepCluster is a self-supervised method to combine clustering and representation learning,computer-vision\n486,2020-04-14 20:12:43,A 2019 guide to Human Pose Estimation with Deep Learning,The basics of Human Pose Estimation (2D) and review the literature on this topic.,computer-vision\n489,2020-04-14 22:22:40,\"Deep Learning Based Super Resolution, Without Using a GAN\",\"Techniques and training a deep learning model for image improvement, image restoration, inpainting and super resolution.\",computer-vision\n490,2020-04-14 22:35:21,U-Net Deep Learning Colorization of Greyscale Images,This article describes experiments training a neural network to generate 3 channel colour images from single channel greyscale images using deep learning.,computer-vision\n491,2020-04-14 22:38:54,Deep Learning for Image Super-resolution: A Survey,This article aims to provide a comprehensive survey on recent advances of image super-resolution using deep learning approaches.,computer-vision\n492,2020-04-14 22:41:52,Second-order Attention Network for Single Image Super-resolution,We propose a second-order attention network (SAN) for more powerful feature expression and feature correlation learning.,computer-vision\n493,2020-04-14 22:52:49,DeepSORT: Deep Learning to Track Custom Objects in a Video,A look at deep learning based approached for object tracking.,computer-vision\n494,2020-04-14 22:59:56,Fast Online Object Tracking and Segmentation: A Unifying Approach,We illustrate how to perform both realtime object tracking and semi-supervised video object segmentation using a fully-convolutional Siamese approach.,computer-vision\n495,2020-04-14 23:10:48,Neural Style Transfer,This tutorial uses deep learning to compose one image in the style of another image (ever wish you could paint like Picasso or Van Gogh?).,computer-vision\n499,2020-04-14 23:34:32,Deep Learning for Videos: A 2018 Guide to Action Recognition,\"In this post, I summarize the literature on action recognition from videos. \",computer-vision\n501,2020-04-15 15:20:56,Shakespeare Meets Google's Flax,Application of RNNs in Flax: Character-Level Language Model.,natural-language-processing\n505,2020-04-15 15:59:30,\"Anomaly detection with Keras, TensorFlow, and Deep Learning\",Perform anomaly detection in your own image datasets using deep learning.,computer-vision\n507,2020-04-15 16:12:41,Almost Everything You Need to Know About Time Series,\"Understand moving average, exponential smoothing, stationarity, autocorrelation, SARIMA, and more.\",other\n508,2020-04-15 16:29:08,STEFANN: Scene Text Editor using Font Adaptive Neural Network,A generalized method for realistic modification of textual content present in a scene image. ⭐️ Accepted in CVPR 2020.,computer-vision\n509,2020-04-15 16:34:04,Time Series Prediction with LSTM Using PyTorch,Time series applied to forecasting on the Airplane Passengers Dataset.,other\n513,2020-04-15 17:05:36,lda2vec: Tools for interpreting natural language,The lda2vec model tries to mix the best parts of word2vec and LDA into a single framework.,natural-language-processing\n516,2020-04-15 17:21:53,Deep Learning for Object Detection: A Comprehensive Review,\"A closer look at Tensorflow’s object detection models: Faster R-CNN, R-FCN, and SSD.\",computer-vision\n517,2020-04-15 17:31:22,An Intuitive Guide to Deep Network Architectures,\"Intuition behind base network architectures like MobileNets, Inception, and ResNet.\",computer-vision\n529,2020-04-15 19:39:24,Real-Time Voice Cloning,Clone a voice in 5 seconds to generate arbitrary speech in real-time. Code for Transfer Learning from Speaker Verification to Multispeaker Text-To-Speech.,natural-language-processing\n549,2020-04-16 03:48:35,15 Best Tools for Tracking Machine Learning Experiments,A feature comparison of all the open-source and commercial options for experiment tracking.,mlops\n550,2020-04-16 08:14:50,Cycle GAN in TensorFlow 2.0 with Custom Loops,\"Implementation of \"\"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks\"\" by Jun-Yan Zhu et al. \",computer-vision\n552,2020-04-16 10:13:12,Holopix50k: A Large-Scale In-the-wild Stereo Image Dataset,The largest dataset of in-the-wild stereo image pairs (50K) crowd-sourced from the Holopix lightfield image-sharing social network.,computer-vision\n558,2020-04-16 15:49:29,PyTorch Notebooks,🔥A collection of PyTorch notebooks for learning and practicing deep learning,natural-language-processing\n564,2020-04-17 13:16:09,Optimize your ML models,Learn to use optimize your custom image classification models (built-in tf.keras) using TensorFlow Lite and gain 10x reduction in model's size. ,computer-vision\n566,2020-04-17 21:57:35,Machine learning deserves its own flavor of Continuous Delivery,\"When traveling in the data science world, I'm homesick for a smooth continuous delivery flow. My thoughts on approachable CD4ML.\",mlops\n574,2020-04-20 00:23:44,The Abstraction and Reasoning Corpus (ARC),\"Can a computer learn complex, abstract tasks from just a few examples? ARC can be used to measure a human-like form of general fluid intelligence.\",natural-language-processing\n580,2020-04-20 00:57:03,GitHub Actions & Machine Learning Workflows with Hamel Husain,\" In this talk, Hamel will provide a brief tutorial on GitHub Actions, and will show you how you can use this new tool to automate your ML workflows.\",mlops\n581,2020-04-20 01:01:38,How To Create Semantic Search For Arbitrary Objects,An end-to-end example of how to build a system that can search objects semantically. By Hamel Husain & Ho-Hsiang Wu,natural-language-processing\n598,2020-04-22 16:33:59,The Future of (Transfer Learning in) Natural Language Processing,\"Transfer Learning in Natural Language Processing (NLP): Open questions, current trends, limits, and future directions.\",natural-language-processing\n599,2020-04-22 16:43:13,MONAI,AI Toolkit for Healthcare Imaging.,computer-vision\n601,2020-04-22 17:41:06,How I Used Deep Learning To Train A Chatbot To Talk Like Me,Facebook chatbot that I trained to talk like me using Seq2Seq.,natural-language-processing\n602,2020-04-23 00:36:02,DialoGPT: Toward Human-Quality Conversational Response Generation,Large-scale pre-training for dialogue.,natural-language-processing\n605,2020-04-23 03:59:57,Upside Down Reinforcement Learning,Implementation of UDRL as outlined by Juergen Schmidhuber in https://arxiv.org/abs/1912.02875,other\n608,2020-04-23 12:52:02,PyImageSearch,An online platform of blogs on Computer Vision and Deep Learning.,computer-vision\n619,2020-04-23 16:55:27,Implementing Portrait Bokeh Mode using OpenCV and NumPy (Python),\"Do you love the portrait mode in your smartphone? This code will help you do the same using OpenCV and NumPy! Detects the faces, asks if you want to blur them!\",computer-vision\n621,2020-04-23 18:17:12,MixNMatch,Multifactor Disentanglement and Encoding for Conditional Image Generation,computer-vision\n622,2020-04-23 21:40:09,MT-Clinical BERT,Scaling Clinical Information Extraction with Multitask Learning,natural-language-processing\n623,2020-04-24 00:30:02,medaCy,🏥 Medical Text Mining and Information Extraction with spaCy,natural-language-processing\n632,2020-04-24 11:37:13,Lagrangian Neural Networks,\"Trying to learn a simulation? Try Lagrangian Neural Networks, which explicitly conserve energy and may generalize better!\",other\n639,2020-04-24 20:51:18,ML Foundations and Methods for Precision Medicine and Healthcare,\"This tutorial will discuss ideas from machine learning that enable personalization (useful for applications in education, retail, medicine and recsys).\",other\n643,2020-04-26 04:34:02,Albert-base for Sanskrit,Trained Albert-base from scratch on Sanskrit corpus of Wikipedia. I have also added a link to how to train your own Language model from scratch.,natural-language-processing\n644,2020-04-26 05:42:37,Adversarial Latent Autoencoders,\"Introducing the Adversarial Latent Autoencoder (ALAE), a general architecture that can leverage recent improvements on GAN training procedures.\",computer-vision\n652,2020-04-28 15:14:00,Optimal Transport and the Sinkhorn Transformer,Understand optimal transport and the Sinkhorn-Knopp algorithm before diving into the Sinkhorn Transformer.,natural-language-processing\n653,2020-04-28 16:20:29,Semantic Graphs for Generating Deep Questions,\"Deep Question Generation (DQG), which aims to generate complex questions that require reasoning over multiple pieces of information of the input passage. \",natural-language-processing\n658,2020-04-28 21:34:00,Gutenberg Dialog,Build a dialog dataset from online books in many languages.,natural-language-processing\n661,2020-04-29 02:41:24,Better NLP project,This is a wrapper program/library that encapsulates a couple of NLP libraries that are popular among the AI and ML communities.,natural-language-processing\n663,2020-04-29 04:42:16,Recipes for building an open-domain chatbot,\"Python framework for sharing, training and testing dialogue models, from open-domain chitchat to VQA (Visual Question Answering).\",natural-language-processing\n665,2020-04-29 10:46:20,Object-detection with multi-template matching,\"This python package allows to perform object detection using one or a few template images, it provides a simpler alternative to deep-learning methods\",computer-vision\n667,2020-04-29 18:34:28,No Trump Social Chrome Plugin,An AI-driven Browser Extension to Replace Trump Pics with Puppies!,computer-vision\n670,2020-04-29 19:35:22,Attribute2Font: Creating Fonts You Want From Attributes,Official PyTorch implementation of the Attribute2Font: Creating Fonts You Want From Attributes.,natural-language-processing\n674,2020-04-30 17:52:55,YOLOv4: Optimal Speed and Accuracy of Object Detection,A minimal implementation of YOLOv4.,computer-vision\n679,2020-05-01 16:17:32,Geometric and Relational Deep Learning,Videos from emerging fields of Graph Representation Learning and Geometric Deep Learning.,other\n683,2020-05-01 16:35:06,TAPAS: Weakly Supervised Table Parsing via Pre-training,Using neural networks to find answers in tables.,natural-language-processing\n686,2020-05-01 16:59:48,Jukebox: A Generative Model for Music,\"We’re introducing Jukebox, a neural net that generates music, including rudimentary singing, as raw audio in a variety of genres and artist styles. \",natural-language-processing\n687,2020-05-01 17:17:48,Exploratory Data Analysis of Time Series,\"Exploratory Data Analysis of Time Series data in Python. It uses lot of the principles and concepts discussed in Prof. Hyndman's book. The focus is on understa\n\",other\n688,2020-05-01 17:47:40,Gotchas of Transfer Learning for Image Classification,Discover the things you should care about while doing transfer learning for image classification. ,computer-vision\n693,2020-05-02 05:05:44,SciTLDR: Extreme Summarization of Scientific Documents,A new automatic summarization task with high source compression requiring expert background knowledge and complex language understanding.,natural-language-processing\n694,2020-05-02 15:29:06,BLINK: Better entity LINKing,Entity Linking python library that uses Wikipedia as the target knowledge base.,natural-language-processing\n695,2020-05-02 21:33:31,Five Cool Python Libraries for Data Science,Python is a best friend for the majority of the Data Scientists. Libraries make their life simpler. I have come across five cool Python libraries while working ,natural-language-processing\n700,2020-05-03 13:49:29,Fastai2 Vision Module,A detailed guide to using fastai2 Datablock API for common computer vision tasks,computer-vision\n702,2020-05-03 20:19:10,Unsupervised Question Decomposition for Question Answering,\"Decompose hard (multi-hop) questions into several, easier (single-hop) questions using unsupervised learning, and get better accuracy on multi-hop QA.\",natural-language-processing\n704,2020-05-04 11:58:27,Training Batch Norm and Only Batch Norm,Experiments with the ideas presented in https://arxiv.org/abs/2003.00152 by Frankle et al. ,computer-vision\n707,2020-05-05 03:36:50,The Big Bad NLP Database,A collection of 400+ NLP datasets with papers included.,natural-language-processing\n708,2020-05-05 03:51:53,POINTER: Constrained Text Generation,Constrained Text Generation via Insertion-based Generative Pre-training,natural-language-processing\n712,2020-05-05 05:55:46,Covid-19: A-Geo-Statistical-Analysis,Analysis with the time series data available for various countries.,other\n713,2020-05-05 07:13:49,Cognito : Data wrangling toolkit,Cognito is an exclusive python data preprocessing library and command-line utility that helps any developer to transform raw data into a machine-learning format,other\n717,2020-05-05 14:46:57,Synthesizer: Rethinking Self-Attention in Transformer Models,The dot product self-attention is known to be central and indispensable to state-of-the-art Transformer models. But is it really required?,natural-language-processing\n726,2020-05-06 01:10:55,ConvNets-TensorFlow2,Implementing a variety of popular and important CNN architectures,computer-vision\n732,2020-05-06 04:20:43,StellarGraph - Machine Learning on Graphs,\"State-of-the-art algorithms for graph machine learning, making it easy to discover patterns and answer questions about graph-structured data.\",other\n733,2020-05-06 04:30:47,LandCover.ai,\"Dataset for automatic mapping of buildings, woodlands and water from aerial imagery.\",computer-vision\n734,2020-05-06 04:33:15,Generating SOAP Notes from Doctor-Patient Conversations,Evaluate complete pipelines for leveraging these transcripts to train machine learning model to generate these notes.,natural-language-processing\n741,2020-05-07 01:15:12,Zero-shot Neural Retrieval via Domain-targeted Synthetic Queries,Zero-shot learning for ad-hoc retrieval models that relies on synthetic query generation.,natural-language-processing\n778,2020-05-07 21:28:34,Harry Potter and the Deep Learning Experiment,RNN built with TensorFlow to generate text based on Harry Potter's books.,natural-language-processing\n783,2020-05-08 14:44:04,NeuralCook — Image2Ingredients and Cooking Recommendation,\"Deep learning application to identify ingredients from cooking dishes images and recommend dishes to cook, given a set of ingredients.\",natural-language-processing\n788,2020-05-09 04:12:10,NER model for 40 languages trained with the new TFTrainer,This model is a fine-tuned XLM-Roberta-base over the 40 languages proposed in XTREME from Wikiann. ,natural-language-processing\n791,2020-05-09 14:30:08,Pose Animator,Takes a 2D vector illustration and animates its containing curves in real-time based on the recognition result from PoseNet and FaceMesh.,computer-vision\n792,2020-05-09 16:59:54,A Commit History of BERT and its Forks,What a commit history of version-controlled research papers could look like?,natural-language-processing\n795,2020-05-10 04:51:17,U^2-Net,\"The code for our newly accepted paper in Pattern Recognition 2020: \"\"U^2-Net: Going Deeper with Nested U-Structure for Salient Object Detection.\"\"\",computer-vision\n796,2020-05-10 05:08:27,Age and Gender Estimation using Multi-Task CNN,Used a multi task CNN to predict the age group and gender of the person in the image.,computer-vision\n797,2020-05-10 15:31:27,Data augmentation recipes in tf.keras image-based models,Learn about different ways of doing data augmentation when training an image classifier in tf.keras.,computer-vision\n799,2020-05-11 00:40:49,Injecting Inductive Bias in Graph Neural Networks (MIT talk),Equivariant Mesh Neural Networks and Neural Augmented (Factor) Graph Neural Networks.,other\n800,2020-05-11 00:44:10,Feature Stores for ML,List of production ML groups and their open-source feature store architectures.,mlops\n803,2020-05-11 02:13:32,Image Semantic Segmentation of UAV mining area based on Deeplabv3,\"Data: UAV mining area image\nTools: PyTorch\nFrame: Deeplabv3\nSemantic Segmentation \",computer-vision\n820,2020-05-11 14:19:18,A Comprehensive Survey on Graph Neural Networks,A Comprehensive Survey on Graph Neural Networks.,other\n821,2020-05-11 15:03:57,Hidden Technical Debt in Machine Learning Systems,\"Using the software engineering framework of technical debt, we find it is common to incur massive ongoing maintenance costs in real-world ML systems. \",mlops\n822,2020-05-11 15:10:09,In-Domain GAN Inversion for Real Image Editing,\"We propose an in-domain GAN inversion method, which faithfully reconstructs the input image but also ensures the inverted code to be semantically meaningful.\",computer-vision\n825,2020-05-11 23:07:39,Neural Networks for NLP (CMU CS 11-747),\"This class will start with a brief overview of neural networks, then spend the majority of the class demonstrating how to apply neural networks to language.\",natural-language-processing\n826,2020-05-12 03:02:02,DANet PyTorch,A Pytorch implementation of Dual Attention Network for Scene Segmentation,computer-vision\n828,2020-05-12 05:04:58,BART version of closed-book QA,\"This is a BART version of sequence-to-sequence model for open-domain QA in a closed-book setup, based on PyTorch and Huggingface's Transformers.\",natural-language-processing\n829,2020-05-12 05:07:35,Unsupervised Reinforcement Learning,Lecture on unsupervised reinforcement learning by Sergey Levine. Originally prepared for AAMAS 2020.,other\n831,2020-05-13 02:24:24,CCNet_PyTorch,A PyTorch Implementation of  CCNet: Criss-Cross Attention for Semantic Segmentation,computer-vision\n832,2020-05-13 04:22:09,Image segmentation in 2020,\"Architectures, Losses, Datasets, and Frameworks\",computer-vision\n833,2020-05-13 04:27:08,Plan2Explore: Plan to Explore via Self-Supervised World Models,A self-supervised reinforcement learning agent that tackles task-specific and the sample efficiency challenges.,other\n835,2020-05-13 04:39:31,Toward Better Storylines with Sentence-Level Language Models,We propose a sentence-level language model which selects the next sentence in a story from a finite set of fluent alternatives.,natural-language-processing\n836,2020-05-13 04:43:57,Epipolar Transformers,\"Differentiable \"\"epipolar transformer\"\", which enables the 2D detector to leverage 3D-aware features to improve 2D pose estimation.\",computer-vision\n840,2020-05-13 05:03:33,Machine Learning on Graphs: A Model and Comprehensive Taxonomy,We propose a simple framework (GraphEDM) and a comprehensive Taxonomy to review and unify several graph representation learning methods.,other\n841,2020-05-13 05:10:58,BLEURT: Learning Robust Metrics for Text Generation,A metric for Natural Language Generation based on transfer learning.,natural-language-processing\n842,2020-05-13 13:20:07,Identifying Brain Tumor from MRI images using FastAI -DynamicUnet,\"To use FASTAI unet learner to identify tumours from MRI of Brain, logging loss metrics in Neptune AI logger and compare the results after hyperparameter tuning.\",computer-vision\n847,2020-05-13 22:53:36,HuggingTweets,Tweet Generation with Huggingface.,natural-language-processing\n849,2020-05-13 22:59:38,Top Down Introduction to BERT with HuggingFace and PyTorch,I will also provide some intuition into how BERT works with a top down approach (applications to algorithm).,natural-language-processing\n850,2020-05-13 23:02:29,Transformers from Scratch,\"Attempt to explain directly how modern transformers work, and why, without some of the historical baggage.\",natural-language-processing\n852,2020-05-14 07:11:26,Scene Classification using Pytorch and Fast.ai,The objective is to classify Multi-label images using deep learning. Here I have used Fast.ai library for implementing the model. ,computer-vision\n855,2020-05-14 12:32:20,Fake new detection Pytorch,Fake News Detection by Learning Convolution Filters through Contextualized Attention.,natural-language-processing\n857,2020-05-14 14:25:11,FastHugs: Sequence Classification with Transformers and Fastai,Fine-tune a text classification model with HuggingFace 🤗 transformers and fastai-v2.,natural-language-processing\n858,2020-05-14 14:35:37,Open-Dialog Chatbots for Learning New Languages,A tutorial for automatically generate code comments using Deep Learning.,natural-language-processing\n860,2020-05-14 17:35:04,Electra,ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators,natural-language-processing\n862,2020-05-14 19:13:59,DQN In Pytorch Livestream Series,I'm doing a series of streams about reinforcement learning (starting from Q learning) focused on showing the work in as much detail as possible (e.g. debugging),other\n863,2020-05-15 04:24:58,S2IGAN: Speech-to-Image Generation via Adversarial Learning,A speech-to-image generation (S2IG) framework is proposed which translates speech descriptions to photo-realistic images without using any text information.,computer-vision\n864,2020-05-15 13:04:19,Twitter Sentiment Analysis,\"This project is based on Natural Language processing (NLP), in this we do sentiment analysis(i.e, how much it is positive or negative) of tweets of any account.\",natural-language-processing\n866,2020-05-15 13:51:56,HuggingFace nlp library,\"nlp is a lightweight and extensible library to easily share and load dataset and evaluation metrics, already providing access to ~100 datasets and ~10 evaluatio\",natural-language-processing\n868,2020-05-15 14:07:47,RXNMapper: Unsupervised Attention-Guided Atom-Mapping,The atom-mapping information was learned by an ALBERT model trained in an unsupervised fashion on a large dataset of chemical reactions.,natural-language-processing\n869,2020-05-15 14:08:12,ICLR 2020 Trends: Better & Faster Transformers for NLP,A summary of promising directions from ICLR 2020 for better and faster pretrained tranformers language models. ,natural-language-processing\n875,2020-05-15 22:53:58,Differentiable Reasoning over Text,We consider the task of answering complex multi-hop questions using a corpus as a virtual knowledge base (KB).,natural-language-processing\n877,2020-05-16 02:42:32,Semi-supervised image classification with GANs,\"Shows how to perform semi-supervised image classification with GANs. The cover image is from Chapter 7, GANs in Action.\",computer-vision\n879,2020-05-16 10:57:53,HighRes-net: Multi-Frame Super-Resolution of satellite imagery,\"Pytorch implementation of HighRes-net, a neural network for multi-frame super-resolution, trained and tested on the European Space Agency’s Kelvin competition.\",computer-vision\n880,2020-05-16 11:50:31,How Deep Is Your Love For Transfer Learning In NLP?,A review of NLP research,natural-language-processing\n881,2020-05-16 13:32:51,Time Series Forecasting with TensorFlow.js,Machine learning is becoming increasingly popular these days and a growing number of the world’s population see it is as a magic crystal ball: predicting when a,other\n882,2020-05-16 13:35:31,Phrases extraction and D3 Wordcloud,100% JavaScript solution to extracting phrases from text and display key points in a beautiful D3 wordcloud.,natural-language-processing\n883,2020-05-16 13:37:44,Reinforcement Learning Tic Tac Toe with Value Function,\"A reinforcement learning algorithm for agents to learn the tic-tac-toe, using the value function\n\n\",other\n884,2020-05-16 13:40:07,Build a Textual Similarity Web App with TensorFlow.js,Have you wondered how search engines understand your queries and retrieve relevant results? How chatbots extract your intent from your questions and provide the,natural-language-processing\n890,2020-05-16 19:51:33,cyBERT: Applying BERT to Windows event logs,\"This blog shows how interpreting cybersecurity logs as a natural language, improving upon the standard regex-based parsing of log data.\",natural-language-processing\n892,2020-05-17 02:08:12,DPOD: Pose Estimator,PyTorch recreation of a SOTA 6D Pose estimation research paper. ,computer-vision\n893,2020-05-17 04:44:04,ESTorch,ESTorch is an Evolution Strategy Library build around PyTorch.,other\n894,2020-05-17 04:47:40,\"A Large-Scale, Open-Domain, Mixed-Interface Dialogue-Based ITS \",\"Korbit, a large-scale, open-domain, mixed-interface, dialogue-based intelligent tutoring system (ITS).\",natural-language-processing\n900,2020-05-17 08:14:24,A Visual Survey of Data Augmentation in NLP,An extensive overview of text data augmentation techniques for Natural Language Processing,natural-language-processing\n901,2020-05-17 09:57:38,DoYouEvenLearn,Essential Guide to keep up with AI/ML/DL/CV,computer-vision\n902,2020-05-18 00:57:27,Differentiable Adaptive Computation Time for Visual Reasoning ,\"DACT, a new algorithm for achieving adaptive computation time that, unlike existing approaches, is fully differentiable. \",natural-language-processing\n903,2020-05-18 11:15:12,Semixup: In- and Out-of-Manifold Regularization,Semixup is a semi-supervised learning method based on in/out-of-manifold regularization.,computer-vision\n905,2020-05-18 14:40:51,Deep Reinforcement Learning for Supply Chain & Price Optimization,Explore how deep reinforcement learning methods can be applied in several basic supply chain and price management scenarios.,other\n907,2020-05-18 14:53:33,TextAttack,A Python framework for building adversarial attacks on NLP models.,natural-language-processing\n913,2020-05-19 03:19:59,aitextgen,A robust Python tool for text-based AI training and generation using GPT-2.,natural-language-processing\n914,2020-05-19 03:25:11,How Hugging Face achieved a 2x performance boost for QA,Question Answering with DistilBERT in Node.js,natural-language-processing\n918,2020-05-19 22:36:09,Accelerate your NLP pipelines using Hugging Face and ONNX,How the ONNX Runtime team and Hugging Face are working together to address challenges in training and deployment of Transformer models.,natural-language-processing\n920,2020-05-20 02:35:11,Attentron,Few-shot text-to-speech exploiting attention-based variable length embedding,natural-language-processing\n921,2020-05-20 02:39:09,Torch Points3D,Pytorch framework for doing deep learning on point clouds.,computer-vision\n922,2020-05-20 07:23:50,NLP Model Selection ,NLP model selection guide to make it easier to select models. This is prescriptive in nature and has to be used with caution.,natural-language-processing\n925,2020-05-20 16:20:28,Model-Agnostic Meta-Learning for Reinforcement Learning with TF2,Reimplementation of Model-Agnostic Meta-Learning (MAML) applied on Reinforcement Learning problems in TensorFlow 2.,other\n927,2020-05-21 03:16:17,FashionBERT,Text and image matching with adaptive loss for cross-modal retrieval.,natural-language-processing\n934,2020-05-21 03:45:38,📈 Automated Time Series Forecasting,This data app uses Facebook's open-source Prophet library to automatically forecast values into the future. ,other\n935,2020-05-21 14:22:01,\"Look inside the workings of \"\"Label Smoothing\"\"\",\"This blog post describes how and why does \"\"trick\"\" of label smoothing improves the model accuracy and when should we use it \",computer-vision\n938,2020-05-22 01:01:32,Content and Style Disentanglement for Artistic Style Transfer,Hi-Res style transfer and interpolation between styles,computer-vision\n939,2020-05-22 03:08:40,Time Series Classification Using Deep Learning,\"In this article, I will introduce you to a new package called timeseries for fastai2 that I lately developed. \",other\n940,2020-05-22 03:16:29,TAO: A Large-Scale Benchmark for Tracking Any Object,\"A diverse dataset for Tracking Any Object (TAO) consisting of 2,907 high resolution videos, captured in diverse environments, which are half a minute long on \",computer-vision\n941,2020-05-22 03:21:10,BiT: Exploring Large-Scale Pre-training for Compute,\"We are excited to share the best BiT models pre-trained on public datasets, along with code in TF2, Jax, and PyTorch. \",computer-vision\n947,2020-05-22 13:34:30,Self Driving Car,This project is a demonstration of a working model of self driving car 🚗🚗 identifying and following lanes using powerful computer vision 🕶🕶 algorithms.,computer-vision\n948,2020-05-22 13:39:15,Plant Disease Detection,This website help you to detect disease in your plant🌳 based to the plant's leaf🍃 image,computer-vision\n951,2020-05-23 03:19:00,YoloV3 implementation in keras and tensorflow 2.2,YoloV3 Real Time Object Detector in tensorflow 2.2.,computer-vision\n952,2020-05-23 03:22:11,Face Mask Detector,A simple Streamlit frontend for face mask detection in images using a pre-trained Keras CNN model + OpenCV and model interpretability.,computer-vision\n957,2020-05-23 09:18:52,Colbert AI,Colbert AI is a Deep Learning Language Model that generates text in the style of Stephen Colbert's famous monologues.,natural-language-processing\n961,2020-05-23 16:01:21,How to Build Robust Embeddings for Visual Similarity Tasks,This repository I package a bunch of tips and tricks to efficiently train deep learning models in computer vision,computer-vision\n962,2020-05-24 00:09:28,Basic ML Algorithms from scratch.,Implement basic Machine Learning Algorithms from scratch in python.,natural-language-processing\n963,2020-05-24 03:13:28,Build your first data warehouse with Airflow on GCP,What are the steps in building a data warehouse? What cloud technology should you use? How to use Airflow to orchestrate your pipeline?,mlops\n966,2020-05-24 10:24:03,Building an Intelligent Twitter Bot,The volume of information going through Twitter per day makes it one of the best platforms to get information on any subject of interest. ,natural-language-processing\n968,2020-05-24 16:40:46,Self Supervised Representation Learning in NLP,An overview of self-supervised pretext tasks in Natural Language Processing,natural-language-processing\n970,2020-05-24 20:01:29,Job Classification,\"Job Classification done using Techniques of NLP and ML.\n\nDataset used from Kaggle of Indeeed job posting.\",natural-language-processing\n972,2020-05-25 03:23:16,Next Word Prediction,Using transformers to predict next word and predict <mask> word.,natural-language-processing\n974,2020-05-25 03:28:32,PixelLib,Pixellib is a library for performing segmentation of images. ,computer-vision\n978,2020-05-25 05:53:46,TensorFlow.js - Gesture Controlled 2048,Gesture Controlled 2048 built with TensorFlow.js,computer-vision\n979,2020-05-25 11:04:50,Taxi Demand Prediction NewYorkCity,Predict the number of pickups as accurately as possible for each region in a 10 -min interval.,other\n980,2020-05-25 14:52:17,Super-BPD for Fast Image Segmentation,\"We propose direction-based super-BPD, an alternative to superpixel, for fast generic image segmentation, achieving state-of-the-art real-time result.\",computer-vision\n986,2020-05-26 03:47:15,Neural Topological SLAM for Visual Navigation,Topological representations for space that effectively leverage semantics and afford approximate geometric reasoning.,computer-vision\n987,2020-05-26 13:16:48,Zero To One For NLP,A collection of all resources for learning NLP,natural-language-processing\n989,2020-05-26 17:17:14,NLP for Developers: Shrinking Transformers | Rasa,\"In this video, Rasa Senior Developer Advocate Rachael will talk about different approaches to make transformer models smaller.\",natural-language-processing\n993,2020-05-27 05:26:33,DETR: End-to-End Object Detection with Transformers,A new method that views object detection as a direct set prediction problem. ,computer-vision\n997,2020-05-28 03:20:06,AutoSweep: Recovering 3D Editable Objects from a Single Photo,Fully automatic framework for extracting editable 3D objects directly from a single photograph.,computer-vision\n1000,2020-05-28 03:33:52,CMU LTI Low Resource NLP Bootcamp 2020,A low-resource natural language and speech processing bootcamp held by the Carnegie Mellon University Language Technologies Institute in May 2020.,natural-language-processing\n1007,2020-05-28 21:30:37,Humour.ai : Language Model that can crack Jokes,\"A Language model that can make you laugh. Humour.ai model tries to\ncomplete a sentence in a humourous way given some input words. \",natural-language-processing\n1008,2020-05-29 02:28:53,face mask detection ,detects whether a person wearing a mask or not,computer-vision\n1009,2020-05-29 02:47:06,Train ALBERT for NLP with TensorFlow on Amazon SageMaker,\"To train BERT in 1 hour, we efficiently scaled out to 2,048 NVIDIA V100 GPUs by improving the underlying infrastructure, network, and ML framework. \",natural-language-processing\n1010,2020-05-29 02:51:39,GPT-3: Language Models are Few-Shot Learners,\"We show that scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior SOTA.\",natural-language-processing\n1013,2020-05-29 03:06:41,Guided Uncertainty-Aware Policy Optimization,Combining learning and model-based strategies for sample-efficient policy learning.,other\n1018,2020-05-29 08:09:04,GOTURN-PyTorch,\"PyTorch implementation of \"\"Learning to Track at 100 FPS with Deep Regression Networks\"\"\",computer-vision\n1020,2020-05-29 09:54:04,Applying Modern Best Practices to Autoencoders,This project applies best modern practices found in other areas of image research to autoencoders. Comparing models from other areas of image research.,computer-vision\n1021,2020-05-29 10:33:26,Sentiment analysis ,\"Sentiment analysis by combining three dataset amazon,yelp, IMDb reviews to train our,model to classify if a comment is negative or positive denoted by 0 and 1.\",natural-language-processing\n1022,2020-05-29 13:27:20,The designer - gpt2 bot that talks about UX Design,\"This twitter profile spits out thoughts on design and development. Trained with hundreds of Books on UX design and Front end development, it has opinions.\",natural-language-processing\n1024,2020-05-29 14:15:30,Sentiment Classification for UtaPass & KKBOX Reviews,Text classification for reviews of UtaPass & KKBOX using different deep learning models.,natural-language-processing\n1025,2020-05-29 14:18:59,Forex Prediction,Using neural networks to predict movement of forex direction.,natural-language-processing\n1026,2020-05-29 14:24:07,Lyrics-Based Music Genre Classifier,\"Classify the genre (Rock, Pop, Hip-Hop, Not Available, Metal, Other, Country, Jazz, Electronic, R&B, Indie, Folk) of the song by its lyrics.\",natural-language-processing\n1028,2020-05-29 14:39:16,ARBML,\"Implementation of many Arabic NLP and ML projects. Providing real time experience using many interfaces like web, command line and notebooks.\",natural-language-processing\n1035,2020-05-29 16:11:11,Zero Shot Topic Classification,Bart with a classification head trained on MNLI.,natural-language-processing\n1045,2020-05-30 01:35:24,Illustrated Guide to Transformers: Step by Step Explanation,\"In this post, we’ll focus on the one paper that started it all, “Attention is all you need”.\",natural-language-processing\n1046,2020-05-30 01:39:25,Illustrated Guide to Transformers,A component by component breakdown analysis.,natural-language-processing\n1055,2020-05-30 09:02:27,Automatic-Face-Detection-Annotation-and-Preprocessing,\"Automatically detect , annotate , collect the coordinates , convert to csv and to tfrecord\",computer-vision\n1058,2020-05-30 09:43:39,SmartFeed.ai,NLP Based Article Recommendation System ,natural-language-processing\n1059,2020-05-30 10:50:55,Wheat Detection 🌾,This is a project for detecting and creating bounding box of wheat heads 🌾.,computer-vision\n1068,2020-05-30 18:20:40,Effects of News Sentiments on Stock Predictions,Project is based on the Natural Language Processing technique called Sentiment Analysis. Stock market and news related to it as the subject of analysis.,natural-language-processing\n1069,2020-05-30 20:04:49,NLP News Category,The objective of this repository is to create a NLP bot for when you give the robot the headline of the news and a short description it will return the genre.,natural-language-processing\n1070,2020-05-30 20:06:48,AI Debate Master,\"Created and deployed a bot made to debate with a human on any\ngiven topic. Employed a Doc2Vec model using Gensim library in Python\",natural-language-processing\n1075,2020-05-31 04:44:27,Zero-Shot Learning for Text Classification,\"A visual summary of “Train Once, Test Anywhere” paper for zero-shot text classification\",natural-language-processing\n1080,2020-05-31 05:23:23,Dash DETR Detection App,A User Interface for DETR built with Dash. 100% Python.,computer-vision\n1081,2020-05-31 05:28:53,AI Basketball Analysis,🏀   AI web app and API to analyze basketball shots and shooting pose. ,computer-vision\n1083,2020-05-31 08:20:06,Reverse Image Search,Have you ever wondered how google image search works or How amazon can retrieve products similar to the image that we upload in the app/site? To achieve this ta,computer-vision\n1084,2020-05-31 08:22:45,Beginner’s guide to Machine Learning Model Deployment,Are you a beginner in the field of machine learning and wondering how to bring your project to live. I'm was in the same situation when I started learning ML. M,mlops\n1093,2020-05-31 17:39:22,MedicalZoo PyTorch,A pytorch-based deep learning framework for multi-modal 2D/3D medical image segmentation,computer-vision\n1094,2020-05-31 19:11:28,Paraphrase Any Question with T5  (Text-To-Text  Transformer),\"Given a question, generate paraphrased versions of the question with T5 transformer. Pretrained model and training script provided.\",natural-language-processing\n1100,2020-06-01 05:56:43,Movie Recommendation System,This is a web app which recommends movies based on their plots found on IMDb.,natural-language-processing\n1104,2020-06-01 10:02:09,Convnet Galaxy Morphology Classifier,Classify galaxies from Hubble Tuning Fork using Convnet. ,computer-vision\n1107,2020-06-01 14:52:29,2nd Place Solution to Ship Identification Hackathon ,The problem statement was to identify the type of ship from photos taken from the survey boats. The hackathon was organized by Analytics Vidhya.,computer-vision\n1110,2020-06-01 16:44:55,Deep learning Architecture: AlexNet,Explaining network architecture for AlexNet,computer-vision\n1111,2020-06-01 18:13:26,Movement Pruning: Adaptive Sparsity by Fine-Tuning,\"We propose the use of movement pruning, a simple, deterministic first-order weight pruning method that is more adaptive to pretrained model fine-tuning.\",natural-language-processing\n1112,2020-06-01 18:57:31,Document search engine,NLP based search engine for single page pdf files.,natural-language-processing\n1115,2020-06-01 21:07:53,Softbot design with WANNS,\"Soft robots are robots built from highly compliant materials, similar to those found in living organisms. This project explored CPPNs and WANNs to design them\",other\n1121,2020-06-02 05:07:17,Motion2Vec,Semi-Supervised Representation Learning from Surgical Videos,computer-vision\n1122,2020-06-02 05:10:18,Machine Learning: Tests and Production,Best practices for testing ML-based systems.,mlops\n1130,2020-06-02 11:51:38,Generate True or False questions from any content,\"Automatically generate “True or False” questions like the ones you see in school textbooks using  OpenAI GPT2, Sentence BERT, and Berkley parser\",natural-language-processing\n1131,2020-06-02 13:41:32,Sized Fill-in-the-blank or Multi Mask filling with RoBERTa,Sized fill-in-the-blank or conditional text filling is the idea of filling missing words of a sentence with the most probable choice of words.,natural-language-processing\n1132,2020-06-02 14:56:10,T5 for Sentiment Span Extraction,Exploring how T5 works and applying it for sentiment span extraction.,natural-language-processing\n1133,2020-06-02 14:58:58,Getting Started with Time Series analysis using Pandas,An introductory guide to get started with the Time Series datasets in Python,other\n1135,2020-06-02 15:06:34,Melanoma Detection with Pytorch,\"In this video, I show you how you can build a deep learning model to detect melanoma with a very high accuracy.\",computer-vision\n1139,2020-06-02 19:53:37,\"RoBERTa → Longformer: Build a \"\"Long\"\" Version of Pretrained Models\",This notebook replicates the procedure descriped in the Longformer paper to train a Longformer model starting from the RoBERTa checkpoint. ,natural-language-processing\n1145,2020-06-03 01:51:14,Learning Dexterity End-to-End,We trained a human-like robot hand to manipulate physical objects with unprecedented dexterity.,other\n1148,2020-06-03 02:28:20,A Practical guide to building a conversational chatbot,Building a Chatbot from scratch using Keras and NLTK library for a customer service company,natural-language-processing\n1151,2020-06-03 07:25:27,Web Mining and Information theory,\"Mining the Web and playing with Natural Language processing. Implementing Information retrieval System tasks. Going towards the NLP and Performing Machine Learning algorithms. Through these codes and problems, I have understood the information retrieval process of any search engine. These are very useful problems towards sentiment analysis.\",natural-language-processing\n1162,2020-06-03 22:05:30,Deep Q-Network on Space Invaders. ,This is a PyTorch implementation of a Deep Q-Network agent trained to play the Atari 2600 game of Space Invaders.,other\n1165,2020-06-04 03:53:43,YOLOv4,A TensorFlow 2.0 implementation of YOLOv4: Optimal Speed and Accuracy of Object Detection.,computer-vision\n1166,2020-06-04 03:55:53,Acme: A Research Framework for Reinforcement Learning,A library of reinforcement learning components and agents.,other\n1176,2020-06-04 09:10:07,doc2vec Paragraph Embeddings for Text Classification,Text classification model which uses gensim's Doc2Vec for generating paragraph embeddings and scikit-learn Logistic Regression for classification. ,natural-language-processing\n1178,2020-06-04 12:19:52,Machine Learning with Fastai,\"The fastai library is based on research into deep learning best practices undertaken at fast.ai, and includes support for Vision, Text, tabular and Collab\",computer-vision\n1180,2020-06-04 14:58:19,The Transformer … “Explained”?,\"An intuitive explanation of the Transformer by motivating it through the lens of CNNs, RNNs, etc.\",natural-language-processing\n1181,2020-06-04 16:28:24,TensorflowTTS: Real-Time SOTA Speech Synthesis for Tensorflow 2.0,\"TensorflowTTS provides real-time state-of-the-art speech synthesis architectures such as Tacotron2, Melgan, FastSpeech.\",natural-language-processing\n1185,2020-06-04 22:36:31,PyTorch Transformers Tutorials,\"A set of annotated Jupyter notebooks, that give user a template to fine-tune transformers model to downstream NLP tasks such as classification, NER etc. \",natural-language-processing\n1192,2020-06-05 04:28:52,BERT Summarization,This folder contains colab notebooks that guide you through the summarization by BERT and GPT-2 to play with your data.,natural-language-processing\n1194,2020-06-05 04:35:14,Divide Hugging Face Transformers Training Time By 2,Reducing training time helps to iterate more in a fixed budget time and thus achieve better results.,natural-language-processing\n1199,2020-06-05 15:39:56,How NLP has evolved for Financial Sentiment Analysis,Do we still need humans to read boring financial statements?,natural-language-processing\n1202,2020-06-05 17:51:33,The NLP Pandect - All NLP resources in one place,The NLP Pandect was created to help you find almost anything related to Natural Language Processing that is available online.,natural-language-processing\n1203,2020-06-05 18:18:18,Summary of 🤗 Transformers Models,A high-level summary of the differences between each model in HuggingFace's Transformer library.,natural-language-processing\n1204,2020-06-05 22:56:38,Snaked: Classifying Snake Species using Images,Proof of concept that it is possible to identify snake species and whether poisonous from photographs (PyTorch code/model with Android app),computer-vision\n1211,2020-06-06 15:13:13,Literate Lamp: Answering Question with Common Sense,We study the problem of answering questions that require common sense to be answered using Transformer-based models and the ConceptNet knowledge base.,natural-language-processing\n1215,2020-06-06 19:00:39,Pytorch Faster RCNN,Fine Tune Faster RCNN in pytorch for your task.,computer-vision\n1222,2020-06-07 04:34:58,Paragraph Summarizer,Uses the extractive way of summarizing the text by finding the score and ranking it.,natural-language-processing\n1223,2020-06-07 04:39:32,Leafy: Plant Leaf Classifier,The sequential model trained on images from the leafsnap.com,computer-vision\n1236,2020-06-07 21:03:31,\"COVID-Q: A Dataset of 1,690 Questions about COVID-19\",\"This dataset consists of COVID-19 questions which have been annotated into a broad category (e.g. Transmission, Prevention) and a more specific class such that \",natural-language-processing\n1237,2020-06-08 03:43:45,Keras notifications on Slack!,Get slack notifications of your model's training progress when training with Keras (or tf.keras),computer-vision\n1239,2020-06-08 07:05:15,Zero-shot Text Classification With Generative Language Models,An overview of a text generation approach to zero-shot text classification with GPT-2,natural-language-processing\n1241,2020-06-08 08:25:01,Funnel-Transformer: Filtering out Sequential Redundancy,Funnel-Transformer is a self-attention model that gradually compresses the sequence of hidden states to a shorter one and hence reduces the computation cost.,natural-language-processing\n1243,2020-06-08 08:39:34,Timeseries Anomaly Detection using an Autoencoder,Detect anomalies in a timeseries using an Autoencoder.,other\n1246,2020-06-08 09:47:02,Fairseq-tagging,\"a Fairseq fork for sequence tagging/labeling tasks\n\",natural-language-processing\n1249,2020-06-08 16:59:01,Know-Corona : Kaggle COVID-19 Open Research Dataset Challenge (CO,\"NLP/state-of-the-art language model (BERT) based Question & Answering pipeline to answer all task questions after analyzing articles abstract of COVID-19, SARS-\",natural-language-processing\n1251,2020-06-08 18:38:49,Automatic Asset Classification,This project aims to automate the task of labelling images of flood defence assets as well as clustering images to find possibly better groupings.,computer-vision\n1255,2020-06-09 01:50:33,TransformerTTS,🤖💬 Transformer TTS: Implementation of a non-autoregressive Transformer based neural network for text to speech.,natural-language-processing\n1257,2020-06-09 01:58:48,How Big Should My Language Model Be?,Tool to explore language model training and optimize the compute costs.,natural-language-processing\n1258,2020-06-09 02:04:49,MSeg: A Composite Dataset for Multi-domain Semantic Segmentation,A composite dataset that unifies semantic segmentation datasets from different domains.,computer-vision\n1259,2020-06-09 02:11:15,Network Fusion for Content Creation With Conditional Inns,\"We present a method to repurpose powerful, existing models for new tasks, even though they have never been designed for them.\",computer-vision\n1260,2020-06-09 02:14:59,Advanced Deep Learning for Computer Vision (ADL4CV),\"The Visual Computing Group offers a variety of lectures and seminars on a regular basis, covering hot areas in computer graphics, vision, and machine learning.\",computer-vision\n1272,2020-06-10 05:13:41,Linformer: Self-Attention with Linear Complexity,We demonstrate that the self-attention mechanism can be approximated by a low-rank matrix.,natural-language-processing\n1274,2020-06-10 05:21:00,Getting Machine Learning to Production,\"Machine learning is hard and there are a lot, a lot of moving pieces.\",mlops\n1275,2020-06-10 05:24:07,Exploration Strategies in Deep Reinforcement Learning,Exploitation versus exploration is a critical topic in reinforcement learning. This post introduces several common approaches for better exploration in Deep RL.,other\n1278,2020-06-10 12:50:41,Automatically Generate Multiple Choice Questions (MCQs) ,\"Automatically Generate Multiple Choice Questions (MCQs) from any content with BERT Summarizer, Wordnet, and Conceptnet\",natural-language-processing\n1287,2020-06-10 18:27:24,BERT Loses Patience: Fast and Robust Inference with Early Exit,\"Patience-based Early Exit, a inference method that can be used as a plug-and-play technique to simultaneously improve the efficiency of a pretrained LM.\",natural-language-processing\n1298,2020-06-11 04:18:27,PEGASUS: a SOTA model for Abstractive Text Summarization,A State-of-the-Art Model for Abstractive Text Summarization.,natural-language-processing\n1301,2020-06-11 04:29:24,Big GANs Are Watching You, We demonstrate that object saliency masks for GAN-produced images can be obtained automatically with BigBiGAN.,computer-vision\n1309,2020-06-11 19:04:31,Sentiment Analysis on News Article,Used Twitter API to extract news-related tweets. Did some preprocessing and then calculated the tweets' polarity.,natural-language-processing\n1310,2020-06-11 20:30:38,GPT-3 Language Model: A Technical Overview,\"Technical details of the GPT-3 model, training, inference and what to expect next. \",natural-language-processing\n1312,2020-06-11 20:37:47,OpenAI API,API for accessing new AI models developed by OpenAI.,natural-language-processing\n1320,2020-06-12 04:17:08,Implementation of a Contextual Chatbot in PyTorch,Simple chatbot implementation with PyTorch.,natural-language-processing\n1325,2020-06-12 11:06:34,Author Identification using Doc2Vec,Web app of an author identification model trained on PAN 2012 dataset and Kaggle's Spooky Authorship Dataset,natural-language-processing\n1329,2020-06-12 12:44:18,Training game agents with supervised learning,This is a continuing research project trying find ways to learn complex tasks such as games without using Reinforcement Learning.,other\n1371,2020-06-13 17:16:07,Baymax - ChatBot,\"Baymax Chatbot is a part of my summer training program @AdHoc Networks, Jaipur.\n\nA chatbot that allows user to signup and login to maintain their record. When c\",natural-language-processing\n1372,2020-06-13 17:21:43,How to Evaluate Longformer on TriviaQA using NLP,We will evaluate a pretrained LongformerForQuestionAnswering model on the validation dataset of TriviaQA.,natural-language-processing\n1374,2020-06-13 17:28:13,Extracting Structured Data from Templatic Documents,\"Automatically extract data from structured documents—invoices, receipts, etc.—with the potential to streamline many business workflows.\",computer-vision\n1392,2020-06-13 20:58:33,StackOver Flow Data Analysis,\"Analysing certain aspects of the stack overflow data and creating \"\"Tag Predictor\"\" which predicts tag based on the post posted. \",natural-language-processing\n1398,2020-06-14 05:51:06,Super-resolution Variational Auto-Encoders,VAE with RealNVP prior and Super-Resolution VAE in PyTorch.,computer-vision\n1399,2020-06-14 05:57:16,Video object grounding,Video object grounding using semantic roles in language description. ,computer-vision\n1418,2020-06-14 17:43:34,Short Notes on Behavior Regularized Offline RL,Blog Article on Behavior Regularized Offline Reinforcement Learning by Yifan Wu et al. (2019),other\n1423,2020-06-14 22:10:57,Entity Embedding with LSTM for Time-Series,\"Demonstration of using LSTM for forecasting with structured time-series data, containing categorical and numerical features.\",other\n1424,2020-06-15 02:27:55,Why We Switched from Flask to FastAPI for Production ML,The most popular tool isn’t always the best.,mlops\n1425,2020-06-15 02:31:48,Building a Captcha OCR in TF2.0,A Kaggle notebook showcasing the use of an Endpoint layer for CTC loss function used for building a Captcha Reader in TensorFlow.,computer-vision\n1427,2020-06-15 02:40:48,101 Ways to Solve Search - Dair AI ft. Pratik Bhavsar,A comprehensive overview of explaining how NLP is used for search.,natural-language-processing\n1438,2020-06-15 11:06:35,Multimodal Meme Classification,UNITER has given state of the art results in various image-text related problems. This project aims at finetuning UNITER to solve Hateful memes challenge,computer-vision\n1453,2020-06-16 01:32:49,Interpretable Machine Learning for Computer Vision,\"Recent progress we made on visualization, interpretation, and explanation methodologies for analyzing both the data and the models in computer vision.\",computer-vision\n1455,2020-06-16 02:32:53,Predicting Unintentional Action in Video,\"We introduce a dataset of in-the-wild videos of unintentional action, as well as a suite of tasks for recognizing, localizing, and anticipating its onset. \",computer-vision\n1457,2020-06-16 02:46:25, Synthesizing High-Resolution Images with StyleGAN2,\"Developed by NVIDIA Researchers, StyleGAN2 yields state-of-the-art results in data-driven unconditional generative image modeling.\",computer-vision\n1458,2020-06-16 02:51:13,PIFuHD: High-Resolution 3D Human Digitization ,\"This repository contains a pytorch implementation of \"\"Multi-Level Pixel-Aligned Implicit Function for High-Resolution 3D Human Digitization\"\".\",computer-vision\n1460,2020-06-16 03:21:07,Instance Shadow Detection,Instance shadow detection aims to find shadow instances paired with object instances.,computer-vision\n1461,2020-06-16 03:24:02,Detectron2,FAIR's next-generation platform for object detection and segmentation.,computer-vision\n1473,2020-06-16 22:37:58,tslearn,A machine learning toolkit dedicated to time-series data.,other\n1475,2020-06-16 22:45:15,PyTorch3D,FAIR's library of reusable components for deep learning with 3D data.,computer-vision\n1476,2020-06-16 22:48:45,Course Review - Causal Inference,Types of understanding that causal inference researchers value.,other\n1478,2020-06-16 22:56:31,Unsupervised Learning of Probably Symmetric Deformable 3D Objects,\"A method to learn 3D deformable object categories from raw single-view images, without external supervision.\",computer-vision\n1480,2020-06-16 23:06:13,A Guide to Natural Language Processing With AllenNLP,basics of using AllenNLP,natural-language-processing\n1482,2020-06-17 12:12:03,Real Time Object Detection using CNN YOLO,\"This project is done on real time object detection using a deep learning object detection algorithm i.e., YOLO.\",computer-vision\n1483,2020-06-17 14:38:33,Short Notes on Model-Based Offline Reinforcement Learning (MOReL),Blog article on Model-Based Offline Reinforcement Learning (MOReL) paper by Rahul Kidambi & Aravind Rajeswaran et al.,other\n1491,2020-06-18 00:04:34,Image GPT: Generative Pretraining from Pixels, Transformers trained on pixel sequences can generate coherent image completions and samples.,computer-vision\n1492,2020-06-18 00:06:53,Q*BERT,Agents that build knowledge graphs and explore textual worlds by asking questions.,natural-language-processing\n1499,2020-06-18 13:41:39,History of Language Models - Alec Radford,A quick history of language models,natural-language-processing\n1502,2020-06-18 19:45:49,Generate Boolean (Yes/No) Questions From Any Content ,Question generation algorithm trained on the BoolQ dataset using T5 text-to-text transformer model.,natural-language-processing\n1504,2020-06-19 06:19:25,Fast Neural Style Transfer (feed-forward method) ⚡💻 + 🎨 = ❤️,This repo contains a concise PyTorch implementation of the original feed-forward NST paper.,computer-vision\n1505,2020-06-19 06:22:56,Diverse Image Generation via Self-Conditioned GANs,A simple but effective unsupervised method for generating realistic & diverse images using a class-conditional GAN model without using manually annotated class.,computer-vision\n1506,2020-06-19 06:26:17,Using GitHub Actions for MLOps & Data Science,A collection of resources on how to facilitate Machine Learning Ops with GitHub.,mlops\n1519,2020-06-20 05:40:46,Image and Bounding Box Annotation Slicer,This easy-to-use library slices (also resizes) images and its bounding box annotations into tiles of specific sizes or any arbitrary number of equal parts. ✂️,computer-vision\n1525,2020-06-20 16:21:38,Huggingtweets,This is a streamlit app built around the huggingtweets project. I fine-tune a pre-trained gpt2 model to tweet like a user given twitter handle.  ,natural-language-processing\n1528,2020-06-20 22:06:48,The Future of Computer Vision is Self-Supervised Learning,Talk by Yann Lecun on the applications of self-supervised learning on computer vision during CVPR 2020.,computer-vision\n1529,2020-06-20 22:11:14,Using Selective Attention in Reinforcement Learning Agents,\"In this work, we establish that self-attention can be viewed as a form of indirect encoding, which enables us to construct highly parameter-efficient agents.\",other\n1539,2020-06-21 12:45:42,A Visual Guide to FastText Word Embeddings,A deep-dive into how FastText enriches word vectors with sub-word information  ,natural-language-processing\n1542,2020-06-21 20:46:12,Autocoder - Finetuning GPT-2 for Auto Code Completion,\"A basic and simple tool for code auto completion, built upon GPT-2\",natural-language-processing\n1546,2020-06-22 00:46:32,DeepSNAP,Python library assists deep learning on graphs.,other\n1547,2020-06-22 00:50:30,RoBERTa meets TPUs,Understanding and applying the RoBERTa model to the current challenge.,natural-language-processing\n1549,2020-06-22 01:00:45,Deep Model-Based RL for Real-World Robotic Control,Short talk about model-based RL by Sergey Levine.,other\n1551,2020-06-22 03:17:48,Pokemon Classifier,I want to build a classifier that can classify 150 types of Pokemon.,computer-vision\n1552,2020-06-22 03:45:01,Workshop on Scalability in Autonomous Driving - Andrej Karpathy,An overview of autonomous driving and computer vision at Tesla.,computer-vision\n1560,2020-06-22 15:56:00,Battle-Tested Techniques for Scoping Machine Learning Projects,One of the challenges of managing an ML project is project scoping. Even small changes in data or architecture can create huge differences in model outputs.,mlops\n1563,2020-06-22 16:04:10,Classify photos in 600 classes using nine million Open Images,\"If you’re looking build an image classifier but need training data, look no further than Google Open Images.\",computer-vision\n1569,2020-06-22 16:52:01,Trackable,The project deals with tracking humans in a narrow hallway under different lighting conditions.,computer-vision\n1571,2020-06-23 02:04:12,Stochastic Segmentation Networks,An efficient probabilistic method for modelling aleatoric uncertainty with any image segmentation network architecture.,computer-vision\n1575,2020-06-23 02:30:20,Deep Learning for Computer Vision ,Special topics class on deep learning for computer vision from the University of Michigan taught by Justin Johnson.,computer-vision\n1576,2020-06-23 02:37:15,VPSNet for Video Panoptic Segmentation,Video panoptic segmentation by generating consistent panoptic segmentation as well as an association of instance ids across video frames.,computer-vision\n1580,2020-06-24 03:00:16,What I Learned From Looking at 200 Machine Learning Tools,\"To better understand the landscape of available tools for machine learning production, I decided to look up every AI/ML tool I could find.\",mlops\n1581,2020-06-24 03:04:31,Discovering Symbolic Models from Deep Learning w/ Inductive Bias,A general approach to distill symbolic representations of a learned deep model by introducing strong inductive biases.,other\n1585,2020-06-24 03:18:20,Breaking the cycle—Colleagues are all you need,A novel approach to performing image-to-image translation between unpaired domains.,computer-vision\n1587,2020-06-24 03:25:25,Deep Learning Based Text Classification: A Comprehensive Review,An overview of deep learning approaches to text classification.,natural-language-processing\n1589,2020-06-24 03:33:09,jiant,A software toolkit for research on general-purpose text understanding models.,natural-language-processing\n1592,2020-06-24 04:27:58,Text Classification,\"Re-implemented an article (link is given below) which was on Text classification with CNN, beside this I tried out some ML classification algorithm.\",natural-language-processing\n1595,2020-06-24 15:42:20,multi-task-NLP,A utility toolkit enabling NLP developers to easily train and infer a single model for multiple tasks.,natural-language-processing\n1597,2020-06-25 00:17:39,Maximizing Business Impact with Machine Learning,how to effectively leverage machine learning to build intelligent products as efficiently as possible.,mlops\n1598,2020-06-25 00:29:18,Automatic Data Augmentation for  Generalization in Deep RL,We compare three approaches for automatically finding an appropriate augmentation combined with two novel regularization terms for the policy and value function,other\n1599,2020-06-25 00:42:36,High-Fidelity Generative Image Compression,How to combine Generative Adversarial Networks and learned compression to obtain a state-of-the-art generative lossy compression system.,computer-vision\n1602,2020-06-25 04:03:38,Unet Model for Image Segmentation With EfficientNet Encoder,Implemented using tensorflow 2.2.0 with custom train and test step.,computer-vision\n1603,2020-06-25 10:40:56,A Million of ML Predictions at the Tip of Your Fingers,Announcement - SashiDo is breaking the barrier to Machine Learning by introducing a fully open-sourced Content Moderation Service.,computer-vision\n1605,2020-06-26 02:19:39,NetHack Learning Environment (NLE),A procedurally-generated grid-world dungeon-crawl game that strikes a great balance between complexity and speed for single-agent RL research.,other\n1606,2020-06-26 02:24:53,Paraphrase Generation Using T5 model,Simple application using T5 base model fine tuned in Quora Question Pairs to generate paraphrased questions.,natural-language-processing\n1607,2020-06-26 02:28:15,Message Passing Query Embedding,\"MPQE is a model for answering complex queries over knowledge graphs, that learns embeddings of entities in the knowledge graph, & embeddings for variable types.\",other\n1608,2020-06-26 02:31:17,Quantifying Attention Flow in Transformers,\"I explain two simple but effective methods, called Attention Rollout and Attention Flow\",natural-language-processing\n1614,2020-06-27 04:15:51,Natural Language Processing Roadmap,Roadmap for learning NLP topics.,natural-language-processing\n1615,2020-06-27 04:29:04,Weight Poisoning Attacks on Pre-trained Models,\"How Bert can be infused with nefarious behavior, even after fine-tuning.\",natural-language-processing\n1616,2020-06-27 04:37:16,Leveraging Temporal Context for Object Detection,\"Object detection architecture leveraging contextual clues across time for each camera deployment in a network, improving recognition of objects\",computer-vision\n1617,2020-06-27 04:42:47,Expressive Power of Graph Neural Networks,\"Graph isomorphism problem, the Weisfeiler-Lehman heuristic for graph isomorphism testing, and how it can be used to analyse the expressive power of GNNs.\",other\n1620,2020-06-27 10:27:43,rlx: A modular Deep RL library for research,\"\"\"rlx\"\" is a Deep RL library written on top of PyTorch & built for educational and research purpose.\",other\n1622,2020-06-27 14:18:13,Building AI Trading Systems,Lessons learned building a profitable algorithmic trading system using Reinforcement Learning techniques.,other\n1623,2020-06-27 14:20:49,Introduction to NLP using Fastai,Implementing and decoding the revolutionary ULMFiT approach to train a language model on any downstream NLP task.,natural-language-processing\n1629,2020-06-28 07:37:00,TF Lite Semantic Segmentation Models,Faster and lighter TF Lite models can perform semantic segmentation. ,computer-vision\n1630,2020-06-28 07:40:40,Semantic Segmentation + Background Removal + Style Transfer,\"Running multiple TF Lite models to perform semantic segmentation, remove background, and apply style transfer. \",computer-vision\n1636,2020-06-29 00:00:47,Automatic translation of the SQUAD dataset to spanish,\"Machine translation is used on the SQuAD dataset to produce an equivalent dataset in Spanish. Word alignment is applied to produce a synthetic spanisQA corpus.\n\",natural-language-processing\n1638,2020-06-29 02:56:43,Dakshina Dataset,A collection of text in both Latin and native scripts for 12 South Asian languages.,natural-language-processing\n1639,2020-06-29 02:58:52,Computer Vision Recipes,This repository provides examples and best practice guidelines for building computer vision systems.,computer-vision\n1644,2020-06-29 12:42:44,A research guide for data scientists,Tips on research from top data scientists,natural-language-processing\n1645,2020-06-29 17:16:17,Using Data Science Pipelines for Disaster Response,Uses ETL and ML pipeline to build an NLP system for classification of messages into appropriate disaster categories,natural-language-processing\n1646,2020-06-29 19:47:58,Twitter Turing Test,Can you guess whether this tweet is written by a human or generated by a neural network?,natural-language-processing\n1648,2020-06-30 02:34:54,STUMPY: A Powerful and Scalable Python Library for Time Series,\"STUMPY is a powerful and scalable Python library for computing a Matrix Profile, which can be used for a variety of time series data mining tasks.\",other\n1649,2020-06-30 02:39:32,Model Serving using FastAPI and streamlit,Simple example of usage of streamlit and FastAPI for ML model serving.,computer-vision\n1650,2020-06-30 02:49:57,The Reformer - Pushing the Limits of Language Modeling,An in-depth understanding of each of the key features of the Reformer.,natural-language-processing\n1651,2020-06-30 02:52:41,High-Resolution Image Inpainting,\"High-Resolution Image Inpainting with Iterative Confidence Feedback and Guided Upsampling.\n\",computer-vision\n1653,2020-06-30 03:01:50,MARGE: Pre-training via Paraphrasing,\"A retrieval model maps a document to a set of related documents, which a reconstruction model paraphrases to maximize the likelihood of the original. \",natural-language-processing\n1657,2020-06-30 18:00:11,Fast Api with Dockerization of your ML Models,In this GitHub repo you can able to know and learn how to build a fast API for testing your ML model and can test your ML model with UI and to Dockerize your ML,mlops\n1658,2020-07-01 02:22:10,SimCLR - Contrastive Learning of Visual Representations,How to load pretrained/finetuned SimCLR models from hub modules for fine-tuning.,computer-vision\n1662,2020-07-01 07:00:50,Image synthesis at CVPR 2020,An overview of the different approaches to image synthesis at CVPR 2020.,computer-vision\n1663,2020-07-01 07:08:45,Sktime,A python toolbox for machine learning with time series.,other\n1664,2020-07-01 07:14:00,\"Sentiment Analysis: Key Milestones, Challenges and New Directions\",\"An overview of sentiment analysis, it's progress and what's ahead.\",natural-language-processing\n1666,2020-07-01 07:20:52,Serverless BERT with HuggingFace and AWS Lambda,\"Build a serverless question-answering API with BERT, HuggingFace, the Serverless Framework, and AWS Lambda.\",natural-language-processing\n1668,2020-07-01 13:33:49,Model-based Reinforcement Learning: A Survey,\"A survey of the integration of both fields, better known as model-based reinforcement learning.\",other\n1677,2020-07-02 04:06:19,Building Level 3 Conversational AI Assistants,\"Presentations, panels, and fireside chats addressing all topics related to the creation of Level 3 AI assistants.\",natural-language-processing\n1678,2020-07-02 12:13:19,NSFW Image Classification REST API built with TensorFlow.JS,A ready-to-use & open-source NSFW Image Classification REST API built with TensorFlow.JS and NSFW.JS for effortless Content Moderation,computer-vision\n1688,2020-07-03 04:23:58,Python Implementation of Reinforcement Learning: An Introduction ,\"Plot replications, exercise solutions and Anki flashcards for the entire book by chapters.\",other\n1691,2020-07-03 04:40:05,The Simplest Way to Serve your NLP Model in Production w/ Python ,\"From scikit-learn to Hugging Face Pipelines, learn the simplest way to deploy ML models using Ray Serve.\",mlops\n1698,2020-07-04 01:07:48,Learning to Cartoonize Using White-box Cartoon Representations,An approach for image cartoonization using GANs.,computer-vision\n1699,2020-07-04 01:10:18,Reinforcement Learning Tutorial,\"Important reinforcement learning (RL) algorithms, including policy iteration, Q-Learning, and Neural Fitted Q.\",other\n1702,2020-07-04 04:51:18,Face Recognition Techniques,Face Detection and Recognition techniques using traditional CV and also using new deep learning method.,computer-vision\n1704,2020-07-04 10:42:53,LSTM Forecast Model for Stock Price Prediction using Keras,\" Easy to understand LSTM forecast model for Stock Price Prediction. The dataset contains daywise details of the GOOGL stock from May,2019-May 2018.\",other\n1706,2020-07-04 11:05:28,PokeZoo,A deep learning based web-app developed using the MERN stack and Tensorflow.js. ,computer-vision\n1710,2020-07-05 05:47:35,NLP-task-visualizer-app,This application designed with streamlit library will help in visualizing NLP tasks on text entered by you. ,natural-language-processing\n1721,2020-07-07 04:21:20,TensorflowTTS,Real-Time State-of-the-art Speech Synthesis for Tensorflow 2.,natural-language-processing\n1722,2020-07-07 04:23:38,spaczz: Fuzzy matching and more for spaCy,Fuzzy matching and more functionality for spaCy.,natural-language-processing\n1723,2020-07-07 04:26:45,BioSyn,Biomedical Entity Representations with Synonym Marginalization,natural-language-processing\n1724,2020-07-08 04:02:50,Image Classifier: In the Browser,Using Tensorflow.js to make the prediction directly in the browser.,computer-vision\n1726,2020-07-08 04:15:07,Photon: A Robust Cross-Domain Text-to-SQL System,\"A robust, modular, cross-domain NLIDB that can flag natural language input to which a SQL mapping cannot be immediately determined. \",natural-language-processing\n1728,2020-07-08 04:24:07,Bounding Box Prediction from Scratch using PyTorch,Multi-Task learning — Bounding Box Regression + Image Classification,computer-vision\n1729,2020-07-08 04:28:13,Comment Classification Using BERT (multi-language) Fine-Tuning,We are going to use BERT layer in a model applying Keras.,natural-language-processing\n1730,2020-07-08 04:30:28,TextBrewer,a PyTorch-based model distillation toolkit for natural language processing.,natural-language-processing\n1737,2020-07-08 18:22:40,codeBERT - Automated code docstring review with transformers,\"codeBERT provide a one command line to check if your code docstrings are up-to-date.\n\",natural-language-processing\n1748,2020-07-09 02:23:25,Continuous Machine Learning (CML),CML helps to organize MLOps infrastructure on top of the traditional software engineering stack instead of creating separate AI platforms.,mlops\n1750,2020-07-09 10:30:30,picTranslate: Seamless live Image Text translator,\"Given an image with text on it, this app can give you a new image with text modified into a different language.\",computer-vision\n1753,2020-07-10 02:44:11,TUDatasets,A collection of benchmark datasets for graph classification and regression.,other\n1754,2020-07-10 02:46:07,Full Stack Deep Learning,Full Stack Deep Learning helps you bridge the gap from training machine learning models to deploying AI systems in the real world.,mlops\n1755,2020-07-10 02:51:24,Easy OCR,\"Ready-to-use OCR with 40+ languages supported including Chinese, Japanese, Korean and Thai.\n\n\",computer-vision\n1759,2020-07-10 18:54:54,Emotion Recognition from Tom and Jerry videos,\"Developed an application that classifies the emotion depicted by Tom and Jerry in each frame into one of the following : happy, angry, sad or suprised.\",computer-vision\n1767,2020-07-11 05:05:31,Imagenette,Imagenette is a subset of 10 easily classified classes from Imagenet.,computer-vision\n1768,2020-07-11 05:08:02,TextAugment,Improving Short Text Classification through Global Augmentation Methods,natural-language-processing\n1769,2020-07-11 05:10:10,niacin,\"A Python library for replacing the missing variation in your text data.\n\n\",natural-language-processing\n1771,2020-07-11 05:16:17,Albumentations,Fast image augmentation library and easy to use wrapper around other libraries.,computer-vision\n1772,2020-07-11 05:19:05,Augmentor,Image augmentation library in Python for machine learning.,computer-vision\n1777,2020-07-11 05:37:12,tsfresh,Automatic extraction of relevant features from time series.,other\n1792,2020-07-11 06:28:58,Anomaly Detection Toolkit (ADTK),\"A Python toolkit for rule-based/unsupervised anomaly detection in time series\n\n\",other\n1795,2020-07-11 06:37:35,Chakin ,Simple downloader for pre-trained word vectors.,natural-language-processing\n1796,2020-07-11 06:39:39,Top2Vec,\"Top2Vec learns jointly embedded topic, document and word vectors.\n\n\",natural-language-processing\n1797,2020-07-11 06:42:29,Contextualized Topic Models,A python package to run contextualized topic modeling.,natural-language-processing\n1800,2020-07-11 06:51:58,jellyfish,🎐 a python library for doing approximate and phonetic matching of strings.,natural-language-processing\n1802,2020-07-11 06:57:28,SentencePiece,\"Unsupervised text tokenizer for Neural Network-based text generation.\n\n\",natural-language-processing\n1803,2020-07-11 06:59:08,A Deep Dive into the Wonderful World of Preprocessing in NLP,A glimpse into the surprisingly deep and interesting world of preprocessing in NLP.,natural-language-processing\n1813,2020-07-11 07:45:01,Pytest,\"The pytest framework makes it easy to write small tests, yet scales to support complex functional testing\n\n\",mlops\n1817,2020-07-11 07:55:23,Artifacts - Weights & Biases,\"Effortless pipeline tracking and production model management\n\n\",mlops\n1818,2020-07-11 08:07:35,DeepkitAI,The Open-Source Machine Learning Devtool and Training Suite.,mlops\n1819,2020-07-11 08:14:03,Neptune.ai,The most lightweight experiment management tool that fits any workflow.,mlops\n1820,2020-07-11 08:17:17,Rasa,An open source machine learning framework to automate text-and voice-based conversations. ,natural-language-processing\n1831,2020-07-11 11:36:26,TF Sprinkles,Fast and efficient sprinkles augmentation implemented in TensorFlow.,computer-vision\n1834,2020-07-11 17:19:43,Laplacian Pyramid Reconstruction and Refinement for Semantic Seg., Pytorch implementation of multi-resolution reconstruction architecture based on a Laplacian pyramid that uses skip connections.,computer-vision\n1836,2020-07-11 18:15:19,Training a pets detector model with TFOD API (TF 2),\"In this notebook, we will be training a custom object detection model using the latest TensorFlow Object Detection (TFOD) API which is based on TensorFlow 2.2. \",computer-vision\n1840,2020-07-12 00:59:27,TensorFlow 2 meets the Object Detection API,TF Object Detection API (OD API) officially supports TensorFlow 2!,computer-vision\n1843,2020-07-12 13:35:20,Cortex,Build machine learning APIs.,mlops\n1844,2020-07-12 16:24:10,Semi-Supervised Learning in Computer Vision,A comprehensive overview of recent semi-supervised learning methods in Computer Vision,computer-vision\n1845,2020-07-12 21:42:52,Face Predicting Web App,Interactive Deep Learning Model that utilizes your computer webcam to predict your age and gender in seconds! ,computer-vision\n1847,2020-07-13 03:46:32,Driver Identification Based on Vehicle's telematics data,\"In this paper, we proposed a deep learning model, which can identify drivers from their driving behaviors based on vehicle telematics data.\",computer-vision\n1848,2020-07-13 05:00:40,Comprehensive analysis of important metrics in ML,\"In this work, the authors present a comprehensive analysis of important metrics in practical applications.\",computer-vision\n1851,2020-07-13 15:21:13,StreamAlert,\"A serverless, realtime data analysis framework which empowers you to ingest, analyze, and alert on data from any environment, using datasources and alerts.\",mlops\n1855,2020-07-14 03:17:25,ULMFiT Airline Sentiment Analysis,Transfer Learning using pretrained ULMFiT model,natural-language-processing\n1856,2020-07-14 03:21:00,DeepDream Video Style Transfer,DeepDream on Video,computer-vision\n1859,2020-07-14 04:01:18,\"You Trained a Machine Learning Model, Now What?\",\"Three often overlooked parts of this process occur after the model is actually built: model evaluation, deployment, and monitoring.\",mlops\n1860,2020-07-14 09:53:19,NSFW Image Moderation Automation Engine built with TensorFlow.JS ,\"An open-source NSFW Image Classifier including an Automation Engine for fast deletion & moderation built with Node.js, TensorFlow, and Parse Server\",computer-vision\n1865,2020-07-14 22:55:08,PDFTableExtract,Build a parser to extract the table in PDF document with RetinaNet,computer-vision\n1867,2020-07-14 23:03:02,YOLOv4 With TensorFlow,\"YOLOv4, YOLOv4-tiny, YOLOv3, YOLOv3-tiny Implemented in Tensorflow 2.0, Android. Convert YOLO v4 .weights tensorflow, tensorrt and tflite.\",computer-vision\n1868,2020-07-15 03:52:31,Selfie2Anime with TFLite,An end-to-end tutorial with TensorFlow Lite for Selfie2Anime (U-GAT-IT). ,computer-vision\n1869,2020-07-15 20:31:37,Bridging PyTorch and TVM,\"Taking Hugging Face transformer BERT from PyTorch and running it on\nApacheTVM for both inference (with reasonable timings) and training.\",natural-language-processing\n1871,2020-07-16 03:58:21,Summarize a webapge,A Flask application that extracts and summarizes webpage using Natural Language Processing. Powered by nlp-akash.,natural-language-processing\n1872,2020-07-16 04:19:37,An Icon Classifier with TensorFlow Lite Model Maker,An Icon Classifier with TensorFlow Lite Model Maker,computer-vision\n1879,2020-07-16 17:40:33,Cross-lingual Transfer Learning - Sebastian Ruder,\"An overview of approaches that transfer knowledge across languages and enable us to scale NLP models to more of the world's 7,000 languages.\",natural-language-processing\n1880,2020-07-16 17:43:48,AdapterHub: A Framework for Adapting Transformers,Huggingface Transformers + Adapters,natural-language-processing\n1882,2020-07-16 17:51:48,Object Detection with RetinaNet,Implementing RetinaNet: Focal Loss for Dense Object Detection.,computer-vision\n1884,2020-07-17 01:41:33,Deploying your ML Model with TorchServe,\"In this talk, Brad Heintz walks through how to use TorchServe to deploy trained models at scale without writing custom code. \",mlops\n1886,2020-07-17 08:27:56,Medical Zoo - 3D Multi-modal Medical Image Segmentation,My articles on deep learning in medical imaging,computer-vision\n1887,2020-07-17 16:48:13,Computer Vision Pretrained Models,A collection of computer vision pre-trained models.,computer-vision\n1889,2020-07-17 17:20:20,NLP Pretrained Models,\"A collection of Natural language processing pre-trained models.\n\n\",natural-language-processing\n1896,2020-07-19 00:40:37,Machine Learning Production Pipeline,\"Project Flow and Landscape\n\",mlops\n1898,2020-07-19 00:47:53,Tempering Expectations for GPT-3 and OpenAI’s API,\"A closer look at the \"\"magic\"\" behind GPT-3 and caveats to be aware of.\",natural-language-processing\n1899,2020-07-19 03:59:41,StyleGAN Encoder,Encodes real images into the latent space of a StyleGAN model.,computer-vision\n1900,2020-07-19 04:12:40,WikiArt StyleGAN 2 Model,A conditional StyleGAN 2 model trained on images from WikiArt,computer-vision\n1902,2020-07-19 10:19:24,Indian Paper Currency Prediction,\"The trained model takes an image (Indian Paper Currency) as an input and predict the class of image from 10, 20, 50, 100, 200, 500, 2000 denomination.\",computer-vision\n1903,2020-07-19 11:31:25,\"Neural Style Transfer (Gatys et al., PyTorch)\",My implementation of the original neural style transfer paper by Gatys et al. (In PyTorch).,computer-vision\n1904,2020-07-19 12:44:53,Implementation of Face Net  in TensorFlow -  2.0,This repository is a naive unofficial  implementation of Face Net paper  - 2015 .This implementation opts online mode of semi - hard triplet mining.,computer-vision\n1910,2020-07-19 15:44:21,Azure Machine Learning Template,Azure Machine Learning template for MNIST classifier,mlops\n1913,2020-07-19 16:55:33,Teachable Machine (Image Classifier),A teachable image classifier that runs on any browser built using TensorFlow JS.,computer-vision\n1914,2020-07-19 16:59:37,TensorFlow JS- Object Detection in Browser,A real-time object detection model in your browser using TensorFlow JS.,computer-vision\n1916,2020-07-20 00:01:38,How to Stop Worrying About Compositionality,\"Review the tenets of compositionality, and to highlight how each theory has evolved to match particular theoretical positions about the nature of language.\",natural-language-processing\n1918,2020-07-20 05:48:38,Spacy-Go,spacy-go is Golang interface for accessing linguistic annotations provided by spaCy using Google's gRPC. This module only supports basic functionalities like lo,natural-language-processing\n1919,2020-07-20 05:53:12,Dframcy,DframCy is a light-weight utility module to integrate Pandas Dataframe to spaCy's linguistic annotation and training tasks.,natural-language-processing\n1921,2020-07-20 14:04:48,NSFW Image Moderation Admin App with ReactJS,\"A fully-functional NSFW Admin Application for simplified image classification & moderation built with Node.js, TensorFlow.js, and React\",computer-vision\n1923,2020-07-20 18:59:04,PyTorch Geometric Temporal,A Temporal Extension Library for PyTorch Geometric ,other\n1924,2020-07-20 20:34:47,Why is it Important to Monitor Machine Learning Models?,The importance of monitoring and how monitoring ML is different from application performance management (APM).,mlops\n1925,2020-07-20 20:54:00,PyTorch Implementation of PaletteNet,\"PyTorch implementation of PaletteNet: Image Recolorization with Given Color Palette (Cho et al., 2017).\",computer-vision\n1927,2020-07-20 21:21:12,ECG arrhythmia classification using a convolutional neural net,This is an implementation of the paper on ECG arrhythmia classification https://arxiv.org/pdf/1804.06812.pdf.,computer-vision\n1929,2020-07-20 23:55:33,Structured Self Attention,Implementation for the paper A Structured Self-Attentive Sentence Embedding (https://arxiv.org/abs/1703.03130 ). Model interpretability / explainability.,natural-language-processing\n1933,2020-07-21 01:42:42,TurboTransformers,A fast and user-friendly runtime for transformer inference on CPU and GPU.,natural-language-processing\n1938,2020-07-21 11:50:53,Rasa NLU Examples,Experimental components for Rasa NLU pipelines. ,natural-language-processing\n1940,2020-07-21 19:01:54,Change Detection using Siamese networks,\"The blog is a primer on Siamese Networks and how they're used for observing change in satellite images over time, or observing facial changes as people age\",computer-vision\n1941,2020-07-21 19:13:05,My Artificial Intelligence Bookmarks,\"A curated list of my reads, implementations, and core concepts of Artificial Intelligence, Deep Learning, Machine Learning by best folk in the world.\",natural-language-processing\n1943,2020-07-22 03:32:30,Do we Need Deep Graph Neural Networks?,Does depth in graph neural network architectures bring any advantage?,other\n1945,2020-07-22 03:39:13,Pandera,A flexible and expressive pandas data validation library.,mlops\n1952,2020-07-24 06:28:15,TensorFlow Serving,\"A flexible, high-performance serving system for machine learning models, designed for production environments. \",mlops\n1953,2020-07-24 06:30:44,BentoML,BentoML is an open-source framework for high-performance ML model serving.,mlops\n1954,2020-07-24 06:43:59,Azure ML,MLOps using Azure ML.,mlops\n1955,2020-07-24 06:47:29,Shape and Viewpoint without Keypoints,\"Recover the 3D shape, pose and texture from a single image, trained on an image collection without any ground truth 3D shape, multi-view, camera viewpoints.\",computer-vision\n1965,2020-07-25 02:58:40,model-logger,Model-Logger is a Python library for storing model's profile and rapid inter model comparison.,mlops\n1968,2020-07-26 04:48:40,Sentiment Analysis With Transformers,\"Sentiment analysis neural network trained by fine-tuning BERT, ALBERT, or DistilBERT on the Stanford Sentiment Treebank.\",natural-language-processing\n1971,2020-07-27 02:30:42,Attention based YOLO: Object Detection,\"An easy to follow, YOLO implementation with keras lib.  Used a attention based architecture to extract more fine grained information about object.\",computer-vision\n1977,2020-07-27 14:14:10,LabelDetection: simplifying the use and construction of deep dete,LabelDetection is a graphical tool that aims to facilitate all the steps required in the pipeline to construct and use a deep-learning base object detection mod,computer-vision\n1978,2020-07-27 14:34:12,How to Set Up a Python Project For Automation and Collaboration,\"How to set up a Python repo with unit tests, code coverage, lint checking, type checking, Makefile wrapper, and automated build with GitHub Actions.\",mlops\n1980,2020-07-27 14:51:03,Understanding & Implementing SimCLR - an ELI5 guide,\"I explain the SimCLR and its contrastive loss function step by step, build image embeddings and then show how to use them to train image classifier on top.\",computer-vision\n1983,2020-07-28 04:14:12,CoreML Model Zoo,Collection of unified and converted pre-trained models.,computer-vision\n1984,2020-07-28 04:18:00,How GPT3 Works - Visualizations and Animations,A compilation of my threads explaining GPT3. ,natural-language-processing\n1985,2020-07-28 04:19:58,Temporal Graph Networks,\"In this post, we describe Temporal Graph Network, a generic framework for deep learning on dynamic graphs.\",other\n1986,2020-07-28 07:44:13,Behavioral Testing of NLP models with CheckList,An overview of the “CheckList” framework for fine-grained evaluation of NLP models,natural-language-processing\n1992,2020-07-29 03:41:04,Time series forecasting,A thorough introduction to time series forecasting using TensorFlow.,other\n1993,2020-07-29 04:47:55,Real-time text detection with EAST in TFLite,Demonstrates the conversion process from the original EAST model to TFLite and how to use it on static images and also on real-time video feeds. ,computer-vision\n1994,2020-07-29 04:51:30,Understanding the Effectivity of Ensembles in Deep Learning,\"The report explores the ideas presented in Deep Ensembles: A Loss Landscape Perspective by Stanislav Fort, Huiyi Hu, and Balaji Lakshminarayanan.\",computer-vision\n1999,2020-07-30 03:57:32,Small differences in BLEU are meaningless,Only big differences in metric scores are meaningful in MT.,natural-language-processing\n2002,2020-07-30 04:08:46,Multi-target in Albumentations,\"Many images, many masks, bounding boxes, and key points. How to transform them in sync?\",computer-vision\n2005,2020-07-30 11:19:02,Social Distance Detection,\"If people are very close to each other, a red bounding box is displayed around them indicating that they are not maintaining social distance.\",computer-vision\n2006,2020-07-30 11:30:56,Deep Learning Techniques for NLP in Healthcare,A talk discussing the recent advancements of deep learning to facilitate the adaption of NLP in the healthcare domain.,natural-language-processing\n2008,2020-07-30 14:50:30,Extension to block NSFW content using AI,\"NSFW Filter is an extension that blocks NSFW content from your browser.\nIt uses a computer vision model to detect NSFW content and hides it from the user.\",computer-vision\n2009,2020-07-30 14:55:57,ATLASS: AutoML using Transfer and Semi-Supervised Learning,\"This repository includes the code, application, and notebooks for the work \"\"AutoML using Transfer and Semi-Supervised Learning\"\". The tools presented here can be\",computer-vision\n2012,2020-07-30 15:04:28,LabelStoma: stomata detection using YOLO,LabelStoma is a graphical image tool for automatically detecting stomata in images. ,computer-vision\n2013,2020-07-30 15:07:54,DeepClas4Bio,DeepClas4Bio is a project that aims to facilitate the interoperability of bioimaging tools with deep learning frameworks.,computer-vision\n2016,2020-07-31 15:30:38,Meme Classifier Using TFlite and flutter,Meme classifier using fine tuned mobilenet. This app showcases how you can perform low latency realtime classification apps using TFlite,computer-vision\n2020,2020-08-01 12:14:26,Text Summarization using TF-IDF Algorithm,This Article explains the TF-IDF algorithm and shows the implemtnation from scratch to summarize the text.,natural-language-processing\n2022,2020-08-01 14:41:37,Simple Transformers,\"Transformers for Classification, NER, QA, Language Modeling, Language Generation, T5, Multi-Modal, and Conversational AI.\",natural-language-processing\n2024,2020-08-01 14:49:31,DeText: A Deep Neural Text Understanding Framework,DeText: A Deep Neural Text Understanding Framework for Ranking and Classification Tasks.,natural-language-processing\n2026,2020-08-01 15:04:37,Efficient Serverless Deployment of PyTorch Models on Azure,A tutorial for serving models cost-effectively at scale using Azure Functions and ONNX Runtime.,mlops\n2027,2020-08-01 15:27:29,Nearest Celebrity Face,Implementation of FaceNet: A Unified Embedding for Face Recognition and Clustering to find the celebrity whose face matches the closest to yours. The input face,computer-vision\n2030,2020-08-02 12:38:08,A Few Favorite Recipes in Computer Vision & Deep Learning,This blog post enlists a few of my favorite recipes in deep learning in the context of computer vision (as of August 2020).,computer-vision\n2031,2020-08-02 14:46:10,NeuralQA - API and Visual Interface for Extractive QA,A Usable Library for Question Answering on Large Datasets with BERT,natural-language-processing\n2032,2020-08-02 20:00:23,Object tracking in 75 lines of code,\"Object tracking is straightforward conceptually. And if you have a good detector, simple methods can be pretty effective.\",computer-vision\n2033,2020-08-03 03:49:22,FARM: Framework for Adapting Representation Models,🏡 Fast & easy transfer learning for NLP. Harvesting language models for the industry.,natural-language-processing\n2035,2020-08-04 02:49:24,Act - GitHub Actions locally,Run your GitHub Actions locally.,mlops\n2038,2020-08-04 03:53:36,Curated papers & articles on DS & ML in production,\"Learn how organizations & business solved machine learning problems, including problem statement, research, methodology, and results.\",mlops\n2039,2020-08-04 16:45:09,Tensorflow2 Object Detection Tutorial,\"In this tutorial, we will be going step by step the complete training process of Tensorflow2 Object Detection. \",computer-vision\n2042,2020-08-05 02:07:24,ONNX T5,\"Summarization, translation, Q&A, text generation and more at blazing speed using a T5 version implemented in ONNX.\",natural-language-processing\n2043,2020-08-05 02:17:10,DeLighT: Very Deep and Light-weight Transformers,Similar or better performance than transformer-based models with significantly fewer parameters,natural-language-processing\n2045,2020-08-05 06:40:32,Evaluation Metrics For Information Retrieval,Learn about common metrics used to evaluate performance of information retrieval systems,natural-language-processing\n2047,2020-08-05 15:18:46,Test-Time Data Augmentation,Tutorial on how to properly implement test-time image data augmentation in a production environment with limited computational resources.,mlops\n2048,2020-08-05 16:50:22,SadedeGel: An extraction based Turkish news summarizer,\"\"\"Sadede Gel\"\" in Turkish, means \"\"cut to the chase\"\".  \",natural-language-processing\n2051,2020-08-05 20:13:51,MobyDick word frequency,Getting the count of the words in Moby Dick story using both web scraping and NLP,natural-language-processing\n2053,2020-08-05 20:30:33,Image Classification with Keras,Build a pipeline to train an image classifier in Keras and tune hyperparameters to optimize the performance of our classifier.,computer-vision\n2054,2020-08-05 20:34:09,Dropout in PyTorch – An Example,\"An example of adding Dropout to a PyTorch model, and observe the effect dropout has on the model's performance by tracking our models in Weights & Biases.\",computer-vision\n2057,2020-08-06 04:06:11,\"Data Science Meets Devops: MLOps with Jupyter, Git, & Kubernetes\",\"An end-to-end example of deploying a machine learning product using Jupyter, Papermill, Tekton, GitOps and Kubeflow.\",mlops\n2061,2020-08-06 04:59:21,Detectron 2 Demo from Facebook,This Project contains the process of getting started with Facebook FAIR's detectron2 project on windows 10 without any Nvidia GPU.,computer-vision\n2062,2020-08-06 12:38:55,Predict Vehicle Speed From Dash Cam Video,A series of experiments attempting to predict vehicle speed from dash cam videos using optical flow and neural networks.,computer-vision\n2098,2020-08-06 23:15:45,Digital Image Processing in Python,Play around with pixel values with Python programming language.,computer-vision\n2100,2020-08-07 04:24:28,A 2020 guide to Semantic Segmentation,\"Concept of image segmentation, discuss the relevant use-cases, different neural network architectures involved in achieving the results, metrics and datasets.\",computer-vision\n2106,2020-08-08 15:06:18,Fast NST for Videos (+ person segmentation) 🎥 + ⚡💻 + 🎨 = ❤️,Create NST videos and pick separate styles for the person in the video and for the background.,computer-vision\n2109,2020-08-09 07:24:57,Live demo : State-of-the-art MCQ Generator from any content,\"Demo for state-of-the-art MCQ (Multiple Choice Questions) generator from any content built using T5 transformer, HuggingFace, and Sense2vec\n\",natural-language-processing\n2111,2020-08-10 03:26:16,InvoiceNet,\"Deep neural network to extract intelligent information from PDF invoice documents.\n\",computer-vision\n2112,2020-08-10 03:41:31,Search for visual datasets,\"By task, application, class, label or format.\",computer-vision\n2113,2020-08-10 04:01:03,GAN-BERT,Enhancing the BERT training with Semi-supervised Generative Adversarial Networks.,natural-language-processing\n2114,2020-08-10 04:03:51,tsaug,A Python package for time series augmentation.,other\n2116,2020-08-10 04:15:38,Machine Learning Pipelines for Kubeflow.,Kubeflow pipelines are reusable end-to-end ML workflows built using the Kubeflow Pipelines SDK.,mlops\n2117,2020-08-10 04:17:57,Structuring Unit Tests in Python,\"Where to put tests, how to write fixtures and the awesomeness of test parametrization.\",mlops\n2121,2020-08-10 21:59:41,DeepR — Training TensorFlow Models for Production,DeepR is a Python library to build complex pipelines as easily as possible on top of Tensorflow.,mlops\n2124,2020-08-11 00:20:42,Neural Architecture Search,\"A look at neural architecture search w.r.t search space, search algorithms and evolution strategies.\",other\n2135,2020-08-13 01:52:06,Temporal Convolutional Networks for Time-Series,\"We introduce several novels using TCN, including improving traffic prediction, sound event localization & detection, and probabilistic forecasting.\",other\n2136,2020-08-13 02:05:11,Machine Learning Deployment: Shadow Mode,\"“How do I test my new model in production?” One answer, and a method I often employ when initially deploying models, is shadow mode.\",mlops\n2138,2020-08-13 18:12:46,Extract Stock Sentiment from News Headlines,\" In this project, you will generate investing insight by applying sentiment analysis on financial news headlines from Finviz. \",natural-language-processing\n2141,2020-08-14 03:15:38,hloc - the hierarchical localization toolbox,Visual localization made easy.,computer-vision\n2147,2020-08-15 01:17:07,Practical Tips and Tricks for Successful Transfer Learning,Training models to learn knowledge and skills from other related tasks that will transfer and boost performance on tasks of interest.,natural-language-processing\n2148,2020-08-15 01:22:01,txtai: AI-powered search engine,AI-powered search engine.,natural-language-processing\n2151,2020-08-15 05:32:22,Drowsiness Detection System using OpenCV and Flask in Python ,\"This system provides an overview of a system that detects whether a person is drowsy while driving and if so, alerts him by using voice messages in real-time. \",computer-vision\n2155,2020-08-15 14:49:16,\"GPT-3, The model simply knows!\",Brief Introduction about the gigantic GPT-3. a new leap in AI and Natural Language processing. ,natural-language-processing\n2159,2020-08-16 01:02:18,Solaris,CosmiQ Works Geospatial Machine Learning Analysis Toolkit.,computer-vision\n2163,2020-08-17 03:19:46,Safe Space - Github Action,Github action that checks the toxicity level of comments and PR reviews to help make repos safe spaces.,natural-language-processing\n2164,2020-08-17 03:24:46,Intro to Autoencoders,\"This tutorial introduces autoencoders with three examples: the basics, image denoising, and anomaly detection.\",computer-vision\n2166,2020-08-17 05:19:41,Pix2Pix,\"Tensorflow 2.0 Implementation of the paper Image-to-Image Translation using Conditional GANs by Philip Isola, Jun-Yan Zhu, Tinghui Zhou and Alexei A. Efros.\",computer-vision\n2167,2020-08-17 06:27:31,Insight,Project Insight is designed to create NLP as a service with code base for both front end GUI (streamlit) and backend server (FastAPI) the usage of transformers ,natural-language-processing\n2168,2020-08-17 10:55:43,Onceupon.space,NLP experiment in story-telling  that creates illustrations (text to sketch) and content (text generation),natural-language-processing\n2173,2020-08-18 04:16:33,Fine-tuning with custom datasets,This tutorial will take you through several examples of using 🤗 Transformers models with your own datasets.,natural-language-processing\n2185,2020-08-18 23:12:27,Language Interpretability Tool (LIT),\"The Language Interpretability Tool (LIT) is a visual, interactive model-understanding tool for NLP models.\",natural-language-processing\n2188,2020-08-19 15:16:46,Great Expectations,Always know what to expect from your data.,mlops\n2193,2020-08-20 00:39:05,Effective testing for machine learning systems,\"Why testing machine learning systems can be different, and discuss some strategies for writing effective tests for machine learning systems.\",mlops\n2202,2020-08-22 03:55:27,Graph Representation Learning Book,\"Introduction to graph representation learning, including methods for embedding graph data, graph neural networks, and deep generative models of graphs.\",other\n2203,2020-08-22 05:58:20,Image Similarity Search in PyTorch,\"Simple Convolutional Auto-encoder based image similarity\nsearch to find similar images to given image or features.\nFully written in PyTorch.\",computer-vision\n2204,2020-08-22 17:19:00,Tensorflow Object Detection with Tensorflow 2,Object Detection with Tensorflow 2 and the Tensorflow Object Detection API ,computer-vision\n2207,2020-08-23 04:38:45,Rules of Machine Learning: Best Practices for ML Engineering,A basic knowledge of machine learning get the benefit of best practices in machine learning from around Google.,mlops\n2214,2020-08-24 11:16:47,vedaseg,vedaseg is an open source semantic segmentation toolbox based on PyTorch.,computer-vision\n2215,2020-08-24 11:52:10,vedastr,vedastr is an open source scene text recognition toolbox based on PyTorch.,computer-vision\n2218,2020-08-25 13:57:49,CascadeTabNet,\"An approach for end-to-end table detection and structure recognition from image-based documents\n\",computer-vision\n2220,2020-08-25 16:13:31,\"Table Detection, Information Extraction and Structuring using ML\",Table Extraction (TE) is the task of detecting and decomposing table information in a document.,natural-language-processing\n2223,2020-08-26 04:21:37,AxCell,Automatic Extraction of Results from Machine Learning Papers,computer-vision\n2226,2020-08-27 01:54:16,Hyperparameter Optimization for 🤗 Transformers: A Guide,\"Basic grid search is not the most optimal, and in fact, the hyperparameters we choose can have a significant impact on our final model performance.\",natural-language-processing\n2235,2020-08-27 16:03:12,Shift-Ctrl-F: Semantic Search for the Browser,🔎: Search the information available on a webpage using natural language instead of an exact string match.,natural-language-processing\n2238,2020-08-28 01:24:08,Spinning Up in Deep RL (OpenAI),An educational resource to help anyone learn deep reinforcement learning.,other\n2239,2020-08-28 07:07:39,An Introduction to Adversarial Examples in Deep Learning,\"This report provides an intuitive introduction to adversarial examples, discusses a wide variety of different adversarial attacks and, most notably, provides ad\",computer-vision\n2242,2020-08-29 08:10:21,Deep dive into ROI layer in Object Detection Models,In this blog post we will implement in torch ROI Pool and ROI Align models from scratch.,computer-vision\n2245,2020-08-30 02:51:07,On the Bottleneck of Graph Neural Networks and its Implications,The mechanism of propagating information between neighbors creates a bottleneck when every node aggregates messages from its neighbors.,other\n2247,2020-08-30 11:48:19,Unsupervised Keyphrase Extraction,Learn about unsupervised algorithms for automatically extracting representative keyword and phrases from documents,natural-language-processing\n2251,2020-08-31 10:05:12,Practical AI: Using NLP word embeddings to solve localization ,\"Using NLP word vectors (word2vec, glove, etc) in a novel way to solve the problem of localization in edtech.\",natural-language-processing\n2252,2020-08-31 23:40:26,Explore then Execute,Adapting without Rewards via Factorized Meta-Reinforcement Learning,other\n2255,2020-09-01 04:49:38,\"Tensorflow, Pytorch, Transformer, Fastai, etc. Tutorials\",\"BERT Classification, Question Answering, Seq2Seq Machine Translation, Contextual Topic Modeling, Large Scale Multilabelclassification, etc\",natural-language-processing\n2258,2020-09-02 09:05:08,Graph Convolutions for dummies,An article explaining Graph Convolutional Networks as simply as possible.,other\n2259,2020-09-02 23:08:03,ECCV 2020: Some Highlights,A sort of a snapshot of the conference by summarizing some papers (& listing some) that grabbed my attention.,computer-vision\n2260,2020-09-02 23:13:20,CVPR 2020: A Snapshot,A snapshot of the conference by summarizing some papers (& listing some) that grabbed my attention.,computer-vision\n2263,2020-09-03 23:05:32,TTT: Fine-tuning Transformers with TPUs or GPUs acceleration,\"TTT is short for a package for fine-tuning 🤗 Transformers with TPUs, written in Tensorflow2.0+.\",natural-language-processing\n2264,2020-09-04 01:24:22,MushroomRL,Python library for Reinforcement Learning.,other\n2267,2020-09-04 02:50:39,What Is MLOps?,\"Machine learning operations, MLOps, are best practices for businesses to run AI successfully with help from an expanding software products and cloud services.\",mlops\n2268,2020-09-05 01:06:07,NLP Course | For You,This is an extension to the (ML for) Natural Language Processing course I teach at the Yandex School of Data Analysis (YSDA) since fall 2018. ,natural-language-processing\n2269,2020-09-05 01:09:06,Learning to Summarize with Human Feedback,Human feedback models outperform much larger supervised models and reference summaries on TL;DR,natural-language-processing\n2273,2020-09-05 18:22:44,ONNX Transformers,Accelerated NLP pipelines for fast inference 🚀 on CPU. Built with 🤗 Transformers and ONNX runtime.,natural-language-processing\n2275,2020-09-06 07:26:21,hugdatafast: huggingface/nlp + fastai,The elegant integration of huggingface/nlp and fastai2 and handy transforms using pure huggingface/nlp ,natural-language-processing\n2280,2020-09-06 18:59:46,Top 10 Deep Learning Breakthroughs — Deep Reinforcement Learning,The article unravels the journey behind reaching the point when Reinforcement Learning combined with Deep Learning defeated a Go player world champion.,other\n2283,2020-09-07 07:13:04,Data analysis made easy: Text2Code for Jupyter notebook,A jupyter notebook extension for Text2Code for basic pandas and plotly commands,natural-language-processing\n2284,2020-09-07 10:42:32,electra_pytorch:  ELECTRA in PyTorch (fastai + huggingface),Unofficial reimplementation of <ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators>,natural-language-processing\n2285,2020-09-07 13:36:55,Images of radio boxes,I have collected about 15+k raw images of radio boxes across 500+ forms and hand-picked 200+  images that can be used to determine if a radio box is checked.,computer-vision\n2287,2020-09-07 20:56:51,omega|ml - building and deploying ML models the easy way,Deploying  ML is hard. It should not be. omega|ml makes it a breeze.,mlops\n2290,2020-09-09 00:16:32,Fine-tune a non-English GPT-2 Model with Huggingface,\" In this tutorial, we are going to use the transformers library by Huggingface. We will use the new Trainer class and fine-tune out GPT-2 model.\",natural-language-processing\n2294,2020-09-09 16:14:37,Getting started with large-scale ETL jobs using Dask and AWS EMR,\"EMR is AWS’s distributed data platform, which we can interact with and submit jobs to from a JupyterLab notebook running on our local machine.\",mlops\n2295,2020-09-09 16:36:45,How to Create a Cartoonizer with TensorFlow Lite?,An end-to-end tutorial on how to convert to TensorFlow Lite (TFLite) model and deploy it to an Android app for cartoonizing an image captured by camera.,computer-vision\n2296,2020-09-10 01:15:57,How to Test Machine Learning Code and Systems,\"🚦 Minimal examples of testing machine learning for correct implementation, expected learned behaviour, and model performance.\n\n\",mlops\n2298,2020-09-11 00:02:10,torchCDE,Differentiable controlled differential equation solvers for PyTorch with GPU support and memory-efficient adjoint backpropagation.,other\n2299,2020-09-11 00:07:11,Latent graph neural networks: Manifold learning 2.0?,Parallels between recent works on latent graph learning and older techniques of manifold learning.,other\n2300,2020-09-11 00:11:14,Real Python Recommendation Engine,A full stack data science project that performs document similarity on RealPython.com content. Content recommendations are implemented via a Chrome extension.,natural-language-processing\n2304,2020-09-11 17:54:04,Graph Neural Networks,A descriptive guide for Graph Neural Networks.,other\n2317,2020-09-14 05:32:45,End-to-end Object Detection in TensorFlow Lite,\"This project shows how to train a custom detection model with the TFOD API, optimize it with TFLite, and perform inference with the optimized model.\",computer-vision\n2318,2020-09-14 11:55:33,Jepto - Digital Marketing Analytics,KPI Prediction and Anomaly Detection of digital marketing data for both technical and non-technical marketers and business owners.,other\n2319,2020-09-14 19:21:33,Cartoonizer with TensorFlow.js,An app to turn your photos into cartoon-styled images 🎨 within your browsers using White-box Cartoonization GAN.,computer-vision\n2325,2020-09-16 13:43:20,Implementing Content-Based Image Retrieval with Siamese Networks,\"With content-based image retrieval, we refer to the task of finding images containing attributes which are not in the image metadata, but in its visual content.\",computer-vision\n2326,2020-09-17 00:18:51,NLP for Developers: Multilingual NLP | Rasa,\"In this video, Rasa Developer Advocate Rachael will talk about common approaches to handle language input in more than one language.\",natural-language-processing\n2327,2020-09-17 15:36:45,Paint with Machine Learning,This web app allows you to create a landscape painting in the style of Bob Ross using a deep learning model served using a Spell model server.,computer-vision\n2328,2020-09-17 16:04:29,Distilling Knowledge in Neural Networks,This project demonstrates the compelling model optimization technique - knowledge distillation with code walkthroughs in TensorFlow. ,computer-vision\n2332,2020-09-18 08:49:55,Recurrent Neural Networks: building GRU cells VS LSTM cells ,What are the advantages of RNN’s over transformers? When to use GRU’s over LSTM? What are the equations of GRU really mean? How to build a GRU cell in Pytorch?,natural-language-processing\n2341,2020-09-20 00:34:03,PyTorch Forecasting,Time series forecasting with PyTorch.,other\n2342,2020-09-20 03:24:58,Norfair,Lightweight Python library for adding real-time 2D object tracking to any detector.,computer-vision\n2344,2020-09-21 00:20:00,Labelai,\"Labelai is an online tool designed to label images, useful for training AI models.\",computer-vision\n2345,2020-09-21 00:26:02,Remo,🐰 Python lib for remo - the app for annotations and images management in Computer Vision.,computer-vision\n2348,2020-09-21 23:47:06,Layered Neural Rendering for Retiming People in Video,Manipulating and editing the time in which different motions of individuals in the video occur.,computer-vision\n2351,2020-09-22 03:42:58,Simple Transformers: Transformers Made Easy,Simple Transformers removes complexity and lets you get down to what matters – model training and experimenting with the Transformer model architectures.,natural-language-processing\n2353,2020-09-22 13:04:04,TF Geometric,Efficient and Friendly Graph Neural Network Library for TensorFlow 1.x and 2.x.,other\n2356,2020-09-23 04:56:15,\"Part 2: Deep Representations, a way towards neural style transfer\",A top-down approach to conceiving neural style transfer,computer-vision\n2357,2020-09-23 10:27:15,Sudoku Solver,Solving Sudoku by extracting the puzzle from photo using Computer Vision and OCR and solving it.,computer-vision\n2360,2020-09-23 13:56:29,\"3D Face: Fast, Accurate and Stable Reconstruction\",\"This work extends the previous work 3DDFA, named 3DDFA_V2, titled Towards Fast, Accurate and Stable 3D Dense Face Alignment, accepted by ECCV 2020. \",computer-vision\n2368,2020-09-25 07:47:27,TableQA,AI tool for querying  natural language on tabular data like csvs and other dataframes.,natural-language-processing\n2369,2020-09-25 15:44:08,GP-GAN: Towards Realistic High-Resolution Image Blending,Blending composite images using a generative model and a Gaussian-Poisson equation with a Laplacian Pyramid,computer-vision\n2371,2020-09-25 18:10:13,From Research to Production with Deep Semi-Supervised Learning,Semi-Supervised Learning (SSL) has blossomed in the deep learning research community — we share lessons learned over 15 months of taking SSL into production.,mlops\n2372,2020-09-25 18:39:59, A spaced repetition app for keeping your reinforcement learning,We aim to keep your reinforcement learning knowledge fresh by periodically reminding you of concepts making you a master of RL knowledge!!,other\n2373,2020-09-25 22:41:22,GraphNorm,A Principled Approach to Accelerating Graph Neural Network Training.,other\n2384,2020-09-27 08:42:46,Intro to Facebook Prophet,Everything you need to know when starting out with Facebook’s time series forecasting tool,other\n2387,2020-09-27 14:22:51,GitHub Actions for Machine Learning,This presentation discusses the use of GitHub Actions to automate certain steps of a toy ML project. ,mlops\n2388,2020-09-27 22:09:32,SemTorch,Different deep learning architectures definitions that can be applied to image segmentation.,computer-vision\n2389,2020-09-28 05:34:15,bingoset - CLI tool  to create image dataset.,CLI Toolkit to quickly create an image dataset using Bing Image Search API.,computer-vision\n2395,2020-09-28 22:51:23,Python caching in GitHub Actions,How to speed up slow Python builds in GitHub Actions with effective caching.,mlops\n2396,2020-09-29 00:36:12,EfficientDet meets Pytorch Lightning,Beginner friendly guide to object detection using EfficientDet.,computer-vision\n2397,2020-09-29 02:15:46,Optimizing MobileDet for Mobile Deployments,Learn about the criticalities of effectively optimizing MobileDet object detectors for mobile deployments.,computer-vision\n2402,2020-09-30 22:11:07,Adapting Text Augmentation to Industry Problems,\"In this post I will talk about the recent advances in exploiting language models for data generation and also show how, where we can implement them in Industry.\",natural-language-processing\n2404,2020-09-30 22:22:07,12 Factors of Reproducible Machine Learning in Production,We took our experience to deduce 12 factors (as a nod to the 12 factor app) that build the backbone of successful ML in production.,mlops\n2410,2020-10-01 13:42:23,Serving PyTorch models in production with the Amazon SageMaker,TorchServe is now natively supported in Amazon SageMaker as the default model server for PyTorch inference. ,mlops\n2411,2020-10-01 14:55:12,How to Make Sense of the Reinforcement Learning Agents?,What and Why I Log During Training and Debug?,other\n2412,2020-10-01 18:50:05,Introduction to 3D Medical Imaging: Preprocessing & Augmentations,\"Learn how to apply 3D transformations for medical image preprocessing and augmentation, to setup your awesome deep learning pipeline.\",computer-vision\n2415,2020-10-01 23:55:36,Explainable ML Monitoring,\"The video covers an overview of some of the risks of AI, the need for explainable monitoring, and what exactly we mean when we talk about it.\",mlops\n2417,2020-10-02 09:44:25,Parallelizing Prophet Cross-Validation with Dask,Applied Example w/ Code,other\n2418,2020-10-02 10:16:17,Top Research Papers from the ECML-PKDD 2020 Conference,ECML-PKDD -> selectionof the best reaesch papers,other\n2419,2020-10-02 15:37:27,GANs in Computer Vision Free Ebook / Article-series,This free ebook/article-series follows the chronological order of 20 peer-reviewed highly-cited papers as they presented in a series of 6 articles.,computer-vision\n2422,2020-10-02 21:48:21,Pattern-Exploiting Training (PET),\"This repository contains the code for \"\"Exploiting Cloze Questions for Few-Shot Text Classification and Natural Language Inference\"\"\",natural-language-processing\n2423,2020-10-03 20:27:36,Imaginaire,NVIDIA PyTorch GAN library with distributed and mixed precision support.,computer-vision\n2430,2020-10-05 10:09:28,Transection: Transformers for English to Chinese Translation 基于t,Tutorials on how to fine-tune a BART based transformer for English to Chinese translation.,natural-language-processing\n2431,2020-10-05 12:36:02,A Survey of the State of Explainable AI for NLP,Overview of the operations and explainability techniques currently available for generating explanations for NLP model predictions.,natural-language-processing\n2432,2020-10-05 13:09:58,Topic Modeling with BERT,Leveraging 🤗 Transformers and a class-based TF-IDF to create dense clusters allowing for easily interpretable topics. ,natural-language-processing\n2434,2020-10-06 02:13:01,OpenMMLab Computer Vision,\"MMCV is a python library for CV research and supports many research projects such as object detection, segmentation, pose estimation, action classification.\n\n\",computer-vision\n2436,2020-10-06 13:29:44,Machine Learning Methods Explained (+ Examples),Most common techniques used in data science projects; get to know them through easy-to-understand examples and put them into practice in your own ML projects!,other\n2437,2020-10-06 14:53:39,Rasoee,\"A powerful web and mobile application that identifies food dishes from a given input image, and provides an ingredient list along with relevant recipes.\",computer-vision\n"
  },
  {
    "path": "datasets/holdout.csv",
    "content": "id,created_on,title,description,tag\n19,2020-03-03 13:54:31,Diffusion to Vector,Reference implementation of Diffusion2Vec (Complenet 2018) built on Gensim and NetworkX. ,other\n26,2020-03-07 23:11:58,Graph Wavelet Neural Network,\"A PyTorch implementation of \"\"Graph Wavelet Neural Network\"\" (ICLR 2019) \",other\n44,2020-03-08 00:32:58,Capsule Graph Neural Network,\"A PyTorch implementation of \"\"Capsule Graph Neural Network\"\" (ICLR 2019).\",other\n80,2020-03-20 05:59:32,NeRF: Neural Radiance Fields,Representing scenes as neural radiance fields for view synthesis.,computer-vision\n84,2020-03-20 15:18:43,Mention Classifier,\"Category prediction model\nThis repo contains AllenNLP model for prediction of Named Entity categories by its mentions.\",natural-language-processing\n107,2020-03-21 23:09:03,Plant Fruit Classifier,Building a world-class image classifier model with a custom dataset.,computer-vision\n126,2020-03-25 15:05:27,Unet Implementation is Keras with GPU,Vector Map generation from aerial imagery using deep learning GeoSpatial UNET,computer-vision\n130,2020-03-25 16:55:31,Gymnast Pose Analysis,\"Pose modelling for gymnasts using open-pose and open-cv.\n\",computer-vision\n131,2020-03-25 17:00:54,EfficientDet: Scalable and Efficient Object Detection,Implementation EfficientDet: Scalable and Efficient Object Detection in PyTorch.,computer-vision\n136,2020-03-26 17:22:36,Finetune: Scikit-learn Style Model Finetuning for NLP,Finetune is a library that allows users to leverage state-of-the-art pretrained NLP models for a wide variety of downstream tasks.,natural-language-processing\n141,2020-03-28 17:41:42,First Order Motion Model for Image Animation,Generating a video sequence so that an object in a source image is animated according to the motion of a driving video.,computer-vision\n142,2020-03-28 17:49:20,TorchIO:  Medical Image Processing in Deep Learning and PyTorch,Tools for medical image processing in deep learning and PyTorch,computer-vision\n144,2020-03-29 18:23:06,Finetuning Transformers with JAX + Haiku,\"Walking through a port of the RoBERTa pre-trained model to JAX + Haiku, then fine-tuning the model to solve a downstream task.\",natural-language-processing\n218,2020-04-06 11:29:57,Distributional RL using TensorFlow2,🐳 Implementation of various Distributional Reinforcement Learning Algorithms using TensorFlow2.,other\n220,2020-04-06 15:19:59,Module 2: Convolutional Neural Networks - CS231n ,In Lecture 5 we move from fully-connected neural networks to convolutional neural networks.,computer-vision\n249,2020-04-06 19:20:12,makesense.ai,Free to use online tool for labelling photos.,computer-vision\n264,2020-04-06 21:33:32,The Unreasonable Effectiveness of Recurrent Neural Networks,A close look at how RNNs are able to perform so well.,natural-language-processing\n268,2020-04-06 21:51:55,A Gentle Introduction to Text Summarization in Machine Learning,Text summarization is the technique for generating a concise and precise summary of voluminous texts while focusing on the sections that convey useful info.,natural-language-processing\n285,2020-04-07 03:45:03,A (Long) Peek into Reinforcement Learning,\"In this post, we are gonna briefly go over the field of Reinforcement Learning (RL), from fundamental concepts to classic algorithms.\",other\n305,2020-04-07 20:00:37,Question Answering with a Fine-Tuned BERT,What does it mean for BERT to achieve “human-level performance on Question Answering”?,natural-language-processing\n314,2020-04-08 00:06:21,The Autonomous Learning Library,A PyTorch library for building deep reinforcement learning agents.,other\n317,2020-04-08 00:14:27,COCO Annotator,\"✏️ Web-based image segmentation tool for object detection, localization and key points.\",computer-vision\n328,2020-04-08 14:29:22,ProteinGCN: Protein model quality assessment using GCNs,Source code for the paper: ProteinGCN: Protein model quality assessment using Graph Convolutional Networks.,other\n344,2020-04-08 16:11:28,Tokenizers,💥Fast State-of-the-Art Tokenizers optimized for Research and Production.,natural-language-processing\n353,2020-04-08 17:08:41,Keras OCR,A packaged and flexible version of the CRAFT text detector and Keras CRNN recognition model. ,computer-vision\n384,2020-04-08 21:22:25,Visualizing Memorization in RNNs,Inspecting gradient magnitudes in context can be a powerful tool to see when recurrent units use short-term or long-term contextual understanding.,natural-language-processing\n407,2020-04-08 23:00:02,AllenNLP,\"An open-source NLP research library, built on PyTorch.\",natural-language-processing\n410,2020-04-08 23:09:15,Frameworks for Machine Learning Model Management,This blog post will follow up by comparing three different tools developed to support reproducible machine learning model development.,mlops\n414,2020-04-08 23:18:04,TensorBoard.dev ,\"Easily host, track, and share your ML experiments for free.\",mlops\n415,2020-04-08 23:21:13,BertViz,\"Tool for visualizing attention in the Transformer model (BERT, GPT-2, Albert, XLNet, RoBERTa, CTRL, etc.)\",natural-language-processing\n426,2020-04-09 16:37:10,The Transformer Family,\"This post presents how the vanilla Transformer can be improved for longer-term attention span, less memory and computation consumption, RL task solving, etc.\",natural-language-processing\n437,2020-04-10 17:14:11,Pruning Bert to Accelerate Inference,\"After previously discussing various ways of accelerating models like BERT, in this blog post we empirically evaluate the pruning approach.\",natural-language-processing\n438,2020-04-10 17:26:39,Compressing Bert for Faster Prediction,\"In this blog post, we discuss ways to make huge models like BERT smaller and faster. \",natural-language-processing\n451,2020-04-10 20:10:28,Evaluation Metrics for Language Modeling,\"In this article, we will focus on traditional intrinsic metrics that are extremely useful during the process of training the language model itself. \",natural-language-processing\n454,2020-04-10 20:27:12,All The Ways You Can Compress BERT,In this post I’ll list and briefly taxonomize all the papers I’ve seen compressing BERT. ,natural-language-processing\n458,2020-04-10 20:58:41,\"Limitations of Deep Learning for Vision, and How We Might Fix The\",This is an opinion paper about the strengths and weaknesses of Deep Nets for vision.,computer-vision\n487,2020-04-14 21:15:35,Face Alignment in Full Pose Range: A 3D Total Solution,Face Alignment in Full Pose Range: A 3D Total Solution.,computer-vision\n488,2020-04-14 21:21:51,V2V-PoseNet Pytorch,PyTorch implementation of V2V-PoseNet with IntegralPose/PoseFix loss.,computer-vision\n496,2020-04-14 23:14:59,Fast- Neural Style,Pytorch implementation of an algorithm for artistic style transfer. ,computer-vision\n497,2020-04-14 23:21:16,Torchvision Object Detection Finetuning Tutorial,Finetuning a pre-trained Mask R-CNN model in the Penn-Fudan Database for Pedestrian Detection and Segmentation.,computer-vision\n559,2020-04-16 16:18:26,Creating an End-to-End Machine Learning Application,\"A complete, end-to-end ML application, implemented in both TensorFlow 2.0 and PyTorch.\",mlops\n561,2020-04-16 16:27:31,How Docker Can Help You Become A More Effective Data Scientist,A look at Docker from the perspective of a data scientist.,mlops\n569,2020-04-18 13:32:36,An Introduction to Transfer Learning and HuggingFace,In this talk I'll start by introducing the recent breakthroughs in NLP that resulted from the combination of Transfer Learning schemes and Transformer architect,natural-language-processing\n570,2020-04-19 17:40:48,Introduction to Image Inpainting With Deep Learning,\"In this article, we are going to learn how to do “image inpainting”, i.e. fill in missing parts of images precisely using deep learning.\",computer-vision\n579,2020-04-20 00:53:19,Transfer Learning & Fine-Tuning With Keras,Your 100% up-to-date guide to transfer learning & fine-tuning with Keras.,computer-vision\n582,2020-04-20 21:38:50,CS285: Deep Reinforcement Learning,\"A course on deep reinforcement learning, transfer and multi-task learning.\",other\n594,2020-04-21 23:25:53,TorchServe & TorchElastic PyTorch Libraries for Serving/Training,The officially supported way to deploy and manage models with PyTorch.,mlops\n600,2020-04-22 17:37:25,Building a Simple Chatbot from Scratch in Python (using NLTK),A look at retrieval based and generative conversational AI for creating chatbots.,natural-language-processing\n612,2020-04-23 13:56:46,Implementing DCGANs using PyTorch C++ API (Libtorch),\"The blog discusses the paper review of DCGANs and implementation using PyTorch C++ API in detail. From loading models to visualizing batch of the data, in C++! \",computer-vision\n620,2020-04-23 17:26:26,ELECTRA ,\"Explaining the new self-supervised task for language representation learning, ELECTRA which uses \"\"replace token detection\"\".\",natural-language-processing\n624,2020-04-24 00:42:41,How to Train a New Language Model From Scratch Using Transformers,\"In this post we’ll demo how to train a “small” model (84 M parameters = 6 layers, 768 hidden size, 12 attention heads).\",natural-language-processing\n629,2020-04-24 05:01:26,ARIMA Modeling - Guide to Time Series Forecasting in Python,\"How ARIMA models works . How to train and forecast using ARIMA, SARIMA, SARIMAX and find the optimal model with Python\",other\n649,2020-04-28 03:42:29,Spektral,Graph Neural Networks with Keras and Tensorflow 2.,other\n666,2020-04-29 12:10:43,AIDeveloper,\"GUI-based software for training, evaluating and applying deep neural nets for image classification \",computer-vision\n671,2020-04-29 23:22:43,MedCAT - Medical Concept Annotation Tool,A tool used to extract information from Electronic Health Records (EHRs) and link it to biomedical ontologies like SNOMED-CT and UMLS.,natural-language-processing\n681,2020-05-01 16:25:34,The AI Economist,Improving Equality and Productivity with AI-Driven Tax Policies,other\n684,2020-05-01 16:48:19,WT5?! Training Text-to-Text Models to Explain their Predictions,We leverage the text-to-text framework proposed by Raffel et al.(2019) to train language models to output a natural text explanation alongside their prediction.,natural-language-processing\n689,2020-05-01 17:51:53,Ensemble Forecasts ,\"Time series forecasting using classical methods (ETS, Holt-Winter's, SARIMA) and Prophet. I show and discuss advantages of Ensemble Forecast\",other\n703,2020-05-04 05:09:59,Implementing Graph Neural Networks with JAX,I’ll talk about my experience on how to build and train Graph Neural Networks (GNNs) with JAX.,other\n705,2020-05-04 14:13:13,Deep Learning With Graph-Structured Representations,Novel approaches based on the theme of structuring the representations and computations of neural network-based models in the form of a graph.,other\n706,2020-05-04 14:18:58,GNNExplainer: Generating Explanations for Graph Neural Networks,General tool for explaining predictions made by graph neural networks (GNNs).,other\n710,2020-05-05 04:01:24,Differential Subspace Search in High-Dimensional Latent Space,\"Differential subspace search to allow efficient iterative user exploration in such a space, without relying on domain- or data-specific assumptions.\",computer-vision\n723,2020-05-05 19:45:50,DeepWay: Autonomous navigation for blind.,I have tried to make something which can be used by blind people to navigate around the streets. Have a look at the video and GitHub repo for details.,computer-vision\n737,2020-05-06 18:06:04,Nature-Scene Classification using FASTAI,Classifying Nature-scene images using deep learning  with fastai library,computer-vision\n738,2020-05-06 20:33:00,Machine-Learning-Single-Layer-Multiclass-Perceptron,Implemented a Single Layer Perceptron and applied it on the MNIST dataset for multi-class classification using NumPy.,computer-vision\n780,2020-05-08 12:06:30,Med7 - clinical natural language processing for EHR,\"Med7 is a transferable clinical natural language processing model for electronic health records, compatible with spaCy, for named-entity recognition task\",natural-language-processing\n784,2020-05-08 14:59:08,Haystack — Neural Question Answering At Scale,Scaling Question Answering models to find answers in large document stores via retriever and reader approach.,natural-language-processing\n785,2020-05-08 17:13:36,SimCLR in TensorFlow 2,(Minimally) implements SimCLR (https://arxiv.org/abs/2002.05709) in TensorFlow 2.,computer-vision\n787,2020-05-08 18:15:56,Semantic Cord19 Paper Explorer,Semantic research paper explorer to search Research Papers in COVID and CoronaVirus. Can be easily modified to any Research Paper Database,natural-language-processing\n807,2020-05-11 02:25:51,Introduction to Machine Learning Problem Framing,This course helps you frame machine learning (ML) problems.,mlops\n834,2020-05-13 04:36:33,TailorGAN: Making User-Defined Fashion Designs,Generate a photo-realistic image which combines the texture from reference A and the new attribute from reference B.,computer-vision\n843,2020-05-13 14:49:21,T5 fine-tuning,A colab notebook to showcase how to fine-tune T5 model on various NLP tasks (especially non text-2-text tasks with text-2-text approach),natural-language-processing\n854,2020-05-14 12:05:20,ASAP: Pooling for Graph Neural Network (AAAI 2020),ASAP is a sparse and differentiable pooling method that addresses the limitations of previous graph pooling layers.,other\n878,2020-05-16 05:27:56,Exploratory Data Analysis on MS COCO Style Datasets,A Simple Toolkit to do exploratory data analysis on MS COCO style formatted datasets.,computer-vision\n898,2020-05-17 05:11:22,Single-Stage Semantic Segmentation from Image Labels,\"We attain competitive results by training a single network model\nfor segmentation in a self-supervised fashion using only\nimage-level annotations\",computer-vision\n906,2020-05-18 14:50:45,NLPAug,Data augmentation for NLP,natural-language-processing\n916,2020-05-19 08:11:05,Get Subreddit Suggestions for a Post,\"Trained on 4M Reddit posts from 4k Subreddits. End-to-end ML pipeline built with fasttext and FastAPI, deployed to Valohai.\",natural-language-processing\n917,2020-05-19 13:45:03,Transfer Learning In NLP,A brief history of Transfer Learning In NLP,natural-language-processing\n919,2020-05-20 02:29:48,IntelliCode Compose: Code Generation Using Transformer,\"Code completion tool which is capable of predicting sequences of code tokens of arbitrary types, generating up to entire lines of syntactically correct code.\",natural-language-processing\n943,2020-05-22 06:27:43,Transfer Learning in NLP with Tensorflow Hub and Keras,Learn how to integrate and finetune tensorflow-hub modules in Tensorflow 2.0,natural-language-processing\n946,2020-05-22 07:57:14,Replicating Airbnb's Amenity Detection (documentary series),Airbnb's engineering team shared an article on how they used computer vision to detection amenities in photos. It read like a recipe so I replicated it.,computer-vision\n965,2020-05-24 08:14:30,GANs in Computer Vision : An article review series ,\"An article series where we review the most important research papers on GANs from 2015 to today.  6 articles,  20 papers, 20000 words\",computer-vision\n991,2020-05-27 05:09:20,NLP Viewer 🤗,A simple website for browsing popular NLP datasets.,natural-language-processing\n999,2020-05-28 03:32:05,MediaPipe,\"Simplest way for researchers and developers to build world-class ML solutions and applications for mobile, edge, cloud and the web. \",computer-vision\n1011,2020-05-29 02:57:44,ML in Production - Deployment Series,\"A multi-part blog series on deploying machine learning models in an automated, reproducible, and auditable manner.\",mlops\n1019,2020-05-29 08:14:05,Visual Object Tracking using Adaptive Correlation Filters,This article gives step by step tutorial with code on understanding MOSSE tracking algorithm,computer-vision\n1032,2020-05-29 14:50:28,Pix2Pix with Tf-js,\"Implementation of web friendly ML models using TensorFlow.js. pix2pix, face segmentation, fast style transfer and many more ...\",computer-vision\n1056,2020-05-30 09:08:31,Font Recognition Using Deep Learning - DeepFont ( Adobe ),DeepFont Paper is a technique created by Adobe.Inc to detect font from images using deep learning . They published their work as a paper for the public .,computer-vision\n1078,2020-05-31 05:04:44,Building Footprint Extraction,The project retrieves satellite imagery from Google and performs building footprint extraction using a U-Net. ,computer-vision\n1114,2020-06-01 21:00:24,Reinforcement Learning in JAX,\"Implementation of interesting Deep Reinforcement Learning Algorithms using JAX based libraries (flax, haiku and rlax) As of now tasks come from OpenAI gym\",other\n1155,2020-06-03 15:22:11,GaborNet,Modified network architecture that focuses on improving convergence and reducing training complexity.,computer-vision\n1159,2020-06-03 18:17:01,Learning To Classify Images Without Labels,A two-step approach where feature learning and clustering are decoupled.,computer-vision\n1167,2020-06-04 03:58:21,From Pre-trained Word Embeddings to Pre-trained Language Models,from Static Word Embedding to Dynamic (Contextualized) Word Embedding.,natural-language-processing\n1172,2020-06-04 07:01:13,Converting images to TF Records,A Colab Notebook showing how to convert an image dataset (for classification) to TF Records and more.,computer-vision\n1266,2020-06-09 16:09:08,Text Classification using Bert from Tensorflow-Hub,This Tutorial helps to learn about Bert Models for Classification  task on a #Tweet dataset.,natural-language-processing\n1286,2020-06-10 17:24:19,Exploring Knowledge Captured in Probability of Strings,An exploration of simple knowledge captured by language models with code examples,natural-language-processing\n1363,2020-06-13 13:46:44,Short Notes on Batch Constrained Deep Reinforcement Learning,Blog article on Off-Policy Deep Reinforcement Learning without Exploration paper by Fujimoto et al. (ICML 2019),other\n1426,2020-06-15 02:34:27,From GRU to Transformer,How recurrent units and self-attention are related to each other.,natural-language-processing\n1430,2020-06-15 04:24:12,Melanoma Classification,This was Shubhamai 3-week project for working a new kaggle competition and deploying a web application to predicting benign or malignant based on images.,computer-vision\n1434,2020-06-15 07:52:13,Universal Sentence Encoder Visually Explained,A deep-dive into how Universal Sentence Encoder learns to generate fixed-length sentence embeddings,natural-language-processing\n1445,2020-06-15 17:49:16,Image Smoothing via L0 Gradient Minimization,This is a edge-aware image smoothing algorithm. This algorithm tries to smoothen the image while preserving the global structural information of the image. ,computer-vision\n1450,2020-06-15 21:00:47,BERT NLP — How To Build a Question Answering Bot,Understanding the intuition with hands-on PyTorch code for BERT fine-tuned on SQuAD.,natural-language-processing\n1451,2020-06-16 01:21:09,EfficientDet (PyTorch),A PyTorch implementation of EfficientDet faithful to the original Google implementation with ported weights.,computer-vision\n1459,2020-06-16 03:06:10,SuperGlue: Learning Feature Matching with Graph Neural Networks,\"SuperGlue, a neural network that matches two sets of local features by jointly finding correspondences and rejecting non-matchable points.\",other\n1462,2020-06-16 03:28:40,Open Compound Domain Adaptation,\"Pytorch implementation for \"\"Open Compound Domain Adaptation\"\"\",computer-vision\n1485,2020-06-17 16:33:50,Sudoku-Game-Solver,This is a Computer Vision Application that solves a 9x9 sudoku board game using Deep Learning and Backtracking algorithm.,computer-vision\n1488,2020-06-17 19:27:36,Smart Picture Editor,Tool to automatically remove unwanted objects from photos,computer-vision\n1494,2020-06-18 00:14:40,Object Goal Navigation using Goal-oriented Semantic Exploration,Embodied interactive learning for object detection by using semantic curiosity to learn an exploration policy on set of the training environments.,computer-vision\n1501,2020-06-18 18:17:18,Traffic-Sign-Recognition-Using-Deep-Learning,\"The training dataset contains around 39,000 images while test dataset contains around 12,000 images containing 43 different classes. We will be using Convolutio\",computer-vision\n1508,2020-06-19 06:43:47,Long Form Question Answering with ELI5,A model for open domain long form question answering.,natural-language-processing\n1511,2020-06-19 06:54:23,RepNet - Class Agnostic Video Repetition Counting in the Wild,Counting Out Time: Class Agnostic Video Repetition Counting in the Wild,computer-vision\n1515,2020-06-19 16:37:10,\"Cut, Paste and Learn: Surprisingly Easy Synthesis for Detection\",Generate synthetic scenes and bounding box annotations for object detection.,computer-vision\n1524,2020-06-20 10:42:25,Machine Learning Projects ,\"This Repo contains projects done by me while learning the basics. All the familiar types of regression, classification, and clustering methods have been used.\",natural-language-processing\n1540,2020-06-21 13:03:19,codeBERT - Masked Language Model for source code ,Tutorial to use codeBERT a MLM for Python code. Model trained from scratch using roBERTa,natural-language-processing\n1588,2020-06-24 03:29:51,Multi-task Training with Hugging Face Transformers and NLP, A recipe for multi-task training with Transformers' Trainer and NLP datasets.,natural-language-processing\n1600,2020-06-25 00:45:26,BERT Distillation with Catalyst,How to distill BERT with Catalyst.,natural-language-processing\n1628,2020-06-28 06:12:20,Deep Reinforcement Learning Amidst Lifelong Non-Stationarity,\"How can robots learn in changing, open-world environments? We introduce dynamic-parameter MDPs, to capture environments with persistent, unobserved changes. \",other\n1654,2020-06-30 03:58:46,3D Detection and Domain Adaptation,1st Place Solution for Waymo Open Dataset Challenge,computer-vision\n1659,2020-07-01 02:26:20,Evaluation of Text Generation: A Survey,Evaluation methods of natural language generation (NLG) and language modeling.,natural-language-processing\n1661,2020-07-01 06:42:59,SpineNet: A Novel Architecture for Object Detection,\"A meta architecture called a scale-permuted model that enables two major improvements on backbone architecture design,iscovered with neural architecture search.\",computer-vision\n1665,2020-07-01 07:17:48,BERTology Meets Biology,Interpreting Attention in Protein Language Models.,natural-language-processing\n1681,2020-07-03 04:02:52,A Survey on Deep Learning for Localization and Mapping,Towards the Age of Spatial Machine Intelligence,computer-vision\n1685,2020-07-03 04:12:28,Text Data Cleanup - Dynamic Embedding Visualisation,Identify noisy text in a Machine Translation dataset through dynamic text embedding visualisation.,natural-language-processing\n1689,2020-07-03 04:29:04,Offline Reinforcement Learning,\"Challenges, algorithms and benchmarks.\",other\n1692,2020-07-03 04:42:45,Low-Dimensional Hyperbolic Knowledge Graph Embeddings,Low-dimensional knowledge graph embeddings that simultaneously capture hierarchical relations and logical patterns.,other\n1703,2020-07-04 09:22:50,Awesome Deep RL,This project is built for people who are learning and researching on the latest deep reinforcement learning methods.,other\n1709,2020-07-05 05:25:34,Anti-Patterns in NLP (8 types of NLP idiots),A talk which discusses the recurring industrial problems in making NLP solutions. ,natural-language-processing\n1715,2020-07-06 18:25:16,Image Classifier,Pure JavaScript Image Classifier,computer-vision\n1717,2020-07-07 04:09:35,TaBERT,Pretraining for Joint Understanding of Textual and Tabular Data,natural-language-processing\n1719,2020-07-07 04:17:11,Texthero,\"Text preprocessing, representation and visualization from zero to hero.\",natural-language-processing\n1743,2020-07-09 01:51:41,How to Benchmark Models with Transformers,HuggingFace's Transformer library allows users to benchmark models for both TensorFlow 2 and PyTorch using the PyTorchBenchmark and TensorFlowBenchmark classes.,natural-language-processing\n1756,2020-07-10 02:53:13,Linear Attention Transformer,A fully featured Transformer that mixes (QKᵀ)V local attention with Q(KᵀV) global attention (scales linearly with respect to sequence length).,natural-language-processing\n1770,2020-07-11 05:12:49,imgaug,\"Image augmentation for machine learning experiments.\n\n\",computer-vision\n1779,2020-07-11 05:48:03,All Models and checkpoints - Hugging Face,\"Massive (and growing) collection of NLP models are nearly any NLP tasks, especially those involving the use of transformers.\",natural-language-processing\n1799,2020-07-11 06:49:38,FlashText,\"Extract Keywords from sentence or Replace keywords in sentences.\n\n\",natural-language-processing\n1804,2020-07-11 07:04:25,Text Preprocessing in Python using spaCy library,\"In this article, we have explored Text Preprocessing in Python using spaCy library in detail. This is the fundamental step to prepare data for applications.\",natural-language-processing\n1805,2020-07-11 07:12:32,Segmentation Models,\"Segmentation models with pretrained backbones. Keras and TensorFlow Keras.\n\n\",computer-vision\n1825,2020-07-11 08:43:20,MLflow: A Machine Learning Lifecycle Platform,Open source platform for the machine learning lifecycle.,mlops\n1827,2020-07-11 08:56:02,token2index,\"A lightweight but powerful library to build token indices for NLP tasks, compatible with major Deep Learning frameworks like PyTorch and Tensorflow.\",natural-language-processing\n1853,2020-07-13 20:23:32,The Transformer Neural Network Architecture Explained,\"⚙️ It is time to explain how Transformers work. If you are looking for an easy explanation, you are exactly right!\",natural-language-processing\n1858,2020-07-14 03:30:14,QSVM,Quantum SVM for sentiment analysis,natural-language-processing\n1866,2020-07-14 22:58:15,PYthon Automated Term Extraction,\"Term extraction algorithms such as C-Value, Basic, Combo Basic, Weirdness and Term Extractor using spaCy POS tagging.\",natural-language-processing\n1870,2020-07-15 20:38:36,Interpretability and Analysis of Models for NLP,An in-depth look at interpretability and analysis of models for NLP (ACL 2020).,natural-language-processing\n1888,2020-07-17 16:53:37,Monitoring Machine Learning Models in Production,Once you have deployed your machine learning model to production it rapidly becomes apparent that the work is not over.,mlops\n1901,2020-07-19 08:31:43,Quora Question Pair Similarity,\"Identify which questions asked on Quora are duplicates of questions that have already been asked. Using Text features, classifying them as duplicates or not.\n\n\",natural-language-processing\n1905,2020-07-19 14:51:57,PyTorch CNN Trainer,A simple package to fine-tune CNNs from torchvision and Pytorch Image models by Ross Wightman.,computer-vision\n1934,2020-07-21 01:47:01,Graphein,Protein Graph Library,other\n1935,2020-07-21 04:44:52,Integrated Gradients in TensorFlow 2,\"In this tutorial, you will walk through an implementation of IG step-by-step in TensorFlow 2 to understand the pixel feature importances of an image classifier.\",computer-vision\n1950,2020-07-23 00:42:09,GPT-3: A Hitchhiker's Guide,Post to guide your thinking on GPT-3.,natural-language-processing\n1959,2020-07-24 10:00:13,TeachEasy: Web app for Text Summarization & Q/A generation,An intuitive Streamlit based web app for Text Summarization and Question Answer generation so as to reduce the work for School teachers.,natural-language-processing\n1961,2020-07-24 10:38:52,Python Template for All Projects,\"A template that gives the batteries required to package code, CI checks, auto build and deploy docs, easy PyPi publishing support and docker files.\",mlops\n1964,2020-07-25 02:52:36,MLOps Tutorial Series,How to create an automatic model training & testing setup using GitHub Actions and Continuous Machine Learning (CML).,mlops\n1972,2020-07-27 02:54:19,Evolution of Representations in the Transformer,\"The evolution of representations of individual tokens in Transformers trained with different training objectives (MT, LM, MLM - BERT-style).\",natural-language-processing\n1975,2020-07-27 14:09:26,Ensemble methods for object detection,\"In this repository, we provide the code for ensembling the output of object detection models, and applying test-time augmentation for object detection. This lib\",computer-vision\n1976,2020-07-27 14:12:03,Close-Domain fine-tuning for table detection,\"In this project, we show the benefits of using models trained on a close domain, using the TableBank dataset, for fine-tuning table detection models. In additio\",computer-vision\n1997,2020-07-29 16:13:46,Image Classification by @carrycooldude,Image Classification using TFLite and ImageNet  by  @carrycooldude,computer-vision\n2007,2020-07-30 14:47:39,CLoDSA: A Tool for Augmentation in Computer Vision tasks,\"CLoDSA is an open-source image augmentation library for object classification, localization, detection, semantic segmentation and instance segmentation. It supp\",computer-vision\n2010,2020-07-30 15:00:43,FrImCla: A framework for image classification,\"\nFrImCla is an open-source framework for Image Classification using traditional and deep learning techniques. It supports a wide variety of deep learning and c\",computer-vision\n2011,2020-07-30 15:02:04,UFOD: A Unified Framework for Object Detection,UFOD is an open-source framework that enables the training and comparison of object detection models on custom datasets using different underlying frameworks an,computer-vision\n2023,2020-08-01 14:46:19,Why You Should Do NLP Beyond English,7000+ languages are spoken around the world but NLP research has mostly focused on English. This post outlines why you should work on languages other than Eng.,natural-language-processing\n2025,2020-08-01 14:57:11,Haystack — Neural Question Answering At Scale,\"🔍 Transformers at scale for question answering & search\n\n\",natural-language-processing\n2034,2020-08-03 04:00:29,Finding Similar Documents with Transformers,How transformers can help us distill text documents into points in N-dimensional vector spaces.,natural-language-processing\n2040,2020-08-04 18:00:56,A Barebones Image Retrieval System,This project presents a simple framework to retrieve images similar to a query image.,computer-vision\n2056,2020-08-06 00:30:49,Fast Sentence Embeddings (fse),Fast Sentence Embeddings is a Python library that serves as an addition to Gensim.,natural-language-processing\n2131,2020-08-13 01:39:01,How to Trust Your Deep Learning Code,\"We will focus on how to write reusable unit tests, so that you “Don’t repeat yourself”.\",mlops\n2137,2020-08-13 02:10:03,Unpopular Opinion - Data Scientists Should Be More End-to-End,I believe data scientists can be more effective by being end-to-end.,mlops\n2172,2020-08-18 04:12:18,Compression of Deep Learning Models for Text: A Survey,\"In this survey, we discuss six different types of methods for compression of such models to enable their deployment in real industry NLP projects.\",natural-language-processing\n2186,2020-08-18 23:24:41,AI in Medicine and Imaging - Stanford Symposium 2020,Through the AIMI Symposium we hope to address gaps and barriers in the field and catalyze more evidence-based solutions to improve health for all.,computer-vision\n2195,2020-08-20 20:45:52,Streamlit Terran Timeline,A face-recognition timeline generator tool for any kind of video!,computer-vision\n2199,2020-08-21 08:37:20,How to Set Up Continuous Integration for Machine Learning,How to Set Up Continuous Integration for Machine Learning with Github Actions and Neptune: Step by Step Guide.,mlops\n2200,2020-08-21 12:45:54,Bad passwords and the NIST guidelines,\"Example project provided by DataCamp. In this project, you will write code that  automatically detects and flags the bad passwords.\",natural-language-processing\n2232,2020-08-27 11:00:34,GenRL,GenRL is a PyTorch-First Reinforcement Learning library centered around reproducible and generalizable algorithm implementations.,other\n2246,2020-08-30 06:05:21,Questgen- An NLP library for state-of-the-art Question Generation,\"Questgen AI is an opensource, easy to use NLP library for Question generation. It can generate MCQs, Boolean (Yes/No), FAQs and also paraphrase any question.\n\",natural-language-processing\n2250,2020-08-31 09:20:55,Text Data Augmentation with MarianMT,Learn how to use machine translation models in Hugging Face Transformers for data augmentation.,natural-language-processing\n2262,2020-09-03 12:10:24,R.U.Stoked,NLP (Sentiment Analysis) project to demonstrate a pipeline of data from the very first stage of data collection through ML model deployment.,natural-language-processing\n2266,2020-09-04 01:42:26,Wav2Lip: Accurately Lip-syncing Videos In The Wild,A Lip Sync Expert Is All You Need for Speech to Lip Generation In the Wild,computer-vision\n2271,2020-09-05 07:10:06,Latest advancements in video streaming with AI,\"AI developments in video streaming using Super-resolution, Per-title encoding, P2P\",computer-vision\n2289,2020-09-08 04:12:41,ElasticTransformers,Making BERT stretchy. Semantic Elasticsearch with Sentence Transformers.,natural-language-processing\n2310,2020-09-12 12:33:20,Image Super-Resolution,In this project we learn how to train a super-resolution model ESPCN on DIV2K dataset to upscale images using AI by 3x,computer-vision\n2312,2020-09-12 22:33:56,Codequestion,Ask coding questions directly from the terminal.,natural-language-processing\n2336,2020-09-19 08:40:37,G-SimCLR,TensorFlow implementation of G-SimCLR. ,computer-vision\n2339,2020-09-19 11:17:48,Neural CDEs for Long Time-Series via the Log-ODE Method,NCDEs for Long Time-Series via the Log-ODE Method.,other\n2350,2020-09-22 03:07:29,\"Part 1: Deep Representations, a way towards neural style transfer\",A top down approach to conceiving neural style transfer,computer-vision\n2366,2020-09-25 02:26:00,Help-Me-Read: Text Summarization using Flask and HuggingFace.,\"Text summarization, translation and Questions Answers generation using HuggingFace and deployed using Flask, Streamlit. Detailed guide on github. \",natural-language-processing\n2367,2020-09-25 07:39:43,Interactive Analysis of Sentence Embeddings,Learn how to interactively explore sentence embedding and labels in Tensorflow Embedding Projector.,natural-language-processing\n2390,2020-09-28 05:46:03,mini-pokedex end to end tutorial  -  Gotta classify 'em all!,\"Build a Pokemon image classifier to classify the awesome starters Pikachu, Charmander, Squirtle, and Bulbasaur.\",computer-vision\n2394,2020-09-28 22:46:36,Why Data Quality is Key to Successful ML Ops,A look at ML Ops and highlight how and why data quality is key to ML Ops workflows.,mlops\n2403,2020-09-30 22:15:07,Easy Data Augmentation (EDA),Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks,natural-language-processing\n2413,2020-10-01 23:50:04,Keeping Data Pipelines healthy w/ Great Expectations GH Actions,\"We show you how you can use GitHub Actions together with the open source project Great Expectations to automatically test, document, and profile data pipelines.\",mlops\n2428,2020-10-05 02:09:23,Efficient Transformers: A Survey,\"Characterizes a large and thoughtful selection of recent efficiency-flavored \"\"X-former\"\" models.\",natural-language-processing\n2429,2020-10-05 02:16:34,Meta-learning for Few-shot Natural Language Processing: A Survey,\"Clear definitions, progress summary and some common datasets of applying meta-learning to few-shot NLP.\",natural-language-processing\n"
  },
  {
    "path": "datasets/projects.csv",
    "content": "id,created_on,title,description\n6,2020-02-20 06:43:18,Comparison between YOLO and RCNN on real world videos,Bringing theory to experiment is cool. We can easily train models in colab and find the results in minutes.\n7,2020-02-20 06:47:21,\"Show, Infer & Tell: Contextual Inference for Creative Captioning\",\"The beauty of the work lies in the way it architects the fundamental idea that humans look at the overall image and then individual pieces of it.\r\n\"\n9,2020-02-24 16:24:45,Awesome Graph Classification,\"A collection of important graph embedding, classification and representation learning papers with implementations.\"\n15,2020-02-28 23:55:26,Awesome Monte Carlo Tree Search,A curated list of Monte Carlo tree search papers with implementations.\n25,2020-03-07 23:04:31,AttentionWalk,\"A PyTorch Implementation of \"\"Watch Your Step: Learning Node Embeddings via Graph Attention\"\" (NeurIPS 2018). \"\n27,2020-03-07 23:18:15,APPNP and PPNP,\"A PyTorch implementation of \"\"Predict then Propagate: Graph Neural Networks meet Personalized PageRank\"\" (ICLR 2019). \"\n28,2020-03-07 23:23:46,Attributed Social Network Embedding,\"A sparsity aware and memory efficient implementation of \"\"Attributed Social Network Embedding\"\" (TKDE 2018). \"\n29,2020-03-07 23:45:38,Signed Graph Convolutional Network,\"A PyTorch implementation of \"\"Signed Graph Convolutional Network\"\" (ICDM 2018). \"\n45,2020-03-08 00:39:08,SimGNN,\"A PyTorch implementation of \"\"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation\"\" (WSDM 2019). \"\n61,2020-03-16 17:35:22,Using JAX to Improve Separable Image Filters,Optimizing the filters to improve the filtered images for computer vision tasks.\n65,2020-03-19 18:42:05,Coloring Greyscale Images,Coloring black and white images with neural networks.\n67,2020-03-19 19:04:43,Fruit Detection using Convolution Neural Networks in TensorFlow,\"Trained a Convolutional Neural Network Model to predict fruits of over 100+ Classes (types) with a training accuracy of over 95%, and testing accuracy of over 9\"\n73,2020-03-19 23:45:14,Face Verification,Implementation of Siamese Neural network model used for face verification. The dataset used for this task is IMDB-WIKI-face images Dataset.\n77,2020-03-20 03:23:27,Sign Language Interpreter using Deep Learning,\"A sign language interpreter using live video feed from the camera. The project was completed in 24 hours as part of HackUNT-19, the University of North Texas's \"\n78,2020-03-20 03:32:09,The Illustrated Self-Supervised Learning,A visual introduction to self-supervised learning methods in Computer Vision\n81,2020-03-20 06:07:56,GradCAM for the BreaKHis Dataset,An NBDev package for fine-tuning ResNets to visualize gradient-weighted class activation for the BreaKHis dataset.\n85,2020-03-20 17:35:59,Message Passing GNNs C++,C++ implementation using Eigen for the forward pass of Graph Convolutional Neural Networks.\n89,2020-03-20 18:17:31,Rethinking Batch Normalization in Transformers,\"We found that NLP batch statistics exhibit large variance throughout training, which leads to poor BN performance.\"\n91,2020-03-20 18:30:04,Pytest Board,Continuous pytest runner with awesome visualization.\n92,2020-03-20 18:43:50,Image Spam Buster - Kreate Hackathon,\"\"\"Spam Buster\"\" for user generated IMAGE content.\"\n98,2020-03-20 19:16:43,Bachelorette Predictor,Predict the Bachelorette winners from profile images.\n99,2020-03-20 21:32:14,Gender Change of People's Face using CycleGAN,CycleGAN architecture in Keras and train the model with CelebA faces dataset to perform gender change on people's faces.\n101,2020-03-21 04:19:04,ELECTRA: Pre-training Text Encoders as Discriminators,PyTorch implementation of the electra model from the paper: ELECTRA - Pre-training Text Encoders as Discriminators Rather Than Generators\n108,2020-03-21 23:17:38,Tuned ALBERT (ensemble model),Top 6 in Squad 2.0\n109,2020-03-21 23:25:33,iyasai: Book Recommendation System,Recommender system for books and stories that could help you and your loved ones lift up your mood whenever you are facing stress or unpleasant situations.\n112,2020-03-21 23:58:46,Learning to See before Learning to Act: Visual Pre-training,We find that pre-training on vision tasks significantly improves generalization and sample efficiency for learning to manipulate objects.\n115,2020-03-22 01:26:14,SOLT: Data Augmentation for Deep Learning,\"Data augmentation library for Deep Learning, which supports images, segmentation masks, labels and key points.\"\n116,2020-03-22 01:37:27,PCDet: 3D Point Cloud Detection,PCDet Toolbox in PyTorch for 3D Object Detection from Point Cloud\n117,2020-03-22 01:47:09,SiamFC++: Towards Robust and Accurate Visual Tracking,\"Implementation of a series of basic algorithms which is useful for video understanding, including Single Object Tracking (SOT), Video Object Segmentation (VOS).\"\n118,2020-03-22 21:46:52,Sinext,Sign language to text with OpenCV and MNIST sign-language dataset\n120,2020-03-24 04:38:08,Gliding Vertex on Horizontal Bounding Box for Object Detection,Gliding vertex on the horizontal bounding box for multi-oriented object detection.\n121,2020-03-24 04:56:38,Deep Reinforcement Learning in TensorFlow2,deep-rl-tf2 is a repository that implements a variety of polular Deep-RL algorithms using TF2. The key to this repo is an easy to understand code.\n122,2020-03-24 17:51:35,Custom Classifier on Top of Bert-like Language Model,Take pre-trained language model and build custom classifier on top of it.\n123,2020-03-24 18:20:55,Using Different Decoding Methods for LM with Transformers,A look at different decoding methods for generate subsequent tokens in language modeling.\n124,2020-03-24 21:12:12,Unsupervised Toolbox,\"Unsupervised learning Tool box : A micro framework for State of the Art Methods and models for unsupervised learning for NLU / NLG\r\n\"\n128,2020-03-25 15:21:34,Multimodal Brain Tumor Segmentation,Segmentation of gliomas in pre-operative MRI scans. Use the provided clinically-acquired training data to produce segmentation labels.\n133,2020-03-25 20:21:26,A Survey of Long-Term Context in Transformers,Over the past two years the NLP community has developed a veritable zoo of methods to combat expensive multi-head self-attention.\n137,2020-03-27 14:39:53,Debugging Neural Networks with PyTorch and W&B,A closer look at debugging common issues when training neural networks.\n138,2020-03-27 14:50:02,BachGAN: High-Res Image Synthesis from Salient Object Layout,We propose a new task towards more practical application for image generation - high-quality image synthesis from salient object layout.\n140,2020-03-28 07:49:03,Visual Paper Summary: ALBERT(A Lite BERT),An illustrated summary of ALBERT paper and how it improves BERT and makes it resource efficient\n145,2020-03-30 04:14:44,Controllable Person Image Synthesis with Attribute-Decomposed GAN,\"A novel generative model for controllable person image synthesis, which can produce realistic person images with desired human attributes.\"\n147,2020-03-30 05:39:57,Back Translation for Text Augmentation with Google Sheets,Learn how to augment existing labeled text data for free using Google Sheets.\n148,2020-03-30 14:13:46,An Illustrated Guide to Graph Neural Networks,A breakdown of the inner workings of GNNs.\n150,2020-04-01 08:26:46,The Illustrated FixMatch for Semi-Supervised Learning,Learn how to leverage unlabeled data using FixMatch for semi-supervised learning\n152,2020-04-01 15:38:58,A Two-Step Graph Convolutional Decoder for Molecule Generation,A simple auto-encoder framework for molecule generation.\n157,2020-04-03 01:56:32,TransMoMo: Invariance-Driven Unsupervised Motion Retargeting,A lightweight video motion retargeting approach that is capable of transferring motion of a person in a source video realistically to another video of a target\n158,2020-04-03 04:41:07,Tracking Objects as Points,Simultaneous object detection and tracking using center points.\n159,2020-04-03 14:57:11,Drifter-ML,A machine learning testing framework for sklearn and pandas.  The goal is to help folks assess whether things have changed over time.\n162,2020-04-03 20:17:50,Natural Language Processing News,Get the highlights from Natural Language Processing & Machine Learning research & industry straight to your inbox every month.\n163,2020-04-03 20:21:13,NLP Newsletter,\"Democratizing Artificial Intelligence Research, Education, and Technologies.\"\n168,2020-04-04 17:54:28,Self-Supervised Scene De-occlusion,\"We investigate the problem of scene de-occlusion, which aims to recover the underlying occlusion ordering and complete the invisible parts of occluded objects.\"\n173,2020-04-05 03:00:05,Design Patterns for Production NLP Systems,Designs and tips for designing NLP production systems.\n181,2020-04-05 14:56:34,Talking-Heads Attention,\"A variation on multi-head attention which includes linear projections across the attention-heads dimension, immediately before and after the softmax operation.\"\n183,2020-04-05 17:50:10,What does a CNN see?,First super clean notebook showcasing @TensorFlow 2.0. An example of end-to-end DL with interpretability.\n219,2020-04-06 14:10:22,Natural Language Processing: Pretraining - d2l,\"An interactive deep learning book with code, math, and discussions, based on the NumPy interface.\"\n224,2020-04-06 16:48:44,Understanding Convolutional Neural Networks for NLP,More recently we’ve also started to apply CNNs to problems in Natural Language Processing and gotten some interesting results.\n234,2020-04-06 17:42:52,An Overview of Semantic Image Segmentation,Image segmentation is a computer vision task in which we label specific regions of an image according to what's being shown.\n237,2020-04-06 18:02:48,Common Architectures in Convolutional Neural Networks,\"In this post, I'll discuss commonly used architectures for convolutional networks. \"\n238,2020-04-06 18:37:33,Googletrans,Googletrans: Free and Unlimited Google translate API for Python. Translates totally free of charge.\n239,2020-04-06 18:39:48,Prophet: Forecasting At Scale,Tool for producing high quality forecasts for time series data that has multiple seasonality with linear or non-linear growth.\n250,2020-04-06 19:24:06,Doccano,Open source text annotation tool for machine learning practitioner.\n251,2020-04-06 19:28:58,BRAT: Rapid Annotation Tool,BRAT (brat rapid annotation tool) is based on the stav visualiser which was originally made in order to visualise BioNLP'11 Shared Task data.\n252,2020-04-06 20:23:46,Word Embeddings,This tutorial introduces word embeddings. It contains complete code to train word embeddings from scratch on a small dataset.\n253,2020-04-06 20:26:27,On Word Embeddings,This post presents the most well-known models for learning word embeddings based on language modeling.\n254,2020-04-06 20:28:43,NLP for Developers: Word Embeddings | Rasa,\"In this video, Rasa Developer Advocate Rachael will talk about what word embeddings are, how they work, when they're used and some  common errors. \"\n255,2020-04-06 20:30:27,NLP for Developers: Transformers | Rasa,\"In this video, Rasa Developer Advocate Rachael will talk about what transformers are, how they work, when they're used and some  common errors. \"\n256,2020-04-06 20:42:05,A Visual Guide to Using BERT for the First Time,Tutorial for how to use a variant of BERT to classify sentences.\n257,2020-04-06 20:45:45,The Illustrated GPT-2 (Visualizing Transformer Language Models),Visuals explaining the inner-workings of transformers.\n259,2020-04-06 20:51:58,The Illustrated Word2vec,\"In this post, we’ll go over the concept of embedding, and the mechanics of generating embeddings with word2vec. \"\n260,2020-04-06 20:55:32,\"The Illustrated BERT, ELMo, and co.\",How NLP cracked transfer learning.\n261,2020-04-06 21:00:34,The Illustrated Transformer,\"In this post, we will look at The Transformer – a model that uses attention to boost the speed with which these models can be trained.\"\n262,2020-04-06 21:11:40,Visualizing A Neural Machine Translation Model,Mechanics of seq2seq models with attention.\n269,2020-04-06 22:46:54,Attention Mechanism,\"Main concepts behind Attention, including an implementation of a sequence-to-sequence Attention model, followed by the application of Attention in Transformers.\"\n270,2020-04-06 22:50:30,Attention? Attention!,\"In this post, we are gonna look into how attention was invented, and various attention mechanisms and models, such as transformer and SNAIL.\"\n271,2020-04-06 22:58:47,The Annotated Transformer,In this post I present an “annotated” version of the paper in the form of a line-by-line implementation.\n272,2020-04-06 23:38:26,The Annotated GPT-2,GPT-2 explained with visualization and PyTorch code.\n273,2020-04-06 23:41:52,Transformers - Hugging Face,🤗 Transformers: State-of-the-art Natural Language Processing for TensorFlow 2.0 and PyTorch.\n277,2020-04-07 00:30:33,Curriculum for Reinforcement Learning,\"Curriculum learning applied to reinforcement learning, with a few exceptions of supervised learning.\"\n278,2020-04-07 00:34:46,Self-Supervised Representation Learning,What if we can get labels for free for unlabelled data and train unsupervised dataset in a supervised manner?\n279,2020-04-07 00:36:55,Evolution Strategies,Evolutionary algorithms refer to a division of population-based optimization algorithms inspired by natural selection.\n280,2020-04-07 00:38:25,Meta Reinforcement Learning,Explore cases when we try to “meta-learn” Reinforcement Learning (RL) tasks by developing an agent that can solve unseen tasks fast and efficiently.\n281,2020-04-07 00:40:59,Generalized Language Models,Trend in large unsupervised pre-trained language models which have achieved amazing SOTA results on a variety of language tasks.\n284,2020-04-07 00:57:12,Policy Gradient Algorithms,\"In this post, we are going to look deep into policy gradient, why it works, and many new policy gradient algorithms proposed in recent years.\"\n286,2020-04-07 03:49:15,Object Detection for Dummies,\"We will go through several basic concepts, algorithms, and popular deep learning models for image processing and object detection.\"\n287,2020-04-07 03:59:53,Learning Word Embedding,This post introduces several models for learning word embedding and how their loss functions are designed for the purpose.\n290,2020-04-07 13:38:36,GANSpace: Discovering Interpretable GAN Controls,This paper describes a simple technique to analyze Generative Adversarial Networks (GANs) and create interpretable controls for image synthesis.\n291,2020-04-07 14:07:59,Kornia: Differentiable Computer Vision Library for PyTorch,Set of routines and differentiable modules to solve generic computer vision problems.\n294,2020-04-07 15:36:13,PyTorch Geometric ,Geometric deep learning extension library for PyTorch.\n295,2020-04-07 15:40:00,DGL: Deep Graph Library,\"Python package built to ease deep learning on graph, on top of existing DL frameworks. \"\n306,2020-04-07 20:07:28,BERT Research - Key Concepts & Sources,Video series on BERT's key concepts and sources.\n307,2020-04-07 20:11:29,GLUE Explained: Understanding BERT Through Benchmarks,In this post we take a look at an important NLP benchmark used to evaluate BERT and other transfer learning models!\n308,2020-04-07 23:22:18,TinyBERT,TinyBERT is 7.5x smaller and 9.4x faster on inference than BERT-base and achieves competitive performances in the tasks of natural language understanding.\n313,2020-04-08 00:02:27,NVIDIA Neural Modules: NeMo,A toolkit for conversational AI.\n315,2020-04-08 00:10:21,VoTT: Visual Object Tagging Tool,An electron app for building end to end Object Detection Models from Images and Videos.\n316,2020-04-08 00:12:26,Clinical BERT,Repository for Publicly Available Clinical BERT Embeddings\n318,2020-04-08 00:16:55,Computer Vision Annotation Tool (CVAT),\"Free, online, interactive video and image annotation tool for computer vision.\"\n319,2020-04-08 00:19:04,LabelImg,🖍️ A graphical image annotation tool and label object bounding boxes in images.\n327,2020-04-08 14:16:28,How to Steal Modern NLP Systems with Gibberish?,\"It’s possible to steal BERT-based models without any real training data, even using gibberish word sequences.\"\n334,2020-04-08 15:04:28,BioWordVec & BioSentVec,Pre-trained embeddings for biomedical words and sentences\n335,2020-04-08 15:07:44,BioBERT: a pre-trained biomedical language representation model ,\"Code for fine-tuning BioBERT for biomedical text mining tasks such as biomedical NER, relation extraction, QA, etc.\"\n341,2020-04-08 15:42:56,How to Unit Test Machine Learning Code,Wouldn’t suck to have to throw away perfectly good ideas because our implementations were buggy?\n343,2020-04-08 15:52:19,Machine Learning Systems Design,Designing a machine learning system.\n345,2020-04-08 16:14:23,HMTL: Hierarchical Multi-Task Learning,🌊 A State-of-the-Art neural network model for several NLP tasks based on PyTorch and AllenNLP\n347,2020-04-08 16:26:05,The State of Transfer Learning in NLP,This post expands on the NAACL 2019 tutorial on Transfer Learning in NLP. It highlights key insights and takeaways and provides updates based on recent work.\n349,2020-04-08 16:35:52,The Dark Secrets of BERT,How much of the linguistically interpretable self-attention patterns that are presumed to be its strength are actually used to solve downstream tasks?\n364,2020-04-08 17:53:15,Named Entity Recognition Tagging,\"In this post, we go through an example from Natural Language Processing, in which we learn how to load text data and perform NER tagging for each token.\"\n372,2020-04-08 18:22:46,An introduction to Q-Learning: Reinforcement Learning,Q-Learning algorithm along with an implementation in Python using Numpy.\n378,2020-04-08 19:37:57,Ray,Ray is a fast and simple framework for building and running distributed applications.\n380,2020-04-08 21:05:06,Graph Nets,\"PyTorch Implementation and Explanation of Graph Representation Learning papers involving DeepWalk, GCN, GraphSAGE, ChebNet & GAT.\"\n388,2020-04-08 21:36:39,ConvNet Playground,An interactive visualization for exploring Convolutional Neural Networks applied to the task of semantic image search.\n392,2020-04-08 21:53:06,Embedding Projector,\"Visualization of high dimensional data, namely embeddings.\"\n395,2020-04-08 22:12:24,Word2Viz: Explore Word Analogies,Interactive visualization of word analogies in GloVe.\n397,2020-04-08 22:17:06,Image-to-Image Translation with Conditional Adversarial Networks,Tensorflow port of Image-to-Image Translation with Conditional Adversarial Nets\n401,2020-04-08 22:29:09,\"Quick, Draw\",Can a neural network learn to recognize doodling?\n403,2020-04-08 22:44:04,A 2019 Guide to Speech Synthesis with Deep Learning,A look at recent deep learning based speech synthesis research and techniques.\n408,2020-04-08 23:03:13,FlashTorch,Visualization toolkit for neural networks in PyTorch\n411,2020-04-08 23:11:09,W&B: Weights and Biases,Track model training at scale.\n419,2020-04-09 00:41:03,Text Feature Selection for Causal Inference,\"Identifying the linguistic features that cause people to act a certain way after reading a text, regardless of confounding variables, is something people do.\"\n423,2020-04-09 00:57:49,3D Ken Burns Effect from a Single Image,Implementation of 3D Ken Burns Effect from a Single Image using PyTorch.\n424,2020-04-09 01:02:59,Sparse Sinkhorn Attention,A new efficient and sparse method for learning to attend based on differentiable sorting of internal representations.\n425,2020-04-09 01:41:48,Backtester,A backtesting framework for timeseries data.\n427,2020-04-09 18:57:01,An Overview of Early Vision in InceptionV1,\"A guided tour of the first five layers of InceptionV1,\r\ntaxonomized into “neuron groups.”\"\n428,2020-04-10 04:57:53,AiLight: Automatic  Highlighting Using BERT,\"Automatically highlight pdfs using BERT embeddings and clustering.\r\nhttps://anishthite.github.io/ailight\"\n430,2020-04-10 15:28:43,Controlling Text Generation with Plug and Play Language Models,\"This article discusses an alternative approach to controlled text generation, titled the Plug and Play Language Model (PPLM).\"\n431,2020-04-10 15:35:00,Genomic ULMFiT,ULMFiT for Genomic Sequence Data\n432,2020-04-10 15:39:29,Self-Supervised Learning and Computer Vision,\"So, what do you do if there are no pre-trained models in your domain? \"\n434,2020-04-10 15:51:52,scispaCy,A full spaCy pipeline and models for scientific/biomedical documents.\n439,2020-04-10 17:33:38,Universal Adversarial Triggers for Attacking and Analyzing NLP,We create short phrases that cause a specific model prediction when concatenated to 𝘢𝘯𝘺 input from a dataset.\n440,2020-04-10 17:39:19,lazynlp,Library to scrape and clean web pages to create massive datasets.\n443,2020-04-10 17:51:39,AllenNLP Interpret,A Framework for Explaining Predictions of NLP Models\n445,2020-04-10 18:00:50,Natural Language Processing With spaCy in Python,A comprehensive guide to NLP with spaCy.\n446,2020-04-10 18:45:15,Tips for Successfully Training Transformers on Small Datasets,It turns out that you can easily train transformers on small datasets when you use tricks (and have the patience to train a very long time).\n448,2020-04-10 19:14:59,🦄 How to build a SOTA Conversational AI with Transfer Learning,Train a dialog agent leveraging transfer Learning from an OpenAI GPT and GPT-2 Transformer language model.\n452,2020-04-10 20:18:20,CS224n: Natural Language Processing with Deep Learning,\"In this course, students will gain a thorough introduction to cutting-edge research in Deep Learning for NLP.\"\n453,2020-04-10 20:23:21,CS231n: Convolutional Neural Networks for Visual Recognition,\"Deep dive into details of the deep learning architectures with a focus on learning end-to-end models for these tasks, particularly image classification.\"\n455,2020-04-10 20:31:09,Illustrated: Self-Attention,Step-by-step guide to self-attention with illustrations and code.\n459,2020-04-10 21:05:32,Beyond the Pixel Plane: Sensing and Learning in 3d,Recent deep learning techniques that enable 3D object classification and semantic segmentation.\n462,2020-04-11 16:52:35,A Visual Guide to Self-Labelling Images,A self-supervised method to generate labels via simultaneous clustering and representation learning\n465,2020-04-13 02:18:51,3D Photography using Context-aware Layered Depth Inpainting,A multi-layer representation for novel view synthesis that contains hallucinated color and depth structures in regions occluded in the original view.\n466,2020-04-13 18:48:40,Tokenizers: How Machines Read,A survey of different tokenization strategies in NLP.\n467,2020-04-13 19:43:35,Practical Text Classification With Python and Keras,You will get a grasp of current advancements of (deep) neural networks and how they can be applied to text.\n468,2020-04-13 19:45:46,Text Classification With Torchtext,This example shows how to train a supervised learning algorithm for classification using one of these TextClassification datasets.\n469,2020-04-13 21:17:44,Understanding Text With Bert,Building a machine reading comprehension system using the latest advances in deep learning for NLP.\n470,2020-04-13 21:38:20,Transfer Learning with T5: the Text-To-Text Transfer Transformer,\"In the paper, we demonstrate how to achieve state-of-the-art results on multiple NLP tasks using a text-to-text transformer pre-trained on a large text corpus.\"\n471,2020-04-13 21:48:48,Building a COVID-19 Project Recommendation System,\"How to create a GitHub open source repo recommendation system web app with MLflow, Sagemaker, and Booklet.ai.\"\n473,2020-04-13 22:33:21,Neural Machine Translation With Attention,This notebook trains a sequence to sequence (seq2seq) model for Spanish to English translation.\n474,2020-04-13 22:48:49,PyTorch Tutorial for Deep Learning Researchers,This repository provides tutorial code for deep learning researchers to learn PyTorch.\n476,2020-04-14 00:40:10,Show and Tell: A Neural Image Caption Generator,A TensorFlow implementation of the image-to-text model.\n477,2020-04-14 01:46:32,SimpleGAN,A Tensorflow-based framework to ease the training of generative models\n478,2020-04-14 02:41:43,Semantic Segmentation on MIT ADE20K dataset in PyTorch,Pytorch implementation for Semantic Segmentation/Scene Parsing on MIT ADE20K dataset.\n480,2020-04-14 03:46:09,ViLBERT-MT: Multi-Task Vision & Language Representation Learning,A single ViLBERT Multi-Task model can perform 8 different vision and language tasks learnt from 12 datasets!\n481,2020-04-14 03:50:18,Training an Image Classifier in PyTorch,\"Torchvision, that has data loaders for common datasets such as Imagenet, CIFAR10, MNIST, etc. and data transformers for images, vizualization and data loaders.\"\n482,2020-04-14 17:28:37,A Visual Exploration of DeepCluster,DeepCluster is a self-supervised method to combine clustering and representation learning\n486,2020-04-14 20:12:43,A 2019 guide to Human Pose Estimation with Deep Learning,The basics of Human Pose Estimation (2D) and review the literature on this topic.\n489,2020-04-14 22:22:40,\"Deep Learning Based Super Resolution, Without Using a GAN\",\"Techniques and training a deep learning model for image improvement, image restoration, inpainting and super resolution.\"\n490,2020-04-14 22:35:21,U-Net Deep Learning Colorization of Greyscale Images,This article describes experiments training a neural network to generate 3 channel colour images from single channel greyscale images using deep learning.\n491,2020-04-14 22:38:54,Deep Learning for Image Super-resolution: A Survey,This article aims to provide a comprehensive survey on recent advances of image super-resolution using deep learning approaches.\n492,2020-04-14 22:41:52,Second-order Attention Network for Single Image Super-resolution,We propose a second-order attention network (SAN) for more powerful feature expression and feature correlation learning.\n493,2020-04-14 22:52:49,DeepSORT: Deep Learning to Track Custom Objects in a Video,A look at deep learning based approached for object tracking.\n494,2020-04-14 22:59:56,Fast Online Object Tracking and Segmentation: A Unifying Approach,We illustrate how to perform both realtime object tracking and semi-supervised video object segmentation using a fully-convolutional Siamese approach.\n495,2020-04-14 23:10:48,Neural Style Transfer,This tutorial uses deep learning to compose one image in the style of another image (ever wish you could paint like Picasso or Van Gogh?).\n499,2020-04-14 23:34:32,Deep Learning for Videos: A 2018 Guide to Action Recognition,\"In this post, I summarize the literature on action recognition from videos. \"\n501,2020-04-15 15:20:56,Shakespeare Meets Google's Flax,Application of RNNs in Flax: Character-Level Language Model.\n505,2020-04-15 15:59:30,\"Anomaly detection with Keras, TensorFlow, and Deep Learning\",Perform anomaly detection in your own image datasets using deep learning.\n507,2020-04-15 16:12:41,Almost Everything You Need to Know About Time Series,\"Understand moving average, exponential smoothing, stationarity, autocorrelation, SARIMA, and more.\"\n508,2020-04-15 16:29:08,STEFANN: Scene Text Editor using Font Adaptive Neural Network,A generalized method for realistic modification of textual content present in a scene image. ⭐️ Accepted in CVPR 2020.\n509,2020-04-15 16:34:04,Time Series Prediction with LSTM Using PyTorch,Time series applied to forecasting on the Airplane Passengers Dataset.\n513,2020-04-15 17:05:36,lda2vec: Tools for interpreting natural language,The lda2vec model tries to mix the best parts of word2vec and LDA into a single framework.\n516,2020-04-15 17:21:53,Deep Learning for Object Detection: A Comprehensive Review,\"A closer look at Tensorflow’s object detection models: Faster R-CNN, R-FCN, and SSD.\"\n517,2020-04-15 17:31:22,An Intuitive Guide to Deep Network Architectures,\"Intuition behind base network architectures like MobileNets, Inception, and ResNet.\"\n529,2020-04-15 19:39:24,Real-Time Voice Cloning,Clone a voice in 5 seconds to generate arbitrary speech in real-time. Code for Transfer Learning from Speaker Verification to Multispeaker Text-To-Speech.\n549,2020-04-16 03:48:35,15 Best Tools for Tracking Machine Learning Experiments,A feature comparison of all the open-source and commercial options for experiment tracking.\n550,2020-04-16 08:14:50,Cycle GAN in TensorFlow 2.0 with Custom Loops,\"Implementation of \"\"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks\"\" by Jun-Yan Zhu et al. \"\n552,2020-04-16 10:13:12,Holopix50k: A Large-Scale In-the-wild Stereo Image Dataset,The largest dataset of in-the-wild stereo image pairs (50K) crowd-sourced from the Holopix lightfield image-sharing social network.\n558,2020-04-16 15:49:29,PyTorch Notebooks,🔥A collection of PyTorch notebooks for learning and practicing deep learning\n564,2020-04-17 13:16:09,Optimize your ML models,Learn to use optimize your custom image classification models (built-in tf.keras) using TensorFlow Lite and gain 10x reduction in model's size.\n566,2020-04-17 21:57:35,Machine learning deserves its own flavor of Continuous Delivery,\"When traveling in the data science world, I'm homesick for a smooth continuous delivery flow. My thoughts on approachable CD4ML.\"\n574,2020-04-20 00:23:44,The Abstraction and Reasoning Corpus (ARC),\"Can a computer learn complex, abstract tasks from just a few examples? ARC can be used to measure a human-like form of general fluid intelligence.\"\n580,2020-04-20 00:57:03,GitHub Actions & Machine Learning Workflows with Hamel Husain,\" In this talk, Hamel will provide a brief tutorial on GitHub Actions, and will show you how you can use this new tool to automate your ML workflows.\"\n581,2020-04-20 01:01:38,How To Create Semantic Search For Arbitrary Objects,An end-to-end example of how to build a system that can search objects semantically. By Hamel Husain & Ho-Hsiang Wu\n598,2020-04-22 16:33:59,The Future of (Transfer Learning in) Natural Language Processing,\"Transfer Learning in Natural Language Processing (NLP): Open questions, current trends, limits, and future directions.\"\n599,2020-04-22 16:43:13,MONAI,AI Toolkit for Healthcare Imaging.\n601,2020-04-22 17:41:06,How I Used Deep Learning To Train A Chatbot To Talk Like Me,Facebook chatbot that I trained to talk like me using Seq2Seq.\n602,2020-04-23 00:36:02,DialoGPT: Toward Human-Quality Conversational Response Generation,Large-scale pre-training for dialogue.\n605,2020-04-23 03:59:57,Upside Down Reinforcement Learning,Implementation of UDRL as outlined by Juergen Schmidhuber in https://arxiv.org/abs/1912.02875\n608,2020-04-23 12:52:02,PyImageSearch,An online platform of blogs on Computer Vision and Deep Learning.\n619,2020-04-23 16:55:27,Implementing Portrait Bokeh Mode using OpenCV and NumPy (Python),\"Do you love the portrait mode in your smartphone? This code will help you do the same using OpenCV and NumPy! Detects the faces, asks if you want to blur them!\"\n621,2020-04-23 18:17:12,MixNMatch,Multifactor Disentanglement and Encoding for Conditional Image Generation\n622,2020-04-23 21:40:09,MT-Clinical BERT,Scaling Clinical Information Extraction with Multitask Learning\n623,2020-04-24 00:30:02,medaCy,🏥 Medical Text Mining and Information Extraction with spaCy\n632,2020-04-24 11:37:13,Lagrangian Neural Networks,\"Trying to learn a simulation? Try Lagrangian Neural Networks, which explicitly conserve energy and may generalize better!\"\n639,2020-04-24 20:51:18,ML Foundations and Methods for Precision Medicine and Healthcare,\"This tutorial will discuss ideas from machine learning that enable personalization (useful for applications in education, retail, medicine and recsys).\"\n643,2020-04-26 04:34:02,Albert-base for Sanskrit,Trained Albert-base from scratch on Sanskrit corpus of Wikipedia. I have also added a link to how to train your own Language model from scratch.\n644,2020-04-26 05:42:37,Adversarial Latent Autoencoders,\"Introducing the Adversarial Latent Autoencoder (ALAE), a general architecture that can leverage recent improvements on GAN training procedures.\"\n652,2020-04-28 15:14:00,Optimal Transport and the Sinkhorn Transformer,Understand optimal transport and the Sinkhorn-Knopp algorithm before diving into the Sinkhorn Transformer.\n653,2020-04-28 16:20:29,Semantic Graphs for Generating Deep Questions,\"Deep Question Generation (DQG), which aims to generate complex questions that require reasoning over multiple pieces of information of the input passage. \"\n658,2020-04-28 21:34:00,Gutenberg Dialog,Build a dialog dataset from online books in many languages.\n661,2020-04-29 02:41:24,Better NLP project,This is a wrapper program/library that encapsulates a couple of NLP libraries that are popular among the AI and ML communities.\n663,2020-04-29 04:42:16,Recipes for building an open-domain chatbot,\"Python framework for sharing, training and testing dialogue models, from open-domain chitchat to VQA (Visual Question Answering).\"\n665,2020-04-29 10:46:20,Object-detection with multi-template matching,\"This python package allows to perform object detection using one or a few template images, it provides a simpler alternative to deep-learning methods\"\n667,2020-04-29 18:34:28,No Trump Social Chrome Plugin,An AI-driven Browser Extension to Replace Trump Pics with Puppies!\n670,2020-04-29 19:35:22,Attribute2Font: Creating Fonts You Want From Attributes,Official PyTorch implementation of the Attribute2Font: Creating Fonts You Want From Attributes.\n674,2020-04-30 17:52:55,YOLOv4: Optimal Speed and Accuracy of Object Detection,A minimal implementation of YOLOv4.\n679,2020-05-01 16:17:32,Geometric and Relational Deep Learning,Videos from emerging fields of Graph Representation Learning and Geometric Deep Learning.\n683,2020-05-01 16:35:06,TAPAS: Weakly Supervised Table Parsing via Pre-training,Using neural networks to find answers in tables.\n686,2020-05-01 16:59:48,Jukebox: A Generative Model for Music,\"We’re introducing Jukebox, a neural net that generates music, including rudimentary singing, as raw audio in a variety of genres and artist styles. \"\n687,2020-05-01 17:17:48,Exploratory Data Analysis of Time Series,\"Exploratory Data Analysis of Time Series data in Python. It uses lot of the principles and concepts discussed in Prof. Hyndman's book. The focus is on understa\r\n\"\n688,2020-05-01 17:47:40,Gotchas of Transfer Learning for Image Classification,Discover the things you should care about while doing transfer learning for image classification.\n693,2020-05-02 05:05:44,SciTLDR: Extreme Summarization of Scientific Documents,A new automatic summarization task with high source compression requiring expert background knowledge and complex language understanding.\n694,2020-05-02 15:29:06,BLINK: Better entity LINKing,Entity Linking python library that uses Wikipedia as the target knowledge base.\n695,2020-05-02 21:33:31,Five Cool Python Libraries for Data Science,Python is a best friend for the majority of the Data Scientists. Libraries make their life simpler. I have come across five cool Python libraries while working\n700,2020-05-03 13:49:29,Fastai2 Vision Module,A detailed guide to using fastai2 Datablock API for common computer vision tasks\n702,2020-05-03 20:19:10,Unsupervised Question Decomposition for Question Answering,\"Decompose hard (multi-hop) questions into several, easier (single-hop) questions using unsupervised learning, and get better accuracy on multi-hop QA.\"\n704,2020-05-04 11:58:27,Training Batch Norm and Only Batch Norm,Experiments with the ideas presented in https://arxiv.org/abs/2003.00152 by Frankle et al.\n707,2020-05-05 03:36:50,The Big Bad NLP Database,A collection of 400+ NLP datasets with papers included.\n708,2020-05-05 03:51:53,POINTER: Constrained Text Generation,Constrained Text Generation via Insertion-based Generative Pre-training\n712,2020-05-05 05:55:46,Covid-19: A-Geo-Statistical-Analysis,Analysis with the time series data available for various countries.\n713,2020-05-05 07:13:49,Cognito : Data wrangling toolkit,Cognito is an exclusive python data preprocessing library and command-line utility that helps any developer to transform raw data into a machine-learning format\n717,2020-05-05 14:46:57,Synthesizer: Rethinking Self-Attention in Transformer Models,The dot product self-attention is known to be central and indispensable to state-of-the-art Transformer models. But is it really required?\n726,2020-05-06 01:10:55,ConvNets-TensorFlow2,Implementing a variety of popular and important CNN architectures\n732,2020-05-06 04:20:43,StellarGraph - Machine Learning on Graphs,\"State-of-the-art algorithms for graph machine learning, making it easy to discover patterns and answer questions about graph-structured data.\"\n733,2020-05-06 04:30:47,LandCover.ai,\"Dataset for automatic mapping of buildings, woodlands and water from aerial imagery.\"\n734,2020-05-06 04:33:15,Generating SOAP Notes from Doctor-Patient Conversations,Evaluate complete pipelines for leveraging these transcripts to train machine learning model to generate these notes.\n741,2020-05-07 01:15:12,Zero-shot Neural Retrieval via Domain-targeted Synthetic Queries,Zero-shot learning for ad-hoc retrieval models that relies on synthetic query generation.\n778,2020-05-07 21:28:34,Harry Potter and the Deep Learning Experiment,RNN built with TensorFlow to generate text based on Harry Potter's books.\n783,2020-05-08 14:44:04,NeuralCook — Image2Ingredients and Cooking Recommendation,\"Deep learning application to identify ingredients from cooking dishes images and recommend dishes to cook, given a set of ingredients.\"\n788,2020-05-09 04:12:10,NER model for 40 languages trained with the new TFTrainer,This model is a fine-tuned XLM-Roberta-base over the 40 languages proposed in XTREME from Wikiann.\n791,2020-05-09 14:30:08,Pose Animator,Takes a 2D vector illustration and animates its containing curves in real-time based on the recognition result from PoseNet and FaceMesh.\n792,2020-05-09 16:59:54,A Commit History of BERT and its Forks,What a commit history of version-controlled research papers could look like?\n795,2020-05-10 04:51:17,U^2-Net,\"The code for our newly accepted paper in Pattern Recognition 2020: \"\"U^2-Net: Going Deeper with Nested U-Structure for Salient Object Detection.\"\"\"\n796,2020-05-10 05:08:27,Age and Gender Estimation using Multi-Task CNN,Used a multi task CNN to predict the age group and gender of the person in the image.\n797,2020-05-10 15:31:27,Data augmentation recipes in tf.keras image-based models,Learn about different ways of doing data augmentation when training an image classifier in tf.keras.\n799,2020-05-11 00:40:49,Injecting Inductive Bias in Graph Neural Networks (MIT talk),Equivariant Mesh Neural Networks and Neural Augmented (Factor) Graph Neural Networks.\n800,2020-05-11 00:44:10,Feature Stores for ML,List of production ML groups and their open-source feature store architectures.\n803,2020-05-11 02:13:32,Image Semantic Segmentation of UAV mining area based on Deeplabv3,\"Data: UAV mining area image\r\nTools: PyTorch\r\nFrame: Deeplabv3\r\nSemantic Segmentation \"\n820,2020-05-11 14:19:18,A Comprehensive Survey on Graph Neural Networks,A Comprehensive Survey on Graph Neural Networks.\n821,2020-05-11 15:03:57,Hidden Technical Debt in Machine Learning Systems,\"Using the software engineering framework of technical debt, we find it is common to incur massive ongoing maintenance costs in real-world ML systems. \"\n822,2020-05-11 15:10:09,In-Domain GAN Inversion for Real Image Editing,\"We propose an in-domain GAN inversion method, which faithfully reconstructs the input image but also ensures the inverted code to be semantically meaningful.\"\n825,2020-05-11 23:07:39,Neural Networks for NLP (CMU CS 11-747),\"This class will start with a brief overview of neural networks, then spend the majority of the class demonstrating how to apply neural networks to language.\"\n826,2020-05-12 03:02:02,DANet PyTorch,A Pytorch implementation of Dual Attention Network for Scene Segmentation\n828,2020-05-12 05:04:58,BART version of closed-book QA,\"This is a BART version of sequence-to-sequence model for open-domain QA in a closed-book setup, based on PyTorch and Huggingface's Transformers.\"\n829,2020-05-12 05:07:35,Unsupervised Reinforcement Learning,Lecture on unsupervised reinforcement learning by Sergey Levine. Originally prepared for AAMAS 2020.\n831,2020-05-13 02:24:24,CCNet_PyTorch,A PyTorch Implementation of  CCNet: Criss-Cross Attention for Semantic Segmentation\n832,2020-05-13 04:22:09,Image segmentation in 2020,\"Architectures, Losses, Datasets, and Frameworks\"\n833,2020-05-13 04:27:08,Plan2Explore: Plan to Explore via Self-Supervised World Models,A self-supervised reinforcement learning agent that tackles task-specific and the sample efficiency challenges.\n835,2020-05-13 04:39:31,Toward Better Storylines with Sentence-Level Language Models,We propose a sentence-level language model which selects the next sentence in a story from a finite set of fluent alternatives.\n836,2020-05-13 04:43:57,Epipolar Transformers,\"Differentiable \"\"epipolar transformer\"\", which enables the 2D detector to leverage 3D-aware features to improve 2D pose estimation.\"\n840,2020-05-13 05:03:33,Machine Learning on Graphs: A Model and Comprehensive Taxonomy,We propose a simple framework (GraphEDM) and a comprehensive Taxonomy to review and unify several graph representation learning methods.\n841,2020-05-13 05:10:58,BLEURT: Learning Robust Metrics for Text Generation,A metric for Natural Language Generation based on transfer learning.\n842,2020-05-13 13:20:07,Identifying Brain Tumor from MRI images using FastAI -DynamicUnet,\"To use FASTAI unet learner to identify tumours from MRI of Brain, logging loss metrics in Neptune AI logger and compare the results after hyperparameter tuning.\"\n847,2020-05-13 22:53:36,HuggingTweets,Tweet Generation with Huggingface.\n849,2020-05-13 22:59:38,Top Down Introduction to BERT with HuggingFace and PyTorch,I will also provide some intuition into how BERT works with a top down approach (applications to algorithm).\n850,2020-05-13 23:02:29,Transformers from Scratch,\"Attempt to explain directly how modern transformers work, and why, without some of the historical baggage.\"\n852,2020-05-14 07:11:26,Scene Classification using Pytorch and Fast.ai,The objective is to classify Multi-label images using deep learning. Here I have used Fast.ai library for implementing the model.\n855,2020-05-14 12:32:20,Fake new detection Pytorch,Fake News Detection by Learning Convolution Filters through Contextualized Attention.\n857,2020-05-14 14:25:11,FastHugs: Sequence Classification with Transformers and Fastai,Fine-tune a text classification model with HuggingFace 🤗 transformers and fastai-v2.\n858,2020-05-14 14:35:37,Open-Dialog Chatbots for Learning New Languages,A tutorial for automatically generate code comments using Deep Learning.\n860,2020-05-14 17:35:04,Electra,ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators\n862,2020-05-14 19:13:59,DQN In Pytorch Livestream Series,I'm doing a series of streams about reinforcement learning (starting from Q learning) focused on showing the work in as much detail as possible (e.g. debugging)\n863,2020-05-15 04:24:58,S2IGAN: Speech-to-Image Generation via Adversarial Learning,A speech-to-image generation (S2IG) framework is proposed which translates speech descriptions to photo-realistic images without using any text information.\n864,2020-05-15 13:04:19,Twitter Sentiment Analysis,\"This project is based on Natural Language processing (NLP), in this we do sentiment analysis(i.e, how much it is positive or negative) of tweets of any account.\"\n866,2020-05-15 13:51:56,HuggingFace nlp library,\"nlp is a lightweight and extensible library to easily share and load dataset and evaluation metrics, already providing access to ~100 datasets and ~10 evaluatio\"\n868,2020-05-15 14:07:47,RXNMapper: Unsupervised Attention-Guided Atom-Mapping,The atom-mapping information was learned by an ALBERT model trained in an unsupervised fashion on a large dataset of chemical reactions.\n869,2020-05-15 14:08:12,ICLR 2020 Trends: Better & Faster Transformers for NLP,A summary of promising directions from ICLR 2020 for better and faster pretrained tranformers language models.\n875,2020-05-15 22:53:58,Differentiable Reasoning over Text,We consider the task of answering complex multi-hop questions using a corpus as a virtual knowledge base (KB).\n877,2020-05-16 02:42:32,Semi-supervised image classification with GANs,\"Shows how to perform semi-supervised image classification with GANs. The cover image is from Chapter 7, GANs in Action.\"\n879,2020-05-16 10:57:53,HighRes-net: Multi-Frame Super-Resolution of satellite imagery,\"Pytorch implementation of HighRes-net, a neural network for multi-frame super-resolution, trained and tested on the European Space Agency’s Kelvin competition.\"\n880,2020-05-16 11:50:31,How Deep Is Your Love For Transfer Learning In NLP?,A review of NLP research\n881,2020-05-16 13:32:51,Time Series Forecasting with TensorFlow.js,Machine learning is becoming increasingly popular these days and a growing number of the world’s population see it is as a magic crystal ball: predicting when a\n882,2020-05-16 13:35:31,Phrases extraction and D3 Wordcloud,100% JavaScript solution to extracting phrases from text and display key points in a beautiful D3 wordcloud.\n883,2020-05-16 13:37:44,Reinforcement Learning Tic Tac Toe with Value Function,\"A reinforcement learning algorithm for agents to learn the tic-tac-toe, using the value function\r\n\r\n\"\n884,2020-05-16 13:40:07,Build a Textual Similarity Web App with TensorFlow.js,Have you wondered how search engines understand your queries and retrieve relevant results? How chatbots extract your intent from your questions and provide the\n890,2020-05-16 19:51:33,cyBERT: Applying BERT to Windows event logs,\"This blog shows how interpreting cybersecurity logs as a natural language, improving upon the standard regex-based parsing of log data.\"\n892,2020-05-17 02:08:12,DPOD: Pose Estimator,PyTorch recreation of a SOTA 6D Pose estimation research paper.\n893,2020-05-17 04:44:04,ESTorch,ESTorch is an Evolution Strategy Library build around PyTorch.\n894,2020-05-17 04:47:40,\"A Large-Scale, Open-Domain, Mixed-Interface Dialogue-Based ITS \",\"Korbit, a large-scale, open-domain, mixed-interface, dialogue-based intelligent tutoring system (ITS).\"\n900,2020-05-17 08:14:24,A Visual Survey of Data Augmentation in NLP,An extensive overview of text data augmentation techniques for Natural Language Processing\n901,2020-05-17 09:57:38,DoYouEvenLearn,Essential Guide to keep up with AI/ML/DL/CV\n902,2020-05-18 00:57:27,Differentiable Adaptive Computation Time for Visual Reasoning ,\"DACT, a new algorithm for achieving adaptive computation time that, unlike existing approaches, is fully differentiable. \"\n903,2020-05-18 11:15:12,Semixup: In- and Out-of-Manifold Regularization,Semixup is a semi-supervised learning method based on in/out-of-manifold regularization.\n905,2020-05-18 14:40:51,Deep Reinforcement Learning for Supply Chain & Price Optimization,Explore how deep reinforcement learning methods can be applied in several basic supply chain and price management scenarios.\n907,2020-05-18 14:53:33,TextAttack,A Python framework for building adversarial attacks on NLP models.\n913,2020-05-19 03:19:59,aitextgen,A robust Python tool for text-based AI training and generation using GPT-2.\n914,2020-05-19 03:25:11,How Hugging Face achieved a 2x performance boost for QA,Question Answering with DistilBERT in Node.js\n918,2020-05-19 22:36:09,Accelerate your NLP pipelines using Hugging Face and ONNX,How the ONNX Runtime team and Hugging Face are working together to address challenges in training and deployment of Transformer models.\n920,2020-05-20 02:35:11,Attentron,Few-shot text-to-speech exploiting attention-based variable length embedding\n921,2020-05-20 02:39:09,Torch Points3D,Pytorch framework for doing deep learning on point clouds.\n922,2020-05-20 07:23:50,NLP Model Selection ,NLP model selection guide to make it easier to select models. This is prescriptive in nature and has to be used with caution.\n925,2020-05-20 16:20:28,Model-Agnostic Meta-Learning for Reinforcement Learning with TF2,Reimplementation of Model-Agnostic Meta-Learning (MAML) applied on Reinforcement Learning problems in TensorFlow 2.\n927,2020-05-21 03:16:17,FashionBERT,Text and image matching with adaptive loss for cross-modal retrieval.\n934,2020-05-21 03:45:38,📈 Automated Time Series Forecasting,This data app uses Facebook's open-source Prophet library to automatically forecast values into the future.\n935,2020-05-21 14:22:01,\"Look inside the workings of \"\"Label Smoothing\"\"\",\"This blog post describes how and why does \"\"trick\"\" of label smoothing improves the model accuracy and when should we use it \"\n938,2020-05-22 01:01:32,Content and Style Disentanglement for Artistic Style Transfer,Hi-Res style transfer and interpolation between styles\n939,2020-05-22 03:08:40,Time Series Classification Using Deep Learning,\"In this article, I will introduce you to a new package called timeseries for fastai2 that I lately developed. \"\n940,2020-05-22 03:16:29,TAO: A Large-Scale Benchmark for Tracking Any Object,\"A diverse dataset for Tracking Any Object (TAO) consisting of 2,907 high resolution videos, captured in diverse environments, which are half a minute long on \"\n941,2020-05-22 03:21:10,BiT: Exploring Large-Scale Pre-training for Compute,\"We are excited to share the best BiT models pre-trained on public datasets, along with code in TF2, Jax, and PyTorch. \"\n947,2020-05-22 13:34:30,Self Driving Car,This project is a demonstration of a working model of self driving car 🚗🚗 identifying and following lanes using powerful computer vision 🕶🕶 algorithms.\n948,2020-05-22 13:39:15,Plant Disease Detection,This website help you to detect disease in your plant🌳 based to the plant's leaf🍃 image\n951,2020-05-23 03:19:00,YoloV3 implementation in keras and tensorflow 2.2,YoloV3 Real Time Object Detector in tensorflow 2.2.\n952,2020-05-23 03:22:11,Face Mask Detector,A simple Streamlit frontend for face mask detection in images using a pre-trained Keras CNN model + OpenCV and model interpretability.\n957,2020-05-23 09:18:52,Colbert AI,Colbert AI is a Deep Learning Language Model that generates text in the style of Stephen Colbert's famous monologues.\n961,2020-05-23 16:01:21,How to Build Robust Embeddings for Visual Similarity Tasks,This repository I package a bunch of tips and tricks to efficiently train deep learning models in computer vision\n962,2020-05-24 00:09:28,Basic ML Algorithms from scratch.,Implement basic Machine Learning Algorithms from scratch in python.\n963,2020-05-24 03:13:28,Build your first data warehouse with Airflow on GCP,What are the steps in building a data warehouse? What cloud technology should you use? How to use Airflow to orchestrate your pipeline?\n966,2020-05-24 10:24:03,Building an Intelligent Twitter Bot,The volume of information going through Twitter per day makes it one of the best platforms to get information on any subject of interest.\n968,2020-05-24 16:40:46,Self Supervised Representation Learning in NLP,An overview of self-supervised pretext tasks in Natural Language Processing\n970,2020-05-24 20:01:29,Job Classification,\"Job Classification done using Techniques of NLP and ML.\r\n\r\nDataset used from Kaggle of Indeeed job posting.\"\n972,2020-05-25 03:23:16,Next Word Prediction,Using transformers to predict next word and predict <mask> word.\n974,2020-05-25 03:28:32,PixelLib,Pixellib is a library for performing segmentation of images.\n978,2020-05-25 05:53:46,TensorFlow.js - Gesture Controlled 2048,Gesture Controlled 2048 built with TensorFlow.js\n979,2020-05-25 11:04:50,Taxi Demand Prediction NewYorkCity,Predict the number of pickups as accurately as possible for each region in a 10 -min interval.\n980,2020-05-25 14:52:17,Super-BPD for Fast Image Segmentation,\"We propose direction-based super-BPD, an alternative to superpixel, for fast generic image segmentation, achieving state-of-the-art real-time result.\"\n986,2020-05-26 03:47:15,Neural Topological SLAM for Visual Navigation,Topological representations for space that effectively leverage semantics and afford approximate geometric reasoning.\n987,2020-05-26 13:16:48,Zero To One For NLP,A collection of all resources for learning NLP\n989,2020-05-26 17:17:14,NLP for Developers: Shrinking Transformers | Rasa,\"In this video, Rasa Senior Developer Advocate Rachael will talk about different approaches to make transformer models smaller.\"\n993,2020-05-27 05:26:33,DETR: End-to-End Object Detection with Transformers,A new method that views object detection as a direct set prediction problem.\n997,2020-05-28 03:20:06,AutoSweep: Recovering 3D Editable Objects from a Single Photo,Fully automatic framework for extracting editable 3D objects directly from a single photograph.\n1000,2020-05-28 03:33:52,CMU LTI Low Resource NLP Bootcamp 2020,A low-resource natural language and speech processing bootcamp held by the Carnegie Mellon University Language Technologies Institute in May 2020.\n1007,2020-05-28 21:30:37,Humour.ai : Language Model that can crack Jokes,\"A Language model that can make you laugh. Humour.ai model tries to\r\ncomplete a sentence in a humourous way given some input words. \"\n1008,2020-05-29 02:28:53,face mask detection ,detects whether a person wearing a mask or not\n1009,2020-05-29 02:47:06,Train ALBERT for NLP with TensorFlow on Amazon SageMaker,\"To train BERT in 1 hour, we efficiently scaled out to 2,048 NVIDIA V100 GPUs by improving the underlying infrastructure, network, and ML framework. \"\n1010,2020-05-29 02:51:39,GPT-3: Language Models are Few-Shot Learners,\"We show that scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior SOTA.\"\n1013,2020-05-29 03:06:41,Guided Uncertainty-Aware Policy Optimization,Combining learning and model-based strategies for sample-efficient policy learning.\n1018,2020-05-29 08:09:04,GOTURN-PyTorch,\"PyTorch implementation of \"\"Learning to Track at 100 FPS with Deep Regression Networks\"\"\"\n1020,2020-05-29 09:54:04,Applying Modern Best Practices to Autoencoders,This project applies best modern practices found in other areas of image research to autoencoders. Comparing models from other areas of image research.\n1021,2020-05-29 10:33:26,Sentiment analysis ,\"Sentiment analysis by combining three dataset amazon,yelp, IMDb reviews to train our,model to classify if a comment is negative or positive denoted by 0 and 1.\"\n1022,2020-05-29 13:27:20,The designer - gpt2 bot that talks about UX Design,\"This twitter profile spits out thoughts on design and development. Trained with hundreds of Books on UX design and Front end development, it has opinions.\"\n1024,2020-05-29 14:15:30,Sentiment Classification for UtaPass & KKBOX Reviews,Text classification for reviews of UtaPass & KKBOX using different deep learning models.\n1025,2020-05-29 14:18:59,Forex Prediction,Using neural networks to predict movement of forex direction.\n1026,2020-05-29 14:24:07,Lyrics-Based Music Genre Classifier,\"Classify the genre (Rock, Pop, Hip-Hop, Not Available, Metal, Other, Country, Jazz, Electronic, R&B, Indie, Folk) of the song by its lyrics.\"\n1028,2020-05-29 14:39:16,ARBML,\"Implementation of many Arabic NLP and ML projects. Providing real time experience using many interfaces like web, command line and notebooks.\"\n1035,2020-05-29 16:11:11,Zero Shot Topic Classification,Bart with a classification head trained on MNLI.\n1045,2020-05-30 01:35:24,Illustrated Guide to Transformers: Step by Step Explanation,\"In this post, we’ll focus on the one paper that started it all, “Attention is all you need”.\"\n1046,2020-05-30 01:39:25,Illustrated Guide to Transformers,A component by component breakdown analysis.\n1055,2020-05-30 09:02:27,Automatic-Face-Detection-Annotation-and-Preprocessing,\"Automatically detect , annotate , collect the coordinates , convert to csv and to tfrecord\"\n1058,2020-05-30 09:43:39,SmartFeed.ai,NLP Based Article Recommendation System\n1059,2020-05-30 10:50:55,Wheat Detection 🌾,This is a project for detecting and creating bounding box of wheat heads 🌾.\n1068,2020-05-30 18:20:40,Effects of News Sentiments on Stock Predictions,Project is based on the Natural Language Processing technique called Sentiment Analysis. Stock market and news related to it as the subject of analysis.\n1069,2020-05-30 20:04:49,NLP News Category,The objective of this repository is to create a NLP bot for when you give the robot the headline of the news and a short description it will return the genre.\n1070,2020-05-30 20:06:48,AI Debate Master,\"Created and deployed a bot made to debate with a human on any\r\ngiven topic. Employed a Doc2Vec model using Gensim library in Python\"\n1075,2020-05-31 04:44:27,Zero-Shot Learning for Text Classification,\"A visual summary of “Train Once, Test Anywhere” paper for zero-shot text classification\"\n1080,2020-05-31 05:23:23,Dash DETR Detection App,A User Interface for DETR built with Dash. 100% Python.\n1081,2020-05-31 05:28:53,AI Basketball Analysis,🏀   AI web app and API to analyze basketball shots and shooting pose.\n1083,2020-05-31 08:20:06,Reverse Image Search,Have you ever wondered how google image search works or How amazon can retrieve products similar to the image that we upload in the app/site? To achieve this ta\n1084,2020-05-31 08:22:45,Beginner’s guide to Machine Learning Model Deployment,Are you a beginner in the field of machine learning and wondering how to bring your project to live. I'm was in the same situation when I started learning ML. M\n1093,2020-05-31 17:39:22,MedicalZoo PyTorch,A pytorch-based deep learning framework for multi-modal 2D/3D medical image segmentation\n1094,2020-05-31 19:11:28,Paraphrase Any Question with T5  (Text-To-Text  Transformer),\"Given a question, generate paraphrased versions of the question with T5 transformer. Pretrained model and training script provided.\"\n1100,2020-06-01 05:56:43,Movie Recommendation System,This is a web app which recommends movies based on their plots found on IMDb.\n1104,2020-06-01 10:02:09,Convnet Galaxy Morphology Classifier,Classify galaxies from Hubble Tuning Fork using Convnet.\n1107,2020-06-01 14:52:29,2nd Place Solution to Ship Identification Hackathon ,The problem statement was to identify the type of ship from photos taken from the survey boats. The hackathon was organized by Analytics Vidhya.\n1110,2020-06-01 16:44:55,Deep learning Architecture: AlexNet,Explaining network architecture for AlexNet\n1111,2020-06-01 18:13:26,Movement Pruning: Adaptive Sparsity by Fine-Tuning,\"We propose the use of movement pruning, a simple, deterministic first-order weight pruning method that is more adaptive to pretrained model fine-tuning.\"\n1112,2020-06-01 18:57:31,Document search engine,NLP based search engine for single page pdf files.\n1115,2020-06-01 21:07:53,Softbot design with WANNS,\"Soft robots are robots built from highly compliant materials, similar to those found in living organisms. This project explored CPPNs and WANNs to design them\"\n1121,2020-06-02 05:07:17,Motion2Vec,Semi-Supervised Representation Learning from Surgical Videos\n1122,2020-06-02 05:10:18,Machine Learning: Tests and Production,Best practices for testing ML-based systems.\n1130,2020-06-02 11:51:38,Generate True or False questions from any content,\"Automatically generate “True or False” questions like the ones you see in school textbooks using  OpenAI GPT2, Sentence BERT, and Berkley parser\"\n1131,2020-06-02 13:41:32,Sized Fill-in-the-blank or Multi Mask filling with RoBERTa,Sized fill-in-the-blank or conditional text filling is the idea of filling missing words of a sentence with the most probable choice of words.\n1132,2020-06-02 14:56:10,T5 for Sentiment Span Extraction,Exploring how T5 works and applying it for sentiment span extraction.\n1133,2020-06-02 14:58:58,Getting Started with Time Series analysis using Pandas,An introductory guide to get started with the Time Series datasets in Python\n1135,2020-06-02 15:06:34,Melanoma Detection with Pytorch,\"In this video, I show you how you can build a deep learning model to detect melanoma with a very high accuracy.\"\n1139,2020-06-02 19:53:37,\"RoBERTa → Longformer: Build a \"\"Long\"\" Version of Pretrained Models\",This notebook replicates the procedure descriped in the Longformer paper to train a Longformer model starting from the RoBERTa checkpoint.\n1145,2020-06-03 01:51:14,Learning Dexterity End-to-End,We trained a human-like robot hand to manipulate physical objects with unprecedented dexterity.\n1148,2020-06-03 02:28:20,A Practical guide to building a conversational chatbot,Building a Chatbot from scratch using Keras and NLTK library for a customer service company\n1151,2020-06-03 07:25:27,Web Mining and Information theory,\"Mining the Web and playing with Natural Language processing. Implementing Information retrieval System tasks. Going towards the NLP and Performing Machine Learning algorithms. Through these codes and problems, I have understood the information retrieval process of any search engine. These are very useful problems towards sentiment analysis.\"\n1162,2020-06-03 22:05:30,Deep Q-Network on Space Invaders. ,This is a PyTorch implementation of a Deep Q-Network agent trained to play the Atari 2600 game of Space Invaders.\n1165,2020-06-04 03:53:43,YOLOv4,A TensorFlow 2.0 implementation of YOLOv4: Optimal Speed and Accuracy of Object Detection.\n1166,2020-06-04 03:55:53,Acme: A Research Framework for Reinforcement Learning,A library of reinforcement learning components and agents.\n1176,2020-06-04 09:10:07,doc2vec Paragraph Embeddings for Text Classification,Text classification model which uses gensim's Doc2Vec for generating paragraph embeddings and scikit-learn Logistic Regression for classification.\n1178,2020-06-04 12:19:52,Machine Learning with Fastai,\"The fastai library is based on research into deep learning best practices undertaken at fast.ai, and includes support for Vision, Text, tabular and Collab\"\n1180,2020-06-04 14:58:19,The Transformer … “Explained”?,\"An intuitive explanation of the Transformer by motivating it through the lens of CNNs, RNNs, etc.\"\n1181,2020-06-04 16:28:24,TensorflowTTS: Real-Time SOTA Speech Synthesis for Tensorflow 2.0,\"TensorflowTTS provides real-time state-of-the-art speech synthesis architectures such as Tacotron2, Melgan, FastSpeech.\"\n1185,2020-06-04 22:36:31,PyTorch Transformers Tutorials,\"A set of annotated Jupyter notebooks, that give user a template to fine-tune transformers model to downstream NLP tasks such as classification, NER etc. \"\n1192,2020-06-05 04:28:52,BERT Summarization,This folder contains colab notebooks that guide you through the summarization by BERT and GPT-2 to play with your data.\n1194,2020-06-05 04:35:14,Divide Hugging Face Transformers Training Time By 2,Reducing training time helps to iterate more in a fixed budget time and thus achieve better results.\n1199,2020-06-05 15:39:56,How NLP has evolved for Financial Sentiment Analysis,Do we still need humans to read boring financial statements?\n1202,2020-06-05 17:51:33,The NLP Pandect - All NLP resources in one place,The NLP Pandect was created to help you find almost anything related to Natural Language Processing that is available online.\n1203,2020-06-05 18:18:18,Summary of 🤗 Transformers Models,A high-level summary of the differences between each model in HuggingFace's Transformer library.\n1204,2020-06-05 22:56:38,Snaked: Classifying Snake Species using Images,Proof of concept that it is possible to identify snake species and whether poisonous from photographs (PyTorch code/model with Android app)\n1211,2020-06-06 15:13:13,Literate Lamp: Answering Question with Common Sense,We study the problem of answering questions that require common sense to be answered using Transformer-based models and the ConceptNet knowledge base.\n1215,2020-06-06 19:00:39,Pytorch Faster RCNN,Fine Tune Faster RCNN in pytorch for your task.\n1222,2020-06-07 04:34:58,Paragraph Summarizer,Uses the extractive way of summarizing the text by finding the score and ranking it.\n1223,2020-06-07 04:39:32,Leafy: Plant Leaf Classifier,The sequential model trained on images from the leafsnap.com\n1236,2020-06-07 21:03:31,\"COVID-Q: A Dataset of 1,690 Questions about COVID-19\",\"This dataset consists of COVID-19 questions which have been annotated into a broad category (e.g. Transmission, Prevention) and a more specific class such that \"\n1237,2020-06-08 03:43:45,Keras notifications on Slack!,Get slack notifications of your model's training progress when training with Keras (or tf.keras)\n1239,2020-06-08 07:05:15,Zero-shot Text Classification With Generative Language Models,An overview of a text generation approach to zero-shot text classification with GPT-2\n1241,2020-06-08 08:25:01,Funnel-Transformer: Filtering out Sequential Redundancy,Funnel-Transformer is a self-attention model that gradually compresses the sequence of hidden states to a shorter one and hence reduces the computation cost.\n1243,2020-06-08 08:39:34,Timeseries Anomaly Detection using an Autoencoder,Detect anomalies in a timeseries using an Autoencoder.\n1246,2020-06-08 09:47:02,Fairseq-tagging,\"a Fairseq fork for sequence tagging/labeling tasks\r\n\"\n1249,2020-06-08 16:59:01,Know-Corona : Kaggle COVID-19 Open Research Dataset Challenge (CO,\"NLP/state-of-the-art language model (BERT) based Question & Answering pipeline to answer all task questions after analyzing articles abstract of COVID-19, SARS-\"\n1251,2020-06-08 18:38:49,Automatic Asset Classification,This project aims to automate the task of labelling images of flood defence assets as well as clustering images to find possibly better groupings.\n1255,2020-06-09 01:50:33,TransformerTTS,🤖💬 Transformer TTS: Implementation of a non-autoregressive Transformer based neural network for text to speech.\n1257,2020-06-09 01:58:48,How Big Should My Language Model Be?,Tool to explore language model training and optimize the compute costs.\n1258,2020-06-09 02:04:49,MSeg: A Composite Dataset for Multi-domain Semantic Segmentation,A composite dataset that unifies semantic segmentation datasets from different domains.\n1259,2020-06-09 02:11:15,Network Fusion for Content Creation With Conditional Inns,\"We present a method to repurpose powerful, existing models for new tasks, even though they have never been designed for them.\"\n1260,2020-06-09 02:14:59,Advanced Deep Learning for Computer Vision (ADL4CV),\"The Visual Computing Group offers a variety of lectures and seminars on a regular basis, covering hot areas in computer graphics, vision, and machine learning.\"\n1272,2020-06-10 05:13:41,Linformer: Self-Attention with Linear Complexity,We demonstrate that the self-attention mechanism can be approximated by a low-rank matrix.\n1274,2020-06-10 05:21:00,Getting Machine Learning to Production,\"Machine learning is hard and there are a lot, a lot of moving pieces.\"\n1275,2020-06-10 05:24:07,Exploration Strategies in Deep Reinforcement Learning,Exploitation versus exploration is a critical topic in reinforcement learning. This post introduces several common approaches for better exploration in Deep RL.\n1278,2020-06-10 12:50:41,Automatically Generate Multiple Choice Questions (MCQs) ,\"Automatically Generate Multiple Choice Questions (MCQs) from any content with BERT Summarizer, Wordnet, and Conceptnet\"\n1287,2020-06-10 18:27:24,BERT Loses Patience: Fast and Robust Inference with Early Exit,\"Patience-based Early Exit, a inference method that can be used as a plug-and-play technique to simultaneously improve the efficiency of a pretrained LM.\"\n1298,2020-06-11 04:18:27,PEGASUS: a SOTA model for Abstractive Text Summarization,A State-of-the-Art Model for Abstractive Text Summarization.\n1301,2020-06-11 04:29:24,Big GANs Are Watching You, We demonstrate that object saliency masks for GAN-produced images can be obtained automatically with BigBiGAN.\n1309,2020-06-11 19:04:31,Sentiment Analysis on News Article,Used Twitter API to extract news-related tweets. Did some preprocessing and then calculated the tweets' polarity.\n1310,2020-06-11 20:30:38,GPT-3 Language Model: A Technical Overview,\"Technical details of the GPT-3 model, training, inference and what to expect next. \"\n1312,2020-06-11 20:37:47,OpenAI API,API for accessing new AI models developed by OpenAI.\n1320,2020-06-12 04:17:08,Implementation of a Contextual Chatbot in PyTorch,Simple chatbot implementation with PyTorch.\n1325,2020-06-12 11:06:34,Author Identification using Doc2Vec,Web app of an author identification model trained on PAN 2012 dataset and Kaggle's Spooky Authorship Dataset\n1329,2020-06-12 12:44:18,Training game agents with supervised learning,This is a continuing research project trying find ways to learn complex tasks such as games without using Reinforcement Learning.\n1371,2020-06-13 17:16:07,Baymax - ChatBot,\"Baymax Chatbot is a part of my summer training program @AdHoc Networks, Jaipur.\r\n\r\nA chatbot that allows user to signup and login to maintain their record. When c\"\n1372,2020-06-13 17:21:43,How to Evaluate Longformer on TriviaQA using NLP,We will evaluate a pretrained LongformerForQuestionAnswering model on the validation dataset of TriviaQA.\n1374,2020-06-13 17:28:13,Extracting Structured Data from Templatic Documents,\"Automatically extract data from structured documents—invoices, receipts, etc.—with the potential to streamline many business workflows.\"\n1392,2020-06-13 20:58:33,StackOver Flow Data Analysis,\"Analysing certain aspects of the stack overflow data and creating \"\"Tag Predictor\"\" which predicts tag based on the post posted. \"\n1398,2020-06-14 05:51:06,Super-resolution Variational Auto-Encoders,VAE with RealNVP prior and Super-Resolution VAE in PyTorch.\n1399,2020-06-14 05:57:16,Video object grounding,Video object grounding using semantic roles in language description.\n1418,2020-06-14 17:43:34,Short Notes on Behavior Regularized Offline RL,Blog Article on Behavior Regularized Offline Reinforcement Learning by Yifan Wu et al. (2019)\n1423,2020-06-14 22:10:57,Entity Embedding with LSTM for Time-Series,\"Demonstration of using LSTM for forecasting with structured time-series data, containing categorical and numerical features.\"\n1424,2020-06-15 02:27:55,Why We Switched from Flask to FastAPI for Production ML,The most popular tool isn’t always the best.\n1425,2020-06-15 02:31:48,Building a Captcha OCR in TF2.0,A Kaggle notebook showcasing the use of an Endpoint layer for CTC loss function used for building a Captcha Reader in TensorFlow.\n1427,2020-06-15 02:40:48,101 Ways to Solve Search - Dair AI ft. Pratik Bhavsar,A comprehensive overview of explaining how NLP is used for search.\n1438,2020-06-15 11:06:35,Multimodal Meme Classification,UNITER has given state of the art results in various image-text related problems. This project aims at finetuning UNITER to solve Hateful memes challenge\n1453,2020-06-16 01:32:49,Interpretable Machine Learning for Computer Vision,\"Recent progress we made on visualization, interpretation, and explanation methodologies for analyzing both the data and the models in computer vision.\"\n1455,2020-06-16 02:32:53,Predicting Unintentional Action in Video,\"We introduce a dataset of in-the-wild videos of unintentional action, as well as a suite of tasks for recognizing, localizing, and anticipating its onset. \"\n1457,2020-06-16 02:46:25, Synthesizing High-Resolution Images with StyleGAN2,\"Developed by NVIDIA Researchers, StyleGAN2 yields state-of-the-art results in data-driven unconditional generative image modeling.\"\n1458,2020-06-16 02:51:13,PIFuHD: High-Resolution 3D Human Digitization ,\"This repository contains a pytorch implementation of \"\"Multi-Level Pixel-Aligned Implicit Function for High-Resolution 3D Human Digitization\"\".\"\n1460,2020-06-16 03:21:07,Instance Shadow Detection,Instance shadow detection aims to find shadow instances paired with object instances.\n1461,2020-06-16 03:24:02,Detectron2,FAIR's next-generation platform for object detection and segmentation.\n1473,2020-06-16 22:37:58,tslearn,A machine learning toolkit dedicated to time-series data.\n1475,2020-06-16 22:45:15,PyTorch3D,FAIR's library of reusable components for deep learning with 3D data.\n1476,2020-06-16 22:48:45,Course Review - Causal Inference,Types of understanding that causal inference researchers value.\n1478,2020-06-16 22:56:31,Unsupervised Learning of Probably Symmetric Deformable 3D Objects,\"A method to learn 3D deformable object categories from raw single-view images, without external supervision.\"\n1480,2020-06-16 23:06:13,A Guide to Natural Language Processing With AllenNLP,basics of using AllenNLP\n1482,2020-06-17 12:12:03,Real Time Object Detection using CNN YOLO,\"This project is done on real time object detection using a deep learning object detection algorithm i.e., YOLO.\"\n1483,2020-06-17 14:38:33,Short Notes on Model-Based Offline Reinforcement Learning (MOReL),Blog article on Model-Based Offline Reinforcement Learning (MOReL) paper by Rahul Kidambi & Aravind Rajeswaran et al.\n1491,2020-06-18 00:04:34,Image GPT: Generative Pretraining from Pixels, Transformers trained on pixel sequences can generate coherent image completions and samples.\n1492,2020-06-18 00:06:53,Q*BERT,Agents that build knowledge graphs and explore textual worlds by asking questions.\n1499,2020-06-18 13:41:39,History of Language Models - Alec Radford,A quick history of language models\n1502,2020-06-18 19:45:49,Generate Boolean (Yes/No) Questions From Any Content ,Question generation algorithm trained on the BoolQ dataset using T5 text-to-text transformer model.\n1504,2020-06-19 06:19:25,Fast Neural Style Transfer (feed-forward method) ⚡💻 + 🎨 = ❤️,This repo contains a concise PyTorch implementation of the original feed-forward NST paper.\n1505,2020-06-19 06:22:56,Diverse Image Generation via Self-Conditioned GANs,A simple but effective unsupervised method for generating realistic & diverse images using a class-conditional GAN model without using manually annotated class.\n1506,2020-06-19 06:26:17,Using GitHub Actions for MLOps & Data Science,A collection of resources on how to facilitate Machine Learning Ops with GitHub.\n1519,2020-06-20 05:40:46,Image and Bounding Box Annotation Slicer,This easy-to-use library slices (also resizes) images and its bounding box annotations into tiles of specific sizes or any arbitrary number of equal parts. ✂️\n1525,2020-06-20 16:21:38,Huggingtweets,This is a streamlit app built around the huggingtweets project. I fine-tune a pre-trained gpt2 model to tweet like a user given twitter handle.\n1528,2020-06-20 22:06:48,The Future of Computer Vision is Self-Supervised Learning,Talk by Yann Lecun on the applications of self-supervised learning on computer vision during CVPR 2020.\n1529,2020-06-20 22:11:14,Using Selective Attention in Reinforcement Learning Agents,\"In this work, we establish that self-attention can be viewed as a form of indirect encoding, which enables us to construct highly parameter-efficient agents.\"\n1539,2020-06-21 12:45:42,A Visual Guide to FastText Word Embeddings,A deep-dive into how FastText enriches word vectors with sub-word information\n1542,2020-06-21 20:46:12,Autocoder - Finetuning GPT-2 for Auto Code Completion,\"A basic and simple tool for code auto completion, built upon GPT-2\"\n1546,2020-06-22 00:46:32,DeepSNAP,Python library assists deep learning on graphs.\n1547,2020-06-22 00:50:30,RoBERTa meets TPUs,Understanding and applying the RoBERTa model to the current challenge.\n1549,2020-06-22 01:00:45,Deep Model-Based RL for Real-World Robotic Control,Short talk about model-based RL by Sergey Levine.\n1551,2020-06-22 03:17:48,Pokemon Classifier,I want to build a classifier that can classify 150 types of Pokemon.\n1552,2020-06-22 03:45:01,Workshop on Scalability in Autonomous Driving - Andrej Karpathy,An overview of autonomous driving and computer vision at Tesla.\n1560,2020-06-22 15:56:00,Battle-Tested Techniques for Scoping Machine Learning Projects,One of the challenges of managing an ML project is project scoping. Even small changes in data or architecture can create huge differences in model outputs.\n1563,2020-06-22 16:04:10,Classify photos in 600 classes using nine million Open Images,\"If you’re looking build an image classifier but need training data, look no further than Google Open Images.\"\n1569,2020-06-22 16:52:01,Trackable,The project deals with tracking humans in a narrow hallway under different lighting conditions.\n1571,2020-06-23 02:04:12,Stochastic Segmentation Networks,An efficient probabilistic method for modelling aleatoric uncertainty with any image segmentation network architecture.\n1575,2020-06-23 02:30:20,Deep Learning for Computer Vision ,Special topics class on deep learning for computer vision from the University of Michigan taught by Justin Johnson.\n1576,2020-06-23 02:37:15,VPSNet for Video Panoptic Segmentation,Video panoptic segmentation by generating consistent panoptic segmentation as well as an association of instance ids across video frames.\n1580,2020-06-24 03:00:16,What I Learned From Looking at 200 Machine Learning Tools,\"To better understand the landscape of available tools for machine learning production, I decided to look up every AI/ML tool I could find.\"\n1581,2020-06-24 03:04:31,Discovering Symbolic Models from Deep Learning w/ Inductive Bias,A general approach to distill symbolic representations of a learned deep model by introducing strong inductive biases.\n1585,2020-06-24 03:18:20,Breaking the cycle—Colleagues are all you need,A novel approach to performing image-to-image translation between unpaired domains.\n1587,2020-06-24 03:25:25,Deep Learning Based Text Classification: A Comprehensive Review,An overview of deep learning approaches to text classification.\n1589,2020-06-24 03:33:09,jiant,A software toolkit for research on general-purpose text understanding models.\n1592,2020-06-24 04:27:58,Text Classification,\"Re-implemented an article (link is given below) which was on Text classification with CNN, beside this I tried out some ML classification algorithm.\"\n1595,2020-06-24 15:42:20,multi-task-NLP,A utility toolkit enabling NLP developers to easily train and infer a single model for multiple tasks.\n1597,2020-06-25 00:17:39,Maximizing Business Impact with Machine Learning,how to effectively leverage machine learning to build intelligent products as efficiently as possible.\n1598,2020-06-25 00:29:18,Automatic Data Augmentation for  Generalization in Deep RL,We compare three approaches for automatically finding an appropriate augmentation combined with two novel regularization terms for the policy and value function\n1599,2020-06-25 00:42:36,High-Fidelity Generative Image Compression,How to combine Generative Adversarial Networks and learned compression to obtain a state-of-the-art generative lossy compression system.\n1602,2020-06-25 04:03:38,Unet Model for Image Segmentation With EfficientNet Encoder,Implemented using tensorflow 2.2.0 with custom train and test step.\n1603,2020-06-25 10:40:56,A Million of ML Predictions at the Tip of Your Fingers,Announcement - SashiDo is breaking the barrier to Machine Learning by introducing a fully open-sourced Content Moderation Service.\n1605,2020-06-26 02:19:39,NetHack Learning Environment (NLE),A procedurally-generated grid-world dungeon-crawl game that strikes a great balance between complexity and speed for single-agent RL research.\n1606,2020-06-26 02:24:53,Paraphrase Generation Using T5 model,Simple application using T5 base model fine tuned in Quora Question Pairs to generate paraphrased questions.\n1607,2020-06-26 02:28:15,Message Passing Query Embedding,\"MPQE is a model for answering complex queries over knowledge graphs, that learns embeddings of entities in the knowledge graph, & embeddings for variable types.\"\n1608,2020-06-26 02:31:17,Quantifying Attention Flow in Transformers,\"I explain two simple but effective methods, called Attention Rollout and Attention Flow\"\n1614,2020-06-27 04:15:51,Natural Language Processing Roadmap,Roadmap for learning NLP topics.\n1615,2020-06-27 04:29:04,Weight Poisoning Attacks on Pre-trained Models,\"How Bert can be infused with nefarious behavior, even after fine-tuning.\"\n1616,2020-06-27 04:37:16,Leveraging Temporal Context for Object Detection,\"Object detection architecture leveraging contextual clues across time for each camera deployment in a network, improving recognition of objects\"\n1617,2020-06-27 04:42:47,Expressive Power of Graph Neural Networks,\"Graph isomorphism problem, the Weisfeiler-Lehman heuristic for graph isomorphism testing, and how it can be used to analyse the expressive power of GNNs.\"\n1620,2020-06-27 10:27:43,rlx: A modular Deep RL library for research,\"\"\"rlx\"\" is a Deep RL library written on top of PyTorch & built for educational and research purpose.\"\n1622,2020-06-27 14:18:13,Building AI Trading Systems,Lessons learned building a profitable algorithmic trading system using Reinforcement Learning techniques.\n1623,2020-06-27 14:20:49,Introduction to NLP using Fastai,Implementing and decoding the revolutionary ULMFiT approach to train a language model on any downstream NLP task.\n1629,2020-06-28 07:37:00,TF Lite Semantic Segmentation Models,Faster and lighter TF Lite models can perform semantic segmentation.\n1630,2020-06-28 07:40:40,Semantic Segmentation + Background Removal + Style Transfer,\"Running multiple TF Lite models to perform semantic segmentation, remove background, and apply style transfer. \"\n1636,2020-06-29 00:00:47,Automatic translation of the SQUAD dataset to spanish,\"Machine translation is used on the SQuAD dataset to produce an equivalent dataset in Spanish. Word alignment is applied to produce a synthetic spanisQA corpus.\r\n\"\n1638,2020-06-29 02:56:43,Dakshina Dataset,A collection of text in both Latin and native scripts for 12 South Asian languages.\n1639,2020-06-29 02:58:52,Computer Vision Recipes,This repository provides examples and best practice guidelines for building computer vision systems.\n1644,2020-06-29 12:42:44,A research guide for data scientists,Tips on research from top data scientists\n1645,2020-06-29 17:16:17,Using Data Science Pipelines for Disaster Response,Uses ETL and ML pipeline to build an NLP system for classification of messages into appropriate disaster categories\n1646,2020-06-29 19:47:58,Twitter Turing Test,Can you guess whether this tweet is written by a human or generated by a neural network?\n1648,2020-06-30 02:34:54,STUMPY: A Powerful and Scalable Python Library for Time Series,\"STUMPY is a powerful and scalable Python library for computing a Matrix Profile, which can be used for a variety of time series data mining tasks.\"\n1649,2020-06-30 02:39:32,Model Serving using FastAPI and streamlit,Simple example of usage of streamlit and FastAPI for ML model serving.\n1650,2020-06-30 02:49:57,The Reformer - Pushing the Limits of Language Modeling,An in-depth understanding of each of the key features of the Reformer.\n1651,2020-06-30 02:52:41,High-Resolution Image Inpainting,\"High-Resolution Image Inpainting with Iterative Confidence Feedback and Guided Upsampling.\r\n\"\n1653,2020-06-30 03:01:50,MARGE: Pre-training via Paraphrasing,\"A retrieval model maps a document to a set of related documents, which a reconstruction model paraphrases to maximize the likelihood of the original. \"\n1657,2020-06-30 18:00:11,Fast Api with Dockerization of your ML Models,In this GitHub repo you can able to know and learn how to build a fast API for testing your ML model and can test your ML model with UI and to Dockerize your ML\n1658,2020-07-01 02:22:10,SimCLR - Contrastive Learning of Visual Representations,How to load pretrained/finetuned SimCLR models from hub modules for fine-tuning.\n1662,2020-07-01 07:00:50,Image synthesis at CVPR 2020,An overview of the different approaches to image synthesis at CVPR 2020.\n1663,2020-07-01 07:08:45,Sktime,A python toolbox for machine learning with time series.\n1664,2020-07-01 07:14:00,\"Sentiment Analysis: Key Milestones, Challenges and New Directions\",\"An overview of sentiment analysis, it's progress and what's ahead.\"\n1666,2020-07-01 07:20:52,Serverless BERT with HuggingFace and AWS Lambda,\"Build a serverless question-answering API with BERT, HuggingFace, the Serverless Framework, and AWS Lambda.\"\n1668,2020-07-01 13:33:49,Model-based Reinforcement Learning: A Survey,\"A survey of the integration of both fields, better known as model-based reinforcement learning.\"\n1677,2020-07-02 04:06:19,Building Level 3 Conversational AI Assistants,\"Presentations, panels, and fireside chats addressing all topics related to the creation of Level 3 AI assistants.\"\n1678,2020-07-02 12:13:19,NSFW Image Classification REST API built with TensorFlow.JS,A ready-to-use & open-source NSFW Image Classification REST API built with TensorFlow.JS and NSFW.JS for effortless Content Moderation\n1688,2020-07-03 04:23:58,Python Implementation of Reinforcement Learning: An Introduction ,\"Plot replications, exercise solutions and Anki flashcards for the entire book by chapters.\"\n1691,2020-07-03 04:40:05,The Simplest Way to Serve your NLP Model in Production w/ Python ,\"From scikit-learn to Hugging Face Pipelines, learn the simplest way to deploy ML models using Ray Serve.\"\n1698,2020-07-04 01:07:48,Learning to Cartoonize Using White-box Cartoon Representations,An approach for image cartoonization using GANs.\n1699,2020-07-04 01:10:18,Reinforcement Learning Tutorial,\"Important reinforcement learning (RL) algorithms, including policy iteration, Q-Learning, and Neural Fitted Q.\"\n1702,2020-07-04 04:51:18,Face Recognition Techniques,Face Detection and Recognition techniques using traditional CV and also using new deep learning method.\n1704,2020-07-04 10:42:53,LSTM Forecast Model for Stock Price Prediction using Keras,\" Easy to understand LSTM forecast model for Stock Price Prediction. The dataset contains daywise details of the GOOGL stock from May,2019-May 2018.\"\n1706,2020-07-04 11:05:28,PokeZoo,A deep learning based web-app developed using the MERN stack and Tensorflow.js.\n1710,2020-07-05 05:47:35,NLP-task-visualizer-app,This application designed with streamlit library will help in visualizing NLP tasks on text entered by you.\n1721,2020-07-07 04:21:20,TensorflowTTS,Real-Time State-of-the-art Speech Synthesis for Tensorflow 2.\n1722,2020-07-07 04:23:38,spaczz: Fuzzy matching and more for spaCy,Fuzzy matching and more functionality for spaCy.\n1723,2020-07-07 04:26:45,BioSyn,Biomedical Entity Representations with Synonym Marginalization\n1724,2020-07-08 04:02:50,Image Classifier: In the Browser,Using Tensorflow.js to make the prediction directly in the browser.\n1726,2020-07-08 04:15:07,Photon: A Robust Cross-Domain Text-to-SQL System,\"A robust, modular, cross-domain NLIDB that can flag natural language input to which a SQL mapping cannot be immediately determined. \"\n1728,2020-07-08 04:24:07,Bounding Box Prediction from Scratch using PyTorch,Multi-Task learning — Bounding Box Regression + Image Classification\n1729,2020-07-08 04:28:13,Comment Classification Using BERT (multi-language) Fine-Tuning,We are going to use BERT layer in a model applying Keras.\n1730,2020-07-08 04:30:28,TextBrewer,a PyTorch-based model distillation toolkit for natural language processing.\n1737,2020-07-08 18:22:40,codeBERT - Automated code docstring review with transformers,\"codeBERT provide a one command line to check if your code docstrings are up-to-date.\r\n\"\n1748,2020-07-09 02:23:25,Continuous Machine Learning (CML),CML helps to organize MLOps infrastructure on top of the traditional software engineering stack instead of creating separate AI platforms.\n1750,2020-07-09 10:30:30,picTranslate: Seamless live Image Text translator,\"Given an image with text on it, this app can give you a new image with text modified into a different language.\"\n1753,2020-07-10 02:44:11,TUDatasets,A collection of benchmark datasets for graph classification and regression.\n1754,2020-07-10 02:46:07,Full Stack Deep Learning,Full Stack Deep Learning helps you bridge the gap from training machine learning models to deploying AI systems in the real world.\n1755,2020-07-10 02:51:24,Easy OCR,\"Ready-to-use OCR with 40+ languages supported including Chinese, Japanese, Korean and Thai.\r\n\r\n\"\n1759,2020-07-10 18:54:54,Emotion Recognition from Tom and Jerry videos,\"Developed an application that classifies the emotion depicted by Tom and Jerry in each frame into one of the following : happy, angry, sad or suprised.\"\n1767,2020-07-11 05:05:31,Imagenette,Imagenette is a subset of 10 easily classified classes from Imagenet.\n1768,2020-07-11 05:08:02,TextAugment,Improving Short Text Classification through Global Augmentation Methods\n1769,2020-07-11 05:10:10,niacin,\"A Python library for replacing the missing variation in your text data.\r\n\r\n\"\n1771,2020-07-11 05:16:17,Albumentations,Fast image augmentation library and easy to use wrapper around other libraries.\n1772,2020-07-11 05:19:05,Augmentor,Image augmentation library in Python for machine learning.\n1777,2020-07-11 05:37:12,tsfresh,Automatic extraction of relevant features from time series.\n1792,2020-07-11 06:28:58,Anomaly Detection Toolkit (ADTK),\"A Python toolkit for rule-based/unsupervised anomaly detection in time series\r\n\r\n\"\n1795,2020-07-11 06:37:35,Chakin ,Simple downloader for pre-trained word vectors.\n1796,2020-07-11 06:39:39,Top2Vec,\"Top2Vec learns jointly embedded topic, document and word vectors.\r\n\r\n\"\n1797,2020-07-11 06:42:29,Contextualized Topic Models,A python package to run contextualized topic modeling.\n1800,2020-07-11 06:51:58,jellyfish,🎐 a python library for doing approximate and phonetic matching of strings.\n1802,2020-07-11 06:57:28,SentencePiece,\"Unsupervised text tokenizer for Neural Network-based text generation.\r\n\r\n\"\n1803,2020-07-11 06:59:08,A Deep Dive into the Wonderful World of Preprocessing in NLP,A glimpse into the surprisingly deep and interesting world of preprocessing in NLP.\n1813,2020-07-11 07:45:01,Pytest,\"The pytest framework makes it easy to write small tests, yet scales to support complex functional testing\r\n\r\n\"\n1817,2020-07-11 07:55:23,Artifacts - Weights & Biases,\"Effortless pipeline tracking and production model management\r\n\r\n\"\n1818,2020-07-11 08:07:35,DeepkitAI,The Open-Source Machine Learning Devtool and Training Suite.\n1819,2020-07-11 08:14:03,Neptune.ai,The most lightweight experiment management tool that fits any workflow.\n1820,2020-07-11 08:17:17,Rasa,An open source machine learning framework to automate text-and voice-based conversations.\n1831,2020-07-11 11:36:26,TF Sprinkles,Fast and efficient sprinkles augmentation implemented in TensorFlow.\n1834,2020-07-11 17:19:43,Laplacian Pyramid Reconstruction and Refinement for Semantic Seg., Pytorch implementation of multi-resolution reconstruction architecture based on a Laplacian pyramid that uses skip connections.\n1836,2020-07-11 18:15:19,Training a pets detector model with TFOD API (TF 2),\"In this notebook, we will be training a custom object detection model using the latest TensorFlow Object Detection (TFOD) API which is based on TensorFlow 2.2. \"\n1840,2020-07-12 00:59:27,TensorFlow 2 meets the Object Detection API,TF Object Detection API (OD API) officially supports TensorFlow 2!\n1843,2020-07-12 13:35:20,Cortex,Build machine learning APIs.\n1844,2020-07-12 16:24:10,Semi-Supervised Learning in Computer Vision,A comprehensive overview of recent semi-supervised learning methods in Computer Vision\n1845,2020-07-12 21:42:52,Face Predicting Web App,Interactive Deep Learning Model that utilizes your computer webcam to predict your age and gender in seconds!\n1847,2020-07-13 03:46:32,Driver Identification Based on Vehicle's telematics data,\"In this paper, we proposed a deep learning model, which can identify drivers from their driving behaviors based on vehicle telematics data.\"\n1848,2020-07-13 05:00:40,Comprehensive analysis of important metrics in ML,\"In this work, the authors present a comprehensive analysis of important metrics in practical applications.\"\n1851,2020-07-13 15:21:13,StreamAlert,\"A serverless, realtime data analysis framework which empowers you to ingest, analyze, and alert on data from any environment, using datasources and alerts.\"\n1855,2020-07-14 03:17:25,ULMFiT Airline Sentiment Analysis,Transfer Learning using pretrained ULMFiT model\n1856,2020-07-14 03:21:00,DeepDream Video Style Transfer,DeepDream on Video\n1859,2020-07-14 04:01:18,\"You Trained a Machine Learning Model, Now What?\",\"Three often overlooked parts of this process occur after the model is actually built: model evaluation, deployment, and monitoring.\"\n1860,2020-07-14 09:53:19,NSFW Image Moderation Automation Engine built with TensorFlow.JS ,\"An open-source NSFW Image Classifier including an Automation Engine for fast deletion & moderation built with Node.js, TensorFlow, and Parse Server\"\n1865,2020-07-14 22:55:08,PDFTableExtract,Build a parser to extract the table in PDF document with RetinaNet\n1867,2020-07-14 23:03:02,YOLOv4 With TensorFlow,\"YOLOv4, YOLOv4-tiny, YOLOv3, YOLOv3-tiny Implemented in Tensorflow 2.0, Android. Convert YOLO v4 .weights tensorflow, tensorrt and tflite.\"\n1868,2020-07-15 03:52:31,Selfie2Anime with TFLite,An end-to-end tutorial with TensorFlow Lite for Selfie2Anime (U-GAT-IT).\n1869,2020-07-15 20:31:37,Bridging PyTorch and TVM,\"Taking Hugging Face transformer BERT from PyTorch and running it on\r\nApacheTVM for both inference (with reasonable timings) and training.\"\n1871,2020-07-16 03:58:21,Summarize a webapge,A Flask application that extracts and summarizes webpage using Natural Language Processing. Powered by nlp-akash.\n1872,2020-07-16 04:19:37,An Icon Classifier with TensorFlow Lite Model Maker,An Icon Classifier with TensorFlow Lite Model Maker\n1879,2020-07-16 17:40:33,Cross-lingual Transfer Learning - Sebastian Ruder,\"An overview of approaches that transfer knowledge across languages and enable us to scale NLP models to more of the world's 7,000 languages.\"\n1880,2020-07-16 17:43:48,AdapterHub: A Framework for Adapting Transformers,Huggingface Transformers + Adapters\n1882,2020-07-16 17:51:48,Object Detection with RetinaNet,Implementing RetinaNet: Focal Loss for Dense Object Detection.\n1884,2020-07-17 01:41:33,Deploying your ML Model with TorchServe,\"In this talk, Brad Heintz walks through how to use TorchServe to deploy trained models at scale without writing custom code. \"\n1886,2020-07-17 08:27:56,Medical Zoo - 3D Multi-modal Medical Image Segmentation,My articles on deep learning in medical imaging\n1887,2020-07-17 16:48:13,Computer Vision Pretrained Models,A collection of computer vision pre-trained models.\n1889,2020-07-17 17:20:20,NLP Pretrained Models,\"A collection of Natural language processing pre-trained models.\r\n\r\n\"\n1896,2020-07-19 00:40:37,Machine Learning Production Pipeline,\"Project Flow and Landscape\r\n\"\n1898,2020-07-19 00:47:53,Tempering Expectations for GPT-3 and OpenAI’s API,\"A closer look at the \"\"magic\"\" behind GPT-3 and caveats to be aware of.\"\n1899,2020-07-19 03:59:41,StyleGAN Encoder,Encodes real images into the latent space of a StyleGAN model.\n1900,2020-07-19 04:12:40,WikiArt StyleGAN 2 Model,A conditional StyleGAN 2 model trained on images from WikiArt\n1902,2020-07-19 10:19:24,Indian Paper Currency Prediction,\"The trained model takes an image (Indian Paper Currency) as an input and predict the class of image from 10, 20, 50, 100, 200, 500, 2000 denomination.\"\n1903,2020-07-19 11:31:25,\"Neural Style Transfer (Gatys et al., PyTorch)\",My implementation of the original neural style transfer paper by Gatys et al. (In PyTorch).\n1904,2020-07-19 12:44:53,Implementation of Face Net  in TensorFlow -  2.0,This repository is a naive unofficial  implementation of Face Net paper  - 2015 .This implementation opts online mode of semi - hard triplet mining.\n1910,2020-07-19 15:44:21,Azure Machine Learning Template,Azure Machine Learning template for MNIST classifier\n1913,2020-07-19 16:55:33,Teachable Machine (Image Classifier),A teachable image classifier that runs on any browser built using TensorFlow JS.\n1914,2020-07-19 16:59:37,TensorFlow JS- Object Detection in Browser,A real-time object detection model in your browser using TensorFlow JS.\n1916,2020-07-20 00:01:38,How to Stop Worrying About Compositionality,\"Review the tenets of compositionality, and to highlight how each theory has evolved to match particular theoretical positions about the nature of language.\"\n1918,2020-07-20 05:48:38,Spacy-Go,spacy-go is Golang interface for accessing linguistic annotations provided by spaCy using Google's gRPC. This module only supports basic functionalities like lo\n1919,2020-07-20 05:53:12,Dframcy,DframCy is a light-weight utility module to integrate Pandas Dataframe to spaCy's linguistic annotation and training tasks.\n1921,2020-07-20 14:04:48,NSFW Image Moderation Admin App with ReactJS,\"A fully-functional NSFW Admin Application for simplified image classification & moderation built with Node.js, TensorFlow.js, and React\"\n1923,2020-07-20 18:59:04,PyTorch Geometric Temporal,A Temporal Extension Library for PyTorch Geometric\n1924,2020-07-20 20:34:47,Why is it Important to Monitor Machine Learning Models?,The importance of monitoring and how monitoring ML is different from application performance management (APM).\n1925,2020-07-20 20:54:00,PyTorch Implementation of PaletteNet,\"PyTorch implementation of PaletteNet: Image Recolorization with Given Color Palette (Cho et al., 2017).\"\n1927,2020-07-20 21:21:12,ECG arrhythmia classification using a convolutional neural net,This is an implementation of the paper on ECG arrhythmia classification https://arxiv.org/pdf/1804.06812.pdf.\n1929,2020-07-20 23:55:33,Structured Self Attention,Implementation for the paper A Structured Self-Attentive Sentence Embedding (https://arxiv.org/abs/1703.03130 ). Model interpretability / explainability.\n1933,2020-07-21 01:42:42,TurboTransformers,A fast and user-friendly runtime for transformer inference on CPU and GPU.\n1938,2020-07-21 11:50:53,Rasa NLU Examples,Experimental components for Rasa NLU pipelines.\n1940,2020-07-21 19:01:54,Change Detection using Siamese networks,\"The blog is a primer on Siamese Networks and how they're used for observing change in satellite images over time, or observing facial changes as people age\"\n1941,2020-07-21 19:13:05,My Artificial Intelligence Bookmarks,\"A curated list of my reads, implementations, and core concepts of Artificial Intelligence, Deep Learning, Machine Learning by best folk in the world.\"\n1943,2020-07-22 03:32:30,Do we Need Deep Graph Neural Networks?,Does depth in graph neural network architectures bring any advantage?\n1945,2020-07-22 03:39:13,Pandera,A flexible and expressive pandas data validation library.\n1952,2020-07-24 06:28:15,TensorFlow Serving,\"A flexible, high-performance serving system for machine learning models, designed for production environments. \"\n1953,2020-07-24 06:30:44,BentoML,BentoML is an open-source framework for high-performance ML model serving.\n1954,2020-07-24 06:43:59,Azure ML,MLOps using Azure ML.\n1955,2020-07-24 06:47:29,Shape and Viewpoint without Keypoints,\"Recover the 3D shape, pose and texture from a single image, trained on an image collection without any ground truth 3D shape, multi-view, camera viewpoints.\"\n1965,2020-07-25 02:58:40,model-logger,Model-Logger is a Python library for storing model's profile and rapid inter model comparison.\n1968,2020-07-26 04:48:40,Sentiment Analysis With Transformers,\"Sentiment analysis neural network trained by fine-tuning BERT, ALBERT, or DistilBERT on the Stanford Sentiment Treebank.\"\n1971,2020-07-27 02:30:42,Attention based YOLO: Object Detection,\"An easy to follow, YOLO implementation with keras lib.  Used a attention based architecture to extract more fine grained information about object.\"\n1977,2020-07-27 14:14:10,LabelDetection: simplifying the use and construction of deep dete,LabelDetection is a graphical tool that aims to facilitate all the steps required in the pipeline to construct and use a deep-learning base object detection mod\n1978,2020-07-27 14:34:12,How to Set Up a Python Project For Automation and Collaboration,\"How to set up a Python repo with unit tests, code coverage, lint checking, type checking, Makefile wrapper, and automated build with GitHub Actions.\"\n1980,2020-07-27 14:51:03,Understanding & Implementing SimCLR - an ELI5 guide,\"I explain the SimCLR and its contrastive loss function step by step, build image embeddings and then show how to use them to train image classifier on top.\"\n1983,2020-07-28 04:14:12,CoreML Model Zoo,Collection of unified and converted pre-trained models.\n1984,2020-07-28 04:18:00,How GPT3 Works - Visualizations and Animations,A compilation of my threads explaining GPT3.\n1985,2020-07-28 04:19:58,Temporal Graph Networks,\"In this post, we describe Temporal Graph Network, a generic framework for deep learning on dynamic graphs.\"\n1986,2020-07-28 07:44:13,Behavioral Testing of NLP models with CheckList,An overview of the “CheckList” framework for fine-grained evaluation of NLP models\n1992,2020-07-29 03:41:04,Time series forecasting,A thorough introduction to time series forecasting using TensorFlow.\n1993,2020-07-29 04:47:55,Real-time text detection with EAST in TFLite,Demonstrates the conversion process from the original EAST model to TFLite and how to use it on static images and also on real-time video feeds.\n1994,2020-07-29 04:51:30,Understanding the Effectivity of Ensembles in Deep Learning,\"The report explores the ideas presented in Deep Ensembles: A Loss Landscape Perspective by Stanislav Fort, Huiyi Hu, and Balaji Lakshminarayanan.\"\n1999,2020-07-30 03:57:32,Small differences in BLEU are meaningless,Only big differences in metric scores are meaningful in MT.\n2002,2020-07-30 04:08:46,Multi-target in Albumentations,\"Many images, many masks, bounding boxes, and key points. How to transform them in sync?\"\n2005,2020-07-30 11:19:02,Social Distance Detection,\"If people are very close to each other, a red bounding box is displayed around them indicating that they are not maintaining social distance.\"\n2006,2020-07-30 11:30:56,Deep Learning Techniques for NLP in Healthcare,A talk discussing the recent advancements of deep learning to facilitate the adaption of NLP in the healthcare domain.\n2008,2020-07-30 14:50:30,Extension to block NSFW content using AI,\"NSFW Filter is an extension that blocks NSFW content from your browser.\r\nIt uses a computer vision model to detect NSFW content and hides it from the user.\"\n2009,2020-07-30 14:55:57,ATLASS: AutoML using Transfer and Semi-Supervised Learning,\"This repository includes the code, application, and notebooks for the work \"\"AutoML using Transfer and Semi-Supervised Learning\"\". The tools presented here can be\"\n2012,2020-07-30 15:04:28,LabelStoma: stomata detection using YOLO,LabelStoma is a graphical image tool for automatically detecting stomata in images.\n2013,2020-07-30 15:07:54,DeepClas4Bio,DeepClas4Bio is a project that aims to facilitate the interoperability of bioimaging tools with deep learning frameworks.\n2016,2020-07-31 15:30:38,Meme Classifier Using TFlite and flutter,Meme classifier using fine tuned mobilenet. This app showcases how you can perform low latency realtime classification apps using TFlite\n2020,2020-08-01 12:14:26,Text Summarization using TF-IDF Algorithm,This Article explains the TF-IDF algorithm and shows the implemtnation from scratch to summarize the text.\n2022,2020-08-01 14:41:37,Simple Transformers,\"Transformers for Classification, NER, QA, Language Modeling, Language Generation, T5, Multi-Modal, and Conversational AI.\"\n2024,2020-08-01 14:49:31,DeText: A Deep Neural Text Understanding Framework,DeText: A Deep Neural Text Understanding Framework for Ranking and Classification Tasks.\n2026,2020-08-01 15:04:37,Efficient Serverless Deployment of PyTorch Models on Azure,A tutorial for serving models cost-effectively at scale using Azure Functions and ONNX Runtime.\n2027,2020-08-01 15:27:29,Nearest Celebrity Face,Implementation of FaceNet: A Unified Embedding for Face Recognition and Clustering to find the celebrity whose face matches the closest to yours. The input face\n2030,2020-08-02 12:38:08,A Few Favorite Recipes in Computer Vision & Deep Learning,This blog post enlists a few of my favorite recipes in deep learning in the context of computer vision (as of August 2020).\n2031,2020-08-02 14:46:10,NeuralQA - API and Visual Interface for Extractive QA,A Usable Library for Question Answering on Large Datasets with BERT\n2032,2020-08-02 20:00:23,Object tracking in 75 lines of code,\"Object tracking is straightforward conceptually. And if you have a good detector, simple methods can be pretty effective.\"\n2033,2020-08-03 03:49:22,FARM: Framework for Adapting Representation Models,🏡 Fast & easy transfer learning for NLP. Harvesting language models for the industry.\n2035,2020-08-04 02:49:24,Act - GitHub Actions locally,Run your GitHub Actions locally.\n2038,2020-08-04 03:53:36,Curated papers & articles on DS & ML in production,\"Learn how organizations & business solved machine learning problems, including problem statement, research, methodology, and results.\"\n2039,2020-08-04 16:45:09,Tensorflow2 Object Detection Tutorial,\"In this tutorial, we will be going step by step the complete training process of Tensorflow2 Object Detection. \"\n2042,2020-08-05 02:07:24,ONNX T5,\"Summarization, translation, Q&A, text generation and more at blazing speed using a T5 version implemented in ONNX.\"\n2043,2020-08-05 02:17:10,DeLighT: Very Deep and Light-weight Transformers,Similar or better performance than transformer-based models with significantly fewer parameters\n2045,2020-08-05 06:40:32,Evaluation Metrics For Information Retrieval,Learn about common metrics used to evaluate performance of information retrieval systems\n2047,2020-08-05 15:18:46,Test-Time Data Augmentation,Tutorial on how to properly implement test-time image data augmentation in a production environment with limited computational resources.\n2048,2020-08-05 16:50:22,SadedeGel: An extraction based Turkish news summarizer,\"\"\"Sadede Gel\"\" in Turkish, means \"\"cut to the chase\"\".  \"\n2051,2020-08-05 20:13:51,MobyDick word frequency,Getting the count of the words in Moby Dick story using both web scraping and NLP\n2053,2020-08-05 20:30:33,Image Classification with Keras,Build a pipeline to train an image classifier in Keras and tune hyperparameters to optimize the performance of our classifier.\n2054,2020-08-05 20:34:09,Dropout in PyTorch – An Example,\"An example of adding Dropout to a PyTorch model, and observe the effect dropout has on the model's performance by tracking our models in Weights & Biases.\"\n2057,2020-08-06 04:06:11,\"Data Science Meets Devops: MLOps with Jupyter, Git, & Kubernetes\",\"An end-to-end example of deploying a machine learning product using Jupyter, Papermill, Tekton, GitOps and Kubeflow.\"\n2061,2020-08-06 04:59:21,Detectron 2 Demo from Facebook,This Project contains the process of getting started with Facebook FAIR's detectron2 project on windows 10 without any Nvidia GPU.\n2062,2020-08-06 12:38:55,Predict Vehicle Speed From Dash Cam Video,A series of experiments attempting to predict vehicle speed from dash cam videos using optical flow and neural networks.\n2098,2020-08-06 23:15:45,Digital Image Processing in Python,Play around with pixel values with Python programming language.\n2100,2020-08-07 04:24:28,A 2020 guide to Semantic Segmentation,\"Concept of image segmentation, discuss the relevant use-cases, different neural network architectures involved in achieving the results, metrics and datasets.\"\n2106,2020-08-08 15:06:18,Fast NST for Videos (+ person segmentation) 🎥 + ⚡💻 + 🎨 = ❤️,Create NST videos and pick separate styles for the person in the video and for the background.\n2109,2020-08-09 07:24:57,Live demo : State-of-the-art MCQ Generator from any content,\"Demo for state-of-the-art MCQ (Multiple Choice Questions) generator from any content built using T5 transformer, HuggingFace, and Sense2vec\r\n\"\n2111,2020-08-10 03:26:16,InvoiceNet,\"Deep neural network to extract intelligent information from PDF invoice documents.\r\n\"\n2112,2020-08-10 03:41:31,Search for visual datasets,\"By task, application, class, label or format.\"\n2113,2020-08-10 04:01:03,GAN-BERT,Enhancing the BERT training with Semi-supervised Generative Adversarial Networks.\n2114,2020-08-10 04:03:51,tsaug,A Python package for time series augmentation.\n2116,2020-08-10 04:15:38,Machine Learning Pipelines for Kubeflow.,Kubeflow pipelines are reusable end-to-end ML workflows built using the Kubeflow Pipelines SDK.\n2117,2020-08-10 04:17:57,Structuring Unit Tests in Python,\"Where to put tests, how to write fixtures and the awesomeness of test parametrization.\"\n2121,2020-08-10 21:59:41,DeepR — Training TensorFlow Models for Production,DeepR is a Python library to build complex pipelines as easily as possible on top of Tensorflow.\n2124,2020-08-11 00:20:42,Neural Architecture Search,\"A look at neural architecture search w.r.t search space, search algorithms and evolution strategies.\"\n2135,2020-08-13 01:52:06,Temporal Convolutional Networks for Time-Series,\"We introduce several novels using TCN, including improving traffic prediction, sound event localization & detection, and probabilistic forecasting.\"\n2136,2020-08-13 02:05:11,Machine Learning Deployment: Shadow Mode,\"“How do I test my new model in production?” One answer, and a method I often employ when initially deploying models, is shadow mode.\"\n2138,2020-08-13 18:12:46,Extract Stock Sentiment from News Headlines,\" In this project, you will generate investing insight by applying sentiment analysis on financial news headlines from Finviz. \"\n2141,2020-08-14 03:15:38,hloc - the hierarchical localization toolbox,Visual localization made easy.\n2147,2020-08-15 01:17:07,Practical Tips and Tricks for Successful Transfer Learning,Training models to learn knowledge and skills from other related tasks that will transfer and boost performance on tasks of interest.\n2148,2020-08-15 01:22:01,txtai: AI-powered search engine,AI-powered search engine.\n2151,2020-08-15 05:32:22,Drowsiness Detection System using OpenCV and Flask in Python ,\"This system provides an overview of a system that detects whether a person is drowsy while driving and if so, alerts him by using voice messages in real-time. \"\n2155,2020-08-15 14:49:16,\"GPT-3, The model simply knows!\",Brief Introduction about the gigantic GPT-3. a new leap in AI and Natural Language processing.\n2159,2020-08-16 01:02:18,Solaris,CosmiQ Works Geospatial Machine Learning Analysis Toolkit.\n2163,2020-08-17 03:19:46,Safe Space - Github Action,Github action that checks the toxicity level of comments and PR reviews to help make repos safe spaces.\n2164,2020-08-17 03:24:46,Intro to Autoencoders,\"This tutorial introduces autoencoders with three examples: the basics, image denoising, and anomaly detection.\"\n2166,2020-08-17 05:19:41,Pix2Pix,\"Tensorflow 2.0 Implementation of the paper Image-to-Image Translation using Conditional GANs by Philip Isola, Jun-Yan Zhu, Tinghui Zhou and Alexei A. Efros.\"\n2167,2020-08-17 06:27:31,Insight,Project Insight is designed to create NLP as a service with code base for both front end GUI (streamlit) and backend server (FastAPI) the usage of transformers\n2168,2020-08-17 10:55:43,Onceupon.space,NLP experiment in story-telling  that creates illustrations (text to sketch) and content (text generation)\n2173,2020-08-18 04:16:33,Fine-tuning with custom datasets,This tutorial will take you through several examples of using 🤗 Transformers models with your own datasets.\n2185,2020-08-18 23:12:27,Language Interpretability Tool (LIT),\"The Language Interpretability Tool (LIT) is a visual, interactive model-understanding tool for NLP models.\"\n2188,2020-08-19 15:16:46,Great Expectations,Always know what to expect from your data.\n2193,2020-08-20 00:39:05,Effective testing for machine learning systems,\"Why testing machine learning systems can be different, and discuss some strategies for writing effective tests for machine learning systems.\"\n2202,2020-08-22 03:55:27,Graph Representation Learning Book,\"Introduction to graph representation learning, including methods for embedding graph data, graph neural networks, and deep generative models of graphs.\"\n2203,2020-08-22 05:58:20,Image Similarity Search in PyTorch,\"Simple Convolutional Auto-encoder based image similarity\r\nsearch to find similar images to given image or features.\r\nFully written in PyTorch.\"\n2204,2020-08-22 17:19:00,Tensorflow Object Detection with Tensorflow 2,Object Detection with Tensorflow 2 and the Tensorflow Object Detection API\n2207,2020-08-23 04:38:45,Rules of Machine Learning: Best Practices for ML Engineering,A basic knowledge of machine learning get the benefit of best practices in machine learning from around Google.\n2214,2020-08-24 11:16:47,vedaseg,vedaseg is an open source semantic segmentation toolbox based on PyTorch.\n2215,2020-08-24 11:52:10,vedastr,vedastr is an open source scene text recognition toolbox based on PyTorch.\n2218,2020-08-25 13:57:49,CascadeTabNet,\"An approach for end-to-end table detection and structure recognition from image-based documents\r\n\"\n2220,2020-08-25 16:13:31,\"Table Detection, Information Extraction and Structuring using ML\",Table Extraction (TE) is the task of detecting and decomposing table information in a document.\n2223,2020-08-26 04:21:37,AxCell,Automatic Extraction of Results from Machine Learning Papers\n2226,2020-08-27 01:54:16,Hyperparameter Optimization for 🤗 Transformers: A Guide,\"Basic grid search is not the most optimal, and in fact, the hyperparameters we choose can have a significant impact on our final model performance.\"\n2235,2020-08-27 16:03:12,Shift-Ctrl-F: Semantic Search for the Browser,🔎: Search the information available on a webpage using natural language instead of an exact string match.\n2238,2020-08-28 01:24:08,Spinning Up in Deep RL (OpenAI),An educational resource to help anyone learn deep reinforcement learning.\n2239,2020-08-28 07:07:39,An Introduction to Adversarial Examples in Deep Learning,\"This report provides an intuitive introduction to adversarial examples, discusses a wide variety of different adversarial attacks and, most notably, provides ad\"\n2242,2020-08-29 08:10:21,Deep dive into ROI layer in Object Detection Models,In this blog post we will implement in torch ROI Pool and ROI Align models from scratch.\n2245,2020-08-30 02:51:07,On the Bottleneck of Graph Neural Networks and its Implications,The mechanism of propagating information between neighbors creates a bottleneck when every node aggregates messages from its neighbors.\n2247,2020-08-30 11:48:19,Unsupervised Keyphrase Extraction,Learn about unsupervised algorithms for automatically extracting representative keyword and phrases from documents\n2251,2020-08-31 10:05:12,Practical AI: Using NLP word embeddings to solve localization ,\"Using NLP word vectors (word2vec, glove, etc) in a novel way to solve the problem of localization in edtech.\"\n2252,2020-08-31 23:40:26,Explore then Execute,Adapting without Rewards via Factorized Meta-Reinforcement Learning\n2255,2020-09-01 04:49:38,\"Tensorflow, Pytorch, Transformer, Fastai, etc. Tutorials\",\"BERT Classification, Question Answering, Seq2Seq Machine Translation, Contextual Topic Modeling, Large Scale Multilabelclassification, etc\"\n2258,2020-09-02 09:05:08,Graph Convolutions for dummies,An article explaining Graph Convolutional Networks as simply as possible.\n2259,2020-09-02 23:08:03,ECCV 2020: Some Highlights,A sort of a snapshot of the conference by summarizing some papers (& listing some) that grabbed my attention.\n2260,2020-09-02 23:13:20,CVPR 2020: A Snapshot,A snapshot of the conference by summarizing some papers (& listing some) that grabbed my attention.\n2263,2020-09-03 23:05:32,TTT: Fine-tuning Transformers with TPUs or GPUs acceleration,\"TTT is short for a package for fine-tuning 🤗 Transformers with TPUs, written in Tensorflow2.0+.\"\n2264,2020-09-04 01:24:22,MushroomRL,Python library for Reinforcement Learning.\n2267,2020-09-04 02:50:39,What Is MLOps?,\"Machine learning operations, MLOps, are best practices for businesses to run AI successfully with help from an expanding software products and cloud services.\"\n2268,2020-09-05 01:06:07,NLP Course | For You,This is an extension to the (ML for) Natural Language Processing course I teach at the Yandex School of Data Analysis (YSDA) since fall 2018.\n2269,2020-09-05 01:09:06,Learning to Summarize with Human Feedback,Human feedback models outperform much larger supervised models and reference summaries on TL;DR\n2273,2020-09-05 18:22:44,ONNX Transformers,Accelerated NLP pipelines for fast inference 🚀 on CPU. Built with 🤗 Transformers and ONNX runtime.\n2275,2020-09-06 07:26:21,hugdatafast: huggingface/nlp + fastai,The elegant integration of huggingface/nlp and fastai2 and handy transforms using pure huggingface/nlp\n2280,2020-09-06 18:59:46,Top 10 Deep Learning Breakthroughs — Deep Reinforcement Learning,The article unravels the journey behind reaching the point when Reinforcement Learning combined with Deep Learning defeated a Go player world champion.\n2283,2020-09-07 07:13:04,Data analysis made easy: Text2Code for Jupyter notebook,A jupyter notebook extension for Text2Code for basic pandas and plotly commands\n2284,2020-09-07 10:42:32,electra_pytorch:  ELECTRA in PyTorch (fastai + huggingface),Unofficial reimplementation of <ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators>\n2285,2020-09-07 13:36:55,Images of radio boxes,I have collected about 15+k raw images of radio boxes across 500+ forms and hand-picked 200+  images that can be used to determine if a radio box is checked.\n2287,2020-09-07 20:56:51,omega|ml - building and deploying ML models the easy way,Deploying  ML is hard. It should not be. omega|ml makes it a breeze.\n2290,2020-09-09 00:16:32,Fine-tune a non-English GPT-2 Model with Huggingface,\" In this tutorial, we are going to use the transformers library by Huggingface. We will use the new Trainer class and fine-tune out GPT-2 model.\"\n2294,2020-09-09 16:14:37,Getting started with large-scale ETL jobs using Dask and AWS EMR,\"EMR is AWS’s distributed data platform, which we can interact with and submit jobs to from a JupyterLab notebook running on our local machine.\"\n2295,2020-09-09 16:36:45,How to Create a Cartoonizer with TensorFlow Lite?,An end-to-end tutorial on how to convert to TensorFlow Lite (TFLite) model and deploy it to an Android app for cartoonizing an image captured by camera.\n2296,2020-09-10 01:15:57,How to Test Machine Learning Code and Systems,\"🚦 Minimal examples of testing machine learning for correct implementation, expected learned behaviour, and model performance.\r\n\r\n\"\n2298,2020-09-11 00:02:10,torchCDE,Differentiable controlled differential equation solvers for PyTorch with GPU support and memory-efficient adjoint backpropagation.\n2299,2020-09-11 00:07:11,Latent graph neural networks: Manifold learning 2.0?,Parallels between recent works on latent graph learning and older techniques of manifold learning.\n2300,2020-09-11 00:11:14,Real Python Recommendation Engine,A full stack data science project that performs document similarity on RealPython.com content. Content recommendations are implemented via a Chrome extension.\n2304,2020-09-11 17:54:04,Graph Neural Networks,A descriptive guide for Graph Neural Networks.\n2317,2020-09-14 05:32:45,End-to-end Object Detection in TensorFlow Lite,\"This project shows how to train a custom detection model with the TFOD API, optimize it with TFLite, and perform inference with the optimized model.\"\n2318,2020-09-14 11:55:33,Jepto - Digital Marketing Analytics,KPI Prediction and Anomaly Detection of digital marketing data for both technical and non-technical marketers and business owners.\n2319,2020-09-14 19:21:33,Cartoonizer with TensorFlow.js,An app to turn your photos into cartoon-styled images 🎨 within your browsers using White-box Cartoonization GAN.\n2325,2020-09-16 13:43:20,Implementing Content-Based Image Retrieval with Siamese Networks,\"With content-based image retrieval, we refer to the task of finding images containing attributes which are not in the image metadata, but in its visual content.\"\n2326,2020-09-17 00:18:51,NLP for Developers: Multilingual NLP | Rasa,\"In this video, Rasa Developer Advocate Rachael will talk about common approaches to handle language input in more than one language.\"\n2327,2020-09-17 15:36:45,Paint with Machine Learning,This web app allows you to create a landscape painting in the style of Bob Ross using a deep learning model served using a Spell model server.\n2328,2020-09-17 16:04:29,Distilling Knowledge in Neural Networks,This project demonstrates the compelling model optimization technique - knowledge distillation with code walkthroughs in TensorFlow.\n2332,2020-09-18 08:49:55,Recurrent Neural Networks: building GRU cells VS LSTM cells ,What are the advantages of RNN’s over transformers? When to use GRU’s over LSTM? What are the equations of GRU really mean? How to build a GRU cell in Pytorch?\n2341,2020-09-20 00:34:03,PyTorch Forecasting,Time series forecasting with PyTorch.\n2342,2020-09-20 03:24:58,Norfair,Lightweight Python library for adding real-time 2D object tracking to any detector.\n2344,2020-09-21 00:20:00,Labelai,\"Labelai is an online tool designed to label images, useful for training AI models.\"\n2345,2020-09-21 00:26:02,Remo,🐰 Python lib for remo - the app for annotations and images management in Computer Vision.\n2348,2020-09-21 23:47:06,Layered Neural Rendering for Retiming People in Video,Manipulating and editing the time in which different motions of individuals in the video occur.\n2351,2020-09-22 03:42:58,Simple Transformers: Transformers Made Easy,Simple Transformers removes complexity and lets you get down to what matters – model training and experimenting with the Transformer model architectures.\n2353,2020-09-22 13:04:04,TF Geometric,Efficient and Friendly Graph Neural Network Library for TensorFlow 1.x and 2.x.\n2356,2020-09-23 04:56:15,\"Part 2: Deep Representations, a way towards neural style transfer\",A top-down approach to conceiving neural style transfer\n2357,2020-09-23 10:27:15,Sudoku Solver,Solving Sudoku by extracting the puzzle from photo using Computer Vision and OCR and solving it.\n2360,2020-09-23 13:56:29,\"3D Face: Fast, Accurate and Stable Reconstruction\",\"This work extends the previous work 3DDFA, named 3DDFA_V2, titled Towards Fast, Accurate and Stable 3D Dense Face Alignment, accepted by ECCV 2020. \"\n2368,2020-09-25 07:47:27,TableQA,AI tool for querying  natural language on tabular data like csvs and other dataframes.\n2369,2020-09-25 15:44:08,GP-GAN: Towards Realistic High-Resolution Image Blending,Blending composite images using a generative model and a Gaussian-Poisson equation with a Laplacian Pyramid\n2371,2020-09-25 18:10:13,From Research to Production with Deep Semi-Supervised Learning,Semi-Supervised Learning (SSL) has blossomed in the deep learning research community — we share lessons learned over 15 months of taking SSL into production.\n2372,2020-09-25 18:39:59, A spaced repetition app for keeping your reinforcement learning,We aim to keep your reinforcement learning knowledge fresh by periodically reminding you of concepts making you a master of RL knowledge!!\n2373,2020-09-25 22:41:22,GraphNorm,A Principled Approach to Accelerating Graph Neural Network Training.\n2384,2020-09-27 08:42:46,Intro to Facebook Prophet,Everything you need to know when starting out with Facebook’s time series forecasting tool\n2387,2020-09-27 14:22:51,GitHub Actions for Machine Learning,This presentation discusses the use of GitHub Actions to automate certain steps of a toy ML project.\n2388,2020-09-27 22:09:32,SemTorch,Different deep learning architectures definitions that can be applied to image segmentation.\n2389,2020-09-28 05:34:15,bingoset - CLI tool  to create image dataset.,CLI Toolkit to quickly create an image dataset using Bing Image Search API.\n2395,2020-09-28 22:51:23,Python caching in GitHub Actions,How to speed up slow Python builds in GitHub Actions with effective caching.\n2396,2020-09-29 00:36:12,EfficientDet meets Pytorch Lightning,Beginner friendly guide to object detection using EfficientDet.\n2397,2020-09-29 02:15:46,Optimizing MobileDet for Mobile Deployments,Learn about the criticalities of effectively optimizing MobileDet object detectors for mobile deployments.\n2402,2020-09-30 22:11:07,Adapting Text Augmentation to Industry Problems,\"In this post I will talk about the recent advances in exploiting language models for data generation and also show how, where we can implement them in Industry.\"\n2404,2020-09-30 22:22:07,12 Factors of Reproducible Machine Learning in Production,We took our experience to deduce 12 factors (as a nod to the 12 factor app) that build the backbone of successful ML in production.\n2410,2020-10-01 13:42:23,Serving PyTorch models in production with the Amazon SageMaker,TorchServe is now natively supported in Amazon SageMaker as the default model server for PyTorch inference.\n2411,2020-10-01 14:55:12,How to Make Sense of the Reinforcement Learning Agents?,What and Why I Log During Training and Debug?\n2412,2020-10-01 18:50:05,Introduction to 3D Medical Imaging: Preprocessing & Augmentations,\"Learn how to apply 3D transformations for medical image preprocessing and augmentation, to setup your awesome deep learning pipeline.\"\n2415,2020-10-01 23:55:36,Explainable ML Monitoring,\"The video covers an overview of some of the risks of AI, the need for explainable monitoring, and what exactly we mean when we talk about it.\"\n2417,2020-10-02 09:44:25,Parallelizing Prophet Cross-Validation with Dask,Applied Example w/ Code\n2418,2020-10-02 10:16:17,Top Research Papers from the ECML-PKDD 2020 Conference,ECML-PKDD -> selectionof the best reaesch papers\n2419,2020-10-02 15:37:27,GANs in Computer Vision Free Ebook / Article-series,This free ebook/article-series follows the chronological order of 20 peer-reviewed highly-cited papers as they presented in a series of 6 articles.\n2422,2020-10-02 21:48:21,Pattern-Exploiting Training (PET),\"This repository contains the code for \"\"Exploiting Cloze Questions for Few-Shot Text Classification and Natural Language Inference\"\"\"\n2423,2020-10-03 20:27:36,Imaginaire,NVIDIA PyTorch GAN library with distributed and mixed precision support.\n2430,2020-10-05 10:09:28,Transection: Transformers for English to Chinese Translation 基于t,Tutorials on how to fine-tune a BART based transformer for English to Chinese translation.\n2431,2020-10-05 12:36:02,A Survey of the State of Explainable AI for NLP,Overview of the operations and explainability techniques currently available for generating explanations for NLP model predictions.\n2432,2020-10-05 13:09:58,Topic Modeling with BERT,Leveraging 🤗 Transformers and a class-based TF-IDF to create dense clusters allowing for easily interpretable topics.\n2434,2020-10-06 02:13:01,OpenMMLab Computer Vision,\"MMCV is a python library for CV research and supports many research projects such as object detection, segmentation, pose estimation, action classification.\r\n\r\n\"\n2436,2020-10-06 13:29:44,Machine Learning Methods Explained (+ Examples),Most common techniques used in data science projects; get to know them through easy-to-understand examples and put them into practice in your own ML projects!\n2437,2020-10-06 14:53:39,Rasoee,\"A powerful web and mobile application that identifies food dishes from a given input image, and provides an ingredient list along with relevant recipes.\"\n"
  },
  {
    "path": "datasets/tags.csv",
    "content": "tag\ncomputer-vision\ncomputer-vision\ngraph-learning\nreinforcement-learning\ngraph-learning\ngraph-learning\ngraph-learning\ngraph-learning\ngraph-learning\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ngraph-learning\nnatural-language-processing\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nmlops\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ngraph-learning\ncomputer-vision\ngraph-learning\ncomputer-vision\ncomputer-vision\nmlops\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ntime-series\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\nreinforcement-learning\nreinforcement-learning\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ngraph-learning\ngraph-learning\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\nmlops\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\nreinforcement-learning\ngraph-learning\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nmlops\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ntime-series\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ntime-series\ncomputer-vision\ntime-series\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nmlops\nnatural-language-processing\nmlops\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ngraph-learning\nreinforcement-learning\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ngraph-learning\nnatural-language-processing\nnatural-language-processing\ntime-series\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ntime-series\ntime-series\nnatural-language-processing\ncomputer-vision\ngraph-learning\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ngraph-learning\nmlops\ncomputer-vision\ngraph-learning\nmlops\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\ncomputer-vision\ngraph-learning\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ntime-series\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\ntime-series\ncomputer-vision\ncomputer-vision\ntime-series\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nmlops\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ntime-series\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\nmlops\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ntime-series\ncomputer-vision\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ntime-series\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nmlops\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nreinforcement-learning\ntime-series\nmlops\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ntime-series\ncomputer-vision\nreinforcement-learning\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nreinforcement-learning\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\ngraph-learning\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nmlops\ngraph-learning\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\nreinforcement-learning\ncomputer-vision\ncomputer-vision\ncomputer-vision\nreinforcement-learning\nnatural-language-processing\ngraph-learning\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ngraph-learning\nreinforcement-learning\nreinforcement-learning\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ntime-series\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nmlops\ncomputer-vision\ncomputer-vision\ntime-series\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\ncomputer-vision\nreinforcement-learning\nmlops\ncomputer-vision\nreinforcement-learning\ncomputer-vision\ntime-series\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\ncomputer-vision\ngraph-learning\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ntime-series\ntime-series\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\nmlops\nmlops\nmlops\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nmlops\nnatural-language-processing\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nmlops\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ngraph-learning\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ngraph-learning\nmlops\nmlops\nmlops\nmlops\ncomputer-vision\nmlops\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ngraph-learning\nnatural-language-processing\ntime-series\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nmlops\nmlops\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ntime-series\nmlops\nmlops\nmlops\nreinforcement-learning\ntime-series\nmlops\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nmlops\nmlops\ngraph-learning\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\ncomputer-vision\ncomputer-vision\ngraph-learning\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\ngraph-learning\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nreinforcement-learning\nmlops\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\nreinforcement-learning\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nmlops\nnatural-language-processing\nmlops\ncomputer-vision\nmlops\ntime-series\ngraph-learning\nnatural-language-processing\ngraph-learning\ncomputer-vision\ntime-series\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ntime-series\ncomputer-vision\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ngraph-learning\ncomputer-vision\ncomputer-vision\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nmlops\nreinforcement-learning\ngraph-learning\ntime-series\nmlops\ncomputer-vision\ncomputer-vision\nmlops\ncomputer-vision\ncomputer-vision\nnatural-language-processing\nmlops\nmlops\nreinforcement-learning\ncomputer-vision\nmlops\ntime-series\nreinforcement-learning\ncomputer-vision\nnatural-language-processing\ncomputer-vision\nnatural-language-processing\nnatural-language-processing\nnatural-language-processing\ncomputer-vision\nreinforcement-learning\ncomputer-vision\n"
  },
  {
    "path": "deploy/cluster_compute.yaml",
    "content": "cloud: education-us-west-2\nregion: us-west-2\nhead_node_type:\n  name: head_node_type\n  instance_type: g5.4xlarge\nworker_node_types:\n- name: gpu_worker\n  instance_type: g5.4xlarge\n  min_workers: 1\n  max_workers: 1\n  use_spot: False\naws:\n  BlockDeviceMappings:\n  - DeviceName: \"/dev/sda1\"\n    Ebs:\n      VolumeSize: 500\n      DeleteOnTermination: true\n  TagSpecifications:\n  - ResourceType: instance\n    Tags:\n      - Key: as-feature-multi-zone\n        Value: \"true\"\n"
  },
  {
    "path": "deploy/cluster_env.yaml",
    "content": "base_image: anyscale/ray:2.7.0optimized-py310-cu118\nenv_vars: {}\ndebian_packages:\n  - curl\n\npython:\n  pip_packages: []\n  conda_packages: []\n\npost_build_cmds:\n  - python3 -m pip install --upgrade pip setuptools wheel\n  - python3 -m pip install -r https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/requirements.txt\n"
  },
  {
    "path": "deploy/jobs/workloads.sh",
    "content": "#!/bin/bash\nexport PYTHONPATH=$PYTHONPATH:$PWD\nmkdir results\n\n# Test data\nexport RESULTS_FILE=results/test_data_results.txt\nexport DATASET_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\"\npytest --dataset-loc=$DATASET_LOC tests/data --verbose --disable-warnings > $RESULTS_FILE\ncat $RESULTS_FILE\n\n# Test code\nexport RESULTS_FILE=results/test_code_results.txt\npython -m pytest tests/code --verbose --disable-warnings > $RESULTS_FILE\ncat $RESULTS_FILE\n\n# Train\nexport EXPERIMENT_NAME=\"llm\"\nexport RESULTS_FILE=results/training_results.json\nexport DATASET_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\"\nexport TRAIN_LOOP_CONFIG='{\"dropout_p\": 0.5, \"lr\": 1e-4, \"lr_factor\": 0.8, \"lr_patience\": 3}'\npython madewithml/train.py \\\n    --experiment-name \"$EXPERIMENT_NAME\" \\\n    --dataset-loc \"$DATASET_LOC\" \\\n    --train-loop-config \"$TRAIN_LOOP_CONFIG\" \\\n    --num-workers 1 \\\n    --cpu-per-worker 10 \\\n    --gpu-per-worker 1 \\\n    --num-epochs 10 \\\n    --batch-size 256 \\\n    --results-fp $RESULTS_FILE\n\n# Get and save run ID\nexport RUN_ID=$(python -c \"import os; from madewithml import utils; d = utils.load_dict(os.getenv('RESULTS_FILE')); print(d['run_id'])\")\nexport RUN_ID_FILE=results/run_id.txt\necho $RUN_ID > $RUN_ID_FILE  # used for serving later\n\n# Evaluate\nexport RESULTS_FILE=results/evaluation_results.json\nexport HOLDOUT_LOC=\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/holdout.csv\"\npython madewithml/evaluate.py \\\n    --run-id $RUN_ID \\\n    --dataset-loc $HOLDOUT_LOC \\\n    --results-fp $RESULTS_FILE\n\n# Test model\nRESULTS_FILE=results/test_model_results.txt\npytest --run-id=$RUN_ID tests/model --verbose --disable-warnings > $RESULTS_FILE\ncat $RESULTS_FILE\n\n# Save to S3\nexport MODEL_REGISTRY=$(python -c \"from madewithml import config; print(config.MODEL_REGISTRY)\")\naws s3 cp $MODEL_REGISTRY s3://madewithml/$GITHUB_USERNAME/mlflow/ --recursive\naws s3 cp results/ s3://madewithml/$GITHUB_USERNAME/results/ --recursive\n"
  },
  {
    "path": "deploy/jobs/workloads.yaml",
    "content": "name: workloads\nproject_id: prj_wn6el5cu9dqwktk6t4cv54x8zh\ncluster_env: madewithml-cluster-env\ncompute_config: madewithml-cluster-compute\nruntime_env:\n  working_dir: .\n  upload_path: s3://madewithml/GokuMohandas/jobs  # <--- CHANGE USERNAME (case-sensitive)\n  env_vars:\n    GITHUB_USERNAME: GokuMohandas  # <--- CHANGE USERNAME (case-sensitive)\nentrypoint: bash deploy/jobs/workloads.sh\nmax_retries: 0\n"
  },
  {
    "path": "deploy/services/serve_model.py",
    "content": "import os\nimport subprocess\nimport sys\n\nsys.path.append(\".\")\n\nfrom madewithml.config import MODEL_REGISTRY  # NOQA: E402\nfrom madewithml.serve import ModelDeployment  # NOQA: E402\n\n# Copy from S3\ngithub_username = os.environ.get(\"GITHUB_USERNAME\")\nsubprocess.check_output([\"aws\", \"s3\", \"cp\", f\"s3://madewithml/{github_username}/mlflow/\", str(MODEL_REGISTRY), \"--recursive\"])\nsubprocess.check_output([\"aws\", \"s3\", \"cp\", f\"s3://madewithml/{github_username}/results/\", \"./\", \"--recursive\"])\n\n# Entrypoint\nrun_id = [line.strip() for line in open(\"run_id.txt\")][0]\nentrypoint = ModelDeployment.bind(run_id=run_id, threshold=0.9)\n"
  },
  {
    "path": "deploy/services/serve_model.yaml",
    "content": "name: madewithml\nproject_id: prj_wn6el5cu9dqwktk6t4cv54x8zh\ncluster_env: madewithml-cluster-env\ncompute_config: madewithml-cluster-compute\nray_serve_config:\n  import_path: deploy.services.serve_model:entrypoint\n  runtime_env:\n    working_dir: .\n    upload_path: s3://madewithml/GokuMohandas/services  # <--- CHANGE USERNAME (case-sensitive)\n    env_vars:\n      GITHUB_USERNAME: GokuMohandas  # <--- CHANGE USERNAME (case-sensitive)\nrollout_strategy: ROLLOUT # ROLLOUT or IN_PLACE\n"
  },
  {
    "path": "docs/index.md",
    "content": "## Documentation\n\n- [madewithml](madewithml/data.md): documentation.\n\n## Lessons\n\nLearn how to combine machine learning with software engineering to design, develop, deploy and iterate on production ML applications.\n\n- **Lessons**: [https://madewithml.com/](https://madewithml.com/#course)\n- **Code**: [GokuMohandas/Made-With-ML](https://github.com/GokuMohandas/Made-With-ML)\n"
  },
  {
    "path": "docs/madewithml/data.md",
    "content": "::: madewithml.data\n"
  },
  {
    "path": "docs/madewithml/evaluate.md",
    "content": "::: madewithml.evaluate\n"
  },
  {
    "path": "docs/madewithml/models.md",
    "content": "::: madewithml.models\n"
  },
  {
    "path": "docs/madewithml/predict.md",
    "content": "::: madewithml.predict\n"
  },
  {
    "path": "docs/madewithml/serve.md",
    "content": "::: madewithml.serve\n"
  },
  {
    "path": "docs/madewithml/train.md",
    "content": "::: madewithml.train\n"
  },
  {
    "path": "docs/madewithml/tune.md",
    "content": "::: madewithml.tune\n"
  },
  {
    "path": "docs/madewithml/utils.md",
    "content": "::: madewithml.utils\n"
  },
  {
    "path": "madewithml/__init__.py",
    "content": "from dotenv import load_dotenv\n\nload_dotenv()\n"
  },
  {
    "path": "madewithml/config.py",
    "content": "# config.py\nimport logging\nimport os\nimport sys\nfrom pathlib import Path\n\nimport mlflow\n\n# Directories\nROOT_DIR = Path(__file__).parent.parent.absolute()\nLOGS_DIR = Path(ROOT_DIR, \"logs\")\nLOGS_DIR.mkdir(parents=True, exist_ok=True)\nEFS_DIR = Path(f\"/efs/shared_storage/madewithml/{os.environ.get('GITHUB_USERNAME', '')}\")\ntry:\n    Path(EFS_DIR).mkdir(parents=True, exist_ok=True)\nexcept OSError:\n    EFS_DIR = Path(ROOT_DIR, \"efs\")\n    Path(EFS_DIR).mkdir(parents=True, exist_ok=True)\n\n# Config MLflow\nMODEL_REGISTRY = Path(f\"{EFS_DIR}/mlflow\")\nPath(MODEL_REGISTRY).mkdir(parents=True, exist_ok=True)\nMLFLOW_TRACKING_URI = \"file://\" + str(MODEL_REGISTRY.absolute())\nmlflow.set_tracking_uri(MLFLOW_TRACKING_URI)\n\n# Logger\nlogging_config = {\n    \"version\": 1,\n    \"disable_existing_loggers\": False,\n    \"formatters\": {\n        \"minimal\": {\"format\": \"%(message)s\"},\n        \"detailed\": {\"format\": \"%(levelname)s %(asctime)s [%(name)s:%(filename)s:%(funcName)s:%(lineno)d]\\n%(message)s\\n\"},\n    },\n    \"handlers\": {\n        \"console\": {\n            \"class\": \"logging.StreamHandler\",\n            \"stream\": sys.stdout,\n            \"formatter\": \"minimal\",\n            \"level\": logging.DEBUG,\n        },\n        \"info\": {\n            \"class\": \"logging.handlers.RotatingFileHandler\",\n            \"filename\": Path(LOGS_DIR, \"info.log\"),\n            \"maxBytes\": 10485760,  # 1 MB\n            \"backupCount\": 10,\n            \"formatter\": \"detailed\",\n            \"level\": logging.INFO,\n        },\n        \"error\": {\n            \"class\": \"logging.handlers.RotatingFileHandler\",\n            \"filename\": Path(LOGS_DIR, \"error.log\"),\n            \"maxBytes\": 10485760,  # 1 MB\n            \"backupCount\": 10,\n            \"formatter\": \"detailed\",\n            \"level\": logging.ERROR,\n        },\n    },\n    \"root\": {\n        \"handlers\": [\"console\", \"info\", \"error\"],\n        \"level\": logging.INFO,\n        \"propagate\": True,\n    },\n}\n\n# Logger\nlogging.config.dictConfig(logging_config)\nlogger = logging.getLogger()\n\n# Constraints\nSTOPWORDS = [\n    \"i\",\n    \"me\",\n    \"my\",\n    \"myself\",\n    \"we\",\n    \"our\",\n    \"ours\",\n    \"ourselves\",\n    \"you\",\n    \"you're\",\n    \"you've\",\n    \"you'll\",\n    \"you'd\",\n    \"your\",\n    \"yours\",\n    \"yourself\",\n    \"yourselves\",\n    \"he\",\n    \"him\",\n    \"his\",\n    \"himself\",\n    \"she\",\n    \"she's\",\n    \"her\",\n    \"hers\",\n    \"herself\",\n    \"it\",\n    \"it's\",\n    \"its\",\n    \"itself\",\n    \"they\",\n    \"them\",\n    \"their\",\n    \"theirs\",\n    \"themselves\",\n    \"what\",\n    \"which\",\n    \"who\",\n    \"whom\",\n    \"this\",\n    \"that\",\n    \"that'll\",\n    \"these\",\n    \"those\",\n    \"am\",\n    \"is\",\n    \"are\",\n    \"was\",\n    \"were\",\n    \"be\",\n    \"been\",\n    \"being\",\n    \"have\",\n    \"has\",\n    \"had\",\n    \"having\",\n    \"do\",\n    \"does\",\n    \"did\",\n    \"doing\",\n    \"a\",\n    \"an\",\n    \"the\",\n    \"and\",\n    \"but\",\n    \"if\",\n    \"or\",\n    \"because\",\n    \"as\",\n    \"until\",\n    \"while\",\n    \"of\",\n    \"at\",\n    \"by\",\n    \"for\",\n    \"with\",\n    \"about\",\n    \"against\",\n    \"between\",\n    \"into\",\n    \"through\",\n    \"during\",\n    \"before\",\n    \"after\",\n    \"above\",\n    \"below\",\n    \"to\",\n    \"from\",\n    \"up\",\n    \"down\",\n    \"in\",\n    \"out\",\n    \"on\",\n    \"off\",\n    \"over\",\n    \"under\",\n    \"again\",\n    \"further\",\n    \"then\",\n    \"once\",\n    \"here\",\n    \"there\",\n    \"when\",\n    \"where\",\n    \"why\",\n    \"how\",\n    \"all\",\n    \"any\",\n    \"both\",\n    \"each\",\n    \"few\",\n    \"more\",\n    \"most\",\n    \"other\",\n    \"some\",\n    \"such\",\n    \"no\",\n    \"nor\",\n    \"not\",\n    \"only\",\n    \"own\",\n    \"same\",\n    \"so\",\n    \"than\",\n    \"too\",\n    \"very\",\n    \"s\",\n    \"t\",\n    \"can\",\n    \"will\",\n    \"just\",\n    \"don\",\n    \"don't\",\n    \"should\",\n    \"should've\",\n    \"now\",\n    \"d\",\n    \"ll\",\n    \"m\",\n    \"o\",\n    \"re\",\n    \"ve\",\n    \"y\",\n    \"ain\",\n    \"aren\",\n    \"aren't\",\n    \"couldn\",\n    \"couldn't\",\n    \"didn\",\n    \"didn't\",\n    \"doesn\",\n    \"doesn't\",\n    \"hadn\",\n    \"hadn't\",\n    \"hasn\",\n    \"hasn't\",\n    \"haven\",\n    \"haven't\",\n    \"isn\",\n    \"isn't\",\n    \"ma\",\n    \"mightn\",\n    \"mightn't\",\n    \"mustn\",\n    \"mustn't\",\n    \"needn\",\n    \"needn't\",\n    \"shan\",\n    \"shan't\",\n    \"shouldn\",\n    \"shouldn't\",\n    \"wasn\",\n    \"wasn't\",\n    \"weren\",\n    \"weren't\",\n    \"won\",\n    \"won't\",\n    \"wouldn\",\n    \"wouldn't\",\n]\n"
  },
  {
    "path": "madewithml/data.py",
    "content": "import re\nfrom typing import Dict, List, Tuple\n\nimport numpy as np\nimport pandas as pd\nimport ray\nfrom ray.data import Dataset\nfrom sklearn.model_selection import train_test_split\nfrom transformers import BertTokenizer\n\nfrom madewithml.config import STOPWORDS\n\n\ndef load_data(dataset_loc: str, num_samples: int = None) -> Dataset:\n    \"\"\"Load data from source into a Ray Dataset.\n\n    Args:\n        dataset_loc (str): Location of the dataset.\n        num_samples (int, optional): The number of samples to load. Defaults to None.\n\n    Returns:\n        Dataset: Our dataset represented by a Ray Dataset.\n    \"\"\"\n    ds = ray.data.read_csv(dataset_loc)\n    ds = ds.random_shuffle(seed=1234)\n    ds = ray.data.from_items(ds.take(num_samples)) if num_samples else ds\n    return ds\n\n\ndef stratify_split(\n    ds: Dataset,\n    stratify: str,\n    test_size: float,\n    shuffle: bool = True,\n    seed: int = 1234,\n) -> Tuple[Dataset, Dataset]:\n    \"\"\"Split a dataset into train and test splits with equal\n    amounts of data points from each class in the column we\n    want to stratify on.\n\n    Args:\n        ds (Dataset): Input dataset to split.\n        stratify (str): Name of column to split on.\n        test_size (float): Proportion of dataset to split for test set.\n        shuffle (bool, optional): whether to shuffle the dataset. Defaults to True.\n        seed (int, optional): seed for shuffling. Defaults to 1234.\n\n    Returns:\n        Tuple[Dataset, Dataset]: the stratified train and test datasets.\n    \"\"\"\n\n    def _add_split(df: pd.DataFrame) -> pd.DataFrame:  # pragma: no cover, used in parent function\n        \"\"\"Naively split a dataframe into train and test splits.\n        Add a column specifying whether it's the train or test split.\"\"\"\n        train, test = train_test_split(df, test_size=test_size, shuffle=shuffle, random_state=seed)\n        train[\"_split\"] = \"train\"\n        test[\"_split\"] = \"test\"\n        return pd.concat([train, test])\n\n    def _filter_split(df: pd.DataFrame, split: str) -> pd.DataFrame:  # pragma: no cover, used in parent function\n        \"\"\"Filter by data points that match the split column's value\n        and return the dataframe with the _split column dropped.\"\"\"\n        return df[df[\"_split\"] == split].drop(\"_split\", axis=1)\n\n    # Train, test split with stratify\n    grouped = ds.groupby(stratify).map_groups(_add_split, batch_format=\"pandas\")  # group by each unique value in the column we want to stratify on\n    train_ds = grouped.map_batches(_filter_split, fn_kwargs={\"split\": \"train\"}, batch_format=\"pandas\")  # combine\n    test_ds = grouped.map_batches(_filter_split, fn_kwargs={\"split\": \"test\"}, batch_format=\"pandas\")  # combine\n\n    # Shuffle each split (required)\n    train_ds = train_ds.random_shuffle(seed=seed)\n    test_ds = test_ds.random_shuffle(seed=seed)\n\n    return train_ds, test_ds\n\n\ndef clean_text(text: str, stopwords: List = STOPWORDS) -> str:\n    \"\"\"Clean raw text string.\n\n    Args:\n        text (str): Raw text to clean.\n        stopwords (List, optional): list of words to filter out. Defaults to STOPWORDS.\n\n    Returns:\n        str: cleaned text.\n    \"\"\"\n    # Lower\n    text = text.lower()\n\n    # Remove stopwords\n    pattern = re.compile(r\"\\b(\" + r\"|\".join(stopwords) + r\")\\b\\s*\")\n    text = pattern.sub(\" \", text)\n\n    # Spacing and filters\n    text = re.sub(r\"([!\\\"'#$%&()*\\+,-./:;<=>?@\\\\\\[\\]^_`{|}~])\", r\" \\1 \", text)  # add spacing\n    text = re.sub(\"[^A-Za-z0-9]+\", \" \", text)  # remove non alphanumeric chars\n    text = re.sub(\" +\", \" \", text)  # remove multiple spaces\n    text = text.strip()  # strip white space at the ends\n    text = re.sub(r\"http\\S+\", \"\", text)  # remove links\n\n    return text\n\n\ndef tokenize(batch: Dict) -> Dict:\n    \"\"\"Tokenize the text input in our batch using a tokenizer.\n\n    Args:\n        batch (Dict): batch of data with the text inputs to tokenize.\n\n    Returns:\n        Dict: batch of data with the results of tokenization (`input_ids` and `attention_mask`) on the text inputs.\n    \"\"\"\n    tokenizer = BertTokenizer.from_pretrained(\"allenai/scibert_scivocab_uncased\", return_dict=False)\n    encoded_inputs = tokenizer(batch[\"text\"].tolist(), return_tensors=\"np\", padding=\"longest\")\n    return dict(ids=encoded_inputs[\"input_ids\"], masks=encoded_inputs[\"attention_mask\"], targets=np.array(batch[\"tag\"]))\n\n\ndef preprocess(df: pd.DataFrame, class_to_index: Dict) -> Dict:\n    \"\"\"Preprocess the data in our dataframe.\n\n    Args:\n        df (pd.DataFrame): Raw dataframe to preprocess.\n        class_to_index (Dict): Mapping of class names to indices.\n\n    Returns:\n        Dict: preprocessed data (ids, masks, targets).\n    \"\"\"\n    df[\"text\"] = df.title + \" \" + df.description  # feature engineering\n    df[\"text\"] = df.text.apply(clean_text)  # clean text\n    df = df.drop(columns=[\"id\", \"created_on\", \"title\", \"description\"], errors=\"ignore\")  # clean dataframe\n    df = df[[\"text\", \"tag\"]]  # rearrange columns\n    df[\"tag\"] = df[\"tag\"].map(class_to_index)  # label encoding\n    outputs = tokenize(df)\n    return outputs\n\n\nclass CustomPreprocessor:\n    \"\"\"Custom preprocessor class.\"\"\"\n\n    def __init__(self, class_to_index={}):\n        self.class_to_index = class_to_index or {}  # mutable defaults\n        self.index_to_class = {v: k for k, v in self.class_to_index.items()}\n\n    def fit(self, ds):\n        tags = ds.unique(column=\"tag\")\n        self.class_to_index = {tag: i for i, tag in enumerate(tags)}\n        self.index_to_class = {v: k for k, v in self.class_to_index.items()}\n        return self\n\n    def transform(self, ds):\n        return ds.map_batches(preprocess, fn_kwargs={\"class_to_index\": self.class_to_index}, batch_format=\"pandas\")\n"
  },
  {
    "path": "madewithml/evaluate.py",
    "content": "import datetime\nimport json\nfrom collections import OrderedDict\nfrom typing import Dict\n\nimport numpy as np\nimport ray\nimport ray.train.torch  # NOQA: F401 (imported but unused)\nimport typer\nfrom ray.data import Dataset\nfrom sklearn.metrics import precision_recall_fscore_support\nfrom snorkel.slicing import PandasSFApplier, slicing_function\nfrom typing_extensions import Annotated\n\nfrom madewithml import predict, utils\nfrom madewithml.config import logger\nfrom madewithml.predict import TorchPredictor\n\n# Initialize Typer CLI app\napp = typer.Typer()\n\n\ndef get_overall_metrics(y_true: np.ndarray, y_pred: np.ndarray) -> Dict:  # pragma: no cover, eval workload\n    \"\"\"Get overall performance metrics.\n\n    Args:\n        y_true (np.ndarray): ground truth labels.\n        y_pred (np.ndarray): predicted labels.\n\n    Returns:\n        Dict: overall metrics.\n    \"\"\"\n    metrics = precision_recall_fscore_support(y_true, y_pred, average=\"weighted\")\n    overall_metrics = {\n        \"precision\": metrics[0],\n        \"recall\": metrics[1],\n        \"f1\": metrics[2],\n        \"num_samples\": np.float64(len(y_true)),\n    }\n    return overall_metrics\n\n\ndef get_per_class_metrics(y_true: np.ndarray, y_pred: np.ndarray, class_to_index: Dict) -> Dict:  # pragma: no cover, eval workload\n    \"\"\"Get per class performance metrics.\n\n    Args:\n        y_true (np.ndarray): ground truth labels.\n        y_pred (np.ndarray): predicted labels.\n        class_to_index (Dict): dictionary mapping class to index.\n\n    Returns:\n        Dict: per class metrics.\n    \"\"\"\n    per_class_metrics = {}\n    metrics = precision_recall_fscore_support(y_true, y_pred, average=None)\n    for i, _class in enumerate(class_to_index):\n        per_class_metrics[_class] = {\n            \"precision\": metrics[0][i],\n            \"recall\": metrics[1][i],\n            \"f1\": metrics[2][i],\n            \"num_samples\": np.float64(metrics[3][i]),\n        }\n    sorted_per_class_metrics = OrderedDict(sorted(per_class_metrics.items(), key=lambda tag: tag[1][\"f1\"], reverse=True))\n    return sorted_per_class_metrics\n\n\n@slicing_function()\ndef nlp_llm(x):  # pragma: no cover, eval workload\n    \"\"\"NLP projects that use LLMs.\"\"\"\n    nlp_project = \"natural-language-processing\" in x.tag\n    llm_terms = [\"transformer\", \"llm\", \"bert\"]\n    llm_project = any(s.lower() in x.text.lower() for s in llm_terms)\n    return nlp_project and llm_project\n\n\n@slicing_function()\ndef short_text(x):  # pragma: no cover, eval workload\n    \"\"\"Projects with short titles and descriptions.\"\"\"\n    return len(x.text.split()) < 8  # less than 8 words\n\n\ndef get_slice_metrics(y_true: np.ndarray, y_pred: np.ndarray, ds: Dataset) -> Dict:  # pragma: no cover, eval workload\n    \"\"\"Get performance metrics for slices.\n\n    Args:\n        y_true (np.ndarray): ground truth labels.\n        y_pred (np.ndarray): predicted labels.\n        ds (Dataset): Ray dataset with labels.\n    Returns:\n        Dict: performance metrics for slices.\n    \"\"\"\n    slice_metrics = {}\n    df = ds.to_pandas()\n    df[\"text\"] = df[\"title\"] + \" \" + df[\"description\"]\n    slices = PandasSFApplier([nlp_llm, short_text]).apply(df)\n    for slice_name in slices.dtype.names:\n        mask = slices[slice_name].astype(bool)\n        if sum(mask):\n            metrics = precision_recall_fscore_support(y_true[mask], y_pred[mask], average=\"micro\")\n            slice_metrics[slice_name] = {}\n            slice_metrics[slice_name][\"precision\"] = metrics[0]\n            slice_metrics[slice_name][\"recall\"] = metrics[1]\n            slice_metrics[slice_name][\"f1\"] = metrics[2]\n            slice_metrics[slice_name][\"num_samples\"] = len(y_true[mask])\n    return slice_metrics\n\n\n@app.command()\ndef evaluate(\n    run_id: Annotated[str, typer.Option(help=\"id of the specific run to load from\")] = None,\n    dataset_loc: Annotated[str, typer.Option(help=\"dataset (with labels) to evaluate on\")] = None,\n    results_fp: Annotated[str, typer.Option(help=\"location to save evaluation results to\")] = None,\n) -> Dict:  # pragma: no cover, eval workload\n    \"\"\"Evaluate on the holdout dataset.\n\n    Args:\n        run_id (str): id of the specific run to load from. Defaults to None.\n        dataset_loc (str): dataset (with labels) to evaluate on.\n        results_fp (str, optional): location to save evaluation results to. Defaults to None.\n\n    Returns:\n        Dict: model's performance metrics on the dataset.\n    \"\"\"\n    # Load\n    ds = ray.data.read_csv(dataset_loc)\n    best_checkpoint = predict.get_best_checkpoint(run_id=run_id)\n    predictor = TorchPredictor.from_checkpoint(best_checkpoint)\n\n    # y_true\n    preprocessor = predictor.get_preprocessor()\n    preprocessed_ds = preprocessor.transform(ds)\n    values = preprocessed_ds.select_columns(cols=[\"targets\"]).take_all()\n    y_true = np.stack([item[\"targets\"] for item in values])\n\n    # y_pred\n    predictions = preprocessed_ds.map_batches(predictor).take_all()\n    y_pred = np.array([d[\"output\"] for d in predictions])\n\n    # Metrics\n    metrics = {\n        \"timestamp\": datetime.datetime.now().strftime(\"%B %d, %Y %I:%M:%S %p\"),\n        \"run_id\": run_id,\n        \"overall\": get_overall_metrics(y_true=y_true, y_pred=y_pred),\n        \"per_class\": get_per_class_metrics(y_true=y_true, y_pred=y_pred, class_to_index=preprocessor.class_to_index),\n        \"slices\": get_slice_metrics(y_true=y_true, y_pred=y_pred, ds=ds),\n    }\n    logger.info(json.dumps(metrics, indent=2))\n    if results_fp:  # pragma: no cover, saving results\n        utils.save_dict(d=metrics, path=results_fp)\n    return metrics\n\n\nif __name__ == \"__main__\":  # pragma: no cover, checked during evaluation workload\n    app()\n"
  },
  {
    "path": "madewithml/models.py",
    "content": "import json\nimport os\nfrom pathlib import Path\n\nimport torch\nimport torch.nn as nn\nimport torch.nn.functional as F\nfrom transformers import BertModel\n\n\nclass FinetunedLLM(nn.Module):\n    def __init__(self, llm, dropout_p, embedding_dim, num_classes):\n        super(FinetunedLLM, self).__init__()\n        self.llm = llm\n        self.dropout_p = dropout_p\n        self.embedding_dim = embedding_dim\n        self.num_classes = num_classes\n        self.dropout = torch.nn.Dropout(dropout_p)\n        self.fc1 = torch.nn.Linear(embedding_dim, num_classes)\n\n    def forward(self, batch):\n        ids, masks = batch[\"ids\"], batch[\"masks\"]\n        seq, pool = self.llm(input_ids=ids, attention_mask=masks)\n        z = self.dropout(pool)\n        z = self.fc1(z)\n        return z\n\n    @torch.inference_mode()\n    def predict(self, batch):\n        self.eval()\n        z = self(batch)\n        y_pred = torch.argmax(z, dim=1).cpu().numpy()\n        return y_pred\n\n    @torch.inference_mode()\n    def predict_proba(self, batch):\n        self.eval()\n        z = self(batch)\n        y_probs = F.softmax(z, dim=1).cpu().numpy()\n        return y_probs\n\n    def save(self, dp):\n        with open(Path(dp, \"args.json\"), \"w\") as fp:\n            contents = {\n                \"dropout_p\": self.dropout_p,\n                \"embedding_dim\": self.embedding_dim,\n                \"num_classes\": self.num_classes,\n            }\n            json.dump(contents, fp, indent=4, sort_keys=False)\n        torch.save(self.state_dict(), os.path.join(dp, \"model.pt\"))\n\n    @classmethod\n    def load(cls, args_fp, state_dict_fp):\n        with open(args_fp, \"r\") as fp:\n            kwargs = json.load(fp=fp)\n        llm = BertModel.from_pretrained(\"allenai/scibert_scivocab_uncased\", return_dict=False)\n        model = cls(llm=llm, **kwargs)\n        model.load_state_dict(torch.load(state_dict_fp, map_location=torch.device(\"cpu\")))\n        return model\n"
  },
  {
    "path": "madewithml/predict.py",
    "content": "import json\nfrom pathlib import Path\nfrom typing import Any, Dict, Iterable, List\nfrom urllib.parse import urlparse\n\nimport numpy as np\nimport ray\nimport typer\nfrom numpyencoder import NumpyEncoder\nfrom ray.air import Result\nfrom ray.train.torch.torch_checkpoint import TorchCheckpoint\nfrom typing_extensions import Annotated\n\nfrom madewithml.config import logger, mlflow\nfrom madewithml.data import CustomPreprocessor\nfrom madewithml.models import FinetunedLLM\nfrom madewithml.utils import collate_fn\n\n# Initialize Typer CLI app\napp = typer.Typer()\n\n\ndef decode(indices: Iterable[Any], index_to_class: Dict) -> List:\n    \"\"\"Decode indices to labels.\n\n    Args:\n        indices (Iterable[Any]): Iterable (list, array, etc.) with indices.\n        index_to_class (Dict): mapping between indices and labels.\n\n    Returns:\n        List: list of labels.\n    \"\"\"\n    return [index_to_class[index] for index in indices]\n\n\ndef format_prob(prob: Iterable, index_to_class: Dict) -> Dict:\n    \"\"\"Format probabilities to a dictionary mapping class label to probability.\n\n    Args:\n        prob (Iterable): probabilities.\n        index_to_class (Dict): mapping between indices and labels.\n\n    Returns:\n        Dict: Dictionary mapping class label to probability.\n    \"\"\"\n    d = {}\n    for i, item in enumerate(prob):\n        d[index_to_class[i]] = item\n    return d\n\n\nclass TorchPredictor:\n    def __init__(self, preprocessor, model):\n        self.preprocessor = preprocessor\n        self.model = model\n        self.model.eval()\n\n    def __call__(self, batch):\n        results = self.model.predict(collate_fn(batch))\n        return {\"output\": results}\n\n    def predict_proba(self, batch):\n        results = self.model.predict_proba(collate_fn(batch))\n        return {\"output\": results}\n\n    def get_preprocessor(self):\n        return self.preprocessor\n\n    @classmethod\n    def from_checkpoint(cls, checkpoint):\n        metadata = checkpoint.get_metadata()\n        preprocessor = CustomPreprocessor(class_to_index=metadata[\"class_to_index\"])\n        model = FinetunedLLM.load(Path(checkpoint.path, \"args.json\"), Path(checkpoint.path, \"model.pt\"))\n        return cls(preprocessor=preprocessor, model=model)\n\n\ndef predict_proba(\n    ds: ray.data.dataset.Dataset,\n    predictor: TorchPredictor,\n) -> List:  # pragma: no cover, tested with inference workload\n    \"\"\"Predict tags (with probabilities) for input data from a dataframe.\n\n    Args:\n        df (pd.DataFrame): dataframe with input features.\n        predictor (TorchPredictor): loaded predictor from a checkpoint.\n\n    Returns:\n        List: list of predicted labels.\n    \"\"\"\n    preprocessor = predictor.get_preprocessor()\n    preprocessed_ds = preprocessor.transform(ds)\n    outputs = preprocessed_ds.map_batches(predictor.predict_proba)\n    y_prob = np.array([d[\"output\"] for d in outputs.take_all()])\n    results = []\n    for i, prob in enumerate(y_prob):\n        tag = preprocessor.index_to_class[prob.argmax()]\n        results.append({\"prediction\": tag, \"probabilities\": format_prob(prob, preprocessor.index_to_class)})\n    return results\n\n\n@app.command()\ndef get_best_run_id(experiment_name: str = \"\", metric: str = \"\", mode: str = \"\") -> str:  # pragma: no cover, mlflow logic\n    \"\"\"Get the best run_id from an MLflow experiment.\n\n    Args:\n        experiment_name (str): name of the experiment.\n        metric (str): metric to filter by.\n        mode (str): direction of metric (ASC/DESC).\n\n    Returns:\n        str: best run id from experiment.\n    \"\"\"\n    sorted_runs = mlflow.search_runs(\n        experiment_names=[experiment_name],\n        order_by=[f\"metrics.{metric} {mode}\"],\n    )\n    run_id = sorted_runs.iloc[0].run_id\n    print(run_id)\n    return run_id\n\n\ndef get_best_checkpoint(run_id: str) -> TorchCheckpoint:  # pragma: no cover, mlflow logic\n    \"\"\"Get the best checkpoint from a specific run.\n\n    Args:\n        run_id (str): ID of the run to get the best checkpoint from.\n\n    Returns:\n        TorchCheckpoint: Best checkpoint from the run.\n    \"\"\"\n    artifact_dir = urlparse(mlflow.get_run(run_id).info.artifact_uri).path  # get path from mlflow\n    results = Result.from_path(artifact_dir)\n    return results.best_checkpoints[0][0]\n\n\n@app.command()\ndef predict(\n    run_id: Annotated[str, typer.Option(help=\"id of the specific run to load from\")] = None,\n    title: Annotated[str, typer.Option(help=\"project title\")] = None,\n    description: Annotated[str, typer.Option(help=\"project description\")] = None,\n) -> Dict:  # pragma: no cover, tested with inference workload\n    \"\"\"Predict the tag for a project given it's title and description.\n\n    Args:\n        run_id (str): id of the specific run to load from. Defaults to None.\n        title (str, optional): project title. Defaults to \"\".\n        description (str, optional): project description. Defaults to \"\".\n\n    Returns:\n        Dict: prediction results for the input data.\n    \"\"\"\n    # Load components\n    best_checkpoint = get_best_checkpoint(run_id=run_id)\n    predictor = TorchPredictor.from_checkpoint(best_checkpoint)\n\n    # Predict\n    sample_ds = ray.data.from_items([{\"title\": title, \"description\": description, \"tag\": \"other\"}])\n    results = predict_proba(ds=sample_ds, predictor=predictor)\n    logger.info(json.dumps(results, cls=NumpyEncoder, indent=2))\n    return results\n\n\nif __name__ == \"__main__\":  # pragma: no cover, application\n    app()\n"
  },
  {
    "path": "madewithml/serve.py",
    "content": "import argparse\nimport os\nfrom http import HTTPStatus\nfrom typing import Dict\n\nimport ray\nfrom fastapi import FastAPI\nfrom ray import serve\nfrom starlette.requests import Request\n\nfrom madewithml import evaluate, predict\nfrom madewithml.config import MLFLOW_TRACKING_URI, mlflow\n\n# Define application\napp = FastAPI(\n    title=\"Made With ML\",\n    description=\"Classify machine learning projects.\",\n    version=\"0.1\",\n)\n\n\n@serve.deployment(num_replicas=\"1\", ray_actor_options={\"num_cpus\": 8, \"num_gpus\": 0})\n@serve.ingress(app)\nclass ModelDeployment:\n    def __init__(self, run_id: str, threshold: int = 0.9):\n        \"\"\"Initialize the model.\"\"\"\n        self.run_id = run_id\n        self.threshold = threshold\n        mlflow.set_tracking_uri(MLFLOW_TRACKING_URI)  # so workers have access to model registry\n        best_checkpoint = predict.get_best_checkpoint(run_id=run_id)\n        self.predictor = predict.TorchPredictor.from_checkpoint(best_checkpoint)\n\n    @app.get(\"/\")\n    def _index(self) -> Dict:\n        \"\"\"Health check.\"\"\"\n        response = {\n            \"message\": HTTPStatus.OK.phrase,\n            \"status-code\": HTTPStatus.OK,\n            \"data\": {},\n        }\n        return response\n\n    @app.get(\"/run_id/\")\n    def _run_id(self) -> Dict:\n        \"\"\"Get the run ID.\"\"\"\n        return {\"run_id\": self.run_id}\n\n    @app.post(\"/evaluate/\")\n    async def _evaluate(self, request: Request) -> Dict:\n        data = await request.json()\n        results = evaluate.evaluate(run_id=self.run_id, dataset_loc=data.get(\"dataset\"))\n        return {\"results\": results}\n\n    @app.post(\"/predict/\")\n    async def _predict(self, request: Request):\n        data = await request.json()\n        sample_ds = ray.data.from_items([{\"title\": data.get(\"title\", \"\"), \"description\": data.get(\"description\", \"\"), \"tag\": \"\"}])\n        results = predict.predict_proba(ds=sample_ds, predictor=self.predictor)\n\n        # Apply custom logic\n        for i, result in enumerate(results):\n            pred = result[\"prediction\"]\n            prob = result[\"probabilities\"]\n            if prob[pred] < self.threshold:\n                results[i][\"prediction\"] = \"other\"\n\n        return {\"results\": results}\n\n\nif __name__ == \"__main__\":\n    parser = argparse.ArgumentParser()\n    parser.add_argument(\"--run_id\", help=\"run ID to use for serving.\")\n    parser.add_argument(\"--threshold\", type=float, default=0.9, help=\"threshold for `other` class.\")\n    args = parser.parse_args()\n    ray.init(runtime_env={\"env_vars\": {\"GITHUB_USERNAME\": os.environ[\"GITHUB_USERNAME\"]}})\n    serve.run(ModelDeployment.bind(run_id=args.run_id, threshold=args.threshold))\n"
  },
  {
    "path": "madewithml/train.py",
    "content": "import datetime\nimport json\nimport os\nimport tempfile\nfrom typing import Tuple\n\nimport numpy as np\nimport ray\nimport ray.train as train\nimport torch\nimport torch.nn as nn\nimport torch.nn.functional as F\nimport typer\nfrom ray.air.integrations.mlflow import MLflowLoggerCallback\nfrom ray.data import Dataset\nfrom ray.train import (\n    Checkpoint,\n    CheckpointConfig,\n    DataConfig,\n    RunConfig,\n    ScalingConfig,\n)\nfrom ray.train.torch import TorchTrainer\nfrom torch.nn.parallel.distributed import DistributedDataParallel\nfrom transformers import BertModel\nfrom typing_extensions import Annotated\n\nfrom madewithml import data, utils\nfrom madewithml.config import EFS_DIR, MLFLOW_TRACKING_URI, logger\nfrom madewithml.models import FinetunedLLM\n\n# Initialize Typer CLI app\napp = typer.Typer()\n\n\ndef train_step(\n    ds: Dataset,\n    batch_size: int,\n    model: nn.Module,\n    num_classes: int,\n    loss_fn: torch.nn.modules.loss._WeightedLoss,\n    optimizer: torch.optim.Optimizer,\n) -> float:  # pragma: no cover, tested via train workload\n    \"\"\"Train step.\n\n    Args:\n        ds (Dataset): dataset to iterate batches from.\n        batch_size (int): size of each batch.\n        model (nn.Module): model to train.\n        num_classes (int): number of classes.\n        loss_fn (torch.nn.loss._WeightedLoss): loss function to use between labels and predictions.\n        optimizer (torch.optimizer.Optimizer): optimizer to use for updating the model's weights.\n\n    Returns:\n        float: cumulative loss for the dataset.\n    \"\"\"\n    model.train()\n    loss = 0.0\n    ds_generator = ds.iter_torch_batches(batch_size=batch_size, collate_fn=utils.collate_fn)\n    for i, batch in enumerate(ds_generator):\n        optimizer.zero_grad()  # reset gradients\n        z = model(batch)  # forward pass\n        targets = F.one_hot(batch[\"targets\"], num_classes=num_classes).float()  # one-hot (for loss_fn)\n        J = loss_fn(z, targets)  # define loss\n        J.backward()  # backward pass\n        optimizer.step()  # update weights\n        loss += (J.detach().item() - loss) / (i + 1)  # cumulative loss\n    return loss\n\n\ndef eval_step(\n    ds: Dataset, batch_size: int, model: nn.Module, num_classes: int, loss_fn: torch.nn.modules.loss._WeightedLoss\n) -> Tuple[float, np.array, np.array]:  # pragma: no cover, tested via train workload\n    \"\"\"Eval step.\n\n    Args:\n        ds (Dataset): dataset to iterate batches from.\n        batch_size (int): size of each batch.\n        model (nn.Module): model to train.\n        num_classes (int): number of classes.\n        loss_fn (torch.nn.loss._WeightedLoss): loss function to use between labels and predictions.\n\n    Returns:\n        Tuple[float, np.array, np.array]: cumulative loss, ground truths and predictions.\n    \"\"\"\n    model.eval()\n    loss = 0.0\n    y_trues, y_preds = [], []\n    ds_generator = ds.iter_torch_batches(batch_size=batch_size, collate_fn=utils.collate_fn)\n    with torch.inference_mode():\n        for i, batch in enumerate(ds_generator):\n            z = model(batch)\n            targets = F.one_hot(batch[\"targets\"], num_classes=num_classes).float()  # one-hot (for loss_fn)\n            J = loss_fn(z, targets).item()\n            loss += (J - loss) / (i + 1)\n            y_trues.extend(batch[\"targets\"].cpu().numpy())\n            y_preds.extend(torch.argmax(z, dim=1).cpu().numpy())\n    return loss, np.vstack(y_trues), np.vstack(y_preds)\n\n\ndef train_loop_per_worker(config: dict) -> None:  # pragma: no cover, tested via train workload\n    \"\"\"Training loop that each worker will execute.\n\n    Args:\n        config (dict): arguments to use for training.\n    \"\"\"\n    # Hyperparameters\n    dropout_p = config[\"dropout_p\"]\n    lr = config[\"lr\"]\n    lr_factor = config[\"lr_factor\"]\n    lr_patience = config[\"lr_patience\"]\n    num_epochs = config[\"num_epochs\"]\n    batch_size = config[\"batch_size\"]\n    num_classes = config[\"num_classes\"]\n\n    # Get datasets\n    utils.set_seeds()\n    train_ds = train.get_dataset_shard(\"train\")\n    val_ds = train.get_dataset_shard(\"val\")\n\n    # Model\n    llm = BertModel.from_pretrained(\"allenai/scibert_scivocab_uncased\", return_dict=False)\n    model = FinetunedLLM(llm=llm, dropout_p=dropout_p, embedding_dim=llm.config.hidden_size, num_classes=num_classes)\n    model = train.torch.prepare_model(model)\n\n    # Training components\n    loss_fn = nn.BCEWithLogitsLoss()\n    optimizer = torch.optim.Adam(model.parameters(), lr=lr)\n    scheduler = torch.optim.lr_scheduler.ReduceLROnPlateau(optimizer, mode=\"min\", factor=lr_factor, patience=lr_patience)\n\n    # Training\n    num_workers = train.get_context().get_world_size()\n    batch_size_per_worker = batch_size // num_workers\n    for epoch in range(num_epochs):\n        # Step\n        train_loss = train_step(train_ds, batch_size_per_worker, model, num_classes, loss_fn, optimizer)\n        val_loss, _, _ = eval_step(val_ds, batch_size_per_worker, model, num_classes, loss_fn)\n        scheduler.step(val_loss)\n\n        # Checkpoint\n        with tempfile.TemporaryDirectory() as dp:\n            if isinstance(model, DistributedDataParallel):  # cpu\n                model.module.save(dp=dp)\n            else:\n                model.save(dp=dp)\n            metrics = dict(epoch=epoch, lr=optimizer.param_groups[0][\"lr\"], train_loss=train_loss, val_loss=val_loss)\n            checkpoint = Checkpoint.from_directory(dp)\n            train.report(metrics, checkpoint=checkpoint)\n\n\n@app.command()\ndef train_model(\n    experiment_name: Annotated[str, typer.Option(help=\"name of the experiment for this training workload.\")] = None,\n    dataset_loc: Annotated[str, typer.Option(help=\"location of the dataset.\")] = None,\n    train_loop_config: Annotated[str, typer.Option(help=\"arguments to use for training.\")] = None,\n    num_workers: Annotated[int, typer.Option(help=\"number of workers to use for training.\")] = 1,\n    cpu_per_worker: Annotated[int, typer.Option(help=\"number of CPUs to use per worker.\")] = 1,\n    gpu_per_worker: Annotated[int, typer.Option(help=\"number of GPUs to use per worker.\")] = 0,\n    num_samples: Annotated[int, typer.Option(help=\"number of samples to use from dataset.\")] = None,\n    num_epochs: Annotated[int, typer.Option(help=\"number of epochs to train for.\")] = 1,\n    batch_size: Annotated[int, typer.Option(help=\"number of samples per batch.\")] = 256,\n    results_fp: Annotated[str, typer.Option(help=\"filepath to save results to.\")] = None,\n) -> ray.air.result.Result:\n    \"\"\"Main train function to train our model as a distributed workload.\n\n    Args:\n        experiment_name (str): name of the experiment for this training workload.\n        dataset_loc (str): location of the dataset.\n        train_loop_config (str): arguments to use for training.\n        num_workers (int, optional): number of workers to use for training. Defaults to 1.\n        cpu_per_worker (int, optional): number of CPUs to use per worker. Defaults to 1.\n        gpu_per_worker (int, optional): number of GPUs to use per worker. Defaults to 0.\n        num_samples (int, optional): number of samples to use from dataset.\n            If this is passed in, it will override the config. Defaults to None.\n        num_epochs (int, optional): number of epochs to train for.\n            If this is passed in, it will override the config. Defaults to None.\n        batch_size (int, optional): number of samples per batch.\n            If this is passed in, it will override the config. Defaults to None.\n        results_fp (str, optional): filepath to save results to. Defaults to None.\n\n    Returns:\n        ray.air.result.Result: training results.\n    \"\"\"\n    # Set up\n    train_loop_config = json.loads(train_loop_config)\n    train_loop_config[\"num_samples\"] = num_samples\n    train_loop_config[\"num_epochs\"] = num_epochs\n    train_loop_config[\"batch_size\"] = batch_size\n\n    # Scaling config\n    scaling_config = ScalingConfig(\n        num_workers=num_workers,\n        use_gpu=bool(gpu_per_worker),\n        resources_per_worker={\"CPU\": cpu_per_worker, \"GPU\": gpu_per_worker},\n    )\n\n    # Checkpoint config\n    checkpoint_config = CheckpointConfig(\n        num_to_keep=1,\n        checkpoint_score_attribute=\"val_loss\",\n        checkpoint_score_order=\"min\",\n    )\n\n    # MLflow callback\n    mlflow_callback = MLflowLoggerCallback(\n        tracking_uri=MLFLOW_TRACKING_URI,\n        experiment_name=experiment_name,\n        save_artifact=True,\n    )\n\n    # Run config\n    run_config = RunConfig(callbacks=[mlflow_callback], checkpoint_config=checkpoint_config, storage_path=EFS_DIR, local_dir=EFS_DIR)\n\n    # Dataset\n    ds = data.load_data(dataset_loc=dataset_loc, num_samples=train_loop_config[\"num_samples\"])\n    train_ds, val_ds = data.stratify_split(ds, stratify=\"tag\", test_size=0.2)\n    tags = train_ds.unique(column=\"tag\")\n    train_loop_config[\"num_classes\"] = len(tags)\n\n    # Dataset config\n    options = ray.data.ExecutionOptions(preserve_order=True)\n    dataset_config = DataConfig(datasets_to_split=[\"train\"], execution_options=options)\n\n    # Preprocess\n    preprocessor = data.CustomPreprocessor()\n    preprocessor = preprocessor.fit(train_ds)\n    train_ds = preprocessor.transform(train_ds)\n    val_ds = preprocessor.transform(val_ds)\n    train_ds = train_ds.materialize()\n    val_ds = val_ds.materialize()\n\n    # Trainer\n    trainer = TorchTrainer(\n        train_loop_per_worker=train_loop_per_worker,\n        train_loop_config=train_loop_config,\n        scaling_config=scaling_config,\n        run_config=run_config,\n        datasets={\"train\": train_ds, \"val\": val_ds},\n        dataset_config=dataset_config,\n        metadata={\"class_to_index\": preprocessor.class_to_index},\n    )\n\n    # Train\n    results = trainer.fit()\n    d = {\n        \"timestamp\": datetime.datetime.now().strftime(\"%B %d, %Y %I:%M:%S %p\"),\n        \"run_id\": utils.get_run_id(experiment_name=experiment_name, trial_id=results.metrics[\"trial_id\"]),\n        \"params\": results.config[\"train_loop_config\"],\n        \"metrics\": utils.dict_to_list(results.metrics_dataframe.to_dict(), keys=[\"epoch\", \"train_loss\", \"val_loss\"]),\n    }\n    logger.info(json.dumps(d, indent=2))\n    if results_fp:  # pragma: no cover, saving results\n        utils.save_dict(d, results_fp)\n    return results\n\n\nif __name__ == \"__main__\":  # pragma: no cover, application\n    if ray.is_initialized():\n        ray.shutdown()\n    ray.init(runtime_env={\"env_vars\": {\"GITHUB_USERNAME\": os.environ[\"GITHUB_USERNAME\"]}})\n    app()\n"
  },
  {
    "path": "madewithml/tune.py",
    "content": "import datetime\nimport json\nimport os\n\nimport ray\nimport typer\nfrom ray import tune\nfrom ray.air.config import (\n    CheckpointConfig,\n    DatasetConfig,\n    RunConfig,\n    ScalingConfig,\n)\nfrom ray.air.integrations.mlflow import MLflowLoggerCallback\nfrom ray.train.torch import TorchTrainer\nfrom ray.tune import Tuner\nfrom ray.tune.schedulers import AsyncHyperBandScheduler\nfrom ray.tune.search import ConcurrencyLimiter\nfrom ray.tune.search.hyperopt import HyperOptSearch\nfrom typing_extensions import Annotated\n\nfrom madewithml import data, train, utils\nfrom madewithml.config import EFS_DIR, MLFLOW_TRACKING_URI, logger\n\n# Initialize Typer CLI app\napp = typer.Typer()\n\n\n@app.command()\ndef tune_models(\n    experiment_name: Annotated[str, typer.Option(help=\"name of the experiment for this training workload.\")] = None,\n    dataset_loc: Annotated[str, typer.Option(help=\"location of the dataset.\")] = None,\n    initial_params: Annotated[str, typer.Option(help=\"initial config for the tuning workload.\")] = None,\n    num_workers: Annotated[int, typer.Option(help=\"number of workers to use for training.\")] = 1,\n    cpu_per_worker: Annotated[int, typer.Option(help=\"number of CPUs to use per worker.\")] = 1,\n    gpu_per_worker: Annotated[int, typer.Option(help=\"number of GPUs to use per worker.\")] = 0,\n    num_runs: Annotated[int, typer.Option(help=\"number of runs in this tuning experiment.\")] = 1,\n    num_samples: Annotated[int, typer.Option(help=\"number of samples to use from dataset.\")] = None,\n    num_epochs: Annotated[int, typer.Option(help=\"number of epochs to train for.\")] = 1,\n    batch_size: Annotated[int, typer.Option(help=\"number of samples per batch.\")] = 256,\n    results_fp: Annotated[str, typer.Option(help=\"filepath to save results to.\")] = None,\n) -> ray.tune.result_grid.ResultGrid:\n    \"\"\"Hyperparameter tuning experiment.\n\n    Args:\n        experiment_name (str): name of the experiment for this training workload.\n        dataset_loc (str): location of the dataset.\n        initial_params (str): initial config for the tuning workload.\n        num_workers (int, optional): number of workers to use for training. Defaults to 1.\n        cpu_per_worker (int, optional): number of CPUs to use per worker. Defaults to 1.\n        gpu_per_worker (int, optional): number of GPUs to use per worker. Defaults to 0.\n        num_runs (int, optional): number of runs in this tuning experiment. Defaults to 1.\n        num_samples (int, optional): number of samples to use from dataset.\n            If this is passed in, it will override the config. Defaults to None.\n        num_epochs (int, optional): number of epochs to train for.\n            If this is passed in, it will override the config. Defaults to None.\n        batch_size (int, optional): number of samples per batch.\n            If this is passed in, it will override the config. Defaults to None.\n        results_fp (str, optional): filepath to save the tuning results. Defaults to None.\n\n    Returns:\n        ray.tune.result_grid.ResultGrid: results of the tuning experiment.\n    \"\"\"\n    # Set up\n    utils.set_seeds()\n    train_loop_config = {}\n    train_loop_config[\"num_samples\"] = num_samples\n    train_loop_config[\"num_epochs\"] = num_epochs\n    train_loop_config[\"batch_size\"] = batch_size\n\n    # Scaling config\n    scaling_config = ScalingConfig(\n        num_workers=num_workers,\n        use_gpu=bool(gpu_per_worker),\n        resources_per_worker={\"CPU\": cpu_per_worker, \"GPU\": gpu_per_worker},\n    )\n\n    # Dataset\n    ds = data.load_data(dataset_loc=dataset_loc, num_samples=train_loop_config.get(\"num_samples\", None))\n    train_ds, val_ds = data.stratify_split(ds, stratify=\"tag\", test_size=0.2)\n    tags = train_ds.unique(column=\"tag\")\n    train_loop_config[\"num_classes\"] = len(tags)\n\n    # Dataset config\n    dataset_config = {\n        \"train\": DatasetConfig(fit=False, transform=False, randomize_block_order=False),\n        \"val\": DatasetConfig(fit=False, transform=False, randomize_block_order=False),\n    }\n\n    # Preprocess\n    preprocessor = data.CustomPreprocessor()\n    preprocessor = preprocessor.fit(train_ds)\n    train_ds = preprocessor.transform(train_ds)\n    val_ds = preprocessor.transform(val_ds)\n    train_ds = train_ds.materialize()\n    val_ds = val_ds.materialize()\n\n    # Trainer\n    trainer = TorchTrainer(\n        train_loop_per_worker=train.train_loop_per_worker,\n        train_loop_config=train_loop_config,\n        scaling_config=scaling_config,\n        datasets={\"train\": train_ds, \"val\": val_ds},\n        dataset_config=dataset_config,\n        metadata={\"class_to_index\": preprocessor.class_to_index},\n    )\n\n    # Checkpoint configuration\n    checkpoint_config = CheckpointConfig(\n        num_to_keep=1,\n        checkpoint_score_attribute=\"val_loss\",\n        checkpoint_score_order=\"min\",\n    )\n\n    # Run configuration\n    mlflow_callback = MLflowLoggerCallback(\n        tracking_uri=MLFLOW_TRACKING_URI,\n        experiment_name=experiment_name,\n        save_artifact=True,\n    )\n    run_config = RunConfig(callbacks=[mlflow_callback], checkpoint_config=checkpoint_config, storage_path=EFS_DIR, local_dir=EFS_DIR)\n\n    # Hyperparameters to start with\n    initial_params = json.loads(initial_params)\n    search_alg = HyperOptSearch(points_to_evaluate=initial_params)\n    search_alg = ConcurrencyLimiter(search_alg, max_concurrent=2)  # trade off b/w optimization and search space\n\n    # Parameter space\n    param_space = {\n        \"train_loop_config\": {\n            \"dropout_p\": tune.uniform(0.3, 0.9),\n            \"lr\": tune.loguniform(1e-5, 5e-4),\n            \"lr_factor\": tune.uniform(0.1, 0.9),\n            \"lr_patience\": tune.uniform(1, 10),\n        }\n    }\n\n    # Scheduler\n    scheduler = AsyncHyperBandScheduler(\n        max_t=train_loop_config[\"num_epochs\"],  # max epoch (<time_attr>) per trial\n        grace_period=1,  # min epoch (<time_attr>) per trial\n    )\n\n    # Tune config\n    tune_config = tune.TuneConfig(\n        metric=\"val_loss\",\n        mode=\"min\",\n        search_alg=search_alg,\n        scheduler=scheduler,\n        num_samples=num_runs,\n    )\n\n    # Tuner\n    tuner = Tuner(\n        trainable=trainer,\n        run_config=run_config,\n        param_space=param_space,\n        tune_config=tune_config,\n    )\n\n    # Tune\n    results = tuner.fit()\n    best_trial = results.get_best_result(metric=\"val_loss\", mode=\"min\")\n    d = {\n        \"timestamp\": datetime.datetime.now().strftime(\"%B %d, %Y %I:%M:%S %p\"),\n        \"run_id\": utils.get_run_id(experiment_name=experiment_name, trial_id=best_trial.metrics[\"trial_id\"]),\n        \"params\": best_trial.config[\"train_loop_config\"],\n        \"metrics\": utils.dict_to_list(best_trial.metrics_dataframe.to_dict(), keys=[\"epoch\", \"train_loss\", \"val_loss\"]),\n    }\n    logger.info(json.dumps(d, indent=2))\n    if results_fp:  # pragma: no cover, saving results\n        utils.save_dict(d, results_fp)\n    return results\n\n\nif __name__ == \"__main__\":  # pragma: no cover, application\n    if ray.is_initialized():\n        ray.shutdown()\n    ray.init(runtime_env={\"env_vars\": {\"GITHUB_USERNAME\": os.environ[\"GITHUB_USERNAME\"]}})\n    app()\n"
  },
  {
    "path": "madewithml/utils.py",
    "content": "import json\nimport os\nimport random\nfrom typing import Any, Dict, List\n\nimport numpy as np\nimport torch\nfrom ray.data import DatasetContext\nfrom ray.train.torch import get_device\n\nfrom madewithml.config import mlflow\n\nDatasetContext.get_current().execution_options.preserve_order = True\n\n\ndef set_seeds(seed: int = 42):\n    \"\"\"Set seeds for reproducibility.\"\"\"\n    np.random.seed(seed)\n    random.seed(seed)\n    torch.manual_seed(seed)\n    torch.cuda.manual_seed(seed)\n    eval(\"setattr(torch.backends.cudnn, 'deterministic', True)\")\n    eval(\"setattr(torch.backends.cudnn, 'benchmark', False)\")\n    os.environ[\"PYTHONHASHSEED\"] = str(seed)\n\n\ndef load_dict(path: str) -> Dict:\n    \"\"\"Load a dictionary from a JSON's filepath.\n\n    Args:\n        path (str): location of file.\n\n    Returns:\n        Dict: loaded JSON data.\n    \"\"\"\n    with open(path) as fp:\n        d = json.load(fp)\n    return d\n\n\ndef save_dict(d: Dict, path: str, cls: Any = None, sortkeys: bool = False) -> None:\n    \"\"\"Save a dictionary to a specific location.\n\n    Args:\n        d (Dict): data to save.\n        path (str): location of where to save the data.\n        cls (optional): encoder to use on dict data. Defaults to None.\n        sortkeys (bool, optional): whether to sort keys alphabetically. Defaults to False.\n    \"\"\"\n    directory = os.path.dirname(path)\n    if directory and not os.path.exists(directory):  # pragma: no cover\n        os.makedirs(directory)\n    with open(path, \"w\") as fp:\n        json.dump(d, indent=2, fp=fp, cls=cls, sort_keys=sortkeys)\n        fp.write(\"\\n\")\n\n\ndef pad_array(arr: np.ndarray, dtype=np.int32) -> np.ndarray:\n    \"\"\"Pad an 2D array with zeros until all rows in the\n    2D array are of the same length as a the longest\n    row in the 2D array.\n\n    Args:\n        arr (np.array): input array\n\n    Returns:\n        np.array: zero padded array\n    \"\"\"\n    max_len = max(len(row) for row in arr)\n    padded_arr = np.zeros((arr.shape[0], max_len), dtype=dtype)\n    for i, row in enumerate(arr):\n        padded_arr[i][: len(row)] = row\n    return padded_arr\n\n\ndef collate_fn(batch: Dict[str, np.ndarray]) -> Dict[str, torch.Tensor]:  # pragma: no cover, air internal\n    \"\"\"Convert a batch of numpy arrays to tensors (with appropriate padding).\n\n    Args:\n        batch (Dict[str, np.ndarray]): input batch as a dictionary of numpy arrays.\n\n    Returns:\n        Dict[str, torch.Tensor]: output batch as a dictionary of tensors.\n    \"\"\"\n    batch[\"ids\"] = pad_array(batch[\"ids\"])\n    batch[\"masks\"] = pad_array(batch[\"masks\"])\n    dtypes = {\"ids\": torch.int32, \"masks\": torch.int32, \"targets\": torch.int64}\n    tensor_batch = {}\n    for key, array in batch.items():\n        tensor_batch[key] = torch.as_tensor(array, dtype=dtypes[key], device=get_device())\n    return tensor_batch\n\n\ndef get_run_id(experiment_name: str, trial_id: str) -> str:  # pragma: no cover, mlflow functionality\n    \"\"\"Get the MLflow run ID for a specific Ray trial ID.\n\n    Args:\n        experiment_name (str): name of the experiment.\n        trial_id (str): id of the trial.\n\n    Returns:\n        str: run id of the trial.\n    \"\"\"\n    trial_name = f\"TorchTrainer_{trial_id}\"\n    run = mlflow.search_runs(experiment_names=[experiment_name], filter_string=f\"tags.trial_name = '{trial_name}'\").iloc[0]\n    return run.run_id\n\n\ndef dict_to_list(data: Dict, keys: List[str]) -> List[Dict[str, Any]]:\n    \"\"\"Convert a dictionary to a list of dictionaries.\n\n    Args:\n        data (Dict): input dictionary.\n        keys (List[str]): keys to include in the output list of dictionaries.\n\n    Returns:\n        List[Dict[str, Any]]: output list of dictionaries.\n    \"\"\"\n    list_of_dicts = []\n    for i in range(len(data[keys[0]])):\n        new_dict = {key: data[key][i] for key in keys}\n        list_of_dicts.append(new_dict)\n    return list_of_dicts\n"
  },
  {
    "path": "mkdocs.yml",
    "content": "site_name: Made With ML\nsite_url: https://madewithml.com/\nrepo_url: https://github.com/GokuMohandas/Made-With-ML/\nnav:\n  - Home: index.md\n  - madewithml:\n    - data: madewithml/data.md\n    - models: madewithml/models.md\n    - train: madewithml/train.md\n    - tune: madewithml/tune.md\n    - evaluate: madewithml/evaluate.md\n    - predict: madewithml/predict.md\n    - serve: madewithml/serve.md\n    - utils: madewithml/utils.md\ntheme: readthedocs\nplugins:\n  - mkdocstrings\nwatch:\n  - .  # reload docs for any file changes\n"
  },
  {
    "path": "notebooks/benchmarks.ipynb",
    "content": "{\n \"cells\": [\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"abb04d61-c097-45a9-9201-e3649cbdc0cc\",\n   \"metadata\": {},\n   \"source\": [\n    \"<div align=\\\"center\\\">\\n\",\n    \"<h1><img width=\\\"30\\\" src=\\\"https://madewithml.com/static/images/rounded_logo.png\\\">&nbsp;<a href=\\\"https://madewithml.com/\\\">Made With ML</a></h1>\\n\",\n    \"    <h3>ML for Developers</h3>\\n\",\n    \"    Design · Develop · Deploy · Iterate\\n\",\n    \"</div>\\n\",\n    \"\\n\",\n    \"<br>\\n\",\n    \"\\n\",\n    \"<div align=\\\"center\\\">\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://madewithml.com\\\"><img src=\\\"https://img.shields.io/badge/Subscribe-40K-brightgreen\\\"></a>&nbsp;\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://github.com/GokuMohandas/MadeWithML\\\"><img src=\\\"https://img.shields.io/github/stars/GokuMohandas/MadeWithML.svg?style=social&label=Star\\\"></a>&nbsp;\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://www.linkedin.com/in/goku\\\"><img src=\\\"https://img.shields.io/badge/style--5eba00.svg?label=LinkedIn&logo=linkedin&style=social\\\"></a>&nbsp;\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://twitter.com/GokuMohandas\\\"><img src=\\\"https://img.shields.io/twitter/follow/GokuMohandas.svg?label=Follow&style=social\\\"></a>\\n\",\n    \"    <br>\\n\",\n    \"    🔥&nbsp; Among the <a href=\\\"https://github.com/GokuMohandas/MadeWithML\\\" target=\\\"_blank\\\">top ML</a> repositories on GitHub\\n\",\n    \"</div>\\n\",\n    \"\\n\",\n    \"<br>\\n\",\n    \"<hr>\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"3012ac29-11de-458c-9023-1a216812f943\",\n   \"metadata\": {},\n   \"source\": [\n    \"# Generative AI\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"9dffe7be-4a8f-499a-9531-fa4bbab228ef\",\n   \"metadata\": {},\n   \"source\": [\n    \"In our [Made With ML course](https://madewithml.com/) we will be fine-tuning an LLM for a supervised classification task. The specific class of LLMs we'll be using is called [BERT](https://en.wikipedia.org/wiki/BERT_(language_model)). Bert models are encoder-only models and are the gold-standard for supervised NLP tasks. However, you may be wondering how do all the (much larger) LLM, created for generative applications, fare ([GPT 4](https://openai.com/research/gpt-4), [Falcon 40B](https://huggingface.co/tiiuae/falcon-40b), [Llama 2](https://ai.meta.com/llama/), etc.)?\\n\",\n    \"\\n\",\n    \"> We chose the smaller BERT model for our course because it's easier to train and fine-tune. However, the workflow for fine-tuning the larger LLMs are quite similar as well. They do require much more compute but Ray abstracts away the scaling complexities involved with that.\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"d877530b-f3c5-429a-8525-1238c5b8693b\",\n   \"metadata\": {},\n   \"source\": [\n    \"## Set up\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"e2c96931-d511-4c6e-b582-87d24455a11e\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"!pip install openai==0.27.8 tqdm==4.65.0 -q\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"c9fb2cc9\",\n   \"metadata\": {},\n   \"source\": [\n    \"You'll need to first sign up for an [OpenAI account](https://platform.openai.com/signup) and then grab your API key from [here](https://platform.openai.com/account/api-keys).\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"953a577e-3cd0-4c6b-81f9-8bc32850214d\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import openai\\n\",\n    \"openai.api_key = \\\"YOUR_API_KEY\\\"\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"3d40cf2d-afa2-41b6-8f03-77b50cc3baca\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Load data\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"1790e2f5-6b8b-425c-8842-a2b0ea8f3f07\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import pandas as pd\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"6b9bfadb-ba49-4f5a-b216-4db14c8888ab\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>id</th>\\n\",\n       \"      <th>created_on</th>\\n\",\n       \"      <th>title</th>\\n\",\n       \"      <th>description</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>2020-02-20 06:43:18</td>\\n\",\n       \"      <td>Comparison between YOLO and RCNN on real world...</td>\\n\",\n       \"      <td>Bringing theory to experiment is cool. We can ...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>2020-02-20 06:47:21</td>\\n\",\n       \"      <td>Show, Infer &amp; Tell: Contextual Inference for C...</td>\\n\",\n       \"      <td>The beauty of the work lies in the way it arch...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>2020-02-24 16:24:45</td>\\n\",\n       \"      <td>Awesome Graph Classification</td>\\n\",\n       \"      <td>A collection of important graph embedding, cla...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>15</td>\\n\",\n       \"      <td>2020-02-28 23:55:26</td>\\n\",\n       \"      <td>Awesome Monte Carlo Tree Search</td>\\n\",\n       \"      <td>A curated list of Monte Carlo tree search pape...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>25</td>\\n\",\n       \"      <td>2020-03-07 23:04:31</td>\\n\",\n       \"      <td>AttentionWalk</td>\\n\",\n       \"      <td>A PyTorch Implementation of \\\"Watch Your Step: ...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   id           created_on                                              title   \\n\",\n       \"0   6  2020-02-20 06:43:18  Comparison between YOLO and RCNN on real world...  \\\\\\n\",\n       \"1   7  2020-02-20 06:47:21  Show, Infer & Tell: Contextual Inference for C...   \\n\",\n       \"2   9  2020-02-24 16:24:45                       Awesome Graph Classification   \\n\",\n       \"3  15  2020-02-28 23:55:26                    Awesome Monte Carlo Tree Search   \\n\",\n       \"4  25  2020-03-07 23:04:31                                      AttentionWalk   \\n\",\n       \"\\n\",\n       \"                                         description              tag  \\n\",\n       \"0  Bringing theory to experiment is cool. We can ...  computer-vision  \\n\",\n       \"1  The beauty of the work lies in the way it arch...  computer-vision  \\n\",\n       \"2  A collection of important graph embedding, cla...            other  \\n\",\n       \"3  A curated list of Monte Carlo tree search pape...            other  \\n\",\n       \"4  A PyTorch Implementation of \\\"Watch Your Step: ...            other  \"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Load training data\\n\",\n    \"DATASET_LOC = \\\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\\\"\\n\",\n    \"train_df = pd.read_csv(DATASET_LOC)\\n\",\n    \"train_df.head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"aa5b95d5-d61e-48e4-9100-d9d2fc0d53fa\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"['computer-vision', 'other', 'natural-language-processing', 'mlops']\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Unique labels\\n\",\n    \"tags = train_df.tag.unique().tolist()\\n\",\n    \"tags\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"3c828129-8248-4e38-93a4-cabb097e7ba5\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Load inference dataset\\n\",\n    \"HOLDOUT_LOC = \\\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/holdout.csv\\\"\\n\",\n    \"test_df = pd.read_csv(HOLDOUT_LOC)\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"085dd167-0bee-4167-b1b7-d5797ebda30b\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Utilities\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"5686dd79-02bc-4f11-8948-888b58bd504c\",\n   \"metadata\": {},\n   \"source\": [\n    \"We'll define a few utility functions to make the OpenAI request and to store our predictions. While we could perform batch prediction by loading samples until the context length is reached, we'll just perform one at a time since it's not too many data points and we can have fully deterministic behavior (if you insert new data, etc.). We'll also added some reliability in case we overload the endpoints with too many request at once.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"8e3c3f44-2c19-4c32-9bc5-e9a7a917d19d\",\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"import json\\n\",\n    \"from collections import Counter\\n\",\n    \"import matplotlib.pyplot as plt\\n\",\n    \"import seaborn as sns; sns.set_theme()\\n\",\n    \"from sklearn.metrics import precision_recall_fscore_support\\n\",\n    \"import time\\n\",\n    \"from tqdm import tqdm\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"4950bdb4\",\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"I'm an AI with no emotions, just code,\\n\",\n      \"But I'm here to help you, lighten your load.\\n\",\n      \"So ask me questions, and I'll do my best,\\n\",\n      \"To answer in rhymes, and put your mind at rest.\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Query OpenAI endpoint\\n\",\n    \"system_content = \\\"you only answer in rhymes\\\"  # system content (behavior)\\n\",\n    \"assistant_content = \\\"\\\"  # assistant content (context)\\n\",\n    \"user_content = \\\"how are you\\\"  # user content (message)\\n\",\n    \"response = openai.ChatCompletion.create(\\n\",\n    \"    model=\\\"gpt-3.5-turbo-0613\\\",\\n\",\n    \"    messages=[\\n\",\n    \"        {\\\"role\\\": \\\"system\\\", \\\"content\\\": system_content},\\n\",\n    \"        {\\\"role\\\": \\\"assistant\\\", \\\"content\\\": assistant_content},\\n\",\n    \"        {\\\"role\\\": \\\"user\\\", \\\"content\\\": user_content},\\n\",\n    \"    ],\\n\",\n    \")\\n\",\n    \"print (response.to_dict()[\\\"choices\\\"][0].to_dict()[\\\"message\\\"][\\\"content\\\"])\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"175dddcc\",\n   \"metadata\": {},\n   \"source\": [\n    \"Now let's create a function that can predict tags for a given sample.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"b2aae14c-9870-4a27-b5ad-90f339686620\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def get_tag(model, system_content=\\\"\\\", assistant_content=\\\"\\\", user_content=\\\"\\\"):\\n\",\n    \"    try:\\n\",\n    \"        # Get response from OpenAI\\n\",\n    \"        response = openai.ChatCompletion.create(\\n\",\n    \"            model=model,\\n\",\n    \"            messages=[\\n\",\n    \"                {\\\"role\\\": \\\"system\\\", \\\"content\\\": system_content},\\n\",\n    \"                {\\\"role\\\": \\\"assistant\\\", \\\"content\\\": assistant_content},\\n\",\n    \"                {\\\"role\\\": \\\"user\\\", \\\"content\\\": user_content},\\n\",\n    \"            ],\\n\",\n    \"        )\\n\",\n    \"        predicted_tag = response.to_dict()[\\\"choices\\\"][0].to_dict()[\\\"message\\\"][\\\"content\\\"]\\n\",\n    \"        return predicted_tag\\n\",\n    \"\\n\",\n    \"    except (openai.error.ServiceUnavailableError, openai.error.APIError) as e:\\n\",\n    \"        return None\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"03ee23e5\",\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"natural-language-processing\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Get tag\\n\",\n    \"model = \\\"gpt-3.5-turbo-0613\\\"\\n\",\n    \"system_context = f\\\"\\\"\\\"\\n\",\n    \"    You are a NLP prediction service that predicts the label given an input's title and description.\\n\",\n    \"    You must choose between one of the following labels for each input: {tags}.\\n\",\n    \"    Only respond with the label name and nothing else.\\n\",\n    \"    \\\"\\\"\\\"\\n\",\n    \"assistant_content = \\\"\\\"\\n\",\n    \"user_context = \\\"Transfer learning with transformers: Using transformers for transfer learning on text classification tasks.\\\"\\n\",\n    \"tag = get_tag(model=model, system_content=system_context, assistant_content=assistant_content, user_content=user_context)\\n\",\n    \"print (tag)\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"3087ead2\",\n   \"metadata\": {},\n   \"source\": [\n    \"Next, let's create a function that can predict tags for a list of inputs.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"71c43e8c\",\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'title': 'Diffusion to Vector',\\n\",\n       \"  'description': 'Reference implementation of Diffusion2Vec (Complenet 2018) built on Gensim and NetworkX. '},\\n\",\n       \" {'title': 'Graph Wavelet Neural Network',\\n\",\n       \"  'description': 'A PyTorch implementation of \\\"Graph Wavelet Neural Network\\\" (ICLR 2019) '},\\n\",\n       \" {'title': 'Capsule Graph Neural Network',\\n\",\n       \"  'description': 'A PyTorch implementation of \\\"Capsule Graph Neural Network\\\" (ICLR 2019).'}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# List of dicts w/ {title, description} (just the first 3 samples for now)\\n\",\n    \"samples = test_df[[\\\"title\\\", \\\"description\\\"]].to_dict(orient=\\\"records\\\")[:3]\\n\",\n    \"samples\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"c9359a91-ac19-48a4-babb-e65d53f39b42\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def get_predictions(inputs, model, system_content, assistant_content=\\\"\\\"):\\n\",\n    \"    y_pred = []\\n\",\n    \"    for item in tqdm(inputs):\\n\",\n    \"        # Convert item dict to string\\n\",\n    \"        user_content = str(item)\\n\",\n    \"\\n\",\n    \"        # Get prediction\\n\",\n    \"        predicted_tag = get_tag(\\n\",\n    \"            model=model, system_content=system_content,\\n\",\n    \"            assistant_content=assistant_content, user_content=user_content)\\n\",\n    \"\\n\",\n    \"        # If error, try again after pause (repeatedly until success)\\n\",\n    \"        while predicted_tag is None:\\n\",\n    \"            time.sleep(30)  # could also do exponential backoff\\n\",\n    \"            predicted_tag = get_tag(\\n\",\n    \"                model=model, system_content=system_content,\\n\",\n    \"                assistant_content=assistant_content, user_content=user_content)\\n\",\n    \"\\n\",\n    \"        # Add to list of predictions\\n\",\n    \"        y_pred.append(predicted_tag)\\n\",\n    \"\\n\",\n    \"    return y_pred\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"5fac795e\",\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"  0%|          | 0/3 [00:00<?, ?it/s]\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 3/3 [00:01<00:00,  2.04it/s]\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"['other', 'computer-vision', 'computer-vision']\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Get predictions for a list of inputs\\n\",\n    \"get_predictions(inputs=samples, model=model, system_content=system_context)\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"190e7e72\",\n   \"metadata\": {},\n   \"source\": [\n    \"Next we'll define a function that can clean our predictions in the event that it's not the proper format or has hallucinated a tag outside of our expected tags.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"e4cb38a8-44cb-4cea-828c-590f223d4063\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def clean_predictions(y_pred, tags, default=\\\"other\\\"):\\n\",\n    \"    for i, item in enumerate(y_pred):\\n\",\n    \"        if item not in tags:  # hallucinations\\n\",\n    \"            y_pred[i] = default\\n\",\n    \"        if item.startswith(\\\"'\\\") and item.endswith(\\\"'\\\"):  # GPT 4 likes to places quotes\\n\",\n    \"            y_pred[i] = item[1:-1]\\n\",\n    \"    return y_pred\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"e6f18bd5\",\n   \"metadata\": {},\n   \"source\": [\n    \"> Open AI has now released [function calling](https://openai.com/blog/function-calling-and-other-api-updates) and [custom instructions](https://openai.com/blog/custom-instructions-for-chatgpt) which is worth exploring to avoid this manual cleaning.\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"f361ee27\",\n   \"metadata\": {},\n   \"source\": [\n    \"Next, we'll define a function that will plot our ground truth labels and predictions.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"de2d0416\",\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"def plot_tag_dist(y_true, y_pred):\\n\",\n    \"    # Distribution of tags\\n\",\n    \"    true_tag_freq = dict(Counter(y_true))\\n\",\n    \"    pred_tag_freq = dict(Counter(y_pred))\\n\",\n    \"    df_true = pd.DataFrame({\\\"tag\\\": list(true_tag_freq.keys()), \\\"freq\\\": list(true_tag_freq.values()), \\\"source\\\": \\\"true\\\"})\\n\",\n    \"    df_pred = pd.DataFrame({\\\"tag\\\": list(pred_tag_freq.keys()), \\\"freq\\\": list(pred_tag_freq.values()), \\\"source\\\": \\\"pred\\\"})\\n\",\n    \"    df = pd.concat([df_true, df_pred], ignore_index=True)\\n\",\n    \"\\n\",\n    \"    # Plot\\n\",\n    \"    plt.figure(figsize=(10, 3))\\n\",\n    \"    plt.title(\\\"Tag distribution\\\", fontsize=14)\\n\",\n    \"    ax = sns.barplot(x=\\\"tag\\\", y=\\\"freq\\\", hue=\\\"source\\\", data=df)\\n\",\n    \"    ax.set_xticklabels(list(true_tag_freq.keys()), rotation=0, fontsize=8)\\n\",\n    \"    plt.legend()\\n\",\n    \"    plt.show()\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"1fc0b6ad\",\n   \"metadata\": {},\n   \"source\": [\n    \"And finally, we'll define a function that will combine all the utilities above to predict, clean and plot our results.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"ff3c37fb\",\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"def evaluate(test_df, model, system_content, assistant_content, tags):\\n\",\n    \"    # Predictions\\n\",\n    \"    y_test = test_df.tag.to_list()\\n\",\n    \"    test_samples = test_df[[\\\"title\\\", \\\"description\\\"]].to_dict(orient=\\\"records\\\")\\n\",\n    \"    y_pred = get_predictions(\\n\",\n    \"        inputs=test_samples, model=model,\\n\",\n    \"        system_content=system_content, assistant_content=assistant_content)\\n\",\n    \"    y_pred = clean_predictions(y_pred=y_pred, tags=tags)\\n\",\n    \"\\n\",\n    \"    # Performance\\n\",\n    \"    metrics = precision_recall_fscore_support(y_test, y_pred, average=\\\"weighted\\\")\\n\",\n    \"    performance = {\\\"precision\\\": metrics[0], \\\"recall\\\": metrics[1], \\\"f1\\\": metrics[2]}\\n\",\n    \"    print(json.dumps(performance, indent=2))\\n\",\n    \"    plot_tag_dist(y_true=y_test, y_pred=y_pred)\\n\",\n    \"    return y_pred, performance\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"1fb7ab2a\",\n   \"metadata\": {},\n   \"source\": [\n    \"## Benchmarks\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"83f00073\",\n   \"metadata\": {},\n   \"source\": [\n    \"Now we're ready to start benchmarking our different LLMs with different context.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"972fee2f-86e2-445e-92d0-923f5690132a\",\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"y_pred = {\\\"zero_shot\\\": {}, \\\"few_shot\\\": {}}\\n\",\n    \"performance = {\\\"zero_shot\\\": {}, \\\"few_shot\\\": {}}\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"2029fff2-ae81-4cef-bef5-3cac717d0222\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Zero-shot learning\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"341b9d90\",\n   \"metadata\": {},\n   \"source\": [\n    \"We'll start with zero-shot learning which involves providing the model with the `system_content` that tells it how to behave but no examples of the behavior.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"9ee4e745-ef56-4b76-8230-fcbe56ac46aa\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"system_content = f\\\"\\\"\\\"\\n\",\n    \"    You are a NLP prediction service that predicts the label given an input's title and description. \\n\",\n    \"    You must choose between one of the following labels for each input: {tags}. \\n\",\n    \"    Only respond with the label name and nothing else.\\n\",\n    \"    \\\"\\\"\\\"\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"73780054-afeb-4ce6-8255-51bf91f9f820\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [01:26<00:00,  2.21it/s]\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.7919133278407181,\\n\",\n      \"  \\\"recall\\\": 0.806282722513089,\\n\",\n      \"  \\\"f1\\\": 0.7807530967691199\\n\",\n      \"}\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAA1YAAAE9CAYAAAAI8PPbAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAABAUklEQVR4nO3deVxU9f7H8ffMAAIiiKjgnpmKlrjkguWKXivDTMmrldg1Ky23Um9YWi5lmXq1RC1N07qmlktamblkqz/RKG2TNHNLUkllEdlk5vz+8OFcJ1yAQWZGXs/Ho0fOWeb7OcP5zvDm+z1nTIZhGAIAAAAAFJvZ1QUAAAAAgKcjWAEAAACAkwhWAAAAAOAkghUAAAAAOIlgBQAAAABOIlgBAAAAgJMIVgAAAADgJIIVAAAAADiJYAUAAAAATiJYAQAKiI+PV8OGDQv139ixY11drmbNmqWGDRtqx44dkqSjR4+qYcOGGjNmTLGe78SJE8rKyrrqdpdqJzY2Vg0bNlR+fn6x2i5KXWPHjlXDhg11+PDhEm8LAFA0Xq4uAADgfv7xj3+odu3aDstefvllpaamatq0aQ7L/76dO6hUqZKmTZumWrVqFXnfVatWacqUKfroo4/k7+9/zdopibr69u2rtm3bqnLlyte8fQDAlRGsAAAFhIeHKzw83GHZa6+9ptTUVPXs2dNFVRWev79/setMSEgo1GiVs+0U1aXqat68uZo3b14q7QMAroypgAAAAADgJIIVAMBpGzdu1MMPP6w2bdro5ptvVps2bTRkyBD9/PPPBbb98MMP1bt3bzVr1kzt27fXjBkztHLlSodrpK7WVp8+fdSsWTN16NBBs2fPltVqddjmUtc+ZWdn6+WXX9add96piIgItWnTRoMHD9Z3331n3yYqKkofffSRJKlLly6KjY2VdP5apiZNmujLL79U586d1aRJE40aNeqK13Lt2bNHsbGxioiI0G233aZnn31WKSkpDttERUWpQ4cOBfa98HqsWbPmqnX9/Rorq9Wq//73v+rZs6ciIiLUokULDRgwQF9++aVDG2vWrFHDhg21fft2TZs2TZ06ddItt9yiO++8U4sXL77KTwEA8HdMBQQAOGXJkiV6+eWX1aZNGw0bNkze3t76+eeftXbtWu3cuVNbtmxRpUqVJEkLFizQf/7zH91888168skndebMGS1durTQbS1btkyTJk1SgwYNNHLkSGVlZWnZsmXKzs6+6r6jRo3Stm3b9OCDD+rGG2/UyZMn9e677+qhhx7SqlWrFB4ermeffVYLFy7Url279Mwzz6h+/fr2/fPz8zVmzBj1799fFStWVFhY2BXbe+ihh9S2bVvFxcVp7969WrlypRISEvTBBx8oKCio0Mcs6Yp1Xcxms2nYsGHaunWr2rRpo9GjR+vs2bNas2aNHnvsMY0dO1YDBw502GfcuHHy9/fXgAED5OXlpWXLlmnq1KkKCAhQnz59ilQnAJRlBCsAQLFZrVa98cYbatSokRYvXiyLxWJfFxgYqEWLFmnnzp268847deLECcXHx+vmm2/WihUr5OPjI0nq2bOnevTocdW2MjMzNX36dNWvX1/vv/++/Pz8JEm9e/e+6nVOp0+f1tatW3X//fcrLi7OvjwyMlJjx47VTz/9pPDwcHXt2lWffvqpdu3apa5du6pmzZr2bW02m/r376+RI0falx09evSybd57772aMGGC/XH9+vX14osvatGiRRo1atRVj/diV6rrYh9++KG2bt2qe++9V1OnTpXJZJIkDRgwQDExMZo+fbq6dOnicMOR8uXLa/Xq1fafR1RUlLp06aLVq1cTrACgCJgKCAAoNovFoq+++kpvv/22Q6jKysqSt7e3pPOBSJK2bNmivLw8Pfzww/Zf4qXzdxW85557rtrW9u3blZWVpfvuu88eqiSpWrVqio6OvuK+AQEBqlChgjZu3KiVK1fqr7/+knT+5g8XphYWxm233Vao7SRp6NChDo/79eunChUqaNOmTYV+jqL69NNPJUkjRoywhyrp/PEPHjxYVqtVGzdudNjnjjvucPh51KxZU8HBwTp58uQ1qxMArkeMWAEAnOLj46PvvvtOGzZs0MGDB5WcnKxjx47JMAxJsv//4MGDkqS6desWeI569epdtZ0jR45Ikm644YYi7+/j46OpU6fqmWee0fjx4yVJDRo0ULt27dSjRw81btz4qu1LUkhISKG2q1ixYoFboHt7e6tmzZr67bffCvUcxXHkyBH5+/urRo0aBdZdmD7491G2KlWqFNjWx8dHNpvt2hQJANcpRqwAAE4ZPXq0/vWvf+m7775T7dq1FRsbq7feekvPP/+8w3Z5eXmS5DA6coGvr2+h28vNzS2w7EJ4u5KuXbvqq6++Unx8vPr27au8vDy99dZb6t27t955551CtX3xqNyVXDxa9Pc6C/Mcxf1y4Su9DheC0t9ff7OZXwUAoCQwYgUAKLbExER9/PHHuuuuuzRr1iyHQLF7926HbS+MVB04cKDAzRcOHDhw1bbq1Klz2W0PHTp0xX0zMzO1d+9e1axZU926dVO3bt0kSUlJSRowYIDmzp2rAQMGXLWGwkpPT1dGRoYCAwPty/Ly8vTHH3/Yj0M6H9Qu9Z1ZxZ2GV7t2bR04cEDJyckFRq0ujJRVr169WM8NALgy/kwFACi2tLQ0SeenmV0cqk6fPq1Vq1ZJ+t/oS7du3eTl5aWlS5fq3Llz9m1TUlLstxK/kttvv11BQUF69913lZGRYV9+6tQprVu37or77t27Vw888IDmzZvnsLx+/fqqUKGCvLz+93fGCyNKhRkFuxybzaZly5Y5LHv77bd19uxZ3XXXXfZlVatWVVpamsP0vNzcXPu1UhcrTF133HGHJGn27NkO2509e1ZvvvmmLBaLunbtWryDAgBcESNWAIBia9GihSpWrKg333xTOTk5ql27to4eParVq1frzJkzkmT/f40aNfT4448rPj5e999/v6Kjo+23S78wanO5KXSS5Ofnp4kTJ2r06NHq3bu3+vbtK8MwtGzZMvuNMq5U52233aYVK1YoIyNDrVu3ltVq1YYNG5ScnOxwp8AL11EtXLhQ7du3L1YQ8fPz0/z583X06FE1adJEu3bt0gcffKCbb75ZDz/8sH27e++9V4mJiRo0aJAefPBB2Ww2rV69+pLhqTB19ezZU59++qnWrl2rY8eOqUuXLsrOztbq1at15MgRjRkzRrVq1Sry8QAAro5gBQAotkqVKumtt97SzJkz9f777ysvL0+hoaG64447NHDgQN155536+uuv9dhjj0mShg0bpsqVK2vp0qWaMWOGgoODFRMTo9zcXC1evPiS119drHv37goODtbcuXM1b948+fr6qkePHqpTp44mT5582f1MJpPi4+P11ltvacOGDfriiy8kSeHh4ZoxY4bD7d779++v77//XqtXr1ZCQkKxglVgYKBeffVVTZ06VevWrVNQUJAeeughjRgxwuF6sj59+igrK0vLly/XtGnTVLlyZfXs2VMdOnTQAw884PCchanLYrFo3rx5evvtt7V27VrNmDFDfn5+atKkiZ577rlLfhkxAKBkmAxn5joAAFBIWVlZslqtqlChQoF1zz33nN5//3199tlnl/2OJgAA3BnXWAEASsVvv/2mli1bas6cOQ7Lz5w5o88//1xVqlS55G3CAQDwBEwFBACUiltuuUUNGzbUG2+8odOnT6tRo0ZKS0vTmjVrdOrUKf3nP/+54jVWAAC4M6YCAgBKzenTp7Vw4UJt2bJFx48fl5+fnyIiIvTII4+oTZs2ri4PAIBiI1gBAAAAgJO4xgoAAAAAnESwAgAAAAAnuVWwmj9/vmJjYx2WJSUlqX///mrWrJmioqL0zjvvOKy32WyaPXu22rdvr2bNmunRRx/VH3/8UZplAwAAACjj3OaugO+++65effVVtWzZ0r4sNTVVAwcOVFRUlCZNmqTdu3dr0qRJKl++vGJiYiRJ8+bN07JlyzR16lSFhYVp+vTpeuSRR/TRRx9d9YsmL8cwDNlsXHoGAAAAlGVms6nQd6x1ebA6ceKEJkyYoB07duiGG25wWPf+++/L29tbkydPlpeXl+rVq6fDhw9rwYIFiomJUV5ent566y2NGTNGnTp1kiTNmjVL7du316ZNmxQdHV2smmw2Q6dPn3XyyAAAAAB4skqVystiKVywcvlUwF9++UXe3t768MMP1bRpU4d1iYmJat26tby8/pf/IiMjdejQIZ08eVK//vqrzp49q7Zt29rXBwYGqnHjxvr2229L7RgAAAAAlG0uH7GKiopSVFTUJdcdP35cDRo0cFhWtWpVSdKxY8d0/PhxSVK1atUKbHNhXXF5ebk8cwIAAADwEC4PVleSk5NT4DqpcuXKSZJyc3OVnZ0tSZfcJj09vdjtms0mBQeXL/b+AAAAAMoWtw5Wvr6+ysvLc1iWm5srSfL395evr68kKS8vz/7vC9v4+fkVu12bzVBGRlax9wcAAADg+QID/WSxFG4mm1sHq7CwMKWkpDgsu/A4NDRU+fn59mW1a9d22KZhw4ZOtZ2fb3NqfwAAAABlh1sHq1atWmnFihWyWq2yWCySpISEBNWtW1chISGqUKGCAgICtGPHDnuwysjI0J49e9S/f39Xlg4AAABcMzabTVZrvqvL8HgWi5fM5pK5t4JbB6uYmBgtXLhQ48aN0yOPPKIff/xRS5Ys0aRJkySdv7aqf//+mjFjhipVqqQaNWpo+vTpCgsLU7du3VxcPQAAAFCyDMNQRsZpZWdnurqU64afX4ACAysV+vuqLsetg1VISIgWLlyoKVOmqFevXqpSpYqefvpp9erVy77NiBEjlJ+fr/HjxysnJ0etWrXSokWL5O3t7cLKAQAAgJJ3IVQFBATLx6ec02GgLDMMQ3l5ucrMTJUkBQWFOPV8JsMwjJIo7Hpitdr4gmAALmc2m2Q284FZFDabIZuNjzUA1yebzaqUlKMKCAhWQECgq8u5bmRmZigzM1VVq9YqMC3w/BcEXwc3rwCAsur81z74yWy2uLoUj2KzWZWamk24AnBdslqtkiQfn3IuruT6cuH1tFrzZTb7XGXryyNYAYAbOj9aZdHBj99U9qljri7HI/iFVFPd6EdlNpsIVgCua0z/K1kl9XoSrADAjWWfOqbsE0dcXQYAwM25cvo407DPI1gBAAAAHsxsNqliRf9CXwtU0qxWm9LSsooUro4fP66ff/5BXbvecQ0rK10EKwAAAMCDmc0mWSxmzV2+Tckp6aXado2qQRp6/+1FnoY9ZcoEhYVVI1gBAAAAcC/JKek6lJzq6jIK5Xq8MTnBCgAAAECpGTbsMe3e/b127/5eu3Z9J0nq1KmLEhK2KTX1tF58cZoWLZqvatWqa9y4iQ77Xbzs0KGDmjNnln74YZf8/f3VokUrDRv2pEJCKrvgqCTXTMQEAAAAUCa99NJ03XJLhKKi/qE333xHkrRmzfsaOXKM/vOfeN18c5OrPsfJk39p6NBHVLNmbS1c+F+98sqrOns2U0OGPKzs7OxrfQiXRLACAAAAUGoCA4Pk5eWlcuXKKTg4WJIUGXm7WrVqo/DwxvLxufp3SX3wwSpVqRKqJ58cozp1blB4eCNNnjxVp0+f0uefb7nWh3BJTAUEAAAA4FI1a9Yq0vb79v2qgwd/1z/+0d5heV5eng4dOliSpRUawQoAAACAS5UrV+6q21itVvu/bTZDLVq01OjRYwtsFxBQoURrKyymAgIAAAAoVSbTlb/M2NvbW2fPnrU/ttls+vPPo/bHN95YT4cPH1LVqqGqWbOWataspcDAQM2e/R8dOLD/mtV9JQQrAAAAAKXKz89fx479qZSUE5dcf8stEfr22x1KSPg/HT36h2bNmq4zZzLt63v1uk+ZmZmaPHm8fvttn377bZ+ef/4ZJSXtUd269UrrMBwwFRAAAAC4DtSoGuQxbd57b4ymTJmghx66X35+fgXW9+v3oJKTj+q558bKx8dbd9/dU127drN//1X16jU0Z858vfHGHD3xxCBZLBY1adJUs2e/Yb8hRmkzGdfjt3M5yWq16fTps1ffEACuES8vs4KDy2vP25OVfeKIq8vxCH6htdX4oeeVmnpW+fk2V5cDACXu3Lk8nTp1TCEh1eTt/b8755nNJlWs6C+LxTWT0axWm9LSsmSzeWasuNzrKkmVKpUv9OvKiBUAAADgwWw2Q2lpWTKbr3zd0rVs31NDVUkiWAEAAAAejnDjety8AgAAAACcRLACAAAAACcRrAAAAADASQQrAAAAAHASwQoAAAAAnESwAgAAAAAnEawAAAAAwEl8jxUAAADg4cxmE18Q7GIEKwAAAMCDmc0mBQf7yWy2uKR9m82q1NRstw1X993XQ3fdFa1BgwZf03YIVgAAAIAHOz9aZdHBj99U9qljpdq2X0g11Y1+VGazyW2DVWkhWAEAAADXgexTx5R94oiryyizCFYAAAAASlW7di311FNPa+PGT7R//z7VrFlLjz32hNq16yhJWrRovnbt+k4hISHavv3/dNddd+upp57WTz/9oDfemKOkpD2qWLGibr+9g4YMGary5QMkSZmZmXr11en65psv5eXlpf79/1Vqx8RdAQEAAACUujfemKM77uiuJUuWqW3bdnr22X/rp59+sK/fvft7VapUWYsXv6v77uun/ft/05NPPqE2bdrq7beXa8KEKdq7N0lPPTVMhnF+GuLzz49VUtIveuWVWZo1a662b9+m48dLZ3okwQoAAABAqevePVoxMf9U7do36PHHhys8vLFWrXrPYZtBgwarRo2aqlWrtpYvf0etW0dqwICHVatWbTVt2kwTJ07Rnj0/a9eu73TkyCHt3Jmgp556Wk2bNlf9+g01YcKL8vHxKZXjYSogAAAAgFLXokVLh8dNmkRo584E++Pg4EoKCAiwP967d6+OHj2if/yjfYHnOnz4kNLT0yRJjRo1ti+vVClE1avXKOHKL41gBQAAAKDUWSyOUcRqtTncMr5cuXIO6w3Dpm7d7tKAAQ8XeK6KFYOVmLhDkgrcnfDv7VwrHjEVMD8/X6+99po6d+6s5s2b68EHH9Tu3bvt65OSktS/f381a9ZMUVFReuedd1xXLAAAAICr+vXXPQ6Pf/75RzVsGH7Z7evWraeDBw+oZs1a9v+sVqtmz56plJTjql+/oSQ5XKd15swZJSf/cW0O4G88Ili9/vrrWrlypV544QWtXbtWdevW1SOPPKKUlBSlpqZq4MCBql27tlavXq2hQ4dqxowZWr16tavLBgAAAHAZ77+/XJs2faojRw5rzpxXtX//Pv3znw9cdvt+/fpr375f9Z//vKJDhw7q559/1MSJz+ro0SOqVauOatSoqc6du2rWrGn69tsdOnBgv1544XmdO3euVI7HI6YCbtmyRdHR0WrXrp0kaezYsVq5cqV2796tgwcPytvbW5MnT5aXl5fq1aunw4cPa8GCBYqJiXFx5QAAAEDp8Aup5lFt3ntvb73//jIdOLBf9erV18yZc3TTTfUvu/0ttzTRzJlztHDh63r44f7y9/fTrbe20tChT8rb21uSNH78RM2Z85omTHhWNptNPXv2VlpaarFrLAqPCFYhISH6/PPP1b9/f1WrVk3vvfeefHx8FB4erpUrV6p169by8vrfoURGRmr+/Pk6efKkKleu7MLKAQAAgGvLZjNks1lVN/pRF7VvLXBdU2HccMONeuKJkZdcN2jQYA0aNLjA8ltvbaVbb2112ecsV85Xo0fHafTouCLX4yyPCFbjxo3TyJEj1aVLF1ksFpnNZsXHx6t27do6fvy4GjRo4LB91apVJUnHjh0jWAEAAOC6ZrMZSk3Nltlscln7xQlW1xuPCFb79+9XhQoVNHfuXIWGhmrlypUaM2aMli5dqpycnAL3pr9wB5Hc3Nxit+nl5RGXnwG4TlksvAcVF68dgOuVzXb54ES4cZ7FYnIqA7h9sDp27JhGjx6tJUuWqGXL8/e6b9Kkifbv36/4+Hj5+voqLy/PYZ8Lgcrf379YbZrNJgUHl3eucACASwQG+rm6BAC4JnJyLDp50ux0AHAHCQnfu7oEO5vNJLPZrKAgf/n6+hb7edw+WP3www86d+6cmjRp4rC8adOm+uqrr1S9enWlpKQ4rLvwODQ0tFht2myGMjKyilcwAJQAi8VMQCimjIxsWa02V5cBACUuLy9XNptNVquh/Hze50qK1WrIZrMpPT1L2dlWh3WBgX6Fngnh9sEqLCxM0vlvWo6IiLAv37dvn2644QY1bdpUK1askNVqlcVy/gvFEhISVLduXYWEhBS7XU5WAPBMVquN93AA1yWrlal+15KzgdXtg1VERIRuvfVWxcXFacKECQoLC9PatWu1fft2LV++XDVr1tTChQs1btw4PfLII/rxxx+1ZMkSTZo0ydWlAwBgZzabXHZhuSfjuhGgIMOgT5Skkno93T5Ymc1mvf7663r11Vf1zDPPKD09XQ0aNNCSJUvUtGlTSdLChQs1ZcoU9erVS1WqVNHTTz+tXr16ubhyAADOM5tNqljRnxtrFIPValNaWhbhCpDss7Py8nLl41POxdVcP/Lyzt+fwWJxLhqZDCJvAVarTadPn3V1GQDKMC8vs4KDy2vP25OVfeKIq8vxCH6htdX4oeeVmnrW7aYCXvh5zl2+Tckp6a4ux2PUqBqkofff7pY/U8BV0tNPKTs7UwEBwfLxKSeTiZHw4jIMQ3l5ucrMTJWfX4CCggpeRlSpUvnr5xorAACuF8kp6TqUnOrqMgB4sMDASpKkzEzeS0qKn1+A/XV1BsEKAAAA8BAmk0lBQSGqUCFYVmu+q8vxeBaLl8zmkpmmTbACAAAAPIzZbJbZ7OPqMnARrqIFAAAAACcRrAAAAADASQQrAAAAAHASwQoAAAAAnESwAgAAAAAnEawAAAAAwEkEKwAAAABwEsEKAAAAAJxEsAIAAAAAJxGsAAAAAMBJXq4uAMD1z2w2yWw2uboMj2Kx8Hcv4AL6Q9HYbIZsNsPVZQBlDsEKwDVlNptUsaI/vxgBKLKgCr4ybDYFBvq5uhSPYrNZlZqaTbgCShnBCsA1ZTabZLGYNXf5NiWnpLu6HI/RtGF19b2zmavLAFyqvK+PTGazDn78prJPHXN1OR7BL6Sa6kY/KrPZRLACShnBCkCpSE5J16HkVFeX4TGqVwl0dQmA28g+dUzZJ464ugwAuCLm5gAAAACAkwhWAAAAAOAkghUAAAAAOIlgBQAAAABOIlgBAAAAgJMIVgAAAADgJIIVAAAAADiJYAUAAAAATiJYAQAAAICTCFYAAAAA4CSCFQAAAAA4iWAFAAAAAE4iWAEAAACAkwhWAAAAAOAkghUAAAAAOIlgBQAAAABOIlgBAAAAgJM8JlitXbtW3bt3V5MmTXT33Xdrw4YN9nVHjx7V4MGD1aJFC7Vr106vvvqqrFarC6sFAAAAUJZ4RLBat26dxo0bpwcffFDr169XdHS0Ro0apV27duncuXMaNGiQJGnFihWaOHGili9frrlz57q4agAAAABlhZerC7gawzD02muvacCAAXrwwQclSY8//rgSExO1c+dOJScn688//9T777+voKAgNWjQQKdOndK0adM0ZMgQ+fj4uPgIAAAAAFzv3H7E6uDBg0pOTlaPHj0cli9atEiDBw9WYmKibr75ZgUFBdnXRUZGKjMzU0lJSaVdLgAAAIAyyO1HrA4ePChJysrK0qBBg7Rnzx7VrFlTjz/+uKKionT8+HGFhYU57FO1alVJ0rFjx9S0adNitevl5faZE/AIFgt9CaXLHc85d6wJ1zfOOaD0uX2wyszMlCTFxcVp2LBhGjNmjDZu3KgnnnhCixcvVk5OjgIDAx32KVeunCQpNze3WG2azSYFB5d3rnAAgEsEBvq5ugTA5egHQOlz+2Dl7e0tSRo0aJB69eolSWrUqJH27NmjxYsXy9fXV3l5eQ77XAhU/v7+xWrTZjOUkZHlRNUALrBYzHzAo1RlZGTLarW5ugwH9AOUNnfsB4AnCgz0K/QIsNsHq9DQUElSgwYNHJbfdNNN+uKLL9S6dWvt27fPYV1KSorDvsWRn8+bEQB4IqvVxns4yjz6AVD63H4C7s0336zy5cvrhx9+cFi+b98+1a5dW61atdKePXvsUwYlKSEhQeXLl1d4eHhplwsAAACgDHL7YOXr66tHHnlEc+fO1ccff6wjR47o9ddf17Zt2zRw4EB17dpVVapU0ZNPPqlff/1VW7Zs0cyZM/Xwww9zq3UAAAAApcLtpwJK0hNPPCE/Pz/NmjVLJ06cUL169RQfH682bdpIkhYuXKhJkybpn//8p4KCgvTAAw/oiSeecHHVAAAAAMoKjwhWkjRw4EANHDjwkuvq1Kmjt956q5QrAgAAAIDz3H4qIAAAAAC4O4IVAAAAADipyFMBn3nmmUJvazKZ9NJLLxW1CQAAAADwKEUOVsePH9eePXuUnp6uGjVqKDQ0VGlpaTp8+LAMw1BYWJh9W5PJVKLFAgAAAIA7KnKw6t69u3777TctW7ZMLVq0sC8/cOCAHn/8cT3wwAN66KGHSrRIAAAAAHBnRb7G6o033tCYMWMcQpUk3XjjjXryySe1aNGiEisOAAAAADxBkYPV6dOnFRQUdOknM5t15swZp4sCAAAAAE9S5GDVtGlTzZkzR6mpqQ7LU1JSFB8fr3bt2pVYcQAAAADgCYp8jdXYsWPVv39/RUVFqXnz5goODtapU6e0a9cuhYSE6Nlnn70WdQIAAACA2yryiFV4eLjWr1+vfv36KTMzUz///LNycnL08MMPa82aNapWrdq1qBMAAAAA3FaRR6wkKTQ0VHFxcSVdCwAAAAB4pGIFq7y8PK1atUr/93//p7/++ksvvfSSdu7cqZtvvlkRERElXSMAAAAAuLVi3RUwJiZGU6ZM0eHDh/Xjjz8qJydHX3zxhWJjY7Vr165rUScAAAAAuK0iB6tp06bp7Nmz+uSTT/TBBx/IMAxJ0uzZs9WkSRPNnj27xIsEAAAAAHdW5GD1+eefa+TIkapTp45MJpN9ebly5fTwww/rl19+KdECAQAAAMDdFTlY5ebmqmLFipdcZ7FYdO7cOWdrAgAAAACPUuRg1aRJEy1btuyS6z766CPdcsstThcFAAAAAJ6kyHcFHDlypP71r3+pZ8+e6tixo0wmkz7++GPFx8frm2++0cKFC69FnQAAAADgtoo8YtWyZUstXrxYfn5+WrhwoQzD0JIlS/TXX39p/vz5ioyMvBZ1AgAAAIDbKvKI1fbt29W8eXOtWLFCOTk5Sk9PV0BAgMqXL38t6gMAAAAAt1fkEavhw4dr06ZNkiRfX1+FhoYSqgAAAACUaUUOVoGBgfL19b0WtQAAAACARyryVMDBgwfrxRdf1MGDBxUeHi5/f/8C27Rq1apEigMAAAAAT1CoYJWbm6ty5cpJkiZMmCBJmjVrliQ5fEmwYRgymUxKSkoq6ToBAAAAwG0VKlhFRUVpzpw5at68uVq1aqU+ffooLCzsWtcGAAAAAB6hUMHqzJkzSklJkSQlJibq3//+tyIiIq5pYQAAAADgKQoVrJo0aaLRo0frlVdekWEYGjp0qHx8fC65rclk0pYtW0q0SAAAAABwZ4UKVjNnztSSJUuUlpamDz74QI0bN1alSpWudW0AAAAA4BEKFaxCQ0MVFxcnSdqxY4eeeuophYeHX9PCAAAAAMBTFPl261u3br0WdQAAAACAxyryFwQDAAAAABwRrAAAAADASQQrAAAAAHCSRwWrgwcPqnnz5lqzZo19WVJSkvr3769mzZopKipK77zzjgsrBAAAAFAWeUywOnfunMaMGaOsrCz7stTUVA0cOFC1a9fW6tWrNXToUM2YMUOrV692YaUAAAAAypoi3xXQVeLj4xUQEOCw7P3335e3t7cmT54sLy8v1atXT4cPH9aCBQsUExPjokoBAAAAlDUeMWL17bff6r333tPUqVMdlicmJqp169by8vpfPoyMjNShQ4d08uTJ0i4TAAAAQBnl9iNWGRkZevrppzV+/HhVq1bNYd3x48fVoEEDh2VVq1aVJB07dkyVK1cudrteXh6ROQG3Z7HQl1C63PGcc8eacH3jnANKn9sHq4kTJ6p58+bq0aNHgXU5OTny8fFxWFauXDlJUm5ubrHbNJtNCg4uX+z9AQCuExjo5+oSAJejHwClz62D1dq1a5WYmKiPPvrokut9fX2Vl5fnsOxCoPL39y92uzaboYyMrKtvCOCqLBYzH/AoVRkZ2bJaba4uwwH9AKXNHfsB4IkCA/0KPQLs1sFq9erVOnXqlDp16uSwfMKECfrkk08UFhamlJQUh3UXHoeGhjrVdn4+b0YA4ImsVhvv4Sjz6AdA6XPrYDVjxgzl5OQ4LOvWrZtGjBihe+65R+vWrdOKFStktVplsVgkSQkJCapbt65CQkJcUTIAAACAMsitr2wMDQ1VnTp1HP6TpJCQEIWGhiomJkaZmZkaN26c9u/frzVr1mjJkiUaPHiwiysHAAAAUJa4dbC6mpCQEC1cuFAHDx5Ur169NGfOHD399NPq1auXq0sDAAAAUIa49VTAS9m7d6/D44iICL333nsuqgYAAAAAPHzECgAAAADcAcEKAAAAAJxEsAIAAAAAJxGsAAAAAMBJBCsAAAAAcBLBCgAAAACcRLACAAAAACcRrAAAAADASQQrAAAAAHASwQoAAAAAnESwAgAAAAAnEawAAAAAwEkEKwAAAABwEsEKAAAAAJxEsAIAAAAAJxGsAAAAAMBJBCsAAAAAcBLBCgAAAACcRLACAAAAACcRrAAAAADASQQrAAAAAHASwQoAAAAAnESwAgAAAAAnEawAAAAAwEleri6gLDCbTTKbTa4uw6PYbIZsNsPVZQAAAACFQrC6xsxmkypW9JfFwuBgUVitNqWlZRGuAAAA4BEIVteY2WySxWLW3OXblJyS7upyPEKNqkEaev/tMptNBCsAAAB4BIJVKUlOSdeh5FRXlwEAAADgGmB+GgAAAAA4iWAFAAAAAE4iWAEAAACAkwhWAAAAAOAkghUAAAAAOMkjglVaWpqef/55dejQQS1atND999+vxMRE+/rt27erd+/eatq0qe68806tX7/ehdUCAAAAKGs8IliNGjVKu3bt0syZM7V69Wo1atRIgwYN0oEDB/T7779r8ODBat++vdasWaM+ffro6aef1vbt211dNgAAAIAywu2/x+rw4cPatm2bli1bpltvvVWS9Nxzz+nrr7/WRx99pFOnTqlhw4Z66qmnJEn16tXTnj17tHDhQrVt29aVpQMAAAAoI9x+xCo4OFgLFixQkyZN7MtMJpNMJpMyMjKUmJhYIEBFRkbqu+++k2EYpV0uAAAAgDLI7YNVYGCgOnbsKB8fH/uyjRs36vDhw2rfvr2OHz+usLAwh32qVq2q7Oxspaamlna5AAAAAMogt58K+Hfff/+9nnnmGXXr1k2dOnVSTk6OQ+iSZH+cl5dX7Ha8vEomc1osbp9d3Rav3fWBnyNKmzuec+5YE65vnHNA6fOoYLVlyxaNGTNGLVq00IwZMyRJ5cqVKxCgLjz28/MrVjtms0nBweWdKxZOCwws3s8PQNnGewdAPwBcwWOC1dKlSzVlyhTdeeedeuWVV+yjUtWqVVNKSorDtikpKfL391eFChWK1ZbNZigjI8vpmqXzfzHiza14MjKyZbXaXF0GnEQfQGlzx/cO+gFKmzv2A8ATBQb6FXoE2COC1bJly/TCCy8oNjZW48aNk8lksq9r2bKldu7c6bB9QkKCWrRoIbO5+MPg+fm8Gbma1Wrj5wCgyHjvAOgHgCu4fbA6ePCgXnrpJf3jH//Q4MGDdfLkSfs6X19fxcbGqlevXpoxY4Z69eqlL7/8Up9++qkWLlzowqoBAAAAlCVuH6w2btyoc+fOafPmzdq8ebPDul69emnq1KmaN2+epk+frrfffls1a9bU9OnT+Q4rAAAAAKXG7YPVkCFDNGTIkCtu06FDB3Xo0KGUKgIAAAAAR9yLEwAAAACcRLACAAAAACe5/VRAAAAAXB/MZpPMZtPVN4SdzWbIZjNcXQYKgWAFAACAa85sNqliRf9CfycQzrNabUpLyyJceQCCFQAAAK45s9kki8Wsucu3KTkl3dXleIQaVYM09P7bZTabCFYegGAFAACAUpOckq5DyamuLgMocQQrAAAAwI0xfbLoXHFtGsEKAAAAcENBFXxl2GwKDPRzdSkex2azKjU1u1TDFcEKAAAAcEPlfX1kMpt18OM3lX3qmKvL8Rh+IdVUN/rRUr82jWAFAAAAuLHsU8eUfeKIq8vAVTBhEwAAAACcRLACAAAAACcRrAAAAADASQQrAAAAAHASwQoAAAAAnESwAgAAAAAnEawAAAAAwEkEKwAAAABwEl8QDLdlsZD7i8pmM0r1G8YBAABwHsEKbieogq8Mm02BgX6uLsXj2GxWpaZmE64AAABKGcEKbqe8r49MZrMOfvymsk8dc3U5HsMvpJrqRj8qs9lEsAIAAChlBCu4rexTx5R94oirywAAAACuiotYAAAAAMBJBCsAAAAAcBLBCgAAAACcRLACAAAAACcRrAAAAADASQQrAAAAAHASwQoAAAAAnESwAgAAAAAnEawAAAAAwEkEKwAAAABwEsEKAAAAAJxEsAIAAAAAJ10Xwcpms2n27Nlq3769mjVrpkcffVR//PGHq8sCAAAAUEZcF8Fq3rx5WrZsmV544QWtWLFCNptNjzzyiPLy8lxdGgAAAIAywOODVV5ent566y2NGDFCnTp1Unh4uGbNmqXjx49r06ZNri4PAAAAQBng8cHq119/1dmzZ9W2bVv7ssDAQDVu3FjffvutCysDAAAAUFaYDMMwXF2EMzZt2qThw4frhx9+kK+vr335yJEjlZOTo/nz5xf5OQ3DkM1WMi+LySSZzWalZ+bIarWVyHNe73y8LQrwL6dzZzNk2KyuLsdjmMwWeZcPlM1mkzv1avpA8dAPis5d+4BEPygu+kHR0Q+uL/SB4inJfmA2m2QymQq1rZdzTbledna2JMnHx8dhebly5ZSenl6s5zSZTLJYCvcCFlZQgO/VN4ID7/KBri7BI5nN7jkQTR8oHvpB0blrH5DoB8VFPyg6+sH1hT5QPKXdD9y31xXShVGqv9+oIjc3V35+fq4oCQAAAEAZ4/HBqlq1apKklJQUh+UpKSkKDQ11RUkAAAAAyhiPD1bh4eEKCAjQjh077MsyMjK0Z88etWrVyoWVAQAAACgrPP4aKx8fH/Xv318zZsxQpUqVVKNGDU2fPl1hYWHq1q2bq8sDAAAAUAZ4fLCSpBEjRig/P1/jx49XTk6OWrVqpUWLFsnb29vVpQEAAAAoAzz+dusAAAAA4Goef40VAAAAALgawQoAAAAAnESwAgAAAAAnEawAAAAAwEkEKwAAAABwEsEKAAAAAJxEsAIAAAAAJxGs4FKxsbH2fzds2NCFlQCuM3v2bCUmJpb48y5fvlzLly8v9nq4t5I8b8aOHas1a9YUWL5mzRqNHTu2RNrApfXs2dPVJcCN8LuQZ/NydQEo23bu3OnqEgCX+/bbb9WmTZsSf97777/fqfVwb9fqvEHpWrdunatLAFBCCFYoNW+88YY+/PBDWSwW3X777crOzpYk9e7d2/6X0kmTJmnXrl3Kzc3VK6+8ooiICB05ckQTJ05UamqqfHx8FBcXpxYtWmjs2LFKTU3VkSNHNHLkSN15552uPDx4sJkzZ2rjxo2yWCzq2bOnunXrpueff15paWny9/fXuHHjFBERobFjx8rX11e7d+9WWlqannrqKW3ZskVJSUnq3Lmzxo0bpzVr1mjjxo3KzMxUSkqKOnbsqHHjxik5OVkDBgzQ1q1bJZ0fCdi5c6datWqln3/+WePHj9fs2bNVvnz5Ip/vU6dOVaVKlfTYY49JkuLi4tS6dWv9+eefkqShQ4fa+5bFYlFUVJSGDx+u+Ph4SdLw4cP1+eef69VXX5XNZlOtWrU0efJkVa5cWVFRUerZs6e2bdumtLQ0Pffcc2rfvn0p/4TKhh07duj1119XhQoV9PvvvyssLEwzZ87Uxx9/rLVr1yonJ0fS+fP1p59+cjhvXnrpJQ0bNswetBo2bKi9e/cqPj5eu3fv1vHjx9WnTx81btxYM2fOVG5urtLT0zV69Gjdfffdhapvw4YNWrx4sXJycpSTk6PJkycrMjJSsbGxatq0qRITE5WSkqLhw4erV69eyszM1LPPPqvffvtNVapUkclk0hNPPCFJmjNnjv773/9KksN5uHTp0gLH2qBBAyUmJmry5Mkym81q2bKlvvzyS23evFmnT5/W888/bz/Xhw0bpqioqAK1x8bGqm7duvr555+VnZ2tsWPHqmPHjgVen44dO16y7x87dkzPPPOMTp48KR8fH02cOFERERFat26d3n77bVmtVt10002aNGmS/P39L9nfdu/erRdffFGGYahcuXJ68cUXdeONNzr8rE6cOKEjR44oOTnZXoskvfbaa1q/fr0qVKigevXqqVatWho+fHhxTzW4yI4dOzR37lx5eXnp0KFDat++vUJDQ7VlyxbZbDYtWLDAvm12drbGjx+vvXv3ymQyadCgQbr33nsv+xmTm5urp59+WkeOHJHJZFLfvn3Vr18/Fx5tGWUApeCLL74wYmJijKysLOPcuXPGkCFDjKVLlxoNGjSwb9OgQQNj/fr1hmEYxttvv20MHz7cMAzD6Nevn/Hjjz8ahmEYhw8fNjp37mycO3fOiIuLM0aPHl36B4PrysaNG42+ffsaOTk5Rk5OjnHfffcZrVq1Mj755BPDMAxj165dRqdOnYzc3FwjLi7OGDJkiGEYhrFmzRrj1ltvNU6ePGmcOXPGaN68uZGenm6sXr3aiIyMNFJSUozc3Fyjb9++xieffGL88ccfRufOne3trl692oiLizMMwzD69+9vJCQkGIZRvPM9KSnJuOeeewzDMIycnBzjtttuM86cOWPMnj3bmD17tpGUlGT06tXLvn7UqFFGVlaWff3JkyeN22+/3Thy5IhhGIbx5ptv2vtf586djUWLFhmGYRibNm2yPw9KXkJCgtGsWTMjOTnZMAzDGDJkiLFkyRIjNjbWyMrKMgzDMF577TVj8uTJhmE4njcX/9swDPt76+zZs43777/fvnz48OHGvn37DMMwjO3btxvR0dGGYRhGXFycsXr16gI1XThPrVarERsba5w8edIwDMNYtWqVMXjwYHvbF2r65ZdfjNatWxuGYRhTp041XnzxRcMwDOPIkSNGs2bNjISEBCMhIcHo37+/vY0L5+GZM2cueax5eXlGhw4d7P3izTfftPelUaNGGRs3bjQMwzBOnTpldO3a1V7jxfr37288/fTThs1mM/bs2WNERkYaubm5BV6fmJiYS/b9wYMHG0uWLDEMwzB27NhhDBo0yNi/f7/Rr18/Izs72zAMw5g3b54xderUy/a3J554wvjss88MwzCM9evXG2vWrCnws+rdu7eRm5trZGZmGu3atTN+/fVXY+vWrUafPn2M7OxsIysry+jdu7cxe/bsAscI93dxH8/KyjKaNWtmLF++3DAMwxg7dqyxZMkS+/nwyiuvGJMmTTIM4/y5HRUVZSQlJV32M2bz5s3GsGHDDMMwjNOnTxtjxoxxzUGWcYxYoVQkJCQoOjpafn5+kqSYmBitXbu2wHbdunWTJDVo0ECbN2/W2bNn9dNPP2n8+PH2bfLz83Xs2DFJUvPmza998biu7dixQ3fddZfKlSsnSVqyZIk6deqku+66S5LUrFkzBQUF6cCBA5KkTp06SZKqV6+u+vXrKyQkRJJUsWJFZWRkSJI6d+6sKlWqSJK6d++ub7/9Vk2aNLlqLcU938PDwyVJv//+u/bt26fIyEgFBATY19euXVt5eXl68MEH1bFjRz311FP2vihJP/74oyIiIlSrVi1JUt++fR3+ctqxY0d7O2lpaVc9DhRf/fr1Vb16dUlSo0aNdObMGc2aNUuffPKJDh06pK+//lqNGjUq0nM2a9bM/u/p06fr888/16ZNm/TDDz/o7NmzhXoOs9msefPmaevWrTp48KB27twps/l/l2lfOEcaNWpkP0e++eYbTZ8+XZJUq1Yt3XbbbVdsIyAg4JLHum/fPlWqVMneh/r27atly5bZ2/jtt980d+5cSef7y++//27vlxfr06ePTCaTGjVqpLCwMO3du9fh9Tl79qwOHz58yb6/Y8cO+7G0bt1arVu31tKlS3X48GH17dvX3natWrUu29+ioqI0fvx4de7cWZ07d9Ydd9xRoMa2bdvKx8dHPj4+qlOnjtLT07Vt2zZFR0fL19dXknTPPffY32vgeRo2bGjv48HBwWrbtq2k858pF/9cExISNGXKFElSpUqV1KVLF+3cuVMBAQGX/IwZPHiwpkyZokGDBqljx46Ki4sr5SODxFRAlBKbzVZgWX5+foFlXl7nT0mTyWTfz8fHx2EO+okTJ+xvKBf/cggUh8VisZ9vkpSenl5gG8Mw7Oert7e3ffmF8/XvLl5us9lkNptlMplkGIZ9+blz5wrsV9jz/eLwdcstt2jKlCnq2bOnNmzYoL179+q+++5zeF5/f3+tXbtWO3bs0DfffKN+/frZp2FdaPfvx3txfRdC58WvE66NC6+1dP71/vPPP9WnTx/FxsaqQ4cOqly5spKSki6574XzKy8vz2H5xe+TDzzwgFq3bq3IyEi1bdtWY8aMcdh2+fLlWrFihSSpX79+9nrOnj2rmJgY3XPPPWrVqpUaNmyod999t0DdF58jFovF4Zy/+Lj+3he8vb117NgxPfjggwWO1WKxXPIzRDp/7r7zzjuqWLGiJCklJUWVKlXSo48+qpSUFEmy/5HAYrE47Hfh8YXX51K1Xuj7Xl5eDsf222+/yWq1qnv37va+mJWVpby8vMv2t5iYGLVt21ZffPGFlixZoi+++EIvvviiQ3t///kbhiGz2XzZ44fnufgzRHI8Ly/29/Px4s+hS33GhIaGasOGDdq2bZu+/vpr9erVS+vXr1dgYGAJHwGuhLsColRERkbq448/VnZ2tvLz87V69Wq1atVKFovlkgHrggoVKuiGG26w/6KZmJio3r17X3EfoChat26tzZs3Ky8vT3l5eRoyZIjOnj2rDRs2SJJ2796tlJQUNWjQoNDP+fXXXysjI0O5ublav3692rVrp6CgIKWlpSklJUVWq1WbNm2yb2+xWGS1Wgt9vjdp0kTr1q3TunXr7H/R7NGjhzZu3KikpCS1a9fOYfvExEQ9+uijioyMVFxcnOrVq6eDBw/a1zdt2lQ//vij/vjjD0nSe++9p9atWxfhVcS18tNPP+mGG27QwIED1bRpU3311VeyWq2S/nfeSOf/8v3rr79Kkj799NNLPldaWpoOHTqkJ598Uh07dtS2bdvs+19w//3328+ti29ucujQIZlMJj3++OOKjIx0qONybr/9dn3wwQeSpOPHj2vHjh0ymUwKDg7WoUOHlJ2drezsbH3xxRdXPNYbb7xRZ86c0S+//CJJDrMdIiMj7aNXhw4dUnR0tNLT0/Xmm2/ajyM0NFSStH79ens7aWlpBfp0QECAatWqdcm+37p1a/v+u3bt0qhRo9SmTRtt3rxZJ0+elCS9/PLLmjdv3mX726OPPqqDBw/qgQce0MiRI7Vnz54rvn4Xv44bNmxQbm6u8vLytGHDBv7IUQZERkZq5cqVkqTTp09ry5YtatmypaRLf8Z89NFHmjhxorp06aLx48fL39/fPtsBpYcRK5SKzp07KykpSffdd5/y8/N12223acCAAfrxxx91zz33aNWqVZfdd/r06Zo4caIWLlwoi8Wi1157TT4+PqVYPa5nXbt21Z49exQTEyObzaaYmBh17NhREydO1Lx58+Tt7a34+PginXNVqlTR4MGDdfr0aUVHR9unDw4ZMkT9+vVT5cqV1bJlS50+fVrS+emFEyZM0Msvv1zs871KlSoKDQ1VvXr1CvwF9NZbb9WNN95on07UuHFjdejQwf6LauXKlTV58mQNGzZM+fn5CgsL00svvVTo48W1065dO/3666/q3r27fHx8FBERoX379klyPG8GDx6suLg4ffDBB2rbtq19lPNiFStWVJ8+fXT33XcrICBATZs2VU5OTqGmA4aHh6tx48a666675Ovrq1atWik5OfmSozwXPP7443ruuefUo0cPValSRdWrV5evr6/q16+vbt26KTo6WqGhobr11lslnQ8Qy5cvL3CsPj4+mjlzpp577jkZhqHw8HD7tLjx48drwoQJ6tGjhwzD0JQpUy45DVA6P/rbq1cv2Ww2zZw585Ijzhf639/7/nPPPafx48dr2bJl8vHx0SuvvKLw8HANGzZMAwcOlM1mU7169TR27Fj5+/tfsr+FhIRo0qRJmjFjhry8vAp9G/uOHTvqp59+Uq9evVS+fHkFBwc7jGzh+jR06FBNnDhR0dHRslqteuyxxxQREaH9+/df8jMmNzdXn332me6++255e3vrjjvu4NbtLmAyrvSuCAAokgt3+5s6daqrSwFc6sMPP1RYWJhat26tzMxM9e7dWytXrlRQUFCRnscwDE2bNk1Dhw5VQECAtmzZog8//FCzZ88u9HPExsY63DXRk/zwww/at2+f+vTpI8MwNGLECMXExNj/YIOyhc8Y98aIFQAAKHE33nijJkyYYJ8yOHLkyCKHKun8tUYhISH65z//KW9vb4WEhOiFF14o6XLd1g033KC5c+fqnXfekXR+pJJQBbgnRqwAAAAAwEncvAIAAAAAnESwAgAAAAAnEawAAAAAwEkEKwBAmcPlxQCAkkawAgCUKZ999pni4uJcXQYA4DrD7dYBAGXKkiVLXF0CAOA6xIgVAAAAADiJ77ECAJQZsbGx2rlzp/3xO++8o6CgIM2ZM0eJiYk6c+aMKlWqpDvuuENjxoyRr6+vJCkzM1PTpk3T5s2blZOTo06dOqlp06Z6+eWXtXfvXlcdDgDAjRCsAABlxv79+/Xvf/9bkjRhwgRVqVJF99xzj5o1a6bY2Fj5+Pjoq6++0uLFizV69Gg99thjkqQBAwYoKSlJTz31lKpXr65ly5Zp+/btysvLI1gBACRxjRUAoAy56aabFBAQIElq1qyZvvnmGzVq1Eivvfaaffltt92mbdu2aceOHXrssce0fft27dixQ/Hx8erWrZskqUOHDoqOjtbvv//usmMBALgXghUAoMxq166d2rVrp3Pnzmn//v06fPiw9u3bp9OnT6tixYqSpISEBHl7e6tr1672/cxms7p37674+HgXVQ4AcDcEKwBAmWWz2TRz5ky9++67ysrKUrVq1RQREaFy5crZt0lNTVXFihVlNjve7ykkJKS0ywUAuDGCFQCgzFqwYIGWLFmiSZMmqVu3bqpQoYIk6b777rNvExoaqtTUVNlsNodwderUqVKvFwDgvrjdOgCgTLk4HH333Xe66aabFBMTYw9VJ06c0L59+2Sz2SRJrVu3Vn5+vrZu3WrfzzAMbdmypXQLBwC4NUasAABlSmBgoHbt2qXt27erTp06+uabb7RgwQI1a9ZMhw8f1vz585WXl6fs7GxJUqtWrXT77bdr3LhxOnnypKpXr65Vq1Zp7969MplMLj4aAIC74HbrAIAyJSEhQc8884z++usvvfDCC/rpp5+0adMmnTlzRtWqVdPdd98tk8mk+fPna9u2bQoMDFR6erqmTp2qLVu2KD8/X126dFFgYKDWrl2r77//3tWHBABwAwQrAACuIDk5Wbt371aXLl3sXxgsSSNGjNAff/yhDz74wIXVAQDcBVMBAQC4ArPZrLFjx6pLly667777ZLFY9PXXX2vTpk16+eWXXV0eAMBNMGIFAMBVJCQkaO7cuUpKSlJ+fr7q1aungQMHKjo62tWlAQDcBMEKAAAAAJzE7dYBAAAAwEkEKwAAAABwEsEKAAAAAJxEsAIAAAAAJxGsAAAAAMBJBCsAAAAAcBLBCgAAAACcRLACAAAAACcRrAAAAADASf8PQMJWiyTCF+QAAAAASUVORK5CYII=\",\n      \"text/plain\": [\n       \"<Figure size 1000x300 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Zero-shot with GPT 3.5\\n\",\n    \"method = \\\"zero_shot\\\"\\n\",\n    \"model = \\\"gpt-3.5-turbo-0613\\\"\\n\",\n    \"y_pred[method][model], performance[method][model] = evaluate(\\n\",\n    \"    test_df=test_df, model=model, system_content=system_content,\\n\",\n    \"    assistant_content=\\\"\\\", tags=tags)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"24af6d04-d29e-4adb-a289-4c34c2cc7ec8\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [06:33<00:00,  2.06s/it] \"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.9314722577069027,\\n\",\n      \"  \\\"recall\\\": 0.9267015706806283,\\n\",\n      \"  \\\"f1\\\": 0.9271956481845013\\n\",\n      \"}\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAA00AAAE9CAYAAADXvonEAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAAA8oElEQVR4nO3de3zP9f//8fv7/d5mmxkz2sgxYZQ5xIycSRSJ8aEyhYpyyuHTVsihlBBl+BSK+gglp0pySDr4Ga1IPpZDhizsg23MTvZ+v35/+Hp/vBtvO9l7m9v1cumSvU7Px+u913Pv3fd8vl5vk2EYhgAAAAAA12V2dQEAAAAAUJQRmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoA4DYUFRWlunXr5ui/yMhIV5erOXPmqG7dutq1a5ck6eTJk6pbt67GjRuXp+OdOXNGqampN93ueu2Eh4erbt26ysrKylPbuakrMjJSdevW1fHjxwu8LQBAzrm5ugAAQOF74IEHVK1aNYdlb7zxhhITEzVjxgyH5X/frigoX768ZsyYoapVq+Z6388++0zTpk3TF198IW9v71vWTkHU1bdvX7Vo0UIVKlS45e0DAG6M0AQAt6GgoCAFBQU5LHvnnXeUmJioHj16uKiqnPP29s5zndHR0TkaZcpvO7l1vboaN26sxo0bF0r7AIAbY3oeAAAAADhBaAIA3NSmTZs0aNAgNW/eXPfcc4+aN2+uoUOHav/+/dm2/fzzz9WrVy81atRIrVu31qxZs7Rq1SqHe5Ju1lafPn3UqFEjtWnTRnPnzpXVanXY5nr3GqWlpemNN95Qly5dFBwcrObNm2vIkCH6+eef7dt06NBBX3zxhSSpY8eOCg8Pl3Tl3qEGDRrou+++U/v27dWgQQONGTPG6b1TBw4cUHh4uIKDg9WyZUu9/PLLSkhIcNimQ4cOatOmTbZ9r74ea9asuWldf7+nyWq16t///rd69Oih4OBgNWnSRAMGDNB3333n0MaaNWtUt25d7dy5UzNmzFC7du107733qkuXLlqyZMlNvgsAgGsxPQ8A4NTSpUv1xhtvqHnz5ho+fLjc3d21f/9+rVu3Trt379bWrVtVvnx5SdLChQv11ltv6Z577tELL7ygixcvatmyZTlua/ny5ZoyZYrq1KmjUaNGKTU1VcuXL1daWtpN9x0zZox27NihJ554QnfddZfOnj2rjz/+WE8++aQ+++wzBQUF6eWXX9bixYu1Z88evfTSS6pdu7Z9/6ysLI0bN079+/dXuXLlFBgY6LS9J598Ui1atFBERIQOHjyoVatWKTo6WmvXrlXZsmVzfM6SnNZ1LZvNpuHDh2vbtm1q3ry5xo4dq0uXLmnNmjV69tlnFRkZqYEDBzrsM378eHl7e2vAgAFyc3PT8uXLNX36dPn4+KhPnz65qhMAbleEJgDADVmtVr377ruqV6+elixZIovFYl/n6+ur999/X7t371aXLl105swZRUVF6Z577tHKlSvl4eEhSerRo4e6d+9+07ZSUlI0c+ZM1a5dW59++qm8vLwkSb169brpfUXnz5/Xtm3b9NhjjykiIsK+PDQ0VJGRkfrtt98UFBSkTp066euvv9aePXvUqVMnValSxb6tzWZT//79NWrUKPuykydP3rDNRx99VJMmTbJ/Xbt2bb322mt6//33NWbMmJue77Wc1XWtzz//XNu2bdOjjz6q6dOny2QySZIGDBigsLAwzZw5Ux07dnR4eEfp0qW1evVq+/ejQ4cO6tixo1avXk1oAoAcYnoeAOCGLBaLvv/+e3344YcOgSk1NVXu7u6SroQdSdq6dasyMzM1aNAg+y/o0pWn7z3yyCM3bWvnzp1KTU1V79697YFJkipVqqRu3bo53dfHx0dlypTRpk2btGrVKv33v/+VdOVBClen++VEy5Ytc7SdJA0bNszh6379+qlMmTLavHlzjo+RW19//bUkaeTIkfbAJF05/yFDhshqtWrTpk0O+zz44IMO348qVarIz89PZ8+evWV1AkBJw0gTAMApDw8P/fzzz9q4caPi4uIUHx+vU6dOyTAMSbL/Py4uTpJUs2bNbMeoVavWTds5ceKEJKlGjRq53t/Dw0PTp0/XSy+9pAkTJkiS6tSpo1atWql79+6qX7/+TduXJH9//xxtV65cuWyPAXd3d1eVKlV0+PDhHB0jL06cOCFvb2/deeed2dZdndL399GxihUrZtvWw8NDNpvt1hQJACUQI00AAKfGjh2rp556Sj///LOqVaum8PBwffDBB3rllVcctsvMzJQkh1GNqzw9PXPcXkZGRrZlV4OZM506ddL333+vqKgo9e3bV5mZmfrggw/Uq1cvffTRRzlq+9rRNGeuHeX5e505OUZePxjX2etwNQT9/fU3m3mrB4D8YqQJAHBDMTEx+vLLL9W1a1fNmTPHISzs3bvXYdurI0xHjx7N9iCDo0eP3rSt6tWr33DbY8eOOd03JSVFBw8eVJUqVdS5c2d17txZkhQbG6sBAwZo/vz5GjBgwE1ryKnk5GRduHBBvr6+9mWZmZn6888/7echXQlh1/tMqLxOjatWrZqOHj2q+Pj4bKNNV0e4KleunKdjAwBujD8/AQBuKCkpSdKVqV/XBqbz58/rs88+k/S/UZPOnTvLzc1Ny5Yt0+XLl+3bJiQk2B+n7cz999+vsmXL6uOPP9aFCxfsy8+dO6f169c73ffgwYN6/PHHtWDBAofltWvXVpkyZeTm9r+/EV4dCcrJ6NWN2Gw2LV++3GHZhx9+qEuXLqlr1672ZXfccYeSkpIcpsxlZGTY7026Vk7qevDBByVJc+fOddju0qVLWrRokSwWizp16pS3kwIA3BAjTQCAG2rSpInKlSunRYsWKT09XdWqVdPJkye1evVqXbx4UZLs/7/zzjv13HPPKSoqSo899pi6detmf2T41dGWG01rkyQvLy9NnjxZY8eOVa9evdS3b18ZhqHly5fbHzrhrM6WLVtq5cqVunDhgkJCQmS1WrVx40bFx8c7PFHv6n1LixcvVuvWrfMUMry8vPTee+/p5MmTatCggfbs2aO1a9fqnnvu0aBBg+zbPfroo4qJidHgwYP1xBNPyGazafXq1dcNRjmpq0ePHvr666+1bt06nTp1Sh07dlRaWppWr16tEydOaNy4capatWquzwcA4ByhCQBwQ+XLl9cHH3yg2bNn69NPP1VmZqYCAgL04IMPauDAgerSpYt++OEHPfvss5Kk4cOHq0KFClq2bJlmzZolPz8/hYWFKSMjQ0uWLLnu/U7Xeuihh+Tn56f58+drwYIF8vT0VPfu3VW9enVNnTr1hvuZTCZFRUXpgw8+0MaNG7V9+3ZJUlBQkGbNmuXwyPP+/fvrl19+0erVqxUdHZ2n0OTr66u3335b06dP1/r161W2bFk9+eSTGjlypMP9W3369FFqaqpWrFihGTNmqEKFCurRo4fatGmjxx9/3OGYOanLYrFowYIF+vDDD7Vu3TrNmjVLXl5eatCggSZOnHjdD9IFAOSfycjP/AQAAP5PamqqrFarypQpk23dxIkT9emnn+qbb7654WcQAQBQVHFPEwCgQBw+fFhNmzbVvHnzHJZfvHhR3377rSpWrHjdR2UDAFDUMT0PAFAg7r33XtWtW1fvvvuuzp8/r3r16ikpKUlr1qzRuXPn9NZbbzm9pwkAgKKK6XkAgAJz/vx5LV68WFu3btXp06fl5eWl4OBgPf3002revLmrywMAIE8ITQAAAADgBPc0AQAAAIAThCYAAAAAcILQBAAAAABOuPzpeVlZWZo/f77WrVunpKQk1a9fX//85z/VqFEjSVJsbKymTZum/fv3q3z58nrqqac0YMCAfLVpGIZsNm7lAgAAAG5nZrMpR092dXlo+te//qVVq1Zp+vTpqlq1qhYtWqSnn35aX331ldzd3TVw4EB16NBBU6ZM0d69ezVlyhSVLl1aYWFheW7TZjN0/vylAjwLAAAAAMVN+fKlZbEUg9C0detWdevWTa1atZIkRUZGatWqVdq7d6/i4uLk7u6uqVOnys3NTbVq1dLx48e1cOHCfIUmAAAAAMgpl9/T5O/vr2+//VYnT56U1WrVJ598Ig8PDwUFBSkmJkYhISFyc/tftgsNDdWxY8d09uxZF1YNAAAA4Hbh8pGm8ePHa9SoUerYsaMsFovMZrOioqJUrVo1nT59WnXq1HHY/o477pAknTp1ShUqVMhzu25uLs+LAAAAAIoBl4emI0eOqEyZMpo/f74CAgK0atUqjRs3TsuWLVN6ero8PDwcti9VqpQkKSMjI89tms0m+fmVzlfdAAAAAG4PLg1Np06d0tixY7V06VI1bdpUktSgQQMdOXJEUVFR8vT0VGZmpsM+V8OSt7d3ntu12QxduJCa98IBAAAAFHu+vl6yWG4+A82loenXX3/V5cuX1aBBA4flDRs21Pfff6/KlSsrISHBYd3VrwMCAvLVdlaWLV/7AwAAALeKzWaT1Zrl6jKKNYvFTWZzwdyS49LQFBgYKEk6ePCggoOD7csPHTqkGjVqqGHDhlq5cqWsVqssFoskKTo6WjVr1pS/v79LagYAAABuFcMwdOHCeaWlpbi6lBLBy8tHvr7lc/RZTM64NDQFBwfrvvvuU0REhCZNmqTAwECtW7dOO3fu1IoVK1SlShUtXrxY48eP19NPP619+/Zp6dKlmjJliivLBgAAAG6Jq4HJx8dPHh6l8v3L/u3KMAxlZmYoJSVRklS2bP4GXEyGYRgFUVheJScn6+2339b27duVnJysOnXqaMyYMQoJCZEk7du3T9OmTdOBAwdUsWJFDRo0SP37989Xm1arjQ+3BQAUKLPZJLOZX25yw2YzZLO59NcQoEix2axKSDgpHx8/+fj4urqcEiEl5YJSUhJ1xx1VrztV78qH2958Cp/LQ5MrEJoAAAXJbDapXDnvHL3x4n+sVpuSklIJTsD/uXw5U+fOnVL58oHy8Cjl6nJKhMzMDJ0/f1r+/pXk7u6RbX1OQ5PLHzkOAEBxZzabZLGYNX/FDsUnJLu6nGLhzjvKathj98tsNhGagL9hSl7BKajXktAEAEABiU9I1rH4RFeXUawwOpd7TGu8PblqCjDX2xWEJgAAUOjKlvGUYbPJ19fL1aUUOzabVYmJafwiextx5RTgvE6jPX36tPbv/1WdOj14iyorXIQmAABQ6Ep7eshkNivuy0VKO3fK1eUUG17+lVSz2zNMa7zNuGoKcH6m0U6bNkmBgZUITQAAAPmVdu6U0s6ccHUZQLFQnKYAl7RnzRGaAAAAABSY4cOf1d69v2jv3l+0Z8/PkqR27ToqOnqHEhPP67XXZuj9999TpUqVNX78ZIf9rl127Fic5s2bo19/3SNvb281adJMw4e/IH//CoV+Ttx9CQAAAKDAvP76TN17b7A6dHhAixZ9JElas+ZTjRo1Tm+9FaV77mlw02OcPftfDRv2tKpUqabFi/+tN998W5cupWjo0EFKS0u71aeQDaEJAAAAQIHx9S0rNzc3lSpVSn5+fpKk0ND71axZcwUF1ZeHR/bPS/q7tWs/U8WKAXrhhXGqXr2GgoLqaerU6Tp//py+/XbrrT6FbJieBwAAAOCWqlKlaq62P3Tod8XF/aEHHmjtsDwzM1PHjsUVZGk5QmgCAAAAcEuVKlXqpttYrVb7v202Q02aNNXYsZHZtvPxKVOgteUE0/MAAAAAFCiTyfkH8bq7u+vSpUv2r202m/7666T967vuqqXjx4/pjjsCVKVKVVWpUlW+vr6aO/ctHT165JbVfSOEJgAAAAAFysvLW6dO/aWEhDPXXX/vvcH66addio7+fzp58k/NmTNTFy+m2Nf37NlbKSkpmjp1gg4fPqTDhw/plVdeUmzsAdWsWauwTsOO6XkA4CJms0lms/O/xMGRzWbwgZ4Ablt33lG22LT36KNhmjZtkp588jF5eXllW9+v3xOKjz+piRMj5eHhrocf7qFOnTrbP9+pcuU7NW/ee3r33Xl6/vnBslgsatCgoebOfdf+cInCRGgCABcwm03y8/OS2WxxdSnFis1mVWJiGsEJwG3FZjNktdo07LH7C71tq9WWp5+5LVu20oYN39xwfenSPnrllVedHqNOnSDNnj0v123fCoQmAHCBK6NMFsV9uUhp5065upxiwcu/kmp2e0Zms4nQBOC2YrMZSkpKdcnsBEb4ryA0AYALpZ07pbQzJ1xdBgCgiCO8uBYPggAAAAAAJwhNAAAAAOAE0/MA5BtPgcs9i4W/WQEAUFwQmgDki9lsUrly3oQAAABQYhGaAOSL2WySxWLW/BU7FJ+Q7Opyio2GdSurb5dGri4DAADkAKEJQIGIT0jWsfhEV5dRbFSu6OvqEgAAQA4xnwYAAAAAnGCkCQAAACjiXPXQJT4f6gpCEwAAAFCEmc0m+fl5yWy2FHrbNptViYlpRTY49e7dXV27dtPgwUNuaTuEJgAAAKAIuzLKZFHcl4uUdu5UobXr5V9JNbs9I7PZVGRDU2EhNAEAAADFQNq5U0o7c8LVZdyWCE0AAAAACkyrVk01evSL2rTpKx05ckhVqlTVs88+r1at2kqS3n//Pe3Z87P8/f21c+f/U9euD2v06Bf122+/6t135yk29oDKlSun++9vo6FDh6l0aR9JUkpKit5+e6Z+/PE7ubm5qX//pwrtnHh6HgAAAIAC9e678/Tggw9p6dLlatGilV5++Z/67bdf7ev37v1F5ctX0JIlH6t37346cuSwXnjheTVv3kIffrhCkyZN08GDsRo9ergM48rUwFdeiVRs7H/05ptzNGfOfO3cuUOnTxfOdEVCEwAAAIAC9dBD3RQW9g9Vq1ZDzz03QkFB9fXZZ584bDN48BDdeWcVVa1aTStWfKSQkFANGDBIVatWU8OGjTR58jQdOLBfe/b8rBMnjmn37miNHv2iGjZsrNq162rSpNfk4eFRKOfD9DwAAAAABapJk6YOXzdoEKzdu6PtX/v5lZePj4/964MHD+rkyRN64IHW2Y51/PgxJScnSZLq1atvX16+vL8qV76zgCu/PkITAAAAgAJlsTjGDKvV5vDI9FKlSjmsNwybOnfuqgEDBmU7VrlyfoqJ2SVJ2Z7i9/d2bhWm5wEAAAAoUL//fsDh6/3796lu3aAbbl+zZi3FxR1VlSpV7f9ZrVbNnTtbCQmnVbt2XUlyuC/q4sWLio//89acwN8w0gQAAACgQH366QpVq1ZDQUH19Pnna3XkyCFFRk684fb9+vXXsGFP66233lRY2D+UknJRb701XRkZGapatbrc3d3Vvn0nzZkzQ+7u7vL399e7787X5cuXC+V8CE0AAABAMeDlX6nYtPfoo7306afLdfToEdWqVVuzZ8/T3XfXvuH2997bQLNnz9Pixf/SoEH95e3tpfvua6Zhw16Qu7u7JGnChMmaN+8dTZr0smw2m3r06KWkpMQ815gbhCYAAACgCLPZDNlsVtXs9owL2rZmu48oJ2rUuEvPPz/quusGDx6iwYOHZFt+333NdN99zW54zFKlPDV2bITGjo3IdT35RWgCAAAAijCbzVBiYprMZpNL2s5LaCppCE0AAABAEUd4cS1CEwAAAIAC8+OPMa4uocDxyHEAAAAAcILQBAAAAABOEJoAAACAIsQwuHepoBTUa0loAgAAAIoAi8UiScrMzHBxJSXH1dfSYsnfoxx4EAQAAABQBJjNFnl5+Sgl5coHtnp4lJLJVPiPGS8JDMNQZmaGUlIS5eXlI7M5f2NFhCYAAACgiPD1LS9J9uCE/PHy8rG/pvlRJELTunXrtHDhQv3555+qVq2ahg8frq5du0qSTp48qVdffVU//fSTvL291bt3b40YMcI+fAkAAACUFCaTSWXL+qtMGT9ZrVmuLqdYs1jc8j3CdJXLQ9P69es1fvx4vfzyy2rdurU2bNigMWPGKDAwUPfee68GDx6sGjVqaOXKlTpx4oTGjx8vs9mskSNHurp0AAAA4JYwm80ymz1cXQb+j0tDk2EYeueddzRgwAA98cQTkqTnnntOMTEx2r17t+Lj4/XXX3/p008/VdmyZVWnTh2dO3dOM2bM0NChQ+XhwYUEAAAA4NZy6dPz4uLiFB8fr+7duzssf//99zVkyBDFxMTonnvuUdmyZe3rQkNDlZKSotjY2MIuFwAAAMBtyKUjTXFxcZKk1NRUDR48WAcOHFCVKlX03HPPqUOHDjp9+rQCAwMd9rnjjjskSadOnVLDhg3z3LabG09bBwqCxUJfQuEqitdcUawJJRvXHFC4XBqaUlJSJEkREREaPny4xo0bp02bNun555/XkiVLlJ6eLl9fX4d9SpUqJUnKyMj78+vNZpP8/ErnvXAAgMv4+nq5ugTA5egHQOFyaWhyd3eXJA0ePFg9e/aUJNWrV08HDhzQkiVL5OnpqczMTId9roYlb2/vPLdrsxm6cCE1z/sD+B+LxcybNwrVhQtpslptri7DAf0Aha0o9gOgOPL19crRyK1LQ1NAQIAkqU6dOg7L7777bm3fvl0hISE6dOiQw7qEhASHffMqK4sfNABQHFmtNn6G47ZHPwAKl0snxN5zzz0qXbq0fv31V4flhw4dUrVq1dSsWTMdOHDAPo1PkqKjo1W6dGkFBQUVdrkAAAAAbkMuDU2enp56+umnNX/+fH355Zc6ceKE/vWvf2nHjh0aOHCgOnXqpIoVK+qFF17Q77//rq1bt2r27NkaNGgQjxsHAAAAUChc/uG2zz//vLy8vDRnzhydOXNGtWrVUlRUlJo3by5JWrx4saZMmaJ//OMfKlu2rB5//HE9//zzLq4aAAAAwO3C5aFJkgYOHKiBAwded1316tX1wQcfFHJFAAAAAHAFD/kHAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACccMvtDi+99FKOtzWZTHr99ddz2wQAAAAAFBm5Dk2nT5/WgQMHlJycrDvvvFMBAQFKSkrS8ePHZRiGAgMD7duaTKYCLRYAAAAACluuQ9NDDz2kw4cPa/ny5WrSpIl9+dGjR/Xcc8/p8ccf15NPPlmgRQIAAACAq+T6nqZ3331X48aNcwhMknTXXXfphRde0Pvvv19gxQEAAACAq+U6NJ0/f15ly5a9/sHMZl28eDHfRQEAAABAUZHr0NSwYUPNmzdPiYmJDssTEhIUFRWlVq1aFVhxAAAAAOBqub6nKTIyUv3791eHDh3UuHFj+fn56dy5c9qzZ4/8/f318ssv34o6AQAAAMAlcj3SFBQUpA0bNqhfv35KSUnR/v37lZ6erkGDBmnNmjWqVKnSragTAAAAAFwi1yNNkhQQEKCIiIiCrgUAAAAAipxcjzRJUmZmppYvX67hw4erb9+++uOPP7RixQrt27cvX8XExcWpcePGWrNmjX1ZbGys+vfvr0aNGqlDhw766KOP8tUGAAAAAORGnp6eFxYWpmnTpun48ePat2+f0tPTtX37doWHh2vPnj15KuTy5csaN26cUlNT7csSExM1cOBAVatWTatXr9awYcM0a9YsrV69Ok9tAAAAAEBu5To0zZgxQ5cuXdJXX32ltWvXyjAMSdLcuXPVoEEDzZ07N0+FREVFycfHx2HZp59+Knd3d02dOlW1atVSWFiYnnrqKS1cuDBPbQAAAABAbuU6NH377bcaNWqUqlevLpPJZF9eqlQpDRo0SP/5z39yXcRPP/2kTz75RNOnT3dYHhMTo5CQELm5/e/Wq9DQUB07dkxnz57NdTsAAAAAkFu5fhBERkaGypUrd911FotFly9fztXxLly4oBdffFETJkzI9uS906dPq06dOg7L7rjjDknSqVOnVKFChVy1dS03tzzdzgXgbywW+hIKV1G85opiTSjZuOaAwpXr0NSgQQMtX75cbdu2zbbuiy++0L333pur402ePFmNGzdW9+7ds61LT0+Xh4eHw7JSpUpJuhLe8spsNsnPr3Se9wcAuI6vr5erSwBcjn4AFK5ch6ZRo0bpqaeeUo8ePdS2bVuZTCZ9+eWXioqK0o8//qjFixfn+Fjr1q1TTEyMvvjii+uu9/T0VGZmpsOyq2HJ29s7t6Xb2WyGLlxIvfmGAG7KYjHz5o1CdeFCmqxWm6vLcEA/QGEriv0AKI58fb1yNHKb69DUtGlTLVmyRG+99ZYWL14swzC0dOlS1a9fX++9955CQ0NzfKzVq1fr3LlzateuncPySZMm6auvvlJgYKASEhIc1l39OiAgILelO8jK4gcNABRHVquNn+G47dEPgMKV69C0c+dONW7cWCtXrlR6erqSk5Pl4+Oj0qVzP91t1qxZSk9Pd1jWuXNnjRw5Uo888ojWr1+vlStXymq1ymKxSJKio6NVs2ZN+fv757o9AAAAAMitXN9FOGLECG3evFnSlelzAQEBeQpM0pXRourVqzv8J0n+/v4KCAhQWFiYUlJSNH78eB05ckRr1qzR0qVLNWTIkDy1BwAAAAC5levQ5OvrK09Pz1tRSzb+/v5avHix4uLi1LNnT82bN08vvviievbsWSjtAwAAAECup+cNGTJEr732muLi4hQUFHTdBzI0a9YszwUdPHjQ4evg4GB98skneT4eAAAAAORHjkJTRkaG/VHfkyZNkiTNmTNHkhw+4NYwDJlMJsXGxhZ0nQAAAADgEjkKTR06dNC8efPUuHFjNWvWTH369FFgYOCtrg0AAAAAXC5HoenixYv2R33HxMTon//8p4KDg29pYQAAAABQFOQoNDVo0EBjx47Vm2++KcMwNGzYMHl4eFx3W5PJpK1btxZokQAAAADgKjkKTbNnz9bSpUuVlJSktWvXqn79+ipfvvytrg0AAAAAXC5HoSkgIEARERGSpF27dmn06NEKCgq6pYUBAAAAQFGQ60eOb9u27VbUAQAAAABFUq4/3BYAAAAAbieEJgAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJxwc3UBuD2ZzSaZzSZXl1Gs2GyGbDbD1WUAAADcdghNKHRms0l+fl4ymy2uLqVYsdmsSkxMIzgBAAAUMkITCt2VUSaL4r5cpLRzp1xdTrHg5V9JNbs9I7PZRGgCAAAoZIQmuEzauVNKO3PC1WUAAAAATvEgCAAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJ3h6Xj7xIa25Z7GQ1QEAAFB8EJrywWw2qVw5b0IAAAAAUIIRmvLBbDbJYjFr/oodik9IdnU5xUbDupXVt0sjV5cBAAAA5AihqQDEJyTrWHyiq8soNipX9HV1CQAAAECOMa8MAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4ITLQ1NSUpJeeeUVtWnTRk2aNNFjjz2mmJgY+/qdO3eqV69eatiwobp06aINGza4sFoAAAAAtxuXh6YxY8Zoz549mj17tlavXq169epp8ODBOnr0qP744w8NGTJErVu31po1a9SnTx+9+OKL2rlzp6vLBgAAAHCbcHNl48ePH9eOHTu0fPly3XfffZKkiRMn6ocfftAXX3yhc+fOqW7duho9erQkqVatWjpw4IAWL16sFi1auLJ0AAAAALcJl440+fn5aeHChWrQoIF9mclkkslk0oULFxQTE5MtHIWGhurnn3+WYRiFXS4AAACA25BLQ5Ovr6/atm0rDw8P+7JNmzbp+PHjat26tU6fPq3AwECHfe644w6lpaUpMTGxsMsFAAAAcBty6fS8v/vll1/00ksvqXPnzmrXrp3S09MdApUk+9eZmZn5asvNLf950WJx+S1huM0UxWuuKNaEkq0oXnNFsSaUbFxzQOEqMqFp69atGjdunJo0aaJZs2ZJkkqVKpUtHF392svLK89tmc0m+fmVznuxgIv4+ub9ugdKCvoBQD8ACluRCE3Lli3TtGnT1KVLF7355pv20aRKlSopISHBYduEhAR5e3urTJkyeW7PZjN04UJqvmqWrvyVhx9aKEwXLqTJarW5ugwH9AMUNvoBUDT7AVAc+fp65Wjk1uWhafny5Xr11VcVHh6u8ePHy2Qy2dc1bdpUu3fvdtg+OjpaTZo0kdmcv2HprCx+0KD4sVptXLu47dEPAPoBUNhcGpri4uL0+uuv64EHHtCQIUN09uxZ+zpPT0+Fh4erZ8+emjVrlnr27KnvvvtOX3/9tRYvXuzCqgEAAADcTlwamjZt2qTLly9ry5Yt2rJli8O6nj17avr06VqwYIFmzpypDz/8UFWqVNHMmTP5jCYAAAAAhcaloWno0KEaOnSo023atGmjNm3aFFJFAAAAAOCI51UCAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACZd/ThMAAABKBrPZJLPZdPMNYWezGbLZDFeXgZsgNAEAACDfzGaTypXzlsXCRKbcsFptSkpKJTgVcYQmAAAA5JvZbJLFYtb8FTsUn5Ds6nKKhTvvKKthj90vs9lEaCriCE0AAAAoMPEJyToWn+jqMoACxfgpAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABO8DlNAAAAgAtZLIxj5JbNZhTqBwITmgAAAAAXKFvGU4bNJl9fL1eXUuzYbFYlJqYVWnAiNAEAAAAuUNrTQyazWXFfLlLauVOuLqfY8PKvpJrdnpHZbCI0AQAAALeDtHOnlHbmhKvLgBNMoAQAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOBEsQhNNptNc+fOVevWrdWoUSM988wz+vPPP11dFgAAAIDbQLEITQsWLNDy5cv16quvauXKlbLZbHr66aeVmZnp6tIAAAAAlHBFPjRlZmbqgw8+0MiRI9WuXTsFBQVpzpw5On36tDZv3uzq8gAAAACUcEU+NP3++++6dOmSWrRoYV/m6+ur+vXr66effnJhZQAAAABuBybDMAxXF+HM5s2bNWLECP3666/y9PS0Lx81apTS09P13nvv5fqYhmHIZsv/aZtMktlsVnJKuqxWW76Pd7vwcLfIx7uULl+6IMNmdXU5xYLJbJF7aV/ZbDYVtR5LP8gb+kHu0Q9KFvpA3tAPShb6Qd4UZD8wm00ymUw33c4tf83cemlpaZIkDw8Ph+WlSpVScnJyno5pMplksdz8xcmpsj6eN98I2biX9nV1CcWO2Vx0B4fpB3lDP8g9+kHJQh/IG/pByUI/yJvC7AdFt8f9n6ujS39/6ENGRoa8vLxcURIAAACA20iRD02VKlWSJCUkJDgsT0hIUEBAgCtKAgAAAHAbKfKhKSgoSD4+Ptq1a5d92YULF3TgwAE1a9bMhZUBAAAAuB0U+XuaPDw81L9/f82aNUvly5fXnXfeqZkzZyowMFCdO3d2dXkAAAAASrgiH5okaeTIkcrKytKECROUnp6uZs2a6f3335e7u7urSwMAAABQwhX5R44DAAAAgCsV+XuaAAAAAMCVCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACUITbpnw8HD7v+vWrevCSgDXmjt3rmJiYgr8uCtWrNCKFSvyvB5FV0FeM5GRkVqzZk225WvWrFFkZGSBtIHr69Gjh6tLQBHD70PFl5urC0DJtXv3bleXABQJP/30k5o3b17gx33sscfytR5F1626ZlC41q9f7+oSABQQQhMKxLvvvqvPP/9cFotF999/v9LS0iRJvXr1sv+Fc8qUKdqzZ48yMjL05ptvKjg4WCdOnNDkyZOVmJgoDw8PRUREqEmTJoqMjFRiYqJOnDihUaNGqUuXLq48PRRzs2fP1qZNm2SxWNSjRw917txZr7zyipKSkuTt7a3x48crODhYkZGR8vT01N69e5WUlKTRo0dr69atio2NVfv27TV+/HitWbNGmzZtUkpKihISEtS2bVuNHz9e8fHxGjBggLZt2ybpyl/xd+/erWbNmmn//v2aMGGC5s6dq9KlS+f6mp8+fbrKly+vZ599VpIUERGhkJAQ/fXXX5KkYcOG2fuXxWJRhw4dNGLECEVFRUmSRowYoW+//VZvv/22bDabqlatqqlTp6pChQrq0KGDevTooR07digpKUkTJ05U69atC/k7VPLt2rVL//rXv1SmTBn98ccfCgwM1OzZs/Xll19q3bp1Sk9Pl3TlWv3tt98crpnXX39dw4cPt4eounXr6uDBg4qKitLevXt1+vRp9enTR/Xr19fs2bOVkZGh5ORkjR07Vg8//HCO6tu4caOWLFmi9PR0paena+rUqQoNDVV4eLgaNmyomJgYJSQkaMSIEerZs6dSUlL08ssv6/Dhw6pYsaJMJpOef/55SdK8efP073//W5IcrsFly5ZlO9c6deooJiZGU6dOldlsVtOmTfXdd99py5YtOn/+vF555RX7dT58+HB16NAhW+3h4eGqWbOm9u/fr7S0NEVGRqpt27bZXp+2bdtet9+fOnVKL730ks6ePSsPDw9NnjxZwcHBWr9+vT788ENZrVbdfffdmjJliry9va/b1/bu3avXXntNhmGoVKlSeu2113TXXXc5fK/OnDmjEydOKD4+3l6LJL3zzjvasGGDypQpo1q1aqlq1aoaMWJEXi81uNCuXbs0f/58ubm56dixY2rdurUCAgK0detW2Ww2LVy40L5tWlqaJkyYoIMHD8pkMmnw4MF69NFHb/gek5GRoRdffFEnTpyQyWRS37591a9fPxee7W3IAPJp+/btRlhYmJGammpcvnzZGDp0qLFs2TKjTp069m3q1KljbNiwwTAMw/jwww+NESNGGIZhGP369TP27dtnGIZhHD9+3Gjfvr1x+fJlIyIiwhg7dmzhnwxKnE2bNhl9+/Y10tPTjfT0dKN3795Gs2bNjK+++sowDMPYs2eP0a5dOyMjI8OIiIgwhg4dahiGYaxZs8a47777jLNnzxoXL140GjdubCQnJxurV682QkNDjYSEBCMjI8Po27ev8dVXXxl//vmn0b59e3u7q1evNiIiIgzDMIz+/fsb0dHRhmHk7ZqPjY01HnnkEcMwDCM9Pd1o2bKlcfHiRWPu3LnG3LlzjdjYWKNnz5729WPGjDFSU1Pt68+ePWvcf//9xokTJwzDMIxFixbZ+2D79u2N999/3zAMw9i8ebP9OChY0dHRRqNGjYz4+HjDMAxj6NChxtKlS43w8HAjNTXVMAzDeOedd4ypU6cahuF4zVz7b8Mw7D9b586dazz22GP25SNGjDAOHTpkGIZh7Ny50+jWrZthGIYRERFhrF69OltNV69Rq9VqhIeHG2fPnjUMwzA+++wzY8iQIfa2r9b0n//8xwgJCTEMwzCmT59uvPbaa4ZhGMaJEyeMRo0aGdHR0UZ0dLTRv39/extXr8GLFy9e91wzMzONNm3a2PvEokWL7P1ozJgxxqZNmwzDMIxz584ZnTp1std4rf79+xsvvviiYbPZjAMHDhihoaFGRkZGttcnLCzsuv1+yJAhxtKlSw3DMIxdu3YZgwcPNo4cOWL069fPSEtLMwzDMBYsWGBMnz79hn3t+eefN7755hvDMAxjw4YNxpo1a7J9r3r16mVkZGQYKSkpRqtWrYzff//d2LZtm9GnTx8jLS3NSE1NNXr16mXMnTs32zmieLi2n6emphqNGjUyVqxYYRiGYURGRhpLly61XxNvvvmmMWXKFMMwrlzfHTp0MGJjY2/4HrNlyxZj+PDhhmEYxvnz541x48a55iRvY4w0Id+io6PVrVs3eXl5SZLCwsK0bt26bNt17txZklSnTh1t2bJFly5d0m+//aYJEybYt8nKytKpU6ckSY0bN771xaPE27Vrl7p27apSpUpJkpYuXap27dqpa9eukqRGjRqpbNmyOnr0qCSpXbt2kqTKlSurdu3a8vf3lySVK1dOFy5ckCS1b99eFStWlCQ99NBD+umnn9SgQYOb1pLXaz4oKEiS9Mcff+jQoUMKDQ2Vj4+PfX21atWUmZmpJ554Qm3bttXo0aPt/VGS9u3bp+DgYFWtWlWS1LdvX4e/eLZt29beTlJS0k3PA3lTu3ZtVa5cWZJUr149Xbx4UXPmzNFXX32lY8eO6YcfflC9evVydcxGjRrZ/z1z5kx9++232rx5s3799VddunQpR8cwm81asGCBtm3bpri4OO3evVtm8/9ueb56fdSrV89+ffz444+aOXOmJKlq1apq2bKl0zZ8fHyue66HDh1S+fLl7f2nb9++Wr58ub2Nw4cPa/78+ZKu9JU//vjD3iev1adPH5lMJtWrV0+BgYE6ePCgw+tz6dIlHT9+/Lr9fteuXfZzCQkJUUhIiJYtW6bjx4+rb9++9rarVq16w77WoUMHTZgwQe3bt1f79u314IMPZquxRYsW8vDwkIeHh6pXr67k5GTt2LFD3bp1k6enpyTpkUcesf+cQfFUt25dez/38/NTixYtJF15T7n2exsdHa1p06ZJksqXL6+OHTtq9+7d8vHxue57zJAhQzRt2jQNHjxYbdu2VURERCGfGQhNyDebzZZtWVZWVrZlbm5XLjeTyWTfz8PDw2HO95kzZ+w/KK79pQ/IK4vFYr/mJCk5OTnbNoZh2K9Zd3d3+/Kr1+zfXbvcZrPJbDbLZDLJMAz78suXL2fbL6fX/LXB6t5779W0adPUo0cPbdy4UQcPHlTv3r0djuvt7a1169Zp165d+vHHH9WvXz/79Kir7f79fK+t72qgvPZ1QsG7+jpLV17rv/76S3369FF4eLjatGmjChUqKDY29rr7Xr22MjMzHZZf+3Py8ccfV0hIiEJDQ9WiRQuNGzfOYdsVK1Zo5cqVkqR+/frZ67l06ZLCwsL0yCOPqFmzZqpbt64+/vjjbHVfe31YLBaH6/3a8/p7P3B3d9epU6f0xBNPZDtXi8Vy3fcQ6cp1+9FHH6lcuXKSpISEBJUvX17PPPOMEhISJMke/i0Wi8N+V7+++vpcr9ar/d7Nzc3h3A4fPiyr1aqHHnrI3g9TU1OVmZl5w74WFhamFi1aaPv27Vq6dKm2b9+u1157zaG9v3//DcOQ2Wy+4fmjeLr2PURyvDav9fdr8tr3oeu9xwQEBGjjxo3asWOHfvjhB/Xs2VMbNmyQr69vAZ8BboSn5yHfQkND9eWXXyotLU1ZWVlavXq1mjVrJovFct3wdFWZMmVUo0YN+y+QMTEx6tWrl9N9gNwKCQnRli1blJmZqczMTA0dOlSXLl3Sxo0bJUl79+5VQkKC6tSpk+Nj/vDDD7pw4YIyMjK0YcMGtWrVSmXLllVSUpISEhJktVq1efNm+/YWi0VWqzXH13yDBg20fv16rV+/3v6XyO7du2vTpk2KjY1Vq1atHLaPiYnRM888o9DQUEVERKhWrVqKi4uzr2/YsKH27dunP//8U5L0ySefKCQkJBevIm6F3377TTVq1NDAgQPVsGFDff/997JarZL+d81IV/5a/fvvv0uSvv766+seKykpSceOHdMLL7ygtm3baseOHfb9r3rsscfs19W1Dwk5duyYTCaTnnvuOYWGhjrUcSP333+/1q5dK0k6ffq0du3aJZPJJD8/Px07dkxpaWlKS0vT9u3bnZ7rXXfdpYsXL+o///mPJDnMUggNDbWPOh07dkzdunVTcnKyFi1aZD+PgIAASdKGDRvs7SQlJWXrzz4+Pqpatep1+31ISIh9/z179mjMmDFq3ry5tmzZorNnz0qS3njjDS1YsOCGfe2ZZ55RXFycHn/8cY0aNUoHDhxw+vpd+zpu3LhRGRkZyszM1MaNG/njxW0iNDRUq1atkiSdP39eW7duVdOmTSVd/z3miy++0OTJk9WxY0dNmDBB3t7e9lkKKByMNCHf2rdvr9jYWPXu3VtZWVlq2bKlBgwYoH379umRRx7RZ599dsN9Z86cqcmTJ2vx4sWyWCx655135OHhUYjVo6Tr1KmTDhw4oLCwMNlsNoWFhalt27aaPHmyFixYIHd3d0VFReXquqtYsaKGDBmi8+fPq1u3bvYpfUOHDlW/fv1UoUIFNW3aVOfPn5d0ZcrfpEmT9MYbb+T5mq9YsaICAgJUq1atbH+5vO+++3TXXXfZp/nUr19fbdq0sf8iWqFCBU2dOlXDhw9XVlaWAgMD9frrr+f4fHFrtGrVSr///rseeugheXh4KDg4WIcOHZLkeM0MGTJEERERWrt2rVq0aGEfmbxWuXLl1KdPHz388MPy8fFRw4YNlZ6enqMpekFBQapfv766du0qT09PNWvWTPHx8dcdnbnqueee08SJE9W9e3dVrFhRlStXlqenp2rXrq3OnTurW7duCggI0H333SfpSjhYsWJFtnP18PDQ7NmzNXHiRBmGoaCgIPtUtQkTJmjSpEnq3r27DMPQtGnTrjs1T7oyYtuzZ0/ZbDbNnj37uqPEV/ve3/v9xIkTNWHCBC1fvlweHh568803FRQUpOHDh2vgwIGy2WyqVauWIiMj5e3tfd2+5u/vrylTpmjWrFlyc3PL8aPc27Ztq99++009e/ZU6dKl5efn5zAihZJr2LBhmjx5srp16yar1apnn31WwcHBOnLkyHXfYzIyMvTNN9/o4Ycflru7ux588EEeX17ITIazn4oAAAdXn4o3ffp0V5cCuMznn3+uwMBAhYSEKCUlRb169dKqVatUtmzZXB3HMAzNmDFDw4YNk4+Pj7Zu3arPP/9cc+fOzfExwsPDHZ4uWJz8+uuvOnTokPr06SPDMDRy5EiFhYXZ/xCD2w/vMUUXI00AACBX7rrrLk2aNMk+jW/UqFG5DkzSlXt7/P399Y9//EPu7u7y9/fXq6++WtDlFlk1atTQ/Pnz9dFHH0m6MsJIYAKKJkaaAAAAAMAJHgQBAAAAAE4QmgAAAADACUITAAAAADhBaAIAlDjcrgsAKEiEJgBAifLNN98oIiLC1WUAAEoQHjkOAChRli5d6uoSAAAlDCNNAAAAAOAEn9MEACgxwsPDtXv3bvvXH330kcqWLat58+YpJiZGFy9eVPny5fXggw9q3Lhx8vT0lCSlpKRoxowZ2rJli9LT09WuXTs1bNhQb7zxhg4ePOiq0wEAFBGEJgBAiXHkyBH985//lCRNmjRJFStW1COPPKJGjRopPDxcHh4e+v7777VkyRKNHTtWzz77rCRpwIABio2N1ejRo1W5cmUtX75cO3fuVGZmJqEJAMA9TQCAkuPuu++Wj4+PJKlRo0b68ccfVa9ePb3zzjv25S1bttSOHTu0a9cuPfvss9q5c6d27dqlqKgode7cWZLUpk0bdevWTX/88YfLzgUAUHQQmgAAJVarVq3UqlUrXb58WUeOHNHx48d16NAhnT9/XuXKlZMkRUdHy93dXZ06dbLvZzab9dBDDykqKspFlQMAihJCEwCgxLLZbJo9e7Y+/vhjpaamqlKlSgoODlapUqXs2yQmJqpcuXIymx2fjeTv71/Y5QIAiihCEwCgxFq4cKGWLl2qKVOmqHPnzipTpowkqXfv3vZtAgIClJiYKJvN5hCczp07V+j1AgCKJh45DgAoUa4NPj///LPuvvtuhYWF2QPTmTNndOjQIdlsNklSSEiIsrKytG3bNvt+hmFo69athVs4AKDIYqQJAFCi+Pr6as+ePdq5c6eqV6+uH3/8UQsXLlSjRo10/Phxvffee8rMzFRaWpokqVmzZrr//vs1fvx4nT17VpUrV9Znn32mgwcPymQyufhsAABFAY8cBwCUKNHR0XrppZf03//+V6+++qp+++03bd68WRcvXlSlSpX08MMPy2Qy6b333tOOHTvk6+ur5ORkTZ8+XVu3blVWVpY6duwoX19frVu3Tr/88ourTwkA4GKEJgDAbS0+Pl579+5Vx44d7R92K0kjR47Un3/+qbVr17qwOgBAUcD0PADAbc1sNisyMlIdO3ZU7969ZbFY9MMPP2jz5s164403XF0eAKAIYKQJAHDbi46O1vz58xUbG6usrCzVqlVLAwcOVLdu3VxdGgCgCCA0AQAAAIATPHIcAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACc+P+x2etO0VkUGgAAAABJRU5ErkJggg==\",\n      \"text/plain\": [\n       \"<Figure size 1000x300 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Zero-shot with GPT 4\\n\",\n    \"method = \\\"zero_shot\\\"\\n\",\n    \"model = \\\"gpt-4-0613\\\"\\n\",\n    \"y_pred[method][model], performance[method][model] = evaluate(\\n\",\n    \"    test_df=test_df, model=model, system_content=system_content,\\n\",\n    \"    assistant_content=\\\"\\\", tags=tags)\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"483f6d46-7a9e-4bce-a34f-96c1cf2df29a\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Few-shot learning\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"8d6159b2\",\n   \"metadata\": {},\n   \"source\": [\n    \"Now, we'll be adding a `assistant_context` with a few samples from our training data for each class. The intuition here is that we're giving the model a few examples (few-shot learning) of what each class looks like so that it can learn to generalize better.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"e22ed1e1-b34d-43d1-ae8b-32b1fd5be53d\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'title': 'Comparison between YOLO and RCNN on real world videos',\\n\",\n       \"  'description': 'Bringing theory to experiment is cool. We can easily train models in colab and find the results in minutes.',\\n\",\n       \"  'tag': 'computer-vision'},\\n\",\n       \" {'title': 'Show, Infer & Tell: Contextual Inference for Creative Captioning',\\n\",\n       \"  'description': 'The beauty of the work lies in the way it architects the fundamental idea that humans look at the overall image and then individual pieces of it.\\\\r\\\\n',\\n\",\n       \"  'tag': 'computer-vision'},\\n\",\n       \" {'title': 'Awesome Graph Classification',\\n\",\n       \"  'description': 'A collection of important graph embedding, classification and representation learning papers with implementations.',\\n\",\n       \"  'tag': 'other'},\\n\",\n       \" {'title': 'Awesome Monte Carlo Tree Search',\\n\",\n       \"  'description': 'A curated list of Monte Carlo tree search papers with implementations. ',\\n\",\n       \"  'tag': 'other'},\\n\",\n       \" {'title': 'Rethinking Batch Normalization in Transformers',\\n\",\n       \"  'description': 'We found that NLP batch statistics exhibit large variance throughout training, which leads to poor BN performance.',\\n\",\n       \"  'tag': 'natural-language-processing'},\\n\",\n       \" {'title': 'ELECTRA: Pre-training Text Encoders as Discriminators',\\n\",\n       \"  'description': 'PyTorch implementation of the electra model from the paper: ELECTRA - Pre-training Text Encoders as Discriminators Rather Than Generators',\\n\",\n       \"  'tag': 'natural-language-processing'},\\n\",\n       \" {'title': 'Pytest Board',\\n\",\n       \"  'description': 'Continuous pytest runner with awesome visualization.',\\n\",\n       \"  'tag': 'mlops'},\\n\",\n       \" {'title': 'Debugging Neural Networks with PyTorch and W&B',\\n\",\n       \"  'description': 'A closer look at debugging common issues when training neural networks.',\\n\",\n       \"  'tag': 'mlops'}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Create additional context with few samples from each class\\n\",\n    \"num_samples = 2\\n\",\n    \"additional_context = []\\n\",\n    \"cols_to_keep = [\\\"title\\\", \\\"description\\\", \\\"tag\\\"]\\n\",\n    \"for tag in tags:\\n\",\n    \"    samples = train_df[cols_to_keep][train_df.tag == tag][:num_samples].to_dict(orient=\\\"records\\\")\\n\",\n    \"    additional_context.extend(samples)\\n\",\n    \"additional_context\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"294548a5-9edf-4dea-ab8d-dc7464246810\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Here are some examples with the correct labels: [{'title': 'Comparison between YOLO and RCNN on real world videos', 'description': 'Bringing theory to experiment is cool. We can easily train models in colab and find the results in minutes.', 'tag': 'computer-vision'}, {'title': 'Show, Infer & Tell: Contextual Inference for Creative Captioning', 'description': 'The beauty of the work lies in the way it architects the fundamental idea that humans look at the overall image and then individual pieces of it.\\\\r\\\\n', 'tag': 'computer-vision'}, {'title': 'Awesome Graph Classification', 'description': 'A collection of important graph embedding, classification and representation learning papers with implementations.', 'tag': 'other'}, {'title': 'Awesome Monte Carlo Tree Search', 'description': 'A curated list of Monte Carlo tree search papers with implementations. ', 'tag': 'other'}, {'title': 'Rethinking Batch Normalization in Transformers', 'description': 'We found that NLP batch statistics exhibit large variance throughout training, which leads to poor BN performance.', 'tag': 'natural-language-processing'}, {'title': 'ELECTRA: Pre-training Text Encoders as Discriminators', 'description': 'PyTorch implementation of the electra model from the paper: ELECTRA - Pre-training Text Encoders as Discriminators Rather Than Generators', 'tag': 'natural-language-processing'}, {'title': 'Pytest Board', 'description': 'Continuous pytest runner with awesome visualization.', 'tag': 'mlops'}, {'title': 'Debugging Neural Networks with PyTorch and W&B', 'description': 'A closer look at debugging common issues when training neural networks.', 'tag': 'mlops'}]\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Add additional context\\n\",\n    \"assistant_content = f\\\"\\\"\\\"Here are some examples with the correct labels: {additional_context}\\\"\\\"\\\"\\n\",\n    \"print (assistant_content)\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"a087e14f\",\n   \"metadata\": {},\n   \"source\": [\n    \"> We could increase the number of samples by increasing the context length. We could also retrieve better few-shot samples by extracting examples from the training data that are similar to the current sample (ex. similar unique vocabulary).\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"29bca273-3ea8-4ce0-9fa9-fe19062b7c5b\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [01:16<00:00,  2.49it/s]\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.8435247936255214,\\n\",\n      \"  \\\"recall\\\": 0.8586387434554974,\\n\",\n      \"  \\\"f1\\\": 0.8447984162323493\\n\",\n      \"}\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAA00AAAE9CAYAAADXvonEAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAAA9EklEQVR4nO3df3zN9f//8fs5Z5ttZrMNQ6gIo8yP/BjJ75CGGG/EFCoKyY+3rZAfpYQ3ZegHRb2F8ruS/Eg/fYxWFG+L5FctLOyH2S875/X9w3cnJxz7ZWfmdr1cuuS8fj0fr7PX85xzP8/X63VMhmEYAgAAAABcldnVBQAAAABAcUZoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAKAW1B0dLRq166dq/+ioqJcXa7mzp2r2rVra9euXZKkP/74Q7Vr19a4cePytb3Tp08rLS3tustdrZ2IiAjVrl1b2dnZ+Wo7L3VFRUWpdu3aOn78eKG3BQDIPTdXFwAAKHoPPPCAqlWr5jDtlVdeUWJiombOnOkw/Z/LFQcBAQGaOXOmqlatmud1V69erenTp+uTTz6Rt7f3DWunMOrq06ePmjdvrnLlyt3w9gEA10ZoAoBbUHBwsIKDgx2mvf7660pMTFT37t1dVFXueXt757vOmJiYXI0yFbSdvLpaXQ0bNlTDhg2LpH0AwLVxeh4AAAAAOEFoAgBc1+bNmzV48GA1a9ZMd999t5o1a6Zhw4Zp//79Vyz78ccfq2fPnmrQoIHuv/9+zZ49W6tWrXK4Jul6bfXu3VsNGjRQq1atNG/ePFmtVodlrnatUXp6ul555RV17txZISEhatasmYYOHaoffvjBvky7du30ySefSJLat2+viIgISZeuHapXr56+/vprtW3bVvXq1dOYMWOcXjt14MABRUREKCQkRC1atNDzzz+vhIQEh2XatWunVq1aXbFuzvOxdu3a69b1z2uarFar/vvf/6p79+4KCQlRo0aNNHDgQH399dcObaxdu1a1a9fWzp07NXPmTLVp00b33HOPOnfurCVLllznrwAAuByn5wEAnFq6dKleeeUVNWvWTCNGjJC7u7v279+v9evXa/fu3dq2bZsCAgIkSW+//bb+85//6O6779azzz6r8+fPa9myZblua/ny5Zo6dapq1aqlUaNGKS0tTcuXL1d6evp11x0zZox27Nih/v37q3r16jpz5ow++OADPfroo1q9erWCg4P1/PPPa/HixdqzZ4+ee+451axZ075+dna2xo0bpwEDBqhs2bKqWLGi0/YeffRRNW/eXJGRkTp48KBWrVqlmJgYrVu3Tn5+frneZ0lO67qczWbTiBEjtH37djVr1kxjx47VhQsXtHbtWj355JOKiorSoEGDHNaZMGGCvL29NXDgQLm5uWn58uWaMWOGfHx81Lt37zzVCQC3KkITAOCarFar3nzzTdWpU0dLliyRxWKxz/P19dU777yj3bt3q3Pnzjp9+rSio6N19913a+XKlfLw8JAkde/eXV27dr1uW6mpqZo1a5Zq1qypjz76SF5eXpKknj17Xve6onPnzmn79u3q16+fIiMj7dNDQ0MVFRWlffv2KTg4WB06dNDnn3+uPXv2qEOHDqpSpYp9WZvNpgEDBmjUqFH2aX/88cc123z44Yc1efJk++OaNWvqpZde0jvvvKMxY8Zcd38v56yuy3388cfavn27Hn74Yc2YMUMmk0mSNHDgQIWHh2vWrFlq3769w807SpcurTVr1tj/Hu3atVP79u21Zs0aQhMA5BKn5wEArsliseibb77Re++95xCY0tLS5O7uLulS2JGkbdu2KSsrS4MHD7Z/QJcu3X2vW7du121r586dSktLU69eveyBSZIqVaqksLAwp+v6+PioTJky2rx5s1atWqW//vpL0qUbKeSc7pcbLVq0yNVykjR8+HCHx3379lWZMmW0ZcuWXG8jrz7//HNJ0jPPPGMPTNKl/R86dKisVqs2b97ssE6nTp0c/h5VqlSRv7+/zpw5c8PqBICShpEmAIBTHh4e+uGHH7Rp0yYdPXpU8fHxOnnypAzDkCT7/48ePSpJuvPOO6/YRo0aNa7bzokTJyRJd9xxR57X9/Dw0IwZM/Tcc89p4sSJkqRatWqpZcuW6tq1q+rWrXvd9iUpMDAwV8uVLVv2ituAu7u7q0qVKvr1119ztY38OHHihLy9vXXbbbddMS/nlL5/jo6VL1/+imU9PDxks9luTJEAUAIx0gQAcGrs2LF67LHH9MMPP6hatWqKiIjQu+++qxdeeMFhuaysLElyGNXI4enpmev2MjMzr5iWE8yc6dChg7755htFR0erT58+ysrK0rvvvquePXvq/fffz1Xbl4+mOXP5KM8/68zNNvL7w7jOnoecEPTP599s5q0eAAqKkSYAwDXFxsbq008/1YMPPqi5c+c6hIW9e/c6LJszwnTkyJErbmRw5MiR67Z1++23X3PZY8eOOV03NTVVBw8eVJUqVdSxY0d17NhRkhQXF6eBAwdqwYIFGjhw4HVryK3k5GSlpKTI19fXPi0rK0u///67fT+kSyHsar8Jld9T46pVq6YjR44oPj7+itGmnBGuypUr52vbAIBr4+snAMA1JSUlSbp06tflgencuXNavXq1pL9HTTp27Cg3NzctW7ZMFy9etC+bkJBgv522M/fdd5/8/Pz0wQcfKCUlxT797Nmz2rBhg9N1Dx48qEceeUQLFy50mF6zZk2VKVNGbm5/f0eYMxKUm9Gra7HZbFq+fLnDtPfee08XLlzQgw8+aJ9WoUIFJSUlOZwyl5mZab826XK5qatTp06SpHnz5jksd+HCBS1atEgWi0UdOnTI304BAK6JkSYAwDU1atRIZcuW1aJFi5SRkaFq1arpjz/+0Jo1a3T+/HlJsv//tttu01NPPaXo6Gj169dPYWFh9luG54y2XOu0Nkny8vLSlClTNHbsWPXs2VN9+vSRYRhavny5/aYTzups0aKFVq5cqZSUFDVt2lRWq1WbNm1SfHy8wx31cq5bWrx4se6///58hQwvLy+99dZb+uOPP1SvXj3t2bNH69at0913363Bgwfbl3v44YcVGxurIUOGqH///rLZbFqzZs1Vg1Fu6urevbs+//xzrV+/XidPnlT79u2Vnp6uNWvW6MSJExo3bpyqVq2a5/0BADhHaAIAXFNAQIDeffddzZkzRx999JGysrIUFBSkTp06adCgQercubO+/fZbPfnkk5KkESNGqFy5clq2bJlmz54tf39/hYeHKzMzU0uWLLnq9U6X69Kli/z9/bVgwQItXLhQnp6e6tq1q26//XZNmzbtmuuZTCZFR0fr3Xff1aZNm/TVV19JkoKDgzV79myHW54PGDBAP/74o9asWaOYmJh8hSZfX1+99tprmjFjhjZs2CA/Pz89+uijeuaZZxyu3+rdu7fS0tK0YsUKzZw5U+XKlVP37t3VqlUrPfLIIw7bzE1dFotFCxcu1Hvvvaf169dr9uzZ8vLyUr169TRp0qSr/pAuAKDgTEZBzk8AAOD/S0tLk9VqVZkyZa6YN2nSJH300Uf64osvrvkbRAAAFFdc0wQAKBS//vqrGjdurPnz5ztMP3/+vL788kuVL1/+qrfKBgCguOP0PABAobjnnntUu3Ztvfnmmzp37pzq1KmjpKQkrV27VmfPntV//vMfp9c0AQBQXHF6HgCg0Jw7d06LFy/Wtm3bdOrUKXl5eSkkJESPP/64mjVr5uryAADIF0ITAAAAADjBNU0AAAAA4AShCQAAAACcIDQBAAAAgBO35N3zDMOQzcalXAAAAMCtzGw25erOrrdkaLLZDJ07d8HVZQAAAABwoYCA0rJYrh+aOD0PAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMCJW/LueQAAAEBxZrPZZLVmu7qMm5rF4iazuXDGiAhNAAAAQDFhGIZSUs4pPT3V1aWUCF5ePvL1DcjVbzE5Q2gCAAAAiomcwOTj4y8Pj1IF/rB/qzIMQ1lZmUpNTZQk+fkFFmh7hCYAAOASZrNJZjMfCPPKZjNksxmuLgM3gM1mtQcmHx9fV5dz0/PwKCVJSk1NVJky/gU6VY/QBAAAipzZbJK/v5fMZourS7np2GxWJSamE5xKIKvVKunvD/souJzn0mrNltnske/tEJoAAECRuzTKZNHRTxcp/exJV5dz0/AKrKQ7w56Q2WwiNJVgnJJXeArruSQ0AQAAl0k/e1Lpp0+4ugyg2HPV6aycDnqJy0NTdna2FixYoPXr1yspKUl169bVv//9bzVo0ECSFBcXp+nTp2v//v0KCAjQY489poEDB7q2aAAAAKCImM0mlS3rLYul6H9i1Wq1KSkpLc/B6dSpU9q//yd16NDpBlVWtFwemt544w2tWrVKM2bMUNWqVbVo0SI9/vjj+uyzz+Tu7q5BgwapXbt2mjp1qvbu3aupU6eqdOnSCg8Pd3XpAAAAwA1nNptksZi1YMUOxSckF1m7t1Xw0/B+9+XrdNDp0yerYsVKhKbCsm3bNoWFhally5aSpKioKK1atUp79+7V0aNH5e7urmnTpsnNzU01atTQ8ePH9fbbbxOaAAAAcEuJT0jWsfhEV5eRK4ZRsk7pK/oxvn8IDAzUl19+qT/++ENWq1UffvihPDw8FBwcrNjYWDVt2lRubn9nu9DQUB07dkxnzpxxYdUAAAAArmbEiCe1d++P2rTpU/Xq1VW9enXV/PmvacCA3nroofbas+cHjRjxpKZPn3LFepdPO3bsqMaNe0YPPHC/unfvpKlTJ+rsWddkAJePNE2YMEGjRo1S+/btZbFYZDabFR0drWrVqunUqVOqVauWw/IVKlSQJJ08eVLlypXLd7tubi7PiwAA3LJccW1GScLzVzLZbCXjrnkvvzxL48ePVoUKQRo9eryeeGKg1q79SK++OldlypRR9ep3XXcbZ878peHDH9cDDzyokSPHKD09Xe+++5aGDRus99//UF5eXnmqyWIxFejzv8tD0+HDh1WmTBktWLBAQUFBWrVqlcaNG6dly5YpIyNDHh6O91MvVerSvdYzMzPz3eal34YoXaC6AQAAXMXXN28fGHFzyMiw6MwZ8xUf8F0dkvPafkCAv9zd3eXp6any5QMlSc2b36fmzZvblzGZTDKZHPfz8mkbNqxRhQpBGjduvH3+yy+/qk6d2uvrr79QWFi3XNVis5lkNpvl5+ctT0/PPO3H5Vwamk6ePKmxY8dq6dKlaty4sSSpXr16Onz4sKKjo+Xp6amsrCyHdXLCkre3d77btdkMpaSk5b9wAABQIBaLmQ/+BZCSki6r1ebqMlDIsrIyZbPZZLUays4uPn9fq9WW53oMw5Bh/L0ft91W1WEb/5z/z2m//BKnI0d+U9u29zlsNysrU0eOHMl1PVarIZvNpuTkNKWnW6+Y7+vrlatQ6NLQ9NNPP+nixYuqV6+ew/T69evrm2++UeXKlZWQkOAwL+dxUFBQgdouTgcigFuTq35z42bG74UAl+TnQyyKP6u15L6+5Zwt5ozV+neosdkMNWrUWGPHRl2xnI9PmTy3X9Ag6tLQVLFiRUnSwYMHFRISYp9+6NAh3XHHHapfv75Wrlwpq9Uqi8UiSYqJidGdd96pwMBAl9QMAIXh0mnCXjKbLa4u5aZis1mVmJhOcAKAYs5kcv6loLu7uy5cuGB/bLPZ9Oeff6hKlaqSpOrVa+iLL7aoQoUg++U6KSnJeumlyerbd4AaNWp844q/CpeGppCQEN17772KjIzU5MmTVbFiRa1fv147d+7UihUrVKVKFS1evFgTJkzQ448/rp9//llLly7V1KlTXVk2ABTYpVEmi45+ukjpZ0+6upybgldgJd0Z9kS+fi+kKDBymDeuvkYDwI3l5eWtkyf/VELC6avOv+eeEK1c+YFiYv5PVapU1YcfLtf586n2+T169NKGDWs1bdpEPfro45KkBQte02+/Hdadd9Yokn24nEtDk9ls1htvvKHXXntNzz33nJKTk1WrVi0tXbpU9evXlyQtXrxY06dPV48ePVS+fHmNHz9ePXr0cGXZAFBo0s+eVPrpE64uAwVkNptUtqw3QQDADXVbBb+bpr2HHw7X9OmT9eij/a56p7u+ffsrPv4PTZoUJQ8Pdz30UHd16NDR/vtOlSvfpvnz39Kbb87X008PkcViUb169TVv3pvy9/fPd135ZTJK2i9P5YLVatO5cxeuvyAA3CBubmb5+5fWgfemEZpyySuomuo++oISEy8Uu2s5cv6eC1bsUHxCsqvLuSnUr11ZfTo3oA/kUXHuByi4ixezdPbsSQUGVpK7+993kHblFzNWq01JSWnFcoQ/N671nOYICChd/G8EAQBASRKfkKxj8YmuLuOmULm8r6tLAG4aNpuhpKQ0l5wCzA14LiE0AQAAAMUc4cW1OPkaAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAn+J0mAAAAoJgzm038uK0LEZoAAACAYsxsNsnf30tms6XI27bZrEpMTC+2walXr6568MEwDRky9Ia2Q2gCAAAAirFLo0wWHf10kdLPniyydr0CK+nOsCdkNpuKbWgqKoQmAAAA4CaQfvak0k+fcHUZtyRCEwAAAIBC07JlY40ePV6bN3+mw4cPqUqVqnryyafVsmVrSdI777ylPXt+UGBgoHbu/D89+OBDGj16vPbt+0lvvjlfcXEHVLZsWd13XysNGzZcpUv7SJJSU1P12muz9N13X8vNzU0DBjxWZPvE3fMAAAAAFKo335yvTp26aOnS5WrevKWef/7f2rfvJ/v8vXt/VEBAOS1Z8oF69eqrw4d/1bPPPq1mzZrrvfdWaPLk6Tp4ME6jR4+QYVw6NfCFF6IUF/c/vfrqXM2du0A7d+7QqVNFc7oioQkAAABAoerSJUzh4f9StWp36KmnRio4uK5Wr/7QYZkhQ4bqttuqqGrValqx4n01bRqqgQMHq2rVaqpfv4GmTJmuAwf2a8+eH3TixDHt3h2j0aPHq379hqpZs7YmT35JHh4eRbI/nJ4HoMBcdRvUm5nFwndWAICSq1Gjxg6P69UL0e7dMfbH/v4B8vHxsT8+ePCg/vjjhB544P4rtnX8+DElJydJkurUqWufHhAQqMqVbyvkyq+O0ASgQMxmk8qW9SYEAAAAO4vFMWZYrTaHW6aXKlXKYb5h2NSx44MaOHDwFdsqW9ZfsbG7JOmKu/j9s50bhdAEoEDMZpMsFrMWrNih+IRkV5dz06hfu7L6dG7g6jIAALghfvnlgFq2bGV/vH//z6pdO/iay995Zw0dPXpEVapUtU87fvyYFix4XcOGDVfNmrUlSfv2/aQWLVpKks6fP6/4+N9v0B44IjQBKBTxCck6Fp/o6jJuGpXL+7q6BAAAbpiPPlqhatXuUHBwHX388TodPnxIUVGTrrl8374DNHz44/rPf15VePi/lJp6Xv/5zwxlZmaqatXb5e7urrZtO2ju3Jlyd3dXYGCg3nxzgS5evFgk+0NoAgAAAG4CXoGVbpr2Hn64pz76aLmOHDmsGjVqas6c+brrrprXXP6ee+ppzpz5Wrz4DQ0ePEDe3l66994mGj78Wbm7u0uSJk6covnzX9fkyc/LZrOpe/eeSkoqmi9sCU0AAABAMWazGbLZrLoz7AkXtG294jqi3Ljjjup6+ulRV503ZMhQDRky9Irp997bRPfe2+Sa2yxVylNjx0Zq7NjIPNdTUIQmAAAAoBiz2QwlJqa75E61lwJb3kNTSUNoAgAAAIo5wotrEZoAAAAAFJrvvot1dQmFjh9WAQAAAAAnCE0AAAAA4AShCQAAAChGDINrlwpLYT2XhCYAAACgGLBYLJKkrKxMF1dScuQ8lxZLwW7lwI0gAAAAgGLAbLbIy8tHqamXfrDVw6OUTKaiv814SWAYhrKyMpWamigvLx+ZzQUbKyI0AQAAAMWEr2+AJNmDEwrGy8vH/pwWBKEJAAAAKCZMJpP8/AJVpoy/rNZsV5dzU7NY3Ao8wpSD0AQAAAAUM2azWWazh6vLwP/HjSAAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThSL0LR+/Xp16dJF9erV00MPPaRNmzbZ5/3xxx8aOnSoGjVqpJYtW+q1116T1Wp1YbUAAAAAbiUuD00bNmzQhAkT1L9/f23cuFFhYWEaM2aM9uzZo4sXL2rIkCGSpJUrV2rKlClasWKFFixY4OKqAQAAANwq3FzZuGEYev311zVw4ED1799fkvTUU08pNjZWu3fvVnx8vP7880999NFH8vPzU61atXT27FnNnDlTw4YNk4eHhyvLBwAAAHALcOlI09GjRxUfH6+uXbs6TH/nnXc0dOhQxcbG6u6775afn599XmhoqFJTUxUXF1fU5QIAAAC4Bbl0pOno0aOSpLS0NA0ZMkQHDhxQlSpV9NRTT6ldu3Y6deqUKlas6LBOhQoVJEknT55U/fr18922m5vLz0wESgSLhb6EolUcj7niWBNKNo45oGi5NDSlpqZKkiIjIzVixAiNGzdOmzdv1tNPP60lS5YoIyNDvr6+DuuUKlVKkpSZmZnvds1mk/z9S+e/cACAy/j6erm6BMDl6AdA0XJpaHJ3d5ckDRkyRD169JAk1alTRwcOHNCSJUvk6emprKwsh3VywpK3t3e+27XZDKWkpOV7fQB/s1jMvHmjSKWkpMtqtbm6DAf0AxS14tgPgJuRr69XrkZuXRqagoKCJEm1atVymH7XXXfpq6++UtOmTXXo0CGHeQkJCQ7r5ld2Ni80AHAzslptvIbjlkc/AIqWS0+Ivfvuu1W6dGn99NNPDtMPHTqkatWqqUmTJjpw4ID9ND5JiomJUenSpRUcHFzU5QIAAAC4Bbk0NHl6eurxxx/XggUL9Omnn+rEiRN64403tGPHDg0aNEgdOnRQ+fLl9eyzz+qXX37Rtm3bNGfOHA0ePJjbjQMAAAAoEi49PU+Snn76aXl5eWnu3Lk6ffq0atSooejoaDVr1kyStHjxYk2dOlX/+te/5Ofnp0ceeURPP/20i6sGAAAAcKtweWiSpEGDBmnQoEFXnXf77bfr3XffLeKKAAAAAOASbvIPAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE645XWF5557LtfLmkwmvfzyy3ltAgAAAACKjTyHplOnTunAgQNKTk7WbbfdpqCgICUlJen48eMyDEMVK1a0L2symQq1WAAAAAAoankOTV26dNGvv/6q5cuXq1GjRvbpR44c0VNPPaVHHnlEjz76aKEWCQAAAACukudrmt58802NGzfOITBJUvXq1fXss8/qnXfeKbTiAAAAAMDV8hyazp07Jz8/v6tvzGzW+fPnC1wUAAAAABQXeQ5N9evX1/z585WYmOgwPSEhQdHR0WrZsmWhFQcAAAAArpbna5qioqI0YMAAtWvXTg0bNpS/v7/Onj2rPXv2KDAwUM8///yNqBMAAAAAXCLPI03BwcHauHGj+vbtq9TUVO3fv18ZGRkaPHiw1q5dq0qVKt2IOgEAAADAJfI80iRJQUFBioyMLOxaAAAAAKDYyVdoysrK0urVq/V///d/+uuvv/Tyyy9r9+7duvvuuxUSElLYNQIAAACAy+Tr7nnh4eGaPn26jh8/rp9//lkZGRn66quvFBERoT179tyIOgEAAADAJfIcmmbOnKkLFy7os88+07p162QYhiRp3rx5qlevnubNm1foRQIAAACAq+Q5NH355ZcaNWqUbr/9dplMJvv0UqVKafDgwfrf//5XqAUCAAAAgCvlOTRlZmaqbNmyV51nsVh08eLFgtYEAAAAAMVGnkNTvXr1tHz58qvO++STT3TPPfcUuCgAAAAAKC7yfPe8UaNG6bHHHlP37t3VunVrmUwmffrpp4qOjtZ3332nxYsX34g6AQAAAMAl8jzS1LhxYy1ZskReXl5avHixDMPQ0qVL9ddff+mtt95SaGhovos5evSoGjZsqLVr19qnxcXFacCAAWrQoIHatWun999/P9/bBwAAAIC8yvNI086dO9WwYUOtXLlSGRkZSk5Olo+Pj0qXLl2gQi5evKhx48YpLS3NPi0xMVGDBg1Su3btNHXqVO3du1dTp05V6dKlFR4eXqD2AAAAACA38jzSNHLkSG3ZskWS5OnpqaCgoAIHJkmKjo6Wj4+Pw7SPPvpI7u7umjZtmmrUqKHw8HA99thjevvttwvcHgAAAADkRp5Dk6+vrzw9PQu1iO+//14ffvihZsyY4TA9NjZWTZs2lZvb3wNioaGhOnbsmM6cOVOoNQAAAADA1eT59LyhQ4fqpZde0tGjRxUcHCxvb+8rlmnSpEmut5eSkqLx48dr4sSJqlSpksO8U6dOqVatWg7TKlSoIEk6efKkypUrl9fy7dzc8pwXAVyFxUJfQtEqjsdccawJJRvHHFC0chWaMjMzVapUKUnS5MmTJUlz586VJIcfuDUMQyaTSXFxcbkuYMqUKWrYsKG6du16xbyMjAx5eHg4TMupIzMzM9dt/JPZbJK/f8FPKQQAFD1fXy9XlwC4HP0AKFq5Ck3t2rXT/Pnz1bBhQzVp0kS9e/dWxYoVC9z4+vXrFRsbq08++eSq8z09PZWVleUwLScsXW2EK7dsNkMpKWnXXxDAdVksZt68UaRSUtJltdpcXYYD+gGKWnHsB8DNyNfXK1cjt7kKTefPn1dCQoKkS9cZ/fvf/1ZISEjBKpS0Zs0anT17Vm3atHGYPnnyZH322WeqWLGivd0cOY+DgoIK1HZ2Ni80AHAzslptvIbjlkc/AIpWrkJTvXr1NHbsWL366qsyDEPDhw+/4rS5HCaTSdu2bctV47Nnz1ZGRobDtI4dO+qZZ55Rt27dtGHDBq1cuVJWq1UWi0WSFBMTozvvvFOBgYG5agMAAAAACiJXoWnOnDlaunSpkpKStG7dOtWtW1cBAQEFbvxao0WBgYEKCgpSeHi4Fi9erAkTJujxxx/Xzz//rKVLl2rq1KkFbhsAAAAAciNXoSkoKEiRkZGSpF27dmn06NEKDg6+oYVJl8LT4sWLNX36dPXo0UPly5fX+PHj1aNHjxveNgAAAABI+bjl+Pbt229EHXYHDx50eBwSEqIPP/zwhrYJAAAAANfCTf4BAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJxwc3UBNzuz2SSz2eTqMm46Npshm81wdRkAAADAdRGaCsBsNqlsWW9ZLAzY5ZXValNSUhrBCQAAAMUeoakAzGaTLBazFqzYofiEZFeXc9O4rYKfhve7T2azidAEAACAYo/QVAjiE5J1LD7R1WUAAAAAuAE4rwwAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADghMtDU1JSkl544QW1atVKjRo1Ur9+/RQbG2ufv3PnTvXs2VP169dX586dtXHjRhdWCwAAAOBW4/LQNGbMGO3Zs0dz5szRmjVrVKdOHQ0ZMkRHjhzRb7/9pqFDh+r+++/X2rVr1bt3b40fP147d+50ddkAAAAAbhFurmz8+PHj2rFjh5YvX657771XkjRp0iR9++23+uSTT3T27FnVrl1bo0ePliTVqFFDBw4c0OLFi9W8eXNXlg4AAADgFuHSkSZ/f3+9/fbbqlevnn2ayWSSyWRSSkqKYmNjrwhHoaGh+uGHH2QYRlGXCwAAAOAW5NKRJl9fX7Vu3dph2ubNm3X8+HE9//zzWrdunSpWrOgwv0KFCkpPT1diYqICAgLy3babW8HzosXi8rMbb2o8fyUDf0cUteJ4zBXHmlCyccwBRculoemffvzxRz333HPq2LGj2rRpo4yMDHl4eDgsk/M4Kysr3+2YzSb5+5cuUK0oOF9fL1eXAOAmxGsHQD8AilqxCU3btm3TuHHj1KhRI82ePVuSVKpUqSvCUc5jL6/8v1jYbIZSUtLyX+z/Z7GYedEqgJSUdFmtNleXgQKiH6CoFcfXDvoBilpx7AfAzcjX1ytXI7fFIjQtW7ZM06dPV+fOnfXqq6/aR5MqVaqkhIQEh2UTEhLk7e2tMmXKFKjN7GxeaFzNarXxdwCQZ7x2APQDoKi5/ITY5cuX68UXX1T//v01Z84ch9PxGjdurN27dzssHxMTo0aNGslsdnnpAAAAAG4BLh1pOnr0qF5++WU98MADGjp0qM6cOWOf5+npqYiICPXo0UOzZ89Wjx499PXXX+vzzz/X4sWLXVg1AAAAgFuJS0PT5s2bdfHiRW3dulVbt251mNejRw/NmDFDCxcu1KxZs/Tee++pSpUqmjVrFr/RBAAAAKDIuDQ0DRs2TMOGDXO6TKtWrdSqVasiqggAAAAAHHFhEAAAAAA4QWgCAAAAACcITQAAAADgRLH4nSYAAADc/Mxmk8xmk6vLuKnYbIZsNsPVZeA6CE0AAAAoMLPZpLJlvWWxcCJTXlitNiUlpRGcijlCE1yGF9W84ZsoAEBxZjabZLGYtWDFDsUnJLu6nJvCbRX8NLzffTKbTbzHF3OEJhQ5vzKeMmw2+fp6ubqUm4rNZlViYjovqgCAYi0+IVnH4hNdXQZQqAhNKHKlPT1kMpt19NNFSj970tXl3BS8AivpzrAn+CYKAADABQhNcJn0syeVfvqEq8sAAABwKS5ZyLuivmyB0AQAAAC4AJcs5F9RX7ZAaAIAAABcgEsW8scVly0QmgAAAAAX4pKF4o8TKAEAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnCA0AQAAAIAThCYAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHCC0AQAAAAAThCaAAAAAMAJQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtAEAAAAAE4QmgAAAADACUITAAAAADhBaAIAAAAAJwhNAAAAAOAEoQkAAAAAnLgpQpPNZtO8efN0//33q0GDBnriiSf0+++/u7osAAAAALeAmyI0LVy4UMuXL9eLL76olStXymaz6fHHH1dWVparSwMAAABQwhX70JSVlaV3331XzzzzjNq0aaPg4GDNnTtXp06d0pYtW1xdHgAAAIASrtiHpl9++UUXLlxQ8+bN7dN8fX1Vt25dff/99y6sDAAAAMCtwGQYhuHqIpzZsmWLRo4cqZ9++kmenp726aNGjVJGRobeeuutPG/TMAzZbAXfbZNJMpvNSk7NkNVqK/D2bhUe7hb5eJfSxQspMmxWV5dzUzCZLXIv7Subzabi1mPpB/lDP8g7+kHJQh/IH/pByUI/yJ/C7Adms0kmk+m6y7kVrJkbLz09XZLk4eHhML1UqVJKTk7O1zZNJpMslus/Obnl5+N5/YVwBffSvq4u4aZjNhffwWH6Qf7QD/KOflCy0Afyh35QstAP8qco+0Hx7XH/X87o0j9v+pCZmSkvLy9XlAQAAADgFlLsQ1OlSpUkSQkJCQ7TExISFBQU5IqSAAAAANxCin1oCg4Olo+Pj3bt2mWflpKSogMHDqhJkyYurAwAAADAraDYX9Pk4eGhAQMGaPbs2QoICNBtt92mWbNmqWLFiurYsaOrywMAAABQwhX70CRJzzzzjLKzszVx4kRlZGSoSZMmeuedd+Tu7u7q0gAAAACUcMX+luMAAAAA4ErF/pomAAAAAHAlQhMAAAAAOEFoAgAAAAAnCE0AAAAA4AShCQAAAACcIDQBAAAAgBOEJgAAAABwgtCEGyYiIsL+79q1a7uwEsC15s2bp9jY2ELf7ooVK7RixYp8z0fxVZjHTFRUlNauXXvF9LVr1yoqKqpQ2sDVde/e3dUloJjh89DNy83VBaDk2r17t6tLAIqF77//Xs2aNSv07fbr169A81F83ahjBkVrw4YNri4BQCEhNKFQvPnmm/r4449lsVh03333KT09XZLUs2dP+zecU6dO1Z49e5SZmalXX31VISEhOnHihKZMmaLExER5eHgoMjJSjRo1UlRUlBITE3XixAmNGjVKnTt3duXu4SY3Z84cbd68WRaLRd27d1fHjh31wgsvKCkpSd7e3powYYJCQkIUFRUlT09P7d27V0lJSRo9erS2bdumuLg4tW3bVhMmTNDatWu1efNmpaamKiEhQa1bt9aECRMUHx+vgQMHavv27ZIufYu/e/duNWnSRPv379fEiRM1b948lS5dOs/H/IwZMxQQEKAnn3xSkhQZGammTZvqzz//lCQNHz7c3r8sFovatWunkSNHKjo6WpI0cuRIffnll3rttddks9lUtWpVTZs2TeXKlVO7du3UvXt37dixQ0lJSZo0aZLuv//+Iv4LlXy7du3SG2+8oTJlyui3335TxYoVNWfOHH366adav369MjIyJF06Vvft2+dwzLz88ssaMWKEPUTVrl1bBw8eVHR0tPbu3atTp06pd+/eqlu3rubMmaPMzEwlJydr7Nixeuihh3JV36ZNm7RkyRJlZGQoIyND06ZNU2hoqCIiIlS/fn3FxsYqISFBI0eOVI8ePZSamqrnn39ev/76q8qXLy+TyaSnn35akjR//nz997//lSSHY3DZsmVX7GutWrUUGxuradOmyWw2q3Hjxvr666+1detWnTt3Ti+88IL9OB8xYoTatWt3Re0RERG68847tX//fqWnpysqKkqtW7e+4vlp3br1Vfv9yZMn9dxzz+nMmTPy8PDQlClTFBISog0bNui9996T1WrVXXfdpalTp8rb2/uqfW3v3r166aWXZBiGSpUqpZdeeknVq1d3+FudPn1aJ06cUHx8vL0WSXr99de1ceNGlSlTRjVq1FDVqlU1cuTI/B5qcKFdu3ZpwYIFcnNz07Fjx3T//fcrKChI27Ztk81m09tvv21fNj09XRMnTtTBgwdlMpk0ZMgQPfzww9d8j8nMzNT48eN14sQJmUwm9enTR3379nXh3t6CDKCAvvrqKyM8PNxIS0szLl68aAwbNsxYtmyZUatWLfsytWrVMjZu3GgYhmG89957xsiRIw3DMIy+ffsaP//8s2EYhnH8+HGjbdu2xsWLF43IyEhj7NixRb8zKHE2b95s9OnTx8jIyDAyMjKMXr16GU2aNDE+++wzwzAMY8+ePUabNm2MzMxMIzIy0hg2bJhhGIaxdu1a49577zXOnDljnD9/3mjYsKGRnJxsrFmzxggNDTUSEhKMzMxMo0+fPsZnn31m/P7770bbtm3t7a5Zs8aIjIw0DMMwBgwYYMTExBiGkb9jPi4uzujWrZthGIaRkZFhtGjRwjh//rwxb948Y968eUZcXJzRo0cP+/wxY8YYaWlp9vlnzpwx7rvvPuPEiROGYRjGokWL7H2wbdu2xjvvvGMYhmFs2bLFvh0UrpiYGKNBgwZGfHy8YRiGMWzYMGPp0qVGRESEkZaWZhiGYbz++uvGtGnTDMNwPGYu/7dhGPbX1nnz5hn9+vWzTx85cqRx6NAhwzAMY+fOnUZYWJhhGIYRGRlprFmz5oqaco5Rq9VqREREGGfOnDEMwzBWr15tDB061N52Tk3/+9//jKZNmxqGYRgzZswwXnrpJcMwDOPEiRNGgwYNjJiYGCMmJsYYMGCAvY2cY/D8+fNX3desrCyjVatW9j6xaNEiez8aM2aMsXnzZsMwDOPs2bNGhw4d7DVebsCAAcb48eMNm81mHDhwwAgNDTUyMzOveH7Cw8Ov2u+HDh1qLF261DAMw9i1a5cxZMgQ4/Dhw0bfvn2N9PR0wzAMY+HChcaMGTOu2deefvpp44svvjAMwzA2btxorF279oq/Vc+ePY3MzEwjNTXVaNmypfHLL78Y27dvN3r37m2kp6cbaWlpRs+ePY158+ZdsY+4OVzez9PS0owGDRoYK1asMAzDMKKiooylS5faj4lXX33VmDp1qmEYl47vdu3aGXFxcdd8j9m6dasxYsQIwzAM49y5c8a4ceNcs5O3MEaaUGAxMTEKCwuTl5eXJCk8PFzr16+/YrmOHTtKkmrVqqWtW7fqwoUL2rdvnyZOnGhfJjs7WydPnpQkNWzY8MYXjxJv165devDBB1WqVClJ0tKlS9WmTRs9+OCDkqQGDRrIz89PR44ckSS1adNGklS5cmXVrFlTgYGBkqSyZcsqJSVFktS2bVuVL19ektSlSxd9//33qlev3nVrye8xHxwcLEn67bffdOjQIYWGhsrHx8c+v1q1asrKylL//v3VunVrjR492t4fJennn39WSEiIqlatKknq06ePwzeerVu3treTlJR03f1A/tSsWVOVK1eWJNWpU0fnz5/X3Llz9dlnn+nYsWP69ttvVadOnTxts0GDBvZ/z5o1S19++aW2bNmin376SRcuXMjVNsxmsxYuXKjt27fr6NGj2r17t8zmvy95zjk+6tSpYz8+vvvuO82aNUuSVLVqVbVo0cJpGz4+Plfd10OHDikgIMDef/r06aPly5fb2/j111+1YMECSZf6ym+//Wbvk5fr3bu3TCaT6tSpo4oVK+rgwYMOz8+FCxd0/Pjxq/b7Xbt22feladOmatq0qZYtW6bjx4+rT58+9rarVq16zb7Wrl07TZw4UW3btlXbtm3VqVOnK2ps3ry5PDw85OHhodtvv13JycnasWOHwsLC5OnpKUnq1q2b/XUGN6fatWvb+7m/v7+aN28u6dJ7yuV/25iYGE2fPl2SFBAQoPbt22v37t3y8fG56nvM0KFDNX36dA0ZMkStW7dWZGRkEe8ZCE0oMJvNdsW07OzsK6a5uV063Ewmk309Dw8Ph3O+T58+bX+huPxDH5BfFovFfsxJUnJy8hXLGIZhP2bd3d3t03OO2X+6fLrNZpPZbJbJZJJhGPbpFy9evGK93B7zlwere+65R9OnT1f37t21adMmHTx4UL169XLYrre3t9avX69du3bpu+++U9++fe2nR+W0+8/9vby+nEB5+fOEwpfzPEuXnus///xTvXv3VkREhFq1aqVy5copLi7uquvmHFtZWVkO0y9/nXzkkUfUtGlThYaGqnnz5ho3bpzDsitWrNDKlSslSX379rXXc+HCBYWHh6tbt25q0qSJateurQ8++OCKui8/PiwWi8Pxfvl+/bMfuLu76+TJk+rfv/8V+2qxWK76HiJdOm7ff/99lS1bVpKUkJCggIAAPfHEE0pISJAke/i3WCwO6+U8znl+rlZrTr93c3Nz2Ldff/1VVqtVXbp0sffDtLQ0ZWVlXbOvhYeHq3nz5vrqq6+0dOlSffXVV3rppZcc2vvn398wDJnN5mvuP25Ol7+HSI7H5uX+eUxe/j50tfeYoKAgbdq0STt27NC3336rHj16aOPGjfL19S3kPcC1cPc8FFhoaKg+/fRTpaenKzs7W2vWrFGTJk1ksViuGp5ylClTRnfccYf9A2RsbKx69uzpdB0gr5o2baqtW7cqKytLWVlZGjZsmC5cuKBNmzZJkvbu3auEhATVqlUr19v89ttvlZKSoszMTG3cuFEtW7aUn5+fkpKSlJCQIKvVqi1bttiXt1gsslqtuT7m69Wrpw0bNmjDhg32byK7du2qzZs3Ky4uTi1btnRYPjY2Vk888YRCQ0MVGRmpGjVq6OjRo/b59evX188//6zff/9dkvThhx+qadOmeXgWcSPs27dPd9xxhwYNGqT69evrm2++kdVqlfT3MSNd+rb6l19+kSR9/vnnV91WUlKSjh07pmeffVatW7fWjh077Ovn6Nevn/24uvwmIceOHZPJZNJTTz2l0NBQhzqu5b777tO6deskSadOndKuXbtkMpnk7++vY8eOKT09Xenp6frqq6+c7mv16tV1/vx5/e9//5Mkh7MUQkND7aNOx44dU1hYmJKTk7Vo0SL7fgQFBUmSNm7caG8nKSnpiv7s4+OjqlWrXrXfN23a1L7+nj17NGbMGDVr1kxbt27VmTNnJEmvvPKKFi5ceM2+9sQTT+jo0aN65JFHNGrUKB04cMDp83f587hp0yZlZmYqKytLmzZt4suLW0RoaKhWrVolSTp37py2bdumxo0bS7r6e8wnn3yiKVOmqH379po4caK8vb3tZymgaDDShAJr27at4uLi1KtXL2VnZ6tFixYaOHCgfv75Z3Xr1k2rV6++5rqzZs3SlClTtHjxYlksFr3++uvy8PAowupR0nXo0EEHDhxQeHi4bDabwsPD1bp1a02ZMkULFy6Uu7u7oqOj83TclS9fXkOHDtW5c+cUFhZmP6Vv2LBh6tu3r8qVK6fGjRvr3Llzki6d8jd58mS98sor+T7my5cvr6CgINWoUeOKby7vvfdeVa9e3X6aT926ddWqVSv7B9Fy5cpp2rRpGjFihLKzs1WxYkW9/PLLud5f3BgtW7bUL7/8oi5dusjDw0MhISE6dOiQJMdjZujQoYqMjNS6devUvHlz+8jk5cqWLavevXvroYceko+Pj+rXr6+MjIxcnaIXHBysunXr6sEHH5Snp6eaNGmi+Pj4q47O5Hjqqac0adIkde3aVeXLl1flypXl6empmjVrqmPHjgoLC1NQUJDuvfdeSZfCwYoVK67YVw8PD82ZM0eTJk2SYRgKDg62n6o2ceJETZ48WV27dpVhGJo+ffpVT82TLo3Y9ujRQzabTXPmzLnqKHFO3/tnv580aZImTpyo5cuXy8PDQ6+++qqCg4M1YsQIDRo0SDabTTVq1FBUVJS8vb2v2tcCAwM1depUzZ49W25ubrm+lXvr1q21b98+9ejRQ6VLl5a/v7/DiBRKruHDh2vKlCkKCwuT1WrVk08+qZCQEB0+fPiq7zGZmZn64osv9NBDD8nd3V2dOnXi9uVFzGQ4e1UEADjIuSvejBkzXF0K4DIff/yxKlasqKZNmyo1NVU9e/bUqlWr5Ofnl6ftGIahmTNnavjw4fLx8dG2bdv08ccfa968ebneRkREhMPdBW8mP/30kw4dOqTevXvLMAw988wzCg8Pt38Rg1sP7zHFFyNNAAAgT6pXr67JkyfbT+MbNWpUngOTdOnansDAQP3rX/+Su7u7AgMD9eKLLxZ2ucXWHXfcoQULFuj999+XdGmEkcAEFE+MNAEAAACAE9wIAgAAAACcIDQBAAAAgBOEJgAAAABwgtAEAChxuFwXAFCYCE0AgBLliy++UGRkpKvLAACUINxyHABQoixdutTVJQAAShhGmgAAAADACX6nCQBQYkRERGj37t32x++//778/Pw0f/58xcbG6vz58woICFCnTp00btw4eXp6SpJSU1M1c+ZMbd26VRkZGWrTpo3q16+vV155RQcPHnTV7gAAiglCEwCgxDh8+LD+/e9/S5ImT56s8uXLq1u3bmrQoIEiIiLk4eGhb775RkuWLNHYsWP15JNPSpIGDhyouLg4jR49WpUrV9by5cu1c+dOZWVlEZoAAFzTBAAoOe666y75+PhIkho0aKDvvvtOderU0euvv26f3qJFC+3YsUO7du3Sk08+qZ07d2rXrl2Kjo5Wx44dJUmtWrVSWFiYfvvtN5ftCwCg+CA0AQBKrJYtW6ply5a6ePGiDh8+rOPHj+vQoUM6d+6cypYtK0mKiYmRu7u7OnToYF/PbDarS5cuio6OdlHlAIDihNAEACixbDab5syZow8++EBpaWmqVKmSQkJCVKpUKfsyiYmJKlu2rMxmx3sjBQYGFnW5AIBiitAEACix3n77bS1dulRTp05Vx44dVaZMGUlSr1697MsEBQUpMTFRNpvNITidPXu2yOsFABRP3HIcAFCiXB58fvjhB911110KDw+3B6bTp0/r0KFDstlskqSmTZsqOztb27dvt69nGIa2bdtWtIUDAIotRpoAACWKr6+v9uzZo507d+r222/Xd999p7ffflsNGjTQ8ePH9dZbbykrK0vp6emSpCZNmui+++7ThAkTdObMGVWuXFmrV6/WwYMHZTKZXLw3AIDigFuOAwBKlJiYGD333HP666+/9OKLL2rfvn3asmWLzp8/r0qVKumhhx6SyWTSW2+9pR07dsjX11fJycmaMWOGtm3bpuzsbLVv316+vr5av369fvzxR1fvEgDAxQhNAIBbWnx8vPbu3av27dvbf+xWkp555hn9/vvvWrdunQurAwAUB5yeBwC4pZnNZkVFRal9+/bq1auXLBaLvv32W23ZskWvvPKKq8sDABQDjDQBAG55MTExWrBggeLi4pSdna0aNWpo0KBBCgsLc3VpAIBigNAEAAAAAE5wy3EAAAAAcILQBAAAAABOEJoAAAAAwAlCEwAAAAA4QWgCAAAAACcITQAAAADgBKEJAAAAAJwgNAEAAACAE4QmAAAAAHDi/wHxKTsvTvZRlgAAAABJRU5ErkJggg==\",\n      \"text/plain\": [\n       \"<Figure size 1000x300 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Few-shot with GPT 3.5\\n\",\n    \"method = \\\"few_shot\\\"\\n\",\n    \"model = \\\"gpt-3.5-turbo-0613\\\"\\n\",\n    \"y_pred[method][model], performance[method][model] = evaluate(\\n\",\n    \"    test_df=test_df, model=model, system_content=system_content,\\n\",\n    \"    assistant_content=assistant_content, tags=tags)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"3e59a3b9-69d9-4bb5-8b88-0569fcc72f0c\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [02:13<00:00,  1.43it/s]\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.9407759040163695,\\n\",\n      \"  \\\"recall\\\": 0.9267015706806283,\\n\",\n      \"  \\\"f1\\\": 0.9302632275594479\\n\",\n      \"}\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAA00AAAE9CAYAAADXvonEAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAAA8h0lEQVR4nO3de3zP9f//8fv7/d5mm9lsw0ZOJYwyh5iRMwmRGB8qU6gop8KnrZBDKSHK8CmHqI9Qcqokh6SDn9GK8LEcMmRhH2xjdrK9X78/fL0/3o23bWbvbW7Xy6VL9jo9H6/3Xs+9d9/z9Xq+TYZhGAIAAAAAXJfZ2QUAAAAAQFFGaAIAAAAABwhNAAAAAOAAoQkAAAAAHCA0AQAAAIADhCYAAAAAcIDQBAAAAAAOEJoAAAAAwAFCEwAAAAA4QGgCgDtQVFSUateunav/IiMjnV2uZs2apdq1a2vnzp2SpJMnT6p27doaM2ZMvo535swZpaam3nS767UTHh6u2rVrKysrK19t56WuyMhI1a5dW8ePHy/wtgAAuefi7AIAAIXvoYceUtWqVe2WvfXWW0pMTNS0adPslv99u6LAz89P06ZNU5UqVfK87+eff64pU6boyy+/lKen521rpyDq6tOnj5o1a6Zy5crd9vYBADdGaAKAO1BQUJCCgoLslr333ntKTExU9+7dnVRV7nl6eua7zujo6FyNMt1qO3l1vboaNmyohg0bFkr7AIAb4/Y8AAAAAHCA0AQAuKmNGzdq4MCBatq0qe677z41bdpUQ4YM0f79+3Ns+8UXX6hnz55q0KCBWrZsqRkzZmjlypV2zyTdrK3evXurQYMGatWqlWbPnq3s7Gy7ba73rFFaWpreeustderUScHBwWratKkGDx6sX375xbZNu3bt9OWXX0qS2rdvr/DwcElXnh2qV6+evv/+e7Vt21b16tXTqFGjHD47deDAAYWHhys4OFjNmzfXq6++qoSEBLtt2rVrp1atWuXY9+rrsXr16pvW9fdnmrKzs/Xvf/9b3bt3V3BwsBo1aqT+/fvr+++/t2tj9erVql27tnbs2KFp06apTZs2uv/++9WpUyctXrz4Jt8FAMC1uD0PAODQkiVL9NZbb6lp06YaNmyYXF1dtX//fq1du1a7du3Sli1b5OfnJ0maP3++3nnnHd1333168cUXdfHiRS1dujTXbS1btkyTJk1SrVq1NHLkSKWmpmrZsmVKS0u76b6jRo3S9u3b9eSTT+qee+7R2bNn9cknn+ipp57S559/rqCgIL366qtauHChdu/erVdeeUU1a9a07Z+VlaUxY8aoX79+Klu2rAIDAx2299RTT6lZs2aKiIjQwYMHtXLlSkVHR2vNmjXy8fHJ9TlLcljXtaxWq4YNG6atW7eqadOmGj16tC5duqTVq1frueeeU2RkpAYMGGC3z9ixY+Xp6an+/fvLxcVFy5Yt09SpU+Xl5aXevXvnqU4AuFMRmgAAN5Sdna33339fderU0eLFi2WxWGzrvL29tWjRIu3atUudOnXSmTNnFBUVpfvuu08rVqyQm5ubJKl79+7q1q3bTdtKSUnR9OnTVbNmTX322Wfy8PCQJPXs2fOmzxWdP39eW7du1eOPP66IiAjb8tDQUEVGRmrfvn0KCgpShw4d9M0332j37t3q0KGDKleubNvWarWqX79+GjlypG3ZyZMnb9jmY489pgkTJti+rlmzpt544w0tWrRIo0aNuun5XstRXdf64osvtHXrVj322GOaOnWqTCaTJKl///4KCwvT9OnT1b59e7vJO0qXLq1Vq1bZvh/t2rVT+/bttWrVKkITAOQSt+cBAG7IYrHohx9+0EcffWQXmFJTU+Xq6irpStiRpC1btigzM1MDBw60/YIuXZl979FHH71pWzt27FBqaqp69eplC0ySVLFiRXXt2tXhvl5eXipTpow2btyolStX6r///a+kKxMpXL3dLzeaN2+eq+0kaejQoXZf9+3bV2XKlNGmTZtyfYy8+uabbyRJI0aMsAUm6cr5Dx48WNnZ2dq4caPdPg8//LDd96Ny5cry9fXV2bNnb1udAFDSMNIEAHDIzc1Nv/zyizZs2KC4uDjFx8fr1KlTMgxDkmz/j4uLkyTdfffdOY5Ro0aNm7Zz4sQJSVL16tXzvL+bm5umTp2qV155RePGjZMk1apVSy1atFC3bt1Ut27dm7YvSf7+/rnarmzZsjmmAXd1dVXlypV1+PDhXB0jP06cOCFPT0/dddddOdZdvaXv76Nj5cuXz7Gtm5ubrFbr7SkSAEogRpoAAA6NHj1aTz/9tH755RdVrVpV4eHh+vDDD/Xaa6/ZbZeZmSlJdqMaV7m7u+e6vYyMjBzLrgYzRzp06KAffvhBUVFR6tOnjzIzM/Xhhx+qZ8+e+vjjj3PV9rWjaY5cO8rz9zpzc4z8fjCuo9fhagj6++tvNvNWDwC3ipEmAMANxcTE6KuvvlLnzp01a9Ysu7CwZ88eu22vjjAdPXo0x0QGR48evWlb1apVu+G2x44dc7hvSkqKDh48qMqVK6tjx47q2LGjJCk2Nlb9+/fX3Llz1b9//5vWkFvJycm6cOGCvL29bcsyMzP1559/2s5DuhLCrveZUPm9Na5q1ao6evSo4uPjc4w2XR3hqlSpUr6ODQC4Mf78BAC4oaSkJElXbv26NjCdP39en3/+uaT/jZp07NhRLi4uWrp0qS5fvmzbNiEhwTadtiMPPvigfHx89Mknn+jChQu25efOndO6desc7nvw4EE98cQTmjdvnt3ymjVrqkyZMnJx+d/fCK+OBOVm9OpGrFarli1bZrfso48+0qVLl9S5c2fbsgoVKigpKcnulrmMjAzbs0nXyk1dDz/8sCRp9uzZdttdunRJCxYskMViUYcOHfJ3UgCAG2KkCQBwQ40aNVLZsmW1YMECpaenq2rVqjp58qRWrVqlixcvSpLt/3fddZeef/55RUVF6fHHH1fXrl1tU4ZfHW250W1tkuTh4aGJEydq9OjR6tmzp/r06SPDMLRs2TLbpBOO6mzevLlWrFihCxcuKCQkRNnZ2dqwYYPi4+PtZtS7+tzSwoUL1bJly3yFDA8PD33wwQc6efKk6tWrp927d2vNmjW67777NHDgQNt2jz32mGJiYjRo0CA9+eSTslqtWrVq1XWDUW7q6t69u7755hutXbtWp06dUvv27ZWWlqZVq1bpxIkTGjNmjKpUqZLn8wEAOEZoAgDckJ+fnz788EPNnDlTn332mTIzMxUQEKCHH35YAwYMUKdOnfTjjz/queeekyQNGzZM5cqV09KlSzVjxgz5+voqLCxMGRkZWrx48XWfd7pWly5d5Ovrq7lz52revHlyd3dXt27dVK1aNU2ePPmG+5lMJkVFRenDDz/Uhg0btG3bNklSUFCQZsyYYTfleb9+/fTrr79q1apVio6Ozldo8vb21rvvvqupU6dq3bp18vHx0VNPPaURI0bYPb/Vu3dvpaamavny5Zo2bZrKlSun7t27q1WrVnriiSfsjpmbuiwWi+bNm6ePPvpIa9eu1YwZM+Th4aF69epp/Pjx1/0gXQDArTMZt3J/AgAA/yc1NVXZ2dkqU6ZMjnXjx4/XZ599pm+//faGn0EEAEBRxTNNAIACcfjwYTVu3Fhz5syxW37x4kV99913Kl++/HWnygYAoKjj9jwAQIG4//77Vbt2bb3//vs6f/686tSpo6SkJK1evVrnzp3TO++84/CZJgAAiipuzwMAFJjz589r4cKF2rJli06fPi0PDw8FBwfrmWeeUdOmTZ1dHgAA+UJoAgAAAAAHeKYJAAAAABwgNAEAAACAA4QmAAAAAHDA6bPnZWVlae7cuVq7dq2SkpJUt25d/fOf/1SDBg0kSbGxsZoyZYr2798vPz8/Pf300+rfv/8ttWkYhqxWHuUCAAAA7mRmsylXM7s6PTT961//0sqVKzV16lRVqVJFCxYs0DPPPKOvv/5arq6uGjBggNq1a6dJkyZpz549mjRpkkqXLq2wsLB8t2m1Gjp//lIBngUAAACA4sbPr7QslmIQmrZs2aKuXbuqRYsWkqTIyEitXLlSe/bsUVxcnFxdXTV58mS5uLioRo0aOn78uObPn39LoQkAAAAAcsvpzzT5+/vru+++08mTJ5Wdna1PP/1Ubm5uCgoKUkxMjEJCQuTi8r9sFxoaqmPHjuns2bNOrBoAAADAncLpI01jx47VyJEj1b59e1ksFpnNZkVFRalq1ao6ffq0atWqZbd9hQoVJEmnTp1SuXLl8t2ui4vT8yIAAACAYsDpoenIkSMqU6aM5s6dq4CAAK1cuVJjxozR0qVLlZ6eLjc3N7vtS5UqJUnKyMjId5tms0m+vqVvqW4AAAAAdwanhqZTp05p9OjRWrJkiRo3bixJqlevno4cOaKoqCi5u7srMzPTbp+rYcnT0zPf7Vqthi5cSM1/4QAAAACKPW9vD1ksN78Dzamh6bffftPly5dVr149u+X169fXDz/8oEqVKikhIcFu3dWvAwICbqntrCzrLe0PAAAA3C5Wq1XZ2VnOLqNYs1hcZDYXzCM5Tg1NgYGBkqSDBw8qODjYtvzQoUOqXr266tevrxUrVig7O1sWi0WSFB0drbvvvlv+/v5OqRkAAAC4XQzD0IUL55WWluLsUkoEDw8veXv75eqzmBxxamgKDg7WAw88oIiICE2YMEGBgYFau3atduzYoeXLl6ty5cpauHChxo4dq2eeeUZ79+7VkiVLNGnSJGeWDQAAANwWVwOTl5ev3NxK3fIv+3cqwzCUmZmhlJRESZKPz60NuJgMwzAKorD8Sk5O1rvvvqtt27YpOTlZtWrV0qhRoxQSEiJJ2rt3r6ZMmaIDBw6ofPnyGjhwoPr163dLbWZnW/lwWwBAgTKbTTKb+eUmL6xWQ1arU38NAYoUqzVbCQkn5eXlKy8vb2eXUyKkpFxQSkqiKlSoct1b9a58uO3Nb+FzemhyBkITAKAgmc0mlS3rmas3XvxPdrZVSUmpBCfg/1y+nKlz507Jzy9Qbm6lnF1OiZCZmaHz50/L37+iXF3dcqzPbWhy+pTjAAAUd2azSRaLWXOXb1d8QrKzyykW7qrgo6GPPyiz2URoAv6GW/IKTkG9loQmAAAKSHxCso7FJzq7DAAlkLNuAeY22isITQAAAEAR5sxbgPN7G+3p06e1f/9v6tDh4dtUWeEiNAEAAABFmLNuAb6V22inTJmgwMCKhCYAAAAAhac43QJc0uaaIzQBAAAAKDDDhj2nPXt+1Z49v2r37l8kSW3atFd09HYlJp7XG29M06JFH6hixUoaO3ai3X7XLjt2LE5z5szSb7/tlqenpxo1aqJhw16Uv3+5Qj8n5kYFAAAAUGDefHO67r8/WO3aPaQFCz6WJK1e/ZlGjhyjd96J0n331bvpMc6e/a+GDn1GlStX1cKF/9bbb7+rS5dSNGTIQKWlpd3uU8iB0AQAAACgwHh7+8jFxUWlSpWSr6+vJCk09EE1adJUQUF15eaW8/OS/m7Nms9VvnyAXnxxjKpVq66goDqaPHmqzp8/p+++23K7TyEHbs8DAAAAcFtVrlwlT9sfOvS74uL+0EMPtbRbnpmZqWPH4gqytFwhNAEAAAC4rUqVKnXTbbKzs23/tloNNWrUWKNHR+bYzsurTIHWlhvcngcAAACgQJlMjj+I19XVVZcuXbJ9bbVa9ddfJ21f33NPDR0/fkwVKgSocuUqqly5iry9vTV79js6evTIbav7RghNAAAAAAqUh4enTp36SwkJZ667/v77g/XzzzsVHf3/dPLkn5o1a7ouXkyxre/Ro5dSUlI0efI4HT58SIcPH9Jrr72i2NgDuvvuGoV1GjbcngcAAAAUA3dV8Ck27T32WJimTJmgp556XB4eHjnW9+37pOLjT2r8+Ei5ubnqkUe6q0OHjrbPd6pU6S7NmfOB3n9/jl54YZAsFovq1auv2bPft00uUZhMRkn75KlcyM626vz5SzffEACAXHBxMcvXt7Refe/rYvPBk85W/S5fvTmyixITLykry+rscoAi4fLlTJ07d0r+/hXl6vq/GebMZpPKlvWUxVL4N4llZ1uVlJQqq7V4RoYbvaZX+fmVztXrykgTAAAAUIRZrYaSklJlNjt+Tuh2tV1cA1NBIjQBAACnccZfzos7fom9M/F9dy5CEwAAKHQ+ZdxlWK3y9s75rAMcs1qzlZiYxi/QQCEiNAEAgEJX2t1NJrNZcV8tUNq5U84up9jw8K+ou7s+K7PZRGgCChGhCcAtM5tNTrnPurjjVgtASjt3SmlnTji7DABwiNAE4JY4c0af4q64z0gEAMCdgtAE4JaYzSZZLGbNXb5d8QnJzi6n2Lirgo+GPv4gt9gAAFAMEJoAFIj4hGQ+nwYAAJRI3E8DAAAAAA4w0gQAAAAUcc6adIlJi64gNAEAAABFmNlskq+vh8xmS6G3XdQ/F6xXr27q3LmrBg0afFvbITQBAAAARdiVUSZLoX+uGZ8L9j+EJgAAAKAY4HPNnIfQBAAAAKDAtGjRWC+99LI2bvxaR44cUuXKVfTccy+oRYvWkqRFiz7Q7t2/yN/fXzt2/D917vyIXnrpZe3b95vef3+OYmMPqGzZsnrwwVYaMmSoSpf2kiSlpKTo3Xen66efvpeLi4v69Xu60M6J2fMAAAAAFKj335+jhx/uoiVLlqlZsxZ69dV/at++32zr9+z5VX5+5bR48Sfq1auvjhw5rBdffEFNmzbTRx8t14QJU3TwYKxeemmYDOPKrYGvvRap2Nj/6O23Z2nWrLnasWO7Tp8unNsVGWkCACeyWPjbVV4wixMAFA9dunRVWNg/JEnPPz9cu3f/os8//1T16tW3bTNo0GB5eV0ZRXr99fEKCQlV//4DJUlVqlTVxIlT9I9/dNfu3b+oXLly2rUrWu++O0/16zeUJE2Y8IZ69epWKOdDaAIAJ/Ap4y7DapW3t4ezSylWivosTgCAKxo1amz3db16wdq1K9r2ta+vny0wSdLBgwd18uQJPfRQyxzHOn78mJKTkyRJderUtS338/NXpUp3FXDl10doAgAnKO3uJpPZXOgzIRVnzOIEAMWHxWIfM7KzrXZTppcqVcpuvWFY1bFjZ9tI07XKlvVVTMxOScrx8//v7dwuhCYAcCJmQgIAlES//35ALVq0sn29f/9e1a4ddMPt7767huLijqpy5Sq2ZcePH9Pcue9pyJChqlmztiRp377f1Lx5C0nSxYsXFR//5206A3uEJgAAAAAF6rPPlqtq1eoKCqqjL75YoyNHDikycvwNt+/bt5+GDn1G77zztsLC/qGUlIt6552pysjIUJUq1eTq6qq2bTto1qxpcnV1lb+/v95/f64uX75cKOdDaAIAAACKAQ//isWmvcce66nPPlumo0ePqEaNmpo5c47uvbfmDbe///56mjlzjhYu/JcGDuwnT08PPfBAEw0d+qJcXV0lSePGTdScOe9pwoRXZbVa1b17TyUlJea7xrwgNAEAAABF2JWZQ7N1d9dnndB2dr6eI61e/R698MLI664bNGiwBg0anGP5Aw800QMPNLnhMUuVctfo0REaPToiz/XcKkITAAAAUIRZrYYSE9NkNpuc0jaT7xCaAAAAgCKP8OJchCYAAAAABeann2KcXUKB46PoAQAAAMABQhMAAAAAOEBoAgAAAIoQw+DZpYJSUK8loQkAAAAoAiwWiyQpMzPDyZWUHFdfS4vl1qZyYCIIAAAAoAgwmy3y8PBSSsqVD2x1cyslk6nwpxkvCQzDUGZmhlJSEuXh4SWz+dbGighNAAAAQBHh7e0nSbbghFvj4eFle01vRZEITWvXrtX8+fP1559/qmrVqho2bJg6d+4sSTp58qRef/11/fzzz/L09FSvXr00fPhw2/AlAAAAUFKYTCb5+PirTBlfZWdnObucYs1icbnlEaarnB6a1q1bp7Fjx+rVV19Vy5YttX79eo0aNUqBgYG6//77NWjQIFWvXl0rVqzQiRMnNHbsWJnNZo0YMcLZpQMAAAC3hdlsltns5uwy8H+cGpoMw9B7772n/v3768knn5QkPf/884qJidGuXbsUHx+vv/76S5999pl8fHxUq1YtnTt3TtOmTdOQIUPk5saFBAAAAOD2curseXFxcYqPj1e3bt3sli9atEiDBw9WTEyM7rvvPvn4+NjWhYaGKiUlRbGxsYVdLgAAAIA7kFNHmuLi4iRJqampGjRokA4cOKDKlSvr+eefV7t27XT69GkFBgba7VOhQgVJ0qlTp1S/fv18t+3iwmzrQEGwWOhLKFxF8ZorijWhZOOaAwqXU0NTSkqKJCkiIkLDhg3TmDFjtHHjRr3wwgtavHix0tPT5e3tbbdPqVKlJEkZGfmfv95sNsnXt3T+CwcAOI23t4ezSwCcjn4AFC6nhiZXV1dJ0qBBg9SjRw9JUp06dXTgwAEtXrxY7u7uyszMtNvnaljy9PTMd7tWq6ELF1LzvT+A/7FYzLx5o1BduJCm7Gyrs8uwQz9AYSuK/QAojry9PXI1cuvU0BQQECBJqlWrlt3ye++9V9u2bVNISIgOHTpkty4hIcFu3/zKyuIHDQAUR9nZVn6G445HPwAKl1NviL3vvvtUunRp/fbbb3bLDx06pKpVq6pJkyY6cOCA7TY+SYqOjlbp0qUVFBRU2OUCAAAAuAM5NTS5u7vrmWee0dy5c/XVV1/pxIkT+te//qXt27drwIAB6tChg8qXL68XX3xRv//+u7Zs2aKZM2dq4MCBTDcOAAAAoFA4/cNtX3jhBXl4eGjWrFk6c+aMatSooaioKDVt2lSStHDhQk2aNEn/+Mc/5OPjoyeeeEIvvPCCk6sGAAAAcKdwemiSpAEDBmjAgAHXXVetWjV9+OGHhVwRAAAAAFzBJP8AAAAA4AChCQAAAAAcIDQBAAAAgAOEJgAAAABwgNAEAAAAAA4QmgAAAADAAUITAAAAADhAaAIAAAAABwhNAAAAAOAAoQkAAAAAHCA0AQAAAIADhCYAAAAAcIDQBAAAAAAOEJoAAAAAwAFCEwAAAAA4QGgCAAAAAAcITQAAAADgAKEJAAAAABwgNAEAAACAA4QmAAAAAHCA0AQAAAAADhCaAAAAAMABQhMAAAAAOEBoAgAAAAAHCE0AAAAA4AChCQAAAAAcIDQBAAAAgAOEJgAAAABwgNAEAAAAAA4QmgAAAADAAUITAAAAADhAaAIAAAAABwhNAAAAAOAAoQkAAAAAHCA0AQAAAIADLnnd4ZVXXsn1tiaTSW+++WZemwAAAACAIiPPoen06dM6cOCAkpOTdddddykgIEBJSUk6fvy4DMNQYGCgbVuTyVSgxQIAAABAYctzaOrSpYsOHz6sZcuWqVGjRrblR48e1fPPP68nnnhCTz31VIEWCQAAAADOkudnmt5//32NGTPGLjBJ0j333KMXX3xRixYtKrDiAAAAAMDZ8hyazp8/Lx8fn+sfzGzWxYsXb7koAAAAACgq8hya6tevrzlz5igxMdFueUJCgqKiotSiRYsCKw4AAAAAnC3PzzRFRkaqX79+ateunRo2bChfX1+dO3dOu3fvlr+/v1599dXbUScAAAAAOEWeR5qCgoK0fv169e3bVykpKdq/f7/S09M1cOBArV69WhUrVrwddQIAAACAU+R5pEmSAgICFBERUdC1AAAAAECRk+eRJknKzMzUsmXLNGzYMPXp00d//PGHli9frr17995SMXFxcWrYsKFWr15tWxYbG6t+/fqpQYMGateunT7++ONbagMAAAAA8iJfs+eFhYVpypQpOn78uPbu3av09HRt27ZN4eHh2r17d74KuXz5ssaMGaPU1FTbssTERA0YMEBVq1bVqlWrNHToUM2YMUOrVq3KVxsAAAAAkFd5Dk3Tpk3TpUuX9PXXX2vNmjUyDEOSNHv2bNWrV0+zZ8/OVyFRUVHy8vKyW/bZZ5/J1dVVkydPVo0aNRQWFqann35a8+fPz1cbAAAAAJBXeQ5N3333nUaOHKlq1arJZDLZlpcqVUoDBw7Uf/7znzwX8fPPP+vTTz/V1KlT7ZbHxMQoJCRELi7/e/QqNDRUx44d09mzZ/PcDgAAAADkVZ4ngsjIyFDZsmWvu85isejy5ct5Ot6FCxf08ssva9y4cTlm3jt9+rRq1aplt6xChQqSpFOnTqlcuXJ5autaLi75epwLwN9YLPQlFK6ieM0VxZpQsnHNAYUrz6GpXr16WrZsmVq3bp1j3Zdffqn7778/T8ebOHGiGjZsqG7duuVYl56eLjc3N7tlpUqVknQlvOWX2WySr2/pfO8PAHAeb28PZ5cAOB39AChceQ5NI0eO1NNPP63u3burdevWMplM+uqrrxQVFaWffvpJCxcuzPWx1q5dq5iYGH355ZfXXe/u7q7MzEy7ZVfDkqenZ15Lt7FaDV24kHrzDQHclMVi5s0bherChTRlZ1udXYYd+gEKW1HsB0Bx5O3tkauR2zyHpsaNG2vx4sV65513tHDhQhmGoSVLlqhu3br64IMPFBoamutjrVq1SufOnVObNm3slk+YMEFff/21AgMDlZCQYLfu6tcBAQF5Ld1OVhY/aACgOMrOtvIzHHc8+gFQuPIcmnbs2KGGDRtqxYoVSk9PV3Jysry8vFS6dN5vd5sxY4bS09PtlnXs2FEjRozQo48+qnXr1mnFihXKzs6WxWKRJEVHR+vuu++Wv79/ntsDAAAAgLzK81OEw4cP16ZNmyRduX0uICAgX4FJujJaVK1aNbv/JMnf318BAQEKCwtTSkqKxo4dqyNHjmj16tVasmSJBg8enK/2AAAAACCv8hyavL295e7ufjtqycHf318LFy5UXFycevTooTlz5ujll19Wjx49CqV9AAAAAMjz7XmDBw/WG2+8obi4OAUFBV13QoYmTZrku6CDBw/afR0cHKxPP/0038cDAAAAgFuRq9CUkZFhm+p7woQJkqRZs2ZJkt0H3BqGIZPJpNjY2IKuEwAAAACcIlehqV27dpozZ44aNmyoJk2aqHfv3goMDLzdtQEAAACA0+UqNF28eNE21XdMTIz++c9/Kjg4+LYWBgAAAABFQa5CU7169TR69Gi9/fbbMgxDQ4cOlZub23W3NZlM2rJlS4EWCQAAAADOkqvQNHPmTC1ZskRJSUlas2aN6tatKz8/v9tdGwAAAAA4Xa5CU0BAgCIiIiRJO3fu1EsvvaSgoKDbWhgAAAAAFAV5nnJ869att6MO3GHMZpPMZtPNN4SN1WrIajWcXQYAAMAdJ8+hCbhVZrNJvr4eMpstzi6lWLFas5WYmEZwAgAAKGSEJhS6K6NMFsV9tUBp5045u5xiwcO/ou7u+qzMZhOhCQAAoJARmuA0aedOKe3MCWeXAQAAADhkdnYBAAAAAFCUEZoAAAAAwAFCEwAAAAA4QGgCAAAAAAcITQAAAADgAKEJAAAAABwgNAEAAACAA4QmAAAAAHCA0AQAAAAADhCaAAAAAMABQhMAAAAAOEBoAgAAAAAHCE0AAAAA4AChCQAAAAAcIDQBAAAAgAOEJgAAAABwgNAEAAAAAA4QmgAAAADAAUITAAAAADhAaAIAAAAABwhNAAAAAOAAoQkAAAAAHHBxdgHFndlsktlscnYZxYrFQlYHAABA8UFougVms0lly3oSAgAAAIASjNB0C8xmkywWs+Yu3674hGRnl1Ns1K9dSX06NXB2GQAAAECuEJoKQHxCso7FJzq7jGKjUnlvZ5cAAAAA5Br3lQEAAACAA4QmAAAAAHCA0AQAAAAADhCaAAAAAMABQhMAAAAAOEBoAgAAAAAHCE0AAAAA4AChCQAAAAAccHpoSkpK0muvvaZWrVqpUaNGevzxxxUTE2Nbv2PHDvXs2VP169dXp06dtH79eidWCwAAAOBO4/TQNGrUKO3evVszZ87UqlWrVKdOHQ0aNEhHjx7VH3/8ocGDB6tly5ZavXq1evfurZdfflk7duxwdtkAAAAA7hAuzmz8+PHj2r59u5YtW6YHHnhAkjR+/Hj9+OOP+vLLL3Xu3DnVrl1bL730kiSpRo0aOnDggBYuXKhmzZo5s3QAAAAAdwinjjT5+vpq/vz5qlevnm2ZyWSSyWTShQsXFBMTkyMchYaG6pdffpFhGIVdLgAAAIA7kFNDk7e3t1q3bi03Nzfbso0bN+r48eNq2bKlTp8+rcDAQLt9KlSooLS0NCUmJhZ2uQAAAADuQE69Pe/vfv31V73yyivq2LGj2rRpo/T0dLtAJcn2dWZm5i215eJy63nRYnH6I2G4wxTFa64o1oSSrShec0WxJpRsXHNA4SoyoWnLli0aM2aMGjVqpBkzZkiSSpUqlSMcXf3aw8Mj322ZzSb5+pbOf7GAk3h75/+6B0oK+gFAPwAKW5EITUuXLtWUKVPUqVMnvf3227bRpIoVKyohIcFu24SEBHl6eqpMmTL5bs9qNXThQuot1Sxd+SsPP7RQmC5cSFN2ttXZZdihH6Cw0Q+AotkPgOLI29sjVyO3Tg9Ny5Yt0+uvv67w8HCNHTtWJpPJtq5x48batWuX3fbR0dFq1KiRzOZbG5bOyuIHDYqf7Gwr1y7uePQDgH4AFDanhqa4uDi9+eabeuihhzR48GCdPXvWts7d3V3h4eHq0aOHZsyYoR49euj777/XN998o4ULFzqxagAAAAB3EqeGpo0bN+ry5cvavHmzNm/ebLeuR48emjp1qubNm6fp06fro48+UuXKlTV9+nQ+owkAAABAoXFqaBoyZIiGDBnicJtWrVqpVatWhVQRAAAAANhjvkoAAAAAcMDpE0EAAAAAdyqz2SSz2XTzDWHHajVktRqF1h6hCQAAAHCCK58d6iGz2eLsUoodqzVbiYlphRacCE0AAACAE1wZZbIo7qsFSjt3ytnlFBse/hV1d9dnZTabCE0AAAAoXrjVLG+ufqhq2rlTSjtzwsnVwBFCEwAAAG6Z2WxS2bKetiAAlCSEJgAAANwys9kki8Wsucu3Kz4h2dnlFAv1a1dSn04NnF0GcoHQBAAAgAITn5CsY/GJzi6jWKhU3tvZJSCXGD8FAAAAAAcITQAAAADgAKEJAAAAABwgNAEAAACAA4QmAAAAAHCA0AQAAAAADhCaAAAAAMABQhMAAAAAOEBoAgAAAAAHCE0AAAAA4AChCQAAAAAcIDQBAAAAgAOEJgAAAABwgNAEAAAAAA4QmgAAAADAAUITAAAAADhAaAIAAAAABwhNAAAAAOAAoQkAAAAAHCA0AQAAAIADhCYAAAAAcIDQBAAAAAAOEJoAAAAAwAFCEwAAAAA4QGgCAAAAAAcITQAAAADgAKEJAAAAABwgNAEAAACAA4QmAAAAAHCA0AQAAAAADhCaAAAAAMABQhMAAAAAOEBoAgAAAAAHCE0AAAAA4AChCQAAAAAcIDQBAAAAgAOEJgAAAABwoFiEJqvVqtmzZ6tly5Zq0KCBnn32Wf3555/OLgsAAADAHaBYhKZ58+Zp2bJlev3117VixQpZrVY988wzyszMdHZpAAAAAEq4Ih+aMjMz9eGHH2rEiBFq06aNgoKCNGvWLJ0+fVqbNm1ydnkAAAAASrgiH5p+//13Xbp0Sc2aNbMt8/b2Vt26dfXzzz87sTIAAAAAdwKTYRiGs4twZNOmTRo+fLh+++03ubu725aPHDlS6enp+uCDD/J8TMMwZLXe+mmbTJLZbFZySrqys623fLw7hZurRV6epXT50gUZ1mxnl1MsmMwWuZb2ltVqVVHrsfSD/KEf5B39oGShD+QP/aBkoR/kT0H2A7PZJJPJdNPtXG6tmdsvLS1NkuTm5ma3vFSpUkpOTs7XMU0mkyyWm784ueXj5X7zjZCDa2lvZ5dQ7JjNRXdwmH6QP/SDvKMflCz0gfyhH5Qs9IP8Kcx+UHR73P+5Orr090kfMjIy5OHh4YySAAAAANxBinxoqlixoiQpISHBbnlCQoICAgKcURIAAACAO0iRD01BQUHy8vLSzp07bcsuXLigAwcOqEmTJk6sDAAAAMCdoMg/0+Tm5qZ+/fppxowZ8vPz01133aXp06crMDBQHTt2dHZ5AAAAAEq4Ih+aJGnEiBHKysrSuHHjlJ6eriZNmmjRokVydXV1dmkAAAAASrgiP+U4AAAAADhTkX+mCQAAAACcidAEAAAAAA4QmgAAAADAAUITAAAAADhAaAIAAAAABwhNAAAAAOAAoQkAAAAAHCA04bYJDw+3/bt27dpOrARwrtmzZysmJqbAj7t8+XItX7483+tRdBXkNRMZGanVq1fnWL569WpFRkYWSBu4vu7duzu7BBQx/D5UfLk4uwCUXLt27XJ2CUCR8PPPP6tp06YFftzHH3/8ltaj6Lpd1wwK17p165xdAoACQmhCgXj//ff1xRdfyGKx6MEHH1RaWpokqWfPnra/cE6aNEm7d+9WRkaG3n77bQUHB+vEiROaOHGiEhMT5ebmpoiICDVq1EiRkZFKTEzUiRMnNHLkSHXq1MmZp4dibubMmdq4caMsFou6d++ujh076rXXXlNSUpI8PT01duxYBQcHKzIyUu7u7tqzZ4+SkpL00ksvacuWLYqNjVXbtm01duxYrV69Whs3blRKSooSEhLUunVrjR07VvHx8erfv7+2bt0q6cpf8Xft2qUmTZpo//79GjdunGbPnq3SpUvn+ZqfOnWq/Pz89Nxzz0mSIiIiFBISor/++kuSNHToUFv/slgsateunYYPH66oqChJ0vDhw/Xdd9/p3XffldVqVZUqVTR58mSVK1dO7dq1U/fu3bV9+3YlJSVp/PjxatmyZSF/h0q+nTt36l//+pfKlCmjP/74Q4GBgZo5c6a++uorrV27Vunp6ZKuXKv79u2zu2befPNNDRs2zBaiateurYMHDyoqKkp79uzR6dOn1bt3b9WtW1czZ85URkaGkpOTNXr0aD3yyCO5qm/Dhg1avHix0tPTlZ6ersmTJys0NFTh4eGqX7++YmJilJCQoOHDh6tHjx5KSUnRq6++qsOHD6t8+fIymUx64YUXJElz5szRv//9b0myuwaXLl2a41xr1aqlmJgYTZ48WWazWY0bN9b333+vzZs36/z583rttdds1/mwYcPUrl27HLWHh4fr7rvv1v79+5WWlqbIyEi1bt06x+vTunXr6/b7U6dO6ZVXXtHZs2fl5uamiRMnKjg4WOvWrdNHH32k7Oxs3XvvvZo0aZI8PT2v29f27NmjN954Q4ZhqFSpUnrjjTd0zz332H2vzpw5oxMnTig+Pt5WiyS99957Wr9+vcqUKaMaNWqoSpUqGj58eH4vNTjRzp07NXfuXLm4uOjYsWNq2bKlAgICtGXLFlmtVs2fP9+2bVpamsaNG6eDBw/KZDJp0KBBeuyxx274HpORkaGXX35ZJ06ckMlkUp8+fdS3b18nnu0dyABu0bZt24ywsDAjNTXVuHz5sjFkyBBj6dKlRq1atWzb1KpVy1i/fr1hGIbx0UcfGcOHDzcMwzD69u1r7N271zAMwzh+/LjRtm1b4/Lly0ZERIQxevTowj8ZlDgbN240+vTpY6Snpxvp6elGr169jCZNmhhff/21YRiGsXv3bqNNmzZGRkaGERERYQwZMsQwDMNYvXq18cADDxhnz541Ll68aDRs2NBITk42Vq1aZYSGhhoJCQlGRkaG0adPH+Prr782/vzzT6Nt27a2dletWmVEREQYhmEY/fr1M6Kjow3DyN81Hxsbazz66KOGYRhGenq60bx5c+PixYvG7NmzjdmzZxuxsbFGjx49bOtHjRplpKam2tafPXvWePDBB40TJ04YhmEYCxYssPXBtm3bGosWLTIMwzA2bdpkOw4KVnR0tNGgQQMjPj7eMAzDGDJkiLFkyRIjPDzcSE1NNQzDMN577z1j8uTJhmHYXzPX/tswDNvP1tmzZxuPP/64bfnw4cONQ4cOGYZhGDt27DC6du1qGIZhREREGKtWrcpR09VrNDs72wgPDzfOnj1rGIZhfP7558bgwYNtbV+t6T//+Y8REhJiGIZhTJ061XjjjTcMwzCMEydOGA0aNDCio6ON6Ohoo1+/frY2rl6DFy9evO65ZmZmGq1atbL1iQULFtj60ahRo4yNGzcahmEY586dMzp06GCr8Vr9+vUzXn75ZcNqtRoHDhwwQkNDjYyMjByvT1hY2HX7/eDBg40lS5YYhmEYO3fuNAYNGmQcOXLE6Nu3r5GWlmYYhmHMmzfPmDp16g372gsvvGB8++23hmEYxvr1643Vq1fn+F717NnTyMjIMFJSUowWLVoYv//+u7F161ajd+/eRlpampGammr07NnTmD17do5zRPFwbT9PTU01GjRoYCxfvtwwDMOIjIw0lixZYrsm3n77bWPSpEmGYVy5vtu1a2fExsbe8D1m8+bNxrBhwwzDMIzz588bY8aMcc5J3sEYacIti46OVteuXeXh4SFJCgsL09q1a3Ns17FjR0lSrVq1tHnzZl26dEn79u3TuHHjbNtkZWXp1KlTkqSGDRve/uJR4u3cuVOdO3dWqVKlJElLlixRmzZt1LlzZ0lSgwYN5OPjo6NHj0qS2rRpI0mqVKmSatasKX9/f0lS2bJldeHCBUlS27ZtVb58eUlSly5d9PPPP6tevXo3rSW/13xQUJAk6Y8//tChQ4cUGhoqLy8v2/qqVasqMzNTTz75pFq3bq2XXnrJ1h8lae/evQoODlaVKlUkSX369LH7i2fr1q1t7SQlJd30PJA/NWvWVKVKlSRJderU0cWLFzVr1ix9/fXXOnbsmH788UfVqVMnT8ds0KCB7d/Tp0/Xd999p02bNum3337TpUuXcnUMs9msefPmaevWrYqLi9OuXbtkNv/vkeer10edOnVs18dPP/2k6dOnS5KqVKmi5s2bO2zDy8vruud66NAh+fn52fpPnz59tGzZMlsbhw8f1ty5cyVd6St//PGHrU9eq3fv3jKZTKpTp44CAwN18OBBu9fn0qVLOn78+HX7/c6dO23nEhISopCQEC1dulTHjx9Xnz59bG1XqVLlhn2tXbt2GjdunNq2bau2bdvq4YcfzlFjs2bN5ObmJjc3N1WrVk3Jycnavn27unbtKnd3d0nSo48+avs5g+Kpdu3atn7u6+urZs2aSbrynnLt9zY6OlpTpkyRJPn5+al9+/batWuXvLy8rvseM3jwYE2ZMkWDBg1S69atFRERUchnBkITbpnVas2xLCsrK8cyF5crl5vJZLLt5+bmZnfP95kzZ2w/KK79pQ/IL4vFYrvmJCk5OTnHNoZh2K5ZV1dX2/Kr1+zfXbvcarXKbDbLZDLJMAzb8suXL+fYL7fX/LXB6v7779eUKVPUvXt3bdiwQQcPHlSvXr3sjuvp6am1a9dq586d+umnn9S3b1/b7VFX2/37+V5b39VAee3rhIJ39XWWrrzWf/31l3r37q3w8HC1atVK5cqVU2xs7HX3vXptZWZm2i2/9ufkE088oZCQEIWGhqpZs2YaM2aM3bbLly/XihUrJEl9+/a11XPp0iWFhYXp0UcfVZMmTVS7dm198sknOeq+9vqwWCx21/u15/X3fuDq6qpTp07pySefzHGuFovluu8h0pXr9uOPP1bZsmUlSQkJCfLz89Ozzz6rhIQESbKFf4vFYrff1a+vvj7Xq/Vqv3dxcbE7t8OHDys7O1tdunSx9cPU1FRlZmbesK+FhYWpWbNm2rZtm5YsWaJt27bpjTfesGvv799/wzBkNptveP4onq59D5Hsr81r/f2avPZ96HrvMQEBAdqwYYO2b9+uH3/8UT169ND69evl7e1dwGeAG2H2PNyy0NBQffXVV0pLS1NWVpZWrVqlJk2ayGKxXDc8XVWmTBlVr17d9gtkTEyMevbs6XAfIK9CQkK0efNmZWZmKjMzU0OGDNGlS5e0YcMGSdKePXuUkJCgWrVq5fqYP/74oy5cuKCMjAytX79eLVq0kI+Pj5KSkpSQkKDs7Gxt2rTJtr3FYlF2dnaur/l69epp3bp1Wrdune0vkd26ddPGjRsVGxurFi1a2G0fExOjZ599VqGhoYqIiFCNGjUUFxdnW1+/fn3t3btXf/75pyTp008/VUhISB5eRdwO+/btU/Xq1TVgwADVr19fP/zwg7KzsyX975qRrvy1+vfff5ckffPNN9c9VlJSko4dO6YXX3xRrVu31vbt2237X/X444/brqtrJwk5duyYTCaTnn/+eYWGhtrVcSMPPvig1qxZI0k6ffq0du7cKZPJJF9fXx07dkxpaWlKS0vTtm3bHJ7rPffco4sXL+o///mPJNndpRAaGmobdTp27Ji6du2q5ORkLViwwHYeAQEBkqT169fb2klKSsrRn728vFSlSpXr9vuQkBDb/rt379aoUaPUtGlTbd68WWfPnpUkvfXWW5o3b94N+9qzzz6ruLg4PfHEExo5cqQOHDjg8PW79nXcsGGDMjIylJmZqQ0bNvDHiztEaGioVq5cKUk6f/68tmzZosaNG0u6/nvMl19+qYkTJ6p9+/YaN26cPD09bXcpoHAw0oRb1rZtW8XGxqpXr17KyspS8+bN1b9/f+3du1ePPvqoPv/88xvuO336dE2cOFELFy6UxWLRe++9Jzc3t0KsHiVdhw4ddODAAYWFhclqtSosLEytW7fWxIkTNW/ePLm6uioqKipP11358uU1ePBgnT9/Xl27drXd0jdkyBD17dtX5cqVU+PGjXX+/HlJV275mzBhgt566618X/Ply5dXQECAatSokeMvlw888IDuuece220+devWVatWrWy/iJYrV06TJ0/WsGHDlJWVpcDAQL355pu5Pl/cHi1atNDvv/+uLl26yM3NTcHBwTp06JAk+2tm8ODBioiI0Jo1a9SsWTPbyOS1ypYtq969e+uRRx6Rl5eX6tevr/T09FzdohcUFKS6deuqc+fOcnd3V5MmTRQfH3/d0Zmrnn/+eY0fP17dunVT+fLlValSJbm7u6tmzZrq2LGjunbtqoCAAD3wwAOSroSD5cuX5zhXNzc3zZw5U+PHj5dhGAoKCrLdqjZu3DhNmDBB3bp1k2EYmjJlynVvzZOujNj26NFDVqtVM2fOvO4o8dW+9/d+P378eI0bN07Lli2Tm5ub3n77bQUFBWnYsGEaMGCArFaratSoocjISHl6el63r/n7+2vSpEmaMWOGXFxccj2Ve+vWrbVv3z716NFDpUuXlq+vr92IFEquoUOHauLEieratauys7P13HPPKTg4WEeOHLnue0xGRoa+/fZbPfLII3J1ddXDDz/M9OWFzGQ4+qkIALBzdVa8qVOnOrsUwGm++OILBQYGKiQkRCkpKerZs6dWrlwpHx+fPB3HMAxNmzZNQ4cOlZeXl7Zs2aIvvvhCs2fPzvUxwsPD7WYXLE5+++03HTp0SL1795ZhGBoxYoTCwsJsf4jBnYf3mKKLkSYAAJAn99xzjyZMmGC7jW/kyJF5DkzSlWd7/P399Y9//EOurq7y9/fX66+/XtDlFlnVq1fX3Llz9fHHH0u6MsJIYAKKJkaaAAAAAMABJoIAAAAAAAcITQAAAADgAKEJAAAAABwgNAEAShwe1wUAFCRCEwCgRPn2228VERHh7DIAACUIU44DAEqUJUuWOLsEAEAJw0gTAAAAADjA5zQBAEqM8PBw7dq1y/b1xx9/LB8fH82ZM0cxMTG6ePGi/Pz89PDDD2vMmDFyd3eXJKWkpGjatGnavHmz0tPT1aZNG9WvX19vvfWWDh486KzTAQAUEYQmAECJceTIEf3zn/+UJE2YMEHly5fXo48+qgYNGig8PFxubm764YcftHjxYo0ePVrPPfecJKl///6KjY3VSy+9pEqVKmnZsmXasWOHMjMzCU0AAJ5pAgCUHPfee6+8vLwkSQ0aNNBPP/2kOnXq6L333rMtb968ubZv366dO3fqueee044dO7Rz505FRUWpY8eOkqRWrVqpa9eu+uOPP5x2LgCAooPQBAAosVq0aKEWLVro8uXLOnLkiI4fP65Dhw7p/PnzKlu2rCQpOjparq6u6tChg20/s9msLl26KCoqykmVAwCKEkITAKDEslqtmjlzpj755BOlpqaqYsWKCg4OVqlSpWzbJCYmqmzZsjKb7edG8vf3L+xyAQBFFKEJAFBizZ8/X0uWLNGkSZPUsWNHlSlTRpLUq1cv2zYBAQFKTEyU1Wq1C07nzp0r9HoBAEUTU44DAEqUa4PPL7/8onvvvVdhYWG2wHTmzBkdOnRIVqtVkhQSEqKsrCxt3brVtp9hGNqyZUvhFg4AKLIYaQIAlCje3t7avXu3duzYoWrVqumnn37S/Pnz1aBBAx0/flwffPCBMjMzlZaWJklq0qSJHnzwQY0dO1Znz55VpUqV9Pnnn+vgwYMymUxOPhsAQFHAlOMAgBIlOjpar7zyiv773//q9ddf1759+7Rp0yZdvHhRFStW1COPPCKTyaQPPvhA27dvl7e3t5KTkzV16lRt2bJFWVlZat++vby9vbV27Vr9+uuvzj4lAICTEZoAAHe0+Ph47dmzR+3bt7d92K0kjRgxQn/++afWrFnjxOoAAEUBt+cBAO5oZrNZkZGRat++vXr16iWLxaIff/xRmzZt0ltvveXs8gAARQAjTQCAO150dLTmzp2r2NhYZWVlqUaNGhowYIC6du3q7NIAAEUAoQkAAAAAHGDKcQAAAABwgNAEAAAAAA4QmgAAAADAAUITAAAAADhAaAIAAAAABwhNAAAAAOAAoQkAAAAAHCA0AQAAAIADhCYAAAAAcOD/A9Es/zlA6gXfAAAAAElFTkSuQmCC\",\n      \"text/plain\": [\n       \"<Figure size 1000x300 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Few-shot with GPT 4\\n\",\n    \"method = \\\"few_shot\\\"\\n\",\n    \"model = \\\"gpt-4-0613\\\"\\n\",\n    \"y_pred[method][model], performance[method][model] = evaluate(\\n\",\n    \"    test_df=test_df, model=model, system_content=system_content,\\n\",\n    \"    assistant_content=assistant_content, tags=tags)\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"61521970\",\n   \"metadata\": {},\n   \"source\": [\n    \"As we can see, few shot learning performs better than it's respective zero shot counter part. GPT 4 has had considerable improvements in reducing hallucinations but for our supervised task this comes at an expense of high precision but lower recall and f1 scores. When GPT 4 is not confident, it would rather predict `other`.\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"e04b53bf\",\n   \"metadata\": {},\n   \"source\": [\n    \"## OSS LLMs\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"c6c72add\",\n   \"metadata\": {},\n   \"source\": [\n    \"So far, we've only been using closed-source models from OpenAI. While these are *currently* the gold-standard, there are many open-source models that are rapidly catching up ([Falcon 40B](https://huggingface.co/tiiuae/falcon-40b), [Llama 2](https://ai.meta.com/llama/), etc.). Before we see how these models perform on our task, let's first consider a few reasons why we should care about open-source models.\\n\",\n    \"\\n\",\n    \"- **data ownership**: you can serve your models and pass data to your models, without having to share it with a third-party API endpoint.\\n\",\n    \"- **fine-tune**: with access to our model's weights, we can actually fine-tune them, as opposed to experimenting with fickle prompting strategies.\\n\",\n    \"- **optimization**: we have full freedom to optimize our deployed models for inference (ex. quantization, pruning, etc.) to reduce costs.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"15ea136e\",\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"# Coming soon in August!\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"3724d63b-58f8-4374-a89d-275a83c8190e\",\n   \"metadata\": {},\n   \"source\": [\n    \"## Results\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"ec0b498a-97c1-488c-a6b9-dc63a8a9df4d\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"zero_shot\\\": {\\n\",\n      \"    \\\"gpt-3.5-turbo-0613\\\": {\\n\",\n      \"      \\\"precision\\\": 0.7919133278407181,\\n\",\n      \"      \\\"recall\\\": 0.806282722513089,\\n\",\n      \"      \\\"f1\\\": 0.7807530967691199\\n\",\n      \"    },\\n\",\n      \"    \\\"gpt-4-0613\\\": {\\n\",\n      \"      \\\"precision\\\": 0.9314722577069027,\\n\",\n      \"      \\\"recall\\\": 0.9267015706806283,\\n\",\n      \"      \\\"f1\\\": 0.9271956481845013\\n\",\n      \"    }\\n\",\n      \"  },\\n\",\n      \"  \\\"few_shot\\\": {\\n\",\n      \"    \\\"gpt-3.5-turbo-0613\\\": {\\n\",\n      \"      \\\"precision\\\": 0.8435247936255214,\\n\",\n      \"      \\\"recall\\\": 0.8586387434554974,\\n\",\n      \"      \\\"f1\\\": 0.8447984162323493\\n\",\n      \"    },\\n\",\n      \"    \\\"gpt-4-0613\\\": {\\n\",\n      \"      \\\"precision\\\": 0.9407759040163695,\\n\",\n      \"      \\\"recall\\\": 0.9267015706806283,\\n\",\n      \"      \\\"f1\\\": 0.9302632275594479\\n\",\n      \"    }\\n\",\n      \"  }\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"print(json.dumps(performance, indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"4cc80311\",\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"# Transform data into a new dictionary with four keys\\n\",\n    \"by_model_and_context = {}\\n\",\n    \"for context_type, models_data in performance.items():\\n\",\n    \"    for model, metrics in models_data.items():\\n\",\n    \"        key = f\\\"{model}_{context_type}\\\"\\n\",\n    \"        by_model_and_context[key] = metrics\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"id\": \"6771b1d2\",\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAA9gAAAGACAYAAABWaMrCAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAABmJ0lEQVR4nO3dd3gU1f/28Xt304EQAkLoHUJVpCsgIL1IR1RAUJp0pCs/eu+9CYiAgtKlRLGAIlJUUERAFOktICWU1N15/sjDflmTQAiTyvt1XVxkZ87OfmZ2z87eO7NnLIZhGAIAAAAAAE/EmtwFAAAAAACQFhCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATuCV3AQCAlO/kyZP65JNP9MMPP+jy5ctyc3NT4cKF9corr6h169Zyc/vf7qRmzZq6cOGCy/09PDwUEBCgevXqqWfPnvL09NSQIUO0cePGhz5uhQoVtHLlyhjT9+/fr/bt27tMc3d3V7Zs2VS3bl316tVL3t7eT7DGCTNnzhzNnTtXf/75Z5I/9sNs2LBBQ4cO1TfffKNcuXIldzkAAKRZBGwAwENt375dQ4cOVcGCBdWxY0flz59fYWFh+u677zR+/Hjt3r1b8+fPl8Vicd7npZdeUvfu3Z23w8PDtX//fs2fP18XLlzQ9OnT1b17d7Vp08bZZv78+Tp69Kjmzp3rnJY+ffqH1jZ8+HCVKFFCkhQaGqrjx49r9uzZunr1qqZMmWLWJgAAAIgXAjYAIE4nT57U0KFDVbVqVc2cOdPlSPVLL72kihUrqnfv3goKClKDBg2c8/z9/fXcc8+5LKtixYq6fPmyNmzYoCFDhihPnjzKkyePy308PDxi3O9hChUq5NK+cuXKun37thYsWKARI0Y8MqADAACYid9gAwDitGTJElmtVo0aNcolXN9Xt25dNW3aNN7LK1mypAzD0KVLl0ys0pWvr2+MaTdv3tTw4cP1wgsvqFSpUmrdurX27t3r0qZo0aL6+OOP9f7776tChQoqU6aM+vTpo2vXrrm027Rpk5o1a6Znn31W1atX17Rp0xQREeHSZteuXXrllVdUqlQp1a1bV5s2bXLO279/v4oWLaq9e/eqXbt2Kl26tKpXr661a9cqODhYPXv2VJkyZfTSSy9p+fLlLss9fvy4evbsqUqVKqlEiRKqWrWqxo4dq7CwMJf1mDt3rpo3b67SpUu7nBFwX0hIiJo0aaKaNWvq4sWLkqQ9e/aodevWKlOmjMqXL6933nlHJ0+ejNc2BwAA0QjYAIA4ffPNN6pUqZIyZ84cZ5tJkya5HL1+mFOnTkmScufObUp9DodDUVFRioqKUmhoqA4ePKgVK1aoadOmzqPX4eHhevPNN/XNN9+oX79+mjt3rgICAtSpU6cYIXvGjBlyOByaPn26Bg0apJ07d2r8+PHO+R9//LEGDx6sEiVKaO7cuerSpYtWrlypsWPHuixn+PDh6tChgxYsWKCAgAANGTJEx48fd2nz7rvvqmbNmlq0aJHy58+vESNGqH379ipcuLDmz5+v0qVLa8KECTp8+LAkKTg4WG+88YZCQ0M1ceJEffDBB2rYsKFWrlypFStWuCx74cKFaty4sWbPnq26deu6zLt79646d+6skJAQrVixQjly5NC5c+fUvXt3lSxZUgsWLNC4ceN06tQpdenSRQ6H48meJAAAniKcIg4AiNWtW7d069Yt5cuXL8a8qKgol9sWi0U2m8152zAMlzb//vuvvv/+e61Zs0YNGjSQv7+/KTV26NAhxrRcuXKpb9++ztubN2/W8ePH9dlnn+nZZ5+VJFWrVk3t2rXT1KlTtX79emfbIkWKaMKECc7bhw8f1hdffCEpOszPmzdPtWrVcgnUoaGh2rZtmyIjI53Txo4dq2rVqkmS8uTJo9q1a+vAgQMKDAx0tmnRooU6duwoSfLx8VHr1q1VunRp9enTR5IUGBioHTt26ODBgypdurROnDihYsWKadasWc4vD1544QXt2bNH+/fvV5cuXZzLLleunHPZkvT7779Liv6y4Z133tGVK1e0cuVK54Bnhw8fVlhYmLp27aps2bJJkgICAvTNN9/o3r17nGoPAEA8EbABALGK68jlmTNnVKdOHZdpOXPm1Lfffuu8vWnTJpfToiXJzc1NtWvX1ogRI0yrcdSoUc5BziIiInTu3DktXrxYLVu21KeffqocOXJo7969euaZZ1SiRAmX0F+jRg1NnjxZt27dUsaMGSUpxu+/AwICFBoaKin66Pu///6r2rVru7R5++239fbbb7tMK1eunPPv+yE2JCTEpU2ZMmWcf98/Q+D+FwCSlClTJknS7du3JUlVqlRRlSpVFBkZqb///ltnzpzRiRMndP36dfn5+bksu1ixYrFur0GDBunIkSMaP368y1kEzz77rDw9PdWyZUvVq1dP1apVU8WKFVW6dOlYlwMAAGJHwAYAxCpTpkzy8fGJccmt7Nmza926dc7b8+bN04kTJ1za1KhRQz169JAUfXTb29tbOXPmlJeXl6k15s+fX6VKlXLeLlu2rCpUqKBatWpp2bJlGjZsmG7evKmrV686g/h/Xb161Rmw/3tpL6vVKsMwJEX/jlvSQ0+Xv8/Hx8dlGZKcy7kvtqPCD7u02P1T1z/++GPdu3dP2bNnV+nSpeXp6fnQx3/QlStXVKJECc2bN0/16tVTunTpJEV/CbBq1SotXrxY69at04oVK+Tr66vXX39dffv2dRkhHgAAxI2ADQCIU82aNbVz507duXPHGQg9PDxcQu1/j57en/Zgm6SUI0cO+fv76/Tp05KkDBkyKF++fJo6dWqs7eN7Xej7g6ddv37dZfqNGzd09OhRlyPSiWHx4sVavny5Ro0apTp16ihDhgySpJYtW8Z7GXPnzpW3t7eaN2+uGTNmaNiwYc559wdEi4iI0C+//KJPP/1UCxcuVGBgoOrXr2/6+gAAkBYxyBkAIE5dunRRVFSUhg0bFmOkbEkKCwvTuXPnkqGyuJ0/f17Xr193/na8QoUKunTpkjJnzqxSpUo5/+3Zs0dLlixx+e34wxQoUECZMmXSzp07XaZv3rxZXbp0cfkNdmL45ZdfVKhQIbVo0cIZrq9cuaITJ07EeyCyLFmyqGjRourQoYM+/vhj/fbbb5Kk5cuXq0aNGoqIiJCHh4cqV66sMWPGSJJzlHEAAPBoHMEGAMSpaNGimjJlioYOHarmzZurZcuWKlq0qKKionTo0CGtW7dO165dU6dOnZKlvr///tt5irRhGLp48aLmzZsnT09PtW3bVpLUvHlzrVq1Sh07dlS3bt2UPXt2/fjjj/rggw/Utm1bubu7x+uxbDabevXqpdGjRytz5syqWbOmTp06pdmzZ+uNN95wnmaeWEqXLq358+dr8eLFeu6553TmzBktWrRIERERzt+Jx1fPnj0VFBSkYcOGacOGDapUqZKmTp2qHj16qG3btrLZbFqzZo08PDxUo0aNRFojAADSHgI2AOCh6tatq5IlS2r16tVat26dLly4IMMwlDt3bjVo0EBt2rSJdaTxpDB69Gjn31arVX5+fnruuec0ZcoUZ00+Pj76+OOPNW3aNE2ZMkW3b99Wzpw51b9/f7311luP9XhvvPGGfHx8tHTpUn366acKCAhQ586d1blzZzNXK1Zdu3bVjRs3tGLFCs2bN0/Zs2dXkyZNZLFYtGjRIoWEhMR6DfDYeHt7a/jw4eratasWL16sHj16aOHChZo3b57effdd2e12lSxZUsuWLVOBAgUSec0AAEg7LMZ/R10BAAAAAACPjd9gAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgArfkLiAlMAxDDgeXA08OVquFbQ/Egr4BxES/AGKiXyQPq9Uii8WS3GUgBSJgS3I4DF2/fje5y3jquLlZlSlTOoWE3FNUlCO5ywFSDPoGEBP9AoiJfpF8/P3TyWYjYCMmThEHAAAAAMAEBGwAAAAAAExAwAYAAECa98cfR9Sx4+uqVauKunfvpAsXzsdoc+/eXY0fP0oNGrysFi0aaePGdTHaGIahnj27aOnSRTHmXbx4QfXqVU+M8gGkEgRsAAAApGnh4eF6770Bev319goK2qny5Stq+PChMdrNmTNTly5d1Jo1GzRnziKtXr1S33+/y6XN2rWrdfjwrzHue+TI7+rVq6vu3LmTSGsBIDUgYAMAACBNO3jwZ/n6+qp27Xpyd3dX+/Zv6cKF8zp16h+Xdrt371Lnzu/I1zejcuTIqaZNWygoaKtz/tmzZ/T55xtVrVp1l/sdOLBPI0e+pzfeeDPxVwZAisYo4gBStT/+OKKpU8fr3LmzKlIkUO+/P1I5c+ZyaXPv3l3NnDlVP/zwvby9vdW2bQc1a9ZSkhQcfEWTJ4/TkSOH5eXlrebNW6l9+7dc7n/x4gW99dYb+uKLXUm1WgAAE509e1p58+Zz3rbZbMqZM5fOnj2t/PkLOKc7HA55eXk5b1utVl28GH0qud1u1/jxo9S370B9+eV2l+UXLRqo1as36Nq1q4m7IskkMfe14eFhmjhxrPbu/UE+PunUufM7ql+/UZKvY2Ky2+2KjIxM7jKQQO7u7rLZbPFuT8AGkGrdP+WvZ8++ql79Za1atVzDhw/V0qUrXdo9eMrfnTt31Ldvd2XOnEXVqlXXuHGjVLRoUU2cOF3Xr/+rLl06qHjxkipXroKk6FP+RowYmqBT/hL6gaRVq9aSoj+QTJo0XocP/yYvLy81adJcHTp00uXLl9WuXasY26JhwyYaPPj9RK/vwQ9M06ZNTLT6AMAsoaGh8vT0cpnm5eWlsLAwl2kvvFBFS5cu0rBho3X7doi2bv1cUVFRkqTVq1eqYMFCKleuQoyAnTGj3xPXmJD35PbtO6pTpw6SEu89ObH3tYsWzVNYWKg2bfpCp0//o/79e6lQoSIqXLjIk23QFMAwDF26dEk3b96UwaXKUy2LRfLz81P27Nnjde1zAjaAVOvBU/4kqX37t/Tpp5/o1Kl/XI5I7N69S+PHT5Gvb0b5+mZ0nvJXrVp1TZkyU1arVW5ubrp165YcDofSp08vKfqUv8mTx+mNN97U9OmTHqu2J/lAkjXrM2ratJHGjh2lPHnyaezYybp27ar69u2uHDlyqU6devrqq93OZRw/flRDhvTXm2++nST13f/ANGHCaOXNmz9R6gMAM3l5eSk8PNxlWlhYmLy9fVym9e7dX9OmTdRrrzVTjhy5VL9+Q+3c+Y3++eektm37PMZ7pFkS+p7cr18P5cuXS2XLVk609+TE3td+9dWXmjJlpry8vBQYWFy1atXVV18FpYmAfenSJd24cVMZMvjJ09NTEtfNTn0MhYeH68aNm5KkHDlyPPIeBGwAqZYZp/x5eHhIkjp3bq9jx46qYcNXFBhYXNKTnfL3JB9Itm/fqldeaSAPDw+1b99R7u7uyp49h6pUeUl//HFYderUc94/KipK48aNVPfuvRUQEJAk9QUFbVWVKtUStT4AMFPevPkUFLTNedtut+vChXPKkyevS7sbN65r4MD3nOFv0aJ5KlSosHbv3qVr166qefOGkqLDudVq1Z9/HtPkyTOfuL6Evic3a9ZCGzduVJkyFRPtPTkx97UhISG6ceO68uT53/Lz5MmrAwf2xXfTpVh2u103b0aH6wwZMiZ3OXgCHh7Rr+ubN28qW7ZsjzxdnEHOAKRaj3vK3+3bt3Xx4gVt3fq5wsMjXNrMnfuBVq/eoIMHf9GmTeslRZ/y5+7unqDaHvaB5EGxfSA5f/6crFarpk6dKX//zJKiPxT99NM+FShQyOX+27Z9Lh+fdKpTp36S1Xfx4nlZrVZNmjQj0eoDADM9/3w53bhxXUFBWxUZGakVK5YpR45cypcvv0u7FSuWavHiebLb7Tp27A9t2bJRjRo11Ztvvq2vvtqtL77YpS++2KXatevpjTfeNCVcS0/ynmzT2bNnE/U9OTH3tWFhoc7l3efp6aWwMNezDVKjyMhIGYb+/5FrpHaenp4yDMXrt/QEbACp1uOc8ufl5a3XXmumkSPfV/36DZ1HJ+7z9PRU7tx51Lx5K/344w9PXNuTfCCJiHD9QGK32zVu3Ei5u3u4DPxiGIbWrFmldu06JGl9//3AlBj1AYCZPD29NHnyTK1f/5kaNHhZP/20X2PGTJQktW3bWjt2BEmSunfvo/Pnz6l+/ZoaNWqY+vYdqJIlSyV6fQl9T96yZVOi7zMSc197P1g/uPzw8DD5+Hg/Vo0pG6eFpw3xfx45RRxAqvWkp/wZhqGOHd/QsGGjVKhQYUlSZGSEMmRw/UCQEE/ye79du75xzg8NDdXw4UN0/fp1TZs2x3manSQdPfqH7t69q8qVqyRpfTt3Jn59AGC2wMBiWrJkRYzpq1Z95vw7c+Ysmj597iOX9f77I2Odnj17Dv3ww8+PXVtC35MbNGik77771jk/Md6TE3Nf6+ubUX5+mXTu3BkVKRIoKfpSaLlzuy47rbFYLLJakz54OxyGDEZbS3QcwQaQaj3pKX8Wi0UFCxbSsmWLFR4eplOn/tHGjetUp06DJ64tb958OnfurPP2oz6QbN36tRYvXq47d+6oUKHogV1CQkLUs2cXWSxWzZ27WH5+fi733bdvj6pUqfZYl44wp77CiV4fADxNEv6efFuBgdHBNLHekxN7X1urVh0tXbpI9+7d1fHjx/TVV1+qdu26j1VjamKxWJQhg5d8fb2T/F+GDF7xGgU7Jfjll59VqdLzunjx4iPbXrx4UZUqPa9ffnn8L7cSA0ewAaRa90/5mzp1gqZPn6zChYu4nPLXvn1H1alTX92799G4cSNVv35N+fv7u5zy17fvQE2fPknNmjVUhgwZ1KlTN1WsWPmJa3vwA0mtWnW1atXyOD+QpEuXXn36DNCJE8e1ZctGTZ06U5I0bNgQZcsWoDFjJsb6gejo0T9Us2atJK9v4sQZkqQRI4YmWn0AkFBWa/IcHYwvh8OQw+F6FDGh78mbN2/UokWLJCXee3Ji72u7du2pGTMmq1WrV+Tp6aVevfqpcOGij11namG1WmSzWTX14190/srtJHvcXNkyaMAbZWW1WmS3p/yj2KVLP6tt23bIzy/TI9tmy5ZN27btkK9vyhhMzmJwnoDsdoeuX7+b3GU8ddzcrMqUKZ1u3LirqChHcpcDmO748WOaOnWCzpw5rcKFizivafrgB5J//72mceNG6siR3+Xv769OnbqpXr36unr1gho3biwPD0/ZbP872ahOnfoaOPA9SVLbtq3Us2c/Var0QpLWV6tWXf3zz99q375NotYHPIh9BuLDarXIz8/H5X0ppbHbHbp5816MkJ2Q9+SuXburdevm+vnn3/TGG615T05C/v7pHvo6CwsL08mT/yhLlgB5ePxvoDObzSpfX2/1nb5LJy/cSopSJUkFc2bUzHerKyQkVHY776GPKyIiXNeuXVbBggVcBuWLDQFbBOzkwoclIHb0DSAm+gXi4/7rJKmPDsbX/aOIZr2O6RfJ52kK2JUqPa8BAwYrKGib/vrrhHLnzqOuXXuoWrWXJEkffLBQBw/+rMyZs+jHH/eoQYNGGjBgsA4f/k3z58/WsWNH5eeXSVWqVFX37r2ULl307/SjoiK1bNkSbd++RTdu3FT+/Pn1zju9VLFiJf3yy8/q0aOLNmzYqhw5cuiPP45o9uzpOnHiT7m5uals2fLq27e/AgKy6+LFi2revJHmzVussmXLyW6367PPVmvjxvW6fPmSAgKyq02bN9S8eUtJ0aef9+79jqZMmaG5c2fp3LmzypEjp3r06K1q1arHug0eJ2BzijiAVCE1nvIHAEge56/cTtLwkpak5P0t+9rkM3/+HHXv3kvDh4/W1q2fa8iQ/lq4cKlKl35WknTo0EG9+uprWrlytex2h/7664R69XpHHTu+rffeG6Hr1//VnDkz1Lt3dy1Z8pEsFoumT5+qnTu/1sCBQ1WkSFFt2bJZAwf21cqVa1we2263a8CAPmrSpLlGjBijkJAQTZo0TmPHjtLcuQtj1Dp79nQFBW1T//6DVaxYCe3du0czZkxRRES42rR5w7nMuXNn6d13Bypr1gAtWDBHo0YN15YtX8jHxyfGMh8HARtAipdaTvm7fTvMlNE5769nSl5fM/GBCcDTxqz3d7P3FxaLRRl8PWWzpszBKe0Ou27eCGWfkQwaNGisli1flST16NFbBw/+rLVr1zgDtiR17txN6dNnkCSNHDlMFStWUocOb0uS8uTJozFjJqh588Y6ePAXBQYW05Ytm9S//yDn2ADvvNNTkqG7d13PLL57965u3rypLFmeUUBAduXIkVNjx07UjRvXY9R59+4drV+/Vn36vKu6des7H/vSpQv66KMP9eqrrzvbdu3aXeXKVZAkvfVWZ+3c+Y1OnvxLpUo9G2O5j4OADSDFS64BQeKrWH5/dWlSUn5+T/aN53/5+ppzHVCHwyGrNeWGdT4wAXha+GXwlOFwmPb+fp/Zy5u9b5kuhFw2dZlPKqdvgHpXektWq4X9RTIoW7acy+1SpZ7VgQP7nLczZfJ3hmtJ+vPP4zp37qxq1HgxxrJOnz4lHx8fRUZGqkQJ1+vMv/NOL0lyGRHc19dXbdu+qWnTJmnx4gUqX76CKld+UbVq1Y5l2acVFRWlZ58t4zK9TJmyWrPmE12//r9Q/uAggvdPW4+MjIp7I8QTARtAqpFST/nLlTW9LFargjfNVMS/55O7HBc+BcrIv8YbKfLDksQHJgBPl/Te7il2fyH9b59xIeSyTt04l9zlIAVxc3ONjf/98t7T0zPG/Lp16zuPYD8oU6ZMunTp0mM9fo8evdWiRSv9+OMe/fTTfk2bNkmrVn2kFStWu7SL60xCh8MRYz3c3T1itDPjTEQCNgCYJOLf84q4fCq5y3DhnjmnJPFhCQBSkJS4v5D+t88A/uvYsaOqWvUl5+3ff/9NRYsGxtm+YMFCOnXqlHLnzuOcdvr0Kc2ZM1Pdu/dS7ty55ebmpmPHjqpw4SLONm+/3V61atVRkSL/W/aZM6e1Zs0n6tu3v5o3b6nmzVvqt99+Vdeub+mvv04oUyZ/Z9v8+fPLzc1Nv/12SEWK/O9yb7/9dkiZM2eRr6/vE2+LRyFgAwAAAADitGbNJ8qbN5+KFSuuTZs26K+/Tui994bH2f7119uqa9dOmjJlglq2fFV37tzWlCkTFR4erjx58srd3V2tWrXRokXz5eeXSQUKFNCWLZt08uTfGj58tK5du+Zclp+fn7766guFh4epXbsOstls2rZti3x9fZUvXz7duhXibJsuXXo1bdpCH3ywUBkz+qlYseLav3+v1q9fq27despiSfwB/AjYAAAAAJCEcmXL8OhGKejxmjVroTVrPtbJk3+rUKEimjVrvsuR5/8qWbK0Zs2aq0WLFqhDhzfk7e2tcuUqqHfvfnJ3d5ckde/eSzabTZMnj9Pt23dUuHBhTZ8+R3nz5nMJ2Bkz+mnGjDmaP3+OOnXqILs9SiVLltbs2QuULl16l4AtSX379pefn5/mzZut69f/Ve7cedS//2A1bdr8ibZBfBGwAQAAACAJOByG7HaHBrxRNskf2253JHi8k/z5C6hXr76xzuvcuZs6d+4WY3q5chWco3THxt3dXT179lHPnn1izCtbtpz27TvovF2q1LNasGBJrMvJkSOHS1s3Nzd16tRVnTp1jbX9f5cd2zKeBAEbAAAAAJKAYRi6fTssWa417nAYpgzihYcjYAMAAABAEjEMQ3Y7QTetImADAAAAAGJl1qnTTwvro5sAAAAAAIBHIWADAIAk9ccfR9Sx4+uqVauKunfvpAsXzsdoExUVpUmTxqlRo1pq1Ki2Zs6cJofDIUn655+/Va1aBdWuXdX5b9eubyRJZ8+eUe/e3VSnzkvq2PF1/forR14AAEmHgA0AAJJMeHi43ntvgF5/vb2CgnaqfPmKGj58aIx2Gzas1ZUrl7R27RatXPmZ9u/fq82bN0uS/v77L73wQhV99dVu57/q1V+W3W7Xe+8NUJEigdq27Wv16NFXQ4b019WrwUm9mgCApxQBGwAAJJmDB3+Wr6+vateuJ3d3d7Vv/5YuXDivU6f+cWl3/vzZ/39JGbskyWq1ytPTU5L0998nVKhQzOuvnj17RpcuXVS3bj3l7u6ucuUqqFSp0tq585vEXzEAAETABgAASejs2dPKmzef87bNZlPOnLl09uxpl3aNGzfVyZN/qX79mmrcuLby5cuvBg0aSIo+gv3bb4fUokUjtWzZWCtXfihJcjgccnd3l81mcy7HarXq4sWYp6ADAJAYCNgAACDJhIaGytPTy2Wal5eXwsLCXKZFRESqTp162rr1a61d+7lOnfpHH3/8sSTJ1zejXnihqlatWqspU2bp8883afv2LcqbN58yZvTTRx8tVWRkpA4e/FkHD/6s8PCIJFs/AMDTjYANAEAak5BBxObMme4cROw+wzDUs2cXLV26KMb9HzbvYby8vBQeHu4yLSwsTN7ePi7TJkwYpdq168nX11fZs+dQhw5va926dZKkkSPH6bXX2srb21v58xdQ8+at9MMP38vNzU0TJkzVgQP71KRJPW3evF4vv1xH6dOnj3d9ibntHjY4G4Cnh8Vikc1mTfJ/FosluVf9qUDABgAgDUn4IGL79OWX213arF27WocP/xrr4zxs3sPkzZtP586ddd622+26cOGc8uTJ69IuODhYkZGRzttubm5yc3NTWFiY5s2bpTt37jjnRUZGyMPDQw6HQxEREZo/f4m2b/9Go0ZN0OnTp1SoUOF41ZbY2y6uwdkAPD0sFosy+nrK19c7yf9l9PVMNSH7l19+VqVKz+vixYuSpHfe6azRo0ckc1Xx45bcBQAAAPM8OIiYJLVv/5Y+/fQTnTr1j/LnL+BsF3MQMYs8PDyc88+ePaPPP9+oatWqx3iMh817lOefL6cbN64rKGiratWqq1WrlitHjlzKly+/S7uKFStryZKFGj9+qsLDw7Ry5XI1atRQXl5eOnBgrxwOh955p5fOnj2tDRvWavDgYbJYLHrvvYHq0aOPqld/WTt2BOnChfOqWvWleNWW2NsursHZADw9rFaLLFabgjfNVMS/STc+hEfmXMratK+sVovsdiPJHvdpRMAGACANedggYg+GxMaNm6pfv56qX7+mHA6HatSopZdfriMp+qjy+PGj1LfvwBhHZh82Lz48Pb00efJMTZ06QdOnT1bhwkU0ZsxESVLbtq3Vvn1H1alTXwMHDtXMmVPVpk1T2WxuatiwsTp06KDbt8M1duxkTZs2UQ0avKz06dOrXbuOqlz5RUnSqFHjNXXqBE2cOFYFCxbS9Olz5OOTLkVsu7///kuRkZFq0aKRLBaLmjRprnbtOj72NgSQ+kX8e14Rl08ldxlIBARsAADSkMcdRKxDh866e/eOBg3qq/XrP1OLFq21evVKFSxYSOXKVYgREh82L74CA4tpyZIVMaavWvWZ829f34waPnyM87abm1Vubm6SwpU7dx7NnDk/1mWXKvWsPvpoTYLqSuxt5+ubUUWLFlPTpi10+fIlDRrUT5kzZ1GDBo0TVC8AJIVKlZ7X22931rZtWxQZGaUFC5Yoe/bsWrRovr78crvu3LmjAgUKqkuXd1SxYmXn/Y4e/UPz58/RH3/8Li8vb1WvXlN9+vSTl5e3QkJCNHfuLO3d+4OuX78hX98Mqlq1ut59d4C8vLyTcW2fHL/BBgAgDUnoIGLt27+lbds2659/Tmrbts/Vo0efGMt+2Ly0IDG3nRT34GwAkNKtX79WEyZM1aRJU5UnTx6NGTNCBw7s08iR4/TRR6v18st11L9/H+3Zs1uSdPHiBfXo0UXPPPOMliz5SBMnRg9AOXly9BlLY8aM0IkTxzVhwlStXbtJffr0V1DQVm3atCE5V9MUHMEGACANyZs3n4KCtjlvP84gYjabm3bv3qVr166qefOGkqIDptVq1Z9/HlOJEqXinDd58swYtVitFlmt5gyoY7NZXf43g8NhyOH4328RE3PbjRkzUUuWLNKbb77tHNX8/uBsAJDS1avXUMWKFZcknTt3Vjt2fKEVK1arSJGikqTXX2+rv/8+oVWrVujFF6tq06YNypgxo95/f8T/P/tIeu+9/9Phw79JkipUqKgyZco6B6HMkSOH1q5do5Mn/06GtTMXARsAgDQkoYOIffzxCtWsWUuvv95eb775trPduHEjFRCQXW+/3VWSHjrvQVarRZn8vGW12UxdP19f804ddNjtunEz1BmyE3vbxTU4GwCkdLlz53H+feLEn5Kkrl3fcmkTFRWl9OkzSJJOnvxLRYsWc4ZrSSpbtrzKli0vSWrRorV27/5O27Zt0blzZ3Xq1D+6ePGC8uZ1fb9NjQjYAACkIQkdRKx+/UZq3fp10+qwWi2y2pJ+pNz4enBE3fsBO7G33cMGZwOAlMzT09P5t8PhkCQtXLhUPj6uP6Gx/f8vVd3c3ONclsPhUP/+ffTPPydVp0491apVR0WLBmrixLGJUHnSI2ADAJDGJGQQsbi8//7IBM27L7WNlJuY2+5hg7MBQGpRsGAhSdK//15T0aJVnNMXLJgrm82mLl3eUb58+fXll0Gy2+3O0L1r17eaOXOaRo8er71792jJko9UsmQpSVJUVKTOnz+vnDlzJf0KmYxBzgAAAAAA8VKgQEG9+GJVTZo0Xrt3f6cLF85r5crlWrHiQ2dAbtnyVYWE3NKkSeN16tQ/OnToF82dO1Ply1dQ9uw5ZLO56ZtvvtLFixd07NhRvf/+EP377zVFREQk89o9OY5gAwCQSpk5iJjZzByMLDGl1Dr/OwAbgLTFI3PSHqk1+/HGjZuohQvnadKkcQoJCVHOnLn0/vvD1bBh9GUHn3nmGc2aNU9z587Sm2++Ll9fX9WqVUfduvWUl5eXhg8fpQ8+WKj16z+Tv39mValSVW3avKEffvjO1DqTAwEbpvjjjyOaOnW8zp07qyJFAvX++yNjnOIRFRWladMmaffunZIsqlevgUaMiB7cJTw8TBMnjtXevT/IxyedOnd+R/XrN5IUPYrrokVztX37FhmGoTp1GqhXr36yWlPmhyIASApWq0V+fj4pNiCmdLZ0fnIYDlMHTTOT3WHXzRuhhGwgjXE4DBkOu7I27Zvkj2047Al6T9m372CMaV5e3urbd4D69h0Q5/1KlXpWixYti3Ve3br1Vbdu/RjT+/btL0kqW7acy+MuWPDB45adbAjYeGLh4eF6770B6tmzr6pXf1mrVi3X8OFDtXTpSpd2Gzas1ZUrl7R27RaFhYWpd++u2rx5s6pXr6NFi+YpLCxUmzZ9odOn/1H//r1UqFARFS5cRGvWrNKhQwe1atU6GYahvn3f0RdfbFODBo2TaY0BIPlZrRbZbFZN/fgXnb9yO7nLieH5wKxq36B4cpcRJ6tXOlktVs3et0wXQi4ndzkucvoGqHelt1wGYAOQNhiGoVsh4cly9pHDYcgweE9JbARsPLGDB3+Wr6+vateuJ0lq3/4tffrpJzp16h/lz1/A2e78+bOy2x1yOOySJKvV6hyR8KuvvtSUKTPl5eWlwMDiqlWrrr76KkiFCxfRli2bNGTI/8nPz0+SNGnSTLm5mXvZFwBIrc5fua2TF24ldxkx5MqaPrlLiJcLIZd16sa55C4DwFPEMAzZ7QTdtIrzyvDEzp49rbx58zlv22w25cyZS2fPnnZp17hxU508+Zfq16+pxo1rK1++/GrQoIFCQkJ048Z15cnzv2XkyZNXZ86c1r1793T+/DmdP39Wbdo0V7NmDbRt22ZlzpwlaVYOAAAAAOKJgI0nFhoaKk9PL5dpXl5eCgsLc5kWERGpOnXqaevWr7V27ec6deofffzxxwoLC3Xe5z5PTy+FhYXrzp3o0x6/+26nFi/+UPPnL9HXX3+poKCtibxWAAAAAPB4CNipyB9/HFHHjq+rVq0q6t69ky5cOB+jTdu2rVW7dlXnv+rVK6lNm+aSpHv37mr8+FFq0OBltWjRSBs3rnPeLzj4igYP7qf69WuqWbMGWr58Sbzr8vLyUnh4uMu0sLAweXu7Xnh+woRRql27nnx9fZU9ew516PC21q1b5wznDy4jPDxMPj7ecnd3///r1UG+vhmVPXsONWnSXHv2fB/v+gAAAAAgKRCwU4n7A4m9/np7BQXtVPnyFTV8+NAY7Vat+kxffbVbX321Wxs3Bilr1mzq1aufJGnOnJm6dOmi1qzZoDlzFmn16pX6/vtdkqQJE0Yre/ac+vzzLzV//hIFBW3Vjh1fxKu2vHnz6dy5s87bdrtdFy6cU548eV3aBQcHKzIy0nnbzc1Nbm5uypgxo/z8MuncuTPOeWfPnlHu3Hnl55dJ6dNn0J07d5zzHA6HGJ8BAAAAQEpDwE4lHhxIzN3dXe3bv6ULF87r1Kl/4rzPggWzVbZseb34YlVJ0u7du9S58zvy9c2oHDlyqmnTFgoK2iqHwyEPDw+1b99R7u7uyp49h6pUeUl//HE4XrU9/3w53bhxXUFBWxUZGakVK5YpR45cypcvv0u7ihUra8mShbpz547+/feaVq5crrp160qSatWqo6VLF+nevbs6fvyYvvrqS9WuXVcWi0V169bX6tUrFRISosuXL2nTpvWqXr1mgrYjAAAAACQWAnYqEd+BxO47ffqUvv76S3Xt2tM5zeFwuPzO2Wq16uLF87JarZo0aYb8/TNLir5e9U8/7VOBAoXiVZunp5cmT56p9es/U4MGL+unn/ZrzJiJkqJPWd+xI0iSNHDgUGXJ8ozatGmqt95qq/LlK6pDhw6SpK5deypjRj+1avWK3ntvgHr16qfChYtKknr06KtChYqoXbvW6tSpnerWbaA6dWJeN+9hnvT0+qioKE2aNE6NGtVSo0a1NWfOdDkcDpf7X7x4QfXqVX+sugAAAACkHcl+mS6Hw6G5c+dq7dq1un37tsqXL6/hw4crd+7csbb/999/NX78eO3Zs0eGYeiFF17QkCFDlC1btiSuPGnFdyCx+z799BM1atTEeWkrSXrhhSpaunSRhg0brdu3Q7R16+eKiopyuZ/dbte4cSPl7u6h+vUbxbu+wMBiWrJkRYzpq1Z95vzb1zejhg8f47zt5maVm5ubpHB5e3vrvfdGxLpsDw+PR17I/mHie53uB2u9c+eO3nrrDefp9f+9hnevXl1VqNB25zY6cuR3jRgx1OVUdgAAAABPl2Q/gj1//nx98sknGjNmjNasWSOHw6FOnTopIiIi1vZ9+/bVxYsX9eGHH+rDDz/UxYsX1aNHjySuOunFdyAxSYqMjNS33+5Qw4ZNXKb37t1fXl7eeu21Zho58n3Vr99Q6dP/7zqloaGhGjLkXZ09e0bTps2Rh4dH4qxMEjPj9PqY1/C2OLfPgQP7NHLke3rjjTcTf2UAAACQqlksFtls1iT/Z7FYElTvsWNH9eqrzVW1akXNnj3DOf23337VCy+UM2uzpBnJegQ7IiJCy5Yt04ABA1S9enVJ0owZM1S1alXt2LFDjRq5HkENCQnRgQMHtGDBAhUrVkyS1KVLF3Xv3l03b950OVqb1uTNm09BQduct+MaSEySfv/9N/n7Z1aBAgVdpt+4cV0DB77nDNWLFs1ToUKFJUVv2379eihz5iyaO3exvL29Y63DarXIak1Y5/wvm83q8r8ZHA5DDofrCGgPO70+f/4CMZZx//T6Tz/d7JzWuHFT9evXU/Xr15TD4VCNGrX08st1JElFiwZq9eoNunbtqmnrAQAAgLTHYrEog6+nbFZbkj+23WHX7ZBwGY85WvDy5Uvl7u6u1avXKUOGDJKiw/XAgf1i/GQSyRywjx8/rrt376py5crOab6+vipevLh++umnGAHby8tL6dKl06ZNm1ShQgVJ0ubNm5U/f375+vomae1J7cGBxGrVqqtVq5bHOpCYJB09ekQlSpSKMX3FiqVKly69+vQZoBMnjmvLlo2aODH6W6gRI4YqW7YAjRkzUTZb7B3earUok5+3rHHMTyhf39jDfEI47HbduBnqErLNOL3+/jW8O3TorLt372jQoL5av/4ztWjRWhkz+sW6HAAAAOBBVqtFNqtNs/ct04WQy0n2uDl9A9S70luyWi2y2x8vYN++fVtFihRVrly5FRUVpZkzp2nduk9VsGAhhYTcSqSKU69kDdiXL0e/qLJnz+4yPWvWrM55D/Lw8NDEiRM1fPhwlStXThaLRVmzZtWqVatktT7ZUVA3t2Q/W/6h3Nx8NH36LE2aNF4zZkxW4cJFNH78JLm5WfXaay315ptvqV69BpKir2n9zDPPxFin3r37afTo4apfv6b8/f3Vv/9gPffcszp58m/99NN+eXp6ugzSVa9eAw0e/L7zts1mldVmU/CmmYr4N+YgYcnNI3MuZW3aV+7uNtnt//s2zcfHR5GRES7bIzw8TOnTp4uxjaJPr/9KH3zwocu8CRNGafjw0fL395O/v586duykVatW6NVX2zjb3D8Sn9JfS6mRmWc5IGXiOX58bLO0j+f48bHN0r608hxfCLmsUzfOJXcZj9S0aUNdvnxJkrR9+1atWLFav/56ULNmzdOlS5c0duzI5C0wBUrWgB0aGipJMX7r6+npqVu3Yn4bYhiGjh07pjJlyqhTp06y2+2aMWOGunfvrtWrV7v8nvhxWK0WZcqULkH3TUqVK5fXpk0bY0z/4osgl9sTJoyN9f6ZMqXTihUfxZhertyz+vPPP+NdR8S/5xVx+VS82ye1/x4RL1kyUF9+uc35HEefXn9epUoVi/G879u3T888k0Vly5Z2mX71arC8vGzO9hkzppOXl4fL/e/ejX7c1PBaAlIaM89kAdIK+gUQE/0iaX344SoNGtRPWbNm07vvDpSfXyYtX/6xJGnr1s+TubqUKVkD9v1LRkVERLhcPio8PDzW3wAHBQVp1apV2rlzpzNML1y4UDVq1NC6deucl3x6XA6HoZCQewm679PEZrOmije1kJBQlyPYRYqU1NWr1/Txx5+qdu26WrHiQ+XIkVP+/gG6ceOuy3337/9FxYuXjDG9UqUXNG3adE2aNE3h4eFauHCRXn65tku7W7eivzD6733x5FLLaw8J999+i0ejX6R99IvHR79I+1JKv/D19U4zR9MfJlOmTHJzc5enp5cyZ86S3OWkCskasO+fGh4cHKw8efI4pwcHB6to0aIx2v/888/Knz+/y5HqjBkzKn/+/Dpz5swT1RIVlfwd9T4zBxJ7GtntDpfn083NQ5Mnz9TUqRM0ZcpEFS5cRKNHT1RUlENt27ZW+/YdndfVvnjxojJlyhzj9dC//xDNnDlVLVs2kc3mpvr1G6lly9dc2t1/s09JryUgtfhvvwVAvwBiQ79ASpesATswMFDp06fX/v37nQE7JCRER48eVdu2bWO0DwgI0LZt2xQeHi5PT09J0r1793T+/Hm98sorSVp7YrFaLfLz83kqvhFLSvG5TrckDRgwJNb7//ca3rHJnj2Hfvjh54QXCQAAACBVS9aA7eHhobZt22rq1Kny9/dXzpw5NWXKFAUEBKhOnTqy2+26fv26MmTIIC8vLzVt2lRLly5V37591adPH0nSzJkz5enpqebNmyfnqpjGao2+Lt7Uj3/R+Su3k7scF88HZlX7BsWTuwwAAAAASJGSNWBLUu/evRUVFaVhw4YpLCxM5cuX19Kl0ddaO3/+vF5++WVNmDBBzZs3V9asWfXJJ59oypQpevPNN2W1WlWuXDl98sknzmuypRXnr9zWyQspa9j7XFkTNohcUkvJR/9ju043AAAAgLQh2QO2zWbTwIEDNXDgwBjzcuXKFWN064IFC2rhwoVJVR5SEVs6PzkMR4oe3MTusOvmjVBCNgAAwFMsp29Amn68p1myB2zALFavdLJarJq9b5kuhMS8jnpyy+kboN6V3pLVaiFgAwAAPIUcDkN2h129K72V5I9td9gT9Bl0wYIPYp3eqNEratQobYyDZSYCNtKcCyGXderGueQuAwAAAHBhGIZuh4QnyxWDHA5DhsFBnsRGwAYAAACAJGIYhux2gm5alXJHgwIAAAAAIBUhYAMAAAAAYAICNgAAAAAAJiBgAwAAAECi4LfWaUP8n0cCNgAAAACYyN3dXRaLFB4entylwATh4eGyWKKf10dhFHEAAAAAMJHNZpOfn59u3LgpSfL09JSU9JfmwpMyFB4ertu3bypTJj/ZbLZH3oOADQAAAAAmy549uyTp5s2bun07mYtBglksUqZMfs7n81EI2AAAAABgMovFohw5cihbtmyKjIxM7nKQQO7u7vE6cn0fARsAAAAAEonNZnusgIbUjUHOAAAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAE7gl9I4RERFat26dfvzxR129elXjx4/XgQMHVKJECZUuXdrMGgEAAAAASPESdAT7+vXratGihcaNG6czZ87o8OHDCgsL065du9SuXTsdOnTI7DoBAAAAAEjREhSwJ0+erLt372r79u3auHGjDMOQJM2ePVulSpXS7NmzTS0SAAAAAICULkEBe+fOnerTp4/y5s0ri8XinO7p6am33npLf/zxh2kFAgAAAACQGiQoYIeHh8vPzy/WeTabTZGRkU9SEwAAAAAAqU6CAnapUqX0ySefxDpvy5YtKlmyZLyX5XA4NHv2bFWtWlXPPfecOnfurHPnzsXZPjIyUtOmTXO2b9u2rY4dO/bY6wAAAAAAgJkSFLD79OmjPXv2qEmTJpo1a5YsFou2bt2qbt266YsvvlCPHj3ivaz58+frk08+0ZgxY7RmzRo5HA516tRJERERsbYfOXKkNmzYoPHjx2v9+vXy9/dX586ddfv27YSsCgAAAAAApkhQwC5Xrpw+/PBDeXt7a8mSJTIMQ8uXL9fVq1e1aNEiVapUKV7LiYiI0LJly9S7d29Vr15dgYGBmjFjhi5fvqwdO3bEaH/u3DmtX79e48aNU9WqVVWwYEGNHTtWHh4eOnLkSEJWBQAAAAAAUyT4Otjly5fXmjVrFBYWplu3bil9+vRKly7dYy3j+PHjunv3ripXruyc5uvrq+LFi+unn35So0aNXNrv2bNHGTJkULVq1Vzaf/vttwldDQAAAAAATJHggL148WL9/PPPWrx4sby8vLR//371799f3bp1U9u2beO1jMuXL0uSsmfP7jI9a9asznkPOnXqlHLnzq0dO3Zo8eLFunLliooXL64hQ4aoYMGCCV0VSZKbW4IO5pvOZksZdSDx8Bw/PrZZ2sdz/PjYZmkfz/HjY5ulfTzHSOkSFLCXLVummTNnugTpPHnyqF69epo4caI8PT3VqlWrRy4nNDRUkuTh4eEy3dPTU7du3YrR/s6dOzpz5ozmz5+vQYMGydfXVwsWLNDrr7+u7du3K3PmzAlZHVmtFmXK9HhH34GE8vX1Tu4SgBSHfgHERL8AYqJfIKVLUMBes2aN+vbtqy5dujinZc+eXcOGDVOWLFm0fPnyeAVsLy8vSdG/xb7/txR9GTBv75idx83NTXfu3NGMGTOcR6xnzJihl156SRs3blSnTp0SsjpyOAyFhNxL0H3NZrNZeeNI40JCQmW3O5K7jFSFfpH20S8eH/0i7aNfPD76RdqXUvqFr683R9MRqwQF7CtXrqhUqVKxznv22We1YMGCeC3n/qnhwcHBypMnj3N6cHCwihYtGqN9QECA3NzcXE4H9/LyUu7cuXX+/PnHWYUYoqKSv6Pi6WC3O3i9Af9BvwBiol8AMdEvkNIl6GuXnDlzau/evbHO++mnnxQQEBCv5QQGBip9+vTav3+/c1pISIiOHj2q8uXLx2hfvnx5RUVF6ffff3dOCwsL07lz55Q3b97HXAsAAAAAAMyToCPYrVu31pQpUxQZGalatWopc+bMun79unbu3KkPP/xQ/fv3j9dyPDw81LZtW02dOlX+/v7KmTOnpkyZooCAANWpU0d2u13Xr19XhgwZ5OXlpXLlyumFF17Q4MGDNXr0aPn5+Wn27Nmy2Wxq0qRJQlYFAAAAAABTJChgd+jQQVeuXNHKlSu1fPly53SbzaY333xTHTt2jPeyevfuraioKA0bNkxhYWEqX768li5dKnd3d50/f14vv/yyJkyYoObNm0uS5syZo6lTp6pnz54KCwvT888/rxUrVsjf3z8hqwIAAAAAgCkSfJmuwYMHq3v37jp06JBu3bolX19flS5dWpkyZXqs5dhsNg0cOFADBw6MMS9Xrlz6888/XaalT59eI0eO1MiRIxNaOgAAAAAApktwwJakDBkyqFq1ambVAgAAAABAqpWggB0WFqYFCxZo586dCg0NlcPhOpKfxWLR119/bUqBAAAAAACkBgkK2OPGjdO6detUoUIFFStWTFYr14ADAAAAADzdEhSwd+zYoX79+qlLly5m1wMAAAAAQKqUoEPPkZGRKl26tNm1AAAAAACQaiUoYFepUkXff/+92bUAAAAAAJBqJegU8QYNGmjEiBG6fv26nn32WXl7e8do07Rp0yetDQAAAACAVCNBAbtv376SpE2bNmnTpk0x5lssFgI2AAAAAOCpkqCA/c0335hdBwAAAAAAqVqCAnbOnDkfOt8wjAQVAwAAAABAapWggC1J27dv14EDBxQREeEM1IZh6N69e/r1118ZBA0AAAAA8FRJUMCeO3eu5s6dqwwZMigqKkru7u5yc3PT9evXZbVa1apVK7PrBAAAAAAgRUvQZbo2btyopk2b6sCBA+rQoYNq1KihH3/8UevWrZOfn58KFy5sdp0AAAAAAKRoCQrYV65cUePGjWWxWFSsWDEdOnRIklSyZEl169ZNa9euNbVIAAAAAABSugQFbB8fH1ksFklS3rx5df78eYWFhUmSihUrpvPnz5tXIQAAAAAAqUCCAnapUqWc17/Onz+/bDab9u7dK0k6efKkPDw8TCsQAAAAAIDUIEGDnHXr1k0dO3ZUSEiIFi5cqFdeeUWDBw9WxYoV9cMPP6hWrVpm1wkAAAAAQIqWoIBdvnx5rVu3Tn/++ackafjw4bJarTp48KDq1aunIUOGmFokAAAAAAApXYKvgx0YGKjAwEBJkqenp8aMGWNaUQAAAAAApDYJDthXrlzRkSNHdPv27VjnN23aNKGLBgAAAAAg1UlQwN6+fbuGDBmiiIiIWOdbLBYCNgAAAADgqZKggD1z5kyVLl1aQ4cOlZ+fn8klAQAAAACQ+iQoYAcHB2v06NEqUaKE2fUAAAAAAJAqJeg62M8995yOHz9udi0AAAAAAKRaCTqCPWLECHXr1k137txRqVKl5OPjE6NN+fLln7g4AAAAAABSiwQF7NOnT+vatWuaO3eupOhBze4zDEMWi0XHjh0zp0IAAAAAAFKBBAXsSZMmKU+ePOrcubOyZMlidk0AAAAAAKQ6CQrYFy9e1MKFC/XCCy+YXQ8AAAAAAKlSggY5K1KkiC5dumR2LQAAAAAApFoJOoI9dOhQDRgwQHa7Xc8995zSp08fo02OHDmeuDgAAAAAAFKLBAXsjh07KioqSsOHD3cZ4OxBDHIGAAAAAHiaJChgjxo1yuw6AAAAAABI1RIUsC9duqS6deuqYMGCZtcDAAAAAECqlKBBzhYtWqTz58+bXQsAAAAAAKlWggJ2oUKFdOrUKbNrAQAAAAAg1UrQKeI1atTQ9OnTtXv3bhUtWlQ+Pj4u8y0Wi3r06GFKgQAAAAAApAYJCthz586VJO3Zs0d79uyJMZ+ADQAAAAB42iQoYB8/ftzsOgAAAAAASNUSFLAfdPLkSd2+fVv+/v7KkyePGTUBAAAAAJDqJDhgb926VZMmTdK1a9ec07JkyaL+/furadOmZtQGAAAAAECqkaCA/e2332rgwIGqVKmS3n33XWXJkkXBwcH6/PPPNXToUPn5+al69eomlwoAAAAAQMqVoIC9YMEC1atXTzNmzHCZ3qJFC/Xr10+LFi0iYAMAAAAAnioJug72iRMn1KxZs1jnNWvWjEHQAAAAAABPnQQF7EyZMunWrVuxzrt586Y8PDyeqCgAAAAAAFKbBAXsypUra+7cubp8+bLL9EuXLmnevHl68cUXTSkOAAAAAIDUIkG/wX733XfVokUL1alTR2XKlFGWLFl07do1HTp0SBkzZlT//v3NrhMAAAAAgBQt3keww8PDnX8/88wz2rhxo9q1a6fQ0FAdOXJEoaGhateunTZu3KicOXMmSrEAAAAAAKRU8T6CXbNmTc2dO1dlypTR3Llz1apVKw0cODAxawMAAAAAINWI9xHs27dvKzg4WJI0b948XblyJdGKAgAAAAAgtYn3EexSpUqpf//+mjRpkgzDUI8ePeIcLdxisejrr782rUgAAAAAAFK6eAfs6dOna/ny5bp586Y2btyo4sWLy9/fPzFrAwAAAAAg1Yh3wM6WLZsGDx4sSfrqq6/Ur18/BQYGJlphAAAAAACkJgm6DraXl5f++ecfs2sBAAAAACDVSlDAjoyMVKZMmUwpwOFwaPbs2apataqee+45de7cWefOnYvXfT///HMVLVpU58+fN6UWAAAAAAASKkEBu3379po5c6YOHTqk0NDQJypg/vz5+uSTTzRmzBitWbNGDodDnTp1UkRExEPvd+HCBY0ePfqJHhsAAAAAALPE+zfYD9q8ebMuXryo119/Pdb5FotFR48efeRyIiIitGzZMg0YMEDVq1eXJM2YMUNVq1bVjh071KhRo1jv53A4NHDgQJUoUUL79u1LyCoAAAAAAGCqBAXsV155xZQHP378uO7evavKlSs7p/n6+qp48eL66aef4gzYCxcuVGRkpHr27EnABgAAAACkCAkK2D179jTlwS9fvixJyp49u8v0rFmzOuf91+HDh7Vs2TKtW7dOV65cMaUOSXJzS9DZ8qaz2VJGHUg8PMePj22W9vEcPz62WdrHc/z42GZpH88xUroEBez7vvvuO/3444+6evWq+vXrp2PHjqlEiRLKmTNnvO5///fbHh4eLtM9PT1169atGO3v3bunAQMGaMCAAcqXL59pAdtqtShTpnSmLAt4FF9f7+QuAUhx6BdATPQLICb6BVK6BAXs0NBQ9ejRQz/++KPSp0+vu3fv6u2339bq1at19OhRrVq1SoULF37kcry8vCRF/xb7/t+SFB4eLm/vmJ1n7Nixyp8/v9q0aZOQsuPkcBgKCbln6jITymaz8saRxoWEhMpudyR3GakK/SLto188PvpF2ke/eHz0i7QvpfQLX19vjqYjVgkK2NOnT9cff/yh5cuXq1y5cipZsqQkadKkSerUqZNmzZqluXPnPnI5908NDw4OVp48eZzTg4ODVbRo0Rjt169fLw8PD5UpU0aSZLfbJUmNGjVSt27d1K1bt4SsjiQpKir5OyqeDna7g9cb8B/0CyAm+gUQE/0CKV2CAnZQUJDeffddVapUyRlypejfTr/zzjvxvnxWYGCg0qdPr/379zsDdkhIiI4ePaq2bdvGaL9jxw6X27/99psGDhyoxYsXq0iRIglZFQAAAAAATJGggB0SEhLn76wzZsyoe/fid7q1h4eH2rZtq6lTp8rf3185c+bUlClTFBAQoDp16shut+v69evKkCGDvLy8lDdvXpf73x8ILUeOHPLz80vIqgAAAAAAYIoE/XCgcOHC2rJlS6zzvv3223j9/vq+3r17q2XLlho2bJhee+012Ww2LV26VO7u7rp06ZKqVKmi7du3J6RMAAAAAACSTIKOYL/zzjvq2bOnbt68qRo1ashiseinn37Shg0btGbNGk2bNi3ey7LZbBo4cKAGDhwYY16uXLn0559/xnnfihUrPnQ+AAAAAABJJUEBu1atWpoyZYqmTZum7777TpI0ceJEZc6cWSNHjlS9evVMLRIAAAAAgJTusQP24cOHdeHCBRUoUEC7du3SP//8o5s3b8rX11cFChSQ1cpw9QAAAACAp0+8A3ZISIi6du2qX3/9VYZhyGKxqEyZMpo2bZoKFCiQmDUCAAAAAJDixftw88yZM3X06FH16tVLixcv1uDBg/XPP/9o+PDhiVkfAAAAAACpQryPYO/cuVPvvvuu3nzzTUlStWrVlC1bNg0YMED37t2Tj49PohUJAAAAAEBKF+8j2FevXlWJEiVcplWsWFF2u12XLl0yvTAAAAAAAFKTeAfsqKgoeXh4uEzLmDGjJCk8PNzcqgAAAAAASGVMGfLbMAwzFgMAAAAAQKplSsC2WCxmLAYAAAAAgFTrsa6DPXLkSKVPn955+/6R6//7v/9TunTpnNMtFos++ugjk0oEAAAAACDli3fALl++vKSYp4PHNp1TxgEAAAAAT5t4B+yVK1cmZh0AAAAAAKRqpvwGGwAAAACApx0BGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATELABAAAAADABARsAAAAAABMQsAEAAAAAMAEBGwAAAAAAExCwAQAAAAAwAQEbAAAAAAATJHvAdjgcmj17tqpWrarnnntOnTt31rlz5+Js/9dff6lLly6qWLGiKleurN69e+vixYtJWDEAAAAAADEle8CeP3++PvnkE40ZM0Zr1qyRw+FQp06dFBEREaPtjRs31LFjR3l5eWnlypX64IMPdP36dXXq1Enh4eHJUD0AAAAAANGSNWBHRERo2bJl6t27t6pXr67AwEDNmDFDly9f1o4dO2K0//rrr3Xv3j1NnjxZRYoUUcmSJTVlyhSdPHlSBw8eTIY1AAAAAAAgWrIG7OPHj+vu3buqXLmyc5qvr6+KFy+un376KUb7ypUra/78+fLy8nJOs1qjVyEkJCTxCwYAAAAAIA5uyfngly9fliRlz57dZXrWrFmd8x6UK1cu5cqVy2Xa4sWL5eXlpfLlyydeoQAAAAAAPEKyBuzQ0FBJkoeHh8t0T09P3bp165H3X7lypVatWqVhw4bJ39//iWpxc0v2n6NLkmy2lFEHEg/P8eNjm6V9PMePj22W9vEcPz62WdrHc4yULlkD9v1TvSMiIlxO+w4PD5e3t3ec9zMMQ7NmzdKCBQv0zjvvqF27dk9Uh9VqUaZM6Z5oGUB8+frG/doGnlb0CyAm+gUQE/0CKV2yBuz7p4YHBwcrT548zunBwcEqWrRorPeJjIzU0KFDtXXrVg0dOlQdOnR44jocDkMhIfeeeDlmsNmsvHGkcSEhobLbHcldRqpCv0j76BePj36R9tEvHh/9Iu1LKf3C19ebo+mIVbIG7MDAQKVPn1779+93BuyQkBAdPXpUbdu2jfU+gwYN0ldffaVp06apYcOGptUSFZX8HRVPB7vdwesN+A/6BRAT/QKIiX6BlC5ZA7aHh4fatm2rqVOnyt/fXzlz5tSUKVMUEBCgOnXqyG636/r168qQIYO8vLy0YcMGbd++XYMGDVKFChV09epV57LutwEAAAAAIDkk+3kNvXv3VsuWLTVs2DC99tprstlsWrp0qdzd3XXp0iVVqVJF27dvlyRt3bpVkjR58mRVqVLF5d/9NgAAAAAAJIdkPYItSTabTQMHDtTAgQNjzMuVK5f+/PNP5+1ly5YlZWkAAAAAAMRbsh/BBgAAAAAgLSBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACZI9oDtcDg0e/ZsVa1aVc8995w6d+6sc+fOxdn+xo0b6t+/v8qXL68KFSpo1KhRCg0NTcKKAQAAAACIKdkD9vz58/XJJ59ozJgxWrNmjRwOhzp16qSIiIhY2/fu3VtnzpzR8uXLNWvWLH333XcaOXJk0hYNAAAAAMB/JGvAjoiI0LJly9S7d29Vr15dgYGBmjFjhi5fvqwdO3bEaH/o0CEdOHBAkyZNUokSJVS5cmWNHj1amzdv1pUrV5JhDQAAAAAAiJasAfv48eO6e/euKleu7Jzm6+ur4sWL66efforR/ueff9YzzzyjggULOqdVqFBBFotFv/zyS5LUDAAAAABAbJI1YF++fFmSlD17dpfpWbNmdc570JUrV2K09fDwkJ+fny5dupR4hQIAAAAA8Ahuyfng9wcn8/DwcJnu6empW7duxdr+v23vtw8PD09wHVarRf7+6RJ8fzNZLNH/j+xcWVF2R/IW8x+eHjZJUvY2/yfDHpXM1cRkcY9+bbxXrZeiHCmvPjdrdHfLmNFbhpHMxaQyKblfSCm7b9Av0i76xZNJyX2DfpFw9IsnQ7+IP6vVktwlIIVK1oDt5eUlKfq32Pf/lqTw8HB5e3vH2j62wc/Cw8Pl4+OT4DosFotstpTVSfwyeCZ3CXGypcuY3CU8VEavDMldwkNZrck+tmCqlZL7hZSy+wb9Iu2iXzyZlNw36BcJR794MvQLIOGS9RV6/3Tv4OBgl+nBwcHKli1bjPYBAQEx2kZEROjmzZvKmjVr4hUKAAAAAMAjJGvADgwMVPr06bV//37ntJCQEB09elTly5eP0b58+fK6fPmyzpw545x24MABSVLZsmUTv2AAAAAAAOKQrKeIe3h4qG3btpo6dar8/f2VM2dOTZkyRQEBAapTp47sdruuX7+uDBkyyMvLS88++6yef/559evXTyNHjtS9e/c0fPhwNW3aNNYj3gAAAAAAJBWLYSTvMAF2u13Tp0/Xhg0bFBYWpvLly2v48OHKlSuXzp8/r5dfflkTJkxQ8+bNJUn//vuvRo0apd27d8vT01P16tXT0KFD5emZsn9rAwAAAABI25I9YAMAAAAAkBYwDB8AAAAAACYgYAMAAAAAYAICNgAAAAAAJiBgAwAAAABgAgI2AAAAAAAmIGADAAAAAGACAjYAAAAAACYgYKcgn376qbZu3RrrvL1796pZs2Zq3LixunXrplu3bsVoExoaqjJlyqhJkybOf3a7PUa7b7/9Vh9++OFj1TZnzhzNmTPnse7zXytXrlT9+vVVp04dffrpp87phw4dUuvWrdWwYUO9++67ioiIcLnfkCFDtGHDBuft+GyLlOb8+fOqWbPmY93nYa8HJEx8tunRo0dVsmTJOOdfuXJF7dq1U/369dW+fXv9+++/kqSIiAiNHTtWTZo0UcOGDfXDDz+43O/EiRNq2LCh83ZkZKSGDh2qRo0aqXHjxtqyZcsTrFnS+W9/fJTbt2+re/fuiVjR0439RuLsN+7cuaOWLVuqSZMm+uuvv55oHeIrIdurXbt2iVQNHpTa9x1r165VjRo1NG7cuEe2NUvRokUfq31C3mOAlIqAnYIcOnQoxocESbLb7Ro8eLCmTZumLVu2qFChQlq6dGmMdn/88YcqVaqkzZs3O//ZbLZY2925cydR1iEuR48e1Weffab169drw4YNWrVqlU6ePKk7d+6oV69eGj16tLZt2yYpekcgRe+MunXrpqCgIOdy4rst0oK4Xg9IuEdt09DQUI0ePVqRkZFxthk1apSaN2+uoKAgvfLKK84PLEuWLNGNGze0adMmzZw5U0OGDJHD4ZAkbdiwQW+//bZCQ0Ody/nss88UGRmprVu36qOPPtLYsWOTvF8mhVu3bun48ePJXUaaxX4jcfYbx44dk81m0+bNm1W4cOHEW8kndODAgeQu4amQ2vcdW7Zs0ejRo/X+++8/zmonqeR4jwESi1tyF5DWzZo1S9u2bVOGDBlUsGBB5c6dWytXrlTt2rX1+++/y9vbW1OnTtXp06f17bffat++fcqcObNeeukl5zJsNpu++eYbubu7KyIiQleuXIn1m8Hff/9dV65cUatWrWSz2TRgwACVK1fOpc2ff/6pNWvWSJICAgJ0+fJlSVKvXr0kRX8b3rNnT0nS5MmTZRiG8uXLp/z58+vw4cNq3bq17ty5o9atW6tDhw6SpIULF+rzzz+XzWbTiy++qIEDB8b4gLZz507VrVtXPj4+kqS6desqKChIhQsX1nPPPafAwEBJ0rBhwxQVFSVJ2rx5s15++WX5+fk99rZ40KBBg/Tnn39Kkm7evCnDMPT999/ryJEjGj9+vEJDQ5UhQwaNGDFCBQsWVLt27eTr66uTJ09q4sSJunHjhmbOnCmHw6HcuXNr9OjRypIlS5yP980332ju3LmyWCzy8/PTlClTJEnh4eHq37+/Tpw4ITc3N82ePVu5c+fWr7/+qnHjxiksLEz+/v4aPXq0zp49G+frAa7M6GP3TZw4UR06dNChQ4difazIyEjt379fs2bNkiQ1bdpU48ePV2RkpIKCgjRlyhRZLBYVLlxYy5cvl2EYunnzpnbt2qXp06dr8ODBzmW98cYbat26tSQpODhY7u7ucnd3j3M9Dx48qFGjRjlv//333xo5cqSaN2+uqVOnat++fYqKilK9evXUo0cP7d+/36UPjxs3TsOGDdOff/4pi8Wit99+W02bNo3z8cLCwjRo0CCdPXtWFotFr776qtq0aSNJ+v7777V69Wpdu3ZNrVq1Uvfu3eVwODR+/Hj9+OOPslqteuWVV9SlSxeNHj1awcHB6tatmxYuXBj3Ewkn9hvRkmu/8e+//+q9997TtWvX1LlzZy1cuDDWPta4cWNNmTJFgYGBeu+99xQWFqbp06frzJkz6tevX5xnejgcDo0aNUqHDh2SzWZTzZo1ndvy999/V5s2bRQcHKyqVas6+3xs22vs2LGSpObNmz/WWSWI9rTsO+bOnavff/9do0eP1pAhQ5QtW7YYn31Onjypzz//XHPnztWlS5dUvXp1BQUFqUCBAhowYIAaNGgQ51l4v/76q8aOHSvDMOTp6amxY8eqQIECkuR8nYeHh2vSpEkqXbq0Tp06peHDh+vmzZvy8fHR+++/L09PT5f3mFatWsXjGQRSMAOJ5ttvvzVatWplhIaGGvfu3TOaN29uzJ492yhSpIixdu1awzAMY8WKFUbnzp0NwzCMwYMHG+vXr49zeUePHjUqVapkVK1a1bh48WKM+R9++KGxaNEiw+FwGEeOHDFefPFF4/r16zHazZ4925g9e3aMvw3DMNq2bWvs27fP2Ldvn1GmTBnj5s2bznavvPKKcffuXeP27dtG7dq1jaNHjxq7du0yWrRoYdy7d8+IjIw0unXrZqxatSrGY/7f//2f8dlnnzlvf/bZZ8awYcOMRYsWGYMGDTJ69uxpNGrUyBgxYoQRFhbmct/YtsujtkVsQkJCjEaNGhm7d+82IiIijMaNGxvnzp0zDMMwfv75Z6NZs2bObTB9+nTDMAzj2rVrxosvvmicPXvWMAzD+OCDD4xevXo99HGaNGliHD9+3DAMw/joo4+MXbt2GefOnTOKFi1qHDx40DAMwxg/frwxceJEIzw83Khevbpx6NAhwzAMY/v27Ubz5s3jXG+4MrOPff3118agQYMMwzCMIkWKxNomODjYqFq1qsu0qlWrGpcvXzZKlSplrFq1ymjevLnRqlUrY+/evS7tzp07Z9SoUSPGMgcPHmyUKFHCmDVrVrzXe82aNUbbtm2NyMhIY82aNcaYMWMMh8NhREREGJ06dTK+/fbbGH140qRJxqhRowzDMIx///3XqFmzpnHs2LE4H+Orr74yevbsaRiGYVy/ft0YMGCAs94uXboYdrvduHbtmlG6dGnj9u3bxqpVq4xu3boZkZGRxr1794wWLVoYO3fujHO9ETv2G/+TnPuNffv2GW3btjUMw4izj02dOtVYtmyZYRiG0bhxY6NmzZqGYUQ/P3PmzIlz2ceOHXPub8LCwox3333XuHfvnjF79myjadOmRmhoqBEaGmpUqVLFOHHixEO3V1zvVXi4p23fcb+PxvXZ5/bt20blypUNu91urF+/3qhcubKxZs0aw263G9WrVzdCQ0PjXHb37t2Nb775xjAMw9i2bZuxYcMG57bYtm2bYRjRn4Xuf3Zq0aKFsX37dsMwDOPQoUNG9erVjfDw8BjvK0BqxiniiWjPnj1q1KiRvLy85O3trVdeeUWS5O7urubNm0uSmjVrpp9++ileyytWrJj27t2rbt26qV+/fjHmd+jQQV26dJHFYlGJEiVUqlQpHTx4MMH1FyhQQBkzZnTerl+/vnx8fJQ+fXrVqFFDBw4c0L59+9SoUSN5e3vLzc1NLVq00N69e2MsyzCMGNMsFovsdru+++47DRw4UJs2bVJYWJgWL178yNoetS3+y263q1+/fmratKmqVKmiU6dO6ezZs+rRo4eaNGmi0aNH6+rVq85TwJ5//nlJ0uHDh1W6dGnlzp1bkvTqq69q3759D32sWrVqqWvXrhozZowKFizo/LY7a9asKlOmjCSpSJEiunnzpk6fPi1fX18999xzkqK38dmzZ3X79u1HrhPM62NXr17VggUL9H//938PbXf/tL3/slqtstvtOn/+vNatW6fRo0drwIAB8XoeJ06cqO+//15ffvlljN/exWb//v1atmyZZs2aJTc3N+3Zs0e7du1S06ZN1bJlS505c0YnTpyQ5NqH9+3b5zwq4O/vr5dffvmhp5eWKlVKR44c0dtvv60tW7a4HEGpVauWrFarMmfOLH9/f926dUv79+9XixYt5ObmJm9vbzVu3DjW9wI8HPuN/0nu/cZ9cfWxl156ST/++KPOnTunHDly6JlnntHp06f1/fffq0aNGnEuL0+ePIqIiNAbb7yhjz76SP369ZO3t7ckqVq1avLy8pKXl5fy5s2rGzduxHt7If6exn2HpDg/+3h4eKhIkSI6cuSI9u3bpw4dOujAgQM6cuSIihYtKi8vrziXWbNmTQ0bNkzvv/++PDw8nNtSkurUqSMp+jPPjRs3dPfuXZ05c0b169eXJD333HPKmDGj/vnnn3jVD6QWnCKeiKxWa6xvqhaLRRaLRVL0m67VGvN7jiZNmjj/Xr16tfbt2+c8Padp06bO044ftHbtWlWpUkXZs2eXFP3hxM3NTe+//76OHDkiSc5Tyh6s5cEaH/z90P0d/oPrc9/9Zce2flFRUVq9erXzdJ82bdooW7ZsCg4OdrYJDg5WQECAsmTJotKlSytPnjySoj+MrVq1KsYy77t37168tsV/TZw4URkzZtTbb78tSc7TvTdv3uxcnytXrsjDw0OSnDuT/66fYRgP/Y2VJPXs2VMNGjTQd999pylTpujw4cNq3Lix3Nz+190sFosMw4h1+xmG4TzdEQ9nVh9r27atbt68qTfeeMNl/sqVK10GEVq3bp3u3LmjqKgoubm5KSoqSnfv3pWfn5+yZMmi+vXry2KxKDAwUAEBATp16pRKly4da+2HDx9WpkyZlDt3bvn7+6tatWr6888/VaVKlTjX9+zZsxo8eLAWLFggf39/SdFfHg0aNMj5QebGjRvy8vLS4cOHXfrwf8PKo15n2bJlU1BQkPbs2aPdu3erWbNmzt+7Pngqb1yvZV7HCcN+I+XsN+6Lq495eHjor7/+0u7du1WxYkXdvHlT33//vc6ePasSJUrEuTwfHx9t2rRJ+/fv1w8//KA2bdpo5cqVkhTv/QR968k8bfuO+x722ad69er68ccfdezYMQ0fPlxNmjRRvnz5HjlAa4sWLVS5cmXt2rVLy5cv165du5zvGfdfz/e3aWxfmrGvQFrEEexE9OKLLyooKEjh4eGKiIhQUFCQLBaLIiIi9PXXX0uKHsDixRdflBT9ofX+6K0PDjjj5ubm/O2kJG3bti3Gb+Sk6N9urVixQlL07zOPHj2qsmXLaty4cc5llSpVSjabzflmlilTJucARKdOnXI+Rmx27NihiIgI3bp1Szt37lSlSpVUqVIlbd26VaGhoYqKitL69etVvnx5vfbaa87HfO211/TSSy/pyy+/1N27d3X37l198cUXeumll1SlShUdPXpUFy5ckCR99913Kl68eJw1xHdbPGjt2rU6ePCgy+iZBQoU0K1bt5zfTm/ZskXdunWLcd9nn31Whw8f1rlz5yRFjyRaoUKFhz5eo0aNJEkdO3ZUhw4ddPTo0Tjb3q/j119/lSRt375dAQEBypQpk8vrAbEzq4+1atVKX3/9tfP2/fm+vr4u7dzd3VWhQgXnqK1btmxRhQoV5O7urho1ajgHVjp//rwuXbqk/Pnzx1n7Tz/9pOnTp8swDN2+fVs//PCDypYtG2f7O3fuqHv37ho0aJCKFSvmnF6pUiXnoDehoaHq0KGD9uzZE+P+lSpVcg4Edf36dX399dcP7TtbtmzRyJEj9fLLL2vYsGHy8fHRpUuX4mxfqVIlrV+/XlFRUQoNDdWWLVtUvnx554dJxA/7jZSx33hQXH3MZrOpbNmyWr58uSpWrKhKlSrpgw8+UKVKlR66vJ9//lmdO3dWpUqVNHjwYBUsWFCnTp166OPHtr0kuTwviL+nad/xoId99qlevbo2bNigXLlyKX369MqWLZvWrVun6tWrP3SZnTt31qlTp/T666+rT58+D/3Mkz59euXOndu5vr/++quCg4NVpEgRXstIUziCnYheeukl/f7772rWrJnSpUunTJkyydPTU1L0QFizZ8/WM888o4kTJ0qSqlSpoilTpihdunRq0KCBczkeHh6aPn26c2TJgIAA57eDq1evVnBwsPr06aN+/fpp6NChatiwoaxWqyZPnqz06dPHqKtixYoaOHCgMmXKpKZNm+qbb75RvXr1VKBAgYe+SefMmVOvvfaaQkND1aVLFxUsWFAFCxbUsWPH1LJlS0VFRemFF15Q+/btY9y3VKlSatWqlVq3bq2oqCi1adPG+Q3/2LFj9c477ygiIkJFixbVgAED4qzhYdsiLqNGjXLWfv8b6/un2I4fP15hYWHy8fHR1KlTY9w3S5YsGj16tHr27KmoqCgFBARo/PjxD328/v37q0+fPnJ3d5eXl5dGjhz50PWZMWOGxo0b5xxwZObMmZLifj3gf8zqY49jxIgRGjp0qJYsWaKMGTM6XzcDBgzQ6NGjnZdTGT16tDJkyBDnctq3b6+RI0eqcePGslgsat++vfOnArFZtWqVLly4oKVLl2rRokWSpNq1a6tr1646c+aMmjVrpsjISDVs2FC1atXS/v37Xe7fo0cPjRw5Uo0aNZLdbleXLl3iPEIiRZ/a980336hhw4Zyd3dX3bp1Hzow1KuvvqrTp0+radOmioyMVKNGjVSvXj3Z7XblzJlTr7/+uj755JM4749o7Df+Jzn3Gw9q06ZNrH1Mig4lu3fvVmBgoCIjI3Xz5s1HHvErW7asChQo4DxFuXjx4qpWrZr++OOPWNvXqFEjzu1Vu3ZtvfLKK1q3bp1zMDg82tO073iQh4dHnJ998uXLJ4vFoooVK0qK/mLn+++/V9asWR+6zJ49e2rUqFGaOnWq3NzcNGTIkIe2nzJlikaOHKn58+fL3d1dc+bMkYeHh8t7zP3BEIHUymLEdr4GTPHbb7/pxIkTatWqlQzDUO/evdWiRQt17dr1od/4A4gf+hjSGl7TQOKjnwFITBzBTkT58uXTvHnznKffVa9e/ZGn2iBhJk2apB9//DHG9Pz58zuPCJupf//++vvvv2NMr1ixot577z3THw+xS2t97OzZs87L9fzX0KFDH3nq6eP6+eefNWbMmFjnzZgxw3mpFSSdtPaaTskSc7+R1H0Zjyet9bPEfr0l9WcsILXjCDYAAAAAACZgkDMAAAAAAExAwAYAAAAAwAQEbAAAAAAATEDABgAAAADABARsAAAAAABMQMAGAAAAAMAEBGwAAAAAAExAwAYAAAAAwAQEbAAAAAAATPD/AMjZiieeTlhIAAAAAElFTkSuQmCC\",\n      \"text/plain\": [\n       \"<Figure size 1000x400 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Extracting the model names and the metric values\\n\",\n    \"models = list(by_model_and_context.keys())\\n\",\n    \"metrics = list(by_model_and_context[models[0]].keys())\\n\",\n    \"\\n\",\n    \"# Plotting the bar chart with metric scores on top of each bar\\n\",\n    \"fig, ax = plt.subplots(figsize=(10, 4))\\n\",\n    \"width = 0.2\\n\",\n    \"x = range(len(models))\\n\",\n    \"\\n\",\n    \"for i, metric in enumerate(metrics):\\n\",\n    \"    metric_values = [by_model_and_context[model][metric] for model in models]\\n\",\n    \"    ax.bar([pos + width * i for pos in x], metric_values, width, label=metric)\\n\",\n    \"    # Displaying the metric scores on top of each bar\\n\",\n    \"    for pos, val in zip(x, metric_values):\\n\",\n    \"        ax.text(pos + width * i, val, f'{val:.3f}', ha='center', va='bottom', fontsize=9)\\n\",\n    \"\\n\",\n    \"ax.set_xticks([pos + width for pos in x])\\n\",\n    \"ax.set_xticklabels(models, rotation=0, ha='center', fontsize=8)\\n\",\n    \"ax.set_ylabel('Performance')\\n\",\n    \"ax.set_title('GPT Benchmarks')\\n\",\n    \"ax.legend(loc='upper left', bbox_to_anchor=(1, 1))\\n\",\n    \"\\n\",\n    \"plt.tight_layout()\\n\",\n    \"plt.show()\"\n   ]\n  },\n  {\n   \"attachments\": {},\n   \"cell_type\": \"markdown\",\n   \"id\": \"eeb8c5ba-c22f-4fae-b63c-d13f8c23ade7\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"source\": [\n    \"Our best model is GPT 4 with few shot learning at an f1 score of ~92%. We will see in the [Made With ML course](https://madewithml.com/) how fine-tuning an LLM with a proper training dataset to change the actual weights of the last N layers (as opposed to the hard prompt tuning here) will yield similar/slightly better results to GPT 4 (at a fraction of the model size and inference costs).\\n\",\n    \"\\n\",\n    \"However, the best system might actually be a combination of using these few-shot hard prompt LLMs alongside fine-tuned LLMs. For example, our fine-tuned LLMs in the course will perform well when the test data is similar to the training data (similar distributions of vocabulary, etc.) but may not perform well on out of distribution. Whereas, these hard prompted LLMs, by themselves or augmented with additional context (ex. arXiv plugins in our case), could be used when our primary fine-tuned model is not so confident.\"\n   ]\n  }\n ],\n \"metadata\": {\n  \"kernelspec\": {\n   \"display_name\": \"Python 3 (ipykernel)\",\n   \"language\": \"python\",\n   \"name\": \"python3\"\n  },\n  \"language_info\": {\n   \"codemirror_mode\": {\n    \"name\": \"ipython\",\n    \"version\": 3\n   },\n   \"file_extension\": \".py\",\n   \"mimetype\": \"text/x-python\",\n   \"name\": \"python\",\n   \"nbconvert_exporter\": \"python\",\n   \"pygments_lexer\": \"ipython3\",\n   \"version\": \"3.10.11\"\n  }\n },\n \"nbformat\": 4,\n \"nbformat_minor\": 5\n}\n"
  },
  {
    "path": "notebooks/clear_cell_nums.py",
    "content": "from pathlib import Path\n\nimport nbformat\n\n\ndef clear_execution_numbers(nb_path):\n    with open(nb_path, \"r\", encoding=\"utf-8\") as f:\n        nb = nbformat.read(f, as_version=4)\n    for cell in nb[\"cells\"]:\n        if cell[\"cell_type\"] == \"code\":\n            cell[\"execution_count\"] = None\n            for output in cell[\"outputs\"]:\n                if \"execution_count\" in output:\n                    output[\"execution_count\"] = None\n    with open(nb_path, \"w\", encoding=\"utf-8\") as f:\n        nbformat.write(nb, f)\n\n\nif __name__ == \"__main__\":\n    NOTEBOOK_DIR = Path(__file__).parent\n    notebook_fps = list(NOTEBOOK_DIR.glob(\"**/*.ipynb\"))\n    for fp in notebook_fps:\n        clear_execution_numbers(fp)\n"
  },
  {
    "path": "notebooks/madewithml.ipynb",
    "content": "{\n \"cells\": [\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"acbetMKBt825\"\n   },\n   \"source\": [\n    \"<div align=\\\"center\\\">\\n\",\n    \"<h1><img width=\\\"30\\\" src=\\\"https://madewithml.com/static/images/rounded_logo.png\\\">&nbsp;<a href=\\\"https://madewithml.com/\\\">Made With ML</a></h1>\\n\",\n    \"    <h3>ML for Developers</h3>\\n\",\n    \"    Design · Develop · Deploy · Iterate\\n\",\n    \"</div>\\n\",\n    \"\\n\",\n    \"<br>\\n\",\n    \"\\n\",\n    \"<div align=\\\"center\\\">\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://madewithml.com\\\"><img src=\\\"https://img.shields.io/badge/Subscribe-40K-brightgreen\\\"></a>&nbsp;\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://github.com/GokuMohandas/MadeWithML\\\"><img src=\\\"https://img.shields.io/github/stars/GokuMohandas/MadeWithML.svg?style=social&label=Star\\\"></a>&nbsp;\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://www.linkedin.com/in/goku\\\"><img src=\\\"https://img.shields.io/badge/style--5eba00.svg?label=LinkedIn&logo=linkedin&style=social\\\"></a>&nbsp;\\n\",\n    \"    <a target=\\\"_blank\\\" href=\\\"https://twitter.com/GokuMohandas\\\"><img src=\\\"https://img.shields.io/twitter/follow/GokuMohandas.svg?label=Follow&style=social\\\"></a>\\n\",\n    \"    <br>\\n\",\n    \"    🔥&nbsp; Among the <a href=\\\"https://github.com/GokuMohandas/MadeWithML\\\" target=\\\"_blank\\\">top ML</a> repositories on GitHub\\n\",\n    \"</div>\\n\",\n    \"\\n\",\n    \"<br>\\n\",\n    \"<hr>\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"oh-HuNfDrPg0\"\n   },\n   \"source\": [\n    \"This notebooks contains the code for the 🔢&nbsp; Data and 📈&nbsp; Modeling lessons. After this proof of concept (PoC), we'll be moving all of this code to Python scripts to serve our application to production. Follow the accompanying [lessons](https://madewithml.com/) along with the code here to develop a deeper understanding of all the concepts.\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"XTNsIiUrqoJW\"\n   },\n   \"source\": [\n    \"<div align=\\\"left\\\">\\n\",\n    \"<a target=\\\"_blank\\\" href=\\\"https://madewithml.com/\\\"><img src=\\\"https://img.shields.io/badge/📖 Read-lessons-9cf\\\"></a>&nbsp;\\n\",\n    \"<a href=\\\"https://github.com/GokuMohandas/Made-With-ML/blob/main/notebooks/madewithml.ipynb\\\" role=\\\"button\\\"><img src=\\\"https://img.shields.io/static/v1?label=&amp;message=View%20On%20GitHub&amp;color=586069&amp;logo=github&amp;labelColor=2f363d\\\"></a>&nbsp;\\n\",\n    \"<a href=\\\"https://colab.research.google.com/github/GokuMohandas/Made-With-ML/blob/main/notebooks/madewithml.ipynb\\\"><img src=\\\"https://colab.research.google.com/assets/colab-badge.svg\\\" alt=\\\"Open In Colab\\\"></a>\\n\",\n    \"</div>\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"source\": [\n    \"# 🛠️ Setup\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"We'll be using [Ray](https://ray.io) to develop our application using distributed workloads.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import os\\n\",\n    \"import ray\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import sys; sys.path.append(\\\"..\\\")\\n\",\n    \"import warnings; warnings.filterwarnings(\\\"ignore\\\")\\n\",\n    \"from dotenv import load_dotenv; load_dotenv()\\n\",\n    \"%load_ext autoreload\\n\",\n    \"%autoreload 2\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:26:30,445\\tINFO worker.py:1633 -- Started a local Ray instance. View the dashboard at \\u001b[1m\\u001b[32m127.0.0.1:8265 \\u001b[39m\\u001b[22m\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"afcfdccd644b41d0b7af7f86f68dbdf3\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/html\": [\n       \"<div class=\\\"lm-Widget p-Widget lm-Panel p-Panel jp-Cell-outputWrapper\\\">\\n\",\n       \"    <div style=\\\"margin-left: 50px;display: flex;flex-direction: row;align-items: center\\\">\\n\",\n       \"        <div class=\\\"jp-RenderedHTMLCommon\\\" style=\\\"display: flex; flex-direction: row;\\\">\\n\",\n       \"  <svg viewBox=\\\"0 0 567 224\\\" fill=\\\"none\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\" style=\\\"height: 3em;\\\">\\n\",\n       \"    <g clip-path=\\\"url(#clip0_4338_178347)\\\">\\n\",\n       \"        <path d=\\\"M341.29 165.561H355.29L330.13 129.051C345.63 123.991 354.21 112.051 354.21 94.2307C354.21 71.3707 338.72 58.1807 311.88 58.1807H271V165.561H283.27V131.661H311.8C314.25 131.661 316.71 131.501 319.01 131.351L341.25 165.561H341.29ZM283.29 119.851V70.0007H311.82C331.3 70.0007 342.34 78.2907 342.34 94.5507C342.34 111.271 331.34 119.861 311.82 119.861L283.29 119.851ZM451.4 138.411L463.4 165.561H476.74L428.74 58.1807H416L367.83 165.561H380.83L392.83 138.411H451.4ZM446.19 126.601H398L422 72.1407L446.24 126.601H446.19ZM526.11 128.741L566.91 58.1807H554.35L519.99 114.181L485.17 58.1807H472.44L514.01 129.181V165.541H526.13V128.741H526.11Z\\\" fill=\\\"var(--jp-ui-font-color0)\\\"/>\\n\",\n       \"        <path d=\\\"M82.35 104.44C84.0187 97.8827 87.8248 92.0678 93.1671 87.9146C98.5094 83.7614 105.083 81.5067 111.85 81.5067C118.617 81.5067 125.191 83.7614 130.533 87.9146C135.875 92.0678 139.681 97.8827 141.35 104.44H163.75C164.476 101.562 165.622 98.8057 167.15 96.2605L127.45 56.5605C121.071 60.3522 113.526 61.6823 106.235 60.3005C98.9443 58.9187 92.4094 54.9203 87.8602 49.0574C83.3109 43.1946 81.0609 35.8714 81.5332 28.4656C82.0056 21.0599 85.1679 14.0819 90.4252 8.8446C95.6824 3.60726 102.672 0.471508 110.08 0.0272655C117.487 -0.416977 124.802 1.86091 130.647 6.4324C136.493 11.0039 140.467 17.5539 141.821 24.8501C143.175 32.1463 141.816 39.6859 138 46.0505L177.69 85.7505C182.31 82.9877 187.58 81.4995 192.962 81.4375C198.345 81.3755 203.648 82.742 208.33 85.3976C213.012 88.0532 216.907 91.9029 219.616 96.5544C222.326 101.206 223.753 106.492 223.753 111.875C223.753 117.258 222.326 122.545 219.616 127.197C216.907 131.848 213.012 135.698 208.33 138.353C203.648 141.009 198.345 142.375 192.962 142.313C187.58 142.251 182.31 140.763 177.69 138L138 177.7C141.808 184.071 143.155 191.614 141.79 198.91C140.424 206.205 136.44 212.75 130.585 217.313C124.731 221.875 117.412 224.141 110.004 223.683C102.596 223.226 95.6103 220.077 90.3621 214.828C85.1139 209.58 81.9647 202.595 81.5072 195.187C81.0497 187.779 83.3154 180.459 87.878 174.605C92.4405 168.751 98.9853 164.766 106.281 163.401C113.576 162.035 121.119 163.383 127.49 167.19L167.19 127.49C165.664 124.941 164.518 122.182 163.79 119.3H141.39C139.721 125.858 135.915 131.673 130.573 135.826C125.231 139.98 118.657 142.234 111.89 142.234C105.123 142.234 98.5494 139.98 93.2071 135.826C87.8648 131.673 84.0587 125.858 82.39 119.3H60C58.1878 126.495 53.8086 132.78 47.6863 136.971C41.5641 141.163 34.1211 142.972 26.7579 142.059C19.3947 141.146 12.6191 137.574 7.70605 132.014C2.79302 126.454 0.0813599 119.29 0.0813599 111.87C0.0813599 104.451 2.79302 97.2871 7.70605 91.7272C12.6191 86.1673 19.3947 82.5947 26.7579 81.6817C34.1211 80.7686 41.5641 82.5781 47.6863 86.7696C53.8086 90.9611 58.1878 97.2456 60 104.44H82.35ZM100.86 204.32C103.407 206.868 106.759 208.453 110.345 208.806C113.93 209.159 117.527 208.258 120.522 206.256C123.517 204.254 125.725 201.276 126.771 197.828C127.816 194.38 127.633 190.677 126.253 187.349C124.874 184.021 122.383 181.274 119.205 179.577C116.027 177.88 112.359 177.337 108.826 178.042C105.293 178.746 102.113 180.654 99.8291 183.44C97.5451 186.226 96.2979 189.718 96.3 193.32C96.2985 195.364 96.7006 197.388 97.4831 199.275C98.2656 201.163 99.4132 202.877 100.86 204.32ZM204.32 122.88C206.868 120.333 208.453 116.981 208.806 113.396C209.159 109.811 208.258 106.214 206.256 103.219C204.254 100.223 201.275 98.0151 197.827 96.97C194.38 95.9249 190.676 96.1077 187.348 97.4873C184.02 98.8669 181.274 101.358 179.577 104.536C177.879 107.714 177.337 111.382 178.041 114.915C178.746 118.448 180.653 121.627 183.439 123.911C186.226 126.195 189.717 127.443 193.32 127.44C195.364 127.443 197.388 127.042 199.275 126.259C201.163 125.476 202.878 124.328 204.32 122.88ZM122.88 19.4205C120.333 16.8729 116.981 15.2876 113.395 14.9347C109.81 14.5817 106.213 15.483 103.218 17.4849C100.223 19.4868 98.0146 22.4654 96.9696 25.9131C95.9245 29.3608 96.1073 33.0642 97.4869 36.3922C98.8665 39.7202 101.358 42.4668 104.535 44.1639C107.713 45.861 111.381 46.4036 114.914 45.6992C118.447 44.9949 121.627 43.0871 123.911 40.301C126.195 37.515 127.442 34.0231 127.44 30.4205C127.44 28.3772 127.038 26.3539 126.255 24.4664C125.473 22.5788 124.326 20.8642 122.88 19.4205ZM19.42 100.86C16.8725 103.408 15.2872 106.76 14.9342 110.345C14.5813 113.93 15.4826 117.527 17.4844 120.522C19.4863 123.518 22.4649 125.726 25.9127 126.771C29.3604 127.816 33.0638 127.633 36.3918 126.254C39.7198 124.874 42.4664 122.383 44.1635 119.205C45.8606 116.027 46.4032 112.359 45.6988 108.826C44.9944 105.293 43.0866 102.114 40.3006 99.8296C37.5145 97.5455 34.0227 96.2983 30.42 96.3005C26.2938 96.3018 22.337 97.9421 19.42 100.86ZM100.86 100.86C98.3125 103.408 96.7272 106.76 96.3742 110.345C96.0213 113.93 96.9226 117.527 98.9244 120.522C100.926 123.518 103.905 125.726 107.353 126.771C110.8 127.816 114.504 127.633 117.832 126.254C121.16 124.874 123.906 122.383 125.604 119.205C127.301 116.027 127.843 112.359 127.139 108.826C126.434 105.293 124.527 102.114 121.741 99.8296C118.955 97.5455 115.463 96.2983 111.86 96.3005C109.817 96.299 107.793 96.701 105.905 97.4835C104.018 98.2661 102.303 99.4136 100.86 100.86Z\\\" fill=\\\"#00AEEF\\\"/>\\n\",\n       \"    </g>\\n\",\n       \"    <defs>\\n\",\n       \"        <clipPath id=\\\"clip0_4338_178347\\\">\\n\",\n       \"            <rect width=\\\"566.93\\\" height=\\\"223.75\\\" fill=\\\"white\\\"/>\\n\",\n       \"        </clipPath>\\n\",\n       \"    </defs>\\n\",\n       \"  </svg>\\n\",\n       \"</div>\\n\",\n       \"\\n\",\n       \"        <table class=\\\"jp-RenderedHTMLCommon\\\" style=\\\"border-collapse: collapse;color: var(--jp-ui-font-color1);font-size: var(--jp-ui-font-size1);\\\">\\n\",\n       \"    <tr>\\n\",\n       \"        <td style=\\\"text-align: left\\\"><b>Python version:</b></td>\\n\",\n       \"        <td style=\\\"text-align: left\\\"><b>3.10.11</b></td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"        <td style=\\\"text-align: left\\\"><b>Ray version:</b></td>\\n\",\n       \"        <td style=\\\"text-align: left\\\"><b>2.7.0</b></td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"    <td style=\\\"text-align: left\\\"><b>Dashboard:</b></td>\\n\",\n       \"    <td style=\\\"text-align: left\\\"><b><a href=\\\"http://127.0.0.1:8265\\\" target=\\\"_blank\\\">http://127.0.0.1:8265</a></b></td>\\n\",\n       \"</tr>\\n\",\n       \"\\n\",\n       \"</table>\\n\",\n       \"\\n\",\n       \"    </div>\\n\",\n       \"</div>\\n\"\n      ],\n      \"text/plain\": [\n       \"RayContext(dashboard_url='127.0.0.1:8265', python_version='3.10.11', ray_version='2.7.0', ray_commit='b4bba4717f5ba04ee25580fe8f88eed63ef0c5dc', protocol_version=None)\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Initialize Ray\\n\",\n    \"if ray.is_initialized():\\n\",\n    \"    ray.shutdown()\\n\",\n    \"ray.init()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'memory': 30507458560.0,\\n\",\n       \" 'CPU': 12.0,\\n\",\n       \" 'node:__internal_head__': 1.0,\\n\",\n       \" 'node:127.0.0.1': 1.0,\\n\",\n       \" 'object_store_memory': 2147483648.0}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"ray.cluster_resources()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"These cluster resources only reflect our head node ([m5.2xlarge](https://instances.vantage.sh/aws/ec2/m5.2xlarge)). But recall in our [setup lesson](https://madewithml.com/courses/mlops/setup/) that our [compute configuration](https://madewithml.com/courses/mlops/setup/#compute) that we also added [g4dn.xlarge](https://instances.vantage.sh/aws/ec2/g4dn.xlarge) worker nodes (each has 1 GPU and 4 CPU) to our cluster. But because we set `min_workers=0`, our worker nodes will autoscale ( up to `max_workers`) as they're needed for specific workloads (ex. training). \"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Workers (1 g4dn.xlarge)\\n\",\n    \"num_workers = 1\\n\",\n    \"resources_per_worker={\\\"CPU\\\": 3, \\\"GPU\\\": 1}\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"If you are running this on a local laptop (no GPU), use the CPU count from `ray.cluster_resources()` to set your resources. For example if your machine has 10 CPUs:\\n\",\n    \"\\n\",\n    \"```python\\n\",\n    \"num_workers = 6  # prefer to do a few less than total available CPU (1 for head node + 1 for background tasks)\\n\",\n    \"resources_per_worker={\\\"CPU\\\": 1, \\\"GPU\\\": 0}\\n\",\n    \"```\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"/efs/shared_storage/madewithml/GokuMohandas\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Storage\\n\",\n    \"EFS_DIR = f\\\"/efs/shared_storage/madewithml/{os.environ['GITHUB_USERNAME']}\\\"\\n\",\n    \"print (EFS_DIR)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"# Data\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"source\": [\n    \"## 🔢 Data ingestion\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import pandas as pd\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>id</th>\\n\",\n       \"      <th>created_on</th>\\n\",\n       \"      <th>title</th>\\n\",\n       \"      <th>description</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>2020-02-20 06:43:18</td>\\n\",\n       \"      <td>Comparison between YOLO and RCNN on real world...</td>\\n\",\n       \"      <td>Bringing theory to experiment is cool. We can ...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>2020-02-20 06:47:21</td>\\n\",\n       \"      <td>Show, Infer &amp; Tell: Contextual Inference for C...</td>\\n\",\n       \"      <td>The beauty of the work lies in the way it arch...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>2020-02-24 16:24:45</td>\\n\",\n       \"      <td>Awesome Graph Classification</td>\\n\",\n       \"      <td>A collection of important graph embedding, cla...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>15</td>\\n\",\n       \"      <td>2020-02-28 23:55:26</td>\\n\",\n       \"      <td>Awesome Monte Carlo Tree Search</td>\\n\",\n       \"      <td>A curated list of Monte Carlo tree search pape...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>25</td>\\n\",\n       \"      <td>2020-03-07 23:04:31</td>\\n\",\n       \"      <td>AttentionWalk</td>\\n\",\n       \"      <td>A PyTorch Implementation of \\\"Watch Your Step: ...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   id           created_on                                              title   \\n\",\n       \"0   6  2020-02-20 06:43:18  Comparison between YOLO and RCNN on real world...  \\\\\\n\",\n       \"1   7  2020-02-20 06:47:21  Show, Infer & Tell: Contextual Inference for C...   \\n\",\n       \"2   9  2020-02-24 16:24:45                       Awesome Graph Classification   \\n\",\n       \"3  15  2020-02-28 23:55:26                    Awesome Monte Carlo Tree Search   \\n\",\n       \"4  25  2020-03-07 23:04:31                                      AttentionWalk   \\n\",\n       \"\\n\",\n       \"                                         description              tag  \\n\",\n       \"0  Bringing theory to experiment is cool. We can ...  computer-vision  \\n\",\n       \"1  The beauty of the work lies in the way it arch...  computer-vision  \\n\",\n       \"2  A collection of important graph embedding, cla...            other  \\n\",\n       \"3  A curated list of Monte Carlo tree search pape...            other  \\n\",\n       \"4  A PyTorch Implementation of \\\"Watch Your Step: ...            other  \"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Data ingestion\\n\",\n    \"DATASET_LOC = \\\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\\\"\\n\",\n    \"df = pd.read_csv(DATASET_LOC)\\n\",\n    \"df.head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"source\": [\n    \"## ✂️ Data splitting\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from sklearn.model_selection import train_test_split\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"tag\\n\",\n       \"natural-language-processing    310\\n\",\n       \"computer-vision                285\\n\",\n       \"other                          106\\n\",\n       \"mlops                           63\\n\",\n       \"Name: count, dtype: int64\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Value counts\\n\",\n    \"df.tag.value_counts()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Split dataset\\n\",\n    \"test_size = 0.2\\n\",\n    \"train_df, val_df = train_test_split(df, stratify=df.tag, test_size=test_size, random_state=1234)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"tag\\n\",\n       \"natural-language-processing    248\\n\",\n       \"computer-vision                228\\n\",\n       \"other                           85\\n\",\n       \"mlops                           50\\n\",\n       \"Name: count, dtype: int64\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Train value counts\\n\",\n    \"train_df.tag.value_counts()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"tag\\n\",\n       \"natural-language-processing    248\\n\",\n       \"computer-vision                228\\n\",\n       \"other                           84\\n\",\n       \"mlops                           52\\n\",\n       \"Name: count, dtype: int64\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Validation (adjusted) value counts\\n\",\n    \"val_df.tag.value_counts() * int((1-test_size) / test_size)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"WuCrsbxbNkSV\"\n   },\n   \"source\": [\n    \"## 🔍 Exploratory Data Analysis (EDA)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"eOJ3nlEgnSTJ\"\n   },\n   \"source\": [\n    \"Exploratory data analysis to understand the signals and nuances of our dataset. It's a cyclical process that can be done at various points of our development process (before/after labeling, preprocessing, etc.) depending on how well the problem is defined.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"tHdQmqTBNkSV\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from collections import Counter\\n\",\n    \"import matplotlib.pyplot as plt\\n\",\n    \"import seaborn as sns; sns.set_theme()\\n\",\n    \"import warnings; warnings.filterwarnings(\\\"ignore\\\")\\n\",\n    \"from wordcloud import WordCloud, STOPWORDS\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[('natural-language-processing', 310),\\n\",\n       \" ('computer-vision', 285),\\n\",\n       \" ('other', 106),\\n\",\n       \" ('mlops', 63)]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Most common tags\\n\",\n    \"all_tags = Counter(df.tag)\\n\",\n    \"all_tags.most_common()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"Gl-E8d2HaCsx\",\n    \"outputId\": \"22afb969-0335-42ec-b58b-c36ca1db8bf8\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAA1kAAAEvCAYAAAC35QvGAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAABQkklEQVR4nO3dd1hT598G8DsJhKGggAIuKqIBUVkCalVUqmhbcdtqxW3F/XNVwVkHaBVHlbpaqXu14qx7te5VrSJaN06WgqHKEHLeP3xzagRqiJGA3J/r6lXznPU9yTlJbs5znkgEQRBAREREREREeiE1dAFEREREREQfEoYsIiIiIiIiPWLIIiIiIiIi0iOGLCIiIiIiIj1iyCIiIiIiItIjhiwiIiIiIiI9YsgiIiIiIiLSI4YsIiIiIiIiPWLIIiIiegtBEAxdgtaKU61ERB8qhiwiohJs4cKFcHZ2LtB/Dx48MHTZucTFxcHZ2Rn+/v4a7eqas7OzdVqvUqnE9OnTsXXrVq2XefDgAZydneHn5/efbe/DsWPH0KdPn7fWQ0RE75eRoQsgIiLDcXZ2RmBgoEbbkydPcOLECZibm+OTTz7JtYy5uXlhlWdwM2bMQHR0NKZPn27oUt7q0aNH6Nu3L+zs7AxdChFRiceQRURUggUEBCAgIECj7fTp0zhx4gSsrKwQERFhoMr0Y9euXQAAIyPdPu506XpnZ2eHXbt2wdjYWKdt6kqlUhWpeoiISjKGLCIi+mA5OTkV+jaNjY0Nst38FLV6iIhKAt6TRUREBZKRkYGff/4ZXbp0ga+vL2rVqoX69evj66+/xrFjx/Jc5vbt2xg9ejT8/Pzg7u6Ojh07YteuXdi2bRucnZ2xcOFCrbYtCAI2bNiA9u3bw8PDA35+foiIiEBGRkae8+d1T5ZSqcR3332HwMBAeHh4oG7duujSpQvWrl2rMZ+zszO2bNkCAJgwYQKcnZ0RHR0NAAgJCYGzszPOnDmDoUOHws3NDfXr18eKFSveeg/UgwcP8L///Q/e3t7w8vJCr1698nze/P394ezsjLi4uFzT1PfSzZs3T3ys7tqZkJCgcX/af9Vz8+ZNjBkzBo0bN0bt2rXRqFEjfPPNN7h582auebt37w5nZ2ekpqZi1apVaN26Ndzc3PDxxx8jNDQUjx49ynN/iYhKIl7JIiIirWVmZiIoKAiXL19G+fLl4eXlBYlEgr///ht//PEHjh49isjISDRv3lxc5sKFC/j666+RlpYGFxcXeHh44MqVKxgxYgQ8PDwKtP2xY8di27ZtMDc3R4MGDcTAd/jwYa2Wz8jIQLdu3XD9+nU4ODigUaNGSE9Px9mzZ3HhwgVcvnwZM2fOBAAEBgbi4sWLuH//Pjw8PFClShU4ODhorG/ixIl4+vQpGjdujJs3b8LZ2fk/t//8+XN07doVL168QL169ZCWloZTp07h5MmTmDRpErp161ag50PN2dkZzZs3x4EDB2BmZobmzZvD2tr6P5c5dOgQhg8fjszMTDg7O8PLywt37tzB9u3bsW/fPsyfPx/NmjXLtdyECRNw4MABuLm5wc/PD2fPnkV0dDROnDiBnTt3wsLCQqd9ICL6kDBkERGR1tatW4fLly/jk08+wffffy/e55OTk4Pp06dj3bp1WLt2rRiysrKyEBISgrS0NEyYMAHdu3cHAGRnZ2P69OlYv3691tveu3cvtm3bBgcHB6xevRr29vYAgJiYGPTu3VurdezZswfXr19HYGAgZs+eDYlEAgC4d+8eOnXqhC1btmDw4MGoUqUKIiIiEBISgvv376NTp07o3LlzrvUlJiZi+/btqFKlinj/1sOHD/Pd/j///IMKFSpgy5YtKFeuHIBXIwIOGDAAM2fORJMmTVC5cmWtnxO1gIAAuLq64sCBA7C0tHzrvXRJSUkYNWoUsrKyMHPmTLRv316c9uuvv2LChAkYNWoUdu/enWsgjePHj2PlypWoV68eACA1NRVffPEF4uLisH37dp2DIhHRh4TdBYmISGvGxsZo0qQJRo0apTGQgkwmw5dffgkAGkO8//7777h79y4aNWokBizg1UAUEyZMQNWqVbXetjqQhYSEiAELAGrXro1BgwZptY6kpCQAQIUKFcSABQAODg4IDw/HrFmzUKpUKa1ratasGapUqQIAkEgkGuvMz8SJE8WABQCNGjVCly5dkJWVhc2bN2u97XexceNGvHjxAu3bt9cIWADQqVMntG/fHs+fP88zBH/xxRdiwAKAsmXLok2bNgCA69evv9/CiYiKCYYsIiLSWlBQEJYtW6YxkMI///yDv/76C/v27QPw6uqV2okTJwAALVq0yLUuIyOjPNvzolKpcO7cOchkMjRs2DDX9Ne7J/4XHx8fAMBPP/2E4cOHY8eOHXj69Km4jrZt2761m93rXFxctJ4XAGxtbTUCipr6/qkzZ84UaH26Onv2LACgZcuWeU7/7LPP8q3H3d09V5v6ald6erq+SiQiKtbYXZCIiAokOTkZ69evx6lTp3D79m0xpKiv4rw+7Pnjx48BvLpylBdtu8alpqbi5cuXsLa2hqmpaa7plSpV0mo9Hh4eCA0NxZw5c7B7927s3r0bEokEtWrVQsuWLfHll1+iTJkyWq0LQIHm/a861VfmEhISCrQ+XSUmJv5nPerXRX3l73V57bNMJgOQ/zDyREQlDUMWERFp7fTp0xgwYABevHgBOzs7eHp6wsnJCTVr1kTlypVz3bf08uVLAPn/3pQuv0OVF6lUKn7Rf5tevXohMDAQ+/fvxx9//IGzZ88iJiYGMTExWLlyJdatW4ePPvpI6+0WhImJyX9O1/b3vHJycgq03Te97XlXhyW5XJ5rmjZdIomISjqGLCIi0oogCBg/fjxevHiR50h4sbGxuZZRX8HKbzCI+Ph4rbZtZWUFExMTpKam4vnz57num0pOTi5Q8LCxsUGXLl3QpUsXqFQq/Pnnn5gxYwZiYmKwbNkyhIWFab2uglBfQXqT+vmpWLGi2KYOM3ntV1pa2jvVYWtrizt37uDhw4eoUaNGrun3798H8Op5IiKiguM9WUREpJXk5GTcv38flpaWeY4gp/6tp9e7jDVo0AAA8hxiXRAEHDp0SKttSyQS1K9fHyqVCgcPHsw1/ciRI1qtZ8aMGWjUqJF4TxLw6mqUt7c3Bg4cCEAz+On7qs2dO3c0BgZRU9/P5uvrK7aZm5sDgNgd83UXL17M1VaQWtX3pu3duzfP6bt3785VDxERaY8hi4iItGJhYQFjY2MolUqcO3dOY9q+ffuwaNEiAJoDX7Ro0QKVKlXC0aNHsXbtWrFdEATMnz9fHI1Om4DQs2dPAMCsWbNw69Ytsf3WrVvij/K+TYUKFZCUlIS5c+fin3/+Eduzs7PFYFGnTh2xXd1d7l2vHKkJgoCQkBCNbe/duxebN2+GhYWFRndL9aAaq1at0ujet2LFCsTExORat7or4osXL956b9QXX3wBc3NzbNmyRfzBZbXNmzeLv0X25siDRESkHXYXJCIirZiamqJLly5YvXo1evToAR8fH1haWuLGjRu4c+cOKlWqhJSUFKSlpSEjIwOmpqaQy+WYNWsW+vTpg6lTp2LTpk2oWrUqrl27hrt378LBwQH37t3T6l6khg0bon///li2bBnatWuH+vXrAwBOnTqFWrVqITk5+a3r6Nq1K3bt2oU///wT/v7+cHd3h1wuR2xsLB49eoRq1app/OaWeoj5RYsW4cKFC2jbtq3WIxnmxdHRETdu3ECLFi3g7e2NpKQkXLhwAcbGxpg1a5ZG97wePXpgz5492Lt3L1q1agVnZ2fxuW7bti22bdumsW5ra2tYWlpCqVSiS5cucHBwyPf3suzs7PDdd99h5MiRCAkJwYoVK+Do6Ig7d+7g2rVrMDMzw6xZs7QeUISIiDTxShYREWktNDQUkyZNQvXq1XHp0iX88ccfkMlkGDBgALZu3Yp69epBpVLh999/F5fx9vbGpk2b0Lx5c8THx+PQoUOwsLDADz/8IA5dbmFhodX2R40ahfnz56NWrVo4d+4cYmJi0L59e/z4449aLW9iYoLly5ejf//+sLGxwenTp3Hs2DGYm5tjwIAB+OWXXzRGz+vatSvatWsHAPjjjz/yvIJUEPb29li3bh1q166NY8eO4caNG2jWrBk2btwoPhdqderUwZo1a9C4cWMkJyfj6NGjKFeuHH7++We0bt0617qlUikiIiLg5OSE2NhYHD9+HM+ePcu3loCAAPz6669o3bo1njx5ggMHDkCpVKJTp07YvHmz1sPrExFRbhJBX0M7ERERveHJkydITU1FxYoVYWZmlmv6wIEDcejQISxfvhyNGjUyQIVERET6xytZRET03vz999/47LPP0KNHD2RkZGhMO3z4MI4cOQJra2t4e3sbqEIiIiL945UsIiJ6b7Kzs9G1a1dcunQJZcuWhYeHB0xMTBAXF4dr167B1NQUCxcuhJ+fn6FLJSIi0huGLCIieq9evHiBTZs2YefOnbh//z5evHiB8uXLo0GDBujTpw+cnJwMXSIREZFeMWQRERERERHpEe/JIiIiIiIi0iOGLCIiIiIiIj1iyCIiIiIiItIjI0MXUNQJggCViretERERERGVZFKpBBKJRKt5GbLeQqUS8PTpc0OXQUREREREBmRtXQoymXYhi90FiYiIiIiI9Ighi4iIiIiISI8YsoiIiIiIiPSIIYuIiIiIiEiPGLKIiIiIiIj0iCGLiIiIiIhIjxiyiIiIiIiI9Ighi4iIiIiISI/4Y8SFTCqVQCrV7kfMiN6FSiVApRIMXQYRERFRicOQVYikUgnKljWHTMYLiPT+5eSokJr6gkGLiIiIqJAxZBUiqVQCmUyKH9Yfx8PEZ4Yuhz5glWzLYHDXhpBKJQxZRERERIWsSIWsJ0+eYObMmTh69CgyMzPh4+ODsWPHwsnJCQBw9epVhIWFISYmBtbW1ujVqxd69OghLq9SqRAZGYlffvkFaWlp8PHxwaRJk1ClShVD7VKeHiY+w92HKYYug4iIiIiI3oMi1W9t8ODBiIuLw7Jly/Drr7/C1NQUvXr1Qnp6OlJSUtC7d284ODhg8+bNGDx4MCIiIrB582Zx+UWLFmHdunWYNm0aNmzYAJVKhX79+iErK8uAe0VERERERCVJkbmS9ezZM1SqVAnBwcFQKBQAgEGDBqFt27a4ceMGTp48CWNjY0ydOhVGRkZwcnISA1nHjh2RlZWFqKgojB49Gk2bNgUAzJs3D40bN8a+ffvQunVrA+4dERERERGVFEXmSlaZMmUwZ84cMWA9ffoUK1asgL29PapXr45z587B19cXRkb/5sL69evj7t27SE5OxrVr1/D8+XM0aNBAnG5paQlXV1ecPXu20PeHiIiIiIhKpiJzJet1EydOxKZNmyCXy7F48WKYm5sjPj5eDGBqtra2AIDHjx8jPj4eAFChQoVc86in6crISD9ZlKMKUmHjMUdERERU+IpkyOrZsye+/PJLrF27FoMHD8a6deuQkZEBuVyuMZ+JiQkAIDMzE+np6QCQ5zzPnuk+kp9UKoGVVSmdlycyJEtLM0OXQERERFTiFMmQVb16dQBAWFgY/vrrL6xZswampqa5BrDIzMwEAJibm8PU1BQAkJWVJf5bPY+Zme5fNFUqAUrlC52Xf51MJuWXXipUSmU6cnJUhi6DiIiIqNiztDTTupdQkQlZT58+xcmTJ9GyZUvxviupVIrq1asjMTER9vb2SExM1FhG/djOzg7Z2dlim4ODg8Y8zs7O71Rbdja/pFLxlJOj4vFLREREVMiKzA0bycnJGDlyJE6ePCm2vXz5ErGxsXBycoKPjw/Onz+PnJwccfqpU6fg6OgIGxsbuLi4oHTp0jh9+rQ4XalUIjY2Fj4+PoW6L0REREREVHIVmZClUCjg5+eH6dOn4+zZs7h+/TpCQkKgVCrRq1cvdOzYEf/88w/Gjx+PmzdvIjo6GitWrEBwcDCAV/diBQUFISIiAgcPHsS1a9cwYsQI2NvbIyAgwMB7R0REREREJUWR6S4IAHPnzsWcOXMwYsQIpKWlwdvbG2vXrkXFihUBAD/99BPCwsLQvn17lC9fHmPGjEH79u3F5YcNG4bs7GxMmDABGRkZ8PHxwfLly2FsbGyoXSIiIiIiohJGIgiCYOgiirKcHBWePn2ul3UZGUlhZVUK477fhbsPU/SyTqK8VK1khfD/fYaUlOe8J4uIiIhID6ytS2k98EWR6S5IRERERET0IWDIIiIiIiIi0qMidU8WEX34pFIJpFKJocugEkClEqBSsUc8EREVPoYsIio0UqkEVlZmkEplhi6FSgCVKgcpKekMWkREVOgYsoio0Ly6iiXDnZ0/Iv3JY0OXQx8wM5sKcGz9NaRSCUMWEREVOoYsIip06U8eIz3hnqHLICIiInovOPAFERERERGRHjFkERERERER6RFDFhERERERkR4xZBEREREREekRQxYREREREZEeMWQRERERERHpEUMWERERERGRHjFkERERERER6RFDFhERERERkR4xZBEREREREekRQxYREREREZEeMWQRERERERHpEUMWERERERGRHjFkERERERER6RFDFhERERERkR4xZBEREREREekRQxYREREREZEeMWQRERERERHpUZEKWampqZg0aRL8/Pzg5eWFrl274ty5c+L03r17w9nZWeO/7t27i9MzMzMxZcoUNGjQAJ6enhg1ahSePn1qiF0hIiIiIqISysjQBbxu5MiRSEpKwty5c2FjY4PVq1ejb9++2LJlC6pVq4a///4b3377LZo3by4uY2xsLP7722+/xblz57Bw4ULI5XJMnjwZw4YNw5o1awyxO0REREREVAIVmZAVFxeH48ePY926dahbty4AYOLEiTh69Ch27NiBoKAgPHnyBO7u7ihfvnyu5RMSErB161YsWbIE3t7eAIC5c+eiVatWuHDhAjw9PQt1f4iIiIiIqGQqMiHLysoKy5YtQ506dcQ2iUQCiUQCpVKJv//+GxKJBI6Ojnkuf/78eQBA/fr1xTZHR0fY2dnh7Nmz7xSyjIz006tSJitSvTOpBChqx1xRq4c+fDzmiIjIEIpMyLK0tESTJk002vbu3Yu4uDiMGzcO169fh4WFBaZOnYrjx4/D3NwcrVq1wqBBgyCXy5GQkAArKyuYmJhorMPW1hbx8fE61yWVSmBlVUrn5YkMydLSzNAlEBkUzwEiIjKEIhOy3vTnn38iNDQUAQEBaNq0KcaNG4fMzEy4ubmhd+/euHr1KmbNmoVHjx5h1qxZSE9Ph1wuz7UeExMTZGZm6lyHSiVAqXzxLrsiksmk/MCnQqVUpiMnR2XoMkQ8B6iwFbVzgIiIii9LSzOte0gUyZB14MABjB49Gl5eXoiIiAAATJ06FWPHjkWZMmUAAAqFAsbGxhgxYgTGjBkDU1NTZGVl5VpXZmYmzMze7UtddjY/oKl4yslR8filEo3nABERGUKR66y+Zs0aDB06FM2aNcOSJUvE7n9GRkZiwFKrUaMGACA+Ph729vZITU3NFbQSExNhZ2dXOMUTEREREVGJV6RC1rp16zBt2jR069YNc+fO1ej+1717d4SGhmrMf/nyZRgbG6Nq1aqoW7cuVCqVOAAGANy5cwcJCQnw8fEptH0gIiIiIqKSrch0F7xz5w7Cw8PRokULBAcHIzk5WZxmamqKli1bIjw8HG5ubmjUqBEuX76MWbNmoW/fvihdujRKly6Nzz//HBMmTEB4eDjMzMwwefJk+Pr6wsPDw3A7RkREREREJUqRCVl79+7Fy5cvsX//fuzfv19jWvv27TFz5kxIJBKsXr0a4eHhKF++PHr16oX+/fuL802bNg3h4eEYMmQIAMDPzw8TJkwo1P0gIiIiIqKSTSIIgmDoIoqynBwVnj59rpd1GRlJYWVVCuO+34W7D1P0sk6ivFStZIXw/32GlJTnReqmf/U5ELtyKtIT7hm6HPqAmdk5wLXnpCJ3DhARUfFlbV1K69EFi9Q9WURERERERMUdQxYREREREZEeMWQRERERERHp0TsNfPHy5UsYGxsDAJRKJXbs2AEjIyN89tlnsLCw0EuBRERERERExYlOISszMxOhoaF4/Pgx1q9fj4yMDHTu3Bn37t2DIAhYunQpNmzYAFtbW33XS0REREREVKTp1F1wyZIl2LVrF+zt7QEAO3bsQFxcHL788ktMnToVqampWLx4sV4LJSIiIiIiKg50upK1d+9etGzZEvPmzQMAHD58GGZmZhg3bhzkcjni4uKwe/duvRZKRERERERUHOh0JevBgwdo1KgRAEClUuHs2bOoW7cu5HI5AMDR0RHJycn6q5KIiIiIiKiY0ClklS5dGpmZmQCAixcvIi0tDQ0aNBCnJyUloWzZsnopkIiIiIiIqDjRKWQpFArs3LkTT58+xZo1ayCRSNC0aVMAQHx8PDZt2oSaNWvqs04iIiIiIqJiQaeQFRwcjCtXrqBhw4bYtWsXmjRpAicnJ5w/fx4tWrRAUlISvv76a33XSkREREREVOTpNPBFgwYNsHr1auzYsQP29vbo3r07AMDGxgY+Pj4IDg6Gt7e3XgslIiIiIiIqDnQKWY8ePYKLiws8PDw02qtWrYqoqCg8e/YMp06dQv369fVRIxERERERUbGhU3fBTz75BAcOHMh3+v79+zFw4ECdiyIiIiIiIiqutLqSdf/+fWzbtk18LAgC9u3bh7t37+aaVxAEHDx4EMbGxnorkoiIiIiIqLjQKmRVqlQJe/bswc2bNwEAEokE+/btw759+/Jdpnfv3vqpkIiIiIiIqBjRKmRJpVIsWbIE9+/fhyAI6NOnD/r376/x21ivz1uuXDk4OTnpvVgiIiIiIqKiTuuBLypXrozKlSsDAIYMGYKAgAAoFIr3VhgREREREVFxpNPAF0OGDIGFhQVmzpyJZ8+eie2RkZGYNm0anjx5orcCiYiIiIiIihOdQtbdu3fRqVMnrFy5Evfv3xfbExMTsXbtWnTu3BmJiYl6K5KIiIiIiKi40ClkLVy4ENnZ2Vi9ejVq164ttk+dOhUbNmzA8+fPsXDhQr0VSUREREREVFzoFLLOnj2LHj16wNvbO9c0Dw8PfPXVVzh+/Pg7F0dERERERFTc6BSylEolrKys8p1ua2uL5ORknYsiIiIiIiIqrnQKWVWqVMGxY8fynX7y5ElUrFixwOtNTU3FpEmT4OfnBy8vL3Tt2hXnzp3TWG+HDh3g7u6OVq1a4bffftNYPjMzE1OmTEGDBg3g6emJUaNG4enTpwWug4iIiIiISFc6hazAwEAcPnwY8+bNQ2pqqtiuVCoRGRmJ/fv3IzAwsMDrHTlyJC5cuIC5c+di8+bNqFmzJvr27Yvbt2/j1q1bCA4ORuPGjREdHY3OnTtjzJgxOHnypLj8t99+i2PHjmHhwoVYuXIlbt++jWHDhumyi0RERERERDrR+neyXtenTx+cPHkSS5cuxbJly2BlZQWJRIKUlBSoVCrUq1cP/fv3L9A64+LicPz4caxbtw5169YFAEycOBFHjx7Fjh078OTJEzg7O2PEiBEAACcnJ8TGxuKnn35CgwYNkJCQgK1bt2LJkiXivWJz585Fq1atcOHCBXh6euqyq0RERERERAWi05UsIyMjREVFYebMmWjatClsbGxgaWmJhg0bYurUqYiKioKxsXGB1mllZYVly5ahTp06YptEIoFEIoFSqcS5c+fQoEEDjWXq16+P8+fPQxAEnD9/XmxTc3R0hJ2dHc6ePavLbhIRERERERWYTleygFcBqF27dmjXrp1eCrG0tESTJk002vbu3Yu4uDiMGzcOW7Zsgb29vcZ0W1tbpKenIyUlBQkJCbCysoKJiUmueeLj49+pNiMjnbJoLjKZftZDpK2idswVtXrow8djjoiIDEHnkAUACQkJOHLkCB4+fIiOHTvC3NwcCQkJGr+dpas///wToaGhCAgIQNOmTZGRkQG5XK4xj/pxVlYW0tPTc00HABMTE2RmZupch1QqgZVVKZ2XJzIkS0szQ5dAZFA8B4iIyBB0DlmrVq1CREQEsrKyIJFI0KBBA2RmZmLgwIHo1q0bJkyYoHNRBw4cwOjRo+Hl5YWIiAgAr8JSVlaWxnzqx2ZmZjA1Nc01HXg14qCZme4fsiqVAKXyhc7Lv04mk/IDnwqVUpmOnByVocsQ8RygwlbUzgEiIiq+LC3NtO4hoVPIOnz4MMLDw1GvXj189tlnmDx5MgCgWrVq8PT0xNq1a+Hq6ooOHToUeN1r1qxBWFgYWrVqhe+++068OlWhQgUkJiZqzJuYmAhzc3NYWFjA3t4eqampyMrK0riilZiYCDs7O112U5SdzQ9oKp5yclQ8fqlE4zlARESGoFNn9eXLl8PV1RVRUVEICAgQ2x0cHLBq1SrUrl0b69evL/B6161bh2nTpqFbt26YO3euRljy9vbGmTNnNOY/deoUvLy8IJVKUbduXahUKnEADAC4c+cOEhIS4OPjo8NeEhERERERFZxOIevKlSv4/PPPIZPJck0zMjJC27Ztcffu3QKt886dOwgPD0eLFi0QHByM5ORkJCUlISkpCWlpaejevTsuXbqEiIgI3Lp1C1FRUdizZw/69esHALCzs8Pnn3+OCRMm4PTp07h06RJGjhwJX19feHh46LKbREREREREBabzPVlvjuL3uqysLGRnZxdofXv37sXLly+xf/9+7N+/X2Na+/btMXPmTCxatAizZ8/GypUrUblyZcyePVtjWPdp06YhPDwcQ4YMAQD4+fm9071hREREREREBaVTyFIoFDh8+DCCgoJyTcvJycFvv/2GGjVqFGidAwYMwIABA/5zHj8/P/j5+eU73dzcHNOnT8f06dMLtG0iIiIiIiJ90am7YFBQEI4fP47p06fj1q1bAIAXL17g0qVLGDBgAGJjY/HFF1/otVAiIiIiIqLiQKcrWYGBgbh27RqWL1+OtWvXAoDYRU8QBHTq1AmdOnXSX5VERERERETFhM73ZH3zzTdo2bIldu7cibt370KlUqFy5cpo2bKlxn1SREREREREJYnOIQsA3Nzc4Obmpq9aiIiIiIiIij2tQtb9+/dRrlw5mJmZiY+1IZFIUKpUKVhZWeleIRERERERUTGiVcgKCAjArFmzEBgYCABo0aIFJBKJ1hupVKkS5s2bhzp16uhWJRERERERUTGhVchq164dHBwcNB5rE7IEQYBSqcSJEycwefJkREdH614pERERERFRMaBVyJoxY4bG45kzZxZoI/PmzcOqVasKtAwREREREVFx9E4DXwiCgJiYGDx48AByuRwVK1ZEzZo1c83n5eWFxMTEd9kUERERERFRsaBzyPrzzz8RGhqKe/fuabQ7ODggLCwM3t7eYluTJk3QpEkT3askIiIiIiIqJnQKWbdu3ULfvn3x8uVLtGvXDjVq1EBOTg5u3LiBXbt24euvv0Z0dDQcHR31XS8REREREVGRplPIWrRoEaRSKaKjo6FQKDSm9evXD126dMHSpUsLfO8WERERERFRcSfVZaGTJ0+ia9euuQIWACgUCnTt2hUnTpx45+KIiIiIiIiKG51CllKpROXKlfOdXqVKFaSkpOhcFBERERERUXGlU8iyt7fHpUuX8p3+119/wdbWVueiiIiIiIiIiiudQlbz5s2xdetWbNmyJde0zZs3Y9u2bfD393/n4oiIiIiIiIobnQa+GDRoEA4ePIhx48Zh8eLFqFatGoBXow4+ePAAFSpUwKBBg/RaKBERERERUXGg05UsS0tLbNiwAe3bt0dKSgqOHDmCI0eOICUlBe3atcOmTZtgZWWl71qJiIiIiIiKPJ2uZB04cAA+Pj4IDw9HWFgYUlJSIAgCrK2tIZFI9F0jERERERFRsaHTlazx48dj2bJlAACJRAJra2vY2NgwYBERERERUYmnU8jKyspClSpV9F0LERERERFRsadTyOrYsSPWrFmDhw8f6rseIiIiIiKiYk2ne7KysrLw6NEjNG/eHJUrV4aNjQ1kMpnGPBKJBGvWrNFLkURERERERMWFTiFr06ZN4r/v37+P+/fv55rnXe/PWrp0KY4dO4bVq1eLbRMmTMAvv/yiMV+lSpVw6NAhAIBKpUJkZCR++eUXpKWlwcfHB5MmTWLXRiIiIiIiKjQ6haxr167puw4Na9euxfz58+Ht7a3R/vfff2PAgAEICgoS216/grZo0SKsW7cOM2fOhL29PWbPno1+/fphx44dkMvl77VmIiIiIiIiQMd7st6XhIQEDBgwABEREahatarGNEEQcPPmTdSuXRvly5cX/7O2tgbwqgtjVFQUhg0bhqZNm8LFxQXz5s1DfHw89u3bZ4C9ISIiIiKikkjnkPX8+XMsWLAArVu3hru7O7y8vNCxY0esWLEC2dnZOq3zypUrMDY2xvbt2+Hu7q4x7d69e3jx4gWqVauW57LXrl3D8+fP0aBBA7HN0tISrq6uOHv2rE71EBERERERFZRO3QWfPn2Krl27Ii4uDhYWFnByckJ2djbu3LmD7777Dnv27MGqVasK3EXP398f/v7+eU67fv06AGD16tX4448/IJVK4efnhxEjRsDCwgLx8fEAgAoVKmgsZ2trK07TlZGRfi74yWRF6sIhlQBF7ZgravXQh4/HHBERGYJOIWv+/Pm4d+8exo0bh6+++gpGRq9Wk5WVhRUrVmDu3LlYvHgx/ve//+mt0OvXr0MqlcLW1hZLlizBvXv3MGvWLNy4cQMrV65Eeno6AOQKdiYmJnj27JnO25VKJbCyKvVOtRMZiqWlmaFLIDIongNERGQIOoWsw4cPo3PnzujRo4dGu1wuR//+/XH79m3s2LFDryFr4MCB+Oqrr2BlZQUAUCgUKF++PL744gtcvnwZpqamAF4FPfW/ASAzMxNmZrp/yKpUApTKF+9W/P+TyaT8wKdCpVSmIydHZegyRDwHqLAVtXOAiIiKL0tLM617SOgUstLS0uDi4pLvdHd3d+zevVuXVedLKpWKAUutRo0aAID4+Hixm2BiYiIcHBzEeRITE+Hs7PxO287O5gc0FU85OSoev1Si8RwgIiJD0Kmzeq1atfDHH3/kO/3ChQv/GcJ0MWbMGPTq1Uuj7fLlywCA6tWrw8XFBaVLl8bp06fF6UqlErGxsfDx8dFrLURERERERPnRKWSNHz8e58+fx+TJk/HkyROxPT09HQsXLsT+/fsxceJEqFQqjf/eRcuWLXHy5ElERkbi3r17+P333zFu3Di0bt0aTk5OkMvlCAoKQkREBA4ePIhr165hxIgRsLe3R0BAwDttm4iIiIiISFs6dRccPnw4JBIJNm3ahE2bNsHKygpyuRxJSUlQqVQQBAGdO3fWWEYikSA2NlbnQj/55BPMnz8fy5Ytw48//ggLCwsEBgZi+PDh4jzDhg1DdnY2JkyYgIyMDPj4+GD58uUwNjbWebtEREREREQFoVPIsrOzg52dXa72KlWqvHNBajNnzszV9umnn+LTTz/NdxmZTIZvvvkG33zzjd7qICIiIiIiKgidQtbq1av1XQcREREREdEHgb/SSEREREREpEcMWURERERERHrEkEVERERERKRHDFlERERERER6pFXIio+Pf991EBERERERfRC0ClkdOnTAxo0bxceRkZG4fv36eyuKiIiIiIiouNIqZKWlpSEzM1N8HBkZib///vu9FUVERERERFRcafU7WVWqVMHixYvx+PFjlCpVCgCwf/9+xMXF5buMRCLB4MGD9VMlERERERFRMaFVyBoxYgRGjRqFn3/+GcCrALVv3z7s27cv32UYsoiIiIiIqCTSKmS1aNECv//+O27duoWsrCz06dMHwcHBqF+//vuuj4iIiIiIqFjRKmQBgJWVFby9vQEAPj4+qF+/Pho0aPDeCiMiIiIiIiqOtA5Zr1u9ejUAQBAExMTE4MGDB5DL5ahYsSJq1qyp1wKJiIiIiIiKE51CFgD8+eefCA0Nxb179zTaHRwcEBYWJl71IiIiIiIiKkl0Clm3bt1C37598fLlS7Rr1w41atRATk4Obty4gV27duHrr79GdHQ0HB0d9V0vERERERFRkaZTyFq0aBGkUimio6OhUCg0pvXr1w9dunTB0qVLMXPmTL0USUREREREVFxo9WPEbzp58iS6du2aK2ABgEKhQNeuXXHixIl3Lo6IiIiIiKi40SlkKZVKVK5cOd/pVapUQUpKis5FERERERERFVc6hSx7e3tcunQp3+l//fUXbG1tdS6KiIiIiIiouNIpZDVv3hxbt27Fli1bck3bvHkztm3bBn9//3cujoiIiIiIqLjRaeCLQYMG4eDBgxg3bhwWL16MatWqAXg16uCDBw9QoUIFDBo0SK+FEhERERERFQc6XcmytLTEhg0b0L59e6SkpODIkSM4cuQIUlJS0K5dO2zatAlWVlb6rpWIiIiIiKjI0/nHiG1sbBAeHo6wsDCkpKRAEARYW1tDIpHosz4iIiIiIqJiReeQpSaRSGBtba2PWoiIiIiIiIq9dw5Z78vSpUtx7NgxrF69Wmy7evUqwsLCEBMTA2tra/Tq1Qs9evQQp6tUKkRGRuKXX35BWloafHx8MGnSJFSpUsUQu0BERJQnqVQCqZQ9P+j9U6kEqFSCocsgKnGKZMhau3Yt5s+fD29vb7EtJSUFvXv3hr+/P6ZMmYKLFy9iypQpKFWqFDp27AgAWLRoEdatW4eZM2fC3t4es2fPRr9+/bBjxw7I5XJD7Q4REZFIKpWgrJUZZFKZoUuhEiBHlYPUlHQGLaJCVqRCVkJCAiZPnozTp0+jatWqGtM2bdoEY2NjTJ06FUZGRnByckJcXByWLVuGjh07IisrC1FRURg9ejSaNm0KAJg3bx4aN26Mffv2oXXr1oW/Q0RERG+QSiWQSWVY+vsqPHqWYOhy6ANWsYwdgpv0gFQqYcgiKmRFKmRduXIFxsbG2L59O3744Qc8fPhQnHbu3Dn4+vrCyOjfkuvXr4+lS5ciOTkZjx49wvPnz9GgQQNxuqWlJVxdXXH27FmGLCIiKlIePUtA3JMHhi6DiIjeA51CVmhoKLp06QJ3d3cAwIsXLzBt2jT069cPTk5OOhfj7++f748Yx8fHQ6FQaLTZ2toCAB4/foz4+HgAQIUKFXLNo56mKyMjnUa6z0Um0896iLRV1I65olYPffiK4jFXFGuiDxuPOaLCp1XIGjBgAGrXrg03NzfUrl0bW7ZsQcOGDcWQlZmZia1bt6JNmzbvFLL+S0ZGRq77qkxMTMTtp6enA0Ce8zx79kzn7UqlElhZldJ5eSJDsrQ0M3QJRAbFc4CI5wGRIWgVsrKysrB69Wo8e/YMEokEEokE69evx+PHj1G7dm1UrFgRgvB++/qampoiKytLoy0zMxMAYG5uDlNTU7FW9b/V85iZ6f7molIJUCpf6Lz862QyKd/oqFAplenIyVEZugwRzwEqbEXtHAB4HlDhK4rnAVFxZGlppvWVYa1CVlRUFADg3r17uHTpEkaPHo34+HgsWrQI6enpYvCKiorC7du34eHhARcXF8hk+hs5yd7eHomJiRpt6sd2dnbIzs4W2xwcHDTmcXZ2fqdtZ2fzjYmKp5wcFY9fKtF4DhDxPCAyhAJ10nVwcBAHkBg+fDj+/PNP7Ny5ExMnToQgCLh79y5mzpyJjh07agy/rg8+Pj44f/48cnJyxLZTp07B0dERNjY2cHFxQenSpXH69GlxulKpRGxsLHx8fPRaCxERERERUX60ClknTpyAUqnM1S6RSFC9enV8+umnAICpU6fi/PnzWL9+PYYPH67XQjt27Ih//vkH48ePx82bNxEdHY0VK1YgODgYwKt7sYKCghAREYGDBw/i2rVrGDFiBOzt7REQEKDXWoiIiIiIiPKjVXfBPn36QCKRoHLlyqhduzYkEgkePXqE9PT0XPc7yeVyeHp6wtPTU6+F2tjY4KeffkJYWBjat2+P8uXLY8yYMWjfvr04z7Bhw5CdnY0JEyYgIyMDPj4+WL58OYyNjfVaCxERERERUX60Cll79uzB5cuXxf8EQcD8+fOxYMECVK1aFU5OTpBIJLh37x68vb31EmpmzpyZq83NzQ0bN27MdxmZTIZvvvkG33zzzTtvn4iIiIiISBdahayqVauiatWqCAwMBAC4uLhg8ODBqFChAmJjY8Xg9e233yIsLAyurq7w8PBASEjIey2eiIiIiIioqNHpx4gB4KOPPkJgYCA6duyIp0+f4uOPP8b48eMhlUpx4cIFHD58mCGLiIiIiIhKHJ1Clo+PD8qVKyc+lsvl8PHxgZeXF1xdXfHVV1/prUAiIiIiIqLiRKeQtXr1ao3HpUuXztVGRERERERUEhXod7KIiIiIiIjovzFkERERERER6RFDFhERERERkR4xZBEREREREekRQxYREREREZEeMWQRERERERHpEUMWERERERGRHjFkERERERER6RFDFhERERERkR4xZBEREREREekRQxYREREREZEeMWQRERERERHpEUMWERERERGRHjFkERERERER6ZGRoQsgIiIiopJHKpVAKpUYugwqAVQqASqVUKjbZMgiIiIiokIllUpgVdYMUpnM0KVQCaDKyUFKanqhBi2GLCIiIiIqVFKpBFKZDBcXL8U/jx4buhz6gJWuWAEeA4MhlUoYsoiIiIjow/fPo8dQxsUZugwivePAF0RERERERHpU7EJWQkICnJ2dc/0XHR0NALh69SqCgoLg4eEBf39/rFq1ysAVExERERFRSVLsugteu3YNJiYmOHDgACSSf0eksbCwQEpKCnr37g1/f39MmTIFFy9exJQpU1CqVCl07NjRgFUTEREREVFJUexC1vXr11G1alXY2trmmrZy5UoYGxtj6tSpMDIygpOTE+Li4rBs2TKGLCIiIiIiKhTFrrvg33//DScnpzynnTt3Dr6+vjAy+jc71q9fH3fv3kVycnJhlUhERERERCVYsbySZWVlhW7duuHOnTv46KOPMHDgQPj5+SE+Ph4KhUJjfvUVr8ePH6NcuXI6bdPISD9ZVCYrdpmWirmidswVtXrow1cUj7miWBN92IriMVcUa6IPW2Efc8UqZGVnZ+P27duoXr06QkJCULp0afz222/o378/fv75Z2RkZEAul2ssY2JiAgDIzMzUaZtSqQRWVqXeuXYiQ7C0NDN0CUQGxXOAiOcBEVD450GxCllGRkY4ffo0ZDIZTE1NAQC1a9fGjRs3sHz5cpiamiIrK0tjGXW4Mjc312mbKpUApfLFuxX+/2QyKd/oqFAplenIyVEZugwRzwEqbEXtHAB4HlDh43lApJ/zwNLSTOsrYsUqZAFAqVK5ryrVqFEDx44dg729PRITEzWmqR/b2dnpvM3s7KL1xkSkrZwcFY9fKtF4DhDxPCACCv88KFYdYm/cuAEvLy+cPn1aoz0mJgbVq1eHj48Pzp8/j5ycHHHaqVOn4OjoCBsbm8Iul4iIiIiISqBiFbKcnJxQrVo1TJ06FefOncOtW7cwY8YMXLx4EQMHDkTHjh3xzz//YPz48bh58yaio6OxYsUKBAcHG7p0IiIiIiIqIYpVd0GpVIolS5Zgzpw5GD58OJRKJVxdXfHzzz+Lowr+9NNPCAsLQ/v27VG+fHmMGTMG7du3N3DlRERERERUUhSrkAUA5cqVw4wZM/Kd7ubmho0bNxZiRURERERERP8qVt0FiYiIiIiIijqGLCIiIiIiIj1iyCIiIiIiItIjhiwiIiIiIiI9YsgiIiIiIiLSI4YsIiIiIiIiPWLIIiIiIiIi0iOGLCIiIiIiIj1iyCIiIiIiItIjhiwiIiIiIiI9YsgiIiIiIiLSI4YsIiIiIiIiPWLIIiIiIiIi0iOGLCIiIiIiIj1iyCIiIiIiItIjhiwiIiIiIiI9YsgiIiIiIiLSI4YsIiIiIiIiPWLIIiIiIiIi0iOGLCIiIiIiIj1iyCIiIiIiItIjhiwiIiIiIiI9YsgiIiIiIiLSI4YsIiIiIiIiPfrgQpZKpcKCBQvQuHFjeHh44Ouvv8b9+/cNXRYREREREZUQH1zIWrRoEdatW4dp06Zhw4YNUKlU6NevH7KysgxdGhERERERlQAfVMjKyspCVFQUhg0bhqZNm8LFxQXz5s1DfHw89u3bZ+jyiIiIiIioBPigQta1a9fw/PlzNGjQQGyztLSEq6srzp49a8DKiIiIiIiopDAydAH6FB8fDwCoUKGCRrutra04raCkUgmsrUu9c20AIJG8+v/Yvv7IyVHpZZ1EeZHJXv39pEwZMwiCgYt5jfocqNFpOARVjmGLoQ+aRCoDUPTOAeDf82BUiwHI5nlA75FRMTgPfL4ZCSGb5wG9PxIj/Z0HUqlE63k/qJCVnp4OAJDL5RrtJiYmePbsmU7rlEgkkMm0f0K1Uaa0qV7XR5QfqbRoXqw2LmVp6BKohCiq5wAAWJpZGLoEKiGK8nlgYsnPAyochX0eFN2zTgempq/Cy5uDXGRmZsLMzMwQJRERERERUQnzQYUsdTfBxMREjfbExETY2dkZoiQiIiIiIiphPqiQ5eLigtKlS+P06dNim1KpRGxsLHx8fAxYGRERERERlRQf1D1ZcrkcQUFBiIiIgLW1NSpVqoTZs2fD3t4eAQEBhi6PiIiIiIhKgA8qZAHAsGHDkJ2djQkTJiAjIwM+Pj5Yvnw5jI2NDV0aERERERGVABJBKGqDehIRERERERVfH9Q9WURERERERIbGkEVERERERKRHDFlERERERER6xJBFRERERESkRwxZREREREREesSQRUREREREpEcMWXrGEfGJSFd8/6CSjMc/EX1IGLL0RKlUYsyYMTh37lyhbbN79+7o3r37f84TEhICf3//QqqIirqFCxfC2dnZ0GVQHg4ePIixY8catIaCHh88nkhfbty4ga5du2q0OTs7Y+HChQaqiMgweNx/OIwMXcCH4urVq9i2bRs6duxo6FKI8tW5c2c0btzY0GVQHlasWGHoEgp8fPB4In3Zs2cPLly4YOgyiIj0hiGLqASxt7eHvb29ocugIqqgxwePJyIioryxuyAAf39/LFiwAN999x0+/vhjuLm5oW/fvrh79644zy+//IIOHTrAw8MDbm5uaNu2LXbv3g0AOH36NHr06AEA6NGjh9iFz9/fHyEhIRrbio6OhrOzMx48eADgVXebFi1aIDIyEr6+vmjUqBGePXuGjIwMzJkzBwEBAahduza8vLzQu3dvXL169Z32VZv1hoSEoFevXti8eTNatmyJ2rVro23btvjjjz801nXhwgV069YNHh4eaNq0KVauXIlevXqJ+3z69Gk4Ozvj9OnTGsu92c1R233dsmULPvvsM9SpUwdt2rTByZMn4erqiujoaHGeR48eYeTIkfD19YW7uzt69uyJ2NjYtz4vISEh6N69O3799Vc0a9YMnp6e6NmzJ65duybOEx0dDVdXV/zyyy9o2LAhfH19cfPmTQDArl270KFDB3h6eqJhw4aYNGkSnj17prGNixcvok+fPvDy8kL9+vUxcuRIJCQkiNNTU1MxadIkfPzxx6hTpw6++OILnDx5UmMdx48fxxdffAFPT0/4+Phg4MCBuHXrljj93r17GDBgAOrVqwd3d3d8+eWX+P3338Xpb3bv6t69O8aPH49ly5ahadOmqFOnDrp06YJLly5pbPfIkSPo0KED3Nzc0LJlS+zcuRMtWrQoMl0aBEHAihUr8Omnn8LNzQ0tWrTA8uXLxXs8jh8/jq+++gp169ZFvXr1MGrUKDx+/FhcPjo6GnXq1MG5c+fQsWNH1KlTBy1btsShQ4dw+/Zt9OzZE+7u7mjRogV+++03jeWcnZ3x119/oX379nBzc0NgYCD27NkjzqPNedC9e3ecOXMGZ86c0ZhXm2PC2dkZkZGR4usTGRmZ53M0ceJENGzYEDk5ORrtYWFhqFevHl6+fJnr+Cjo8QS8/VxQv+cdOXIEgYGBqF27Nlq2bImtW7fmWTd9GHJycrB27VoEBgbCzc0NTZs2RUREBDIzM7Fw4ULxuH2zq9Q///yD8ePHw9fXF56enhg2bBiSk5M11n3gwAF06NABderUQcOGDTF9+nS8ePFCnJ7f5yzR++bv74/IyEiEh4ejXr168PT0xKhRo/D8+XMsW7YMfn5+qFu3LoYOHYqUlJQ815GYmIjQ0FA0adIEbm5u6NSpEw4ePKgxj7OzM9asWYOxY8fC09MTH3/8McLCwpCZmSnO87b3c9I/hqz/t2rVKty+fRszZszA9OnTERMTI94fsXbtWkyaNAnNmzfH0qVLERERAblcjtGjRyM+Ph61atXCpEmTAACTJk3C5MmTC7TtR48e4ffff8e8efMQGhqKMmXKYMyYMdi8eTP69++PqKgohIaG4saNGxg1atQ73Rys7XpjYmKwfPlyDBs2DD/88ANkMhmGDh0qfjDdunULvXr1AgDMnTsXQ4cOxbJly3D+/Pn3UtPWrVsREhICLy8vLFq0CC1btsSgQYM0vjA+ffoUXbp0wZUrVzBx4kTMmTMHKpUK3bp10wgi+bl69SrmzZuHIUOGYPbs2UhJSUFQUBASExPFeXJychAVFYWwsDCEhobCyckJixYtwsiRI+Hh4YEFCxZg8ODB2Lt3L7p3746MjAwAQGxsLIKCgpCZmYlZs2ZhypQpiImJQd++fZGdnY3MzEz07NkTBw8exIgRIxAZGQl7e3v069dP/FJ9//59DBo0CLVr18bixYsRFhaGO3fuoH///lCpVFCpVAgODkZ6ejpmzZqFRYsWoWzZshg4cCDi4uLy3e+9e/fi4MGDmDBhAubOnYvk5GQMHTpUfG5PnTqFQYMGoUKFCli4cCG6deuGyZMna4QUQ5s1axZmzZoFf39/LFmyBJ06dUJERASWLVuGrVu3ok+fPqhQoQLmzp2L0NBQXLhwAV9++SWePHkiriM7OxujRo1Cly5dsHjxYpiZmWH06NEYMGAAmjZtiiVLlsDW1hZjx45FfHy8xvaDg4PxySefIDIyEo6Ojhg+fHiBPrwmT54MV1dXuLq6YuPGjahVq5ZWx4TakiVLEBgYiAULFqBly5Z5bqNt27ZITk7WCHsqlQq7d+/G559/DmNjY435dTmetDkXACApKQlTp05Fjx49sGzZMlSuXBljx47V6jyl4mnSpEmYMWMGmjdvjsWLF6Nbt25Ys2YNBg0ahE6dOqFTp04AgI0bN6Jz587icqtWrcLLly/x/fffY9SoUTh06BCmTp0qTt+xYwcGDx6MatWq4YcffsCQIUOwfft2DBo0SOMzLa/PWaLCEBUVhcePH2PevHkYOHAgdu7ciY4dO+LYsWOYNm0aRo4ciYMHD2LBggW5lk1OTkanTp1w7tw5jBgxAgsXLkSlSpUwePBgbN++XWPe77//Hk+ePMH8+fPRr18/bNy4Ufweq+v3A3pHAgnNmjUTmjVrJmRnZ4ttCxcuFBQKhfD06VNhxowZwuzZszWWiYmJERQKhbBz505BEATh1KlTgkKhEE6dOqWx3rFjx2ost3nzZkGhUAj3798XBEEQFixYICgUCuHs2bPiPJmZmUKfPn2E3377TWPZqKgoQaFQCImJiYIgCEJQUJAQFBT0n/s2duxYoVmzZgVa79ixYwWFQiHExcWJ85w5c0ZQKBTCnj17BEEQhG+++UZo2LCh8OLFC3GeP//8U1AoFOI+5/WcvFm3tjU1bdpUCA4O1phn6dKlgkKhEDZv3iwIgiDMnTtXqFOnjvDgwQON5/KTTz4Rhg4d+tbn6c3XISEhQahTp4742qtfu61bt4rzpKamCrVr1xYmTpyosb6zZ88KCoVCWLNmjSAIgjB06FChYcOGQkZGhsbz1axZMyE2NlbYuHGjoFAohIsXL4rTVSqV0K1bN6FDhw6CIAjCzp07BYVCIcTHx4vz/PXXX8LcuXOFtLQ0ITExUVAoFML27dvF6UqlUggPDxeuX78uCMK/x5taUFCQ4O7uLqSlpYltW7ZsERQKhXD58mVBEAThq6++Etq0aSOoVCpxHnUtCxYs+M/ntTA8e/ZMcHV1FcLCwjTap02bJvTt21do2LCh0KdPH41pcXFxQq1atYTvvvtOEIR/X9t169aJ8/z222+CQqEQ5s+fL7ZdvnxZUCgUwv79+zWWi4yMFOdRqVRC27Zthc6dOwuCoN15kNdjbY4JQRAEhUIh9OzZ863Pk0qlEpo1ayaEhoaKbSdOnNDYxuvHR0GPJ23PBfUyJ06cEOd5+PChoFAohOXLl791P6j4uXHjhqBQKISlS5dqtG/dulVQKBTCkSNHcr03CcKrY1t9HqmNHj1a8PHxEQTh1THt5+cn9O3bV2Me9XF9+PBhQRDy/pwlKgzNmjUTGjduLLx8+VJsa9WqleDp6SkolUqxLTg4WGjTpo0gCILGZ+usWbOEWrVqaXyvEQRB6Nmzp9CwYUMhJydHXCYgIEBjOz///LOgUCiEmzdvavV+TvrHK1n/r06dOpDJZOJj9X0G6enpCAkJwejRo6FUKnHx4kVs27YNa9euBQBkZWXpZfs1a9YU/y2Xy7F8+XJ89tlnSEhIwKlTp7BhwwYcPnw4322qVCpkZ2eL/73ZJaig67W2toaDg4P4+PXnA3h1dcPPzw9mZmbiPJ6enqhUqVKB9lubmuLi4vDo0SO0atVKY9nPP/9c4/HJkydRs2ZN2NnZic+DVCqFn58fTpw4AeDVlaj8nqfKlSvD29tbfGxrawtPT0+cPXtWYzuvv1YXL15EVlYWWrdurTGPt7c3KlWqhDNnzgAAzp8/Dz8/P5iYmGg8X4cOHULNmjVx8uRJlC9fHrVq1dKorVmzZoiJicGzZ8/g7u4OExMTdOrUCWFhYTh69ChcXFwwYsQIlC5dGuXKlUP16tUxceJEjB07Fjt27IBKpUJoaChq1KiR72tQvXp1lC5dWnxsZ2cH4NVrnZWVhQsXLiAgIAASiUScp1WrVjAyKhq3dF68eBHZ2dkICAjQaJ8wYQJCQ0ORlJSU6/VxcHCAp6en+PqoeXp6iv+2sbEBALi7u4ttZcuWBfBqNNHXtW/fXvy3RCJBixYtcOnSJY2rNwWlzTGh9voxCUDjGM/OzoZKpYJEIkGbNm1w4MAB8Vz/7bffULVqVY19VCvo8aTtuaDm4eEh/lv9/vJ6Fy/6cKhf+zffsz///HPIZLJcXWlfV7duXY3HlStXFs+/27dvIz4+Hv7+/hrHu4+PD0qXLo3jx49rLPvmeUJUGNzc3DQ+L8uVKwdHR0dYWFiIbWXLlkVaWlquZc+cOZPnd6s2bdogKSkJt2/fFtsCAwM1tqPu1XD27Fmdvx/Quyka35KKgNfDAgBIpa/yp0qlwr179zBp0iScPHkSxsbGqFatGlxcXADo73c9SpUqpfH46NGjCA8Px+3bt1GqVCm4uLjA3Nw8322OGzcOW7ZsER9XqlQJhw4dyjWftut98/lQf8FWqVQAXnXNU38JfV25cuW02t+C1PT06VMAyLW9N7eVmpqKuLg41KpVK8/tpKeno3///hpf9nx9fbF69WoA/4aL19nY2ODKlSsaberaAIhfdPPa73LlyolvmqmpqXk+X6/XnpSUlG/tSUlJqF69OtasWYNly5bh119/xapVq2BpaYmvvvoKw4cPh0QiQVRUFBYvXoz9+/dj69atMDY2RvPmzTFlypR8u8f817GfmpqKnJycXLXLZDIxcBhaamoqgFd/GMhvWn6vz5v3670eNtXefH7yYmtrq/HYxsYGgiDkCmMFoc0xoX5NXz8mAeRaZsiQIRg6dCjatm2LxYsX4+jRo2jcuDH27duHnj175rn+gh5P2p4Laq8/r+pjTl/vp1S0qI+N8uXLa7QbGRnBysoKaWlp+Z5nbx7bUqlUPE7U5/eUKVMwZcqUXMu+3tUbyP05S1QY8vpcefO4zs+zZ89QpUqVXO3q99nXP2Pe/A6j/tx+9uyZzt8P6N0wZL2FIAjo378/jI2N8euvv6JmzZowMjLCzZs3sW3btrcu/+YVJW3+Unvv3j0MHjxYvAesSpUqkEgkWLt2LY4ePZrnMkOGDEG3bt3Ex3K5XC/rzY+9vX2um48B4MmTJ6hWrRqA3MFM7fnz5+KHnTY1qf/K/fr9M3k9trCwgK+vL8aMGZNnzXK5HFOmTMHz58/Fttc/dPO66TQ5Ofk/w5H6jSk5OVncb7WkpCTxzdHCwkIMi6/7/fffUbNmTVhYWKBq1aqIiIjIczuVK1cGAHFgg6ysLJw/fx4bN27EkiVL4OLigk8//RR2dnb49ttvMXnyZFy7dg179uzBjz/+CCsrqwLfKwi8epM2NjbO9VqrA1hRYGlpCeBV8H/9NXj06BH+/vtvAMjzWE1KSoKVlZVeakhNTdUIF8nJyWIQ1eY8yIu2x0Refv31V43H6hDo6OgINzc37N69G1KpFEqlEm3atMl3PQU5nrQ9F6jkUR8bSUlJGn+Rf/nyJVJSUnQ+D9Xn/pgxY+Dr65vvdomKqzJlyiApKSlXu7rt9XPnze8w6s899R8g9f39gN6O3QXfIiUlBXfu3EGnTp1Qp04d8VKseqQ99Ren17saqpUuXTrXDfLaDAwRExODzMxM9O/fHw4ODuKXNHXoyOuvvZUrV0adOnXE//L6gVBd1psfHx8fHD16VGPkmtjYWHHURODfv968/hw8e/ZM4+Z2bWqyt7eHg4MD9u/fr1HDvn37NB77+vrizp07cHR01Hgutm3bhl9//RUymQzVqlXTmPb6l8G7d+9q1JaQkIALFy6gQYMG+T4P7u7ukMvl2Llzp0b7uXPn8OjRI3h5eQF41WXq+PHjGl0yY2Nj0b9/f1y5cgW+vr54/PgxbGxsNOo7fvw4fvrpJ8hkMqxYsQLNmjVDVlYW5HI5GjRogGnTpgF4FSguXLiAjz/+GJcuXYJEIkHNmjUxYsQIKBQKPHr0KN99+C8ymQxeXl65RjI6dOgQsrOzdVqnvrm5ucHY2FjsYqoWFRWFBQsWoHz58rlen/v37+PixYvi6/OuDhw4IP5bEATs27cPdevWhVwu1+o8AP69mqOmzTGRn9fnr1OnjsZfONu2bYujR4/it99+g5eXV77hp6DHk7bnApU86gD0+sic6sc5OTmoW7duruNfG9WqVYONjQ0ePHiQ63ifM2eOViPLEhVlPj4+uHDhAh4+fKjRvn37dpQvXx4fffSR2PZm76W9e/dCIpGgfv367+X7Ab0dr2S9hbW1NSpVqoS1a9fC3t4elpaWOHr0KFatWgXg33uU1H1rjxw5gjJlysDFxQXNmjXD0qVLsXTpUri7u+PQoUM4derUW7dZq1YtGBkZYfbs2ejTpw+ysrIQHR2NI0eOAND9vgV9rnfAgAHYtWsX+vXrhz59+kCpVOL777+HVCoVg5KzszMqVKiAH374AaVLl4ZEIsHSpUs1uoVoU5NEIsGwYcMwevRoTJ48GS1atMC1a9fwww8/APj3y2mvXr2wbds29OrVC3369IGVlRV27dqFTZs2ITQ09K37JAgCBgwYgBEjRkAmkyEyMhJlypTRGG7+TWXLlkX//v3xww8/wNjYGM2aNcODBw/w/fffo3r16uK9OoMGDcKXX36J4OBg9OjRAxkZGZg/fz7c3NzQsGFDZGdnY82aNejduzcGDBiAChUq4MSJE/jxxx8RFBQEY2Nj1K9fHxERERg8eDCCgoIgk8mwYcMGyOVyNGvWDJUqVYKpqSnGjBmDoUOHoly5cjhx4gSuXr0q/sSALoYNG4bu3btj2LBh6NSpEx49eoTvv/8eADTu0zIUa2tr9OjRAytWrIBcLoevry/++usvrF+/HmPGjIGFhQVCQ0MxatQotGnTBikpKeJr27t3b73UMGvWLGRmZsLR0RG//PILbt26hZUrVwLQ7jwAXv1V/sKFC+JPE3To0OGtx4QuPvvsM8ycORO7du36z79eurq6Fuh40vZcoJJH/fovWLAA6enp8PHxwdWrVxEZGYl69eqhcePGuHfvHgBg586dcHd31+rKp0wmw4gRIzBp0iTIZDI0a9YMSqUSixYtQkJCQr5dbYmKi969e2P79u3o1asXhgwZgrJly2Lr1q04deoUwsPDNf44cfHiRYwePRpt27bFtWvXsHDhQnzxxReoUqUKbG1t38v3A/pvDFlaWLRoEcLCwhASEgK5XI7q1atj8eLFCA8Px7lz59C9e3fUqFEDrVu3Fru57dy5E8HBwXj69CmWL1+Oly9fomnTpggLC8PAgQP/c3sfffQR5syZg8jISAwcOBBlypSBh4cHVq9eje7du+PcuXN5Xql6G32u96OPPsLy5csxa9YsDBs2DDY2NggODsbixYvFLlAymQwLFixAeHg4Ro4ciXLlyqFnz564ffs27ty5U6CaAgMD8eLFCyxfvhybN29GjRo1MH78eIwfP17s22xnZ4cNGzZgzpw5+Pbbb5GZmYmqVasiLCxMHB74v1SsWBF9+vRBeHg40tPT8fHHH2Px4sVvvfdI/Ya1Zs0abNy4EWXLlkWrVq0wfPhwsTZXV1esXr0ac+bMwfDhw1G6dGk0adIEo0ePhlwuh1wux9q1azFnzhzMnj0baWlpqFSpEkaNGoU+ffoAAFxcXLBkyRL88MMPGDlyJHJyclC7dm1ERUWJV+SioqIwZ84chIWFQalUomrVqpg6dSo6dOig1euaF29vbyxcuBDff/89Bg0ahEqVKmHixIkYMWJEkbnH4ZtvvoGNjQ02bNiAn376CZUrV8bEiRPRpUsXAK+6hS5duhSDBw9G6dKl0bhxY4wcOTLXPSK6+vbbb7F06VLcv38frq6uiIqKEgdR0eY8AIBu3bohJiYGX3/9NWbMmIHAwMC3HhO6sLa2RqNGjXD8+PFcg8m8zsTEpMDHkzbnApVMYWFh+Oijj7B582b8+OOPsLW1RY8ePTBo0CBIpVIEBARg27ZtCAkJQadOnfDtt99qtd7OnTujVKlS+Omnn7Bx40aYm5vDy8sLERER7KJKxV758uWxfv16zJkzB9OnT8fLly/h4uKCRYsW4ZNPPtGYt2fPnkhISMCQIUNgZWWFAQMGIDg4GIBu7+f07iQC7zQmHagHAXl9ND6lUomPP/4YY8aM0ftfRnbu3AlXV1eN7n1HjhxBcHAwtm3bJg5EoquQkBCcOXMmz8FCSrqDBw/C3t5e46/CN27cQOvWrfN8oy9JoqOjERoaioMHD/7nPVJERETvi7OzszjAERUdvJJFOrly5QoWLFiAkSNHolatWkhNTcXPP/8MCwuLXEM468P27dsxb948DB8+HBUqVEBcXBwWLFgAX1/fdw5Y9N+OHTuGXbt2YfTo0XB0dERCQgIWL16MatWqoVGjRoYuj4iIiKjIYcginajvn1q/fj0eP34Mc3Nz+Pr6YsaMGXkOpf2uvvvuO7Hb1NOnT1GuXDm0atUKw4YN0/u2SNPYsWNhamqKxYsXIzExEWXLlkXjxo0xatQojd/9IiIiIqJX2F2QiIiIiIhIjziEOxERERERkR4xZBEREREREekRQxYREREREZEeMWQRERERERHpEUMWERERERGRHjFkERERERER6RFDFhERERERkR4xZBEREREREenR/wFyXvZmb5uXgwAAAABJRU5ErkJggg==\",\n      \"text/plain\": [\n       \"<Figure size 1000x300 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Plot tag frequencies\\n\",\n    \"tags, tag_counts = zip(*all_tags.most_common())\\n\",\n    \"plt.figure(figsize=(10, 3))\\n\",\n    \"ax = sns.barplot(x=list(tags), y=list(tag_counts))\\n\",\n    \"ax.set_xticklabels(tags, rotation=0, fontsize=12)\\n\",\n    \"plt.title(\\\"Tag distribution\\\", fontsize=16)\\n\",\n    \"plt.ylabel(\\\"# of projects\\\", fontsize=14)\\n\",\n    \"plt.show()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"pfjVstecaFC5\"\n   },\n   \"source\": [\n    \"> We'll address the [data imbalance](https://madewithml.com/courses/mlops/baselines#data-imbalance) after splitting into our train split and prior to training our model.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\",\n     \"height\": 335,\n     \"referenced_widgets\": [\n      \"af9c5bab12c64dc396c28154ea13f516\",\n      \"7d1b4a63fa924fa6b136204ce1e67a42\",\n      \"795b443fc1834645937b199e1214fcc3\",\n      \"ccc7456ad5484dd2b7ccdd62bbc27d0c\",\n      \"53f5b6e055864bb19eadba0aa640668d\",\n      \"8a9678ac8f3e4af49c02181ce0eb6241\",\n      \"8c6ffc9537344c709b47a5acea0e3075\"\n     ]\n    },\n    \"id\": \"NgMGuIQrNkSV\",\n    \"outputId\": \"0e58055f-0482-4ae0-f6cf-e2a8c2a8552c\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"<matplotlib.image.AxesImage at 0x31f668c10>\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    },\n    {\n     \"data\": {\n      \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAAZUAAAD7CAYAAACi0gmlAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAA9hAAAPYQGoP6dpAAEAAElEQVR4nOz9d5wl13nfCX9PxZvv7Zx7enICBjMABoEACIAgwQBSDMrJkixbtuTsV9baft910sdJ9tperbT2ylagZJHKYgIIAgQJgMjAYDA5z3TOffO9levsH3Xndvd090x3z4Dk7ju/P4C51VXnnDpVdZ7zpN8jpJSS27iN27iN27iNWwDlez2A27iN27iN2/h/D24Lldu4jdu4jdu4ZbgtVG7jNm7jNm7jluG2ULmN27iN27iNW4bbQuU2buM2buM2bhluC5XbuI3buI3buGW4LVRu4zZu4zZu45bhtlC5jdu4jdu4jVuG20LlNm7jNm7jNm4ZtPWeKIRYcUxRIJtRUBRYyIdcPeV7laOvawliehqJxPVquH5t1fMEAoSClAEgMLQEQegRhO53d8DvI7SETuiHhG6w7LhiqIR+COH//xIpCF1H+v6NX1RFYAz2ILRo7xU6Ht747OrXCQGCdc+rkkkiLQfp+escNKjZNEG1Dn5w4/M3gURWJ91uIBRBZc6hVvTel36aEFGfvhvi1td/T0KAqiv4btg8ppsKsZRGZeEWfcNCoKWyqGYMGQR4lSLSf5/nYz3D0vQV41BjCWQYELrO5htWVPRMDsIQr1xY87T1ELCsW6hci5gp+NgTcT76RIJCIeD/928K7Nqu09ut8q3v2Jtt9iYgaM9spzWzjao1h67FuTL1nVUFRczIEjMyFKqjKEKlM7eHijVLqTb2PRj3rUdyIEe8K401U6E2VkRLGghV4FVdkv1Z6pNlAttHSxrIUBI6PmpMj86pOCiGipY0cIsWiq6iGBp+zYHvQzkkDD1amFUFQokSjxFaNggQhgGhRDoOSiqBdD2k76N1d+BPzyI9HyWZQDouUkqEoQMgrej9VeIxun/lr6C1pAFwrkwy+S9/C+msXFy0tizC1PEm5tY1br2jBW82v26hIjSN1MN3UXvjJHpVQVE0XLeKHzgoQkU3kgS+i6rquG4ViUQIBZDRcxOCMFx7UdQMhXs/3YOiCMJAcvnd4vsuVISAXLdJvehtSKgkcjqDd2Y58/J885iZ0mgbiFPJu7fkPY11D5DevpfAtggci/DyOfzvA6GS2r6X2uVzhN6iANHSWULXuSmhoug6qe170RJp5l59DsLNb1w2LVTu3GfwkccSvPSqxc/8WBohIs3lr/10ZlWhku0yKc2s76Y1Q0HRxIZeNIAwDFgoX2KmcJrdAx8jm+xH02LMFc8R09OkEl3U7QUGOg4TN3O01LYyOvMmQtHobt1PZ24XpdoEs8WztGV20JoewvEqTOdPYuppOnK7UISGG9QZnXljQ2P7bkJPGqQGc1RHC8Q6U7Ts76Y6WsCv5UkPteEWbPS0SWZ7O7GOFPkTk6S2tBJrSzL5wnkyuzoQAgqnpsnt6ybRnWHmtSs4C/Xv9a0thyKI7d5OUCwTej5qNo2Wy+JOz4LnYWwdxD5zASWXQe/rxh0Zxy+WMfp7CObzaB1tqLksSszEL5ZR00nUTIrqa0cgWP+7p3W2kP34BxC6Ru2tU7ij06QePID0A7zpBfy5AonD+xCmQeWbb6LEYyTu3UvlxSMAJO7eg5pJgh9QffUYxrY+jMFu/Nk89XfPkXr4LpRkHL2rFSEUUoku/NAlleymXp9HNxIEgYcVLJDNDKJpMcLAx/Oj56WpBqpqMjnzbkM7XwkhoG0gzjtfnmLsVBmIfm89lOOdr0xx8ONdLIxZ9O9Nk+uNUZi0SeZ0Js9Vae2NkeuNUSt4zI/WufhmgQd/pI9Uq8HMpRpvfWmSbffkaO2Lk+uKsTBu8d6zM+x6sJWth3K8940ZmHZItxvc/0N9aJpCqs3gz/7lGbbf18LO+1tBSo49N0s17/LwTwwwdDDHwB0ZXv6DUXRT4e6nunGtkJFjJSSw/d4Wdj3UilX2OfaNGTRT4eBHu1B1Bc8O+PbvjhD6q0sfoekkB7dTnxyhdvls83h65x3E+7bglYuUTx/FaO0gObQLoen41RKVcyeI9w9RGz6P0HQS/Vupj1wkMbCNeO8WvEqR4om30NMtJAe3IXQTpCT/7iskeodIbt0NYUD53HHc/Bwt9z6MlszgFuYpnXyHeN8Qbfc+Qrx3EHtqjPLZYyQGd5Ac2knl3Am8Uh5FN8neeS96Joc1NU718hnS2/ditHQgDIPa8AXqIxfI3fUARks7fq1M8fhbhI6NNTFMcsvOdb/3a2HTPpXBfo0z512+8S2ruTOYXwjoaFPo3pHkyV/cRiyloZkKiazG4U/3oJsKyZyOHlMwEirxjIYRVzESKnseacNMqgglEkCpFh3NUIhnNOIZDUUTxNMaiVx0fFUIga7GySR6EEKhXJ8iE+9GV+MkYm0IBHUnz2zpHPnqCCMzrxHKAFXRKVZHGZ19m5b0FjKJXtqzO7ky/QqOV6M1sw3TyKCpMYanXyUV6yBmZDc7de87KsN5Fo5N0X53P6ktrdSnyljTleg5KQI9ZRBrT5Ha2opiqBjpGG6hjlOoE+tMo+gqlct5hKaS292JljJQzdX3H6qpkuhMLB4QEGuJIdRFc6lQBfH2OMnuJMmuJGbGAAGKppDsTpJqHNcTkaaQ7EqS7E6S6Iij6ErUZs4k1ZMk3Zsi1d04N5QEpTKxfTshDDGHBlCzKYSmIgwdf26eoFDCL1dQW7JonW0gJUJVEDETra2FoFACKdHbW/Fm5pGOixIzNjTf/kIZ+/wo9ffOY52+goiZqK0Zqm+cwDpzBb9YofbGCbzJOWJ3bMebWSC0HBRTR+g6elcbtTdP4S+USD5wJ7Gdg9TfPYeaTpK8bz9aS4baa8cJKnWQEolEESquWyWZ7ERTYxh6EsNIoaoGjlPG8y2C0EXXEyAEdWthTYEC4DkhL39+lDs/3Mmn/uFOurYliaU0OoaiZ9s+kCDVahDP6BSnbRLZ6P/b723Bc0LqRQ+nHtDWH0cocPybs7z+p+Mc+GgnigKZDpNMh8mrfzTGiRdmkaFk+GiRWtElkY3ereqCy2t/NE6t6HL2lQUAZi7WePtLk0xdqLLzgVaqeZfjz80yfrrMi783gl31qS64jBwvkWrVQUTrx77H23nlD8eYvlBl9wfayHaatA8mePF3R8h0mLQPxNecC0XXQVHwK6XmMaO1g+SWncy/9gLS90kMbkfPtIAQLLzxLWLd/QhNw2zrQkvnMFva0VMZFDNGeucdFE+8jZbKEu8eRI3F0bOtlM8eo/De6xCGJLfuwpoaoXjyHdziPFKGVM6fpPDe66S27QEE1vgVnPwchXdfo3LhFADW5Ah+pYyaSAKQGNiKUFTmX/smif4hYp29xHu2UBu7RPnMeyT6hlAMk9rweQrH3kDPtqEl0xt632+ETWsqC4WAw4dMdm/XMQzB9iGdT3wkwdGTLpkOk3hWI9tl0tIbI9VqkMwZZDpM9j/eQTXvouoKSInvS2Yv17jjiU6sks/UxSpDB3MsjNVp60/QOhBHhpL8hEXX1iRGQuXCmwXGG7uppVCESkt6CwCXJ1/GDyzmSxfozO3CDz3KtUmkDAlDHxmGBKGHIjT8wMbxKgShQxD66FqCIHTxAwc/sImbOTzfwnKL+KETmRwUffOzvg4ITcMY6MOdnEY669Tw2tuiRUrUibUnqU+WqQznaT3QA0BttIj0A8y2JJXhBbTGIl6frqAYKoHtY89VUQ2VzK4OFo5OMP/uOGYujpNfXUsZ+tAW9nxmJy/845ewCzaqoXL4b9/D0f9xjOpUFYBEW5z7/8Fh6gsWMggJA8nJPzxNrMXk/n9wmOLlIp7lM/7aBDPvzfLkf3mC8dcmMFI6E29NMfH6JP0P9dN1Vyfdh7oY/c4Yoy+PMfPeLH6hjDc5Q1CuYB0/g9bZRpAvgiIQihoJEUPHm52PFvKYifQD1Ewad3wKvbeL0HYIZuYJa3W82QXkRn0WYYj0/Og6PwApCSp1wkodFIX4/m3oPe2o6QTeTCHyuyzRhIJSlbBuE9ouRiaB1pEjvm8roe0QOi6hZRPUbKTjIQmZz59dcyjV2nTz36piIFMhlp3HcVd+L0shBOQnLZ753y+y95F29jzczpV3C9F3CsTSGkLQECA+MgDPDlE0Qb3kIRSwqz5mb5zOrUnuerKTuZE6ue5Y0x87N1zDrvrIhivE90ICb1FbUDTB0F1ZKgseZ16aw4irHPx4F4oiyHabWOXoWs+J3qGrlgwJ+G7YdHUZcRXPCXGqPlbFp2NIQQiYH7Owqz5W2UePqWs/Ts+DMERP53DmpqKxmTEC1yZ0bQK7jhqLE1h1vHKB0LUj05NQqI9fIbV1NwD18csohomRayO9Yz+hE5nSFE3HKxcJrFrTP5J/52VSO/aTvfMw1YunCew6rfc8jLswi5FtRSiC0I38gKHvIYPIbCoDHxkumlAVM05g1wldh8C2UeMJ/HqVoF5FBgFShmjpLC0HH8RZmMVs64y+k1uITQuVo8dddgzp/J1fyLJnp87/9qutjIz7/ObvVWnd30695LPv0XaqeY+z35mnYyhBS2+M4rRNS2+cwAs58515dt7fSr3kMXupxsiJEkiYHa4RT0VazNTZCkIVtPTEiGU08mMWhUlr1TGFoc9s8SzT+ZPNY6X6BB0tu6lZc1hO5IDyA4dUvIPBzgeYmD8a7f6WaMJ1J0860c3W7odRVZ254nlUxVhXBEL60YepvPTKZqe1CRGPkbzvXoJvfht/PUJFgLltCCWZpPLtl6lPV5pO45lXrjRPm3rxUvPf80fGV23KLS7Ob/H0zNpdqoKuAx3MHJul+1AXw98aWfNcK2/x3m8fR4tp3PET+9Dj0as3f3qB9373OH598cMI3IC3f+MIXXd1svWJIUZfHuPi05eYeW8GI2Xw9q8faZ4bVqpYJ6JF1puawZtaOd6wVME+ea75/GpvvLvYV6G07Fy3Ul3zHtaElIQ1m8Q9e5C2i1+sLP5NgBIzUeImoesjFIEx1IO5rQ+hqtiXJ1jqBPBmiwS1yCckPR93ZJrYrkHSHzwY+XY24C8IQpdieXhd58ZSGnd9rItMh4luKFx5r0h+wiLdbvDYz22htTfG5ehmuXYQ134WmhmZr/KTNtW8u/p5Ag59opsd97fQMZSgmvfQDMGDP9LP+JkKsWQvJ16YJZnTCQNJ4IY4tegdce2AdLvJYz+7hdf+ZJxUq8FdH+2iZ2eKgx/r5sKbeaoLLh/8mS1ohsKldwp4drjuuZO+R230EplddxLvG8KvFKkOn0cGAe0PPoFimJTOvBdpKte0aU2OkN1/N6Fj48xOgRBUR86DIgCBXylhtLRf7al5XXLrbrRkBtUwUQyD0HPRkmm84gJ+vdqcPLe4QOs9D1Mfv0Lt8lkyu+8iuWUXgVXDr5axZ8bJ3Xkf7Q9+GKGqOLNTmG1dy8YphNJoO0/oWEgZomdayOy+C6O9i2ytQvnccaS3uaAHsd56KqtFf8VMQWuLQiqp4PmSQjFEmho7Hmjj9ItzPPJTg0ycLtOxNUkiqzN7pU5Lr4lnhQgFdFOlNGNz4oVZDn28m+KMw9SFKoc+0U3oh5TnHCZOV9BMhWx3jH0fbGd+tM7x52dZGFspWNSG9hA0HZICVdHY3vsYE/PvUbPnmpOqq5H66/p1VEVHyoBQhmhqDD+wURUdTTUIZYjv2wihIIRKEDroahw/dJAyXNK5ippN0/nXf46Z3/i/ooXGsqOdsq4jwxChaQhFIfTcaEerqghdRwgR7SI8L3p5FIESj6MkEviFQjPaR5gGMojaQYB0veaOV5gmSiKODALCcqU5JqEooCgIRYl2NW5jbhQFYeiRM1eADEKk664qOBU0FKFy9Q2QgC8dskMZ9v7QHoZfGGHbk0O8/h/eQtEVPvArDyzTVJKdCT7wKw8gdIEQgql3pjj9Z+dI96Z45H99CLtg41ZdTn3xDHOn5vn07z/FN/7eCww9Poie1Dn5hdPIQJLuS3Hv37qHb//Tl9bzyqKgoYr17cJCQgK53BGrJOP0/4e/ty5HPZqKmowTOm4UAGAahPXItyhMPdKQwjDSZoIQJRlrzLkHQiBtF6FHzxWhoBgaMgwJ6w5KItaMLgurFoThyv5vEkKJIrE0XSEMJVbZx3dDUm1GFNUpwa75qJpCGEiEAjKMBIhnByiqQIaRtuHZQUMYRO1W5l2MuApIXGtx7Imcjm4qyFBSL0cCI9WiE/gSGUpqBY9YWkMzlIaGEuDUAoQCyZZoXNW8i6oJ4lkdVRW4VohV8dBNlVhKJQzAqngIAXpMxSr7xDMarhUs05JWTohAjSUQmoYMAgK7jqIbKLrR+G0hGt9X6Dqo8QSBY0MYosaTkbZqR9q9YpgohgkS/HoVoSgIVV3mWG/2FYbRQh9KtGQqWjeEwK9VlrUVei6hY0fX6XqjPwsZ+NExVSX0PELXbp4PoOhmNN5ENEYhBL5VQzTuF0VB+h6Bba26Fryv0V+93Sq5rMK5ix6T09HC1tOlMtgvePMrkcr43P8Z7W3ES/PR+ET0bcgQDn2ii4tvFprRGq/+8Xjzby/81pUV/SWyOu9+bYowhJae2KpCJbgmuiVmpOluvZNyfbopUACkDJeFGy+NEPMDq3ls6XEpQ5DRi+8FK/s2tw2ReewRtPY22n7qR0FC/s++RFitkf3YhwktC629DTWbofrKG1hnzhG/Yy/Juw9GQsd1KH/rZdzRcbTWVlo+80n0/j5mf/O38OeiKJe2n/4x/Pk8WksOJZnAuTxM6dlvIjSN7EefILZ3F9aJ05SeeS6aswP7SRw8gHRd1GyGoFyh9Ow38YslknffRWzvbpSYidHfh3XyNMWvPktYX2nm2pN+kIHE/ugBApKQF+Z+h7bdbWimRqIjTrwtTqY/TXVm9TDu6kyVo//jOKEfcO8v3U12IEMYhEy+NcWx3z2Ot0RTUQ2VB3/5PhRN4a1fP4IMNh7OI1DYkT7M1sTBdZ0/54xwqvwiTri+YAQ1k4hMeXUnilABglpjwRcKoeOCpiJUBYIwCgUWItIeBQSFyspGpURNJ1HSCZREDKGp0TVBQOj4hHUL/KAprG4KqoKaS6Pl0pHQUgRhEGI7HkGpQiArQEj1mhBdj+UCzbVWmgqFrmGpaZRcAmEaxHsVpOcTVGowk4dGxFt9leiy4vRyrdwqr4yOkyHLxuW7ksrc8nG6VrBibL7rr9nminswdETaQE0lEHETQ402JzIIIr9bLYafLxM2rAiBtfjeBNbyb+DayCwZhJH5SlXR2rKomWiehKYiPZ+wUsebLeBXV5osr20rsOtwzetwbf9oAr2zI7oXQ4ssM270PvmFCsgQGdIUXDeLTQuVew+a7Nqhc2m4TND46NMphV/+21l++Odml53bFG5y8d/DR0tYFX9RLZOrCsYmRo6X6NqWJPAlc8Pr+/Btt8zw9KsbuKvNw7lwiUKpRMdf+xnmfuv3mjcjDANhGmiJOKWvPx8tNkEAQYBzZQR3ZIzQssk88Sjx/XtxR8fx5xfI/+lf0vLDn13Rj5pJk//zL6PEYnT8/E9Tff1tgkKB4le/TrpURkkml52vdbSR/+O/xF9YIPcDn8DcugV54RKxndupvvwa3vQMuc9+ivqJ06sKlKW4qq1KCZqpkR3I4FQczIyJXXDIbcutKVSuImy8K0IV0Pjmr33svhPwyr9+nX0/sofWXS1UJiubChMVrK5h3woY/Z2IuIE/X0JNJlBSkebhzxYwetvx5kv4CyX0zhaCSh29uxU1GcebLeDN5AlKi/Ok5lLE9m4ltmsQvbcDrS2HmkuhmHqkxXg+Yd0hKJRxJ+ewjl2gfvTcDYWLmkmSfvxelGSM0HIoP/cmYc1CbUmTfvQeYnuHIl9PNoVQVaTvE9ZsvOl5nItjVF89jjs6fd0+lkFRMHcOkLr/DsxtfWjtOZRkHKGrhJaLP5fHvjiOtFc350rXp/buWdzLE8uOpx4+iDHY1TgJCn/2wrpCsYWpk3rkEHpnCwD+fJHKy0eR9tpmHa2zhfgd2zG39aH3tEfPIp1YDDf3PMKajZ8v4wxPYh09h3X6yqIFYD1QBMaWHpL33UFs1yBaRwtqKo4wNELHw58v4lwaJ6yu/j3KIMQ6fhH7zMrN97X3n7xvP/E7d2IMdqG1ZVHiJoSS0HbwCxW8iVmsExepvXWKsHZrUkE2LVRMU+B5silQAIrlgJbc+swNhamN3YBTCxg9cX1n44oxKkl2pu4jpbUuOx4SMFo/ybR9cd1tGUqcOzOPoyvLo0YkkpHacaadtdsSQmBfuERQXG6/1zJpkofvRm1pQWvN4Vxe2ydxFfa5C4TlCmG5gvR81HSKoLB2spI7NoE3M4u0bYJCETWdujqo6EO5upv2NhaDb2ZNVFPl3F+cpzxeYeDhfjKDGVRDJdmV4MFfuQ/f8hl/fZLJNydJtCd46J88gAwlxcslKuMVEh0Jug918eiWh/Ftn0vfuML4qxNIP8SzPEZeGuXgzx9g+sg0TjnSaGWwftOPlCFhI8GV5n8X/3UzAkcGIXpLBr09R1izEDETggAtk0Brz+EXq4DA3NqDn6+gJEwAlGQs8pkAKArJw3vJfuJh9O42lFQCoawck1BVlJiJ1prB2NZH4uAuYvu2UvizbxEU1v4mlFSCzIfvQ2vPEVRq2KevENZtWn/q48T2DKEYy4NNhGqgmAZaa4bYrkESd+9h/ne/in36+osXRNpJ6oN3k33qIfTO1oYPgebmSkmYGEO9GEO9a857ULPw5oorhEry3r0k7tsfmYnDkOKXXlyfUDF0Ug8eIL5vKwD2+VGqb5xcVagIQyfzxGFSj96N3tGCiJurjlNoKko8htaew9zRT/LwPiovHqH4pZfWJ1gUheT9+8l99nGMnvYovwoW5ylmYAx0YQx0rTlPoecT1u3rChW1LUvbj3+U+IGdKKn48rZUUHUNNZ3EHOgifmAn8YO7Kfzx83iT68uzuh42LVQmp3w+/Gicuw+YTEz56Lrghz+d5Ojxm8jqvMVQhEpKayVndC07LqWkpM8xa18hZH2RPnElTbu5ZcWDllIyrTZCaq+zm5bO8hdZxGO0fPZTVF55A+vp50jefy96Z/saVy8itJaY3qSEGyyMkZ8kXHK+QlCt4lweJvuxDxOUylhnzmFfHr5h30tRm61x5L8eRTaCAcZeHUe8JpCh5Lm//02aprIwso9/65++tKjpNI45ZZdn/uY3Fsfa8BU8/Te+ARKKV0q89M9faZq/KpNVXvoXy4MghCqi7/GaTHZJyIXq24zUT6ArMQwljqHE0JUYMSVJb3wXcTWzoXteCvv8KPaFseg+l6rYVx0QjfGUnn978b0QROde/R1GzmO9rwM1GUdKSWg5hDWL0HIWs/41DTWdQM0kEaqKmkqQfuxeCCXzn//aujLshaGTfOAO9P4u4vu3QRjiFyuElXpzgRYxAzWXRombCE1D7+uk/ed+gNnf+BPckanrtp984A7afvJjiEY4dlCoYF8Yw7k0FmlHmRTmjgFiO/pRs9HGRkqJdFzCmk3oeoSlKmHl+pru+wXp+YiYid7TjmJEPtCgbhPWLKTtNiMChaGhZpKNDYCClkuT+/SjhDWb0tM3DtCJ37GN9p//THOTEZZr2JfGcS6MEZSrqKkExrY+YjsGUFszkSCVEulGGpJ0PcK6RVBc21Sl93fS/rOfIrZ3qGFyDfEb0YjNZ23ojfuIoyRiJA/vQ8ulmf+dr9zwWd8ImxYqx065vHvc4e/9QhbLCTF0gWVLfu3/KN7UgL4bEEKQUNNoiom7Tht6Vu+44c42sq8K1NYWgnIF/LV3U0JVEYaBNzOLMAxiO7YRlDemiW0WQigoqRR+voA3ORV9HC05/PmF9Tcir3HaLfkdJZVJtKRB+939OPk6lZE8fnXlDjH0V2oeS49d609Z9ltAarAFr+pgz61cjCQhTlhf4SfRhEFW77opoRIFQa2MhFphww2Xz9G1cC6N41wcQ+tsxTk3gnNlEndsGm96gbBaRwYhSjKOua2P1MMHSd63H8XQESIyC5W/9TbulckbDlfoOukP3t1kIKi+eoz626dxhqcIytWIlqQtS/zATrJPPhCZ94RA72kj9chBClPza+7E1WyKls8+HplWAG8mz8Lnv0b9xMXlAk9VSX3gTlp/5CNo7bnI+X9xnNLXXsGfLxIUyrfGX7QZSEn9ndOkHr4L6XjYF8dwrkzgjU7jzRUJa9FmTs2miO0cIP34vcTv3NnULDMfuZ/amyfx54trdqEk47T80BMoiUgL8ktVFj7/NPV3Ti/XvFSFxIGdtP2Vp9C72wDwpuYp/OkLeHMFgkJlTdOYkoiR+4EPEts7hFAUgppF7Z3T1N48hXtlIsp1QqDlUpGp8uGDJA7sROgasZ0DtHzuQ8z9tz8jtDavHGxaqFRrkt/9wwovvmLTklNwPcnImM9CfvORKe0dCluGVGLxKPzuKubnAs6dWSdH0jqRUDPowsBlvUKl64bnhNUa1snTtP3o5wiqNYpffjqKAFsF0nFwLg/T8pmnCCpV/HyhaTJIPXg/sTv2YG4ZpPWHPo07NkHlO6+t2a85tIXk/fdibt0CqoLW1rIY1rzCUSXRWlvQ2lpwLl4mtCz0nm5SDx6m9M0XmxQltwJ6JkZqSwuV4TxCUeh6eCuKrlA6N0dmWxtqXKc6WiA11EpgeTgFCyEg0ZOhdH4ONa6jaAp+3UOogsz2dhaOToAqaNnfjT1bRTFU9EyMWHuK0rnZpub0/xT4+TL5P34ehMCbmkeu8jGHlTrWsQu4w1MocZPE3XsQQkQ283v2rk+oKAKRiCHDkNJXX6H09KvNhbI5lpk8lRfeIqzUaPvpp9BaMwhVJbZrC1pbFm9qftW24wd2onVEfgspJaVnX6N+9NzKE4Mgopnpbif3mUejCKtMkqBSw5uYXXn+dxnuxCzzv/1lgnINf7awqhAN8mVqb57CGZ6i6x/8BOaWnihyKpsktm8r1ZePrtl+bPcW9N6OpvZR+fY71N48sZIvLgipHzuP9vUW2v7KU6AI1HSS0HHxxtYO8QdI3LuX5OH9UbSn71N+7k1Kz7y6Qgj5C5HPz74wRsdf+wzxu3ZGm+27dxM/tJvaa8fXP3HXYNNCRRGQTCpYtsSbjwRJNqMSjymMT25MACgq/MBn4/z1X0yiaWLFOvjStx3+7b+8+V18KAMECkII4moWQ4lTC4rruFKQXWJCW9rO8g5Cis88F9mqJYR2FFJc+NLTyGtoP6TnU/za16PILykj9bshVGpH3qV+7HgjVA5kGEWcLPzBH0cmkQZmfvO/R+YtIXBnZqLwYQkgCR0Xd2IK69SZ5sdRfiEKxY3fuQ/puFTfOgJhSMyySdx1RxTSuNFJve6sQWqolZb5GoVT02R3d3Dxfx5BIKgaGi37uuh+ZBulC/OYrQnS29pwizZOsU7/J/bilWxkKFF0hdp4iZnXhxn85D4Kp2dwixaF09N03r+F1jt6mPjm+e8LgaKYGqEfNKK8RCOkWyAbkUcrWFelbAoFM2vSeagXK283zYNXUZ2uEZSqFL/0EomDu6ARjWTuHlz32KSUWMfOU37ujRUCpYlQYh27gHX3JVIPH4y0ld521Fx6baFyx/ZmBJy0HGpvnlp7DJ6PfW6EoFhBa82i97QT2zmwwo/yPUEo1+U/gkgAl55+lY5f/MFIwOsaxlAPXE+o7BpEMSPzoHRcam+dWpuANJTY50fx5wro3W2ouRTxAzuxT19e08wudI3cpx5pMkLYF8cp/uW3r+t/ChZK5L/4DXr3bYsiw1SF7McepP7OmY0FHyzBpoXK1iGNf/iLWQb7NPbtMbhw2WP3Dp2vPlvn7/6TDZhRgFhM8GM/meC5r9t8/as2tfryWbPqt2axKHrTpLV2dGGiKTpJLUfBu7H9MKakiCmLUVV5d4I2Y2D1k32f8Bqzl3RXjzaRnr/sgTcD4Vxv1Qd6bWa9tBe1CmkFq75rS4WZbDjj/dk54nfsI/XgYQhCjP5e3ImpNbWqzUICC0fGGX/2LFrSwCs5hE5AZlcHnYcHcCtOpKLbPqEbRE54AYqqMP/2GOmtrVFOhBrlaCR7swR2gHQDfNsndEMkEHgBsfYk1bHi95R9WcsmSO8fwF2oEDoe0guQUhLf2ol1ZRYlpqOl4ngLlegce/kzlqFENVSMlE4sa5LpTyMUgZW3OP/0FUI/xB2dws+X0RuagZZJrXt80nGpvnGSoHT9BM/QcnDHZqKNjqGjJuOomcSa52tt2aZhwZ8r3nAxCio1gqqF1ppF0TW0thxC19bP2Px9AufKBGGlHvG2KQpqau05AlBz6aZjPihUbmhiCi0bv1hB725DNMKPhWmsGb0WP7gLrTMKSpJSUv7G6+uaU3dyDufSGPG9WxFCoLXnMAa7cC6unhx9I2xaqOzfbTCfD/k//nuef/aPWviVf7HAhx6J09218SZVJdp4ffMbDufPvX8vlhVUSao5ILL9ZvQOhHUOyfVNdhm9rcH4GqHkza0tVP4fAHdqhsqLr6B3tiOB2rvHcMcnr+sD2lQ/RYv8iWgXHjg+c+9ELNDWdJn5oxOEXkDp3CxO3qI+UWzs7AWKqeEWLerTZWQgUXSV0PExWxNMv3yRwA2aPo3S6RlKp2fQkhvj63o/YLSnMbqzaC3JKLy4UCX0AhRDI7G9Gy0diyjsUzH8irVCqPi2z8KFAl7Nw8wYzJ3N07YjR2WqRng16i2UUahyR0tzh0wjF+ZG8OeLEYvyOuRuUKpGC1IjQkyJNxIwrzUjNMawGIQRcMMO5PL8AaEqNww4+X6E9PzIuZ5JLj4LRay5sRG6umSewuvnUMASv13j+obmu9ZV8Tu2R7lNQFit46xX+5MSd3SG+N4oSk4xDYz+74FQUTXB3HzA1EyAZYXU6pKnn6vzh7/Vya/9+sbaCgKYmQnp7lY4e3pDBLEbghfaOKGNoSQQQkRCBXHDbyyjRecBBNKnvi6T2fcxggB3dAx39P2l+g8sj9p4FEYt/ZDqcB4Ar+xcl/5lLdSnVppA7fmGg37+exM1tBTW6DzOTKmZ4EgYsSM0w6Ab5kxEVJvlWoReSGUi0iLsYrSLrc9ZBF7QXKclrMjoF+LG7zBAUKziXycEeSmk5y9fHPU1lgopCar1qHSAEKiZVNM0txaUeKzp1JcNipsN8619PyCUSO+acV+N/lvt9JodZcgrCmoyHgmh60AxIy0RGvNku2tqgcI0MHo7msLZz5cRihIltt4IqkK4NHdIUyPta5PYtFAZG/fobI8KdA2P+/yrf9yClHDq7Pr4YmIxuPf+aHepCMHIFZ+/+XdTDG3XuHzJx3MXH8zcbHhLHPWq0Ch7s6QbeStprRVV6I1chtUhEKT1NkSD0LnmFwjl5oMRlkITBoaSQFcMVKEvE1xe6OCGdTx560O0VTRMNYmuxFCFhkBBEuCHHk5Yxw2tZdrbrTYoKWiYagJDxFAVDUFE4RHKAF+6uKGFE1q3tufr7CBvFaQXRALgZqBGC4GSjEdRXrqKtpRux4jCizeD0LLX9qWsimu1kpWHAOyzIyTu2gWqQG3NENsxQP3dNUgvVQVzqAetJYq8C6sW7tT8+0I9c7MQmho9h0QMYWgRPZKmRr5PRUFryaDEzHW3Z1+eIPXIQUTMRMmmiO0ajIq+rdp5lGCrdUXRX9Lx8MZn1hS+aks6SjRtCBVjsJv+//QPNnbDV7terzBaA5sWKifPelwZ9SmXQz7/xSpPfSSOogi+8uz6dozZnMLf+YeLlMsyjDSUJz++8mZef8Xl3JmbpxBQhUbBm6aPPUC0uKX1NvLu2mqiqSQxlWTzYVX8PEsj0zYDU0nQbg7SavSRVHPEGgu8goJE4ocuVlil5hcoulPMOMM44c3vxAUqrUYPXbFtZLR24o2wagWFQAa4oUUtKFBwp5mxL1MLoqTKkODqBvumoKDSbg7SZvSR1tqIa5lIsKEikQTSwwkt6n6JojfNnDNK1V9A3qRwUeI62YODVM9O4xW+9xrNalAySeL7tmJu7UPrbIn8DckYwjSiwI9GkqrQ1KZTfKOQfvC+aAT1t0+RfeohtGwKIQS5zz6Gv1BaNd8htnsLqcfuiXwoUuJNzOJc/P4qjqd1thDbMxQJv44W1JYMStxEMY2IvkVVouehNYT9OmEdv4C/UEbvbUcIQfYTD+NNzGGfW5n0bAz2kPnEQyhmFMgTFMrUj6+dYB2VUVjUEG+KSUKIxaTMTWBTQuXDj8Z5+XWbhXxIX4/KxJTPf/3djS368/Mhv/x3ius6t77EUZ/sy7Dthw8soQyJomwCy+P0f7t+4SxFaJTc5TuDjN55XaESV9MYSqzZV9Vf2PTiKlBoM/rZmjxIRu9AE8aKhy8AQ41jqHGyeged5hDd8Z0M195jzhm9of9nLegixlDyLnrju4gpqRX9akJBU3TiWppWo4+e+E4uVt5ixrmML11uVmtIqDl2pg7TavRhKLFlPiqI7lsRKroSI6nmaDP76Y3vZqJ+luH6sU3f99W2E4PtuAu17zuhInSVxN17yH7sA+i9HdFuU1lizpLN/yz5vUmE8n3RCLyZPOWvv0rLD38EFIG5rY/OX/oh6scv4JwfI6zbKOlElKV/aDdaV2sU8Wg7lJ597bq5Hd9NCFMn/eg9ZD50L2pbrplPsvgsVj6Hq2a/9SDIlyl+9WU6/vpnkIqC3ttOx9/4HPXjF7DPjhBW6ijJGOb2fhKHdqP3d0brWxBSfOaV62a7C0NfZnaUYdjws238hYm4yTb/nmxKqPzqP2nhkz8xzUJe8oXf6uRHfn6WmdmN7YACH8ZGF6/RtNX9xLq+3Mdi5+uMPn2Wnke24lYcimdmSfSkSfTcOJFNFRqetKkHRZJaFD3ToncxfJ1rEmq0m4aImbfml9CV9au8S/vuj+9nZ+pwZOq6NjN/ycMXS8SWphi06D2ks21crh1ltH5iBZvujaCLGHszD9ET2xm1vgorADQcgQhUoZFSW9iffQyzkiCUfmNR33jdBYGg3Rxkd/pBkmrLqh/g0v6v/l9FI6nm2Jm+n7TexrnKa+sme1w+AEFiWwfWeB41tmnFfBl0AwxDEAZg23JNf6tuRFVZ1/IRClMn+8lHyH78A5GJhUib8ItV/GIVb2qeYL5IUK4R1Bv1VAKf1h/6MMZg9y25l1sCKSk//xYiHiPz2D0omST6QBfZ/k742JLJURqMskGIv1Ci8OffovbW6Rs7rDcNEWkV64CaS9HyIx8h9dBdzcCD0HHxi1WCYgVvah5/oURQqUVsB46HiJu0fPbxJrfYelB77ThqNkX2Yw+iZlNo3W1kulrJPHHf4klX5ymU+IUypa+/RuXbR647TzIIl5l3reMXmfu//mKD5s5r2tskNvWVqUuu0nVx02YRXYdP/ECcE8c8Ll9cLlk+9lScsVGf996NFtLA8ildmGfLD+zjyl+exClYFC/McegfP37DfhTUKDnLm2sKlaSaQxX6qgu1QBBXM2iiEfcd1LCDKqayMSeWgsZAfD87U/ejKouTF8oQO6hQ8RdwwhqB9FHQMJQYKa2NpJaNKOeFQBcmO1OHEcBw7di66WUECltTd9MT27VsQQ9lSD0oUfbmGj4UiSZ0EmqGtN4eUZuIGFtTd1O7CZNfq9HPnvRDJLVc85iUknpQouLncYM6gfQQQsVQTBJqjrTejiKUppDrjm0nJOB85Q3ccKMficSaKEAg8a3N1Ye4Fh0dCg9+wOTcWY+Ljfc1ZgpKJUmuRcG2JbYlGRhQmZsLqdck8bhAUaBcXvzwE4f2kPvkwxEtvpT4xQrVV45RP3IG5/LE6uGgmkr24w/dkvu4lQjrNsUvvwRBSO5Tj0TmraDBu6Y0SDHLNt5sHufSOLU3TkTRSe+bQGkkfBrrWOI0lfRj95J66K6IokVK3Ik5qq+8R/3IGdzJuVWj67TOVsJPbOxZSM+n/Ozr4Ae0/OCHUBKxxgIuQWmQelbtiFTy8gS1N09F5rEbLPLScZflsIl4o9TC9yBMe9Nbt1sZAGiYgh/+8QSzMxUuX2M23LFLY+9+rSlUriJ/bIo7/vZDOIU6RjZG+VL+xmMWkc+i7M/RI6MMUlXRSapZyv7KxC5NGCS0Rf4dJ6zhhDWUddbouIqO2CBDyYPN6ySSMAwYtU4wbV/GCsp4oYMkRCDQhEFcTdNuDrIleQBDxBsLrMJQ4i6csMaEtUrG8ipoNwboi+1adiwIPSbsc0xYZ6n5RXzpARIFFVNNkNbaGEzcSZvRT0xNYirxZqDCRhBTUpGG0hAoUkp86TBeP8u0c2nZfUM036aSpNXoYXvqMGYjSk8RKt3mdireAqP1kxs2hcX7Wknv7aV2eRZrZGM5VKthfj4kkRRMT4dkswqPPGpy8oSH6wYMDKrs3q3x539qMbRVw7F9Mhm4406Njk6VP/vjOrYNCEH2qYcWHb1+QPFLL1F56d0VPHFLIYRoho1+v8Ec6o14xRQFbzZP6ZnX8GfzEdNyEEQFzEpVgoXSd2exUwRKYu2ywVehJuKkH7+nKVCCQoXCn36T2pEz1+dVE6xbE1oKvaed+F27ELoWJbQ+82qUKX91nhwvyupfKK5eu2cVhFUrym9rmOP09uz37D3ZlFDRNcFXvtBNEEBXh8pf/n5Xc+4vj3j8zC9tjOlSUSAeF+QXVi4WU5MBh+5dWbp34tuXWDgxTbwziVuyo0qHN0C0MErK3gIhASoamjBIaa2rC5XGzvkqrKCCE1ooG3CCxdUMWxIHmgskRIv6mcorTFkXVmgcEoknHTzfoeLnKXoz3JX9CKYaXa8rMQYTd1L2FqisMualMJUEA4n9GMpiVEgoQ0bqJ7lYfWtF3yEBVlDBCioU3Gnuyn2ENqN/w0IUIq1we+reZqQdgC9dzpZfY8peed9X/+4HLnWrSD0osz/zKHE1EuqaYrA1eZBZexgr3AC7ggR7skjL4a0o+q35yFwnMnvV65K2NoVCPuTCeZ8tW1T27tPYuTNiJlAUSGcEYQiFQoimCdJpBdsO0fs6ohDQBrzpBcrfevvG5JAiouz4foPW2ULrj38Uc0c/Yd1m4Q+eof7uuVviw1kRXLDOxVKYEbPzjWBs7WnSzADYF0apvXP6htqB0LQNR0kpyRhtP/VxYvu2Qhiy8MVvUH3lvXXlGV0PQbmKP1vA3D4Q5UK1ZCN26vx3h09wKTYlVH7u78yhaasvrJa18ckJQ/A8SU+vuix0WAjYvlOjUl6pIgtNIdGdwilY1CbLxFoTWLPXzxS+aqhzwzpWUCGltaAKrWkKuxa6MElqWSAK840ivzairgs6jEFa9J4li3rASP3EqgLlWkhC8u4k56tvsDf9MJoSOfYzWgfdsW3UqoXrtpHRO8jqncvMXiVvhku1d27YtydtzpS/w90tTzXnYCNoNXppNweaDnmJZMw6zYS9dn31q5BI8u4k49YZtifvQRXRpiKmpuhP7OVC9c0NjSX0fMonx5GrkFduFqPDPoEvqddCJsYDAj96j2dnQlzHI2YKhIDuHoVLFwNcV2JZ4DjR+6O1ZJZF2DiXJ9bFNqy1ZSIyxu8zxPZsJbajP+Iwm5yjfuTsLTNtXUsyqeXSuJUb+9fiuwdvmAsCoLXllnTWoM1ZxyKvd7VsOJ/D3D5AbP82hBB4s3lqrx67aYECgATrzBWS9+0HRUMogvQjh3DOj9582xvEpoTKeydcBvs1VBWujCwKAUMXPPpQjPZWlSPHHarV9b1Unis5cczjJ382iRBw+aKPaQruvd/goUdMfu3frJS2fY9vJ72lBa/mcPGPjrH1M/s5/VvrW2y80MEKyqS0FoRQiKvpVf0qV0NuAUJ8qv7GTCcKCn2JvcsW9aqfZ9q+tG6fCEjmnVHy5iSdsSEgMoF0x3YyWj+5pvNaQSWnd2Msqf8SyqiOzHod/VZQYca+xNbUITbiOVPQaDMHlvmeLL/CeH1tTqhrIQmZc0boi+8mqSwK/a7YNi5VjxCyfvOJUAResU54szkkS/DmG9EcOo5kYSEay/CVgOHhxUTF579xbY7Rdfpf5wKc+uDdNxXu+b5ACIy+xcQ72eA9u1VCZVl0mBCYu7bg3oBYEU0l9dBdm+twPeNWFFKPHNpQSDFEuSfNbgJ5S5kE6u+ew//MY+iNTUfinj0Y337nu86rtmmfyqE7DX7oU0nK1ZC3jzr8yZdq/MLPpHnwcKQOvnPU4df/exklrrPrw/20DkVhrMNvzHD5O8urybku/OHna/z9f5Tmn/6LDIEfzbWmC/7w8zVefXllAmDL3k5Gnz1H1wODyCAk0bt+GnMvtKn7JaQR2R9jagpTiVMPli62ItrlE/lTgtCj4t3Yb7MUab1tmflHypCSN0vV31g7TlhnwR2nzexr7toTaoYWo3fNQmOaotNqLC+IVPOLlL31myZDAoreNG5oYyo3tk1fRUxN0KJ3oywJG553xzYcvVX1C9hBlYSaa96HqSRIa62U/PWz2urZBFrCxK/fZCJpw4YuN7KoS7lq0qVfKC87bgz1RCGha4aKCeJ37ST9yMENDvq7ACkJKrWmPd/c0k3bT3yUymvHI7bfa+/pKv1IGEamrRss4vbFMZbWDko/cpDaWycJ19JWFIX0Iwcxd66PbNNfKC65VmBs6Y5sl2uZ7hSF9KOHSBzava72lyIoL4a0612ttP3sJ6m8eARvJr/Sz7R0noLghsm7QaFM9cUj5D73eJS1n03T+qNPsvD5r+JNLdxYWKpKpNlJruvXuxE2LVTiscg+/NyLFgf2Gzz1pORDH4zzS788jwD++f/SQiYlMAbShH7Im797DhlKfHv1j2b4csA/+rtFduzSGNii4diSc2c8ZqbDVeeiPlkmvaWFeEeKvid23tD0tRQhAbWgRCh9VKETU1IYSpJ6sKgRCcQyuvtqUMSTGyNcbDcGljm4femRdyc3lXNR8mZwgjqJhilKCEGnObSmUFGFTuoas17Zm29kqq8f9aCMHVQ2JFRMJbWs2mYkTKcJ5Macs5KQql+k1ejjamiIIhTSevuGhEroeAhdxV24uRwVNZcm+wOPbohHyJ8rUHnx3RXHvck5vJk85lAPAEZfJ9mPPUDl5aPLF0s1KgQVv3Mnuc98ELU1i3Q9hPm95zpbivrR82Q+dBituw1hGmQ+8RCZTzy0irVYNhzRVdzRGervnsU6fRl/rrjmoudcmsAdm8XcEoVRm9v6aPvxj1J69nW82XzkzBYRVYnWkiFxzx6yn3gIYeiErreiwuW1cIenCAqVpv8ltncrqQ8coHbkzLJSBELX0NqyJO+/g+xTDyN0bV3tL5un4xfwxmbQB7pAVUg/fi/px+9dfZ5cj6BSx5uYo/7eOazjF/Fm89c1l5Wee7NZHRQhiN+5nY6/9SOUv/4qzuXJqEbPVTOrpqIYOkoihtqaJb57C4l795L/w2epv7e+QKDVsGmh4nqSv/xajf/5p1UeGYtxz0GTeExQq0vKlRBFCFRVEPghyfYYnbtzhH5IebJOcXz1j9vz4MwpnzOnbrz4jD57jr7Ht+NVHRJdKa58af2mFYC6X8KTDio6ppogpiZgiaKiCJW03tb8XXQ3UKu7gYzesex3IH1qfnHD7UBkirqWsiWjd7IWd0ZMSTVNdxD5KaywQiA3tgNxQxsv3JgwTWpZNGVx0fOkixNsLl7eC+1l2fwCBVPZGE2JX3cxe7K4+epNJT9quTQtn350Q9fYZ66sKlQIJaXnXqfj534gyovQVHKfeQxz+wDuyBRh3UJoGmoujbGlh9juQZSYiXN5AvviGNknH9j0fbwf8GfzlJ59jZbPfahZ2RFYJUxUIOImStxE72ojcXAX9oVRCn/+rTVp56XrUX7uDdp+8mORY1zXSD1yCGNrH87lCYJKLaIWScUxB7vRB7sRmhr9LV8meXjfdcce1m0qrxwl99TDERtwLk3rjz1JfP823PHZSIgbEZuyub0fY6gHoWtYxy8gPZ/kvddvf1lf1TqFr7xM2489udw3tto8xUyUmIne0UL8zh04VyYofumlqFbNGlpUWKlR/Itvo6YSmDv6EYpCbFsfxi98Fm98Fn+uGLEjN8qJq6k4aksGrbMFpcFycLOhvZsWKtOzAU/9ZIK2NpW79ht0d6n092oc3G9w/rLXyHGSOAsOtXmbRIuJDCRWYZX60ALa2qMomvVuAt2SzfBXTqOYGtIPN2wvrwclvNDBVJOoQotMLChNLSKp5pr5KRDR5m8EV3NcliKUUXTVZuCGVhR+uySD11BMDCW2au5GXMss84OEDRqWjVKe+KGLtwFBJBDLIuYANKGzO/0g2+U9G+obIuf8cn+OWCYs1zUmVcFsT1P5PmPCrb91msr2AdKPRn4SNZUg9eCdyHv3RuYOpUHL0hi3fWGUhc8/DapC6gN3oabWrz2+n1BSCbKffIjEoT2N/AhJZENZ4wLR+I8ANJXY3q20/9wPMPVvf48gX1p5vpTU3jqJ0d9J+kP3RlQpmoo51NPU9BZPjTr1xmaY/+0vR9np9+y5ru9Dej6Vbx3BHOwmfmBnswpm6tG7wfObJJBNUk0J9aNnWfi9p4nfuYP4nTuadVKuBxE3yXz4PlIfOIDSKB+9rLz0qvNE9PwVgbm9n7afeQp/Nn9dn5JzZYL53/4yrT/+UeIHdoAQKLqOubUPc2vf6nMgZTSe8DrjWSc2LVTeOuJg6ILHH4nztefqvHnEIRYT/Lv/tZWWFoWvPlunXA5REj56QmNgbwvFiRqTJ1b6ExJJwX/5ry381m9UefnF9dm9W+/opnRhjlhbgo57+ymenaN4dv0mkSg8uE5KtoKAjNaOIlSCBllkTu9aQvDoUfauH757LXRhRmSNS+hkJOGmCSIlEi9cfu3VXftqQkUXyxfeq2SNG0WIH2XUr5uOQhBTl0fEXKv13QwiOpeNOUdD28OZq0Cwsa9FhiHu+GxUbneT8GbW9p+FNYv8F57Fm1kg/cG7o/rw5lWer8i/EloOYaVO/eg5Ss+8ij9fRG3NUH/3LMaWbvz54vKyzkvH7/m4E7MEjaxqf7647gUjrNm4Y7MoychHGlbqK68VYGzpof2vfhpzWx9IiTezQO31E9gXRgkq9WWZ2Vfp4dVMEqO/i+R9+zC29iIalCXZTz5M/vefXn08VYv8Hz2HOz5L5sn70XJpRMxscKFFWfpXzUXWyUsUv/Iy/mwexTSwz42gJGJ40wtr7vD9mQXm/ttfkPvMoyTu3ouaikfUJ7qGkDKiLqlGteGrrx2n/M03IzLM4UnsU5dR27KN+V19gvWedtp++inid24HIfDnCtReOI196jJ+qbbM7yREI1w5ncDo6yRx925iu7YgNBWtPUfus48z++t/dJ2HJ3FHp5n5z18g9dBdpD54CL2zBSUeWyyVIGn4tPxG3XsHb2qe6hsnsE5fXrvtdWDTQsUP4NW3bM5d9IjFBKoahQX/k1/NU62FzM4FeD707E5Rm7P5+h+/Q9eeHL13tVGaWG6CUAQYBszNrV/bGPzEbs7+TpnuB7eAgO0/coAj/+qb675eElLx52lr2OvTeisKKkHDBpbVF6M0yv78hqKNIOIZuzZiKpDrqDVxHayM2hJNx/21WKplQXS/12Njvh42ct3V5M3vJwhdxZ4s4JU2FiggLYfpf/M779OoIoR1m9JXv0PtzZNR2d7Gxw+SsO7gLxRxr0zgjs81F6wgX2buv/7ZDdv25wpM/7vPb2pc1vELWMcvXPccNZNqmOyib8g+e4WFzz9948gsoP7uWaqvvkfXL/8U5lBvZP/fvQUlbq5ZvEq6HpVvvU39ndOYOwfQu9ujxV/XIkqVhRLOxXHc8dmm8LDPDjP1r/7Huu45aNSMr3z7COa2PtT2XFRFMQwJaw02gIvj+HOF5jXO5Qmm/8MfXLddETfJfuIh4ndFWoM7PMn87341qldyA+e59d55Ki++Q9c//Eni+6JQ5NjuLSjJ+A0pWKTrUfn2O1TfOIG5pQdjoBM1m0bEDJAN31alFpF/js7gzxduCZP3poVKe5vC3/zZDB+4L7Zs6Rwe8/nFX17c1YdeSLYvwcA9HbQMpqjnV9rn/QDGxwJa29a/Aw0DSXpLC0ZrnItfeI/WOzbOhVTy5pBIBFGSoq7E8AIbBZXkEkdz2ZvbMN39aiG4cpOL+lWE1zj4BawgZryKaxMWI017cy/MRq9b2bdshFDf/AsrpdywcBRCkN7Xh1ey8Iqb4A9rILFtF0GtijMzSWr3Hbj5edy5tc2iyZ378Ep53Nkbm0792QLV2cKK41omh18pbyo8V02miQ8MUbt8DhkExPu34BWL+KWNRR+uBb2vIyoMpSgENYvKd95bl0C5Cr9UxTp+EXMoilIUcRM1m7phRcSgXIvyYN4nuKPTuKMb96GuBa0lTfK+Rt14z6f66vF1CZSrCGs2tXfOEN+3DSDy77RmcNfJ6yUtB/vsMPbZ4c3ewoawaaFy+JBJb7fK3/sn8xRLi4vdtflbcxdKSCSdu3IsXCkzc6a4oi3Hlnz9azaf/HQc34fhy/6y+bZtSbm0/AFMPH+Bvg/vZPy588ggpDq+ii32Bih5M02iREWoZPQO6kGRhJbFUMwmPUskfDYmVELCFf6Lpbxfm4Eqll8vWXuBvTbSKqI72aRPYYOXXZuDUwuKnCl/h8qaeT6NinbheoSFbGh864dQlSgC7GbyO4RAb2kHocDMJHpbJ4HjoJQLoET8bKHrIH0fxYwhVBWzo5vQc0EoKKaJUBRCz0N6LoppggShaoSei/S95nUyDAltC6Hr5O59iNLRNwhqVULXQTFMhKY1ijbZCEVBGFFSbPM6VUMxTLR0FqO9k/rIRUDg5RcI7EioCk1H6BGxqQwCQseOfmt69Cx8n9C5ToCGIjD6u5oZ5WHN3ng+RKPw1LJDG2thTZg7Bsj94EcICmVkGFL60rejnfhq5+4cxLmwmCSoJOIomQT+9M1T+gDofZ0ojRo40vOxzw1veJMgrxG0729loJvDplc50xCcvegxPObjrZFLp8VUQj+kOF6jOF4j1R6nZ38Lo28vz5UwTcFnPhenb0DlgYdMHFsSLLF/v/yiw7//1eUO7oXjUywcX6zXcGadiY9LYQUV7KDW5KbK6V1M2xdIqi3N6CU3tLCCjVMd+DLitIo0oYgZWGkIr82aoVaalSR+uPqu7lr/ScQctjmaElXo6xYsV+vBLIWC2gwUuBaKqpNIdyMUlXp5miBwG7lBIUJRURSVwHcxYmmEUHCsEkIoKKpBGLgoio5QVMLARa6mTQpI7eulPrKAv0Hz142gxuO0PfIkoRsJCWdmkuq5k7Q99jGCWpVYdx/2zDhmdy+pXfsjk0PgU3jzO7Q+8BiB44CiYA1fwJmboeOJpwgsC79SovTem8R6B0ls2YYMfJypcarnT5HYsQezvQs1kaJ45DX0bAvpOw7hzs9itLQx+9yXSe7ch9nZgwxDFE0FBIkt20nt2k/p6JvYU2Ok995JfHA7frmImkwx982vkT30QOTQ7ejBmZ+h8MZLSH+tRFmBEjMX/WxSbrhWi1CVZjKglFEI7Zq5JxuFqmKfvULpKy+S+fhD6P1dBOUqem8nSsLEz5fw54voXW1kP/04pa++hD+bJ7Qc4od2Ywz2UH/3DM6FUYShR2UJTANvLk8wX8TY0oMMQtRUAm9qjqC0tt9NiceW+FbZOO9Zw3d1FdIPCIqL/WnCIKd2RptMAsr+QtOM/73ApoXKpWGfj34owY99NsX5Sx6+HwkBy5KcPh/d0NADnZQm6+z8UB9O1SOeM6jMWCuEiutK/vD3a2uuW/NzN9YS2g/1Mn90csP3UfJmm0Llal5KUss2fRVWUMbdYEgtRJqCG9okl8TDCqFgiAS23HgEmIK2gnI/RK6ZUHhtGLAqtA1HTUX9qqioG8iol9jB8g9Ma1S2XA3xVCeaEadWnMSIZZAyQDdSOFaBWLIdZEilOEYq149QVDy3Rio3gK4nqJTGaOnYBUjqlVkqhTFW28NJP4gcrTe7vZOymQAtrmaMCygdews1FiexdSdmZw+EIflXvknbB5+MGBsGhtAyOdy5GczObtRkFHLrzExQvxL5LYSq4SzMIYTAnplE+j7WyCWcuWmKb79CUK81CAd9vHIRvbUdLZECAe7sNPnXvkXnx38Qo60DPddG6b03QShkDtwTzc/wRfTs8rwla3yE8vG36fr4D6ImUyiqRuh5OLNTWOPD1xEoNBMer0LEDPSedryp9Qe0mNsHIsd1A+747ApKlpuBuWOA7KcfQ2vLYR09hzHYg7lzMAqMePQw5W+82girTUTRW4qCUERU7jgRax4zd21B72glKFdJ7R6i/I1XSX7gIN7MAsFC6Yblk5cGeghNwRjoxh1Zv3nNGOgmee/e5m9vYo6wuvjdx5UUXcZWFrwJfLzGu7mBibrF2LRQ6epQue9uk3sOGNSX1JS4MuLxV/9u9GKNvztPoi3GxHvzzF8qk+6Kk2pfGQYZBPDad9YZmSQEQhURrbW6uND1PLptU0Kl6M3QG49YfBNqmpiSIqFmmzT59aCMt2G69QhVL0+LvrjDUIRGQstguxsXKjE1iX5NUS87qKwZ0VXzC8sitq5Gii0Nm14PdMXckDCSSKrX9K0Lk7iaYrWcGlXV8d06vm9hxDMoSoxYogXXLiKEQiLbS6Uwiu9ahNJHCAUznsW1SpjxFoxYBqu+gG6mmubKawaEPVFAiemr1oVf/41JAquGnmtHMWMYbe3Uhy8QOk7ELNsIDw09NzJj6QbCMJBAUK/jTE9Sv3yO6rmT+NVI8w3qi4uyDHwqp46iJVK0PPQhZiZHm9TxQjdAsdGzOZJDOym+81okvBQBYUjQMFPJoLEDFqAY0TNTNC1qQ9MQqhqVxBVKNGY/opSRgR+Z78IAr7CAOzeNX79BxJuUUb2XchU1k0JNJ0g/fi/uRJQLcb1sdGFoxO/cQeuPPYmSWjQLVV9695ZS4XuTc9RefY/YHTswd21BmDrxO3agdbRGuUGGjjs8GUWMHT/fvM69MoEwdKzj5xGGTmx7P8ZgL0GxggyCiFlagntxDHd0ZXXLa+FPL+Dny2itGYShk37iMM7IVFR0a61ERiWKlDN3b6H1Rz6C2hYlPcsgpPLtd1bMkx1WmffHCWVASEC7NkC73g/ApHuBcjBPhz5Ihz6AQHDeegdVaPQaOzGVBHlvkhlv9TyhjWLTQuWbL1nc+8RyG6oQkEkv2q3tsodnBZQn6/hOgF1yKY6u/bLGYtDZpZJKCfwAioWQudnlO8xkb4bUlhx9j21HTxmNmHhI9uc2dR8lb4ZQBihCRRUa7eYAcTUdfWQypOYXNx0GvOBNMMD+5m9NaGS0jutWmlwLKa1lGY8XQMFdW4g6oYUT1oip0a5YCEFCy6Er5oZqkhhKYkW/N0ItKOBJG0PEm33njG4m7QsrItiqpUlau/ZgxrLUq7PEk20YsXQjbj5AhtFC6Xt14ulO6uUZXLtELNlGYfY8Vm0exyqBDNfcnIW2T3JrB2rMoHJq8zxI1shlcvc+SMeHP0nt0rnI5NTWgQx8pOvglYu4C3PYk2O0f/AjhK5HUK3gTI2T3n+Q7MH78MpFiu+8hltcIHSXZmvrtD74IZAh1sjlqHIfUD17gpb7P4g1eoXaxdP4tSrp/YcIXQe/UoqEhxLtlN2FOfxqhfqlc6T3H0S6Lvb0JIQh2UP3Y7R1oqbSBFYdv1ZtLEwSd2EuEjqKQmJoB6md+3DmpikdffO62oo7MUv93bOkHj6E0FQS9+xB72mLHPaXxgltBxnKxgYwqvduDPWSuGsn5tbeKHRaCELbpfzCW1inLm362awGYegoqQRK3CQoVfHn8tQB58JoVAxtrtAw2/kYQ33484Uo4zwIUFJxjMFu3Mk53LHpRoTUNNJxCYrRplC669uk+IUK1VfeI/vxDyB0jdjuLXT/f36K6mvHsM8MR0W/wjDahKkqajKG3t9J4q5dmDsHIgEIhK5H9bXjESX/NchpXc30gsv2capBHjusktU6yGqd1IIifcYuTtReIsBDoNCpDxJIj0nnAn3mLor+LI68+cqoN+U5Xm1T8dd+Os1//I1Fp3mmL4GZ0Jk+XSCeM2nZkmLs7ZX8Ux0dCj/8Ewke/qBJNicIGhFhX/4Li+eesZt91SZL1KcrxDuSTH77EoEb2XH3/Y3NZRhHPpMKSS2HEAqtRl9zIfalSz3YeADAVRTcqYg3S40WVwWNnNGFbpkbElQChazeib5kcZcyZM5Zm4E0lD4Vf6F5LxDl4hhr5LWshYSaaWgZ64cT1Cl787SbA81jbcYgMSVJLSguH2fgMj95nKtajFVdfDdcu0J5Ido91Ssz1CtRZFFp/jIlolj6+YljNxyPlonhzFUIrJuzMwf1KgsvP7/sWPn4keg+rDpeMYqqKr37+opri2+9svy6Y+8s+y09j7nnv7ziutrFM9QuLi4i+VfWDpsvHXkNAL9cxJ5c/m4U3nhpzeuK77yKlm1BaBrO7BSKGYuc9DeweIaVOqVnX0dtyRC/cydCERh9nbT96EeQfkBYt5FBEGlIho4wDYSy2KiUkqBUpfLiEYrPvHpLwlmvwp8v4k3MYgz2EJSqWO+dRQYhQlXRezsI6zbeePQ+Vb75BkZ/F2HdIqzWo+TC4Sn03k7ciVnsM1ciE1hfR1QFcnoe68QFgur6/D/ScSl/6220jhzJw/sRmore1UrLZx5DfiqM5sn3G0EXOiJmLEvWlFISWg6VV96j9LXvIO2V1om8P8WwfQJJiCYMeozt2LJOXEnjS7dRSypcFkRzlaIqodrMe2Mbrii7FjYsVK7eq5SR9r0UqgpPPBJvCpVMT4IDn9mKHtfoPdhGotWkMLJSU9F1+PG/kuDQPQZf/IMa4+MBhh6xFP+tv5diYT7knTcbEykjFXDihYt41cXJvfTHN15cVoMfetT8Akkth4JKuznYjLLyQ2fTtCoQ+TVmnSv0xyOmYiEEOb2LjN7Jgju27nYSaoZ2c7CZ9BcVGlu4TjTVVZ6xCdqNwaYZKqamaDf6G4SWN/6AVaHRYnSjiY35YpywRt6doMXoac6lqcbZkryT0+XvrHHVauO5NYtMrLcFoan4pTrW6K2J6Pl/G/xyicqJdyNTG+BXy8i1InCWwB2ZZv63v0L6icNRKeF0osEGq6KsQgvfNBNaDtaJi5SffxPnyuSK6KabRbBQpPLNN1Yct06szL2xr9GQwrpN/a0Ti79rFtbRs9dcszrn3lrwZ/Is/MHXca5Mkv3YB1BzqWieVKUZGbYUV+dJOh72uRFK33gd5+IYYXWtDaFccm2IKnTSSisKClZYwZceRX+GPfH7CQm5Yh8n703RbcRJq23YYeWWOfc3LFT+l7+bo79X5fkXLf7ZP2qhVltiExQCY0mAUmXG4sqr06S64ixcLONaPuXJldLdNAUfeNjkN/9LlVdedppayTtvuaTSgo9+IrYoVBowMjFUU8Mp2Ug/XFeRrtUQSI+Kn6dDDoFYzESXUuKG9oqd9UYgCRm3ztBhDjY1BlNJMpQ4QM0vYIc3ztRWhc5A4g4y2iKPWCgDxq0z1+XkkoQU3BnqQblZD0URCluSB5h1htelgaW1dnrju9eZSb+0b8mMfYWu2DYyWkezLHBvbDdlb55J68KGk0lBoAl9U6wA+dcvrkWRdlMQhh45zz2/sctSNkQ2uaI9BDomQih40rlueQQdkwB/AyUUlkMxNWLdEY1Q6Pi4C7WmprVR+HMFCn/yTcrPvkZszxDmjkGM3naUZJSVLj2P0HYJK/XInDQ8hXNxLMr032DEGIDZmcYt1JEbpGZSDA01ruOVrVv7LigqejaHUFWCem2Zr2wpgkKZ0tOvUHnxCLFdg5g7t2D0d0YJnKYOfkBouxGJ5PQC7sgU9sWxKLLsOvNUCfJUg2LTVxrgc8k+GkVR0qDMQTLqnG4S3IYEuNLikl1snrdRCqe1sGGh8rtfrGDogvvuNvniX1R5+rlFIaGqgv/tV5ew04aS6dMFcmUPVRfEMga+HVCZWS5thYjq3hcKy/0nQQAzUyG7964cZsfhAWLtCZy8RWWkQPH8HH51MzQkAfWg1KwE2Rw7kqqfv2mVsOrnmbDOM5Q80KRt6YhtYae8n8vVd6kFq8fOQySABhL7GEzsX0b3kncnmXdGbvgSVP0FFtxx4mq6qeXElBR7Mw9zrvL6mhT8AkFG72BP+qEN+1OuohYUGK2fYl/mYVSiyC9NMdiZuh9TSTJlX1iXYNOFSULLkdHayejtnKu8vnHBcgvNKk2oCsbWQdREAufyMNIPUOIx/IVCRIWhKJHNXYYoiTih495wATVEjC51CEmII21K4RwxkcSWVQQKtqyREBk8aZNWWqiEeQSClNKCKy0ECiE+CiqutPGvs/NM7+xk+19/mMr5GYSmUjo5ycy3zm3eUR6GBMUqtTdOUnvj5ObaWA8E7PylR7nye69RG179/VVMDT0Xx5mtLrsfPRcn0ZejeGLilhZsS2zfRefHP4OWSlM9c4LZZ79MaK1hGgtlRLtz5OwtTeC8NvgmSmdYDqGBooT4rrzueTeLDQuV6Znow1BVeO+kw8XLiztORYG3312uxmZ7kwze10mmJ0FtwWbufHGFUImc8pIHPmBw8bwX1fAGunsVPvi4uSof2MjXTpPoyZAayJHb3UH/h3fw3q+tbTe+HuygghtaxNV085hEbohefS0E0mPcOk1O76TV6GsKh57YThJqljlnmHlnjFpQJJAeCioxNUWb0U+nOUSr2dvcXUgZhRAP195bFzGlL13G6qciTUlJNU1wbUY/d2QeY8q+yJwzjBVUkTRUZq2NDnOQTnMrKa0VKUNcaaOL2IY5t6bsC2Qa9e6b9VDUBFuTh+gwB8l7U5TcGeywhh86CBHRzhhKjLiaJalmSWhZ4g2/ThAGXKi+tY5dZtSOLnRUoaMqBrqIwppVoWMq8WXPGiJGhb74buyghi89AulF5Y3D6N/Rb2/x4w1CpOMSahph3UbNZdBac/jFEvED+yAM8aZmI+r6thbcK2ME5eXPTDFjtD7yBHprOzIMcE+eQ1ysowoNW9ZoVbtRUGkRXVTDAro0SCutzPnjGCKGKjRyShsxkWjmQHnSRkVjJhjFv8GGqHR6iuHff4PUjk56P7Gf+dcu3bTf6fsBif4cmX29TD17apk248xWcGY3Z9G4HlK79qK3tCEUheSufagvPd8UKv27k+y5P0t+xuHs6yXq5Y1q6DdGLKmSyGrkJ5evk4oKXVviTF2O1tt4SkUzFEqzm6+Vsh5s2lE/MemvcORJCf/7b5VJxAW2IwlD0EyV4mgFRROMHZkj3bly52tbki/8fo1/8CtpPvyxGFOTAbGYYGBQZXg44C//ZKXUVww1Kpk51ELbwV6KZ9dffOpaWEEVJ6hds9BIiu76KSeu336ZU+UXOZj7KGmtLUreE0rDv9LOUPIgUgaEhAiiv6lCQ2E5IaUvHc6UX2ZhA9FjFX+eC5W32J/5YDNXRBEqWb2LtN7O9tQ9hDKIaqqjNKPgrgqyBXeceWeM7al7UTboWwmlz6XqEYRQ6IvvQUFt1JvXyepdZPQOwnjQTBJdJLcRKEJFoDQTRwGCdZp6tiXvbmh3akRl0/xv4/9iZSJoSsuxPXW4EZIsm2aDq9pgpCGOc6y06CiXjotUVaQfmb+EaSBUFTWTxh0ZR0nG8ecL6Ht2EBRKK4SK0DTiW3cS7x+MQoqn89gXTpMQkXM1JlI4sk41LCKRdKtbmfQvNXeXChoxkcCTLq60SCutaBhNp+yNoJoaZmea7N5u7JkKoeuT3t1F/2cOoqVMSicnGfvzd1F0la4P76X9viGEKhj/ynHyR0bpfHQnHY/sAAmTT5/AXajR/vAOkkOt2FNlYl0Z5l+/jJ6Lk9rWTuj6hE6AUBVGvvg2ZnuS/s8eREvFKJ2aZPwv36PrQ7tJ9OWI9UQm27E/fZfKhRm6nthDxyM7saZKKEa0bGX2dNP/g4fQkyaVS3OM/ekRYl0Ztv7cg8S7s7Qd3kLh6Bjjf/ke2f09bPnxw1SvLDDyhbcILA+zPUXfDxwgtb2D+kSRiS8fw6vY7PuVJ6mN5Elt7yB/ZJSxP7t+qLNfKUfvgKbhlYrRvxtIt+kUZl1kAL074vTvTeE7Ifkph5YuA9VQOPNakaH9KZItOpePlWntidExEOP0KwXa+kz6diU5+s0F0m062+/KcPl4mWyHQa7DYGbYQoaw76Ec7z6/QH7a4fDHO5i+XKcw7fL4T/Xw9tNzXDlW4e4n2xg5VcV3Qw5/ooN62ae84NLRH0MzFE68lGd+/OZ9W5sWKg/cG2P7Vo0Llzym5wIuD/vcdYfBT/5gCseTPP1cnTfecagXHXw3wEjpDN7bwez5lSYPKeHFbzlMTwV86CMxBgZVSoWQb37D5utftanXVz7QgSd3kd3extyRCYa/enpTpq+rsIMadrhYuQ6iOiI1f23T1EZRD8q8V/wGu9IP0m4MNOvNq2hNZ/ZaTMChDKj4C1yqvsOsM7zhvqfs8+iKydbkQUwl2dRYrte3lCEL7njT3DSUPIjOxpMnXWlxofImdlClP76XuJpp9i8au+v1QCLxpbsuHjJN6BhKfN1tQ5SYqqKsGfEkpURXYsuOhbYdhf4KEPEYSjKBEo8IDtXWHO7oOELX8AulZQvNWggIcGSVgj9Nq9JNOZwnLtIE0sfDoRIWcKSFKeIYwiQukswHE7SoXYQypBTORRsHybqobDL7etjRnUEoCqd+9RmEorDjFx5h+oWz+BWbgR88RPH4OGZHmkR/jlP/5uuEfogAYl1pOh/Zydn/HAnZPf/ww0y/cBY9bTL8+2+y7ec/wOQzJ2m9dwte0WLhzWG6PrSbyWdOktraRnJLK1t+8j5mvnUOv2LT/7lDlE5NYrQmQVU48++fo+ODO2i5ewAnX6PriT2c/Y/PgxDc+a8+BYBbrDP93BmEgL5PHcDsTFO5MMv4l46R3dvNyBfebpbEKJ2aYviLb9P+wLZGrptC56M7cearXPmDN2l/cBtdj+9m+ptniPXmuPTbr2H/zzc58K8/zexL56+r4ZSOvB7VvkmmqJ463sxDuoptB1LkZ1w0QxB4IU49YOiOFJePVSjOuOy8N0sqp/HiF6do6zVp6TKYHbbYeleawrTD5IU6QsDAniTTw3W2H8pQnnd559l5PvC5Lt55Zh49XubCO2Xa+0xGTlfp3R5n+GSVsbM1Tr1aBAljZ2skMxo92xKceqVAqkXn4IdaOfNGkfK8R//u5PdWqPR0qfzVn0xz/JSL58Pnv1jhb/18hlfftNE0wY99LsWpsy520cWteSxcrtAykMS1Vv+4ZHi1QNf6aMZnXh9l5Omzt8Q2GhIVz5JmiGjsYMv+3AoCx5tFPShzpvwdumLb6I3tjsoVL1nIVxMoVlBm0rrAtH1xw2WIr0IiGbNOYwUVBhP7aTP6VxBRNjUiJE5QZ9q+yGj9JPWghEDBC+0oeXIT/GGedLhSe4+iN0NPbCcd5mBTuN1w7FJSC4oU3EkWnPFNOerfLwSFxQ2SNzaJNxblDbljk9inF5Pp/Pn8unwVvnQph1Hi8HQwDECJxQz16eBK87yav7hwWf7mqPkLR8cY/4uj7PxbjxHryeDM1zBaExCEqHGDyadP4uZrZHZ3UxteIHB8CCPdzWxL4ZUtvKIFisCer2G2p3CLFoHj4xbquAs1FE0l9AK8skVgudjTZRL9LWjp2LK+pr5+slmZs3x6itD18UoWsa4MRjaODCTOXBUEeIU6QlXpfGxb1NdCDaGrG+J2E7oaaWOnppBegD1TJrWjE8XU8EsWtZEFCCVe2UaNX7+yY1CrsfCtZ1f/o4Qzb5SIp1XCQJJq0bGrAfkph96dCVq6DcpzLpoeZcFfNY9lOnRGT9dQNcGBxzIEgcSuBrT2mIyeqpJu1XGtaH3y3ZBMm07/niT9uxK09ccI3DDKERKw7a40CxM2Q3ekEQJmhi123J1BSkm16OFUA8JANuv23Cw2LVRCCV96ps4f/EmVB+4xufegSX+Pxle+XsdyJL/+b9uJxxXibSnMtM74u/NIoHtfC5XpyMb30AcN9t9p8Ae/U8OyNuYuyuxow3nHuq553Q6qHCs939yNR9Qpq4fkDdeOMWWf5+pWNapdsnrr4/Wzy3JEnGD9fEVOWGesfppZe5iM3kG7OUBG7yCupFGFSiADnLBGxc+TdycoutNYQXUT0VLLEUqfWWeYojdNVu+kwxwiq3cSV5MI1Cgnxy8x744x74xRD4pNUkpJyLvFry8htJQbDmCQhOTdCUreLMO198jq3bSZvaS0VkwlgSp0JJIg9HClRc0vUvXzFL2ZJlXOevscrh9j0j7HTZewuwbr7d8+f009iluYJX6r4Vcd5r5zke6P7OXK59/AmijhFOoUj41jtqdw5mvYM2Va7xti4Y0rhH5UK92aKqFn48T7cshQEutMUXhnmORQG83v5upty6X/jljB/YqNNVHCLVkUjo41+oqE47IaLIDbEFzJoTZkEGK0JlEMlfTOTkb/6B0Cx0PRl+R1eAFaKoYS16MkWj9EaApKQ/AohoZftXHyNZJb2ymfmyG5pY3Acglsb7FY1ZIxbBaX3ytHpspG/sWFI2XCUDK4J0VpzmXykkW95KPHFDwnxHNC3vraHJohsKoBmi7ITzlYZR+hCsy4gmOFCAF2LeDlP5qmVvJ597kFPCckP2ljxFUCT1IrebzxlTlkKHHqAUefn0eGYFUDEhmVMITAk3hOJICKM7dmw7ZpoVKphkgpyWUU2loV9u0xyGYVMmmFuhWgqpDpTtD3kQHMlEHPna1oMZWJ9xbzBDq7VHbt1lA3MYqu+wcbtCxrq/mScN1kkJ608fzlIbpmLEcs3rrGFYtIkFtXH2HoUSmPI2WIHVaxnSqzzlVqhGtf3ZULkVA0Eq19yDAg9B3syvwGFyyJG1rMOSPMOSOomkHo+8uiyDQziRT+Cpbj682jkciiGnGcaoHQvwFtufSoBUVqQZFJ+2r0y43vfb1QzThqphWpmYSBh1cp4FubLLIlFMxsG05xg/66dZi6vtfway7WZBEZhOSPjBDrzmC0Jjj/m9+m/7OH6PnoPpyFGpf/xyssvD2MYmrs+JsfBAFTXz9F8fg4418+xpYfPwwCRv7nm3gVBzVuEDoB9bECvuVSHy/gzNfwqw710TyB7WPPV/BKFhd+40X6P3eQ7o/sxc3Xufw7r2LPlPFK0cbPq9jR77LFxF8eZfBH78WaKjH74nncQp3JZ07S/7lDuPkapVOT+JXo+y2fmyG9p4tdf/sxCkdGmfrGaXo+tp/s/l7UhM7Wn76fsb84yuy3z9P95D52/Z3HqY/lmXzmJKHjU720+LxrwwsE9uaDFxxrubXDrkXr1eyohe/JptPccxbPq5UW3x/Xgnp5cY2zq8vXu0o+Glt5fnGMS8+v5hePl+aW/nulFcbfYIj2WhByncUyrjVV9PdG5q++Hg3HlUxMBmQyCqmEoFINyWUV/r//uoDWkSKRMyiO1/CdAKvkNteMz/5wnCeejPGf/n2ZWnXtYdi2pFRc/vetn70D3/aoXCkgwxAZSMqXbmVim2DL9g8xtOMjt6xFq77Akdd/neAGC+9aMBJZtj30EyyMvEci18P02e/glDcfoNC65SDFidOE/uIOJZ7tIvBd3Nr6/Unpzm20DB5g/vI71PPj675OxM2o/reiNMgSAwhClFSC0HYinqowRMmmo0irShUllSSs2whdQ0klo1DWUjm6TjdpP/AwRrad0HMQikp5+DSVkbNsRlDpqRw9Dz7F6PN/uOFr1wM1maL3J/5a01E//8LXKbz67felr9u4jVuBdfk0N9v4xFTAb/52mc52lWI5JJ8PUVX44AdidHepvHXEoVINMRWbnjta2HJ/J4goAmzkjcVQ3XvvM/gPv94S2fTWwGvfcfnPv7bcURZ4Aa13dJPe0oKUENjeLRYq359wKgvMnX+d7n2PEUtFkWSZru2ouokMQ2bOfods317SnVsJfY/5K0dwqgtke3aT6d4JisLU8edJtPXTtedhku2D1BbGyA8fJdO9g2zvbvIjx3BrBYSi0tK/n2T7FqQMmTj2LMm2QXJ9exBCIT96nNrCGLX8OInW1WtfK4pOa8duTDPL/OwpHLsY/UEI4nfsxrk0gppJI3QdP18gWCiSuOdOvOk5lHSSoFBGa8vhDo8TWjZaaw7XmkboOvG79uBeGSesVCMacjNOonOA2Xe/hb0wjaIbhIGPmWun/c6HmXz1K8gwaAqfyshZrPw0HXd9kGTPEGHgU7p0nNLF47Tuu4/czkPE23vZ+gO/gAwDRp75PWQYkOzdRuu+BxCKQvHie1RGz5EZ3EOsrRcz20b+3Du07DxEeeQspcsnIofh9wqqitnZQ2LHbsyOLpR4AoIAv1zCGh+hfukcQW1jmpyaShPfso1YTz9arhU1Fm/WcvGKC1ijw1jDF9cVnACQOXiY9IF7CO06+Ve+jTMZsU0IwyC+ZRvJbbvRW9sQmkbo2LgL81hjw9ijVwjt5eZsxTDJ3fcwie278GtVZr/6pw3KGYVY3wDJHXvQ29pR40lC18Uv5qmPXKR+8fwiIed1YLR30vbYR5tM09fCmZli4aXn1s5TuQbpOw6RvSeimJr58h83E1D1tnZSu+/AuMpqHYT4lRL2xAjVs6dW3Pd1oSjEevtJbNuN0dGJEk+g3MA8FLoO+e+8gD0+sv5+GripIl3trQonz3o4jsT1JP0dGvfcZeK4kiCILDOtQ2lUXeHEl4Yj215t+YMbueLzpb+wsK/jUxkfW6mWjX39HOPfONf8/X6YrX3PwrbWdo4rio5uJJtOb9+z8H2btXbFjr25Cn7L+tQN4rkejESW4tgpVDOBnsgye+5VfKeOlCG1hTGs0gzZ3t0kW/sJnDptWw8x+s6XCXwPGXhUZi5hlWaYOfMynh0J7MrsMGamE9WIaCOMZAupziEmjj9PGHjIMMAuzzJnV4hnOsj27qG2cH26GcNMs33XUw024bllQkVJJSMiw5gZcR5pi5FoxmBvVD/bciKNRFMhDDG2DuAvFCNBYjt4M/PN+hRh4BH6HrH2XrxqCd+qRvkfvoeRaSXRM0Rt4hJ6Kku8c5D8mbfIbNlHsnsLk698BUW/yrkkKZx9B69Wov3AI4w8+/sRZUYYEO8coO2ODzB//DsQSjoPf4TQsYh39IGi4pQX6Dr8JAsnXyM9uIvq+HkCZ3Ms1zcFIYj1DtD6yBPEt+1E0fRFjqVoksne8wB+rUrh1W9TPvbODReq+NB2cocfIr51B6oZi9q71rkrQ2QQ4s7PkH/xOaoXztyQZUBvaSOxdQehbVE9fRxnapxYbz/tT36KWN8WhKou76dRl2bu61+m9O4by78pVcXo7CKxbSd+tYLe2k5oW7R96GOk9h6InPnimnm47yGcyTHmX3gGa3T4upsAxYwR6xtEa2ltTPPy+xeqGo13PRACPdtCYttOpJSYPX2Enkvu/ofJHX4IxYw1uLAWa9Zk776ftsdKzD3/NLVzJ28ouM3uPlof+wjJbbuj72vJO7BaoEzkTwoJalWUWGzF39eDTQuVoUGNX/y5DFdGPKZnA373CxX+3t/IMj0bkEoq/I2fzfDP/12ewAvRTJVEWwwZSMLQxqks2vbGRgO++pcW1coGS9bqCm0HerDna1RGi8Q7ktSnrkkuExppvQ2Egu1XMNUEmmJg+RUMJYahJqj7JZxGoa6yu7TCo2Rm6ij5+fMrO28g17qVoR0fxTCjXcvs9HEmRl9bs4KhlAFBcHPJZUYiR6ZrOwvDR7Gr8yTNQbx6Ed+tI0MfVY/RseM+PLtKItdDdW4YoenIMMB37eYHc3WMYeg3/y1lAEtCURVNJwx8As8GKVFUnZbBO1FUHc1IINbhDEukOonFc41FYelLLJFBgN7fQ1CuImImem9XZNqSEqFrBKXoeQYLBcJiJRJAho7akiGs1WnUSG62GNh15o9/h5a9h0l2D2HNT1K6dByvWqQ8fJpU3w5qk1dID+zGmhnFr1cI7CpC1Uj2DFGbuoJbzjfnJ/T9qD65t2iuTHQNougm8Y6BKFteN0j27iAMfLzSAn69jJnrpD4zSmpg1/IF7LsFIUju2kfHxz6D0doWOas9F69QQjpOlEuTTqMmUujZHO0feQq9rYP8y88TVNcInRWC1kc+THLHbqBBcujYBNVKxLYsBGoihZZKo+g6sZ5+Op/6QcKv/in186fXN2xVRU0kiW/ZRtenfhijvTPSgKw6oeuCqqDGEwhNJ7Qs3IW5627ShKaR3LGb+NB2Ett2gZT45RJBvQ5CoKXSUR0ZXSe+ZRudn/gc01/+I5zJtU24frlE8e1X0bI5FMNE0Q309k7Mrp5lJJCbQWxgK4mtOyPNRVUJqhWCWgUZStR4HC2TQ2gaeksbnR/7NHNCUDl9bM0yA0ZHF12f/hFivQNIKfEKCzhTE9HmQVHQcy2YPf2osSh3MKjXqA9fxMsv4BXyuLOby9O7KZbi1992+MKfV7j3kMlD98fYNqTzL3+tgOfDf/xXrcTjCnbJJQwkbdsyyCAkDCXV2ZvfufV/eCeJnjS+7VMZfY+tn72DU//ncnbYmJoibXRQcmeIa2niWgbLr9AR30rVnSdjdFDzCiS1FnpTe6gXS8v4tHzPwvfWHms80bas2qDvWVi1+ZuuRX892KVZZs4tZ7xd9lkJgWammtTxge/iO3WcWoG+A08iw4CZMy8T+A5OZZ7uvY9Smb1CaeI0bVsOkunZje/U8O0qbr2EDHz67nySMHCZu/AmmhFH1WNIGRJ4FkJRad92mEz3DoxElsCt41QXtbuWth2rhyqGEvv0BdRkAn8+jzAMlHTkI7HPXgJNI6w3OJqCgLBuIXQN59zlSKAA9rkrSGdJxIqU1GdGsQuzxFq7ye08ROve+5g9+iK16WHaDzyCns6RGtjF1OtfA6A+M8r8iVdJ9e8gu/0uFk6+SmX03MrxNqDqJjLwCb2Irjx/+i3c0hyp/h0QRlE0YeBGUU63KERzo4gPDNH+4afQW1qRYUD90nlKR9/CKxaQnotQFLR0huSufaQP3IMai5M9eJigWqbw6ourm4GkpPT2a8QHhnCmJ6hdPIszNUFQrxF6bpRQGk8QH9xKywceQ40n0DJZ2h55gvrFs2vXV1kCoWrEBreS2n8Xeksr9SsXqJ4+jrswj/RcUCKhEuvfgqIbeIXrm7sVwyB338MoiQReMU/x9ZdxZiYJbAuBQE2mSO7eR/beB1E0HbOrh9x9DzHz5T9ZU1j5lRKF116MfqgqiqaTuft+2p/4xE0Llcydh1DMGIFjUzryBvXLFwitWiRUYjHiW7aTu+8htEwWLZ0he+8D1EcuEVRWCaIRgtaHn8DsiWqq2OMjzD/3VZzZ6ah0tKKgprOk9t5J26MfQY0nABH1e3Ht93892LRQsSzJlVGPsYmAocGQe+4ySSYEigLVWoiqCBQBdsVDUQW5/gTH/2KYROtiAt23nrd563WXem3jJqHsznZGnjlL94NbIJTEO1faOG2/ghfatMcGsPwqbmBRdmdoi/VT94vE/DR2UCGlt+IFDhmjgwV7/ezB3224VpnRd7+67Fg9P45VnGouBIFrMXHs2UZWdUQtLwOf6dMvoahRvH3QcMzPnH0FRTMIG9pTceI0pekLICWB5yBDn6nTLzXsrxLftZg59yqKGtVIl2GADAMWht8lP3oMZEiwtEaIUGhp27nm/QTzBYKrdcNrVjPv46rQuBbS83FHFtkEgoVrgwmiYlSh51KfGUWLJckM7UXRNNxKgcCukdt+F369ipNf9OtVx85Tm7xMZsteOg49tihUwiAqKqVqjYJZEq9eQbdqlC6fJPRsRKOWSap/x5KBrnnL7zvUZJrc/Y9gtHdCGFI58S7zLzyDX16edOxMT1IfvoRfrdD26JMopknu/keonDqGt7B68Eft0llGf/vX8cvFSHNYxaxljQ3jVyt0feqHEYqC2dOH0d6JO7uOSoeqSnrvAaQMKbz+MvlXvhXtqq9Z4GsXzkTcajdgURaKiprO4M7NMP2XX8Bp1JZZNt7RKwghyN73MEIIUnvvYv65r61JCrkMQUAYBEh37fSD9UIIgZrOEFTLzD33Vaqnj68wbVkTowR2nY4nP4VimMQHt2G0dmCtIlSM9k7i26J3MrAt5l/4OtboYhEuGQT4xTzFt14h1ttP+s67UeJxkjv3Ub98MXr3N4lNC5WzFzw+/Gicu/9ZJExqdcnkdMDP/USG6Vkfx5U4jqRlS4p63iHZFkOLqeQGU0yfihaDUlFSKgaoGhw+bHDlss/C/PrKvlZHi7Ts7iDRm2Hg47upTa6cWCEUKu48fujQavZT8RZIGx24S/JKdMUkrmWoevO0xvq/b4SKEAq6kcaMZdH1OEJRI+3Ad/H0CrZdigRGY2FfisBbyV4c+u6yKC9o+CCWmOMCzwHPueY6Z1mY8GrtBO7q2lwi1bWukOxbBS2Rov3AI3i1EkhIdA5Qm7wUVUaUIdbcBO13fZDpt77B1UUg2b8DM9tO6NjEO/qoTy/JPyovAJLW/Q/g1yqULh2nOn6BZM9W2g88jFcpoMWTlC4d/67d441g9vaT2LYThMArLFB4/aUVAuUqpOdReP0lMgcPY7S2oyZTZO66Z81EPul5uDM3qHQYBFTPnqT1occx2jsjwdLZvS6hIoRAqirVE8dYePEbawqN9QYAAEjHofDaizhTE6tqH9L3KLzxHTKH7kMYJoqmYfb0Ub+0ttn7fUMYUj19nOrpE6vfYxBQfu8dWh74IEZbB0JVifX1Y42sLG5mdvWiGCZCCNzZabzCGmWeg4Da+dOk77wbIQSxvgGEIm4qtmTTQuXiFY//9F9L7NiqMzXjMzruo2mCH/1sii0DGl/8iyrlaojmBCRaTTK9CQbu7aA6s3IBipmCf/zP0sxMhxx5y+WlbztcuuBfV7iMPXee7oeGsKYraDGd4S+fWnGOQKApJqEMGKuexFDiaIrBbP0yvvQoOdP4oc+8PUrNy2P5t55sbjMwY1m6eu8m27KVeKIdw0iiqDphGBD4NrZVpFadYnb6OMWFS9xol9TWuY+W1u1c5X8vl8aYnXpvXWNJZwfo6LoTRYlelWplirnpYwTBtYlSAt1IEI+3EU+2E4u3kskNoCiLTsvegftpbd+9Zl+uW2Fm8uiiM3+DCD0Ha24cLZZEypD82bexZseafiS3WsSrl7DmFm3mbmkBPZFB6AZBfZL8+UXmWL9eYebtbxJr7W5ma3vVIjPvPE+yZyuqEcOrFggcm8roeULPIfQ9iuffJXBrFM4dWeaPAVB1hVhao158H5gBVJX44FbURDIiH52exLmBEJCuizVyGaO1PaoOum3X2tnh60UQlSU22jsBgRJbP9N1UK9RPnZkXbVc1gN3fjaKYLrOYhI0CqyZnT2RbyiVuSV9bxShY1M9d/q61Tal5+IuzKK3dSCgMdaVdR2UeLxpjgttKyodvQb8WrVxfeNZ3aTZdtNCpbtTZdf2yCzS16PS1xM1deqMw+f/yMVxorr1hZEqeiz6W2m8xtTJldFUliX5p79c4v4HDZ54MsZnfijO6ZMeX/uyzTtvRm1da5L1Kg4T37qIamqEXhBRSFwDX7qUl5BC2tcw+17l9qp5jYp97jpU9PcVgmzLENt3P0Ui1YXaMFddjQ1XFA3VTGGYadLZPlradzE19hYTI6+sssgvol6bY8fuT2LGWwBoqS9gWwXKxeuHC+pGiqEdH4n8Igg8t0q5NEYQLp9rRdHoH3qErp5DKKqBqpmoqh4ROi55Qds69123v1p1hmL+Eo5b2hRdfei5q2oNQlFR40nSA7uojl9cplm5pXncUrSLO/TZQeJ6jPHjFomcjqIqVOZGUeU0qq4ghCTeYqAZFuVLR+nemyXRbVAZcZDODKlWg+KkhY7LlsdaufjKZRQlJNuXpDpv4zshPfuzmAmNkSML190KCN0g3jtAYNUjMtFyESklimliZFuxp8ZX+D6EqhLr3xL9kBJndvrGwRRC4C8xn+i5VoSqNsx9N0Aj+ks02mk0iNC0ZjlkoGkiXA+8hbkb+krWCyklXrmAV7pBzpWUBNbiO6HoxnVOfn8gpST0POypG+d5LTXNKYa5aq0g6XlNQSp047oUNlo8ydUgmtCxb9p8u2mhsmu7zi/91YhJVCiQSgj6ezWe+WadV95c3J21bU2z/6lBPNsn1RlHKHDl1eVRBWEI5874nD/r84efr3PHAZ2PfiLG3/+VNEjJ179m88arLpcv+k1yyfTWVgY/sYdYWyISMC9eYuHo2jXbv98hhEJr+x627/kksXgLQgiCwMWxS3hujSBwURQVTU9gxrJoWhzTzDK47XE0LcbIpRcIgtWTKq3aPBfPfe3/Zu+/wyS9rvtO/PPmylVdneNMT46YAQY5EJFgDiIlkrIoyZZs2ZZX3rWelaXf2pZsyUG2tLa12pVsyVSglpIoRgkkQRCBAJExGEzOM93TOVV15ao3398fb3d113SqnhlA8rP6PsDTPdVVb73h3nvOPed7vodd+34I3YgTjrSyZdtjXDr3jTV3BZKk0D/4MC2tO4M+4r7L1PhbzE2fWoVyKaHrMTRjMa8lgvOVVGRFqxsW17XWJTG4rknsQA/hdBvF44HBE76/INoo45s2kqosnB9IStB+tTYyt+5EMFLtdN/3EaqzYxSurM6WibToCKDvthbsqktLX5R0f4Srr83Rtj1OsjPEueem6NyZIJzSuPraHKGYhhZSQIJUT4QdD3Zw/rkpZEUinNAQvmDfk92EkzrzoxVCCQ3X8jCiwT3ZaO5Kmo6qqkiyQqR/EOF5OPl5tFQLvutiTTcuQJIso7e0sniDWh9+P63ve2KVAy/8FIu/L9OfUxTkUHjN2hVJNwLWUGc3Rk8/ems7ajSGHI4Ei5eqIqtL9PDNwqtU8M21m89tCkLglcsIe6Nd4XIdGW6ZBtZm4deq+E3kcoS/8blaM5P4toWkGxid3Wit7biF/Ir3SapKZNfehQMLzLGRNdmrzeKGjcpLr5m89NrSww8ZEh95MsLtB6+z8hJU5k3yY5WA+TW3TrdCEeT+JsY9Th53SLfK3H6nzgPvM3joEYPTJx3+4L9XmM/6bPnoXmZeH6F0LUeoPcL2zxxqMCqSqhHdvge9rT2wegteS/nCGYRjY3R043seTvbme6bcCoQjrQxse5RwJI0Qglo1y/TE22TnLlAtz9YX41CohVTrdnr67yWW6EFRNLr67qJSnmZm8p01ji7IZ68wNf4WfVseQlF1UultdPfdzcjQCwh/5S6vrXM/3X131w3CfOYS49deWdUoCOExM3WSYqFxkUulB+nqOQILasFT429SLq4djnFdE7YINBEmeecgbrGGJIEc0vA9HzyBcD1qo1n0tjhaOopvuUGL4HWCwOb8NMPf/sKafwdoG4xhV1wsQybRGSZzrQRCoIUV8hMV7LKDZihBX3U70F6qFmxCcRVFlejelyTWHkJWJKp5G98HWZGRZQktrGBVXIzYggads3HAOjAgOXzbRIlEgxCFEPiug2dW10gkS/XaAkmSbnhxXGtnYXT1kjxyD5Ede4IdzfVsJyEQwq+TGm4EwnNvelFbfj6+8zdHgHQj+Nata6lszUxRvXaV+IHbUSJRWt/3frK+jzkxFjDpADWRJLb/MLFd+xb02IpULp5tiqm3Hm6KUrwcpiV4/ajJ3//xxuZHviOo5W0qWRPhC5zq6kk2WYaBLQof+EiIhx8NoesSb75h8S/+9wJTkx6tbTI/9/MxPvN3Ivy33y7jlC0qEwXMbCUotsrVGjww4fvY83P4Vo2OD3+azPefxsll6wPWrVZu+ubdOkj0DNxPPNkLCFy3xtClp5mfu4B/3YJvmjmmJ45Rrcyx/9CPoRlxNC3MwOAjZGbOrrlb8TybybE3iCX6SLftQlY0egbupZgfYT7TSCGMJXro3/o+FEUPDFxljmtXvofrrp6QF8KnVBilVBhteF2WZTp77qg/lnz26orvuh5K1UC+GgxL3/EChdgFj1qSZXzbwS1b2NlAsda3vVvyHOeulpg8V0BRJfSoilVyKM9adQMgqxKO6VHJWmgRhcJkDTVkY5YcPMdn6PU5xo7PU5iu4bs+w2/O4Tk+F1+cIZzSqeYs5q6UiLbqODUP1/ZYt6mm72FngnCsW8xv+nqEENSGr2w6lOTb9qoLsdHTR+fHPoPR1RMYq4WcTW1sGDszh1su4VsmwnWQVY30I08SXgzFbe7EN/+Z9fA3Zo5vjFtmTAF8n+xLz2J0Bey78NbtdH3iczj5ebxaBWQVLZFAS7cFO1PLJP/Wq9RuoIL+etywUdm5TeWxh5ZmhaJI3HeXwdvHGxc1SYZUb5RwUgcBuXQZs2hjFpeSUaEQ/Pp/SbFrj0Zm1uOrX67y4vMWxYJf1+abGPf4y6+bfOyTgScmPMFd/+ZJrLyJngzhVmzu/rUPggRnf+d1KhMF7Llp7LkgTlgbHapv6eVQGFnT8BakFCRFRTZCSLoe8PhVDd+s4VsmcigcyFAIgVct37IE4nKEImm6eu4IaMBCMDNxjMzMWdb29gTF/AiTE2+xZdvjC8dopb3rINMTb6/5PbZV4sqFv+LQkZ8mFEmjaRG27/ko1XcymNVg8dH0GP1b30cs0RN8xi4zfOV7VEq3pmHZRvAqFl5laQx55dV3tk6uCcrnJlArBM/VBaxyMOjs6spJ7tSWXrMrLvaCQkRhqtHg5saCseWYHuayYt/lv28EPdFGqKUDMzcTVKovFnuKgN69IqErBF61GtQcCEHp/GkKx15f/eDr4bp8ihKJ0vbYhzC6AykeJz9P5tlvU7l0NghN+n6DMZCN0OZkRP4W7wqcuRmmvvJF2j/wcSKDO1Fb0qiplnoORvgewraxZ6eZf/l5yudONpdL2wA3bFSiUZmtA0sfd114+Q2Tv/hGYyxWi6j4niBztcjshTy3/dAg8e4Ix750Gc9e8CIkiZlpn6/+eZG337RYK6Q6OuLy2iuBFzX8jTOMfOv8qu+zC+vEZCWJUFcvLfc+TPnSWQrH30Rv6yB5+G6EEKjRGL5tY2dmKJ49QfLgEeRQCElRsXNZiiff2hSlsRl09txeryEJchdHaSZ8kJk+w5ZtjxF0MwxqQtYzKgBmNcvQpe+wY+8n0Y0Y4UgrW7c/wdWL38Kxq3T1HqGtYz+SJON5NlNjby7sLtY+n5AcRZU0bN/EFrcoHv63QNY0lFCU+MAehGMhKRqybuBWy5TGLuJeZ1SE7+PkMuitbSBJwc9bsEiEegfQO7qDPJ9ZY/6lZymfWy23tgBJCiRG/hZ/7fBtC7cYFDE72Qy1kaG6eKtXLWPPzVC7NhTsXm4RbsiofPCxMLou8frRlaGWwwcNXnx1+cIiUZis0rWvhfmREnNXCsQ7w0jyUrzXrAl+898X2WgTcPaUw4WzwZs67xkg0r0UavMsl6t/0US9gBBUr11Bb+9q2G76jkPhxFu0P/ohimfeIb7nIKGuHuL7D2NOjQVyDC1pKpfPrRuOMCItyKqGa1exa0U2Mg6SJJNMbWUxdlerzGFZzcn1W1YRx67WZWLCkVZUNbSgP7Y2splLxCaO0rvlQRRFo7V9D8XCKLVKhr4tDyIrQR+KfPYqk2NvNNSyrIaokkJCDuTy/5oK/4yQxC/+mxSGAaWi4NibFi98t7bhmqpq8MnPRvnqlyrv2rnv2K2SSMq889bm4vt2KaArA3VJGElW8GwL11yZSBeeR21shOiOPQBB5Xkk2lTydz0o8QRKOIhKuMV8QFNeJ4claRpauu2mvnN9rEJ3+lusgKSqtD7yARIHbsctl5h56iuYE6O3PsR4HW7IqHzmh6LEY0GS7o7bDM6ct7Gd4ETHxt0Go2JXHNJb46iGzO0/sp38RIVQYimZ394h8+SHQnR2K5w5afP6KzalNXTAPG/J8SqP5bEKNWRFJrGjFTVyczRA3zLB9/BtK/hdlpFUjdrECPOvvhCEH3y/HjJbC4qqk2jfzvzUOWRFw4imsWsFJFlB1UJ4joljLS0IRiiFbizx4i2zgKqFG+o71oKqhnE9C51YIJOhaKhaZEOj4ns2E6OvE4l10tq+B0UNMTD4KBCEv4QQmLV5rlx8CsfeWME2IiewRPONyhZC8vWftwKaBkfu1vkv/76Aqkn80OeibN+l8fu/XQwKIaMSqirh+VAp+3guhMISA4MqH/p4hO8/U8P3IT8fLJahsIRhBIberAlMMzhRVQ2OpSgSriuoVgWeG+QEI1EJTZNwHEG1EtDgkymZu+4PEY1KXBtycR1BsdDcRfu2iW9vYufne9SGL+PccTdasgW9rZPEwTvIH32tuQrptR7I8oS/L9Y1KEgSiYN3oESizZ/3BghYhVJdEima7MEsZ3DsKv4aOcS/RaD9lThwO5KqUj5/CnNi7F03KHCDRuWnfm6pOvO17/bwD38+w/Ts6oO2NFPj6g8mca3g7+GkwchU0Fuls0vml38tSf9Wheycz5MfCvHicxa/+R+KG/Y5yl9ckpKYfWuMO/7l482dvCQR6u5DT7fhey6hnoHVWTICrLlpIlt3EB7YVs+x1MavrXt4q5bHNos4tQLpvttwzBKhaBo9nMKqZFH1CNmJ03XGlaZHURS1zrJKt+/hnvY9zV3LiktTUJTmjKttFbl2+VnCkTaisQ50I75wDAnLKnL14rcxq831VKn5JcpebqFb5sbYvk1ldtajo0Mhk/UoFgVKIEKMoQdSP5WqIBSSkKSgjskwgtdrNbHmvHBcuHTeYXLc48IZm3/7X9K89pJOseDzk/8wTjwRGIpnnqrx7W9UeeixEJ/4kQjbdqj8H78WtFD4lz+fJRSS+aHPRdl7UEPTJIavOHzx98pUyj7v/0iY9z0e7NQzcx5f/mKZocsuh+/U+cRnokRjMtWKz7e+VuWdoxY/9tMxHnkiBJLE3gM614Ycfvs3iu+ao21NT1A+e4rk3Q8gGwYtDzyC8D0qF8401KPUIcuo0ThqMoWaSgfKt9eFDLyFJLysG6jJFEZXb7BbuS4JLhsGkR17aXnw8Vuqe5ZoHcQIpRC+iyQrSJJMPNVHfvYy5cLGdR3/X4WaSMGCYrKaakFNpvBKhVuSN1n3e9/VowN6WCHWHkKSJBJdEeauFJi9GMhG7N6r0dYh8+9/pcj5cw73P2jwv/x8jP/3j5RV5e6XY1FQEkCN6DjltRe03BsvBUqqC1AiMazZqYXfo9iZGarDl/BqVYpnj+MW85TOn8LJZckfe51Qdy9KLBHQODexGPiujaIaCN8LqLELYaXlUBQdSVraldzMZJQkaUXv+fVQKU8xcvV59hz8TH1n5HsOM5PHyWev0OzFKpJGRElSEvMrOkauhl07VPbv0+jpUTh33uHiRYe+PoVaDQ4f0iiXfE6dcdBUicOHNJ59weKuIzqJuMRzL1jkC2t7yotnnJnzmZ706O1XuHLR4Qv/T4nsnMcddxv81M/G+NbXqzz77RrTEy7/9JeS/O8/m6074J7r88y3qnz1Sz4trQr/9BcTdHQrzE3DnfcafP97NV56ziSekCiXBLoOn/iRKC89W+P1ly3ufzjEJz4T4fIFh9/7rSJmVWDZgi99YZ1dnyQTHhhsOl9nzU0H8fHrFgjfssgffRW9s4vItl1oyRbanvgo0Z37sGYmgvi66yApKko4ghJPoLe0obd3IFyX2tAlvOuMijU9gTOfRYklUMIRWu5/GDkUwhwbwbetIDTc2k5k63aiu/YhayrmZCBffytQzo1R0+aQZW3BsKh4rollri4/855AUZA1HVnXg34nC/NWUjW0ZGqBzuwE9N2/pnbSdmYW37JQQiFiu/Yj6wZObj4geCyekyCgqVdK2LPTmOOjDWvljeCGjMqBPXq9BXAkLLF/t0ZnR7Aomabg4pWlQVmaNbn4vQmQoHVrnGTfkvBjqkVmatLj3FmHYkHw8ksWf+9nomzboW5oVEoL4S8Az/KoTFw3wCRIdoaItGjMXDyJcBdvoqBy5XxjWFaiTr2sDl8CAbWRKwALDLLmK+191yE/cwnfd8nPXApCXp5NqxGjkp/Ac62GuhBZVht2Sq5rBbTgGxiHtlXatEKyqoYaDJEkL+x2NmHcCu4caa0HUyrjNJGo9wUMDbuoKrSmZZLJgPQxO+fR0a4wOemxd4+Grkvcf5/Ba2/YhENQMwWplES+mbVkoeZJ1SR0HT708TA79mjE4zKdXWpQurSGbZIV2H9Q56HHQ6RSMjv3aug6lEo+J9+x+cyPx9i2Q+Uvv1rFrPnEEzIPvz/M7v0aP/kPBbohUS76JFMypWKTlFZJIrpjT6Db1QSKJ9/GmhjFX8XrdOYzzD71Vdo/8Amiu/YiGwbRXXuJ7tiNcIMe7JIkgaIgLeyShRA4mdVrttxCntzrL9HZ2Y1shDA6uml79ENBtb/vI8kysmEgGwbCdck8+22E72N0faq5a98AVi0PfwPIZNG9B2m5634kIxS0YZAVJFlCDi21gdA7uuj64R8PdgO+H7RQsG2cbIbcq9/Hzrw3LEoIWHq5V79P+sHHgjGwfRWJJCECcVjXwTdNrNnpQM145sYLyW/IqPy7f9lCIhEsRMWS4F/9Qkt9DRwecfmpn1sKTSV7o+x4uBsAPaYycy5f/5uigGWBrkuEw0s5k5YWmXB4aVHzPMH1RbGla/P4toekyGgxA7fSaF0jSY1td6cpzlkomkyyS8c1PTxH0LolgqorzE9UibUa6GGF/FSNWsGhc0ec+fEqru2T7otQzdnIqkQpYxFOaJSz9rrFa0L4+Aty+b5nYy/IpxTmrmJV81xvLTzPbpC0mJl8h6FLT69akLgRBGJTXlGyZetSu2SxZGE7e26nXJpkevztFee7GnzhoUsGqtRc6C2X85me9ohEJCxLcPCARlurwqUrLqOjLjOzHt1dCoYuMTbmYduCmVk/aAZnN3d9kahEa5tMds7n5/9Fiukpj1/7pRy9Ayr/7r8siVyudrsefDTMBz4e4f/6jwUqZZ//36+mkCRwHfirr1R561WLj/9whF/+9RZ+9z8XuXbVZWLU5Vd/Kcfo8ELDMD8Ys4rSnH8gSRKoKlKTUzJYxNY2/E4uy/TXv0TswGEStx1Ba2lFCYfriyELRYpetYJfq+Lk5imdPbFmAV75/GmE55F+3xNoLWnkUBh1wSMXnodv1qhNT5J7/QdULp8jPDCIVy6t2SHxf0bo6TbC23YBi0IEK++/rGnoy0gKi5EJLZ6kePzN9+I0g/PQDYzegaAnjeciPDXYgSzvQbRQICspSqDeoBso8QTdn/lJpr76J1hNSMashk0blUhE4md/KUNu3icWk/H9ICm5OHGu9/4qWZPxdzKkt8VRdJlKttGTPXBQ4+d+Po6zkOjv7VP46CfDHDys1d9z7ozD1/+i0VXpfXQHUy8PkdzeRvtdfVTGC4w9s6QsalVcZofKtPZHiaQ0+g6mKM9ZmGWHvY91UpwxiaQ0evYnqMw7hJMa5YxF38EkobhKYcaka1eMcy/M0tIbpm0wimbInHvhxirwrerqHSS966RLNC1Sr0x+NxGOtLFl+xMLnSulhap9n0isE1UNsWXbY1RKU5SaiFlLkoQnXHya2yW9eTQwtHOZ4OfJU059nJ86Hexyz513G/LGs3MbM6ckCWJxmcEdEh/+ZIRCwefiOZuf+JkYP3jBxPfgrnsN9GW2r1QKcjftHTKlosCsCeIJieycx3zGY/d+nYHBYCzqOrR3KRRyPl/5UoWuHpWePoULZ2yGrzjcdofOxJiLrksYIZnpSQ9/gRjQ3asQjUl4HvUup75jUzzxFtWhzSviWpPjG4bKfNui+M6blM+fxujqQW9tRw5FkLWgaZtvmbilEk5mFjs7t66QIUDl0jnMyTFCfVvQ020BbVgIPKuGk81gTozhVQJ9PTs7x/wrL6BEo5iT6yt/10aGmH/5eZAk7JnJm6oFE45D5eLZQCvN9xvk3tf8jOtSPHmM2shwUNQ5NYbaEkNtiWGNLTjIsow1PU7+9RdBlRGuF0gG+QJJ15A1BSe3dnjTr1VxrmeNCkFt/BrZHzwH0HShauXy+XrN3WpsLjkcIXXPg7Tc+z5kTac2PhIQOPK5lWNGkVGMEFprB9Gde9HTrWgtaRK3301mbvqGyic2ZVQWZVOyGR/XFezYpdLeKfPMt0xqq7QD7tybYss9nehRlURPhJNfHaY8t2Qcrg25HDtqIUnUJ/qLzwdGZ/nEX01GKH2wi7l3xmnZ30nu/Cx9T+xsMCqKKhOKabRvizJ2Oo8eVhi8O83lV+Ywyw6FGRMhAuNTnDVxbZ/OnXEiLTrSWBUhIDtapVZwsMouO+9v49o7OXz31sZHTTMf7FYWQhKRaHvgSfq3vshyEYpq0NN/L8lUUPHsOFXGR16lUp5h/+2fR9OiGKEUgzs/yPlTf74BA0wiqiQXNU5v6HzW2lxtNhSdapH5l/8uRbkkGLvm8jv/Z5HsnM9ffaXKj/xYlA98LMyFM06dyQUwM+lx4azDr/zHNPPZYDdz9qTDPQ+E+Pe/lWbsmsfcrIcvIByV+fgPR9l7QEP4MD7qcvqEjW3Dl/+kwg//WJSHnwhh1gTff9bk6W9W8X04+Y7NkXvi/If/K83JYzZf+H+ChVfYNoWjr93QPdsM/FqV2vAVasNXbvpYXrlE5cIZNiIpe6Ui+TdfbuqY1aFLKwyrEWlhYO+TZCfPMD99rmEwtA+EiKY0ZoarhGJqIJlTdPFcgar5GIUL+LkLFDI2iiKR6tIxwgqlrAMSC43UAsKHXfMDo3LsjYbvD23tQE1G0Nq2g+8HkkGGTWX0BEZ3EJlRQ2Gc+RJusYawHKoXNu/Z10aGgtzYJlA5f5rK+dOr/1GSiO7cExiUUJjq0GVmv/P1oEfOul0yNZxcltZHPoASDmO0d6LE4rj55sg6y7Epo9LeKVMs+IwMu7R1yFiWoFwStHXIjI2s9FKP/NhOKvMmQz+YZv9Ht5C5UsAuLy2WJ487nD298eK5mtKCU7Zov6MPJaSSOTZB/5O7Gv5u1zxGjucYPZnHNT1OfmsSSZFwbZ/JC6W6KNvlVzPB74IgPqqA5wqEv9S5T9EkyvM246fym7hbzcF1qlRK00RjXcBiD5IWKqUN+lbcMCTaO2+jp/+eupz+7NRJZqaO43sO1y49w/Y9H0NWNJItW9my7VGGLz+zrgqy5dWoeqUVSfrrSQnvplBfuST4xCPTC98Ljr0UMv3uU1VeejaQ8bEtwZ/9Ubm+ozZNwW/8ah5Nk4JFxoYrFx3+zS/mUNUg5AVg28Ei9Ae/U0JTg5CW4wgWc5pnTthcPu+gasH328uUtS+dc/iVX8hhhGXUqE4oqWOVHBRdxjVXzhvVUOpsyWahqAapzt10DBwhkuhCVjRcu4JZmacwd4XZ0WO4dvO071sJSVJQNCPootqkpxBL9tDWdxjXqZGfvRx001yAWfbYe38LvbuiZMZNQlEZq+oTT2soqoQWUnAsj2rBA0lQzrlohowQsP2OBAgwIgpj58sMnyzhe6uckyyjJqMLYqYSii+QDQ0lYuBVgpIDqxDklNxMEa09ufIQqh4UEa/S3+hWQlK1QLF6QcU6tmsfcigcGMvjb62ZK1sO4TqYk2N4tQpKOBzkyG5QrXlTRmXsmsfhOxV27la5cM4hmZKRJJiaWH0CPP3LR2ndnqDnYCtm0Wb3+/uYOjPP3KWFDn8+K3IlzWLkr87Tcc9AfXcy/eq1oLZElhGuixwKIQwDt1BA0nWIRnHy+WC73jCIluShfc/FF4FUClJQTIaikNjSysVX83i3eJeyiLmZ07R3HUSSVCRJprf/Pi6f/8t3pS1xIjXA4M4n6xX8peI4Y0Mv1ift3OwZYsk+unqPIMsqHd2HKZemmZk8tkZIThBTW3B8i5LXGOK7XresWbrzjaK8Rn2T70FlWXfRxVDrImwrMAKLEGIpRHU9LFOwWtZBiMBAscr6sXi89M4k/Xd2MHVmnvmRErsf72X4tWnKcybJ3iiSBMXpGrvf38fkqSzFySrhtIERVZm/VmqQiFkORQvRt+sxurc/gFnJUClMInwPRQ1hRNL07X6M/OyVvzajEm/dQnv/7YydfxbbbK6wt5QbY/LKD8jNXFxRfKsZMpkxk2LGppRzaO8PMTtaI9VuEEku6MZ5AiMS7E5KWZt4WkOSoDBr4/sCs+RRzKy9+JhD05hDzRN0rInG0JUkyXRuuQdVMxi/+MINhLMlQulO1FAMu5zDLq4eGpNkhVjPDqz8DHZxPmD1xZML5At/Y9n/ZVBCYWR1QdnDtvE3CIeuhU0ZlWpV8NoPlqbU22+sbxGED5nLRTKXiyiGTEtfDGeTHthaqEwUGP760hZw/NnLqOlWjN5eqhcvIBkh9K5OauUykqqi9/bilUoI10VJJvErFZBlZF3Hd1xCAwPgC3yrFuxcfB97egqtrY0aaZSBrUjzx98V7a989grl4iSJ1AAQKATn5q8yN3PqltIRQ+E0W3c8gaYHyVPbKjN86Rksa4lO5To1JkdfI57oJZboRdOj9A8+TLk4Qbm0OiMk784go+CIxuXWtkoN5x9P9AbS+f8fRXXewqk6CF/gWR7JvmiwYxIQimu070wydSZHsifC5Mks8a4IvYdbEb4g2RPl0vMTqx43luqjrf8wlfwEQye/iVXN4QsfVTXQQwlUI0at9Nekxi3JJNt3EIq1bqqvim0WGTn79Kp/m5+ymJ9aGmuF2WAdKs6tPTezE8H7Z4bfGxqZqkdItg3i2BXWI1SsCVki3N6P8FyMdCfF4dNEu7dh5edwKgXifbuwSvPU5sYRwkOLJLCL8wGTa3GNkmX0tg7MJvJKcihMdNdelGjQ4M0p5PHKGxc+r4Z3vU5lEZ7lk7nanJfSDGL9SQY+vBc9GQIJPNPl0tdH0Ts7MUdHwHNZfJjC8xaUbiXCu3ajJpN4pRJyNFp/AJKioMTiOJk5hOPUC4QWu9Yp0WhQNr0JSDJsvytNJWdTyTs4loeiyEgyOJaPoslU5m08z+ba1efYc/CzaFoEVYuwbfeH0I0Ys1MnFvqQLIn2LdajSJKCpkdJt+0ilujl0tmvsxbXSFFD9G15kGTL4EKvFofR4RdXbdRVKc8yfOVZ9t32OVQtTDjSyo49H+PM8T9etVpfCJ+U3gNOUAi5iHJpCs9z6ruiju5DzEydoFqeWcVzk+re1SIi0Q66++8hkujCdx1ymYtMjR9tihknSTKp1h1YZoFq+eZpnJIERlShcyDE7rsTbN0fpa3PIJpU0XQZ1/ExKz6FjM3sqMX4xQrDZyrMjZlY1eCaijM1rrw0Re/hVioZk2rWojxbI70tTsvWOFbFRVYlqjmL0kyVVF8MSYbCZJXS9NqLoR5KoBtxpq68QqWwZPht19pwZyDJSz1vhBAI311VlkdRDZBkPKe24jO+56x4JpIkIysasmrQ0rkL4XuoehhvWWtq167ROF4lFNVokNS/vuX10nkryIqO55goC2Em33PwfTf4XllDCA/PtVltTsiKHtRmLYy54BpWCUVqYXzfw/fslZ9xnRXRBElWkWWVcKydaLKb4vw1VCOydGwRhLxX3N9YCN9yEM7S8RRNJ9Q5QHHkPPGBvSAEiS17mb9wFKdaJNzWi13INCTThW1hTo4R2b4LSVFpuech3Pw85sQowvPqIWkJCWQJSVbQ0q2kH3yc6O59ICt41cpCEeyNhZHeM6Nyq7H9s4eYfnWE6tTCpJFVjIE9CN9HTaTwaxWUWAxZ15E0LfjdMFBTKeRwBDeXQ9Z1Kpcuovf2ocbimENXiezfjzk0hBKLo6aCZlmSrlF6+yhik/0OJEkiktKCBKKh0LMnhl3z8D1wLQ+r4nHlzSBklJ8fYvTq82zZ/hiqFsUwkmzf/VG6++4inx2iVpsPBrasomphQuEUkWgnsUQPkqRQKc/UJ/kqJ0JH92E6e48gSQq+7zE3fYrZyeNrhNgEucxFxkdeYWDwUWRFJZ4aYOuO9zN8+Xsr5PUlSUZFQ5W0htc912R26gQ9A/chSRK6kWT/4c8zPfE2ldI0vu8hSTKKqqPrMXzfITN7bsG7g2pllqsXnqJnywNUyzPks1dQtQhqKIFZnScS7cC2S6hqGFWPIEsKllnAMvPoRgLXNYPdEoH8jBFOIUsynmtTKU+jG3F0I4GiGrhOlWp5btX7EUko7LsvyRM/3sWO2+Mo6nqe55I8iRDw9P+Y5Cu/GbQEaN0ap3NvCrviUp03mT6fY+CeDiqZoC2EZ3vUCjaTJ7Nsvb+LyVNZKhkTI6qRs9ZhFnkOvu8QjrU1r30jyUST3XRuuZt0915UPYrrmBTmrjB19VUq+fEGA7/zrh8lEu/g4ltfonPr3aS79qEZURyrQm7mAhOXXsSsLIRoJImWrj10b3uAcKIDPZQAITjw0D9m+QJ/8oXfWvoMgRzL4G0fJ9m+rd5BdOzCc4xffH7Fgp/uPsDWAx/h6vGv0r/3/UTiHWQmTzN5+Qf07nqE1u4DmJUsw6efophZSoRLskqibZCebfcTS29BUQ1ss0h24jQzI29hlrMN53j7k/+c/MxFZkeP0b3tARJtW5FlDauWZ3bkbWZHjtZll2RFp2vwHlp7DhJOdKBqEdoiKdLdB+rHdO0q73zvPzXcW9lQaXt8P9ZMgfwbS2QKt1amMj28QAEPcryVqWtEe7ajRRILenAGWjSJ8BwkWUG4LuXzp4hs2xkIgXZ20/OjP401NY41M1WXmZI1HTWRQG/rQG/vClIHkoRXq5J/61XKaxEBmsD/tEbFLpiUR3NUJhaNioxWvYyby6HEYgFjI59fmGTgZrOARPXCedR0Gnc+h1cp45smzuwMbi6Hm88hXbqIm8+jtqSRQwZuLoc9NxuEyzYJ3xdMXy4jBBSmTRzTw/MEiiJRKzkYkaXbL3yX6cl38H2XLdsfxwgFib9orKuexL9RJBL9DAw+gqoaCCGoVmYZH3kFx1n/mibH3iQW76G1Yx+yrNDedYhScZLZqeMrdhr+GjukyfE3iaf6SST7kCSJcKSVwZ0fwPc9hPCRJTkovpQkivkR8vPDdaOyGqKxDuLJfsavvUxn7xGys2dJte7E9x1cxySZ3sbEtZdRtTBtnQeZnztPYX6IZMtWUm07KGSHSLXtZOjCd2jrOojnWoTCaYTwqVVeWrEex1tUnvx73Tz6uS6iycb2yBtBkmDk7JIxmLtcIHO1WCeJXHttpl6EO3Mu1/DdU2fmET4UJ6sb6idWSzPUSnO09h6kUpwmO3kaxyyt/QEgmuhi++FPoRkx5sZPYtcK6KE4bX2HiSQ6GDr5TUrZxl2sHkoweNvH8T2HqaHXAEGibTsdA0dQVIMr73wl2FUIMCvzzI4dQ5JVtu7/EI5VYebaWw1MQuc6Q+k6VSYuv0Rm/ASRRBdb9n9w3WtQtRA9Ox6iMBfki9r7bkdVw/i+w9TVV+je/iCdW++mnBsPcoaSRLp7H1sPfATXrjI99DquYxKOt9O59S4i8Q6unPg6zrLdnUQgExNNdlPJTzF+4QVkVae1ez/9ex4HIZi88jJCBOO5nJ/EsSuEoq307niYcn6M2dGlfKTvuSvmjhI1cAtV9FRk6UVfUMtO4ppVjFQ71dkRjFQHTq2IUyvhRkr4bpD3cGvlIP+xMDat6Ukyz32blvsfIbpjD7KuE96yjfCWbWveS991qI1do3jqHUqnjt1U2P2GjIqqSTzy2U4e+FT7DX/xjeBP/+01Lr8TTBZJkbnzXz9JbaaM73q4VYcT/+lFANyFHYWbW0pS1ZbpHnnF4sLPIJfgzi8lmM1r14LX8vkNz0cIgb8sXLDCyxUwO7S0QE5fvt7bbPT4PddkeuIY5eIkvVseoLV9b9CnflXpFVEPV5SKk0yNv7lqMlDTo2zd8X50PRp4tMLn2uXvNcUuc+wyY9d+QCjcQiTajqIa9G15gFJhjGplKUbvCw9H1FaVva+WZ7ly7i/ZuuP9pNLbFuLqi+E7efFKwN9Ebc6iJIYkARK+75DPDmFbBbr770VWdKrlWczqkkadED6V4jRz06dIpgfR9DCeaxOJd+J7LrnMlZXEAlXiwU918P6f6CYUacwHBL1NFmrJWBY1lxZryiQqeYerJxqfeUMr2ODiF4533cv+yveshVo5w/jFFxg89Am27PsgnVvuJDdzgdmRY4F+23X3VZIVurc/SCjaytCJrzM/dQ5/Qf6kND/K7ns+T8fAEarFmQbmkqzo+K7N0Mm/rO8wshOn2X3Pj5No3Uok3kk5Pw4IqsVpqsVpZFmlf/fj2FaR7ORprHX05ITvUcmPU8mPY5vFDY0KkoRZyTJ24blg4U/1Ekl0cP6NP8aq5oi3bcUIt6AZUayqTSiSpnvb/UiSxOW3/5xaeQ4hfBQthGOV6dv1KK09B5geaqR5G+EUE1d+wMSlF3HtCkgy+ZkLHHjoH5Fs387c+HHsWgHhuxQzVwGItfTTve0BauUMc6NrRQQWrtvzKZ2fRIsvbxcgsPJBjUx1OlhDnMrSGmbllkK65ep1IU4hqF27ip2ZJdTTT2THHkI9faipdBC5IaiR8qpVnFwWa2aS6tVLONkMbrm0vmBoE7ghoyLJ0NKpM3jgva2WDceXJvbVvzjJtb88uzTfrp+sq0COhFFaU0iyjJsr4hfX9+Y2Qi57iaOv/Cb13M1i1vUGoLalcXOB2FupOM7FM1/BCKVIpbeTSA2g6zEULRRQGJ0qZi1HpTxNITeMZRbWXJAlVWN45HkYAc+xsKq5TVEci/kR3nnj/2Zp2Vy5+CuSiirpQZx2BQSl4jhnjn+RZMtWWlp3Eom2o+ph8EUQorJLVErTFAtjmOb6bBXHMdGMOJFoB0Yk6McufG/ZpA3CBEY4hWbEMDwLRQ2K9Hx/0fj7SARMwXJhkmppGsepcv2WoGNLiI/+o94VBsWqesyOmUxcrjEzYlIteWi6RDShEE1pdG0NEUupDJ2uUCm+u+J9CzeA+amzVApT9O56mGTbNrq3PUj3tgeZGz/B9NDrVIvT9WtTtTBtfbeRn71MITNcN6bCdylkhqiV5ki0bkPTow1jxXMtspOnMStLxtqsZKkWpkh17kYPJyH/3go8lnKjCN/Dqs7juza2WcIsB+dnVfIL9OqAdRiOtRNPb2Hiyg+olufqi6fnmBTmLtO59a4Fo/I6y8eBWZ1nfupsYFAAhE8lP4lZmUczoqhqCJsb1yHzLZf4/j60dIzaRA6/dmtaIHvlEpVL56hcPr+Mzr98ji54RJtU4tgI/9OFv0LtUXoe2b70gi+wcjVmj61ftSvHo8QfuRc5HkHYLtblYWqnLzZljNbDpqiCsoSSTODXTIS5bJciSehbevHKlTpBQAgfszbP9MQ80xNHb/j8unY+SDjRjlnKoIZilOaGmR16c1ODaONrlDDkCPI6xY9qPIHbYjB8+buEOvuwC9kV3QHXYgeVC+PYC2ETs5qhUpoinhogO3MGyywgyTJaVxfWyAUKuWv4nkMiNYDnmMiKjqZHqVWzyAt9anLZK0EjKUlF1lVa2ncDgumxtxqICA99up1IovGcSjmHF/98hhe/PEN2cvXJr6gSrT0Gkqxh1967drZWdZ6hE98kFGsl2b6ddPd+OgbuIJbq5dLRP63vLkLRVmRFRw8l6By8Z4UWnaxoQY5KblwehO9Sq6yktroLhmcz7K5bBXehNcBiOHW5ERT49V0jkkQo1oasqIRjbfTufJjlhkMPJZEllVC0dUW40bHKK0J1guC6FXVzOnmrQfgCNWogSRJqPIS9zKjIMnz4wyEkCcplwfHjNnfdpfPss8H6YRjwIz8SJp8XZDM+x96x2bFDZfs2FQFMTXns2KHiujA761GrCfoXxFtfecWiXBF85CMhjh61mZ29NWP1fzqj4tsetellOwxZItafZPvWg1z4g7W7Hho7tiBFQhS+9X38ai1gmNykQdksJMMgcngftfNXcKeX9NEQguqxG0+MbYTs2CmyIydIdO6ge9eDzA2/jWqESfXsxbNrpPsOYpbmmLr0Cp5jEmvtp23LEWRFJTPyDsXZITbagQUEgbUnl97SRurQvdSmRgn3bcV3LOzlRkWSMDp6EJ6DdZ2A53KGmu+7zE680/B32ynTcegAhWtnF9SVITu7eldQgPnZ86haBEU16uKZtcoc/rJksGZIHHq4peFzvic4/lyOp78wSbXooRlxWrr2EIqkyc9drieEPVcwN+ZgRKIIIaHqYWRZwzYLKKqBqkfXlO25eQjMcgaznCE/c5GenQ/TNXgvbX2HGb/4PBD0/IGgL0k43rHqUXzXXvHEhRA3XLvwbuF6h2dtB0gKQslAS+ceUh27Vn2XcFay7ITvrdM/XuKGKMPLjyBJ+LaHWypizzaGshQFHn/M4E//rEqpFBT0/tAnw3WjEgpJPPiAwe/+twrlsk9np8LHPhrixZcsLAvyOZ/HHlOYnPTJ5QRHjmiUy4J0q8SDD+m89ZbDhz8UIhKR+MpXbg3d+oaMihBQzjvMjDQfRkl36ai6VE90CiGolTxKuea1Zeyaj10wmXp5Ge9aAkVXuOtXP7D2BxUFraMNZ3wav1xFbU0hbAfP9Qjt3U70/juQQwbmhSHKL71J4oMPgyyh9XYhHIfit76PM5clcudBIof2IMkKlaOnqB47TeSOA+hbe1FiUZR0iuwffRWEIP74A+i9nXiVGqUXXsOdzpD61AcI7dtB+I59eLki2T/8KkprisTjD6Bv6SHzhb/Ay+aRNI3og0cI79+JcD3KLx/FunyN9E98Cmd6FmPbAF6xTP6rT+OXmyhoEyxQIO36pJNVndb+2yjMXGHkxFNIsoLv2YTirbRvu4fM8FF8z6Fr14O4do1qfm3V0jatj6pfQLC+p1MdHyK+8wAgIakabQ88iayHqE2N4OTnab3rYXzXpnzlHHprB161stAD3UPWDbRkIASZO/km0YHtQSMoIahcCwpgtXiS6NZdlIcuktx/B7JmYM6OU7p0ZoWuletUmbj2cj1f1RhCg+7BMPG0xvIFo5RzOP7CPNWFkJZjlSnNjwQ9aKp50j0HkCQFz6niuTbheAfZiVOk2ncSTfUyP3kWVQ+T6txFduI0jl0h3b0fs5yhlBujvf8wZjVHfvoi3gaN1pqBVc2Tm75Aa/cBYqne+uuOVQEEs6PHGDv/vdXVEgQN9N+bx7unptAUhMCxqwghuHb6KTLjJxGrOUpiZSho1ffdQkiqjFOoYnQmVv274wimp33K5UBU9XpUq4KpKQ/TFDz4oMGVKx5vvrk03sfGPIaHPa5edTl0SKNQ8Nm6VWFyMjAyzzxjcscdOl+Ta6uql2wWN7xTefaL0zz9healRP7lXxxg+6GlHIzvwctfm+XP/sPKOon1oMZ0UruWVEAlSSLcGac2t16vCglUBVwXydBJ/fCHEI5L4annSX7iCSqvH0dYNvFH7sW6fA0lGceZyZD5b18i/sQDGDuCRl6x++6gevQkKAqxB45gD48hqQpaZzvZP/wqvuOA4yJFwpjnr2BdvoaxfYDwgV0UhsbI/9VzJF2X8g/ewpkMEt1eJkfuq9+h/R9/vr6N1no6MLYNkP2DryIZGi2f/SjefB61NUX16CmKT/+A9Oc/gdbXhXVhY92gePsgsqoTSXWRm7pQXzyFEGSuHWtgChnRNKFomnCiA5BQ9AhGLL2uUck445j+xoVSbqWIrOqo0Tjhrn6UcITK0EUiW3ZQvXaZ0tWzOIV5zJkJWjt6EMLHaG0HWcHOZciffgvheyT334nwPaojV6hNjgTy7ZpOyx0PUjz3Dk4+E4hkjl3FykytKZR4fWJ+Odr6DFRNaohsVAoe45eWG3ERqDD4XkAfj3cCAteJMjd2nFCsFYGgVsngOlVKuZGF0JNGMTtM17b7sao5VD2CqoXwPYfs+MkN7+NmoKhBC+Ll4ZtaJYtZmScSb0dWtKar3G8EgsBgywvNtf76IKiWZnCsMvHWLcyMvH1DSuDNf12Qe5QVfUP2niRLOPNlfGv1cZpMynzsYyEmJz1efHGlod+6VeGTnwxz6ZJLPC6Rz61tGeIxidtuMzB0iT/+4yr/5GdjzM15KEpwnKGhm88BbvopGxGFOz/UzoGH06S7jZs+gc1CDWukdnfU/0/sbEMx1PX70/sefqWKHI8hLJvCXz2HVygiR8LIkTB+uYqwHQpPv4hXCBZY6/IweH6wE1BU5EQUFBm/ZuGXqxSffQWvWkMA9sQ0frUWtB4EjME+QrsD+p5wXOrNZ5qEkozjlSr41RpeuYpfriAngoZk5qVh8Dz8UhXZaPb+C3zXYn7sFJlr79Q9seU7l4Z3C3+hqM0mO3KcyvzqldyLaMagAAjXxZ6fxWgNQi6SrOA7FsULJ5bCKpKM8AXCsQPevefVpSMW3hD88H282hKzTpIknEIWLZECSWL+nVeRVJXo1t31AtbNIJrSkJVG79qxfIqZNQyU5+K5Fq5dRUIiHG8nmuwJ2GWuTSjaGhRx+i5aKE401YdZyRKKpnHMEr7n3NDOQJJkUp276dx6D9FkD4oaWtDaCtPStYeuwftQVIPM5FJ41fdspodfJ5Loom/P40STPfW6kFC0jba+wyTbd94iIyAwK/OEY+3EWvrrjlOQPH9vdy+10iy5mQu0dO2jd+f7CEVbkWQVVY8QTfbQOXjPmuHAzcLzbByrTKJ1C+HYEktWUVfOWSUewuhIooRXlzHKZn2+8IUK3/ymST5/3S5KBIrev/d7FV580eLqVY9du9RVRXgB8gWfP//zGnNzPvfdq2PZgvmc4PwFh337tNU/tElseqcSTarIMnRuDa2QS7hViIQldgxqZPMesajM3JxHKCQRMiTGp6uUfnCefCFQSgbwXR/hrrNv8wX26BTxx+5F39aPpCpIsoxXLOPOZfGrJtbQKGpLsh5OEl7j8bxsHr9UwZ2bx83MI8eiiNrCtS/fM0oSajqFX7OwhkYJ7duBv5iUX8jhyPEYUqgQJOsVBTmkIykycsjAUxWc2QzRew6hdrYFstqxKG5mfuV3NYnS3DUyI+9s/EbAKs9jV3KY5Sy14ixaKIZ/C8IgwvcCo1KYxy0XqE2NokbjxLbtxcrOYM1O4VUrJPfdgaxp2IV5lFAEp5DDrVaws7OkDt4FSOROvUl8295lhZ4Ct1qmeO44sR37CfcOEt2yA8UIYWVmArG9TUIPyQ1MbiEEniuwzcb7b9fyZCdP43sOsyNHEQgkZITwmKjMLzRl8xb6qdv4vktm/AS+71ItepRz4/Uq9szEDchiSDKxVB89Ox7C992F2P+CZvSCMzN24VmKmWUhYyGYHXkb3YjTPnCEVPvOunMhSUGV9dTV1yhmh26UzLj0Vb7HzMhbxFo+xbZDn6B/7/tB+AgBZ1/9/YaakHT3AVIdO1C0EEYkyGe19x0mEu/AdWoL9Ny3F8J3m4drVxm/8DyqFqFnx/voGrx34boXKO6ywuVjX74lkjZWNcf81Dm6tz/Avgd+eoFAIOFYFc68/LsN77VnitiZ0pr3OpmS+eVfTjA36/PVr9VIp2V+7dcSjI97PP20ycEDGr/2awmGh1y+8c0atx/W+Le/liCT9fnN3yxjWQLXDUoQbBssS/DNv6zxz/63OH/1VI3nnjPZtk3l8GEtEFG9yQ3cpo1KftYiP2tTLblkxm69+qYkwZOPhSmWfGYzHj/0kQhjEy6aJtHeqvCHXypxYIfM28cdCmbzC6w9PEbl9RDxR+4J+O1nLuGXyuT+4jvEHrqL6H2HcWfnKTz9IvbENKIWXJs3X0DSVNxsntILrxN94AhyOIR5aRh3bh4vV2yMwQqBef4KsYfvIfXJ92OPTOKVg0ngV2uY564Qvfd2wgd3k//q0xjb+gkf3odvO8Qfvofq8XOYl4Yov36cxJMPITyPwlPP4+VLWFdH6w29nOk5vOLGi1CtOINdW0l39F2bSm58RQLSLGeYufo6rVvuoHPHfVTzk8wNr02AaBbVsaUw3fSz3wDAmmsMn1auXarnR1Y/xtX67/PHlmTVhecx9/J3AcifDCTMa+ObkxO/HsoqRKZFufTlEMJHuEFO4vqdxnJ5EXdZQedyYcflr4sbMN7Cd5kbewfHrhBNdqMbsSCv49lUi9Pkpi9QKU6tyBO4dpVrZ58mO3WWdPd+QpEWQGCbJYrzIxRmrzSMjXJuHM+xAqXh61AtzVCYu7xmGG1+8iyuXaW15wB6OInvOZiV7HXOioQejmNEgryZ51jMT58HEexqdEUP2nIvMNIcs0h+5iLuQljP9wI69PI6mGphCt+1GxhhZiXLxbf+hHT3fpJt29BDCXzPxqzmKWaHKWQax01+9nKgpXa9VIwQlOZHkBVt1fyX7zmMX3qBWmmGVMduFM3Acy3KuZWUa+H5rNWKyHHgn/yTfMNrn/vRRpLHJz7ZyMj7/f/RaHS/8Y2l8/v615ee39//B0v36uJFl4sXb004UBKr6nqs8saFbasektlxJIHr+IxfrFItNHciizmVxeN4ruC5P5lakVORZfiHfy/O//hiCceBn/nJOPGYxFzGp7ND4Q//tMShAwZH3zEprqFK+7f4W9wsnvzJLj798wMY4cC6CCG4eqLMv/3smb/mM/tb/C3++tCMudj0TsWxfcrzDvsfasGu+Vw7fWNKlmvB9+HcBYe/92NxXn8raODluDCb8TBtwWc+GWNswl21KdgiJIkgHr5Ur7e6bL0EuiGzZX+U3Xcm6NsVId6qoelSED/PBgy30fMVLh8vU8k7rMks3ACL55Ro1ejfE2Fgb5SuwRDRhEokEfRMt02fasFlbsJi4lKVqyfLZCas4Nxv0H7KSpAIXITviRUFs7ICLR06u+9OsO1QnNYeg0hcwfcElaJLMeNw7UyFi28XyYxbTbUAMJI63bd3Ekro5K4VmTk1t+Z7JSnoWdO9LczgwRh9uyKku3VCUQU9JOPaArPiUc67zI2ZTA3VGD1fZX7KwlvlepqGtFRiEBTnS8hSUGQbb9WQ5caYvyQH59kMgkZQN3hey74vllLZdSTBtkMx2vsNYikNVZewTZ/8rMPEpQoXjhaZuFTDtvybDlctYsW4cVfu0iBwAlOdOgceTLFlX5TWHoNwXEH4UC25ZCeDsXzleJmZkaAZ3rLO1aiajGsv08FSpHrY8fp7GE+r3PlkKwfflyKSUCnlHC69VeSNb2coza90bjVDYt99KY68P03HgIFV85m5VuPUD/Kcf6N4S1pZyAq09YbYfVecrQdipLt1IvFAdNIsecxPW1w7W+Hi0SJzY83NnSWsneGXZZCW5fyEJ1aNjEsyxJIqu+5KsPP2eNDgLBk0NjMrHrkZm+nhGpffKTFxuYZV8262oH7zO5VIQmHXXUkuHytSLboNJxAJS7S3KUgSzGU8KtWlQze7Uwm+KyBrLU9rCLHwuirhuqvfwEXsvz/JP/2d3cgLwn/5WZt/+9kzFJZJY8dSKgffl+JDP91Dz44wsrzA9Lm+4HThf9v0OfHCPN/87fFNUakjCYX2vhC77oxz5P1pBg/GUHV5sT30qrlKIYJiX98TXDtT5oU/n+HsqwVKWWfViR2KKiTbNMyqRzSpUisFgyUUlfm7v7adI08u9WT/zu9P8pe/PYbvBwtk/64IT/xEF4cfTROOKSzIcK08HwGO6XPhzSLPf2mKi0dLK/ILy9F/fw+R1jC+52NXHEZeWrntDyakweHH0jzwyXZ6d4aRFp7DqvVky56H7wlmR03OvJLn5Et5pq7WyM3aTS2q8bTKjtvjpDp0Wjo1WjoNUh3awr91QhGlvrgtp8AjqOfxNsLx5+b54r8epiaFUdPJhQuWsS6PbvhZPSyzZV+Uhz7dwe2PtdSdjhX3ZOFeeJ5g6mqNF/5shpPfz5Gfs29qYUh1aPzEv97Gwfel6q998V8P88rXZ+vHVVSJrfujPPKjnRx5Io0RVVZ9bovPS/iCuVGLb/33ca4cLyOrMqom0TkY5u2ngwr41h6Df/Sfd7L1QCDKeeqlPF/4/12hWvLYfijG535xC9sOxVleY+l7MHm1yld+Y5QzrxbqDbfSnTqf/aUt3PmB1kBcXFo6H98TvP3MPF/7r6PMjd5YvjCaVNh5JMFjP9rJziOJeg5uret3LZ8rJ8o898UpLh0rUdkgwhNKdhBO91DLTizsDgRWKQhzqbrED/3Tfp78u9319//gK7N8+T+N1IttJQna+0M8/JkO7v9EG4lWfd0x5PuCQsbhpS/P8O3fm1zT+N3ynYosg1n1ufBGgWhSRVGlBjbMY+8LE4sGfbjfOGpSqd6YqyZEnUi14nXb3viiJBlUXa6ryRphhWS7XjcqXYMhPvIPe7nrg60rJDgaD7S05odjCm19oaYJK7IMhx5p4cj70+x/MEWqQ2tajFCSADmYuDuPJNiyP8bpH+T5y/97jNELK+tSoimV2x4OvLf5KYtSzqWYDa5VUSU0fSnjvGVfFEmWCIVl7v5wKx//2d6g+nudc1v8kxJVOPxYC7vvjvP0/5jkxS/P1r/nepSnKuRHivTd241ZXDlxFVXi3o+28djf6WTrgdgGyr+LJ7J0+xVVondnhN6dER7+bCdvfivDn/zqMG4T42PPvUn+yX9dvfhtza+Wgi/X9OaeoaIG75dUBa2/E2HaaH2dWFfH1yVbtPcZPPTpDh790c6FOpn1Tiq4H7IiMbA3yo//yiBH3p/m2S9Oce71QlP3Yr3zXz5u0l06sizh+QLNkLj/E+185Gd66RgIrXOUZYuYItG1LYQeVmjtC+FYPrIi4SzbpSzuWBe/t6VDJ9mmE4n7/J1/sZXth+KrnCf0747ymX8+QPGXrnLtTIWWTp3P/OIW7vpg6woGnySBLEvc9YE0Qgi+/Osj5Nfpw7La9fTvifD4j3Vx38fb0EPrqwjU505EYf/9SXbcHuONpzI89yfTjF+qrilsEW7pDnqy9O8DScapFbHKgY7b4jNf/nziaQ0jLGPXfBRVYv8DST7+s31sPxxbf91ZNoZauw3C8Zuvh9/UEcIJlVSHzpYDcUIRmdHzlQaj0toic/KszXzOJ7sOV/q9hqJKJNuCCZrq0PiJXxlk110JVG3poYhFDZxlWP4wfF8wPVwjO9mcZyME3PXhVu77WNuqD3Uji7/8M3pI5vYnWoimFH73n11u2HEBlLIO09dMVE0iFFWwqot9E1Z+b//uCHpY5t6PtvHJn+sj0ao1euMbnAsEO6MP/4NeFE3mO78/Ue8Xshz5kSJCCMbfmEKLXDfMJHjkc5184p8E378czXhC15+PEZbJzdycd/5uwZ3LY10exdjehzMxu648TtdgiM/8whYOPJhCMxrpvOvdl3rba0XiwANJugbDPPU747z8tdnVv06SUNuSSNpC0nsqs+EOr6Uj8HQ1Q+Kxv9PFR/9hL7GWZSrbG8wfAKvmc/LFHPlZOwhrSTQsjNcj3qrS0qlzxxNptt0WW3EPlh+/d2eEJ368iy/+yjD3fLSVw4+2IMkr79tSi3CZ2x9Lc/rlPK//Vaa5sSPB9tvjfO4XtzB4MIqiLl8/mpvPRljhgR9qp3tbmP/33w4zem714uXyzDCKHkaLJFD0MNX5cdY7yWgyCBXLMtz2cIrP/vMtdG4JLZvbsNHzcWyfi28VbjosuLnOjwUXx/TJTlqouoR/3ZcPj7g88kAIz4NvP1tl6FpzSXxJ15AMHeG6CNOuTzwlncQ3LUR1g3CTqsBiI65VoKgSqXadWIvK3/u17ey5N4ksB71HbNPHqvhBPqPsYpY89IhMNKlihBWMsIwWCnpgX36n1LT3JwS88rU57vpga927FULg2AKr4mHVfGZHTTLjFpWii+8J4mmN3p1h2noNYkkVZZnRk2WJXXcm+NT/1s8f//JQQ6zZsX0mr1Yxwgq1kkchu3buJ9Whc/cHW/mhn+sn3qoGPRRcQa3kkp9zGLtQoZh18FyxkP+J0tqtE1mIwwYNwiSMiMzjP9bJ+KUKb393vmHxinZGSA7EiXdF0WI6bs1l/nK+/vdDD7fwkX/QQzy9fFESWDWfSsFl5lqN2RGLSsHF90XgzLQHQo3RpIYRkTHCShD3lyTmp2xO/6D5ds+O6ZOfXV+0zwjLhGJKg8H13KDfeTOoFN26IrGXK2ENT+KX1+7R3tKp81P/bjs7bo83eNeLyhOFrMPU1RrzUxZWzSeeVukcCNG5NUwkoaIZ0gIdWKKt1+Dv/Iut+J7gtb/KrOjB3vrZx1CSUfyFuZb50+fAXT+q0NKlo+kyd34gvcygSLiOj1X1sape/flBUHoQiiroYZlQREFRJS6/XaQ0H/SLv+vD7QweijN5qcLzf7J6EXWiVePIB9Lc/lgLjiWYvFJl6FSQw91zT5LOLUZ9YZckibs+2Mrx53I89OkOjIhMtegxer7CyPkKkbjCwYdSJNv1eq7MiCjc/eE23nkuh1neOKrSvzvCP/iP2+noDzXkm1zHp5wP8keTV2qU5h1kJXBk+3ZHaOnQiSTU+nNVNZmdd8T5md/YyX/9mQtkJlY6qosS92ZxFonG5nWrIZbSMCIKg7fF+LF/MUhrb1AH5HsCs+ph14LnVCm6eI5POK4SSQSGyAgrqLrE1NUaMzcYDlyOTRkVIUBWg5i3a4kViuy2IygUfeSFHibNInRwF3p/N16hRO3kBZR4FL9mog/0IBwXZzaLqJlBxannIYdDyJEQqCrefJ7QgV24c/M4U3N1KvByKKpE12CID//9HvbdHxiUWsll+EyFd56f58qxEhNXqzjm0kmHojLd28JsOxRn++EYqXadS0c3V3l86e0iF48W2XdvkuyUxej5KsOnylx+p8jo+Sq11QayBIP7ozzyuU6OPJkmllry5GVZ4rb3tbD9ULzeAgCC/NDtj6WZvFLFtf0Vxn45ZAU+/8uDdU+4WnQ59uw8rz+V4cqxUpDsXQZNl9h5Z4InPt/FoYdT9US1JEnEUhqPfq6LMy8XGq6lNm8SSuhU54LWzOH0UogkmlS572OttHTpDQv2xOUaL/zpNMefz62ZG5FlaO012H44zraDUfr3RundEeHCW0WmrzWf5zr/RoFf//zZdd/zwA+184G/14MeWlo8Ji7X+N3/rZHyLCkqYqGBUgCB8H3Mike15IEsoW/twdjRj/B9it95dUX4KxxT+JFfGGDnkXiD92hVPa4cL/Hil2c593ph1Th8z/Ywd36wlXs/2kbXYKieGzQiMp/6Z/0Usw6nX8432DI5FmL295/alPZdS5fOtkMxPvG/9BFPa/i+YGqoytlXC5x/vcDVkyWK2aXzU1SJlk6dgb0Rdt+VYOuBGG9/bx7P9VF1hWtnyniuWHcxN8IKD/9wBwJ45g+n+O4XJinng+/o3hbm8788yN57E3UjoRsyn/75frq3RcjP2vzFfxrhre9k8TwBEuw6Eufv/uo2enYEfUskCXbdEScSVzY0KulunR//5UE6BkIN4zY7aXPse1le+foc45erKzYTqiax++4ED/9IBwcfStXDS5Is0bs9zOd+aQt/9K+G6tfVCLHw38bPKZpU6doa4qP/qI+2vqDAcn7a4txrRc68mmfoRInZcas+ryQJEm0afTsj7Lgjzo474oydr2zobDWDTRkVSYLddyVo6w9jVT3GzpcZObvEiT64T+epZ6rs362TSm6yGlcIhO1gbB/Ar5korSmU1hb8QhGtqw21NYV5eQRRM9G39qG2p7GHx/FyBdTWFF6+uGa+Q1El7vxAK0ZYRtVlChmHZ/5okjeeyjA/tfpNNCs+w6crDJ+u8MrXZNr6DGY3WZfjuoJv//cJLr9d4tKxIiPnKnXdqLXvAwyfqTD7GyMU512e/MmuOq0VAgOy775kg1HxHFFP0q+V41iEJElohrRwjR7f+L/GePUbc8ECuAocW3DutQLTwzVcZwt3fbCtIdm38444vTsjXDm+dD6+4+NaHrHuGHNnMpSnl8ZIW5/BwL7GOG+16PFn//4aZ19bWU+zHL4Pc2MWc2MWb347Q7rLoG93mGLG2TDxuRxW1d/QCJXmnRUhDcdq/Jy6oDVmzk5itHbgFPMgSfi1Ktb8HPiAJPAKZYTj4pUqK3cqEtz94VZufyzdcE9sy+f1pzJ8679NrOrJLmLyao3v/N4EF98q8Pl/tY2+3eH6bjLVofPk3+1mcqhGZnzZMXxB62cfw82VwBcUnj/WyIpZBe29Bj/88wO09YYQAk58P8e3/tsEYxeqONbKz3quIDNhkZmwOPH9HK3dBtVS0PXUqvnkZ2yqRXdD51PVZS69XeQ7vzfRMEanhmq8+OUZtt0WJRxbWqh7tkdwHZ/n/mSaN5/OLu3SBAydKnPi+zk6t4brObxIQqVrMLzmOgALIb8f7WLwYKzBoGTGLf7s10c4/XIeZw3SiusIzr5aYOxClQ/+VDdP/Hg3ekiun+/e+5Lc8f40L391jVBlk0i0qnzsZ/sY2BNFCBg+Xeap3x3n/BtFzMrKuS0EFOYcCnMFzr5WINmuoajS6o7uJrGplV8IuHa2wtlXcxx/LsvE5cZ44LefrfLxD0Rob5MZGd9EIY0v8PIlhOuhpOK4U3MIx0UOG7iZPH6lhhyPIocMpHCQLK8dP4fe14UcCeMtVLrXK9yvgyRDx4BBsl3Dqnr82X+4xrN/PLXuQFoOq+Yzcbm2eYqogItHi3z79yc4/0ZxY4OyDJWCx9NfmGDicq1hcVN1ie4dYcKxJUNTq3gcf26eS8dKTScdPdfnO/9jgpf+YnZNg7Ic81M2z/zhFDPXGovfVF1i333JFe8vz1SxChZ7P72TnruWOlfGW1TSXY1yFBffKnJ5mVFqBgKJ7KTFye/nGT69ToX1TcqSr4fF9q2h9m6USAw1GkOSFfS2TuqDRYCbzVM7cwV7eGKFUekcCHHfx9sIRRvj8+deK/DV/zy6rkFZhOsILr5d4g/+jysNAq2yLLHnngSHH21pYEyVXj2DeXkCZ3oee3p+3TzPIkIxha0Hovi+4I1vZfh/f3WYoZPlVQ3K9fA9mBu36oZfAvp2R7j9iTSJtvXJCEIIXv7q6mP01Es5yjl3hfGfvFzj5Iu5FTt21xaMXqhQLTWuTT3b1pfx2XogxpEn06jLSBquLfiL3xjhxAvzaxqU5ShmHZ763Qkuv1NsON9IXOGuD7aumBObhWbIbN0fRVbgyokSf/JvhjjxQm5Vg7IaCnNOsB7eAkr6psV9yjkHWQ76RSwyp2QJohEJ14FnX6wxMeWRTDR/aK9Ywrp8Db9Sxbo8QujQHiRdxxoaQ+vpQGlNUT12Fr2/G2OgB79qonak8UwT4Xk4IxOE9u5AaVld5XPRcxM+PPsn07zxrQyeHkXv60Xv60EOb14bqln4HjfMwqkWPF75eqNkhCQFsdpYKvDONCOofekYCNG/O1KnY64HIQSX3i7x+l9l1qUFX4/xS1UuHC2umMS77lzJylFDKpG2MK7pYeaWvHtFXdopLaKUc1Z2RFwHcjxGaPt29P6+ICamKEjawuIky0h6MEHlSBg13cIi11UKByFT1IX3yzenbeUU5imeP07hzNvk3n6Z0sXTuKUctfFry05WwtjRj7GzH7Ut1fB5SSaoDbqtMexVKXh8/bdGm87fACBg9EKV7/3hZEPdh6rJPPZ3uogml4ISbq6EHDHwilW8fLmphWTx/K6dqfDt35to2iFb9VR9QXbCIjdtk2xffzG1az5XTqzucFhVn5HzjY6tEDB2sbomoSY7aa8IdaW71z4HzZA59EgLXYOhhmd09LtZjj07vylHs1b2+KvfmWjI/UmSxI7bY/TtjqzzyY2xeG7FrMtTvzPO8OnKrey7tSlsmj+W6tDZc2+S9r4Qb383Q/l4CVmBRFzmkQfClMo+WwdUajXBEM1NCvtq0GBrUbnXvra6gKEzNr3kVUkLhUEi0OWyl/9tDUwP1/jBV2aQVJXwnt1ImoZfqQQyKrVb00vgVuPSsVK9RmcRRkiu50SECOK2qi5jm35TnqNj+Zx9tdAYEmkCVtVn8koN2/QbQnLt/StppYomkxsuMPrqRMOi5ToCu+YTji8t6P17Iqi6jGM1N0OVeBxJ19CSCRACSddQk0lqFy+jtrUiaRrWyChyJIISj+PmC+g9Xajt7TiTU3VD4+byOJPNK203A3s+0/iCAGHaAQHlOsMZigY008VwyCJOvJhj/NLmx6PnCk69lOfej7XRt2vJuejeFmLnkQTvPBvIeySfOIJXqqJLYGzpIvtnzwfCpxvAsXzefibLxKUm2i2sA0kOWIojZ8pkN9AOzC4QE9bC3GhjGNP3BJlJa00PvVryVjh5y/OW1yOaVDj0cKrBoJgVj1e/MXdDxa1j5ytMXa3Rv2fp+YRjQd3UmVcLeM7NWYJzr+U580r+po5xs9i0USnnHM69mmfwYLwef3NdmJnzeOnVGrmiT1uLTNV8F8zkdRpba/5t1Y8Kjr+QIz/rAApKLIo1NoE1NIwSixI5fBu18xfQe3pAkjD6+wLlXF/gmyZ+qYx5dYjYPXdSu3CJyKGDKLEYtfMXUGIxnNk5nNk5ko8/QuHZF27ZJc9PWUHyb9m6oxlBbgiCXdD8lE1uxgFEU/Ue5ZzLhbcKN+TJFGbt64xKsPNQdWlpssoStYKzasOjct4lN2s38OEH9kZ55LOdPPOHk01PVL9mIlwXtSWF2tERbEYMHUmW0Ht7sCeCUJNsBDU4cjSK1t6GPT6B2t6ONXwNJRLBkeUbEukMmnvJC3pf69xIIbDHZ/HypTqFdxHhaFBAtxyeJ3jne9l1yRbrYXbc4tqZCr07Iw0L4Z1PputGRYmGKL91Hr2vo+m6KyEE5bzL29+bv2kPWFYkOraECccV5sZMLr65di6tmHFw11loS7nGcK9t+RTm7DXP0TH9IHG/DNcb9eXoGAjVE/uLmLhSZWb0xnQPHVswfKbSYFQAth2KoWrSzRkVAd//85k155CsQCiiYFa9m1Z7WA+b3v8LH/IzNm88NcvklSWPxfehu0vBtgMmjN6knMV7BbPiM3KugmP5CMeheuIU4V07SD75OGpbG0oygSTLQR/7SAR9Sz+1sxcov3kU8+IlIocOoLW3ISkqem8PcihE9fRZIgcP4M7nMLYMYAz042ZvbUc/zxUrdh+SLDUw71q6DZ748S4Gb4ux9UCM9SBEIL0ydvHGvE2z6l+3fQ9i96HogpGRILKzm7YP34GSWLmlz4ybDJ+u4C/z2hVV4pM/18dP/pttDB6MLh1rrWtwXbTuLtSWFmpXruLMzOCVy/i12oJ+RaC0qyQTaF0dyPEYsqYjPC+Q2y+X8YpFfPPGBVElRaWj7w66t9xDONq2pky8HIsgR0LI0TDhA9sbtpxd28K0dDZ6yXOjJtPDN35eZtlj5HxlRRvjnUfiGJHgHCvHLtHykfuI3bsXe2y23sJ6I0xfM5ndhJrEWlA1CavmEY4rQVhunaWiXHDXXWiv38W4lr8GkyqA5/orQq3rSe/suy+5wlEbv1ilss53rAfPDerdrkffrkhzBcDrYH7GZvT82vPaCCsLxIZA/aCtV2fLvgihiEzfrjCDB6JEk4E6x957E3QMGDeUktz0TiXWorLjziTDJ0uUsk59m9malvnQ4xHa2xTSLQonz1hMzbyL5nCTKGRscjNLcWA3lyf/nWcIH9hPeM+uoB+KFMjPC8sB18MrFsH3g74mpTKh3Ttxc3mQZLS2VtzODsyrQ7iFAlpnB8b2QSpvHbv1J3/9nLruQbuWz6kXc3QNBqy8jZAZt1YtWGwGnruK1pYUFN4Fv0vBPZQkZF1ZIb5aKXi8+e0M++5L1lUGJEnCCCu870c6OfhQihMv5jj9Up6hU2UKWWfF9buzc5Rnl7TEamfO1X+3hkewhkdACKyha1hD1wAQfb3Yo2MgS1TeOQFC4OUDD1lGDppJbdC5sgECauU5ZFklFG0DgpbE10PSVZRUDDkSwreD3eQiBvY07iYgCPc0m1xdC9kJC7PqYSzkPBfvb+fWMKPnKlSOX8LJFpB1DWtkumlq8fCpjXX+JF0PcpSLckwLc2g5amWPqatVQAShtHW+3qr6DQ7I9bj+b54r1h3bC2o7jee8zsK5ZV/jjkIIQX5ht34jEEKsIAoAxFu0hZD2jT/70fOV9Wu1pEVliKDObNeROK4tkBWJnXfEA8YjkGzT6N8Vxix7zIrN161sPvyVdzHLLi1dOnbNq08A2xacPGszPetxbdRldDPsr/cAZsWrh+skwyBycD9qaxokmdrFy4QGtxJ/4F6kcGhhIWp8OLWLl0k88hDmcy/gFUsYA/0oiTh+rYZfreGbJgrJ5rxfKXhwHQMhWjp14mmNSFypU551Q0Y1ZDRdwogoaOtszyFo7VwpuGQmLYzwxpvPZhhFNwwBXrmGsNw1QxDnXi/wvT+e4tM/34+iLCUZJQnS3QaPfq6TO55IM3mlxoW3ihz9bpapq03mGNb4UvPSFeRQCK9cbniPik5SbqUsClii+d2bEB7V0gy2FSSRFXV1uRJvvoiXD6i7kq41DKvVJE7yMw5W7eaMSm7GXrFTUTSJ1m6d0XMVonfuJnLbdoTnYwx2U3ju7aYMy3KnbDVo7e0k3ve+oHncwj2e/8538ApL4S1JCmjC1aLH+IUq7QMhctNrH9ex/U0pJfi+wHVunbRC59aVJJ47P9C6InzVNCRoXaW5oSQH4dDr1TI2g8LcxoSXdFegb3fixRy+D8l2janhGnbNY2q4BiLInUUS6rq5rPWweZViy2fqalDUtpwiWyoLcnmf0+ds+npUUkmZ6k1OjuvRfVsaVVfIj5VxTA89quLUPGRFQg0pFMbXppa6lqhT/4RlUT11GkVV0HXwqxa16XF8ISF8gSQ8SiNXkfFhIeTujI2R+8rX8GoWCEHhuReCGeL7SKqKbBjY10YRzspBoagS4bjCwJ4Itz+WZtfdCdJdOqomLQgXBuq4i57EotCkBBvGvBVNwgjLxFIasRYVzZC5+NY6RZoCak1QiG8YQiBsFxArvPBFuLbg2S9OUc47fOwf9dHaY9Sr4yH4mWrXSbZp7DoS5/0/3sWV4yVe+sosV08EYnybjQkLy8KzVhrTpNxKVE5i++amjEookiaoKK/h+w6eu4bRkyRCewaJ3r0fZInsHy0VHaY6VrKOahVv3RxCM6iVVx5DWVDIBogc3kn2z54P6lU+9xiSojTVWnejWiBjyxbssTEqZ87Ujcr1TpasSnQOhujZHkXVJTRD5vLba49Xf6G5VNMQ66qZbArL5Z0WIUlLmnO3GtdL82wW1eLajhwE4+K1pzJB+2LT59iz8yiKhGUG9VeeG8zZBz7RxjvP54ilAn3Hzcq2bNqoJFp17vxgG74vOP9antFzSwv5nl0aU7MuO7dpTM96TE7f2sXLs306dqfo3JsiP16h+0CamXM5tLBKtNXg2J9ewVvDS/F80SBXIWyHgS2C227XGR/VMGsCIwS1qkCSZDTNZ3xMpr1DoVT0iSdkPN/j8vmgvlXYS95VaNdOkGXsVZhErd06hx9r4b6PtbPtcGyFnPrNYnHgd20LI0vSqlvr5RCAeYNCn01BImhqVqiu6J65HK4teOVrc1w7U+GRz3Vy20Mp2voahS0lKSAAxNMytz+e5tCjLVw9UeLVb2Y491qBuXHzpheQkj+PKulIYnPPxXWqtLTvRjdiFOaHVzZxql8EeMUK1dNX0Fob63kWcxzL4Vj+ClmVzcI2Vx5DkqnvYn3TJrSjD+H7SJpKaFc/biaPM5Nb97gbMQv9ahVJ1xG2jVijfaDnCCYvVZm6WsP3xIYChjfyfG8VRcgIyysEKd9N3GxJ1aIjIWsyyb44WkxDkiWEJ5i/msetuThWEOgFcCyBs+z3AIJTL+dp6zUYv1S9IR2wTRsVq+oxP2mR7NBX8L1ffsPkwF4d34fpdyGfUpquooUUQgmdwlSF0kwNqxQs7r4r1jQoa6FvQMVxBDt2B0ZlYFClVPS5eslBkiRME3bs1vA8QTwhMzbicuXCygiLeenyqscfPBjlU/9rP7vuTNTj22vB90VdP8k2fRwz+Ol5oqFlwPWwaz7TwybT10xkWWoo0Frzu25y0VoXkoSajgbJ3w0ZeTB2ocqf//oIb383y6FHW7jjiTTtvUaDttIiZFli5x0JBvZGuXamwqvfnOO1b87dnGcvyUiSjFhgqDcL26pQnL+GEAJ/vW2TL3Cmgi6d7my8Icy02oK1Wr+bzcJbpfeJJC19nz08hdHfgfB97Mksek8bwvM3NCprIfnoo2htbciRCGoqRWTfvvqOPffMM0FeZRn0BdXwzLjZdJO/vw402zvnbxokCWRVpvfOLjIX54l1R6lmqpRrzd3r/KyzwJK9MWzaqJhVj6snS4RjSgOdT5bh6rDD7JxHZ7tyy7yF5ajlbSZPzSMr0qYNyGo4+nqghaPpwYMwDInBHSqnjjvIciCzMj4abCklwHHW7+OyHNsPx/jJX91G/+7GZKzwBa4jKGYdzr9Z4NrZCtNDNXIzduCl+sF7Fn+GIgr//ruH1/RiFFUiklCQVYloQiUUUeqie38t8AWVM2OgSPi15grkHNPn/BtFrp4s88KXprnt4RYe+nQH3YOhoPfMsr4mELBYdt0Zp393hO2HYnz9v45RyNzYJBD4FL0M/iYTpLoRJ5EeRJIknMkKrrN66EyOhIJcCqD1tOGMT9eN12pFsaomBc2XbsJQarq8oq5TiID6r3akkMMGkq7iTGaoXRjFr9TW3VVuhOrZs/WC0wZIUsDIuw6+Lxg8HKNza4j5KZvxizfWc/7dxmpeuuv4XDxaZLLZHF+zECvp0TcKz/bJXs7Rc2cnlbkqkbYwsnpzobXNYPPFj+06d324jfGLFcp5h1rJQ9egt1vlyCGDaESiv0/luZdqzMzeut2Kqi4IEfsCbxPV1+uhttBEbGncC2avS0ZaN1Bv09qj88mf628wKEIExuTS2yV+8JUZTjyfw2qCQRKJr/+eZJvG9tvjeK4gFJEbZDr+OiDLGpINnt8cGUBVwgjh4flBcnl21OK5P5nmpb+YYfvhOPd8uJWdRxK09xsNBZeSFOSpHvxUB3pY4c9//doNJTmjUhJV0nCEhbmJnIqsqJjVLIpqsN4WJ7R/W33HpnUGeZjF96/mpeshGUWBm1le9JBcb1C3CN8D0dZO6sO9WMOTOMOT6L3tpD5yb5BfuQmj4swGRctKKhWw6goFkGX0zs5VYzqu5XPxzQJGRMHaFNNtk9vJm4RdWxlGFD4c+948L/zpzIr3L17qzdbxSASOrn2T2o6XvjVE711dlKcrVDM3TwVvFps2Kq7rU8o6QQJtYRzaDoxPuaSSMmMTLt2dKrnCrTMoigIdHQqZjHfTN7q9TSYRlymVfTJZv6mdR7pFplIVWNbGo0WWg86Tu65TnAV441sZ/vK3xzfFvlotDLQcudlAJdX3gvBGM+Gvdwu6GiUe7ca2y5Rq02hqGM938X0HVQkhhI/n26hKCEXRcZwq0XAbnudQrk0jSyqKrOF4Jo4luPBmkYtvFenbHeHAAylufyJQaF7k80uShKLCHU+0MHSyxPNfmt50Ar8mykSIo0gaKjouzQ0wszKPqoZxrMpCAeQaxz9xEeH6yGED69Jow4qTXYX1FEmoQWFr5cYX+UhSbegVBEFYrSpCmJfGKL92BoDqiSt0/MzHkWT5pnYqiwjv2IGwLCqnTwMQPXyY8ttv48w1Uq1VQ8b3IDNq0tprNGcrJIloqheQqOTHb37lbgKuIyjnnAaJm8WeRdejv1flzkMG41MuJ89am16nBvpUJqddXBd0Hfp6VK422TrkesiaTLI/jh7TqGSqJAcSGAkd13xvHM5NG5VqwWP4dCnIOSx4GeGQxBMPh9m7S0dRgvHxl9+psBHnWlUlHnhQp29A4eRxh/4Bha4umaNvORghiSNHNEZGPK5edjl4SOOl7/vce79GT6/C6IjH0BWXR58wuHrZ5Z1jDmvkBhsQj8t84PEQz71oUigKtvQrTM14lEqCnduDHMvElEdfr4IsSUxOe/R0Kwxfc0GHllTQUXJi0qOjXaY1LTMy6lGtBYNcD8vc9nDLihzKxJUa3/itsU1rJoXjGxQC+mBEFe77WButfQYX3ypy+gf5DY8rqRqSLAdW0Pfwb9ZaA4loL6ZdQJYUYuFODD2OrkYpViYIGSkMLcF8cYhouI14uIvR2TfxfS+oeJc10vFBQnqSucIlLDugoS7mXSav1Dj6TJb7PtrGR/5RL0ZYbmh89MTnu3jl63ObVln1hENYCQpGy1K+aUc4FE1j1nLoRhxZ0fHc1T1B4frogz3o/Z3IIZ3i996sL4hTQ7UVEjwtXUE7403pfl2HdJe+glruOj4zZ/OE9+9DiYbwihX0gU58094cu2oD1I+1XjOyrWFueyxNJe9SLbrMNNO2QICmR9EjKSr5Cd6rHcv0sNlAK5bkgJmoh+SGWpXDB3RcTzA24RKNyPzEZ6KMTgTPcGufRqkSMGMPHzDwheDSVYdtWzRiUYm3jlt85hMxLly2efkNk8EBlZakzNCIy5FDBnfcZvDWcYsTp5tzRkNJg0RfDLsS9PTRItrf7PBXNKly+LFW7JrP+ddzjF+sUjMF33muSktK5vuv1BjcoqGsvxYCsGVQQYwqzM74fPTjIS5ecPneMxaf/4kIp046ZDI+taogk/URAoyQRE+Pwltv2Dz+/hC7dqvkcz6Hbte5cMGlWNh4oI1PuMznfcYnPFrTMvv3ahy5XefCJYc9OzVCIYm3j9vs2aXR2SHze39QZv8ejVJJkEhI7N2lMTCg8rVvVjl0UOPAPo3//NtLgneaIbP98EqBxde+OXdDvQpWo51ej3BMZuJKFUWTmlJMBVBTKfTWdtRYguKpY2it7ciajpPLIOlBnYFwnU1VnQsEsqyQjPZhOxWq1jyKbBAOteK6NVzZRFVDhLQkQvgI4aHIKpIko8gasUgnQvjI0srB47mB1PjTX5ikmHP57C8MEEksDd+OgRBbD0Q5/8bmet7IKEgCcv4ctmgyTi5JtLTvRFEMPM/Gqq2T4JaC9ztTGfS+TuRkDL9UBc9j5EwZ1/Ebuh+294WIJBRYXf6umVOjY0uowZsWIqD/j700jEhmCe/bitqewhyawjw/smGDrmbhzMwQu+suJEVBjkSQNW3VnMrUUI1SboZq0V3GOtoIAtssoobWV4y41bh6ssShR1saXuvdGSaaVLHNpfn86psmn/+ROIYhkUzIOC5s36qxe7vON5+ucOdhg9Fxl7MXLG6/zeDh+8OcvWhx9qLLnh06mYzHd1+oksv7uK7gw09EaE3LbOlTeeqZCjNzzT+j2rzJ2OtT+G6wFpTGS3VC03uBTZsv3xfMjZlIMg3yCZ4HE1Muh/YbdHcqTYWKzFrAiw5HJI4ddahWBaVSkHsIhSTuOKIxl/Fpb5fp61fo7VVwXSjkA1pcIe+TSMqcP+dg1pobnEIs/i/Yu0tj+6BGJCwxn/PZtUtjatojl/PZuV1lcspDUSSMkMTAgIKuS1y+6nDlapDIb0nJFEsCZ1lCT9Nlku2N3HbPFYycq9yQ3s6Ow7ENqYaFjMPsqFnv2tgcJIyuXpxCHjWeJLJtJ9Hd+1CicYyOLmL7DrGiC9sGKJTHMNQYVXOeQmUCRTFwPZN8eRQA33dwXRNfOLieia5GAyMia/i+R7ZwhXJ1GttZWwbfdQQnnp/n4vW1DRL07d58QZoqBSwNeTPXKgTTo28zMfQKk8Ov4q6icbb8vX6lhhwLB7uD3nbkUOAo5DMO49eJM6Y6NLbsi94wvTSaUhnYE11R83DpWBHH8nFn85RePEH+W69TPXYRf6OuqpuANT5O5fhxtI4OZMOg+OabQbHpdfA8QbJdZ/C2eL2h1EaQVQPNiCHeTdGqVXDhzSKO3eio9e+OrlA2TiZlTpyxaG9VsExBS0Lm2qjL1IxLzfRxXMGh/TofeiKKoUsoCuTyPrWaQJZhPu9xcK9OW1phoE9loE+ltUUJwul7dHq6NuH/S6BFVJL9cdr2pOm6oxM9fnPS+pvBpncqlYLL6Lky5ZxBab5xAbt01eHvfz7BS6/VyBU29pinp3x+8H0LXYdSKWA8WabglZdt+voVvvkNkwce0Hnqr0xefcUim/GZm/UolXyefcYin/Pp7lEo5P2mQl8QMGBefT2IeZ676DAx5WKagp3bNV78gUkiLnNwv87rb1q0pGQSCZk3j1pYNhSLAcV3etYnEpHIZH0qFUFXp8LY+EK1vrIyN+lYzakHXw9Vlzj4UGrj92kyPTsiJNuCbW6zzJTa2DW0VBqvWgni6o6DWy6ipQLPzF+lWHA9uJ7JXGGpM6Jp5+u/LxoWTY1gOWVkWcP1bAqV8fp7StXmFIOLWYfshHVdx0Uaesw0i6gcCDpKbO6zqhoiFGkhFGsjO3V2zfAXgKQq4HgQUTHPDdUjN7WSy/nXC2zdH20o/Lz7Q6289peZG6oRWNyxXY9jz9xaTbpVIcuYIyOYw8Prvi0UUWjtDZHu1km06cyOmhtGsyRJwjFLC/Tt9y5ZPzNqMn6hytaDS85dvFXjyBNphk6V63ll0wy63j77YpXZjMfggEah5DM04jCb8cjMByKOyYSMaQo8HzLzHrYteO2oietCe6uC7QimZzy+9b0qc1mPN94O1qFmnPRFSJKErMp039FJcbxEJB1C0Tc/N24UmzIqyXad9oEQkgwD+6JYVY/ysuZKj78vzPEFa93ZrpDJrr+Qep5gdCRYjGVFqsdjz55xSCRl9u1TOfa2Qzbjk8349ff5HlwbDj6X36SwmxAwPhl8dmraY2o6eL1mwu23aQxdc5md8zh8UGd41GUu4zHT2NKEQtEjHJboaFMwjMaaHNcOBCD10NJDVHWpIcTRDCQJDj/awsC+jb1vx/YZPV+hpVMntUF/ivpnshmc+QymPBzUK8zNgATCCToe1oYv825ImTpulVxpBAikTm4EsiqtWn3cjO7Z9ch6k4C0Od0vQNUjRBJdSJKMLK/UOKtDAJ6PsaMfe3ymYT10LMHZ1wrc+9E20sukO/bcm+S2h1Mcf35zdSN6SOb+T7TT1tvo/Y+er6zZk+RWInbbbfi2TfXs+q2aayWX7IRJultn8vL62l+L8D0HWTUIx9spz4/c8NjZLMp5l7efyTKwL7qMIAKP/Ggn7zyfq3c8nZrxGrQOT55tDDfl8muPr8rCuF0McRWKfr3J4XzOZ2xyc+fsuz61eZORVyYQnk81W2voafRuY1NGxVpoWVvKOkxerq6ozB6f9NgxqCLJgRZYs5BViW13tlArBjLX2dEqL37fWmisJQjFVGwz+K6ObVHmhit4jsCIKAgB9i2Qg5mZ9fjuc0vHefb76z+EWk3w+lsrPXnPFeSm7YbknqrJbDsU4/ybhebWaSnojPfkT3YTS6lrFj4uQjOC42uazLWzTXL+hb8gabEgXeMHk0DSdNxCHrdwY4Vw60GSIJ7WqJbcG25cBtC1NUT/nuiK+zJ+A8rL/iaNySJq5Tk818T3PVxnnbEiy/hVk8J3XkXrSq/489CpMmdeLfDAJ9vri5aqSXzif+ljbtxq+ppkOXBCHvxUe4Nqg1Xz+P6fzdy0SGUzaCrhL0Gqy0BWJM6/lm9aeh8kFFUP1KDfw+5TniM48VKOO55Ms+22pSLkcEzhx/7FVv74Xw8xev7GQtsQ9NRRNWldZeUbgoD09hSp/jjhdIiL37qKU31v2F+bcp/NisfQgseTmbCYuU7CeXzS5dU3Tb77fI3hkeYvQFYk+vYn2HFPmq7tUXbckybZGSLdF6ZzR4ytd6SIJDRUTaZ9axRFlUl2GWy/N02io7mY7HsFx/IZPrNyYb/v4+0BfbIJbN0f5bP/fAvbD6+kJa8GSQpYKq7jE0vd3DZXODbOfKZpOfTNQDVknviJLj7zC1u47ZHUhhL3qyGeVnny73bTf12nvNyMzeiF96aITlrozeu5NqFwqv7v1aB1taIkoijxCHJ4pYBkreTx/T+fITdj1RdlSZLo3x3lM7+whcGDG+dX9JDM3R9p4zO/MNDA+hJCcPGtIqd+kH9X+2cswisWiezbR+L++4kdOULsyBHkUOM1q1qgnbX1QIzBQ3Ga3XAoqoGkqNhm8T0MfgWYulrj5a/NNqgfS5LEwP4oP/4rg9zzkbZN6XbJCrT3Gzz4qXZ+4l8PcuT9K52NW4G5c1muvTRGaaqMpPwNZn+V5p0VuZRF3H2Hwde/VcF2RLNq2gEECE/U+evp3jClrIWiyhRnLdq3RijMmMwNV9HDCqoh07s3QXa0RmFmk9s6SSK+4yCp/Xci6wbVyWEyb75A50MfYe6NZ/GqTVajS9LCtr3xQm3T58zLee54It3Q/Kd7MMRP/bvtfPk/jjBxuRoUoy1bRGQFEq0a9360jYc/20lbr4EsS7hOkI8Jx9Z+VEZEYdvBGLEWFbvmB6f2Xs+8JiDL0L87wm3va+Hej7VRmLO5crzMudfyDJ+pBPVPAvBF/a5KUkDjjKVUDjyQ4pHPddK/O9IwiX1f8PLXZhsETt9N6EYCPZQkmuhCN+KY1Ry+tzq7RknG0Lrb8Co1tPYWzIsjKx7OtTNlvvFb4/zdX9tWb7WsqBL770/Su30X3//yLEefzpKbCei/izRkWZbYsj/Kw5/p5NAjKaLJpV2tEAtsuT+YWlcF+FbCN03cXA7JMFAWK+yvo4EKP4h4eK5AUSTibRqsrnLUANepUpy9snSQ9xC+B699M8PAnqCZ3KLcjaJIbDsY4/P/apCHPt3B289kuXi0yPyUvVQ0uSCP09Kp0zUYZmBPhN13JWjrM4gmVYywwtwmO7A2A0mW6DzYRqwrilNzsQrvojL5ddi0UVkPsxmPf/xTCQpFn+deqjHUZPGO8AWFOQu74lGcs7CqLlsPpxg7XUSPKFTzQU+NaItGJKnR0hNi4lyR3Q+2oYdkxs4Wm87dyapO+vYHmPreV3ArRbREGjwPLZ5c1+NsgCQTG9yNU8hhZaevuxY4/2aBc6/lue3hliV9Jwn23J3gF7+4n6GTJYbPBIoEqiYTS6n0742ydV80oJMSGJpqyeW7X5hE1SU+/rP9a55OMeMwcq5CftZGM+S/kQZlORRVIpHWiLeo9O2K8MhnOvD9hQT8lEW14GJWfWQ5CA+09ui0dhuBIVnsCbEAzxWcey3PK1+fu6HE9o3AquXxPZtaeQZFDeGupVAM2OOzsOAlWqXqqtZe+PDGtzO0dOl88Kd7iCZUJCm4T+keg0//s34+9o97mRsP+rpbNZ9oUqF9Idm9SFxbfl/ysw5f+c1Rzr++dlfFWw17chJ7crKRqXLd9Xqu4PLbxXWViVeFEGuLdr4HsE2fv/hPI+ghhTs/mCa02KtGlogmVfbem2DvvQmECEJmlaKL7wmMsIIRCYQpG1XHAzXyd0uHr+++blp3tuCZLpF0jKmQilV8b5yLW2ZUOtpkdF3ie9+vcWXIwdwEW8FzBSe+3bg4X3otWzcUc8OVunPy8hdH6u9562s3SOb3XNRYAqcYGIXAmAgiPVtQ4yncSony1XMIzyXcPUCosw/ftigPncezTeI79pPafxdWdga7kCV/8vV6bgIgO2XzzB9N0TkYpmtrqN6ICoJY7P4HUux/ILXuKZZzDs9/aZrvfXGaXUfiOJa/6hZbkgNPKDdjE44FvVeapxX/9aK+CErButvSGfR6aBbCF1x4s8A3fnv8XfH21oKi6ESTveihBLZZxLHLiDVS9X6pgnnm6obH9BzBC1+axrUFH/zpbpJtWsO4McIKfTsj9G0guS6EYPJKjW/99wmOfje7+Yu7CcjRKJF9+9DSaZAkhG1TfOMN/OrN9bQPDXYj8hZeqYpXvLlj3QzMqs9XfnOE3IzFI5/tJNaytDNc3hNINqSmCTPvFsKpECMvT9B3bze5a4UVsj3vJm5ZoO3wQYNiyeeBe0JUa4KbDskvs0m3crfruzbZd16m5dB9dD3+Q+gtHQt/kTDauzGnx4gO7CDc1Y/R1kVi92Gs7AzC90jf8SCSomDPz+LbFlZmitrk6MoEpYCLbxX54381xPilKsJvridEENoQ5Odsvvwbo3z3D6Ywyx7ZSYu58dXDfEZYoWd7mCNPpjn0SGpFruFvEnxXMDtqYpt+/Vo3CyEEwhdUCg5Pf2GSP/rloUBA8z3cnfm+g1nJghBUipP4TfQiaQbVkscLfzbN7//iFa6dDVouN3OfFt/jOj7HvjfPH/wfV3nrO9n3fMcaGhxESSQwBgbwCgXUVAqpmSroDRDet4XQ7n7UlpVFxe81ChmHb//eJL//z68wdLLc9DNaxGKNnBACzxMMnS5z9fitZ+Z5tkffPV3oUY3kQOI9jRjesp2KoUsk4jJtaZnH3hfm1BmLuWWU4tlRsyGJ6HuQv4kuZ+vBrPiMX6qyPJo1N2oGEulCUB6+QGX8KtH+nXQ/+WkmvvNnABTPH8eanyXcsxU1nkRLtOCUclRGLqFG4oQ7+9GiCaz5OdxqCSs7gzkztuo5+D5ceKvI//nT53n4s50ceSJNsl1bYHvIyEowwHwvKPa0qh6VvMv5N4s8/YVJspNWfSAU5hxOv1yoh3dmR8165bxV88hMWMyNBYnexlwDZCctxpapwArBTYlOmlWPqaEa5fzSsyvn3KZCT44t+Or/Ocpb385y14da2XtvkmhSRQ/JaIZcb1omywT05oX743sBAcKqeZRzLidfyvHGt7JMD9XetZBXKecycblWz3FAcN8BFC1MaqGivq37ELPjx9atU9kM7JrP2VcKDJ86x51PtnL/J9vo6A8RiinoRiAUudAbDs/xsWo+tZLH2IUKL355lnNvFNbt6d4MPFeQmWgcN8CGEjhyOIwzNYXW2krp6FFSjz6KZBhQam7RdB2f7IxMOCXj1oIOnblZG3NkFimVQmtP4WaLeOWlcGMl7y4UkAYCYsWMUxep1JOtOJUiwl0aq54jmLlmNkTospOb2+WaFY9TL+e59E6J/fcnuf8T7fTtihCJB5ECbWEcs/CcFuf4YjuLwpzN5eMl3nl2nuHT5U23bhACCnP2iudTyDh14zb0/GiDbqB/C7TdmoUkmjSxG7GQ+noU+nqWbNTlqw7Z3I1fSCwu4XlLSsKrQVUhnpTJrVIPE2ntI9LSg1XKUpodrm93JEVF1nQ8s4oSitD7oc8x8/J36Hjgg0w9/w3ccoHWux7BrZTxHYtQZx+Z159FS7TQeuR9ZN58HrdWofPhj1K8eJLq+FBT15NsDyqluwfDRFsCiXrhC6yaT2neYWbEZOxClfysvSkPU9UkenZECMXkoKf0mLWiz81mIUsq6dhWJCRsr0qxNv2u1AXoIZmewST9gx1oySLRpIwRldGMoJLYcwW26WNWPHLTNrNjJpNXa7ekc6Xe0k6sfycgKFw6iWcuhVWM1i6ivdsQvk/x8kk86xbLnG8CWihggvXtitDSqROOKSiKhG35lPMuc+PBuJkbs24oPm+0dKAnWyldO3/T5xrevTvodLl1K8Jx0NrayD37LO786oWXsm4Q7d2GGksifA8zMxU4brEUc28+i/Cad35CHX04xfmG57jtR/9XJl/4+pqO36qQJKIDO6mMXNr4vUsfoWMgRO/OMK09Bom0hh5WkKSghmzRGZqftslMWEwP126KUn+rIUkKfW131P/teCbT82dYbfvfjLm4ZTuV8UmvXlS4EY7ca9DarnD+tE17p0JHl8KZExZ9WzTaOmTOn7LZsUcn2SLz1qsmngsHb9e5cMampVWhvUthcszFc+F9T4R5+fka58/Y1MegJDNw1yeJtvZjV/Oc+/Zv4dnBYFNCEToe/GDA6/N9KqNXcIqr1WQIalOjhDp66Xr8k0GoY/QqTiVIMFrZGdK3P0h8+35mXv42G8kdF+YcTr2U59RL+eZuaJNwHUFm0mTn7XH23p3k0ttFzr+5ySTodVAVg7b4djKlK6QivXieTdma2/iDm4Rt+sxcFYi5JGPZq/jiFvLoJZnU7sMkth+sv1SbHSd76jV8qxbomjk2nfd9gOrUSMNi5LsOvuvQee+TVCeHb5lRkVQ1YLZtgt/rmIKhk2WGTq7OSpRULTjeDbaDCHcNkNhx8JYYFfPaNSRFwZmZIbxzJ9bY2IoGXYuQNI3OBz6MGolRnR5DUhRCNxivk2SF1L4jFM4do2Yuz7ls/nhqOErbHQ9TGb3cQDJIRHro//+T995xklzXfe/3VuzcPTlvzsBiExYZBAGQAKMYJEqULEpWsGXJli3bkvVs+UmWZD0rmZJlyYo2ZYqiJBISA0AQBEjkvNjF5hxmdvJM90znynXfH9WTdsLuLBYgnt+PH34wW13h1q2qe+4953d+p20/lltkYPxlgnBu9dOW3Uaz3MjJ51/AdseWOu27GkIIMokudC1OLrUGz68zPn3iuoVGV21UWjfdRtdNDwAweOgxioPHl91X0XT69n+cXM92ZOBz/Ou/TWeXpKVd5dXnbbp7VMyY4M3XHT71IynOn/Y4fMDlgQ/EOXfaY2LMpzAZ8NBHk9QqIR/4WIKxkYBjb7rcfrfJc9+2GR/zOXd6nkGhUY8gnkYoCpqxMEnOr1cYf/4bUbU/GRK6DjLwGX7i7wjdyIUxdfhlhKIQeh6FA88gtEjLK3SsxosmKB4/QPns0UYwVQFVmTezmglANwrNh5FW2dsBI6awZV8GJHz7C2M3JBEUGnEDr0Iq1gZC0NdyK3E9S9WZZLx0mg3tdyNQmK4NUKqP0NeyD001mSyfw3JL9DTvxtASDOQPYGpJcsk+kCGFWj9ShnRktxGEPhV7nITZzKbO+wgCl6Gpwzj+DfAxy5DyxZO45Wl63vf9jL3wGPWx/tln7FWKlC+eoHXffYsO9UoFKrZF2633v/V2zEPrvvdSu3ye+mj/DTtn+x0PUTx1cBEL8bsB6XnoLS1ora1UDh5EiccXEFjmI7d1D/H2XgYe/RyBbTXcUYLcTfvR0zl6Hv40erqJ2uB58gefRYYBue37yGzaiaJqVAfPM3X4JUDS8/CnSXStJbV2K6HnUDx1kKk3X0SoGrlte4nd+xFCz2HipW9i50dRjBhtt7+fRNdaAqvK5BtPY40NkttxK8233InZ0smGH/xXICX9j/wJoedg6mnac1vxA4dSdYhCZY58kYy10pbdwuDkAeCtTei+GwhDn9OD30QIlT2bPo2hrV5Dbz5WbVRU3cRI5QCBql8tmU+gGXGMRJbQ9wBBKCW6Bu0dKropiMUEbR0qniup10Km8gGGKbBqIZkmhWRSIfQlugGvvWDTs1YjPxGgKALXlQigqVllfCyYjUFIGTL4xqPkendQGb9A4M6baUpJYC1OkgvnzUal55LcsB0ZBnjlIrLBFgtdh9B1UGNRtrwMfBQjhp5T0DM5nHzEJFMMIwrGBQECCBwbv1Ii9G48Q8m1Qw4/feOz3009TV/zXiw3OnfKbGGsdIqm5BpMLYUQCvnyeSr2BLlELwhBvnKRtswWLk68yET5DKlYG83JNbhBHcudZrR4AkWorGm9leGpI9TdKeJGjlyih0sTL9Oa3kjSbLkxRgUIXRu3VED6Hm4pv+RzXw0UI0aspRM7P0roOdG/W7uwJoaQvocaSxBr7UKNJQg9D2dqDK9SRI0nSXSuIbtpF0Ko6KksbqWINX4ZJMQ7+3DLU5i5NrR4Eq9SxJoYQigqRq4FI9uCUFS8Whl7chgZBOjpJmLt3WQ37iSw6sSaO7CnJ3DykX6alkgTa++JjqsUsfOjsy5gI9eG2dzeaHN8FVntKyO2bh2pPXswuruxTp0ie++9VF5/Hb9wBQtNCBI9GyifPzabFzZ/yhXv7GPkqS/h1ap03f9x4h291IcvUh++RPXSKVAUOu76IPGutVQvnWT4ib+h+8HvI3/oWayxOVeXounIwGfom18gvf4m2u/6AENPfJHWW+9HqAqD3/g8sdYuOu/5KIPf+DzFEwdw8mN03vc9XPry/1hEh5ZIFKHSlttCsTZIEL5zyr9vN6KVl39DyiDc0DyVa8HEaMDFcx6xuGBsOMC2JImk4PGv1CMfuiN5+RmL4cGANRs0ggBeecGmo0ulMBFQKITUa5LXXrQpTYWcPOpimGJRnZ/i4PFFqyhVExFb4xpCPULXUZQYeqYJGYYouoH0fZypCczWDpAhoeehmnHKZ48Sa+8iuXYLMvSjlQtgjQ+hxZNomSZCz3lbjMrbBcsrMTJ1lM7cTZhaCkXRUYTGdO0yjl9lsHCQ5uRaTD1NKAM0JaJQjpdOkUv2YWpJVMUAQqQf4oUOMCcAKec9LdevIZFIGc72HQBC0PHx/ZhdudlNw3/1PEHlndMxmg89naP11vcy9sI3cIuTGJkm2vY/wMgz/4Bfr9J0020YmWb8egXFiCFDH69aQqgaWiqLGkugJVIEbo7AcwGBUASte+7Ft2oEdh0hVNRYAmtyGKFqpNZuRYsnAUFTaxf5N1+gNngORTfQUznUWBwtmUbKELXhmtXiKdpvf4jQdwl9j9z2vRSPH6AycBo920znPR/Gq5UJ7DrxzjU3TONNa26mfuoUWnPzbI16cWVdY2bimiZefenJQ33oItbEMNL38EoF9HQTMpQIRSWzeRdaIoWeaUY1Vp7Uhp5D9fJZ/FqF8vmj5Hbsw2zpINm3kdGnv4JfK1OtlWnefQ/xrrVULizvdQEIw4B8+TzN6Q3EzUNUrcXVH+fD1NO0ZjaRjLUiZUjFGmeydGaB6yyT6KGjaTvD+UPUnbnYk6oYbO55kMnSWQrluVVRT+teZBgwNn2CpvRamlJrUIRG3ZlivHgKz59x/0UurVyqj5iRQSCw3DJT5QtU7Rvvyp6Pd9yohCGcOjbXqZPji1/ok43fjx2amwmMDS/c78zJaJ/551oJuiG49X05rFrA4eevnixZu3gmmploOrHOXrRUDsIAGfhUzh1H+j5GcxtmW1cU0D11OOLmhyEzJ5e+H/nRgdC7dqabEtPp/uF7ye5dz8AffYvqiTklX60pydqfeYjKsctMPv4m0r8+MoSWiaM1JbGHphaVko0G+ADXr2F7UdGtqj1Bc2oNllvCckv0Nu9FFRrT9UGKtUHSsTaaU2so18cIpE863oHnWzh+tXG+qE+C0IvcZc178EKHqj2BbFj5GcMyvyVB1UaGkuSWblLbuhn7+9e+a0ZlJSiaTqy5k/rEIMXThyKvp++BlPjVEtMnD9C8805K545SGzzP7AsoZpLoVPKHno9cqA1JhNBzKZ4+NLtr2/4HSPaspzZ4DmdqHLc8RevueymeOoQ9OVe4Kr1+B4quM3ng24SBT9P2W2nefQ+VgdNkNtyEDH3GX3ocpKTzng+jZ5oW3c/1ILQslHgcoWnonZ0osRhyCflwGfiEro2eyix5Ht+eSxKNjImC2dxO220PUjp3hNrgOdREcslSxQuuI+WsS1pGEhYouolQ1AUTvNBzUfRrySuRVOqjJGMtdOS2U7UmWG4gScZa2dr7MMl4G45bQVV1ulpuoS23hZMDj84almSslZ7WveRL5xYYFUXR6Gvbj+NV5xkVQWtmE5pqoqoGva178QMbTY2TCbqZqvTPGpVMoosdaz6MoSdxvOgb7DSa6Gq+mVOXH6dcX6VK5SrwjhuV7xbCUFIt+aSb9KvvDLMvXeC51C6dWXIfe2wQe2xlZslqGCyzUARGW4bY2jY6v+8OLpz5h1njIVQFs6sZe7Bw1Y9qJWRu3UDTXVvp/+w3COoLV1CeX+fC+AsAjEwfjTZeMak8N/b0gn+fH39+wb/zlQss98FN1y4zXbu8aPtE+Yp+lpB/6ih8R9DxPbeS2tZ9lbt6pyGY8R0Fdp2pE6/Suve9pHo3Url8lsqFE/gzs/EFFREX90t9dGA23jMDNZ6kacetxNt6ELqB2dRGdT4rSYaNFd/CcxpNrST7NtP3obbGdhFRdBEYmRacqYnZa9n5UbR09kZ0Bta5c2TuuAMhBC0f/nDk+iotkdEvJdXL52jZfQ+VCyfxqkUW+OCWcMHMrMbqQxcQqo4WT8/bPSQMfdRYcq4GkAwjQ9/ShTU+hNncgURGxrg4SbJ3A161hBZLoKeyOIVo1RH6XsOFHUN67iJSheNVmCyepa9tH0P5gzhL1P5RhMam7gfQVJPD5/+WijWOIhS6W/ewqft+1rTfzqWxF1fdvzPIJDpxvRqHL3wJyy0ihEBTY/jB3HdcscY4P/ocpdogXoPu3pJZz851n6Q9t42KNf62KT2/a4yKmW4h0dSNkcjNzhpCz8WzKtiVCezS5IoyDS0b9mGmWhZt950qk+deR4iAWinATKhLlsTO9d1MoqmL+vRow20mSDR3k2jqQotFwo6+Y2GXJ6jmB67JWJjpFpItfeiJDIpmIJbNNZVMDx7Hml5YT8QrVEhu7yGxuYvaqetUD1gCwtBIrGtHTbydYpw3kJjQ0Lv67qOh1dbg/yu6gTLPBVMf6Wdo8oskuteT274PLZYkf+i56F2ZqQ63zERgKUZYau0Wkj0bGHvhUZxigY47PzBLGplpzlJnk75PbfA8o8999YryvpLQd1GNOZFHxTAQbzWooigQhkjXpfT889SOH0cxzag2/TKB+srFE5gtHXTc+xG8ajFq89DyygNepQShpPXW+6OBX1VnjU/oudSHL5Hdtod45xrqQxeic0kwm9tpv/39GE1tlE4dwq+WKRx8npZ992E0taPGElT6T2Pno5m7V57Gq0zTfufD+LUyhUPPXSGuKpgsnaW7ZRfdLbu5NPbCorbGzRzN6XVcGnuRijUOSEIZMFo4xvqOe2hKrWVQPbDACKwGQiiMTB2ZjXdKKee5vWhsC8mXFtKiq9YkFWucuJFrEJX+DzUqQtVo33o3rRv2occzqHpsNgtXBgGB7+A7NexynsE3voZTWVp6omXDPjJdWxaeWwis4hiFi4eAgM51Ju29Jm88tfj4pjU7admwj+LQCaoTF2nbcict6/ehJ9KomgkIwsDDt6tUJi4xdPAxPHtpn7CiGbRsuJXWTfsxU82ojSX3zBAghFgQEJMyxKlMLTIq1ZPDxNe20vbB3dTOji5yU81dUJDa0Uvu9s3EepoRqsAZKzH94mkqJwZn6aZ6U5Km92wnfXMfyW09KIbGpl/5PmTjvMVXzzHx9TcAMFrT9P30Q5ReO0f+yaMLrrXmpx8CAZf/8FuzmzN71tN091aGv/A8sd4WWt57E3prGq9QIf/tY3NGUQjia1rI3rGZ5MZOlJiOV6pTfuMi0y+dvm533pIQIpqgKAqKEYtmsfPca2Imy1I0/jvPEEaqrmJuHyJ3lFBUEt3rQUJm083oyciFo5gx4u19+FYVt5jHr5VRY4k5IyIlvlUl2b0etzhJ6PsE1sripUIoIBRkGJLsXk+ydwPW+NzkQsqQwHMaLKYaoe8S2HWqg+fo2rCd5Jot2BNDaIk0CEF95BL1kX7ab38/yd4NhJ5Has025FtUBMjcfTf2+fO4o6OomQwtH/kIUkrs/n4qr746G1+Zj9B1yL/+NEZTW2SYwwC3FLl/hKbNDuRTR14k9Fx8q8rEq99CVpjhGAAA2QNJREFUS2YIXZviiQMEMy4sKSmdeRNrYhhF0/AaZRuGnvxbgnoNPZ1Dnj+G3WDIWRNDTLz6JFoijfQ9nKmJeQbKYeyFb6Cns8gwXJK9VrPzFMoXaM9tY7RwdNHv6XgnqmLQ3bKblszGBb8ZWgJHNRetLFaDMAwo167uvjL1DO25baTibRhaAk2Nk453MOVfulHcjCXxXTUqQtXp3vUQHdvuQSgqvlXBLk/guzaKqqMaMVQ9hplsXvYBz2Dk6LeZvnwMzUygmUma1+3GSMwt6zVdMHLRiYTdVlDxNZJN9N36MZrW7CT0HdxaicC1UPUYejyNkWyiZX0TimbQ/+qXCZyFMwShqLRtuZOeXQ+jqBpWcYypsQu4Vhk9kSHTuZlYpg2hqFjFUfLnX8cqTlArLHYHST9g8vE3af+eW0nv6KVybPE+APG1bfT+4/eixHScsRKh65Pes47cnVu4/CdPUnzlbDSr1RSEELgTZeJr2pB+QO3cGNKLBhVnfM5VoZg66Zv7sAcWBvWEECQ3d0az03nQm5Nk9q3HGizQ8uDNuOMlQtsj1teKnpmTjtGbknR83x0kt3TjjBUJqg7xvlZyt23C7G1m9G9fXt54rgaKQsvOO8nt2I8Q0H3/J6gNX2Ty9e8gA5+OOz9AomstAuh58PvwKkXGXvoGgVWj446HiXf0gQzoef/345WLjD7/dbxKicKRl2jeeQfZLbuoDpyjfPFEg+UniLf3kl67JXq2E8MUjry0IJt74vUnab/1faTWbqZ45k2mjr2KROJVSotcXwCV/tPE2jrp/cAPYk+OUjp3dOE3ICXjL32T1t33ktm0k+Kx1yifP441OsDki0+S27kfbfe9hHad/JGXZs+ppTK03/Ewfq1K+dzRiHiyDIRQUYS6ItMpsWUL1UOHQAgyd91F/dQp6qdOkXvgAdRMZjH7q4HQc7AnhlDRMZU4mgxxZA1JNPiCxC0WmDH2bjGPXy6RS/ZRt2u43pxRDl1nUZKjPR7FIr1KZGQEAiHUKF44PYksVwmkTxguNHpeeQqvvFKlTMnlidfoaNpBe9P2RYwpXYsjZYDtlbGc4oLf6s40lltcEKxfGssP+xKJF6wUVxS0ZTezte8DBKFLsTpEsTaMQDb69e3VAfuuGpVErpOm3h0oqkZp+AzDR57AmhqZDdaqRpxEUxep9vV49TKevfzMrjpxkepEI7tdKCSaexYYlWyrTluPwfAFe0VXSqKpi3iuk8rYecaOP0M139/ws2pkujbTveshki19pDs2ku3awlT/4QXH67EUHdvuQdVNymPnufjiF/Hqc4O1mW5l7e2fJNO1GaSkPHoOq7h0joHQVIqvn6fl/beQvW0jtbNLz06sgUkG/+I72IMFglo0+4lvaGfTf/xeMnvWUz50idD2cCcrjH/1AFomjtGeQU3GGP3ii4tiKtcLvSlF83u20/97j2FdioyRElsYw/Kmq4x9+VVCy8GdjFZ6ajrG5l/5FJldayl85zjuWPGtNyYMKRx5iUJjML0So89/bdlDR579yrK/VftPU+0/veRv+YPPkD/4zLLHGt0a44e+ip5LUDs/jpowCB2P8VcfJ76+HTVpEtRdhK6imBpBtUbx0itMHnyKoOYgDA210Z/C0FB0lerAGaoDZ9DUGJlEN8l4G3VnikRdZ+RbX8IPHBKxFhy3gkCgCI3KyTeZPvYqMSNLGPpM+TWEUNEUAz+wI0OiaPiBQ8zIEDebma5cuoJEMYfQ81ATCbRsFq25mdILLxDWalG556tofwkEveZWNpq7sWSVk/WXqMhpOnLbAZgsn0NXYwihYrslWjIbMPU0dadAwmxBU01qdh5di2NqKbzAQlPMiPRBiOfXiRtN1J1pTCNN0myhWBvE9y3S8Xaqdp4AQSrejutVGwYtThgG1J0C4TIuIsstMVE8Q1t2E5UrAvauX591d41OHVnx/kE23I8LB3pdW1x751phaEn62vYjEBy9+Ag1Ow802GjZLVc5+q3ju2pUtFgKLZZChiGl4dPUC0MLfg9ci8r4RSrjlxqMmOufwU5PeGiaoDC+MrdcCAVreoShQ9+gPjXP1RD6lIZPo8fTxG9tRzMTxJu6EZePLfCHx5u6MFMRm2bizMsLDAqAU8lTHDxBqm09RrKJeFPX8kZFEYS2R+HbR2l7eDf5p44tbQBCSe30QoPjTpSxLk2gN6eiGum8/crFiqEx9fypWYMCENpXXFeCfTm/YFNQsameGCSzbwNa0uRGsP+79I206WsAGPMuMuENXOWIxVDRyGkd1IIitrz+HBdTJEipOczOVoyWVGRohUBLxQi9gNq5UZpu30T+6RMITSW7dz32cIH6hXFiPU2EtgtSktreM7t/ams3MpRUjkfuzWyqD8+vYzlThIGHDAOEUBAIkrFWgsBB0ROk4h0YeorR/BFiRhY/sPEDh2yqB0XoTFcGMI0UudQaCqXz82bUCwc9BZUmrZNaUKL65ps0f+QjkerE0aOEloUwzUbl1pW/WQWVlNqErpjIUJJQ0pS8ScrWGJpiEDdymHoKP3TR1ThCKNScKXQ1gWmk8fw6rdlNKELD8SpIQnLJNQShi6bGGJs+QdxsIm42YTnTaKrZMBQCXU+iemWyyT78wCKb7EHX4thuBVXRCUIXyy0u03LJ6NRRdq77BFxhFMr1EYRQSCfaGS9qKwqO+qGDquio6kL2WTbRs2K/rQRdi6Nrcar25KxBmdmeMJtxvbdX6fm7alQiHr2LZiZIt69jauAIvlNdwjcll/dXXSMCP6S5U6d7Y4wDTxWX3U/KkOnLR5cZ6CWV8YsEvoNqRO4wRdUJ5hkVI5lj5gWzy0vzwZ3aNDL0UTQDzbiKlHkYUn6zn5YHdpK7bRNTL5ziyiC4UBVivS0037+D+Lo2tHQcJW5itmWiQeedU71edjU1C0VgtGbI3bWF9E19aLkESkzHaMngTVffEqNtBgLBGnMHWbUNIQSGMJn0Blddh75F72FH/G7O2QcYdq+hktSSbVHoNbfRa2yh3xtCZhT8cp3kxg5QIldkaPv4VRuvUEXLxAhtl3p/fpZOqyZMhK4hJVgDeaQbRHGWzV1UTw4hQ4kqNKxGeeMoH0hFERqyMRPWVBNF0fD8OqqiozXihDP0VE2LU65GtORMoptMsodi9TKhDFCEtiiw26x1c3PiXs7bhxg6cQKnvx+EIKjVoqC971N68cVlZVpmEOCT9wbJKC3UwiJTfvTdRddUUQRYbjFacZktuF4Nx681RDU9bLdENtmD61Wp2XmEUAhCBy+wiRkZmtNrgWhALddHcL0avm834pohqqIT09NM1IeJGVk0xaRmXyQZa0VRVmaK1uw809UBOpt3EsyLj9humZHCETqbbqJmTTJROjtL0kjHOwlDj2ItctXZThEvsOhp2UO1Pk4QusTNJta037bqd20GfmDjBTbJWAsxI9egHZts6HwPuhZftL8i1GgCItTZVZOqGEgZIKVctXzSd9WoWKVxqhOXaF63m9zaW9DiGQoX3qBWuIxTKdzQojxCETR3GpEi6FL0rwZ8p45VHFtWnylw67O/KZq+qLCXZ8/NaI14Bmt68SCrm0mEoiBDn8C/uuvJGS1SOnCBlvftpHy4fzawHjVCkLt7K33/5EGckWnKRwZwxqYhhPaP7pu5+6te45ohFi/V5yOsr7zOSGzsZO3PfgBFVykeuID9+nmCqk3zfTuI9S1m710PsmobCSUdKR0jyWkdxJUU9XB1EhqtWi+6MFC4fvl2FZUWrQtN6LgTFZyajT1aRPoB8TWt2GMlQsfDnSgR62vGnSjjTJSRno9i6ghNwezMUjk+hNmVI72jm9KbA0g3wC9bs+9xoXKRttxWTDdN3S6gCIVErJkgdBGKQtxspu4U8AN3loasKhqaFqdqTeK6tWh1Ur5IGPpUrQmC0MPUUhh6Al2N48zXu9IbfSMi5ldwpRJxECwrJHklxr1+xr3+uT5TdGJGFil9bLccuZNCf3Yl4gcOrlelOb2e5vR6CuUL6GqcIPQiT4NbxA88hFAJAxdNi2M5RVyvRirWRirejh/YmFqKMPQpVC7Qmt2M7ZZw/Rp+4OB4lQWGYin4gc1E8Qyt2c0LGHRSBg1WmGB913tY13l3I0HYxA8dLo6+AI1hou5Mc3nidXpb93Lbth9vsLgEE8XTmHrqmvrvSjhehdHCUdZ13sW+LZ/B9apoiknFGmN8+hSKWDjs97XfRibRhaoYJONtKEJj57pP4Icujlfh7NCTq7r+d9Wo+HaV0ePPgFBoXnsLmc6NpNrWYRVHqOUHKY+dpzRy+oZkomu6YGrcI9u68i2HnoO/goDg/KDcUlRMa2oEzyqjxzO0br6N6mQ/gTcXVNPjabI921BUA7syiV2auGrbpR9QOnCe5vt20HTnFqQ3Z/C0TILm92xHBiH9v/84zuh0Y3uc1oduueq5V7zPqGbtgu1qwkBoCvI6BAyFppC7YxNme5ZLn32M0uvnZ3/L7F1/3W29Ei1aN6ow8KVHKH0MEaddX0O/s3LG9HxE7p3lA9jXCl2JkVZbAEnlyADVsDj7mzUw55qYfvnc7GTHL0fvX2h7TD0/F78pH7w0+3f1zAjVeS7PIHAYm8dEGikcnv17fOrEgjZZjSS7gjdH4S3VBik1BrrJ0ly+kOtVqVgLV+0KKjn1rffNcghCb8lYxJU5IZOlpZWEpyr9AJTri2n448U54cz5yYbz/4ZI5WE+qtY450eeoVJf2BfF6mXODD6Bqhg47lz7HK/K+eHvMD59goTZ3FhBudSd6UbS5My9ugxOvE6pNkTCbEJKSd2ZolwfpWZPUnfmSzBJhvOHyJfOcTXK/tjUcerOVLTiEgqOV2W6epmE2YSuJRsr2giWMz3770J5oer6lSSGa8HbblQWWPAlfreKo1x+/StMXz5G+9a7SLb0kWjuIdHUQ9PaXdilccZOPENp5Myq1F2vhKIIXDtk8Ky14vMIZfCWKJZuvcTE2VfpuvkBcr072PTeH6U4dArPrqDH0uR6t5NsW4cMA6b6jyyI26yE+oVxKscv0/zgzgX1JNS4gZaO446XcCbm4jdaNkFsTSv1c4vdeFJKpB+imDooS686groDArRcAjQFGlTf2NpW1FRsduBbFRQFoyWNV6pjD80xghRTJ7nt+n3I86GLGBmtDQWFUjCJG1p06Oto09Zw2TlJuKILTMz+L6u2YYjIVSCEsuRqZSYYvNRZZs7VrHWhohHgowh1mfM0khivYqcFytz3JJe//uI7UhbsO3OPcytOOfu/q51JIMiorZhK5LZVWF3fzG/TUgiXqaC5MsS8e7r69a9sx8J9o15mwblCLLeINc9Qz8ALLMamTyzaDlG8ZLo6wHR15XieHzpMVS4xVbm0YPtS582Xzy/athQkIaXaEKXawjh1uT66aN+J4tLEk+vFqo1K6PsRPVVVEMpVDhcCRY9YDGHoL2sUfKfG9MARpi8fI9ncQ8uGfaQ7N2Kmmkm1r2dDUzfjp55n9MQzhP71hXE9JySRUkikVQZOrTAgSq7yca0MGfqMn3oBIQQd2+8l3bmZdMdGQCBlQOi7uNUp8hfeYOzkc9dMPpBByMRjB2m6ZxtGW3p2lu9XLZyJMtlbN5C+uQ9vqoqWjtP5/XeiaMt8uI6HPTxFdv9Gsvs3Yl2aACHwyxZeIZpt+cU69XNjZG5ZS8v9N1M/N4qWTdD2gd1o6Th+afVGRQYh1mCBpnu2kdm1loqqoMYMWt63Ey0dm2WuzUCJ6ahJE6GraJlogDfbMlEypB/ileqL6McpJUdKaUISMuldRiBo09eQUDNktTam/aX1mgwRo1NfT5PWRUptIq6kZgfLbbE72Bq7fdExY95FjtWfZ741iCtpeo0tpNWWKDgvIpVsVWrckfqeJd+sk9ZLDLvL1++IiSQtWg8dxlpSajO6iBFIl0owzbjXT94bXJZIsNa8mc2xW5nyRzlUe5KkkqXT2EC7voaYkow0ocIaeW+IMe8ilaCw6P3XZ/umk7TavKBvtsRuY3Ns/6LrTnj9HKk/y1KWskvfyI7EPYtW+nZY41j9WYrB1VfvEQRJJUu7vpY2vZeEkkUVGm5oUQomGXUvUAwm8OTSno4+cztbY7dTDMZ5o/pNkkqOTmM9bfoa4iIV5bmFNQreMGPeRcpBHqkp6O0tKIn4nJxO3cIbnXzLcd8l79DQ0VqbELqGOzwO/vVNrLW2ZoJSBem+/YSdVRsV361HmlhCieTlG7zvpSCE0ghcR4bjqpAhtcIgtcIQZqqZbO82OrbdQyzTTvu2eyiPnacyfvV630shkVZJZDQS6bde3vRqkKGPU5sm9D2s0gTlkTNRwMt38eolaoVB7HKe1WadW5cmKB+8SPN9O2a3BRWbwlNH0XNJ1v2rDxHUHGQYUjkygD1UINazOE4h3YDpl84QX9tG3088QGC5hJ5P/puHmXj04Ox+I3/9Aj2feQ+9P3ofgeUS1B1KBy6gnhhEy15H2eIgpPjKWRLr2+n81J20fXgvMpRYA5OM/u3L82JAETJ7N9D6/p2oyRhGW5Rk2PdT78OvOYS2x+X/8STuvNVZNItuIaYkCQko+MMYIoYnbXRhklM7VzAqcVr1PuJKCpC40iYmIk6/K60lByYnrHPlM0woGVr1PhQUAunj4WAQTayssLrkTNyXy0+UMmoLm2J7adF6UYTScOl5aMKgRe+mWeukoK/hvP0m5WApYkg0H08oGVq0HjbF9pJRWwgJCKSPIjRSSo50rIk2vY/T1qsU/IWrZ0PEaNV7SCiZa+4bWy7PMLLCKnlvEE0YqEInrqQwlFhDbPTa4n8ChTZ9DRvN3aTVZhBEOScyIKYkiStp2vQ+RtzzXLKPYcvF6QgRxVohoWRo1rrZHNvX6Jsw6hvUxX2jT2Ks7UHrbCV19z5qrx3BGxrFmyhc94C/4n3GDIy1PaQevIP8H32RYHoJ2Zt5ULORfE1QWugq1LvaCG3n3WlU7PLkLE0w0dwTVVF0l561mqlmzFQzANb0GNc+iEqcaoGJMy/jVqfZdP+PRQyxzo3XbVRCCReP14in3n6jkmpdS/ct7wehMPDql6lPjbIaAxLaHqN/E+VXLAh8Sxj6y2eZ/NYR3PEo2AtQOXYZZ7yI0ZJGaApBzcEenkJNxtAyccIlaMhW/wSX//QpzPYsQleRXoBzRX5I9dQwl37vG7Pn9asOzug0RktqkcRL+dAlzvyHv8EZX3iOK+GMTDP4F09jdmSjXAzbwx0rEnoB1qUJ7OF5fu7zo4zX7GUZYX554cClCZ0mrRNFKFSDItWgiCZ0nLCOqSbIqq0YIoYrFyeO1cMyp61XZ2fgzXoXm2P7UFAZcs8w5l5adMxSxqDoT3Cs9iwzg2OPuYW1xk2E+JyxX6ceLCYLLLfKSCgZNsf20aL1YMsaQ/YZisEEgfRRhU6z1sVa8yZatR7UuMaR2jO4cvG3KIQgpiTYFr8DQ5gMOMeZ9AYJCFDR6DLW021sJqXm2BzbR7E6TsCcC9gKK5yxXp/tmyatk83xW1FRGXbPMeou/iajvln6nS8Fk5y0XkZBRREK68yd9Jpbl9x3OTRrnWyJ7SOhZLFkhUH7NCV/kpAQQ4lWVp36BnqMLYDgnHUAfxlavSFibI/fiSFiXHZOMukN4uOjotJprKfH2EJSzbI5vo/pyjeovfImqArxbRspf/M5wuoVBnQpItAK5KBFmLdvWK5Re/Uwybv2LL0fC88b370Nf2KaoFxZsN06dmbp66+mXdeI1RuV4hhubQrN6CbbvY1U2zpKw6cXtUzRDDpvei9CUZFhSHHo5KLloRBKw5e8zF1JSX16lMBz0Iw4ytXcbSugMuVTmfJvBGN1RQhFJdm2DiORwyqN41SLq39wocTqX5qO7I6XcMevmK1IueT20PZm3VlLNJTQE1RPD89VDVRVtPYWQBBMl5Cet+R5vVqAMzEXExGmQeBD5XD/Nd2eX6zhFxcPpLUzi3Nt3IlrZ2wZIkGz1gVE7hdJiCcdpvwxMmorGbWFhJLBXSIbOSRYwA6Lh+lZN5AT1qmG11azJsBbEIx3w2iQl0jqQWnBbytBQaXH2EKz1oMjLY7WnqUUTC5wTU37o9TDEjfF76FJ7aTX2MJFZ+lkOyEUdGFw2nqNMe/ighVT2c4TIukztpFUszRrXUz6c9npV/ZNLExFiZBCxZHX3jfzzzdr/CTLuqeWgyHirDN3klCy2LLGkdozC912ARS8ISyzwvrYLnqNLRT9cUa9pSekUd+YnLEPMOqeX9g3VoFQhqwxd5BUsrToPUvmPAnTIP3gXSipOHpbC35hmulHnsDcuCbabmi4Q+OUHnuG2LYNJPbsiMIDqQTVF9/AevMU8V3bSL1nPygK7vkBSo8tk0iraaQfuIPYtg0A1F45jHXkFKn7biN1/+2ElRqp0m1M/fWj4Pkk79lH6t5byf/Fl/EGolVofM8OknfujtQfTpyl9uJBUg/ciZpJobVGeXblJ57HvTS0dBtWwKpHaSlDJs68zJr9H0fVDdbs/zgjxhNU84P4Tg2hqJjJJprW7aapbydCQLUwRHn0CgVaIUh1bCCWaac+PYxTKeA79dkYg1BUjGSO1k23oxlxZBhQm1r9DS5u/1s+xVXOL2dpx7FMG2v2f4z61PCCWJAMA3zXwi5P4lTyb4mAoLW3EtsW6QtJP8CfLuJeGkTaK3+oSiZF7ns/xPSXHiWsRAO8kkyQfvAezE3rmP7br+OcWzw7B2j+zPdS+c6L2CeiOIC5eQOxbRspPvKN676PG4FWvQddMQlkQN6be1cm/cusNXcQU1Jk1NZFg/O7EaaSoF1fi0DMxgauhESS94YpG3lyWgfdxib6nWNLkxEkTPmjTHgDi1xwvnQp+MN06uvRhE5KbVpgVFYLrT0HoSQo1ZBhGOmoSQmKgtaURno+oe0S1q6vhEFabaJJ60IIwWX7FOUgv2ifkJDL7ila9V6yWhtrzJsY8y4tHbyXUAzGmfD6F/cNUd90GRvQhEFaaWKCpQPvWnMWd3CU4t9/K2JN+gFBqUL99aOgCNIP3omSiCNiJgjB1N8+htHTQWL/LuxTFzF6u3DOD2C9eYqgsoIunAxxB0bw89OomSSp+/ZTP3CUylMvobU1YR09i318LkZXefJFjDXds7WMlHSS9IN3UfifXyKs27T82CdxL4+gphJI2yH/Z39H8q49mJvW4V4ehWB149N1Tf2nB46S6dxE05pbMNMtrLntk9ilCXy3PhtHMdMtKKqOWysyfvI53PqVM05BsqWPnl0P49SmcWvT+HaNwLORyKhiZLKJZHMPUkpKI2eoTiwe5ISiEsu0oycyqLqJqpmoemw2lqOZSdq23InvNAT3fAffrmEVxwmvIUdk1ZAhpZHTZEe3ke3eRuvGW2HjrXM/S9koY2xjV/JMDRxh8tyr10ebFmBsWEPi1luwjp5CxGOkb9mGlc1Qe+3NFS2orFlUnnmZ0Jr7sMNyhdJj3yb3vR9aVTPcwRGC0jtVRnX5ZV+HHtGSa8E0Vjj3UZb9PLask1DStOo9DLtnF7h33o1IKhmSShRHynvLD/Ch9KmFZXJ0YChxTCWJFS5enYYElIIJ/GX0CrzQwZcumjDQxfVLhACY67qQjotY14lQVdRsgqBYRQYhWlMa+/wwwtCu26g0az2oQiWQPpMrKCVExnKErNZGSs2RUDLUllgphoQU/cllV0yedPCkiybMhX1zhdcjqFn44/mIPBKEoKqk77s9+j5mXGQNtqU3MoGs24R1G8IAoSpUXz5EbOt6knftxp+uUH36lSXbo2bSJO/ag3X4FGHNQujaLGngWqBmUkjPI5iOvll/chqtJVqdOBcHIQgIaxZKMn5dycjXZVR8p8bgG4/i2VWa1+1G1U2SbWuY6WUpQ2TgUysNMXTocSpj55dgOclZI2Ikc8TSLY2OmbdHgy1VHDjCyNFv41mLPxbViNOz+yHSnZsimqIQUd14Nbo1LZaiZ9fD0XJdRuRBp1Jg4LW/p5ZfWqDxrUCPZ2jfejeJll7CwCV0Fw9egqh9ydY1xJu6kIHHxJlXuF7npjs0RvWF16OkyPvvRO/tQjvfT+Yj76P0tScJposYG9eS2HMzpcefRm9rJvepj6AkE0z81z8jrK5MohCGTuaD9xPbuglnYAglmZjb/uEHid20Bef0BYqDkfvKWNtL8q59SCkx1vbgXR6h/OTzBIVpjPV9pO+/G60lh5JJ4Q4M437rDVJumsnCKVTFwNAT2E5pNnAbygBV0ZGECBRisRyWNYXn12f1qFJKE2k14vlPBaML4h0zWdtrzB00a12YSpz6EgPvuwlptWW2CuYtyfuXpUILBJowZv82RAzryuI3RFT5WrB8kDeiNUfXUJYt0XBtUBSB0p5DMQ2Cco2gXIvUAQwNd7SAmo7PxgOvBxk1Ip9YYRV3BddZSEAtLEUaZAjSavOSRkUSUAuWd+HN9I2AhZVJFwl/zBWjg0ifTe9up/rCAUQ8htDnMvSXkq9RknHsUxfwJgrkPvH+yKhoGkrMAFVBScQIqzWUZBwlHsO9NEh81/Y59zUgLQetOYuSjEcGSwhEzEDoKiJuIkwDPx/dq7Ghj7BaR+/uoPrSQYy+roWlCq5zMX/dQQq3XmTo8NcpTx4l0bQe3Wwils3gWzZOeZpaYZDSyJnlKcBSkr9wgMrkJdLt64ll29FjKRTNACnxXQunUqAydoFaYXDZO5RhQH16lNVkjXtWheAKVdh6YQhVN3Hr5UXKw1derzRyBj2WopYfXKDro8czbHzPZ0i1raUyfpGxU89RnRhorIiiYkkIBc2Ik2xdQ++eDxLPddCx4z4mzx9AXqeCgNbWTPyW7QhNRetowzpyEiklSioJavQRCE1DScYjleKBYQqf+xLNP/K9y+apzEdi/y707k7yf/FFjN4uErsj9pl0PUpfeQJvaJTYjs3zGqQSu3krpa8/RfmJZ8l+6AHiu3ZQe+UgybtvpX70JPaRUzT/8CewTpylPniOeOvNtDRtwfOqKIpGJtMXlWCtjuD7NplUD7FYjon8ceKxZkwjw1TxPH6jAFG7vhYFDZAIqdCq9y64h6DBUFTQaNfXrioR8rsBozEjljKSYFFW+MJnYkeB9JdMyI32kXgrsMxuJCqvnkTNJBCqij994423ISKSiC9nvqvlEUiPkGDW4C4FicRbreKclNhnL80ZxzDEG51YELSXlkP5qZdIv+8u/HwR6/ApDD2D7usE0zVS7eux7GncoTGkH2BuXIO5oQ/p+ZS/+TxCUUnvvAVtSw9hqUrqPfuxDp9C5C28gVGyH30Q5+JlrCOnZlcptdeOkHrgDrJ9XZS++hQiZpK6ex8yCEjuuwktl6F+6ATFL3+T1Hv2I3SNyndexp8o4I1MEDRc4UGxHJ3zOvQW31LyY25bG4pmEybOM3RwiGR3ltpwicD2MXIxzGYDe8pfVCPDaGknsXYjaixJUK8ydfJNQnf5GYeaTJHecjP1/vO401eIEboWI0dWJyOwFMZPv8D46cUFd65E6LsMvPrIkr+1bNhLsrUPp1Zk9Ph3KI8upRcV4FkexaGTxDJt9O37CEYyh2YmFolPXivUVBK9uwOhqtFSGG6IhtYMjPV9WMfPEEwVscoVMsWru7q84TGcc5cIi2Xcy8NobS1R+zQNPB8ZhoSuN9vOSnUUVTXwfQtF0bGdUkTUsKfQVJO6PYXtFAlCn0p1FGQ4mwWsCYMmrTNaAQrB2thNrOWmZdvWrq9jwDnx7o6rzJsRn7PeWOCaaUxPFv0dElJbUYrmBtaquQqC8tsrWnijsVpdOEIZxU5mjvd86q8tJknYxxfGNzpvuh9sher4eXr3foQzT/4xtRcjGn/12deoPvva7L6amcSsGpQeewG3VpzdnmjupfKtF6Jy1VfAG5lg+gtfByDXoqJrLoXHvkMYQku7ij0VIP3Gfn/7DTQdttxkclaVEautAffiW4ipXfeRQLw9hZmLR291CJmNLbglCyMbI7OxhcyGFi783ZFFn65fKeGMDZO5aQ/Vs8ejzpkphtRwUzGjqRUGhLaNYsRQEymYXhyUe3cgihEJRcOrl7BLS7O35iDn4iiSt8QgcPoHKT/5HPgBiVt3kdy/i9LjVzBHlMWSK9cKoetIp9FWPyBcoujSlQgtZ7ZOC6EERSA9D/vEWdLvfw/Ju27Fn8hjn4wMr2UvXXMDwA29BbUzXHfh7DetNEdaX0Aow2UHiJmM9KSSIa02Uw6Wv+Z3G344Z0Sm/LFVM6z+T8bMiity+608eVLQZrPmV8oHeucgEUJgplvxnRp6Ikvrpv1oeoKJsy8T+A4t6/agGjFq+csNd/o9IEMmzr2KEc/SsmEfw0e+hR7P0LJuD0LV8awyhUuHaFm3Bz2ZpTo5wHvfO8LEiEOfJTl52KG1Q6U0HaCq0LdBZ2oyoFIO6V2rMXjJo1oO6ejRsOshpemQjm6VZFph8JKP61z7+PSWjIoMJVPHxshuaUXPmAhFYGTjOFN1Ur1ZvKpD6C32nYaug1eeJrDquKUp1HiKltvvQ4YB9tgQTn6C7M5bAUnt0jnq/WcJbIsbTqi+oZjzpwpVi9x4K0A14lFNFSJ3nL+Cy+3aIKJZv6rSkHCFMERNxgnLOkZfT6OK4erh56fQe7sQh0+gpFOoqeT1t9I08YZGqL95AuneiI9ckNXaiClJAjzOWAeWpY526uvZGr8dTRi0aX3vsFFZ3cqxGk7Nvk9NWgdV991kVL6732E5yNOidxNX0ujCwFsi7wii2FBCzSBEFJervAsMswxDAq+OkcwR+h6BazF16U3iTV1ku7fgWhWs0jilkdNoZpJ4rov8hQPosSSZzk3kz79OtncbiqJGhQzNBCNHnoxEeXtvwkg1MTVwhKbem0hmipz6ZpmtO03iCcGOXSYjl31iMcHajTr77ozx95+vRHN4AdtuMchkVbrXahw/6LB2o866zTqf+4Piqu7xLRmV6kARIxujNlImsH2cqTqqoWLkYjjTFkJT0DMmXnllZlNizQbqQ5eoXTxNx/s+jppIUbtwCmt0kM6HPkG9f3kJiwU3k8yS2XQzihEjdCysiSHsieG3RNldDerTIzSt2Uks00bLhr2Mn34J/4qSw4qqE8910rx+D9neHcgwpHDxDdRcksCyEaqCdLwoFiJBa8niT5dRDJ2gZi2ZtWtuXEv2ww9GWl1NOeqHjhFUqnij46Tuu5NguoTW2UZYr4OA2M6tmBvWorU0k77vTryRMayT5zD6ujE3r0fv6SSxfxdaewvW4ZNYB4+R/dhDZD/6fqTvz0qjqM05Yts3Edu2Ca2jjfT77sE+vbw2kRIz0TvbQFWJ37wVETMJqzUq336RsHZ9RtUQJjm1HYGCG9bJ+0MEcumVVMmfxAorpJVmslo7umsuy/iRMojkiIRAEdefMDtDUVWIpMWvFZWgiC2rxESKDn09I+4FgnegJs61YL6G2FtRcL5eFPwR1sgdqEKjVevlsntyyf00YdCidSEQ2GGVWlB8Zxu6BGQYEHo2aqqJMPBJta8jlu1AURplCoSIxispG7HleqNEiDEnizXPpnv1UiSBJSWqbmIkssTSrdQKgyjCZetOk8CXCEWQyii0dag0tar0rtOREuIJQWuHStcaLbo24NoS15G0dapMTQRcpSTOIrwlo1K+sHCmN/F65IczWxK4JRsUQehcnbopfQ/RkJGXjVoMqCpCVWdrVUdYebanZ3Kk199E5dJJFN2kbf+DTB74DtbYjWd5LYWpi9HyM97URfu2e0h3boqo1k4NhEAzEhjJXES5TkXsntLIafIXDhDbvSFKhkonqL96DL2vI9L9acrgTU4jLRs5MEboL+wPUXYxKybxNTupnDqKde44qda1pO5aR+3kObSNGxGWT+lrT6Kls2S378UujZPp3o5eiUOul+K5AVpuvx+zrw+pSspPvYxXKSOdyIXljYxT/Mq3UHMZwmqN+qHjBNNFCCXe2GRDOkIgg4CwWiecKlJ58jnCepTgZp88i7jQj9bRitqcZep/P4J0PfSudtLvuxcllbxuo2KKBFmtDYgyte1weX5/LSxRC4qklWaSSpaU0sR0sHSBNFfaEeNHKJGmFPp1Dep2GN2XIlQyajOVa1wdOWGNCe8ya4wd5LQ2+sxtDUHMpSdIKhGz6J0wPG5oNwxLpL2loS+brf52oBJMUfTHada6WWNup+APUwsXxyO7jI1k1TaklAy5Z69TrPIGo5FS4FmVyEgIBTPVjO/UCX0HuzxJru9mEi29WNOjC9ziQlHJ9mwn2dKHv66OXZpYwDarT49GcZh0C05lime/WSP0PcqlENeRvPhUnelCwPRUyPhIQOBLfF/y8tMW1UpIrRrS1Kwy1O+RSChcOuuRySm0tKnkx6+9794WlWKnUGeyaAMSGSzH2goJrDpISa3/PC133Eesq4/K6SO40wVye24ntWEr04deJtbZS6J3HWZbJLdtDfcve23fqlK5eALfqqHGE8Q7+rDzo2Q23kxu214UI4adHyN/8Bm88hR6toX229+PkWsldG2mjr5K5eJxzOZO2m5/H3oqS+i55N94htrQygqhbr3I+ef+kr59HyXVto5Ec08UZ2nMAGZeKBl4uLUi+YtvkD/3Kp5TxdA3EFoO3sgkIm6iNWdBSoJihaBYiVxX6pUy9GkyG25m7G++gF8uohgm2Vv2U71wGr9cJHvL7dRPnSPeuw5/Ik8s205o2VjnL5CvfY3k2k1Mv/kKQtOhdS2T3/gKRnMbZnsXtfPHIHAxEhoBCsHkJGF+ElUTBJ5E1QQI8Psvz73YQkSS+BK8eRLhwUxgXwiUeBxjTQ+hZRPftQPpuIQrJXpdBU16J6aIKM5LyYXMhyQk7w3Srq+NEiG1VorB+JIB+2pQxAor6CJGl74BK6ww7vUjZdggBChIKbHkyuymUjCBJ20MEWejuRcvdKmEhYjm2lA/Xko/K8BnyDlNWm2mSe1kY2wPObWdEe881aAISDShk1RyNGmdtGjdnLJeIe+/9QThq6EWFqmHFQw1Toe+jnpYYdy7SCgjQ6Os0DfR6kabJVUIBGqjvodAoAsTXZizShsSuSinyJUW/c5x4kqahJLlluT99NvHKAWThDJEFyZdxgb6zO2AYNK7zKh7beq+NwoaOmHjf/P1kyfPv964VxrfS0hl7Hz0DckQGYZYpYkoG6vBvJJhiFsvUm/UZqqMX4x+CwOqU5dAhUL/QQhD6tON5y9gWkYTdMXUkX7IpXNzhn86P2ckBi7MbR+tR32dSAoyOYWxYZ/CxDuQ/HgtkMHKa6agXmP64Fz98PwLCxlc+ee/teDfo9/4u9VcHdWMoZoJ7HxUcMsau0x9bIDQsWm/42HSG3YwdfhFMhtvJnAsLn/tf6KYsVmetl8vk3/jGdxygfT6HbTuf/CqRgXAqRS48MJfzxoUM9WEohpAQ1DSKmNX8lQnB/DtucG08vSBhf1TqmL0tOMOTSzWFmog1t6FO13AzUciiYoZJSt5UwUCq05YrxHYdbRkGsUw0dM56sMDjcp8XrSy8D1UTUeGktB1sMeHMdu60JJpNFlmz/f0UBioUZtyUQ2FRFYn8CSFwRqJrIFrBRhxlcAPUTWFyYtV7OrSq1N/okDlmZeJ774JoSp4Y5PUXjowu6JZLQQKHdq6SE02qFBcZtUxH3l/BFfaxJUUzVonI+75JX3yIQEXnMPsiN9NTEmyJbafjbHd+NJDQUUTOsPuWU5aL694PSeMBsD15i3E1RS7kw/iSYeQABUdRSgcr7/AmHdx0bHVsMgZ63U2xfbSrHXRYayjw1g3F7ubx/ALZbB6BtN1IiTkon2YHYm7iSspNsf2sSG2C1+6s30z4l7ghLWYTZnT2unSN6EJHVVoqOgk1SwQ0ag3x/fihBYBPoH08KTLRfvwIr22gj/Mefsg62O7SCvN7Ezehy9dAhk0ioephDJg0hvgvP3mknpvbxcEgi5tPdWwjGTmuSiNtF2JioYjLVQ0QgKqfon5Pi0ZeOiZZpK9m/BrZWrDFwl9d064Vwgy62/Cq5VRmgOUhI47WgRVQXo+QlNRUxF9OihbGF05QtendnzwquPyDOo1yaFXr6/PvqtFut4OmM3tdN73cQDcYj4yBGGIUDUyG3agJbOYLR34VsTHtvMjpNZuoXnPvZROv4nbKAEsw4B4Rx+5bXtREyn0dJZrFfGSgUdtsp/aZP9130dYqWOfvsrxgqvzyMMQa+gSifVbosBg7RryBhrZuTKUKIqgZU2CXHc8ivGYCr4TUik4JJsNmhIqZlLFKvvEMzqFyyskUoYh9tFT2EdPLb/PKhBvrDYAJv0h/Gsoe+pKi2l/nLiRIqd2YIr4soHevDfESV6mS99ATov2NYSKL13KQeGaAv2SkCH3NK606dTXk1Fb0YQxm1tS8ovY4fJ9Vg7ynKy/TKveS6vWQ1ptwVTiCBT80MWSVSr+FMVg7B0lHuT9YU7VX6bT2EjTbN/E8KXX6JulWZpptZk+c9uSvwmhklZbmC8kHsqAy86pRUZBIhn1LlEPq3Tq62jWuoirGXRh4kmbqj/NhHeZSW9wSYXitxtRe0OalS4K4QgaGiCIK0lA4IcecZHCJ3qGV67GEh1r6H3gB/Aq0ww8/pdYk3MrUEU36LzrI9SGzlMcew2jNYNiaAhNpXZmhPSutXiFKkKA0RqxIhVTR4kbBNW337i+I0ZF1yGdVOZT76nVJLYrUVSFMAgXEu5hbuyev61BXV4JXqVE8eTr5Lbfil+v4tcqqPEUHXd/iPKF45TOHiG349bZNI7a0AX8apn0xpvpefjT5N94msqFE3Tc9UFkGDJ17BX0VI54W88Cm5JNK4RSUq3Ja2YDx2MC0xTMSCF5vqRuySWldTQNUkkFx5FY9tIXcCZHyd60F6OlHb9aRvoehCFGSxteqYgST+CVi3iVIm33fYjaxdP4tUqUZasbUUKk3sjGVhSUWByztRNkiF+r4AU+Bx65HHV8tB4HIQgDSRhI8v1RrXAkpFpN1uzJoZkLXXSZlAICqrXwmgN+RnMbejqHVynhFvMNynWI2d6NOzU5G4PTN23ilYuPEXouvvCuOe/klPUy56w3oj5cQaJdIpn0LjPtjaIKfdaJEZV0CpclBFwJT7qMuOeY8AZQUK84T4B/lfPYssqwe4Yx9yKqUJkpcCWJssEDGTQGpcX3P+ScYsy9CEicJRSMZ1AK8hyofhOBQnBNiYCSSX+QKX8MTWjz2rRy3ww755lwB1G16D2aIS0uz6WRKzwjSSmYoBIU0ISOQJ1dDYT4+HLld2LIOcu4OwDIJdWdZ1AOpnij+kSjb5a+LyURI/fx91J95SjupREmg2Ekkko4TdBIvhRAMYyefUhAlSI0+mu5+9NTWXJb9mLlR5acQFoDk9T7R2az6kPHZ+rp40gvaLA9o+0ylAsqxr6deEeMyj23x/m9X2ujt0sjkVAwdPjpX5zkr59wadvRSulyGd8JiOVis2Vq/bqHYqj4lkfohSi6gpkxCQOJV/eoDC094w49B3tyhHztGdpuex+1oXMEjo1qxqiPXCJ0bcxcazRYAaqZwKsWKRx6ltC1yWy6hcrFk8Tae5l87dt45WmSPRsW5HhkUgovPtrH4IjHP/23EwyNXn2GvH2LwS/8TI4H35OkvUXFskNePmDzi/85z4nTiz/iB+9N8Bef7eBvvlLhF38tv+Sn4VcrFA+/Tm7X7SAE5ZNvUjlzjMyOPSTWbKR86jCBVQNFxRrux50ugJSo8STJDVvRkhnS226hcuoIoe+T230HXrFA8fCrkYECnNryL+L8X6YG60wNLvz4VQW++TeRMf6pnx/n+BL3uRRCz8Xs6MaZnkTRNMyOHoJ6DbO1E8UwCR0bZ3IMqYQ4qo0kiAyRomKNDi76+HQlRi7ew1JEj/TsX5KyM47jL57V+nizA79oFD6LSCQSpIJQBIoZzUSl10j2nSnQGEqEoiD9AE86ZMwOTC296BoQlZYtO2P44eJ+kkh8XPwV7KZAkIv3oClLZ46ngYozge0vTpCUhCsa2OUQ4F2zcZ2//9ZdKfpP1klkNJJplaFziwd1U02RiXWSXiUde2mEke4eIUHoE0ofP3TxQwcvmCEeLI1r6RsRM0g/uB/n0jDupZFZUoDfOO9Sj01ehTgQWDW8Wonctr0Ujr+MW1q8+pNeQHgFNT9sFLv7bhG/35JRyaQVbt8bY+cOk+ZsNCOdLAScOuvy+ps2xVLUocdPufzir+dpblL5xAdTfPLDUZ5D6EtUQ6XtplaEKlANlcAJ0JM6MpAIVTDwzGUS7UkSbXG0mIqZMZk6O0VluLJir9mFMayJIXLb9pE/+CxOaYrWWx8gsGsNtl60NEqv3068oxcZhqhmgvKF4yAllQsnaLr5NpJrNkUMtHkDlVAgFhNo2oLE52XRnFP41V9o5gP3J3nsqRqHTzjoGrgeFApLv1i6JtC1aJW3rNdNSuqDF6gPLgxQ51+8QmEgDCgdnYvZBFaN/PNPLNhl6tWnr34jq4QQEI8LXFeuKu8yqFfxa1WCeg0j1xKtnsIwSpINoxWLV5qru2K2dRLr7EVoGk5hnNBZuMRPmq3s6f7EitRgKSWXpl/jXP6FZQcYNWGS3NaNPVjA7MohtOh8WiZO/dwYStxAqApaKoaUIVo6gTNeJKjY2MNTCBTWN91GV2bHkuevOJMcHXuMinOtlQ8XQhE6W1vvJxfvXnaf4+NPMFRamPktVIXk9h5SO9cgFIXamRHKhy4u0JSa7YNUjMze9Zi9LUw+epCgMmcM9LYMuds3I0yN4ounF5domIdcu8E6IYjFFYJALmlUcvEednV99C1RuiEyyFJGRiWUPkHoRcYktHD8OrZfoeYWqDiTlJ1xwmtwoy6NG1tXQ8qQyuBZshtvoeXmOxl96dGrHqOnm0iv2YqebgIpcaYnqA6fx69FE4lE5zoyG25i4o3vEDakqnJb9xFr6qDcf5L6WD8A8Y41ZNbfxOShZwmXqZe1HK7LqAgB+3eb/NK/bmHPzSbptMKMOojnQaUa8kefK/L7f1rEcSWThYBvPRNZ+r5ujU98KDIqTtlh+PVREERuMC9oJNOLKF8jDLGLDk7FpTJcIfRDhADfCZYcZO38KBOvPIFfq0Q14I+8hBpL4NerTLz0OFoyjQx8fKuOUKKRutJ/CmtiCCEUQtfBrUQJUlNHX0LvbwYh8GtlSqcPztL7KpWQD/+jYVxXMjp29Rdw5w6TvTtjnDzn8rO/NMHUdIiigK4LnGUyVZ99uc6D3zfMZCF42+X6rwXxmOA//utmnnimxgvXGMDzA/jUT44iBFweWiXltGHE9aYW1HiCoF5DBj5maydSSBTDwGjpJHAcvGIBFIXAtgm960uoFELQm7mFy8VD2P7Sq2AlppPY0E5Qd0ls6EDoKkHNIag7qOkYWjqO3pRE+iGh4yE0BUXX0HqaFxQfe7dBb03T8v5bmHr2ZKSCoIglDQpENXpqp0do/dBepp45MWdUVIXc7ZtBVSi/cRG/vPJAdPylEht3pgC4fOrtlXSJmGYqCFDR0NUYC9aoUhJIFy9wsP0y45WzjFVPY/tVVj3fV1XQVmEEZ1ME5rmYZ7YIFTsf0YTT63YwdfJ1nOmlK5cCJHs20nXvxzCSOWQYIFQVpMSaHGbkha/iTE+gp3I077iD8sXj1McGQCi03nIP8fZeQhlQHx9ACIV03xZym3ZROPLCqukf12VU7tof5/N/2EFLk8pLr1t8/stlTp9zURTB7ptM3nNnnJcPWDjuyg9EBhKndHXJd6/m4dWuPihJz8Xz5j7ewK4T2NEL69cr+PXFg0VQrxLUF7s8Qs/FKcyjxVpzwdRQwtkL1z5IdnWopNMK336+TmEqekRBAMEydGuAak1y4sy7QVYiQkebyo/8QIajp1Yn0X+hf/X5CzIIKJ86DFJSPXeS2oVTDcolzAZxpCT/YoMhKCXuVMM1cB0CeDPQ1Thrc/s4k3+OpQaTwHYpvnoee7iAdWkCs7sJa2Cysev8IOCVf7/NleHeIhRTB6Fg9U/iF6uzzRe6itmZQ+gqfsXGy5eRfoA7USJ0POZ2FMTXtRFb09roD9n4fWnopkBKGDxbJ9Oik2nRKU9990oRCCHQhImmmMS0NLlYN+uab2OkfJzh0jHqXvGamHUiZtD64x+j5Uc+fE3XlX7A4M/+NgQh8bXrURNJahfOzClNNAgz+SMvsH7ddnJb9jB+YGmdw1hzJ933fhwZBlx67C+wJ4dBKOS27KHzjg/Sdc/HGHj8c7iVKXyrSry9j/rYAGZTO2o8SW34IrFcO6qZQIYhZlMHVn6EMFj9c1m1UWnOKfzW/91Ca7PKn3+hxG/83hTTpbkOf/OYw//+0jtVW+P/G4iZCqoK9ir0c95teODeBKbxDg6OszM2ORtnW7j9yr9vDJ22I7WFofIxau5iJlVYd7Hr0fbQ8bAuLeWmkkv8/e5+7l6hgj1coOP77qB+ZpjyoYsEVYeme7ejt0Y1XYy2NONfegV3cvG3HbnPehsuwcjP6YwVkUuVfVAgmdXYtDuFqkKmWWdyyFnS/fXdwEy5hZiWYn3T7bQm1jNQPMh49ewCPbYlEYQ4FwbxJ65NDiZyqzfo4ZpG6Doouk4wa1QAIbALo1QHz5Beu43iuTcXT46FILVmK2ZTe8QUG59J9g4oXzxGqm8z2U27MNJNeJXpyKi0RSresdao2Nn02YO03HwXWjxJ4NqYuTbK/SdmY6urwaqNykcfSrLrJpPXD9n8978oLjAoM1htWv+VUBTYvF7n4fuT7L7ZpCmnULckZy+4fPnRKieXmMErAm7ZYfKxDybZusnANAT5qYDzlzy+/VydIyedRe1qaVL4gY+n2bfLpCmrUqmGDA77vPyGxfOvWFRrc4NBPC74qR/J8uC9jVoiwLHTDp/94yKTS8RF3n9fgg88kKCnU2PbZoNUQuGjDyfZuF5HAH4g+eo3q/zl3869IOv6NP7tTzexbo0+O7d97Kkaf/K/V1YvTiUFD92X4L13J+jqVAkDGJsMeOOwzZPP1hmfnGtfIi54+P4Ed98WZ02vhqoIRsZ9nnvZ4vFv16hbc/fc1aHyg59Is32LyT23x0inFP7dP2/mh78vM9u+lw9YfPZPirMGU1XhH/9Aho9/KDXbTxcHPH7vT4tcurz8C9rTqfHpT6TYtcMkkVDoH/R49MkarxywcOcdlk0r/MnvtPP1b9V49Mkqn/5Emrv2x8mmFYZGfb7+RJXnX7W4Bs3LRRBCYGppOlPbuDD1Mu92Y3CjENQc8t84RHxtG+m964lv7GTiK6/T+qE9+MU6oeMRX9dGeWPHkkZF+gFTTx1Fy8SpnR6mcmhxMb3ZfUMo5z0uHq1i10JiSWVBvs27CUII0mY7W1vfS8po5XzhJYIVRCml51N94U1qr524xivIWTejMzqM2d17RdB9Tou6cPxV1n7wR0n1bKJ0/uiCCZWiG5hN7QhVo23f/bTccs/scUIo0W9Cwci2Url8Gq9aJNYSld2ONXfi1SrYhbFItDeWRIYhejqLU5y8LomrVRkVRYGH7k8gJTzxdJ2BobdnyXrTVpOv/GUXMVPguJIgkOia4EMPJvihT6b5+f+U57Gnagsmqt//8TS//+tt+H5EwZUyouV+9CHBJz+c5KFPjVCpzVmVm7cb/PFvt7Nlg0GlGhKGElURGIbgR38gww/801FePjCvKmIIU9MBpXJAZ7vG3bfFSSQU4rGlB/wN63T27DTRNUE8LhACTEPQlI1mckEA8djC6LXjSibyAR3tKps3GNy0xeDigLdsUTfRMKS/+X+3cPveGPW6xPUkgihec+/tcS4NeLNGRdPgT3+3g/fdG8dxJZ4fvbZ37Y/xI5/K8MijFX76303MDuK9XTofeSiJpgoyKQVFQDI5dw8AiYSywLsjJUwVA6aLAW0tKvfekaCrw+V/fnHp1auqwgP3JPgfv9VGOqVQrUnCULJ/d9Smz/1tmV//bGHWwBuG4MH3JEDAZ74/zfbNBp4X5dO85444n/54ml/93QJ//oXSdRkWRai0pTYyXj1D1V0610KISMcrCv4u/OhU1SBo1MURQsxmRb+roQgCy6V6YhBnokT3j9yH3pICCUN/8R2CsgWaQmjdGHdsGIJuKNz5kRaQcOiZ4g0579sBIQSGlmBt0z50Nc6piadWZLtJz0c6q++noF6jfvHcsjNyuzBG5fJpmnfcTnXo/ILBXigaqjHD+BMo6sKYjlvK4xQnCT0bpMTOj5DsWo/Z1I6Za8cav0xg1fCtKrHmDjzDJPQ9vOr1leJYlVFpzil0d2g4rly1b301GBr1+J0/mmZ41OeNIzaFqYDODo1/8eNZ/s0/a+JTH03x4usW08VGMFeDf/8vm6hUA/7dr+V56jkL15P0dKrs2RlDESwwKIqAj30gxa27YvzmH0zxx39ZYqoY0JRV2bHVYH2fxulzC18Mx5F8/ksVPv+lCumUwumX1gKgZpIwXkWJmQhDJ6xZSMflT/93iT9trDB+5PvTfPbX2njk0So/938vL4k/Oh7w65+NYkLf83CSz/9h54r9lMsq/OZ/bOXu/TH+/rEq/+tvSpy76KEqsH6tTluLuiAu4/vwN/9Q5oVXLV4+YHGh34sG9XsT/PovtvDpT2T4k8+XOPBm9GwPHLZ54JPDAPzhf2nj+z+W5ld+u8DffXX5ZLIwhK88XuMrj0c5LKdeXLfiPezcbvLbv9yKpgp+4VfzfOOpGuVqyC07TH7+p5v4mR/LMjru8/t/Vlxw3Cc/lOLVQzY/+i/GeOOIg64Jvv/jKX7j37fyz340yz98o8rYKuUlIBpEMmY7LYl11NypJX3pppkhl11HrTZJrT6OqhgEoYuUktaW7RSmzqKqBppmYlnTjUJu795Vj9mRI71nPaHloOWSuGNF7KEpiq+cpeV9t2ANTKLEdIovnkZNxUhs7EDPJUnvXkfNGMYeXH05inU3Jzn0dJFUTqNrXYypURfHWp0BdgOLqfplQrnyc56R1VEVHU0x0JUYppZGU41li5pdCUWodGd24PhVLk69unjFImVU7uEaM9aXxAountC1KF84RnrNNtLrdywo6CcDn8CNVNwHn/oiXmVl95uVj77pRNd69HSW0rlD+HYNd3qSRHsfbjyNVy3NMsZWi1UZlURcwTAEQSApTL99iTTTxZA//fxCKzk47PPZPynyTz6To6dbI5tWZo2KJKLg+j4UpgJq9RAp4dJln0uXFw+AkiiHQggoV0IK0wFBENGhn3vZ4rlVtNXY0EsiKVGzaVBVvNFJ7BMX3roP8Bpwx74YD9wT5xvfrvFL/yXPyNjcMxkeW/r5PP6dxUybb36nxgN3J9i0XmfHFmPWqLzd0DR46L4EWzcZ/NZ/n+ILj1RmV2SHjjr81h9Os/tmk3/86QxffrTK8Lx8INuR/Pp/LfD8LBNN8vePVfnI+5M8fH+SbEa5LqMCMwPITYxWTuIGi/vLdWtoWhzHLSOESiLRhmGmmJw8QSgDhFBRFZ2YmSNmNlGYujaV7e8WYk4cUQqQmoQRh8Lpk0jHI//4IZLbejDTWWQ5yr/RhYmGyfhXXie03dkldOj5lF45i1+6NiZXadJj064UuqmgqLDhliSnX6+siuloeSVOTXwbL7xaPKZhVETDqKgxYlqalNFKc2INTfHea6ItK0KlN7uTsjPOePXMgt/CqkX+f30Nt3/k2m9glaiN9lMfH6Tl5rsWxDpC38WZmkD6PtmNt5A/vPIIZudHAUmivQ9F1bGnJghdB6eUJ7N+B4oRw6+VliQ2XQtWVWAjCKKxUiDQtbfXD6oIiJmCdFKQzSjksgqKEhkNQxeo6tz1fR/+x18W6WzX+F//rZPP/lore3aaJBNiyfwIKeGp5+qcPufyiz/bzJf+vItPfDBJc05hXhnpa2tnMo6SShDWLaTvR0KQ7xAeuCdBEMC3n68zugoVUV2HZEKQSSvkMgqphEKpEuD7i11ybycyKYWbtxsYOnz1m9VFA8rxUw79gx7trSq3bF9Yn+bsBXcRA89xJJeHfHRNkEy8tfvImO20pzYt+VsYegSBSxC4xGI5UqkOUsnIRy2EgqJE9NVsdu27fpXSavRh1HRqr/ZTfO40zqFRvFIdTRiYbgz/WAH7lcv4hyYxAgO9rCGOVnBeGKL06nkYsoiTQoTg95cxSjoKKjElRULNLSuNXxh1aF9jkmvTOHeoysWjtVUZlAiSUAbX8H+fIHRxgxp1b5qSPcp49SwXp1/j8OjXODj8CIX6AKH0F6j+LgVDTbImt4eYllnYEs/HOnSaYKoxu1eUayrVvRoEdo3i2UNosSRmrm3exWWUYzI5RNue99K66170VA7VTGA2tZPbuo/WXe9hRkbEr1fwamUSXevw7RqBE61y3OIkWiKNkWvFKeaXLwV/FaxqpVKphtTrEl2PAqtvF5qyCu+7L8EH7k9yyw6DVEpB1wSaCl0dGmMTi2M5f/KXJYZHfT7zqQwffSjFT/xQloNHbP7qyxUefarGZH7hoPvKGzY/+M/G+Jc/meWuW+N87g86mSwE/PUjZR55rMqpc+6S8ilXovbyYapvU2zpauhq16hZIYWpa8tl0VS4aZvBJz6U4u79cTrbNWIxgapCLhOtQt/JkKlhCLINoaelVhVBCPnpAE0TNOUWDk6F6RDXW3zTMwvE66xHNgshFNbmbmWscmZJ1o/jlJAyiOq4eHX8wEVVY6iKTjLRRt0qMDZ+mGSiDUUxCJfIkn83oOYXaTK6Zwf/jNaKFZTJah0gIKFkKfrjpLUW4kqaelBCV2JktXYmnH4SWhZTSVBwh8hobfjSxQ3rtJvrAEnBHV6yjsmmXSme+btJ0k0qqSYd59Tbu7JXMqm5VZXtNLTtQjxpU6j3U7JH6c3uYl3TrZhqalnygBCC5ngfLYk1DJePX/kjWlsTxtou9PamSEVhvIB7aYSgdGP0x8oXj2HfcjeJrvULtrulPCPP/j2dd36Ytr0P0Hnnh0EoyNAnsOuULhxjPt3dmhymZefdFI6+MJsEaRcnkb6PkWnGLlxdnHU5rMoylKshFwc87r49xq17Ynzl8SpvxYW4FBQBv/izTfz4D2U5etLhkceqjI771OuRTtAf/Ebbksf5QeTLf+ZFiz07Te69I86H3pfks7/Wxr5dJr/wq/kFzCaAU2ddfvY/THLTVoPb9sR4/31J/uU/beJ99yX4Z78wcW2yIt/FSajlhOhaRC64Ftx1W5z/+p9a6ezQeOTRKo98o0qpFGA7ku/9SIqPfzD1Nrd4IYIAbDd6gaKVxWLDkowrhCGLkkTD8No111aC5ZUw1CSqsvhTSOg5OtPbFmWgA0xNR4rV1doo1dro7PbRsYML9qvXr1ZW+rsPTzpk9FacsIauxEioWYQQlL08qq6hEGlISSSK0Kj7JaQqUYQyq2ImADe0qAXThIR4oYMVVpaNWQxfsNi0O4miCAbPvv317GNb1hHU6kjbRUnEIjqvUAhrdbyhcfzQYWD6DRy/xo729zUSJJeGEAq92V2MlE8uiLkZ67pp+vT7iW9bPytrTxhSP3CS6X94Bn98ecFPRTPQYik8q4wMfKz8COOvPdEQkoyMgWrEkTJk7JXHSXSuxSsXEfMkPezCKEPf+Tsya7ejGGZUwtsPCOwa1ZELC2j306fewKtMUxu+MFvr3isVmDj4HVQjNptZfz1Y9XLj8e/U+KHvTfPAPXFu3m5y5MSN9b93tKn8xD/Kcv6Sx3/4jTwHjzizhiuVFOha+4rHF8shz7xk8dLrFo88VuWPfrOdT3woxV//Q4WXX1+cCe77cOSEy9GTLl//Vo1/8sNZfulfN/Ph9yc5ccZ9V2SzL4fjp1z+8Q8Itm40iJlixTwY0xB85P1Jdm43+Q//T54//XyJWn1GQj2Kz6y0WpdyljZ/w1CphfQ3aMb7dplcHFjozmprUenp1LCskIsr0JHfCkr2GEIotCc3LZqdKkKjM7WNyep5nGAF9eX/D8OVNhUvTyAjAcZR6xy+dKlRxJceBXeIkJCyP4kqDELpRbVSgjKB9LGDGopQccI6TlgnkAESSd4dJCRYkv3WuS6G50jOvRklWr4TiY/S8/CGxjE39qE150BVEKqKfebS7ApGEjJWOUVMS7G59T0oK2gwZcwOkkYLVTeaNAhTJ/3ArZjreyh+/XmsI1Eczdy2ltz33EdQqTP9d09GigVLINW+DkU1UFrXMDVwFOn5FM8cJPR9mtfvolYYRtVNFFXHLU0xOXqJWKa18U0qaLEUQlUJHAuvNI1dGsd3LFQ9hqob+FYVLZZCUXV8p4adHwbXiwoINhD6LsUzB5ds32qwaqPyxNM1nny2xvc8nOI3/2MLv/q7U5y/5FK3In2neEwhlRRM5gOq9dWPyPGYIGYKLDukVA4Jwmj10pRT+MynMmTSix90KinobNeYLgZUqiFuJBHFZD6itqqqQWJerEDTIjdaGMJ0MZhVAa7VQkbGfMJAkkq+c7GF68XXnqjy8z/TxGc+leHgUZvnXrGo1eSs5lY6qTBVDKjWJKrKbIypMB3MGiDTENy6y+Se2+ML4lRXYrIQkEwqbFynk4gL6paMtM8E10XdBbBtydMvWnzqe9L8659q4tBRh8FhD8+P3HGf+VSaTRt0vvVMnaMn3x7ygEDhcvEQzfG+RbNTIQTZWCetyQ0NV8e7eIZxnQjkQkFIK1wYnJ1fPCyYp4k187crrdlu8ecZkOXKCQC095ls2p1kcijyBFw8XmP4bU5+tI6ejSRLjjQC7DPKDFfI0UhCRsonyMV7lpxozEARKu3JjfOMikF85yYqzx6k9NgLs7Ri58IQimmQ2LsNvasV9/LSbiWlYTBAkGpfh5luQdUMpvoPY6SaqeWHEIqKkcyR7tzA+KkXMdOtKIqOr1lkuregxZJMDxzFSGYxU81M9R9BNePE0q149TItG/YReBZWcRzNTGCmW7GmR/CsG5usvmqj4vnwS/+lQDymcP89cb70F1289JrF6ESApkFnm0ZHm8ov/1aB516xSCUFu2826WjTiMcEt+6KIQTcfVuMej3EcSSVasi3X6gTBDA05nPgTZu9t8T4Dz/XzBtHHEwjkn/p6VY5eXaxS2r7ZoP//l/audjvcaHfo1gOSMQVdm43ee9dcV58zebQ0bmXvCmr8ks/18yGtTpHTzpMNOItPZ0aH3pfkpHxgCeeXhg4XL9WZ9eOaEXQlFVJxBW62lW+76Mphkd9bEdy5ITDwJB/XasbXY/otet6NWLxSKhT1wU7thp85lNpLDvKv3nupTqVRs7G8KjPf/69KX7p55r5k9/p4Mln6wwOe6iqoKNNpaNN5Tf/+zTPvWxh2ZI3jjj8wMdC/vVPNdHdqVGtSjrbVe64NYbvQ20FSudTz9X52Z/M8eOfztKcVRmd8EnEFU6fd/nK49VZw9LdqXHrLpN4TBCPK2QzCjEzokhv32Jg2yGnz3mcvegShvDCqxZ/9vkS//ZnmvjLP+jgmRfrVOuSbZsMPvBAgnMXPX7j96euKb51PdBUg4ozSb7eT2dq66JBRFdjtKc2MVm7sCQT7P9PEKqgY2cbrdtaGhugOlZj6NURfOvaVxvVos/Zg1VG+6Nvsl5+ByTZZz7KK/+7BJygymT1/JITjTkIsvFuaLB3haqiJOO4A6ML81SkxDp+gfR796Gk4is20XdqKFpkXPRYCrdWJHAdAtdqyNiDNT3WqEcfQ9EMjHQzwfQYbq2IZ5VRVB1F0QjDAEXRUDUDPZFG0U3CwKOWH0RRdQLXRk9kqIzd+IqY1xVtP3fR41/8+wk++nCSjz6U4oF746RTCpYlGZ0IeO7lOsMNocWuDo3/62ebuXWXiWEIYo0Vw/d/T4qPPpTE8ySFqZD9D1+mbklcF/7Nr+T5Fz+R48F743ziQykKUwHffqHOL/76NB97OMV77lz4cPqHfF563eL970nwgQcTJBMKti25OODxp58v8bm/KTNVnBswK7WQlw9YbN6g84++N01TVkVKGJv0eeFViy88UuGNwwtnxg+9N8Ev/5tmDD2KYSTigo3rdH7l51uiREJP8iu/XeBzf1teegCUK89z00mFf/qZLB/7QBJDj1ZrpgH33BZn7y0mnhfFFR76gSFON8qCej584ZEyg8Men/5EmvfcEaetNYnnwei4z7efq8/ScKWErz5eRdciZYCf/5kmIIor/fkXSoyNB/zhb7Yv28Y3jtj8wn/K85M/nOEnfziLpkWrlz//qxKKmAsA3rkvxn/7jTYMQ2DogmRCIFH4hX/eNNtPf/g/i/zXP/Zw3KiezB99rsjlYZ8f+3SGn/6xHPGY4PKQzxf/vsJfPVLm1BITiZVwNQbPfGiKiRfUmaxdoCWxFl2NLYoDtCTWkTE7yNeXzxT//wUk2EWb0mAZIaBjdwfJ9iRDr66ORjt83kJKcO13b2Jo0R7B9itoirnsaiWuZ2ZzlKJaTxLpLl62h1ULoamRwOMyqE30E3guqhEj9Bzc6hSB7yBDn9Lw6YhUYFWQMsR3agSuRS0/iFAUPKtC4FmAIAw8PKuComqEgYtbKxIGHqHvUho6he/WEUIht+ZmKqPnUM0EQlGvK3N+OQh5jV/gUh2rqRHtV9fFbNZ3EILrShw3CqSqSlRsSlvBfIWS2ZyTGcRiAtOIClqFYZSX4Lhy9npXFn0yzcb+KnNtCcC2I3eYUDXUWCKqgxGGKH4dQ/XRtAbtWEbXcVyJ7SwOAsdigmR85YBCrS6XjGuYhiCRiBSJryQLzECIyD01o6+lG4KmZoWpfIjvz/h8iVyCweJjY437V5RovzCI7mXmOcy/j74+lUpZ4jgS35PUG+6/dCoqCjaTnFsqLmxrJiPIZBSsukSGc89l/j2bhiCVXLmfLHthPyQ7k6S7UoSlOv50HaFAEAqsWoAXRnXvZSjR4hrprhRMlQll9A4EvpxVuZZBSLpJJx5XKIw7+I3Jcy7ey229n14yF6HmFnmh/8/QlRi7uz9Gc3zNku/6ZO0Cb458ZcVEO72nDXNtB/bZwegF1FT8fImZoKBA4ZbOD79t0veqMNjf+wOrlr6/HsRyJvt/Zi8nvnyaqXPTqEZU70goArfq4tV9VENFNVVUXUHRFeyiE5W2SOjoST3K7i45hN7SxqUjtXVF6fuSPcobQ19elKdiKklAogkTJ6zNuvdkQ9xzppCXKqJBacaVJ1BmA+8Chb3dn6Q1uWFZo1Jzpzg4/Ah1bxq1OUPPb/1Lin//NNaJhaUo9PZmWn/qk0z/7ZPY5y7P/SAl3tD1Peu3CjPTSizTTn1qGK9+7Znz12IuVr1SEapGevPNiHlsmZlXQvou5XPHFiwtgxBKldXPSGxbYi9R8XDGDXQlHEcuKyMvFJXcTbeSvWk/yBC/XqVw4Fmqo1HVt7fSnqWgKHDLHp0167QFIrW2JXntJYdSafF5pIyUiWfkSHbu1vnPv5vj535qmksXVp5FSLl8v1yJrh6VP/hfzfzSvyly6MDCFUCxFBJPCP7Fv80QBPC7v1FiJsdKUeHhj8TZul3nv/1OmUp56WvNGLLVoG1nO37dJ7WpmYFnBkj3ZQjKNkiL5p4MCJg+N0WyPYmRMSmMKGTWZWnPmEwemyDVlcJImxRO5UltbsfIGIQTA1y1TCigqyYAXmgxVDpKU7wHscRn0ZJYRy7Ww5R1edFvMxC6Rmi5JPZuRfoBajZF+dsHCCv/Z7nNFE1hx6e2MX5sgqlz0yBg84c3kulNo+gKgRNy+HNHabuplU0f2EB1rEasyeTM185Tm6hx0/dvx0gbICWFs1Ocf+LSsoblepBUs8TUJAk1x6QzgESiC4OSP0lczWCIGEV/nGa9G0WoTDoDxNU0ujAp+/mIYEBIzZuilfUspzKtCDVyjzW+ETUZX1GhuPUnP77g39Lz6f/xX+WGU2ivAU45j1NevRLCteA6jIpKau0WFN1ATaRJdK2hNnSR0LEIbIvK+ROL9JC+21DMGNnte6n1n6F0+k0Q4FffPiVlTYfv+8EE+24zOXF0jkFWLkmOH/Uold5d/XMtkCEceNXl3BkPe5nV1luBUAWTxyfR4xrp7jSDF6Zp2tSEb/lk1mSpjdWwpi06bu3CmrZp392JZqrUJ+uk+zIUz08T+iG+4xNMBYT+tX2oilBRUAgJmKydp+LkycYWy+MIFNbk9lK0R5Yt4uQXSkjPxx2ebGQJK4S1t78m+DuN7v2dmFmDo3/VD4CZNbn5B7cz+uY4oRvSc3sXl54eAMBIGxz/vTfw6hFrrPvWToyUzuv//SBG2mD/T+9m/Mgkpcs37nsMpI8uokJpcTWDqcRRhIYnXZr0LlShUQ2mCKSPJ53I6Cgmaa2FWlCcXY06fhXZoEsvBYFAaax2wppF/s+/sqp2RpTjuW8pnesDoVCZHqCpYxt2rYBVvX5KeiLdgaLoVEtDV9/5BmLVRiV0Hcae+XqUGNW7AePBTzL58rdwpiYaCUXRAxFqRA2SQYCi6RFnOgyR84ooCVWL/IwNf9VMZb/oRwVF0wgDPzpezBw/r44DgKJErAlFzCY0zUoYNM6hxpOo8STO9CR+vRpVEfTmxUyEaLRRgVASBt4CmZUl7yUIrioL/eYbLr/5q6VZoxKGYNUjdlYiKXAdiWk2CnU1BCcdRy5gUylKJOIoFAh8sK4Y0BUFzFiUGDqTz+FfMebFYgJNj35XlvAkaFp0DiFAW0IpQdejcxTyAeOjLDq/2XCXSRklNEoZuUDn18sSotFObSEt2XEkoRcydaZAfbJOoiNJbaKGW3aw8nVad7Shp3TcijPrBnPLDn7NRQYaVqFOdl2Ojr2d1L91Ed/yad7aQv5EnsC+evBYIFAVgzC08EOXgemD7Oz84AL+/wxy8W6a433LxlbCSv3/uFXJlUh1JVl7bx8nvnwa324IlZoqXs3j+F+fIvACjv/NKeoFi45b2qiN1XBr7uwnqyd0fMsncIPZ/2qxt1bZ8UpIQlShUQkK+KGLJjRCGWAHVXzNBky80CFQPFJaMxU/j0BBF7HI1TbDZrtawqoQs7Rj6XhUnnnjLbU7lmxBNIxKKtNNGHjY9em5MVVRkaGPULSGqKkgDHykDFFUreHYEwSBixACz6nOc1eJBrssQhi4jW3RcZHL/Iqx9TpxXYH6mQzM0Iu0fwLXWVTCtXn33cS7+qhcOElm2x70VAYnP8bod75C6Nqo8QTtd31gtu64DAJKp99k+thrSM8l2beBtjsfonz+OOkN21FjcULPZfKVp6gNnANAaDpNO28nvXEHSiweVYocHWTytW8T1KuYLR00772HWFs3Rq6F9rsfpmXfe3AKY4w983VCx0JoOtlte8hs240WTxK6DuWzRykef322imDL/vdiNrVRu3yezNZdaMkM1thlxp97lNBdnurqupJKeXF8pqtH5U8/38zXHrH40MfivPCMTeDDex40ef5phz/9g4jWGQbw0Ifi7Nqr09qmUsgH/LffqXDyWGR1NA3e/8E4H/1knNY2BduSPPe0zSNfrM+62HbcrPMzP5ems0clPxlw+A13QT5KLCb4wR9N8vCHY0jgzEmP9g6VywNzq6nb7zb5kZ9Isn6jxuGDLr/xyyWK03M39W/+rwytbSoT4wG37DFQVHjzgMv//OMqhXxknHfu1vnRf5IimxO0tqn0rdW4dN7jc39W4xtfHZg9V220Sm00yj4uXy5THqpAKFFNlcyaLPWJGva0zfnHoncACZef6Z9NFp46U2D63NTCGixXgabos375Qv0SRWuEpkTvgn2EEJhqis70Nor28NUHnLeIbG+SXG+yoXQs8e2A/IUyZlon15NESkl9yqVwqfyOMZ0VTWHd/WsRmiDdnSLZnsCtehQvlSicmaZ7fyfF/hJ6Qqc2ERnXK9/9wrkpeu/oZu29fWhxjcAJo2f8VtumAIog9CVlP0/Zn3PtTHlzRIJhe06HzU8UmAqnCGyfaW+MojfWiLtcIySEV1GhFnFztuz0lQjr9kLXl1CIJVtJN63BiGVRtRjd6+5iauI0oe/S3reX0f5X6dt8P2Hgk2ley8ill6lXxuhcewdCCJKZbs4e+TJa49jydD/jg2+QSHewduv7qVcmMBM5Lp18nFi8iZaum1E1AzOW5fyxr+Dab33F+PZprQiIdfTilqYoHHiG0HNQjNisQZJ+QH34EqUzhwkdm+TaLeRu2k9t4NxsxUUtnSW5ZjOTr32H0HVo3nUnrbc/iDU+RGhb6OksTbfcTuHQi1ijA6jxJELVZldD7vQkky9/Cz2VpfuDP0jhwLPUBs4ig2C2HcnejeR23kbx6GvYE8PEOntp3nUXbnmK6oWTs7cT71qDV54m/9p3CH0PRdNXNCgAO3cb/NwvzpUtLeRDPv8XUbKRYUYj+yN/U+czP5Hk639f50tfqPP9/yjB5/8iGlQVFbZu1/jzP6oSBPCP/nGCf/ULaf7tP5+mWpFsv1nnR34yydceqXP4oMf6jSo//GNJ8pMhj/6DRTan8OM/ncLzJP/5PxbRdcGnP5NckI+yZ7/BJ38gzl//ZY2jhzx27dW5+z3mAqPyygsOJ455/MhPJOlds/gD0XTYvc/gi5+v8Ru/XGLtOpUf/2cpjr5p8K1v2CSSgh/+8SSTEwG/+xtVsjmFX/+dJp541OKJR6+Sn9AwDkIRhH7I2BuN7PUrv/15/16NQQFQlbkZnBtYjFZPk4l1LNgOkWFpSawlbbYzbb29LoVkS4z2LTm2f2gNQwcnmTxfojRaZ8eH1pBqi1G4WKFoVJnqr6yK7bY6zNXzmPlnaaCEogpy6yONOytvURooceh/HaV7XydNG3LU8xYylJSHKlx+cXDBs6mN1Tn91XO0bW8h8EOO/vUJvPpbT37MdRiYcZXRi9H7lMxqBH6INy++JwDNiArm1SsBHeviBIHk8slI8+vKXlQVg5UgCedcoYrA3NSH0HXsM/2zZYKzH7wLvbdjyeMr33kd+8TFee0TGGaaeKoN3UjMNXr2v1HJYVWLUSv3RzXsi5fR9CjTvl6ZxHPrOPUpHGBq8gyaZs4e73sWA2eepG/zA8TiTQ2GmIdVy2NV8zfEoMDbaVSIisdMH3kFr7xYijn0HEqnD0e+kGjVRnbHXlRzjhcuFIXpIy9TvxxxqUtGjM4HP46eyuLYFlJKhBaxurzyNE5+nPlvsAz82diJDAN8q4pXKS5oR2bbLtypScpnjxAGPl6tTGr9NtLrt1O9eGquMpuqMX301UXHr3j/Ys4dBCxgwPkevPGag2VJfuhHEzzzpI2iCH7wR+fEMhUF/uHv6hx8PTKSQsBv/n6OLdt0Dh1wefjDcQr5kMe+YmHbkpFhn1vvMLn7vhhPPGqxZp3K1u0av/zvShw+GK1uUhnBzbvmBssHHjIZHAj4+iMW9bpkfCzgznvNBfcRBFAuhVQryw9e/Zd8vv73dSbHQ4Yu+9z3YIyNmzUUBVIpQWuryvNP24wOh4yNhOQnAlJp5ZrzT3zLpzxwffUdVoZYMHhIQqbq/VTdm8iYnYuYPzEtQ0dqKyV79KqS628FI0cKjBwp0LE9x4nHBhg/VYyunzU49cQgI0cbq7Ebak8EhpogCF1URSdhNOP4FRSh4QZ1PM9i8KVhBl8aXnSkW/U4/82LC7ZVR2tURxcqEchQUjgzReHMFDcS8bRGKqMyegnaekx6tyZo6jA4d7CCUAQtXQYjFyy6NsRpX2Py4lcm8dwQVRfzJbEWwFSTLBekBwhlgBdEk1MlZpL9yL1Iy8XtHyH0I+MW274ec2Mv/uS8MVBR0HJppO1in5yX0S8DylOXmBg6hBnLggxnBUoFBrqRBAmB72DXpygVLuI51aiGj2dTLY/gjp9qXETM/g8ESPDcGiCRoQ+KQhgG+J5FtTiIY924b+ttNSqBYy9pUADURJrcTftIdK9DjcVRzDhmU9siHRAnP69OvGNHvkQ1arZfLjLx0rdo3nMP2e17qJw7Tun0m7jF/IrJTXMQmK2dGNkW4t1rG5sEQlFmXWyz17brqzIoAMcOu/zX/6e8ZL6VlJJaVdKQB6JSlqTSgIT57vyhobmB63K/j6oJWtujHTZv1bhlj8EXv9o6czuoquDY4Yg3n84oqJpgYp6C8dDAQvHJ3j6NyclIKBSimE1+cvVslOJ0OOvq8v2ILRdPRB9sPh9y+JDLp34oiedCa7tKU7PC808vXOnNxNhm3KrLQaga8jpqZy+HGWrpDKpugYnqOVJG26LfhBD0ZG5msPgmNe/GDozXAqfisf9Ht0YVNV8c49hXLhEGN8ayNCV6EQhy8R5K9hiq0LC9MulYOyAZr5y9plrt3y3E0yqpnEa23aBzfRy7HlAueGzck6ZjbYzhc3W6N8cJA4mmKxgxBTOhoiiCYNHqVpAwcstql0kpCaSP40dGU+ga5sZeSt94kdBaGAqwz15m/Hf/au7MikLzDz5M7KYNc/kPgO/WZz9+16ng2hXCMOD/be+/wyTLz/pu+HNy5eqqznlyTrszm4M2SKvVKkcECDAv4AcHcMbmtfFjbOC1sbGNjQk2iAdkQAihvNJKG7V5J+fU09M5VY6nTj7PH6ene3q6e6a7Z2YlXs/3uuaarqqT6tT5/e77d4fvt6PvXlzHQq/OIKthRFGitWsPshIhM34E17UJRVN0hA4gSRojF79HLNlNqm0LgiBimTWMRmHOcFhmDd+1UUMJIvE2wtGgmXV04EVs8+aJL2+rUeE6DTXpux8m1r+F3NvPY2SmUBJJOt/3qcWHWJAMv4ZSwXOpnD9OffQSsf4tJLbuI9zVz9T3/mrFBsCzLWpD58kdfmXB4T3TWDCxraU5yJvtlVluflyJ3QuF5h/qUDiIr1+Juum6z/EjFr/9mwt1KOp1D8tkrr/l6p4rLbRwkBhGwDp95dkWxSAxb60yZeC6/hI/d3Au14GXnzd4+DGNuw6olIoev/XrFY4dvqpoQ5SIdPQjSBL69GhQbiZKeJaJpIVQ4inMwgwIAlqiGaOUQRAlQi2dmPmZQIXRsYNkpu+t0KkIrlC8JswFMFk9R3diN2GladFqRRY1+pru5lz2hdXcoluCt/5n4InGOyI8/X/v59Irk9Rzt6bCzLCryKJKrn4ZyzUIywkEQUS3iyvSG/lBola0ae3RaO8LMX25gSQJuK5HOW9TnLbIT5iUsjbn36kQiog0ag6epyErArIiBP1OVyEkxwnJ8etKHRt2ZV6sSxQQVSUo1LjKQFmjM8Ek4MwPDh8Xt1JHjEUWLISK2fl8z8zoobm/S1e9H0v2YNsN6uVxwtFAJjgUSVGvzGA2isSS3QiiRH76DPnphbLGenUGgMz4EURRJpbspl6exLZqhGPtgWTDLcDtNSrXQbijl8bMGNXZvIXa3IYcTdxgr6Xh6jXK545iV4p0PvVppEhshUbFRx8fItzZi6vXcdYon3k7cdd+ZS4xf/c9KrYFI8OBl374HYsPfjSMXvcW5ECuIJ/zqFU8du9TGR0OluN77lIX0MKfP2Pz4KMa7R0S01MuySaRdetlzpy+tSR/B+5TyU57/NffrGAskUYRRIlQuh1BkmlkJ4n3bUEQJepTQ4iySqxrA3algA9o6TbMSh5JC5Po30a+WkJrasOq5FHjTegzYytfyQjCkhNmwy4xVTvPhtT9S+7WFtvEWPkYNWt55tnbieq0jud6SMraOOrkqErH0zsJtyfwHJfikVEKR0cXOFaGHYyHxiq43Zof3IAxVaY+9O7el3LW5vhL81GRC4fm8wNDp+a978sn5v8eOrm8V57Q2tDk+LKfg0/ZmGenxvPxDBMpGQs6vmcT8OVvvbbYwZHEgLJlDbmwenU6iKYAZqNCo5ZBlFRC0TT4kK2fwKgHK+jlZMgBPM+hkLmAFk6Cz6xR+huQU7ke9PFBEpv3kL7rYRAE4pt2XbMquTEifZtJ77kfY2Ycz7EId6/HrpVxGytnlC2dOkiks4/O930SfXQQRJFwezf5I6/RmBq58QGug207FH7278bmEql63ee7z67cq6zXfT7yqQipZgnP83nqmTAvPGcwfDmYMJ/9ms6Dj6j8q19L8vYbAZvzlq0K3/5GgzdfNRkadHj1JZOf/wcx+volRElg1x5lQYTxW19t8NQzIf75v05w7LDF5u0Kre0SzBoySYbePpnObokNm2Ta2iXueUBjYtRh+LI7Fza7HmQZJsZdPvM5mb96thXPg3rV54XvNviLP9HnyqSdRg2jMIPv2IiyilGYQVI0bL2GrVdxbQtRVhBkBVFWcI06TkPHNXSM/CRNW+/GrpVWHRoThaWHwVjpGN2J3YTkhZIAgiCgyTG6E7u5mHv1XQ0Jde1tpjKt07w+TqNkoRfXRrQpqDKSpjD9/Dk816P9sS1UB7P4joeoSPiuh10Lji1HNQRZxLddnJqJoEjIURV8cHQL33aRY8E2sXXNeLrF32ROZ0lQaI6sm82pLA0fj1x9vrTcMy2Mc8PE3nM3xrkhzOEpcF3c4jUTtSQS2tJHeNdGjPPDKzYs0YTEve9NMnCijmVOYxk+nuuT7hCxDAMtPI1je/iGT2u3jO/D+h0RBo7XKeWWHg+WUcYybr0jfVNGxa1XqV46vaicGMDMz1C9fG6JvQIUjr6BZ1mE2rpwDZ3M698h1NaF0wi8B6depTpwGv+qpgjX0KkOnsU1gnJFq5jFyE+jpgM6fDMzSWXg5KI8jmfb1C6fw6kuvoF2pcDkd79EYssetJZOfNdBnxzGKs97WmZu+rq8PdfCc+HEURtFEdi0Zf4WVyo+mmai6z6vvGBSrXpEUiGOnZWQYiGIipy8JOO4AqWix9e/3ODoIZOnngnT3iHxpT/T+esv1udkEUpFn3/9S2Xe90yIbTsUPA8unre5fCkgtXRs+KPfrzE9FZT6ZmZc/v2vlvnEZyIU8sFBJidc/tU/LfPMR8Js2Czz+isGr75ooGkCvhf0yLz36RCbtwbfY3rS5b3vD1Eue3zxT3UuX3I4fcImdBWFjeP4nDxmYxoBncu+Ayqf+tEIv//bVYYGnYA3qlPi7/2jOCNDLi9+18D3PTzbItTcgWvUMUtZHL2C73l4joXvuUhaODAqooQcimJaBrZeRYklscp5RFnByF7lPa4Qy1Gcm06difJJNqTvX9S3IgoSzZH1xLRzVM2ZVZ9zpZg4nscoz4cJm9fH2f6BXoyKxcE/vjDXK7IWSGGF2MZWBFnEqZm4DZvWhzcR7kqipqOMfvEwgijQ++m7scsN9LEime8P0PrwRiI9TYiKTPVihuLxMdb/1P1YRZ34lnYq5+fvhySHiMY7cOxAXdBzA9VMLdSE4xjYVp1QuAnb0vE8G1FUsMzb15i8EiRDnbTFNl839FUz8wvodHzDovrSIZp/5qO0/cJnqbx0MEjY1xv4jhesTiJhtP4OYk/cE+jVfPetRSzJy0EQwLF90h0qu+6PzRmLux9PkB23UFSBwVM6qTaFrXdHKeUCtnXLCFM/WFtQBXe7sSbur2gkqGhajsfqDlaOdQ+0k+iK0ihZ1PMGWkyhMFShPPE32debhyDAj/xEhPse1PiVf1aaqyCLxgT+9MvN/Okf1vn6l2+e9lxJpFHjKeoTg4s+ux73l+e7nJn5LhOVU0seNxnqYk/HB4mq6cX7eg4D+dcZLh5a0Wrlh4n7S0lF6PvU3RjTFVzLQYmHmHn5Ak27upEiCi0PbGDoT97GKtZpf2IrCCKFQ8NYpQYbf+ZBzFwNQZZwGxbl05O0PLCBS3/wGut/6gFKJ8cpHhsDoLVrH65joKhRwpFWbKtGtTxBS/tObFunkDlHNNGJJKl4rk25OIyhBw7dWrm/bgaqFGZv50dojqxbdhvf9zmffYmR0hEWxAtlifCODSQ/+DCh7evw6gZuTcd3XAQ5YDGWYmGM88OUv/MmjVOXFuRargdZEYjERVRNJNkik5+2EYDmLpWejSHqZYfTb9do6VJp6VJwHZ/shEW96lErOddLb68Kt4X7qykp8rd+LEal6vHG2yYXLt0e8aRlIYCkyfiutyq+IEEUkDQJz/XxrB8empRGyaJ5UxKzZhNuUgklVDLnfniu72bh+zA57tLTJ/OpH40wcMEhlRZ57MkQjQYcP3JrmgidegW7VlrTvvOrkKs902DwVM0MufowEaVp8WpFlOlM7GCqehbDufkGvncbTt2kdGYSt2HT+fQO4pvbSe7uYuLrJ0ju6gJRwC4bZF4ZQGkK0/9j93Lhv76IXTUoHh/DKuq4uoUUVpGjGlJIQQorCyo4I9E2Ri+9QLptB5KkUNELxJPdgI9ey5BIraOh51C1OJqWwNDf/Yq6K9CkKNva3ks63LfsNr7vB1IJ9cssqkN2XBqnLmEOT6L1daBtXYfSlkLQVDzDxMmWMM4PYY3N4NX0Fa9SIFilVAou4JKbmp9zi1mHiUED1/GxDJ+xAYPJoSBydAsLJFeFVRuVkCYwNe3S1SEhLy6amYMa14h0xlCiGuDjNBz0mRpmqbHot1gNYl0J7v1Xj1M4n+HE/3gnWFquAE1bWrj3Xz5G9sQ0R//Ta2u/gFlI4RhKNIHTqOE26sixJG6jvpD+ZQWYOVdk5txsuE6Apt4Y9groRf4m4c1XTRy7wlMfDHHgfg3T8Ll43uE//XqF6albY0BvrsRYQFRCaIlmJC2C77mYlRyOXsHzHaZr52iLbSQkJxaFROJqK+2xrYyUbo6i492Gb7v4rk/PR/bg2R7F42OUToyR2NpG22NbsHI17HIDrTVGz8f24vuQfW0AV7eY/t452t6zBVGVKBwdpXhsjMrFGfp//F4c3cQuz68czEaBWLIHSVLwPAe9Ok0y1Q+CSL0ySbzvHlzXRBAkLKtKONpCo/7uSjDLokYq3MP61H2kwt1crzfF9W0mKifR7dLSG/g+XqVO4/QgjdOLV823Cq3tIhu3KPg+1Kse46Mu1iyh7PWGQmu7iG35CxgxbjVWbVSmMy6nzloMDgsMjyxx9QKktray8WPbab27i3BzFHwfq2oy9dYoZz5/BCO3dn4kQRaRQhKSKi/Xs3Sdnbne87Lyw4gSiY07cc0G0d5NlAdOkN77EOULxzAyN9Fp7UNp9ObrxH/Y4Djw5msmb752e9Qbbw185FAULdmKazWCxlk9iO2XjCkKjTG64jsX7SUIAr3JfUxWztzSMMzthlMzGf3LxYZw6E/eXvTepd9f6ITVh/MMDb+14L3Jby0dPszNnCWZWkdDz9PQ89hWjez0KRQ1im3XyU6eRA0lqFcm8X0/aPB7VyAQUZIkQ100R9bRGt2AJl//3L7vkddHmK5d+IH26wgCPPhoiE9/LsqpYxbRmEC14vOFP6wxPbm8kyaK8NQHw4yPOnz/hds3FldtVFrSIpGwwJ4dKobhc/rcwvBXrDvB3f/kIWK9SS5/9RzTB8cQJJHmXW1E2mLYtZsLd9QnK7zzb1/GrlsrZqK95RBFpHCM4pmDtN3/VEAPIwgosQRGTlxARnk1Nq1/mmSi9zoH9oMuV9fEsmrojTyV6hiV6sSKmJ81Lcmm9U8R0prW9LVMs8Lp819iKVPd1rKL3u4Hlr5q38N1LWyngd7IUamOU66M4brXf3AVJcr6vseIx5bPAawGI+Ovk8svXxxyPXi2SX1mCDkcRxClBRKrvu8yWjxKR3wb0hJDJqI20Rnfxmj52Jqv/f9f4dg6+czZBe9dzZpbr05Rr84XV9jWapwqAUEQEFi+rFoQpICiXgyhyRHCSpKo0kwi1E5YSaLJMRQxdN2kPARhL8Opcin/Gqbzw+H4HTtk8Ye/UyGeEPnpvxPnmY+F+fM/rvPAIxpPfTBMLC5y9KDJV75Yp6H7/Mtfa2L/bKTgcz/jcegtk//536r0b5D58Z+O0tUjk8+6/PHv1+YqTNeCVRsVRRHYtkWd04G/erUgiAI7/j/7ifc1ceJ33mbkuYtzeY/s0cmA3XfWEEghmVhPgsYsI+3ViHTEEBUJfaY2l//QUmFC6fDKVhoChJsjKPFZrYyahbCc/roAWjKEmggFWhCWi1kygnLK5ZZBvo9nm6jJFnzfJ9a7CaucJ9wxKwNgLV02HI220ZRct+xlL0yC+bOvfRqNAmOTb5PJnca2l0/gS6JCPNZNNNK67DbXg64v31ugqgmSif4lB9/i6/YwzQqTM0eYmjmKuUw1jyhIRCPt170nK4Xv+2jqzYlPea5LozCJ77o415SlV8wZMtWLSybZBUS6krvI1C/dstxKU6uMJIs4tkeqTWFi0MBeRi/oBwJJRNQCTRTPsgFh3pkSA1oQxICdQlAkvMasM7mMw7UWJLR23rP+51e49WxvvDBPXXIjQ3IFvu/TsMucznwHKV6ku1vDdXwKGXsu5LRWROIinguGvvr74nk+hgHlkstbrxp8+JMRvvSFOtOTLn/6v2pUKx4//w8TPPa+MF//K53//Btl/s4/TnDiiMXL3zVwZ5kYGrrHS981GBq0eeqZMH//nyX4p39n7bmtVRuVqRmXd46Y1OseemMhCVuoNUrXQ/3kTk4z9dbogkS67/kLElOpLS088fsf5dBvfJ+hb52fP4gosPfv3U+0O8HBf/cylaEg39BxXw8bP7YDLRUm0h5j+LmLHPtPry9erQjQ+WAfW390L4n1KVzToT5ZJXdiasmHqOO+XjZ8bDupLS2IioRnueROTjPwpVMUzi0d2/Vdh/rYJeIbd+LoNZxqierQWSLdG1bceR9494uLHOa4fgRxLt8ZjbaxZeMHSSb6GLj87esalncDvu/juld1wwsC4iwddzBYRcLhNBv630tTch2DQ9+jWlud5OwPAkokTqJ3GwCV0fMYxXkP2sdjrHKCluh6FGmhnLUgCESVZlqjGxkrn+BWEHL1bAqz5e4YoiRw4UiNddtFBo7/8FQEauu6kFpSONliQN+nqXhGQK/jNww820FOJUCWkFvTODN5BFXBGpm8ZfIAgiAgCddJ7N4C+L5HxcwwkHuNqj3Ohz/RTFuvSm7KRq96PP+X+bWX6wrQ3qNi6B5TIzcXwalVfSJREd+HYsFj5x6FZJOCrEC6JVjJmWaQb7GthYKDlZKHIARs5OGISN866bqNkzfCqo1Kuknkofs18gWPE6dMSle1fqS3tSDKIuXLBYz8rdWVmHpjlOL5LPF1Kfb+3fuW3S61pYVdP3cPoiJy4r+/RSOnE+9NsvETO4h0LGxia9rSwt5feIBGps7J330Hs2QQ702y+dO7uOsfP8Rr//Q5rPLSqw4zP41dK6Ol22lMB02S+sTlJbddCoZR4sKlbyyafgRBDMj8wi2kUhtoSvQjiBKiKNHRtodGI8/Q6Es3PL7ve2Tz55meuXFIRpYFwlGBatlkZROiz4VL38CaNW6BUVHQ1DjJRB8t6a1IUqDtnWrawLrexxi4/CyGubBPyHZ0Lo+8yPjk4jg+gKYl6O95hFCoCYCZ7CkyuTPLGu5qffU9KlfDNRs4ehUpFMW1F//uVSNLTh+mI7ZtCeoWldboRjK1S5juzYdHpkdMogkZQYBEWiYz9sOVj5JbUri6gZSIISWjCGogD+w7Lo3jF5Db0oiREIIc5D6lZBypKYZXrWP9DdCcubL6zunDXMq9RsXMICk+es3jrefKXDim89l/0EHPJg0tJLL3oTh6zeWd75VZvyNMW7eKIEIkJvHGt0v4Ptz7viShsMjx16qcPVxn+/4oex6IceilYCXfvzXE/scSKKpArezw7J+unJUgGhNoNHwSSZGf+XsxxkdchgYd9Jq/gEFjKXz2b8Xo6pZ46zUTTXMDZ3bVCet5rNqoqKpAqeRx6IhJubJwlRBpj+M5Ho2sPrf87X9qE3v+7n2AgGe7nP2TYwx9Y/Vxb6tqBkJNPrjm0pOKIAp0PbKOeF8T7/ybF5l4bTigLjg+hSCL7PuFBxZsu/Wze5BUiRP//U3KQ8Vg26OTSJrEjp/eT+8TGxj86tklzwXgmY3AoKzBpDuuSb44sOzngiAyNvkWbS072bLpw8iSCgh0tO1lauYohlm67vF930dv5MiXznLfI2FOHDYwGz6qFujYNxo+qiogyRASRdb1q+SPmyiqcEPPy/d9iuUhzGuMBAhMTR8lFutk84anScR7gybB9BbyxYtMTi+s6/c8h3JledaCSLiF7s57517repZs7ux8fumqB1+QBPybJFb0XJvyyBkESca1Fifdba/BTPUi6XA/mhxZ8NkVWvxkqJNMffnfdaVXWCk4jF5sIIpQmLEw6rc4fyiKiOEQnnGVpocsIUbCeJXAKKr93cQePUDhC19ftHv9yLmARVcU0bb0I4Q0zAvD+JaFbzm4tcBwXDG+vu8H2jCz5xJjEdKf+yhKVxuV775G/Y2jt/b7rREBBb6H4VQZKx1jrHwSx7viYMw7EmbDIzthsnl3hI5+je/8WY6ejSH2PRInmZbJTds0dyhMjVjsvj/GK18r8ua3S8SSEu/7TDNnD9e5fEZn3fYQqdZgGk63y6RaZb70OzP85C910tqlkJ1cvmVDEALRu1iryL0Papw7ZRGLC/T0yvzx79Uo5j0efM8847jvg+sEwoCiOM/19+TTYX7nP5Y5/LbFe94bWvZ8K8WqjUq15qEqAs88FeaV1w0uD88ndERFnPNWrnwLfbrG1BujRDpitOzpQA7dPmYYJaYS70viOS4zh8bnRrDveFQGF66ewm1REhtT+J5PYkOaxIb55rZwS1AFktq2gtzEbdKyCMJjJtOZ48RjnfR2Pxg8REqYeKzrhkblCuJJkceeieK6cPmixfY9Gv2bFA691mD3/hCm6XPmqEE0JnLXfSHGhh0Gz691Ke7jehblyghDIy+zbcvHCGlJJEmhObWZmeypJZP3WkggGhdJNUvkMg7lwsom0HBzmGh7DKtmoTVpVMcqGIW1kysqkSSRtn7CqXbKo2dp5BZX8uX1EcrGJK3RjYtWK5Ko0J/aT14fxvWXmwxW9rz0bgmxfmeUmRGDmVHzlj9mcjpJ06efpvLc61hDQaNieOdmEu9/hJnf+iNwPbyGgTU+vfQBZpkufNfDOLNE6ezsHLAw2zYPr6aT+8Mv0fTRJ4NVzg8Y/uyzW7eK5OtDTFTPUL8Or1s4JtLRp3H2cJ1my6NWcqkWHXo2akiyQClro6gClaJDS1eYvQ/F6dsSwrZ8YskgvGSZ/oI8mevAzJhFteRSr3pokesvMbZsl/nsT0Xp6ZWRFfjTP9QxDZ9azeN9z4QxGj7rN8rMzJbtW5bPxfM29z0cEGmODDkcP2xx+rjFY+8L09kts2O3ctMVsquXE/bBtHz0JejR7ZoVaAVEZh+S2VVC9vgUXQ/107x7sfb3rYSkycgRFats4l7TGOkYDs5VzHhaMoSsyYRbIuz+2/csOpZZMnD0d7mxcwn4vkeheImergeCMJMgo6qxG+84i3LBY2rM4fCbDVraJFzHZ2bSobVD5sIZk/YuGVkVaGmTaOmQefX5W9N8VqqMoDfyaGrQ2xGNtiOK8pJGpSktsufeMG2dMkfeaFAurCzUE0qHadvbjpbUmDk2TfO2FibeXHtJt2sZ+K5DdXJgji7oWtheg6nqOZoj/UvG81PhblLhnuUlh2+gFHgFZsPDdXxCUemWlMFfC6dcxSmUUPs6sIbHwffRtm2gcfoiIBC5ZzfalnU4mYXPg9TcRPSe3UjNTbjFCvqR0ziZAomnH6H+zkncQgkhrBF7+AD1t44haAqRe/ciN8Xxajq1N47iFn54iFtdz6Fu5SkZk5SMSSrG9CxJ6NJWPBIXefhDTWw/EGV0wODEG1VSrTJP/3gzqiYycFKnf0towd6CKBBLSqghgXrFpVoKQkz3PJlg130xamWH3JS94jyG78OJIxaqGhAgD5w3OHfKIpvxkCT4/O/W2LxNoVb1+I//tjwX/vI9ePVFg0rZI5WW5hL1n/+9Kvc8oCEI8Of/T523XzdZ4WO6JFZtVFqbJUzLp1j0SMQXWtLqWBlRFom0x28qHCFqa6NgDooBvKUrvQQWdPpe0TvPn81w6NdfWfJ4K9E4fzfguCa+7yIIciD+tgxX1XKYHLN5/8dizEw6bNmtYege05ZDukVi3SaFYs5latxheNDmwScivP78zce8XddcEB5Tleiy153PuMxMOpw9ZtCor/yZqYyWiXXEKFy0iXXGyJxYG73JFXi2QXXyYqDZfZ3RPVO7yLrUAZKhzkWfCUj0pw5Q0EfxuDZM6y/x3jLnGDGpFhy0iHTL9FIWwHawLo8T2r0Z3jiKGI2gdLZSeu0wuC7GhSEEVSF6/z6qz78BgKAqxB7ej++61N8+gZQIetAQBML7d2KcvRQYFVUhvG8bjWPn8AXwylX0gRFCe7aS/MiTFP6fr9ySr+D7Hq6/sjHq+x6OZ2G5dQynRt0qULOyVM0ctm/guCaOe1VOcYkZ3nXghb8qEomJuA6U8g6OBS9/pUg0KeG5UC06XDyuY1s+Ayd0HAcundRxHZ9IQsJzfFw3KII7d6TO0Dkj6NIvukyPWgyeDsKuX/vDLLXK8s/K8GWH4WFvvppOEEAQcF2fs6fsOWbza1Ep+7z64kKnLTvj8e2vzYd7hwdvbt5btVEZHXfYtV1hXZ/Mi68ujDsXzmUwCjrp7a3E+5uoXF5aoAvAtV1830eOKgiiMCcBK6kS8d6mBauKlcLRLYxCg/ZUmFA6QiMz721qiRBqYj6+qGfqmGWDcHME13Qwi7dGk+J2QJZDCLP8R57nYlqrK1v93tfqSHIwKE4cNIIQuh/orLz+vL5i9cXVwvOc4ESBJVxyG2G2EvX8CZNwVFgdtYQf/I4+MPLSMHZ97StLUdYQFRU1nkaJJjHLWYzC0ol/z3cYKh5kT8eHluSlSoY6aI1tZKZ2cdFnK+k3iqck1JBEqk1h/c4Ir34tj3ml5FQSEaR54+xba58AzEsjxB+/HzEWQe1qwy1VcUpB0tir1HAKZRZ57IKAqKr4to1x5hK+ZXO9TLBbLGMNTyBEQjhTWcJ7t675eq9F1cxyfOprWO7yTaf+bIl7oNK5tHFObz6Aa5s0CpNBoUwoMlsqbeK5Qbm077nIWgTLdzErIKkaUtRGS4epZ0ZpXPXs2bNtEObsZZmzPppeW+j+VwruLPXKPMwGiNEIRlMnglSDTHaOzNa3bQRVBc/D9zzC27Zgz2RwCkVCG9fj1urY07eP3HSlWLUYQyQckEmWKx7Ra2J+bsNh8CtnSG5Is+Uzu4n3JYFg+XelZ+QKrLKBVTFpu6sTLRWUaIqqRO+TG4l1XU/HYHk4DYfC+Syu5bLp49uRw0F4Qk2G6Hp0HVpyPglllQ0mXx8hlA6z4aM7UOLzkrJyWKF5VzvSbcz/rBSCINKc2hIkOX0fy6pSqa4+xHNlsnavGluuy20zKAICqhLjSuzGsuqBeNY1iMREOntl7nkkzINPROnbsPL4erg5Qnp7y626YERZRZQVfMe6oQxDQR9dqKdx5TCCgCKGaIttRhYXJz1dbyVGQCAcFYMqoJIz53ABqC0J4ndvJHHvZpIP7wi0O9YIt1jBmpwhvHMzSlc79vg0vrl8Ps23bOpvHsN3HBJPPUziA48ipZNLXv8VBcPovXuIv+9BtE39KN1twQS5wv6QG8HHw3ZNHG/5f65nzerIL7/a8z0H1zKQQzGi7f2EU52IskqktTdgz+jZQijVRri1l2j7eqLt/cQ6NhBtX4eo3Hxi+1rIzWnk1hZ810NpbyOybw+hzZuQmppQWloI79oRGBbLDjxD38ezrFUxqd9OrHrWTMRFQiGBfMGjOS0yOr5wlTj8nQES69P0PrmR9M42zKKBIEC4LcgDXAkrmCWD8Zcv0/fUZh74tfdSGy+jNYWJdsXJHJtasKrQmkK07usk1BIh2pVAS4VJbW1hy4/uwa6a1CYqZI9N4TkeE98fpvOBPjZ8bAdNW1owSwbRzhiiJFGfXNiEd/kb50msT7H507toP9BNbaKCElEINUdQkyFe/UffpmH84LpnBUTaWnfT3raHYFD4TEwdXKLq6ocP4XB6rhTY931q9anZlctCmIZHrSowNGChqgK16sqDua7lIodkmrc2Y+QbN7VS8WwTx/dxrQaebdwwtm27DSYrZ0loHUjitZLDIs3hfhJaG4XG6Nz7PuCvIFxTLTrUyw6eH7DTOldV4zkVHd91cesGoXVtCJI4V1G1FjSOnSX+3oewJ2donLo4Xwm2DJxMnvJ3XkVuSZF46mHCu7dSe+0w2C7IwaQmJWIIsgSSQOzRe6g89yqNkxcIbV1PeM+2NV/r7UJl/GIgYS0ImOUs4IMPRnEG19Qpj57DcyzE4gy+61zV7C3he+6SvHPCbHXVdesyZhfw1/pa9tQMvu2g9ffi1XXkVBKzWkXt7kIMqWgbN6AfP3lNAEBYVe7tnh/bSMfOJt76/EVyg7eWDHXVRqXe8EgmRNpapbkbdvTEvHdjFhsc+y9vMP3OGH1PbiTcGsXRbXInp5l+e4yZwxMAOLrN6f91mOpoma6H+kj0p6gMFTnzR4eJ9STpfnTdXDd9uDXKume2Em6NgCBgFHREUaT3iY1AkBfJn83gOR5mscHBf/cymz+9i7b93UQ748wcGmfsxcts/vQuGldVgNlVk2O/9TqT9/XS+/gGkhtSuIZLbbzM9F+fwSzcvnp6SVSIRtsXRxdEEUUKEY2205zeSiq5DlGUsaw6E1MHmZg6tPQBr4UQ5DGikfYVXpGP3sivKDxzI8hymK6OA0TCLQiCgOOaZHPnFjRMXoFjQ63iYpkC4Yi4KESwLAQwCg0GvnoBOaJg6zfPduz7Hk39O5G1CKXhU1jV5YsWfHzy+jBlY4pUuGdRJZgmx+hK7KBsTC2oBFtJDkAQYPu9cWolh5ZujTNvV+ZKir2GRePiJPH9G7EmC/OVlmuEcWGI1Gc/iFup4kzNNvsqMnJTArklhRDSULracKt1fMsmtGtzsJpxAzp3rxHIblsT00T270ZUVaIP3gW2A56PW6qg9HTiNUwi9981t7ISo2GkVBIxHkXyfOTOVtx8KfC+32W45vw4X6oh2a6XZrdb2fHkkMTPffkJzn1vgtd+7xyuvbRlefwXd7L+gTa+9s8PURiZd16lpiRKZ3tAUmA0cIpl3EoVpbkZRAm3WkNQVaSmJqR0CqdcRU41Icai2Jkc/gq0wFN9Ubp2ptBit77ybtVGxXXhhVcadHVIjE64TM8sfqgd3WbshUHGXrgOS6cg4BkKo89OMvCl+Ya2SPcGyLRz8csN1OZdyKXTlAbyvP5Lz634Gu2axdk/PsrZP15Y+370t15ffK0Nh4lXhph4ZelqnauhxJsQFQ2zmLnpUuJIpIX79//idbfxPIdafYZafZps/hyF4sCKJ31RkOjq2E9Xx/4Vbe84JoeP/x51fS0MsUFHvapEiIRbaW3ZSUfbnllmWpds7izF8hJU4bNobpXYcVeIvg0Kh15vcO74jUevGldRoyqJ/iSRtiiZ49NURm9W3EnArORxQ40V/b66XSJbHyQZ6lhUCSYIAu2xLYyUji7QR1lJ+EsQoalVIdWuYOoezrWTkiRSfvsC3i0wpDguledew7ds3ErgsUrRCOG7tiM3N2ENTxB96G6MM5cwL40gIKBt3wiCQOPkBRonL4DvU3nuVaL37SO0czP1Q6eQomG8hkHpq88TffAuQjs3U3vtEM50sBKQO1sJ796KbzuIYY3Y/fuovXYYJ7d8HvZ2ofeJDahxlczRSapji58hKSTTfqCLaPvSVZe5UzMUB/Lzj7fnU8+bxNvCKGEZ117aUCa7A436a9U7nWwOJ1+YS8KbQ0Evlz25MNxaP3Rk7m/9xNKEnj8IrNqoNKdEHnkgREebxPffMMgUBHxZAs9HDGsgy3iVGnJnC26hMh+jlSXklhT2xAy4HoIgokaaEEQJc9YTAEhs2oPvWDRmgtr569KeiCJqUyuuXp1Tg7wVkEIRlEQKIzOx4H3fdfAE8VawcNxQ7EaYbWv1fS8wLLXJJcNHPwgIgsi2TR/F9YLBIhBoi8hyCE1LzhFa+r5PvjjA8OgrWNcpLqiUPBp1n3e+36C4jPTptXBNF0/z0HM6dt3Gqt4aXRa7XkbPjKyQbsdnunaenuTeWb2VhasVRQrTl7yLM5nvzm3vLdu/Mg/PhXe+W8T3gma1BRBAaUmgdaQwp4o0Lk3dtINzbeOhW6pQ/d4bS26rHzmNfuT0ovfdXInKs68set+r6ZS/+sLca+vS6Nz/V/7+QUJLhdn39+8l3Brl5B8c4sIXTy+S0xBlkfS2liAEnw4T607gWi7V0RJ21aKR0yldKsyNad+H0oROJK2hhGWMytK/eawlhFm1MatLfH4LOdLebazaqExOuVwednj9bRO94RG+Z89cYM8tB2pwSs8eBFHELVXxr9wczwuqRHywx6bwfQ/f94gmO2mUphZ4cPrUCNXLZ+ZeC5KMIEp4thn8LUl4toUaT9G0dR+14QuYxSyuUUcQpdntRZAkPDPoPRBVDUEKvEnPauDPZqhFNaCSwA/kigVRJNqzES3djlOr4Nkmnm0hSIHus9eoc3XZoaiGgtiq68xpqUhaOOggliQ8y8RfIunreQ51fXEJrCCISJKGLKmIokI83k0s2k5P1/1MTL3DxNShG7L/wiw/l2fhOitbs7uuteIeCkEQaGleuorH94NqG8uqMjlzlLGJN3Gc61PCm4bP2JCNbXuU8itbibmmi1EyMEpGwP92Cwy9Ek2ihGLYennJktKl0LDLTFbOsKn5oSU/b4ttZrR0lKoVrACvGOIboWdTiEc/0YIWEvnf/36MxpWwoA92phwYsJswJqIsBvftKjsozJbdy5qE3XDm3pvLDVzZ9oeI1/Jm0X5PF0pMxSg2aNvXydCzA5jFhc+rXbM494WTXPjiaZo2N3Pvv3iE6kSFd/7tK3i2h2suLKbwPJ/iWJ2WjXHUSJBnkkMSWkzGqjvYDRc1IqFFZWYulud+xmRnmLs+vZ5197WixRSKo3VOfmOUwdensRvz4yLcpPJjf/AQb/7xRSZPFXnwp7fQvTeNIAlMnizwyu+co54LqlllVWTjI+3c9an1JLsilMbrHPvr4VtWLLEUVm1UrhQYNKdFKiMu9mQwWMR4FCeTR2puwrwwjBBSERQliJEKAoIo4BkWvmnO9VrIagREmWuf0khnwHcFPtWhc4Q7+khs2En+5JskNu7CdxzKl07QtOMe4ht2oCSasWtFMm88R7hzHU3b78bRa8iROMUz72BkJ0luu5tQSzeiJNOYGaVw8k20lk6a9zx4ZTSReee7yJEEyW37kaNxpEiM+uhFqpfPEm7vofnuxzByk+QOvYTvOkQ615HYvBdBlvFti9L5I3iWRfdTP0J9fBAllsSulcm+/b1Fnq/eyHHo2O8ue58DHq1+2tv20pzaTDiUYtP6pwmH0gwOP3/Didr3PcYn32Fw6LvX3W4t8H3/qnLhAIIQ8JMBNIw8Z85/mWptYpkjLESqReKJD0VxHTj8hs7AmZWtOmKdcRL9CfLn85glY1VKoEvBadRI9GxF0kLo+ck5PZUbYbx8gp7kHsJKYtFnihSip2kvF7Iv4/nudTrtr7kWy+fkq2U61oUWJXJ9zw/GkCKtiaNJkAQ69rZQuFwm2hJGkAIDI2sSjuHQvquFzNk8nhv0cqkxBc/xUGMqeq5BPatj1384Vs03A1EW6by3B6dhM/i182z+zE4ibdFFRgXANR1cMzAwvufjOW5AG7VED5Hv+RTHakRnVyqCKLDvE+t48p/s4q0/usirv3uOcJOGqIiUxoMIS8vGBB/+tf1oUZmxY/lAEXZ9jPf90m46tiV57Q/O41rBgyAIkOyKsP6+NnZ/sA9Ld7j8VoZwUkWJyFj6rEMgCux4ppfH/8EOiqN1Lr02jRqWeejntt5Wx2D1zY8tEnftUQmHAkt37OTCiePaDtzlIMoKkaaOYEWxwF0CUQshhWcFcwSBxtQIaiJN673vxdVrZA+/jGfqFE68gahqFE+9jVmYr8+WwzFmXv82rtkAfARRxKlXsZQskhYhvnEXhZNvkt79ALXxS1QunkSQgtWGU6tQuXQSJZ4id+glrtx9fXIYKXwILdUWXL+iEt+wk9rweWqjF0lu3UesdzO1kQv4nkvhxBt4jk3P0z+KHIlh11ZXsWVaVTK50xTLQ2zof4LuznsRBJGOtr1U61NMrjRhf1vgMzj8PWz7SshRIJnopatj/2xuJUYs0jbLTHzjp9ds+ExPODS3SitP1AONQoP0lmaS/UkKpou1StXNa+E5FpWxgJfu6uTtjWC5OhOVU2xsfvAKwfocREEiHe4nrrZSNqdXWFIMU8Mm5YJDdtLCMq+6JwJoPc1Ed/Yhx8M0BqdX3asiCBBpCaNEFWLtUTzHw6pbaHGVyaMZbMOlY18rjuEyfTJLy9Y00iwFkygJVCd/eNiSbwbR7jiJ9SnyZ7Jkjk+x8WPbabu7k+KF3M0d2IfqjIEWVVCjMmpEpmN7kupMg74DQQl8OKkiKSLlKR1ZE7nvJzaSaA/xrf/7KENvZfAcn3BS5aG/vZW9n1jH8MEsw+9cle8UBDY+1M4rv3OWc8+N41geggjR5hD2rFFRIzL3fm4jpTGd537jBJkLZQRRoG9/M5/8z/dRz98ektJVG5VsziWT82hrEcnmFocqRElAUq+qnfdnPVvXx7sqPuzaJrnLh4Mu0KtDND7Uhi8sCH8BOI0qoZZOqpfP4C1B9nc17GopMCizLp6SaCa5eQ/Zwy8jaWEinf3Bl4/EsEoBJcOCskDfXzQ5LPFFESQpoPPwPVxDR21qAUHEbdRx6pUgZGY7CNLa+11su8745EGSiT7isS4kSaMlvY1c/vx18xS3E77vk8mdWVDaXKmNE4t1kIz3IcthOjvuplQZoWHc2Mmo1z3OHgv4x0or5P2CoCAkeyaD73jY9ZvPqUhqiKb1e3CtBtXJQazKyiYXH49MbYDO+HaianrR51E1RUt0A1Uri+vZc+SK10PPphAN3WVqyGDBItcHczzgpAr1tqxK5/wKPMdn7K0pfN9HnF2lxNojtO1sxq7ZjLw+gaSIeK6HXXdo5Ifn4mCe4+FaC8d9euN+2rY9OBfqnj71IuXxQM6iY9fjFIaOYV2VN/1hQdPGNLHuOBe+eIraRJXy5QK9T6zn4pdO3zQ5qVm3sXSHWItGOaHQvC7OwKvTbHyonaaeKOHUrFGZ0En1xejcmWLmfJnLb2bmzt0oW5x/YZLNj3Wy8wM9C40KMH2hxOXXZ3BmVzC+B7XsfBN3qj9Ky/o4b/7RRXKDldltfEaP5Ji5WCbWfOt7bGCVRkUUoadb5tRZE0kUsJcoldv9kT4+8Ct3zb7ysRsu5Umd0SM5Tn1rjOxAGccMWroda2lvUGtun11lgJGbQokmiK/fweQLX6Jp+wHi63dSHTo7VyMebu9FkCSMbKDZcW0SXJQkEEQkVSPSuW4un1K5fJam7fupyAqCJNOYGcOzDBy9RrRnA+HOfuxqEadWRk21oiZbUGJNhFo6MQsZzPw0sf4tiIpKpKMfIz91k1rpS8MwS1SqE8RjXQiCQCScJqQmfmBGZSnoepbp6WPEIu3Icoim5Ho62vcxPPLKDaVXW9oknvxQjMELFuWSR32FvSqRtgibPrgZ27AZfXmE2sTN3Q9RVrAbVZRwYi6Ut1LUrDyZ2gD9qQOLuuxFQaIzvoPp6nk8XHw8BK5/fMv02fNgktyUyek3qwsqwOR4CLW9CXMiP5+zXCXMykIjXKiVKQzOOwlXB+ms2vVDdrIWoXD5GJnzs8n9q8bf9OmX13R9txtSSKZldzue45E5OolRaJA/m2Xrj+wisS5FefDmOPAs3aGWM0h0RKjnLSRVZODlKdbf10b/PS24toekiBTH67RsiKPFFYbeyiwyZuVJHatu07a1adE5yuM6VmP5+SbVE8W1PaqZxgKH3vegOFK/bUZlVe246ZTIQ/eFePqJCHfvVZHlpTi2BERJ4PIbM7z1Rxc58dURiuN1dnygl4//5j3s/nAfSnj5AVUbuYAgSkR7NhLt2YikhREkmfLFExj5afIn3sD3nKAQwGxQGTiJpIUJtfUAYFcL1IbPL3iwzWKWyuApQm29NDLjFE8H+h2VC8fQxwcJd/ShNbfPhuJAnx6hPn6ZSEcvSizoGNZSbeB72NUiWnNHcE0XjmMVs4TbemhkxqkNX8DRq5QvBgqEvudRHjhx05VpnufgOPMeiCSqiNItqC+/xbm6TO40ler4nCfe3Xkv0WjbdfeJJ0U2bFUpFz1Mw58juVsJXNOlPlPDd/y5nqabgV0vY5VzNPITWLXVlbZ6vkOmtrzyY1RN0xbbNLftjVCYtjj7ToXJQWPRPfE9HzkRIbqzb+6Z/YHD9+f/EdDeJHq2077zPcjhgCFDECWaN99DsmcHbTseJd65OXhfUkj27qBt+8Ok+vcgqbdnsrsaWlKjdV8HmcOTAXGsD7mTM9h1m+5H+m/6+LbuUC+YxFpC9N/TQnlCZ+ZCmeylCj37mok2a3iuh1405/RLvKUKL3w/oFdb4mf2XP+60WVRFGYbbpfY9zZWl61qpeJ5UKt7hEMCmiaiacvPSgPfn+L4V0cQJYFQXKFjRxPv///u4+H/axuV6QaDb8wseUNqw+eoDS/UW7naT7LLeezyPCV1Y2ZsrvwYwK4UsSsLJwTfdahcXCw163sulcHF5ZG+bVG+cAwxrKJ2pBBD6qJw3BVULl1TH25DZeAEansTdqlGZeDmJG4hoDy5mozRn5Mavj6UlgTx1i3oZ8fmPVrXA1lE8EHtacbOlPEMe7YuWMB3XARJQhAF3Nrq+NBsp8Hw2Ks0JdcjCBKqEmNd73s4c+HLy/bXmIbPyCWb8eHgGhqr0A3x3CBhnTubxSzffHxYUsOEm7vxXBsllsIsrY5HqWxOUdTHCSeSi8JbgiDQ23QXFXNmlofq+ki1K+x6MEG94lLMFbGvUuoTwxqIAnahtqLn4LqQZdTuLpxcDkFWEFUVpxysWERVQdC0oGPfc/EaxizNCniGOT9bCQItW+8n2bMdgNGDX8OqFTErOdp3PEJlagCnUUUQZTp2Pc70qZcwStN07HoPjeIk8a4tSLKGXpgk3rERRJHi8M2Pm+sh1p0guSGN1hTikf/0fvB85IiCltRoP9DFxb88vSb+wSuwGi71vEE0rdG6McHUmSJG2eLymzPs+Ugfggj1fJDob5QtbN0h2RlZdJxISkPRJPIjq2f2qOVMZFUkFFcWFXREUtqy+90sVmVUCkWPb35Hn6tGux5vlA/g+7hW0Ag0+PoMz/+HE3zk1w9w309uYvRIbkGZHASJpXCTiqxJ+J6PNWvtl4tvirIQVFhEZARBwDYcGkUL23AXbZfui1HNGtgNh1hLCCUs4XtgVCwaJWuxNRcFEvdvxa3o2NkyanczoixiF2v4rofWmcbOV/AMG62rGadcxynrqF1pfMtG621BTsdw6ybm6FoaCuchKyHCodTca8cxluxOvxZSWA323dBGdFc/9bNjeLpJ4r4t2MVasNrrbcWtG9i5MvH9GzFGckjxMGpbktzX3sGtr86wlMrDTGWO0dUeNF2mU5tob93DdOY4S3kRlukTbxIJh0Usy0dTRYYGVpYfcS0Xz/bpf2IdVsWkPHxz9DWCrGDrFVzbRNYi2LKK56w8V+P5LiOlw7TFNqNIiwdtSE7Qndy9JAfatdDCgXZ5ukNFkgTsq+6dNV2kLol4pn3T/QzhTZtQ2lsRtmzByeXwTJPI3j34to05Nh5Ubeo6UjKJ3NQEBL9i4/QZ3Orsqsz3yV86TPbCW8F9cGzAx6xkF4md+a5DcfgEnmPTsuV+tHgL8fYNhFOduJaOIEq4VmPVTNyrggA9j6+fyw+FmuZXRkbJINYdJ72jhcyRtSuJ2g2Hes6k9+5m4m1hDv/lZXwfht7O8MBPbyaS0sgOVvB9yA1VyV2u0bM3TeumOLnBKr4Pkiqy/v42ImmNNz+/mJz0RsheKqMXLHr2NZN4bpzKdAMESHSE6d6TxrpNFXyrziCvmRXCh6kzJcaPF1h3fyvJzgi5y7MPpQCtmxLc9cl1bHiwnVhbCNfyyA5WOPG1kaC6wVw4eLS4wt6P9bP9/d0098cRZYHylM7AK1Mc/ashKlPzD3OsNcTPfvkJXv7tM7iWx75PrCPZHcX3PMaOFTj854OMHMouiDvi+RhDM2g9zYghlcQ9m7CmisiJCGpnKtDbzpSQIhpSRMOpNnDKOqKm0BicCrRPNIXwhg7smVIwAawR0Ug7iXjP7G30MYwSpnXjclenrFMZuoTWlUK/OIkxmkVJxWgMZRAUCXumhFNr4NtuUGU3lMGaLCCnYzQGp3Abq/f+fd9lYvIgqeR6IuHmWcqWuykvk7QXBEgkRbr6VMoll4EzKz+nGlWItEUoDRZvSfOjZ5uIsoKohvAdC8dIYJZXVwlUMWfI1i/Rldi56DMBgfbY1hsXgQDTwybNHSrGkIdlLK7+UprjqK1JrKkivr32ycEplfDx8eo6brWCnEjSuHhxLpTl1GqIWgjftLAyGQTA1Rv4zsJz+q6zIgPs+95VZJ3+rONpkD33OoWh43NFLStrPl0b5JBM14N9TL89xqHffB3rqlVu8642Hv9vz9C8s43ssekF/Sergef41AsmzevjNMoW02eD6IlRtilN6vQfaOXSq9OAj627HPrzS3zgX+3jqX+xl7PfGadRsWjZmGDXB3sZO5rnwouTq74Go2pz9K+GuOfHN/LQz21l+GAWNSKz6dEOjIqNuJREyC3Au0rD2yhbZAcrbHiojY7tTXNGJZrWeP8v76WpJ8qZb48xdaZEKKmw+0O9PP6LOxFFkRNfG55zdCVV5L6f3MT+z25g5GCWo18awrFc1t/fxr5PrifZGeGb//rogr4FURLZ9/F1NMoWR788jF4wSPfHuPdzm4j/w518+1ePMX22NH+xAoiagpKKI6diCJKInIxg1g2caoNQbxSvboDrBoN7uohXN1DbkijpGAhgjuWQoqGAXG+NRiUSbmZ932OoWhCX9lybUmX4qnLe5eFUdNyKjl6Z39Yp1GgMZ5DC6qLwljUZTPpXqovWirqeIZM9RV/Pw4iiTCLeS2vLTsYm3lwUBvN9OHnIYOCcFcgcr0JPxapajL4ygu/6WLVb01Hv2iZyOEajNLNqg3IFY+XjtEY3okgLcwOCICCtcMg1d6rEm2RE0UWUhHlNFR/cagOtK41Tqi9mI1wl7Olp7Ol5dUe3tHi151JmtU+vFm8mvX4fkVQn7TseoTx+jur05UXbeV6wcmneuJ9Y+wbAJzdwED2/sh6ntaB5VyDsVhosYFUWOjHly0WMYoP0tlbUZGjJnpWVop4PtFIKIzVqmWCsOZbL+LECGx5opzypz0VIxo7m+d5/OMndn9nAgz+3FVkVaZQsLrwwwfGvjKxpVeE5Pse+PIQgws4P9LLliS7qeZPzz08w8k6W/Z/dsObvdj28q0bFtTwaJQt8iLfND7gDP7qRti1JXvu9cxz78hCOGdRcjxzM8hOff4S9H+tj7GhujnSt70ALuz/Ux+SpAt/+1WMY1SDRNvx2FkEQ2PF0DxueG+fS9xdKoYaSKt/8lSNMnSnhez6iIqAXTN7/L/ex9Ykuspcqcw1G+NAYzmBO5PEMi/CmDspvnMOzHPChfmIYz3ICLfhzE3i2g+96mFNFcFyM0Ry+41I5NLCkJykIIooSZXFISAj4lbQEzektdLbfTTiUmhOOqtWnmJ45vsR+iyFJ6iz9/BIwQbrmM9/3sJ2bp7vxPJvpzHGa01uIRTuRJIXe7gfI5c+jNxaHAhMpiWc+FWdi1Ob8SZOpsZUNIC0VItYZI72lmZGXh5fkbVrVdTs2enaUUKoTQVz70KiaWTL1S3TFd96wdHg5yIpAbspi4lJjASGhFA/jVhtUDg6A6y2iFPlBIHfxnUXvWfUS2QtvkRs4FKxOXBvPsRh4/g/nthl588t4tonv+5iVIKfDLFP0bYMAvY+tw67b5E4uzuu6psP0wQk67+8l2hmbMyqSJiHKIsqs/pMoi6gxDdd28Sw3YCe4BhdenGT4YBbX8uaMh+f4vPOnA5z46nBA33Ll/D4Mv5Nl8lQRJRTkNIP+IWeuZPgKGmWb//0jRxGdMJ4lwlx1pY8oyKSifVhOnaqRQS/YvPVHAxz54hCSLOK5PkbNQhREzj0/iVGxWEiVEMw/QcXm2igU1jRyBEkk3JnAKjdwqqsLkfjebDXDLFupHJLY+t4uypM6Q29l5sJcvgfF0ToTJ4v07EvTvC5GYaSGIAn07E0Tbw/x4n8+tYBXp1GyGD+RZ+sTnWx6uGORUZk4VaA4Vp9b0nq2z9A7WSrTDXr3N6OEpHmjAvimjTu7wqgeGcStz39X96o4oKvPv+/pC+/Hco1p0Ugr9+//B4s/EAIGY1Gcr+4KtFQ8avUpzg18Hcu+cdJOEER6Ou+jp/O+G257BY1GgbcO/xduRbttXc8yMXWYLRufQRBkNDXB+v7HOXfxK4s4zHyPQHlywKZaXsUk6fmEmkJUxyuLeifWAklRiXdtxvfcRQJdoZYoUkjGLDaIdCQCluRsDSmsoDaFqQ0X5pRCHc9kpnqBlsg6NHnl0s9XQ6+6bNwdpaVL5c1nC3Na5lpvC0oyipUNVhSNwelV0bUoYpiQvLjz/5ZAvqZqywXbaixgEXCukpK42ni4tgH27RfKC7dGad7VjlFsUDi/eCXquz7Tb4+z4UNbad7eSvF8DjmisPVHdtG6r4NQOkKkI4aWDvPof3o/Vs3k0lfPMfn66KJQmWN6OObi+dFuuIvyycHJwao7N1yV+J6PnnMIq4GjmQx3IYoSdTOPIoVJhDuYKB4npMQIqykMu4pTMdG0ZgyniugKRLUW3LqJJjgoYQ1BkKgaGaJaOnCUrSJRLY0kqpTq4zdsC7gaa3PHBFBTEWLrmxEkkfLZKYzMCiY6SUCNyAgisxYyWLFoURkhJnDfT25adLPT/THUqIwWDyZZJSQRaw0jiALbn+qh7+6FIk2p/hiSKpHoDC86fz23WLveNT2qMw3i7WHEpUqkZ2Fnbq2GiSCIqGr0htv5vo9t62RzZxmfeod6fWUVSWv1kG8lZjIn6GjbS1OyP+ALS2+lOb2FbO7sgu0s06OQc4jERBRl5det53QyJzP4rrcgLr4WSGoYORSlnhkh2rEeUVYXfN7+8AbkiEL2nRFSu9oxcjqx/hRGrk7z3i7qY6UF2xeNCcrGFK3RTWv6LXwfjIaHXnEW2AzftPFsZ828X92JXTRHbr5kdqUYLh4kp9+YAfzdgu96XPjiKayqib1MyDR7cpojv/UGlZESPuA5HsWL+WUrDPWZW1CFtwI0dYbY90wHlw8VyZ13cLzg+pORLhpWiZCSwHJ0LKeO45p0p/YgCDKSqGDZdcJqE1UjQ3NsHaoSw/UsfM9Dt0pEtWAelUWVqpEhojbRFOlBEhVqRgbbXbnBX5NR8V0Pu2qS3teDUzdp2t1FbbhAbfD6MWgtIpPojIAP2UtBqEJSAyW4UFJh4yMdSzrJesGaMwaiJASUEQRhsKUqw8yqPcd/s/DCl+Dp8X0815tNWt3eidjznBVVbQVhqAYNo0i5PEKucB7TyuMLJkoo+O6e4y9isPXx8Tx7RedY+vqWj5z7vjf3uSD6yKqAZV1/bnNcg+HRV9i5/TOIgoQgiHS23025MragcdNxoKVNRpIF8hknEDjy5jnGrnyfa0txI21R+h/vpzZTZ+boNI6x9oS1pIZREy2o8RRWJY94Va+EFJJRkyHsmkm4I46SDCNHVIpnZjByNfSZGs41Hf2222Cqep50pB9ZUK893Q2RbJGJN0m092lcOFabE+oyRrP4w5kbimkth5jWTExrXtO+a8FUdaEDIYggCleqQ2frAWb/vlmoYYl7Pt7FloeaiaZVKlmTk8/NcO6VLKYePDtGvsHwdwauexyzaDD4tfNzr13DYeK1kZu/wCXQuSWGD0xfvLFT3rUtziM/2U+8OcQblw0SoQ5qRhbXszDsMiDgeha2a+D5LnWzSDLSiTP7umGVcTyThl0OVjBOGUEQMewymhLDcQ2ioRYEQaRqZPF9D8e15ozXSrEmoxLuTKKmwox+7QSiLOE7HlLkxs14qb4ovXc3U55qkLkYGJVGycS1XabP1vnKPz24LB/NFU/AMT2MSlAC/Fe/+BZTZ0rLnG3xUxpKqIsqHiRFJJzUgrLiGzTeCSK0rwsTTcpkRgyqhdWlL0+d/YsVVf5AYCCu/AXw8Kfaef/P9hCOSUSSMq/91Qx//ZtDCyqDGo08B4/+7orPsfQ5l74HE1NvMzl1EICnfqabX/oXG/jTfzXA4LHrd7Hnixd57c3fuO45XMdnZNBi03aNex+NcP6kwcXTFg0jz6Fjvzf3fZbatzJRpTiQv2maFqtWRI2nqE8N4lxF8QOQ3NaGXQ0IK5ObWylfypE9OIrneCQ2tqDENURVWtSAOVO7QF/TXTSFule9WpkaMujeGCY/3VjQo+Lbt68q6t3Apr1RttwVxWp4lHM206MWvu8zPWLOhfjWgmSHxqf+zU7W728iN6qjl23SXWE+/ivb2XhPim//lwEalR8uEkxREnjf393I+NnKioxKbkTn/KtZzr+WoVArUKiNAD4TxYU9PZnKBQAK9WGK9ZGr5pIAlcY01cbM7Lv+gn1qZm42p+IzVjg2295yu3MqokDr/esY/UrwRbo/uJOJ75zFrl5/eRRt1rjnc5uIt4V4439ewJ71Kut5k8yFMu1bm2jbkuTyG9cP7zimS2agglV32PRoJ1NniisugGnbkiCUUBfkYZp6oqR6o5x7fgLnBnH5ZIvKZ//lBrbel+Sb/32Ub//BarXi/VX/QFdw+rUiuXGDtv4wH/nFPq7l4bwV57gRrsRVIwkRRQv+rWa/5aCoQXLw+9+p0dB9WjuufiyX/z5W1cTRbVp3t5M5Pk19+maIDn1qU0uLytlVk4kXLoIPya1tNKYreLaLIIoIApi5OpImLzIqnu8yXDzMvs4uVrMKbmpVUDSBzJhJW6+GJMNtYP/5gWDsYoPuDSFKWZt4Wqajb5YDK+dgm2v7krIqcN+nethwoImDX5ng+58fpjRjkmzTePzn1rP/I12MHC9z+OurL8u9nQjFZPr2NTFxbmX0QpnLdf7qV65e+d14nC83dq43R1zt0K5lJlm9UfF9lHiI+KYg9BTuTCwZAxHFQJch0qTSva+Z3R/uo+9AC0NvZTjz7bH5nhAf3vnTS3zqv97PQz+3FUUTGTmcw/N8ommNjh0pwgmFU98cncu3DL2VYfpskb0f68Oq25x/foJa3iTcpJLui9F/oIUjX7pMPbdw1ZPqifLgz2zhtd8/RzVj0Lw+ziM/vw3P8QJiNuP6RqVjQ5jOjRFM3WPLvUle+rMpjNq74zmWZixKMxbZMYP3/2z3u3LO5fDyn09x/KUCkwM3z1abaBJp7ZQxGh4f/JEEh15rMHTxxqsOQRJoWt9Eojc5S3x4+2Roq4PzJda5w/PsDb7rUb6YpXxx+ebWgj5KyZhc1WolEhfp3hjm8mmdTXujSIoAxu1xFN5tWIbH8VfL1CsusWSQX/VcH/0mxlGyPcSGe1I0qg4v/c8hqrng+SnPmBz86wnW393EA5/t4cg3JlHCEs/8481Isshf/+rZBfPyxvvSPPDZHo5+fYqzr8z/ptGUwu73trPxvjRqWCI3qnPsW1OMn60s2F8QoH1TjL0f6KB1XQRJEajlbYaPFrnwRp5a3kIQYd3dTex4rI2ubXHizSoHPt7Fhnvmm5tf/98jnHtlPpXw6E/3s+WBZgQxeH4OfXWC488uLEK6Ai0qse+ZTjYcSBGKy+RG6pz4zgxjp8tzzncoLvOJf72d0y9kyA7VufvDXbRuiGLpDoMHCxz++iSutfbnbQ1GBca+fpK2RzYihRWmX7q4pMF87z/dzeP/YGcQM3V9bMPl5NdHefMPz1OdWbiqGT9R4LlfO85Df3srH/iVuxBncya+5+NaHoNvzHD62fnBXJ1p8J1/e5ynf2Uf9/7EJh74mS0Bz40X5Bmsus2Jry2OgV54aYrm9XH+1p89higGuRnH9Dj6pSEG35i5bn5AkgXW74kjyQIHv5lh13vS9O+IceHgfAJfFKG5J4RedrBMj1hKRtVEPA+Mmku1aC+4V6IE4bhMKCohK2KQlDc9akUH21x9zFxWBdIdGo2au2RoLpaSiTYpFCbNueMLAkSbgmu4UnJomx6NqoPZmL8GQYCWnlAwwQG1on3dFaKsCsSaFJSQiCgGIS5TDxLPV+eCVE2gtV2mo0fm2NsGosSKNEKUqELLzlZ8D8yKcVP5lNsJ2zMYL58gobUvkhxeDlPDJq3dGvc9nWLknI6p/+DLhm8VPBdK2eC3KmZujSOQaNNo6Ytw6WCBWmGhQ5Ib1skM6Wx7pIWmzhCNmkPfniSyIi56zBItKhsOpBh8Z75JN90d5hP/ejvtm2IUJhtYDZdtj7Zw94c7+PpvXODEc9PBOBBg23ta+egvb8V1fPIjOqIssO6uKH17ktQKFhdezyMIAtEmFVkVMKoBY7VetMmNzDtoxjVhuomzVWRZpGtHgm0PNzN4cGmyy0Srymf/w27aN8bIjeo0yjZbHmphz1MdPP97lzn01Ql810dSRDbdlybdEw5aK0SBWtGma1ucHY+10rE5xjf/w8X53qhVYk05Fcew8WwPQfZovqef2uV5Ty4/VOXYl4cBH98DS7epTDeYPFVk8kxxycnCd33OPT/B9PkS6+5tJb0ujigKGFWL3OUqY0fzi8rsiuN1/vofv8OGB9to25IklFCw6g6VqQYTpwqUpxb3W9TzBi//9hk2PtxOqi+Ka3mMH8tz+a3MglLipRCOS2x/sInhU1WOfi/PAx9vY92eGANHynPU5JEmhX/2hd0cezFPadriwDMtJJoDmo3RczW+/ftjXDwU5JIEEbbck+SJn+iib3sUNRxQ09SKDoe/k+XFL0yhrzIGnO7U+Pn/tp2ZIZ3P//OBBYZJDYt8+Bf6uP/Dbfz6J4+TGQ0M+74n0zz0qQ46N4ZRQwHRZzlr8c43Mrz0v6fmDIASEvn0P19PW3+IpnYVy/D4/C9d5Pzbi6viYmmZRz7VwV3vayberKCoIq7jM36xznf+YJxLR+b7SXIzLk3NDiODFtWyF1AAreBZtioW5790jnBzmPSWZtS4hlG4jf0Na4ZPoTFOyZgkHelbUb7L9+DEaxVOvHZzfTf/p0CLykSaFHIj+qJnx2q46CULQYBUd5jGhVUwWQvw+M+tJ90b5qu/fo7z38/huT6t6yN85td28d6/s5HJc1UyQ3UUTWTLg2lESeBPfuE4U7M5EjUi0bE5xsyl4LXn+px+IcPpFzL07kqw7dFWzr6S5cU/WNwYegWD7xQYfKfAloea6d+TXHIbSRF4/Oc20Lklzrf+4wVOfCegxE92aDzzj7bw/l/YyMSZ8lyoTZQF2jZE+f7nh3ntT0ewGh7pnjA/8hu72PlEG2//5Tgzg2uLRKzJqIiyhBRRMLM14ptaESRhLsk9ddmi+JKEUyhhXhy6PkHY1fCDvpTi6PwXkdtacArFZblhrLrD+ecnOf/8ymKlgiigFwyOfHH5H3A5NLVrrNsd4zt/MM7Y+TrZMYP1e+JEk8qCVYEkCxx4uoWR0zVe/JNJqgWb3u1RnvhcFx/7R+v4nZ8/GxgLHxRNRC87fOt3x6jkbRRN4L4Pt/HkT3VTmDJ54yuL5Yavh9KMxdk3ijz8qXbSnSozw/MrwnSnxsa9CQYOl8lPBmHBlt4QH//H66jkbb7+X0fRqw7huETP1ih61V2wcrMNjy//xyHCcZknfqKLbfct/XALIux5T5r3/q0u3vpahouHyuALJFoU+nbEsI3FxvvS2cXhLjEewas1FodWRWGBhkgj32DirevktgQB3SpwcvpZpEgYBAFPb1w1+fiUjaVDCbcKhl3mYu5VIkrTdbdzPIOGvfbSdc93uJR/HUVaXE5/NQRRJLl5b6AbM3z+llReLYeSsfY8RtmY5OT0s8saYttt4PoWkhJDVkXMmrPkV7EaQfOhFl2dnEG8WWXnE62cfz3HxTfyc557dkjnwhs5Hv7xPvr2JskM1fFcn0bFQYtI9OxOkB3WcSwPS3cZPXFr2xGWQronzPr9TUwPVOcMCkB52uToNyfZcE+KfR/qXJC/yQwGoTFrNiJRGG8wfKxES38Xqe7wu2tU3IZF9vXLRHqaqI8WF1RNads3YY1N4hbLSMk4kXv34Mzk8V0XuTmFb1qYA0OE927HreuYF4YI7doCno81OIzS142UjGOcuUj0gbuxZ/KYFy+jdLQit7dgnDyPPX1zBI1rwd4n0ph1l9GzNYy6y6lXijz4iTZSHeoCoyKIAkbN4cU/neTsGyV8H86+WaKtP8zOR1L0bI1y8VCgS332jRIXD5XnHnqAqcEGv/Rnu9m0P7Fqo2IZHufeLHHgA63c/9E2vv7bo8E1CdCzLUrnxjDP/eH4HJV6qkMlmpQ58t0cR7+Xm9PsOPZ8Ht9nwfLX9yEzEhip0szyPSGCINC2Loypuxx7Ps/l4wE5niDAwWezKwrrCapM/Ml70d85jWeYuBUdMayC5xN9+C4ax87jFMoo7c14uoFv2UipILdnZ4vI6QQIAk62SHjPFnzTYvr8eeRwCt92catlxEgYKZXAyRTw7YVhmFBrF52PfhQ5Gsf3PFxTpzZ8gdzx1/HXoC7p41M2JinfxAS7svN4K+sJEUVsqQuXGoXquTX3vKwE25/upWtvPy/+5gme/Gd7mT5b5My3Rhdtt/6hdra/v4eTXxtm/GgQ+ZCSFjVpaI7iBKB1S5JkV4RLr8w3p/pe8G85Litptv9sKYfmemjbEEWLyux6so0N+1MLPtMiMpIiEmkKQpqu7XPyezOsu6uJp39xM/d/ppfjz05x5qUM5WlzUfn/rUaqM0wkqTD4TmFRB352WMeoOfTtXugIVnMmpemFqQi9bCMIgbb9WrG2jnpZomlXJ2oqgqNb8zFwAaRYBNv3id63FyQZt1RFSsYRNZXGuUvI6SaiD9yNUyyDD3JrGqkpQeUbLyCEQwhqQLUiNSVx8iX0I6eQEjGk5hTOTA5107p33ajIqsD+97cwPdRg6nID1/E5/06Zxz/XyeYDCcbO1xfkFzKjBsOnanNj1bV9pi832PVoimjT/C33XB81LNOxIUIkISMrAlpEQpQE1LA016+xGlw+XmX8fI0DT7fw0hemqBZsZFXkwNMtTA3qjJ6tzXmmU5d0MqMG93+kDVN3uXiwwtRlnUZ17UlTz/MZPFrh4U+28+G/38drX5pm/IJOftKY84huBKW9GUEUkdvSyM1J9CPnUNd3YQ1NIkVDeKZFaOs6ALQt/Xj1BtqmXuzxGaSmgCMtsn87hT9/DjGk4tSCsIiUjIEk4tUbhHZuxKvUcWYW85wJoowcjTP9+rdxzTqhlk6a9z2CqGjMvPntNd+bHxp4Htl3vveunEoJS0RSGum+GEpYQo3KJLoi2LqDUbVJr4tRGqsz/NYMTd1RZDVYTYTiClvf140Slhk9lGXqdBEtrqBo0pyK4RXYhotZd0i0hRblSQLpDRlBgFr++gUggigsWBWpYSkodx6oMXS4tGh7z/UYPz1/LdMXa3zhH55g9/va2fVUO4/8ZD/v+el1vPaFUQ5+efy2ljRLSqBjZS1hOF3Lw3d91LC4oAjRsX2ca5rBb8WqdY3hLxFRlcm8PkjX+7ejJsPYdQvfdrEmZlDX9SBGIthTGeSWNPbkDDQl8BsmeB5OvoSUjOPM5HBLFfxGYC3llhShPduC8EStjlutE9q6ASebB99HSsYxL4/d4OpuPXq3x2jtDaGGRN7/M914jk+8WcH34K73NvPKX0zjXhWSMeoujdrCB8h1fASYkw0QRNj5cIqHPtlOW38Io+7OeVKKFpSqrjC9sACNmsuxFwp84p/0s+s9Kd76aoZkq8LW+5K8+dUMpZn5gVUrOvzl/+8yj36mg8d/vIuHP9XB4LEKx18scOb14oqNwAL4cPFwhS//5hD3f6SNn/h3m5gabHDpaIV3vpFh/MKNucW0Lf2YlycQFBnPdghtX4+gKHgNE99yECNhfNtGjEXA8/BtB7dcxZ7OIbelESPhQHPEdfF0AzEaAlFEjIaQUwnsySx4HkJYBUmCZVh+jew4drWEPjGEGk8T7dnIFUuf3n0/jcwEcjROpHNdIBh36RRWKQeiSKS9l1jvZgRFCwTcRi7gWfNeodbcQXzdNuRIDM+2qE8OUx8N6M1FRSO5eQ9aug3XMqgMnsHMTy/ctz/Y17UM9Mlh9MkhfM9FkGQiXeuJdK5DUlXsepXayAXMQlCqH+3ZSHzddgRJojp8ntrIhbnjRns2IofjOEY9+K6+R210AH1ydvUjiEQ6+oj2bkIORecmqOrQOWqjS1Oz+55PZUqn//42KtMNBEFg/QNtFIZrTJ8rsevD/Rz+s0vouYUes6SKRNMhlLAcaH8IwXs9d7fguR6H//eluW31sk0lY9K3O4EgCgsiJ7FmlWSbhl6xKUw0EK90XgqBwbl6BRGKy4hXMTpU8xa+FyTKn/vtgRUt6BpVh4NfmeDk8zP07U6y/2OdPP6z69FLNoe+cvtIMhsVB9vwSLYtllwIJxVkVaQ41bitoc4rWHNHPb5P8z19eKZD+u5eSmenMKarmJeGcTI58H28mo4Yi+BbQXjBM0zcWuApi+EQvhMI/9TfPgaAM52l/sZhfNfDN4PJTwyH8Go6bqmCICt4+uoJD2tZgz/6kZfQl9BaWQn2PZFGUgQiSZn9T8/TwgiSwLo9cVq6tQX5C9+/scxFqkPjx//NRmpFh6/+5xGmL+s4to8WlvjlL+1Z9TVejWPP5/nQ3+1l1yMpjj2fZ9+Tzbi2z6UjlUWezPDJGjNDQ7z0hSl2vaeJRz7Zwc6HU3zv8xO88CeTa6oAMesuB5/Ncu6tEl2bozz4sTYe/Fgbux5J8Sf/coDhU9dv9KofOoNX0xFUNfAeQxq+7eDbDrXXj+HbTuCYREL4vo9v2piXx/FNC3sqhyBJNI4FHdHGxRFEVQHPwxwYw1JkvHoD4+xlBE1dFPpaEoKAIIqBVPTszJLcso/4+h1YlQJWMYeoaohyEAqJ9myk/YEPoE8N4+hV0rvuJ9TcQe7Iy3i2FXz+0DNYxSyN7CRSOIISmVVHlBU6Hv4QWqqF6sgF1GQz3U9+mokX/hKzkEFUNbqf+CSN7CRmcQY1niLU1jU38Uc619F23/uojV7ErlfQUm0Yuck5o2IWswiSTNu978U19AVGJdTWQ3rnfZjFLPXJy6jJZjof/QiTL3+FxswYWqqV9oeeoXL5DI3cBG33PEl15CJGfvmclO9BZUqnc3eaiRP5ubJYmNWFE5cOWdXzJjPnS8ghicHXguPreZPMhRLNGxZylxUnDaYHamx/T0tQvXWwMKeW2LsrQefWOKdfymLpLpIi4Fge4YRMok2jOBmMWzUs0bU1PlesAjBzqUY1a9K1NUZzXyQoBLjq4kVRWDA+BHH28fDBqDpcfDNPOWOw64k2urfHOXTNd3TsgDhXCYlr8yCvQmaoTnnGoG9vklizOr8qE6BvT5JIk8Klv7w5ieSVYm1GxfOpXs4hKhJaa4zMa4PzyVPbwc2X5rZ1CwuTVP5s0t01riJhrAaeom87i7a/st2KBv8y8ByfmfNrS5bFmxU2H0iQGzP4zR8/iV6ZN0r3PNPCj/zyeg58oJVnf291K6jN+xM0tao8/8cTnH61OPd+1+bITfN26RWHN74ywwMfbWPDnjj3fLCV6aFgtbAUGlWX8Qt1Ji7WOfjNHJ/7txt5/8928+pfTmPU1xYK81woZ23K2RLn3y6x+9EUP/0ftvCez3YwfOrS9fetBAlC3zCDcabPG2y3XFvy7ytOiH+NxIDfMOd0Ybz6fHWYpxsLjrsUwu29qE2tRNp7iPVvJXvoRa6MfEFScPUqM28+N7sCmZ0VBIHWA09SHx1g5p3vguehTw7T+djHqAyewioXaNq+HyM7ydSr38B3bK6eUWJ9W4j2bWL4q/8zUDAVBNZ99GdI7bqf6Ve/gaRFkEIR6hOXqY8N4JpXvM/A/ZZjCTzHojZ6ETM/HWiXXOViO/UKdaOOte3Akt9ZVDWm3/gW1qzxWf+J/4twRx+NmTGiPRtxDZ3i6bfxHQc1kUYKRYNrWAY+PrbpzgpieXNl/E09URzLI9ocCjR1OiNEm0M4posWVzCrNq7jkWyJku4PyGRDSZV4e5hos0asNRQoJ3o+esnmyDen6Nmd4JO/uoOX/9cQM4M12jdGec9Pr6dWsPj+5wOj69o+l94p8MhP9fPYz6znyNcDx2nzg81svDe1gBTSNjy++zuDfPSXt/KBf7iZN/9iDL1sISki6e4wnVvjfP+PhzGqDmpE4qEf66WSNckO6dimi6JJ7P1AB7blMX1psSNVmDCoF202P5Bm5HgLpWkDURIoTQXvQxC1uLLSSLRpgTBhSiHdG8ZzfMy6Q6PioJds3vjzMT7yL7by0V/exltfHMOoObRvjvHwT/SRG9E5/LV3p/lzbeEvTab1gfXoE2UiXQmygjDXexlLdBNP9uK5FuXiMEZj7dYxHGkmnuylWpmgUX/3k/MA/TtiNHeHOPZ8nlpxYZhk8FiFcs5m5yMpXviT1f1gtunhA1pEQpKDZXi8WeGRT7cHsc+bxNHv5nn0Mx3c/9FW0p0q3//iNNX8wgm3pUdD0UQyIwauE7BHO7ZHo+quWcBHEKBna5RqwaacteY8t1rZwXeX90wB5Gic+PodSKFAVtUqZKmOXpideG8PYv1b0afH8MzFK+DUrvvxLAPX0MkcfIHyVZLUvudi5meuCmnNTkaCiNbUTPHM23PLVbtWxjMN1GQzrtFATbaQP/H6Vd/rqr6dZDOirJDafmBOAloKRVATaRAl7FqZ0vkjpHYcIL5uG/XxS1SHz+M26oCPPjFEpKOPtnvfi1nMURu9QH3i8sJ7eB2P2GnUsIrBWPN9D8fQEZWAu8wx6kihMEosidPQUeIp7Grxusvy7EAlCIFN6jRKJqIsYlRteve3kOqNcvY7Y9gNl5adiUCvXRKIpDTMms3M+TKR1hjtO1IURmvEWkKIskA9Z5DsidIoWXNh5wuv5fjuf5O4/zO9PPNPtqCGRGRNJDfa4Dv/cYDixLwD8faXxmnujbDziVZ2P9WGWXPIDuu8/aUJHvqx3gXXf+alDGpI5O4Pd/LZf78r6OuQBMy6y4U3cguE/WLNGvf/SC9aRJqV7xDQyxZv/cUYJ59bzBRi1R2+9z8GeeRzfXzm13ZiGR624fKd/zLAmZeC36Bvb5KHfryPeKtGLK0SbVLY90wn6+5KYRsu51/L8crnh8GH0y/MEE7I3PPxbn70N3fjez6eByPHirz6JyPvGk3NGqu/bPJHxjDzNfTJ0rz+ORBLdKGoEarlAr3r38Pli9/BddZGae04BqFwCs9zfiBGRZQF+nfFSDQrHH5u8fnzkyaj52psu6+Jvh1Rpi6vvE9i6ESV4pTJo5/pIN2hYRke3VsjOKa/IO8BEEnIbL03STytkO7WiCRk+nbEePzHO6kVHbJjDYZOVBdwJxWmTM69XWLfk834Hhx5bjHZ55Z7kzz2o51zBsBzob0/RPfWKG9+JbOgUmvd7hhdmyOEohIb9sYJxSQOfKCFjg1h6mWHy8er5CdMJFngyZ/qomN9mFLGopKzCcWCMmXf93nnW8v/jkqsiUjnOqpD5/AsA0evrlouV1Q1tKZWjPx0EK66AexqCd9d2mjNvPFt7FoJz7YWGzbfX2Y/P+Cpu0oOVxAEEITZceKD719HLtfHc2x8z5sbV+WB2VwNPvgeuaOvol4+S7i9h6btBwi1dpF5+3k8y8CuFsm89V3UphZi/Vtpu+995E++SfnCsRVVeXn2tclsfy55rY8Nkli/g573/yiOXsOulSlfPL5ApVHpbie8eytupUbj1AUy50tLnqc8vrBcdfjtDMNvL6x2rOVNzr1awCkGneu5wcqiJP3cdbs+x5+dZvRkmUSrhqyJPP4z60l3hzHr7oIwVSVj8o1/f56WvghqRMKxPYoTBo2KzejJ0gID5JgeR745xaWDBZLtIRQt6Lkyag6lKQNrluXDari88kdDHHt2ilBUns3XeDjpToyuPUQ+c4CQaaEfO4txKgg5+j4c++YUYyfLxNIqghgcJzs07+Bkhuq8+edjyzKoV7PmnJPge3D0hTKlbe8hnlGRcMl+/VVKORd/24OEpGGMUxcwqjZf+Ecn0We1ra7Gye9NM36mvOZyYlhr+MvxKJ8JSvqMmeqCC/M9l0Y9RzF3kWisnab0BhzHoKVtB4Igkc+ew3MtYokeJkZep7VjT6AVUpmko+cAihKlXpthauxtbKuOZczXVUuSSu/6x1DVGKZZYXLsLZrbdhKLdyCIMpXiMJmp47S076YpvR7Pc5gaP4xtVunb9CS2VUNVY1y+8G0STf20duwOlNmy5ynkLnAtYqkwqc4wFw6WGTs3/0OLSgjPNvA9OPztHD1bonRujDAxoJMdMyhnrxmYgkij5pEdM+bYUosZi9/7hXM89mOd9O+O4Zge598u8/pfz/DEj/egaPOt5U1tKo9/rpNEs4IgCNSKDtGEyoMf78DzPC4dqTA5oC/gTjLqLqe/X2T/Uy2cP1RiegmDd/FgmY51YTbsS7BhXxJkkcxQnb/6rVFOvJhfkMTc+0SafU82IwiBsa3mbDYfSLLp7gSW4fHc5yfJT2RxXZ+jL5a490MKrd0aXVvjNCoWl09UePUvpxk7d/2H1WnUqY9fwjWuut9aGEkLAQKuUcezTBBF5HAMQZLxPRdXr4EAkY5+or2b8FwHt1HD0WsIijqbWBbmVh4IIlIoEhiGZUrsXKM+uwJYBTwffWqYaNd6aiMX8R2bUGsXoqJiFjO4RgMjP0Vi4y7qk0N4ZiMwQIKAZzYwspP4tk115AJWOahMEyU5CGN5HoKsIKkadqWIXS3i1Gu03fde5EgMyzICdmVBwCzMYJULiKpGtGs9lYGT80ZWDJjBg/NeW2J4HcMjBEUEmXdeoD4+iO86iwy3GA3jFMv4DRO1txO5vQVBEDDOXULp6URua0Y/chptQy9SLIp+4hxKZxtySwprdBK5JY2YiGKPTeEWymib+tCPniW8fxdiMoZbrGBPzhDZvxtPb1B79eBcztb3IT/aID8aPOuu7fO3/vs+nvjb6ynPGOTH5seAXrKZcRuIiohVt+comoaOlAg3qYRTGp7r4Tk+akRGr7jUSzWUsIxjBkZKjchEmkWMsoXn+FRz1hxFzPwNKSM1TRJ98C6MUxexxqdni0bCCLKEa1hMD+qIU36gMSUIeLOPvhiLojsSl89ZeJUayHKwnyDgNQx800KMRxGjkaCopd7AF2Wylypc+u2X8S07uDdCoCArNyXm7svQqQaCpiLGo3j1BmI0jG9alCsSxekyorY44b9S3Lzy43WeQdexULUEydQ6atVpBATiyV6mxt6mvWs/oXCKaLyD6fHDJFPrEQSRfPYcrR27KWSTGI3iguPFm3pxPZuLZ79C7/rHiCd7kWWVfPYcldIY6zY9hV6boaV9FzOTR4klOoknuynmAqrrzOSxuWOKkkKtOk1Dz1GrLK7K0BKt+GqKL/1mFqtWRFLDCKIFgkBq3W6KQyfwHIszbzY4/foZfNdGkBR+8ycGcK0GWrwFz7Gx9TJKJMHb36rx+l9NIUgyoqLh2RaTgw5//msTeI65wIt86Y8kfN8lFGpG1/Nkhn3+y0+fxfc9ZDmM65pEIq24rolp1mYlehf+EIIYhNZ84M2vZpZ0UnPjJl/5zyMIikRkXStSREG/nCWyvgWSCSjmEDUZQZb4+n8b5Ru/M44YUnAbwcCRIipew0aQRbT2BIIkIigSU34rX/z9IvXBDOG+NI3RAr7tIkW1oNrK9xAUCVGVcGsL+z6UeJKmbXfjWSZGfppGZoJY72Yinf0IkoxnW8y88SyR9l5SO+7BtUw8q0HxzCEQBBIbdxNq7UIQJYz8FKWzhwm3dpHYsAtBkhEkienXvgWiQLx/Ky0HHmP8u3+OkZ1afIPWBJ/c4Vdoe+D9dL7no3iWgZpIUzxzCLsSrIpKZw/Tdt/76Hzs4zi1EoIoYRaz5I+9Sn1ymNL5I7Q/8H6scgF8H1FWKA+coDZ6kVBzJ60HHsfRq3iug5pMUx05j1OvgCCS3LSLWP9WnEY9UBdNpCicehvfcxEVjVjfZrR0O6GWdpRojJa7H8Uq56lcOnXjrzZriCOd/cjhGL7rYJaygSG8yrio3e14DRM7kwfPx63VkDtacfJFEEXUng68egOvWkeKR4Mqs1cP0fSppzEvj1J/4wjxJx6g8t3XUEwLQZYQNAX9yBmi9+7Frel4tTr2dC4oGloGY6fKvPaFER79qXV86Je28he/dGpuZaHGFLZ/sA9JFqnnDUbeniHRFaU2o7Pr4xuoZRqEUxql0RotmxJMHMsRaQ7R1BtDzxuUxuv03N2CY7qce3YkMEKOT3GkulCzyZstOnJcPMsK5MfXdRPevQ3fcRAkifrBEyQ+8B6c6VzQozcwhHH2Ek2feAq3VMEtVai9eYzwjk2o63uCAqdanfqbR0l++EmcTB5EgcbJC/iWjZiIEdq6Ad+0aZwbCJrHXQcIwphCOETi6UfxGiZCWKNx+BTRB+7GuHCZ8F3bqT73GqFdW6g+//qaRsBtkxOWlQiJVD+To28RjjQDPoZRplqdwHEMirmLdPU9SEPPYdv1ufJEz3OYHj+8pAa7788vxeeT2fM6KMKVakFBAN+jUhrDNIr4vofrmDhXKcuV8oOEoy3EEl2EI81MjS2URFWiSdRYmkZxmlBTO1qiBd91qEwO4HkugiihxlKEkm1IWoTq1CCR5q6gxDM/QaxjI2atgN2ooEab8BwTzzaJtPYhh2LUM8NE2/oRRZnazGWs2rwBTSR6ZkOGAoocQZLDOLaOj4eiRPBcJwifqDE0NUm5sriZLByT2P2eFNlRg6GT16em0FrjqM1RahencQ0bz3QQJAEkEbUlTmJnN4W3LhHuSSNFVCpnJwj3pFGbIlTOTSIIAuHuNOZ0BTmmEe5NUz4+igBE+lowp8oobQnCPSkQBOqXZkjs6aUxmqd+6ZoGT9/Hd10818Wf9aA9O7h3guuQ2LyHmTeeRRCloFx37BL1yaFgUvV9ShePEjN1codfnst3eLaNZ5vg2iQ370NUFBy9Run8EeIbdy66H1Y5x/Trz+I0lq80zB56Ebu2dPGHkZ9i+tVvEGrpRJBkStXDNLJTc+GyRmacye9/jVBzJ6Kq4bvOfAWV55I//jr61AhKPAkIOHoNIxs4PmZxhsLpt4O8k+9TvXyGRnZyLmxVG7s0mwcJ4bsOVqUQlCPPJrc828KulcgdeWX2fs+HvGrD5zHzVxlXzyd/7DWc2dVaYtNu3EYtePabmpG0ME077mHmjWdpzMwXqpgDIwiaiiCKQfWnbePXdcI7twQVoOUqvm0T2r4J88IQYiRM5MAunJkcvu0G8tuiiNLegtrXjVfTg3CgZQM+vmGgbV6HUyhzPa/WNjze+uI4WlRGlMTFQlqCgKhKOKZL992t6HmDDe/pQpjjBZx31hzLw/eDfIpjuWTOFfBdD8/xqOcNUusSpNfFcW2P4sh1xpskom3sR25vCVou2pqRErHgt3z1IFp/N3J7MwgC9vg0QkjDzuQRVAW5vYXGsbPY2TyJpx5FSiXB9zEHR7GGgvsvpZtmx5CH77pL3h6lux3fdal85xUi9+1F6evCrdaR001Bf1hrGqdQWv473AC33KgIokRH192kW7aSmTpBtTyOIIi0duwhnuyllL9EvTJFuTRCa+ceCrkLuI5JKX+ZUDhFS/suLLNKpTxGe+ddNLfvCISaHJNKeZSm1Hq27PwkplmmWhojEmmhtWMPLe27KBeHqFenmJk6RnPbDgCmxg/iWI1Zoaf5O5xq3UK6ZSu+71HInl/0PfTsKL5rE23tQ9bCSGoYq15GlOSA8lyU0BKthNIdeLaFlmjGcx2McgbftXEtHatamFuBiEoIUQ7CMK5ZR42lkZQQZnWhIBSA69qUK2MocoRovJtCYYBQKEU43EyhOEAk0oqAQDLZz/TMsbnvJYgQigT61vd9uJVtDzTxrf8xRiV3/US3IEt4loOrW/iuN7sMB0mViW1qI7atk+Khy7iGRXxHF/WhLG7dJLynl8ZEEbvcQAwpCIqEUzEwc1WsYjARiaqMqClEN7SitcWxSzpSRMMzHfTRxY2Hdq1CeeDEXPhL0sK0HnicyVe+Cj4kNu4KqFemR7EqReLrt9P+4DPkDr8UlM36LGhgE2SF9gfeT+bgC7hGnWj3xvlmoWXgGjrVy2euu81yfRkA+D5WOT8XvloKdqUYVHcttbvnok8NwxKLJ88yF5QBLzputYRdLS35mWdb171uszAzV3o8eyXUxwM5AEkLkd79ADNvPEt94nJAMxRL0vHoh1GTLXNGxbw8Pn97BQFBDqYY33EwB0eDPJHrgShgjU7hGWawEpGl+TCWbVP57qtgO1SeezWo/BwE37KpvvIO0fv3UfrGi4S2rENQ1bk+t6VQy1t8778H3+Hajnq9YJDsjqEXTVJ9ccYPZ+i7rx1bdxg7nGHzkz34rk/2YpnicIVIWqMyo+Na3oKu9bbtKZp6o9iGixq9wZTq+biVGtbQGI3TF8Hz8b2gtYKr8mh4HvqxM4iRMIkPPkHxz76G7ziIsQhiXUdQJDwzUMnz6gudH7dUxTh9ITDOALKEoCiz/+Sg1SMaQYiEEGPRoFrX81E6WzEHhgnv3U5ljasUuA1GZXr8ENPjCyuyK6URKqWFrMGWWeHs8T+be20aRUYuvbBgm5mpY8xMHVvw3sjgi3N/i6KM61pMjx+mUhqeez8/c4b8zMJJYezyywteL7XN1VDjaZRoE7ZeoVGYJNrah1UtBOErSUFLtmKUppEUDdc2MQpTxDo3Em3rpzJ2HluvEEq2YetlJEVDDsUwSxkco4YaS1MdP48oSth6OfAorr43VoVIuAW9kcMolYnHu9EbeRrFS8TjXVhmDdtpUNczhEIpdD2H77u09Yf5qV/bTLpLQw2JHP5OjkPPZm9IEWFMldDa4qTu3UD1zARSVEOOhTBndUMaIzl8x0MQRZxKwMclKjJ2Scf3fJRECDmqoaYiGNNljKkSeD5yMoyoymhtcWoXpkEQsHJVnEoDK1PBX4muvCjgey5qPIWSSM8ZaS3VhhJvwq4W0VKtiEoQA3bNBqIWhHmsUg6rnMdzbJRYArWpBUkLB31SWhgt3YYcjhFu68VzHKxSfvUUBv+HwLVMzPw0Tdv2o6U7QBDQUq3g+wtWKTgL+beuGIpr/wbwmW0XcBZzdvmz5d7+NY2pfsPAPH8Zrb8La2RyrpT8erCW0IP3HI/KlM7E0Rz997eTGyiz+ckexg5lSHZH6dnfRmmsRqNs0bW3Gc/xMMoW+aEK8fYIWkyhUbLwXA+CwAiO4czJpC+4ZtfBzuTxjcAIGOcGiezfRfSBu3HLFfTDp7AnM+B5eHUdJxeECeNPPIjv+xhnLuI1DIzTF4ns3422ZT2NY2fxylXsiZnAuFx1j+3JmfnSaEFA29SP0teFIImEtm2kce4S5oXLJD/wGE6+hHFhEKWtGUQB4/QF5PbWIKS2Rgj+CsWVfxg0z6+FIIhEYm3Ylo5l3gZG17XwpCw8AO9KC+ssIgmZPY+liDYplHMWA4fKlLOrKMddyeVevY0grKiiaKWQI3HUVCuN6dEFMfpY72aUZBq7XEAKRSgPnEBLtRLpWg+CiF0pUJ8cxncsBEki0rUeNdmMVS5QHxsg1NZNuK0HR68hSjKVobNIWohI13qUSALPtjCLMzRmxhdUMt3BQsjRBNHujciRGACOXqUxMxbkft7F5/yHEbd4KPzQYiXm4m+0UbmDO7iDO7iDdw8rMRcrDn+t0PbcwR3cwR3cwf/BuPnW7Tu4gzu4gzu4g1ncMSp3cAd3cAd3cMtwx6jcwR3cwR3cwS3DHaNyB3dwB3dwB7cMd4zKHdzBHdzBHdwy3DEqd3AHd3AHd3DLcMeo3MEd3MEd3MEtwx2jcgd3cAd3cAe3DHeMyh3cwR3cwR3cMvy/Cq9x450oJBMAAAAASUVORK5CYII=\",\n      \"text/plain\": [\n       \"<Figure size 1000x300 with 1 Axes>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Most frequent tokens for each tag\\n\",\n    \"tag=\\\"natural-language-processing\\\"\\n\",\n    \"plt.figure(figsize=(10, 3))\\n\",\n    \"subset = df[df.tag==tag]\\n\",\n    \"text = subset.title.values\\n\",\n    \"cloud = WordCloud(\\n\",\n    \"    stopwords=STOPWORDS, background_color=\\\"black\\\", collocations=False,\\n\",\n    \"    width=500, height=300).generate(\\\" \\\".join(text))\\n\",\n    \"plt.axis(\\\"off\\\")\\n\",\n    \"plt.imshow(cloud)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"b8ua3MFhrOaX\"\n   },\n   \"source\": [\n    \"Looks like the `title` text feature has some good signal for the respective classes and matches our intuition. We can repeat this for the `description` text feature as well. This information will become useful when we decide how to use our features for modeling.\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"HFifXKl_eKsN\"\n   },\n   \"source\": [\n    \"## ✨ Data Preprocessing\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"RxAZ1AmteRaD\"\n   },\n   \"source\": [\n    \"Preprocessing the data via feature engineering, filtering and cleaning. Certain preprocessing steps are global (don't depend on our dataset, ex. lower casing text, removing stop words, etc.) and others are local (constructs are learned only from the training split, ex. vocabulary, standardization, etc.). For the local, dataset-dependent preprocessing steps, we want to ensure that we [split](https://madewithml.com/courses/mlops/splitting) the data first before preprocessing to avoid data leaks.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import json\\n\",\n    \"import nltk\\n\",\n    \"from nltk.corpus import stopwords\\n\",\n    \"from nltk.stem import PorterStemmer\\n\",\n    \"import re\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"6VgTwEQboTGc\"\n   },\n   \"source\": [\n    \"### Feature engineering\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"U_001GPyMZsC\"\n   },\n   \"source\": [\n    \"We can combine existing input features to create new meaningful signal (helping the model learn). \"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"3x1ldAFQNkSU\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Feature engineering\\n\",\n    \"df[\\\"text\\\"] = df.title + \\\" \\\" + df.description\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Clean text\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"VDXLH6QeLd0F\",\n    \"outputId\": \"2202b045-1830-477a-94ad-85e648946319\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"[nltk_data] Downloading package stopwords to /Users/goku/nltk_data...\\n\",\n      \"[nltk_data]   Package stopwords is already up-to-date!\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"nltk.download(\\\"stopwords\\\")\\n\",\n    \"STOPWORDS = stopwords.words(\\\"english\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"VfdWkkV8LlNR\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def clean_text(text, stopwords=STOPWORDS):\\n\",\n    \"    \\\"\\\"\\\"Clean raw text string.\\\"\\\"\\\"\\n\",\n    \"    # Lower\\n\",\n    \"    text = text.lower()\\n\",\n    \"\\n\",\n    \"    # Remove stopwords\\n\",\n    \"    pattern = re.compile(r'\\\\b(' + r\\\"|\\\".join(stopwords) + r\\\")\\\\b\\\\s*\\\")\\n\",\n    \"    text = pattern.sub('', text)\\n\",\n    \"\\n\",\n    \"    # Spacing and filters\\n\",\n    \"    text = re.sub(r\\\"([!\\\\\\\"'#$%&()*\\\\+,-./:;<=>?@\\\\\\\\\\\\[\\\\]^_`{|}~])\\\", r\\\" \\\\1 \\\", text)  # add spacing\\n\",\n    \"    text = re.sub(\\\"[^A-Za-z0-9]+\\\", \\\" \\\", text)  # remove non alphanumeric chars\\n\",\n    \"    text = re.sub(\\\" +\\\", \\\" \\\", text)  # remove multiple spaces\\n\",\n    \"    text = text.strip()  # strip white space at the ends\\n\",\n    \"    text = re.sub(r\\\"http\\\\S+\\\", \\\"\\\", text)  #  remove links\\n\",\n    \"    \\n\",\n    \"    return text\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"3LRaq0_5LpE4\",\n    \"outputId\": \"4f7beaa6-6713-4e02-80a2-22474260f406\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Comparison between YOLO and RCNN on real world videos Bringing theory to experiment is cool. We can easily train models in colab and find the results in minutes.\\n\",\n      \"comparison yolo rcnn real world videos bringing theory experiment cool easily train models colab find results minutes\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Apply to dataframe\\n\",\n    \"original_df = df.copy()\\n\",\n    \"df.text = df.text.apply(clean_text)\\n\",\n    \"print (f\\\"{original_df.text.values[0]}\\\\n{df.text.values[0]}\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Clean DataFrame\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>text</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>comparison yolo rcnn real world videos bringin...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>show infer tell contextual inference creative ...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>awesome graph classification collection import...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>awesome monte carlo tree search curated list m...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>attentionwalk pytorch implementation watch ste...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"                                                text              tag\\n\",\n       \"0  comparison yolo rcnn real world videos bringin...  computer-vision\\n\",\n       \"1  show infer tell contextual inference creative ...  computer-vision\\n\",\n       \"2  awesome graph classification collection import...            other\\n\",\n       \"3  awesome monte carlo tree search curated list m...            other\\n\",\n       \"4  attentionwalk pytorch implementation watch ste...            other\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# DataFrame cleanup\\n\",\n    \"df = df.drop(columns=[\\\"id\\\", \\\"created_on\\\", \\\"title\\\", \\\"description\\\"], errors=\\\"ignore\\\")  # drop cols\\n\",\n    \"df = df.dropna(subset=[\\\"tag\\\"])  # drop nulls\\n\",\n    \"df = df[[\\\"text\\\", \\\"tag\\\"]]  # rearrange cols\\n\",\n    \"df.head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Label encoding\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"We need to encode our data into numerical values so that our models can process them. We'll start by encoding our text labels into unique indices.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'mlops': 0,\\n\",\n       \" 'natural-language-processing': 1,\\n\",\n       \" 'computer-vision': 2,\\n\",\n       \" 'other': 3}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Label to index\\n\",\n    \"tags = train_df.tag.unique().tolist()\\n\",\n    \"num_classes = len(tags)\\n\",\n    \"class_to_index = {tag: i for i, tag in enumerate(tags)}\\n\",\n    \"class_to_index\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>text</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>comparison yolo rcnn real world videos bringin...</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>show infer tell contextual inference creative ...</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>awesome graph classification collection import...</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>awesome monte carlo tree search curated list m...</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>attentionwalk pytorch implementation watch ste...</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"                                                text  tag\\n\",\n       \"0  comparison yolo rcnn real world videos bringin...    2\\n\",\n       \"1  show infer tell contextual inference creative ...    2\\n\",\n       \"2  awesome graph classification collection import...    3\\n\",\n       \"3  awesome monte carlo tree search curated list m...    3\\n\",\n       \"4  attentionwalk pytorch implementation watch ste...    3\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Encode labels\\n\",\n    \"df[\\\"tag\\\"] = df[\\\"tag\\\"].map(class_to_index)\\n\",\n    \"df.head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def decode(indices, index_to_class):\\n\",\n    \"    return [index_to_class[index] for index in indices]\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"['computer-vision', 'computer-vision', 'other', 'other', 'other']\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"index_to_class = {v:k for k, v in class_to_index.items()}\\n\",\n    \"decode(df.head()[\\\"tag\\\"].values, index_to_class=index_to_class)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Tokenizer\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"Next we'll encode our text as well. Instead of using a random dictionary, we'll use a [tokenizer](https://huggingface.co/allenai/scibert_scivocab_uncased/blob/main/vocab.txt) that was used for a pretrained LLM ([scibert](https://huggingface.co/allenai/scibert_scivocab_uncased)) to tokenize our text. We'll be fine-tuning this exact model later when we train our model.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import numpy as np\\n\",\n    \"from transformers import BertTokenizer\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"input_ids: [[  102  2268  1904   190 29155   168  3267  2998   205   103]]\\n\",\n      \"attention_mask: [[1 1 1 1 1 1 1 1 1 1]]\\n\",\n      \"[CLS] transfer learning with transformers for text classification. [SEP]\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Bert tokenizer\\n\",\n    \"tokenizer = BertTokenizer.from_pretrained(\\\"allenai/scibert_scivocab_uncased\\\", return_dict=False)\\n\",\n    \"text = \\\"Transfer learning with transformers for text classification.\\\"\\n\",\n    \"encoded_inputs = tokenizer([text], return_tensors=\\\"np\\\", padding=\\\"longest\\\")  # pad to longest item in batch\\n\",\n    \"print (\\\"input_ids:\\\", encoded_inputs[\\\"input_ids\\\"])\\n\",\n    \"print (\\\"attention_mask:\\\", encoded_inputs[\\\"attention_mask\\\"])\\n\",\n    \"print (tokenizer.decode(encoded_inputs[\\\"input_ids\\\"][0]))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def tokenize(batch):\\n\",\n    \"    tokenizer = BertTokenizer.from_pretrained(\\\"allenai/scibert_scivocab_uncased\\\", return_dict=False)\\n\",\n    \"    encoded_inputs = tokenizer(batch[\\\"text\\\"].tolist(), return_tensors=\\\"np\\\", padding=\\\"longest\\\")\\n\",\n    \"    return dict(ids=encoded_inputs[\\\"input_ids\\\"], masks=encoded_inputs[\\\"attention_mask\\\"], targets=np.array(batch[\\\"tag\\\"]))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'ids': array([[  102,  2029,  1778,   609,  6446,  4857,  1332,  2399, 13572,\\n\",\n       \"         19125,  1983,  1954,  6240,  3717,  7434,  1262,   537,   201,\\n\",\n       \"          1040,   545,  4714,   103]]),\\n\",\n       \" 'masks': array([[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]),\\n\",\n       \" 'targets': array([2])}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Tokenization\\n\",\n    \"tokenize(df.head(1))\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"<hr>\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"We'll combine all of our preprocessing steps into function:\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def preprocess(df, class_to_index):\\n\",\n    \"    \\\"\\\"\\\"Preprocess the data.\\\"\\\"\\\"\\n\",\n    \"    df[\\\"text\\\"] = df.title + \\\" \\\" + df.description  # feature engineering\\n\",\n    \"    df[\\\"text\\\"] = df.text.apply(clean_text)  # clean text\\n\",\n    \"    df = df.drop(columns=[\\\"id\\\", \\\"created_on\\\", \\\"title\\\", \\\"description\\\"], errors=\\\"ignore\\\")  # clean dataframe\\n\",\n    \"    df = df[[\\\"text\\\", \\\"tag\\\"]]  # rearrange columns\\n\",\n    \"    df[\\\"tag\\\"] = df[\\\"tag\\\"].map(class_to_index)  # label encoding\\n\",\n    \"    outputs = tokenize(df)\\n\",\n    \"    return outputs\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'ids': array([[  102,   856,   532, ...,     0,     0,     0],\\n\",\n       \"        [  102,  2177, 29155, ...,     0,     0,     0],\\n\",\n       \"        [  102,  2180,  3241, ...,     0,     0,     0],\\n\",\n       \"        ...,\\n\",\n       \"        [  102,   453,  2068, ...,  5730,   432,   103],\\n\",\n       \"        [  102, 11268,  1782, ...,     0,     0,     0],\\n\",\n       \"        [  102,  1596,   122, ...,     0,     0,     0]]),\\n\",\n       \" 'masks': array([[1, 1, 1, ..., 0, 0, 0],\\n\",\n       \"        [1, 1, 1, ..., 0, 0, 0],\\n\",\n       \"        [1, 1, 1, ..., 0, 0, 0],\\n\",\n       \"        ...,\\n\",\n       \"        [1, 1, 1, ..., 1, 1, 1],\\n\",\n       \"        [1, 1, 1, ..., 0, 0, 0],\\n\",\n       \"        [1, 1, 1, ..., 0, 0, 0]]),\\n\",\n       \" 'targets': array([0, 1, 1, 1, 1, 2, 1, 2, 3, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 0, 1,\\n\",\n       \"        1, 1, 1, 1, 2, 1, 2, 0, 3, 2, 0, 1, 1, 1, 1, 2, 1, 1, 0, 2, 3, 3,\\n\",\n       \"        3, 0, 2, 1, 3, 3, 1, 1, 1, 1, 2, 1, 2, 2, 2, 3, 2, 1, 1, 3, 1, 0,\\n\",\n       \"        1, 2, 2, 2, 3, 2, 3, 2, 3, 2, 1, 1, 3, 3, 3, 1, 1, 2, 3, 0, 1, 1,\\n\",\n       \"        1, 1, 3, 3, 0, 2, 3, 2, 2, 1, 1, 3, 2, 3, 1, 1, 1, 1, 2, 0, 0, 2,\\n\",\n       \"        1, 1, 2, 2, 1, 1, 0, 3, 1, 2, 2, 1, 0, 2, 3, 1, 3, 1, 2, 3, 1, 1,\\n\",\n       \"        3, 3, 2, 1, 1, 0, 1, 3, 1, 1, 2, 2, 0, 0, 2, 1, 1, 1, 2, 3, 2, 1,\\n\",\n       \"        1, 2, 0, 1, 1, 3, 2, 1, 1, 2, 1, 2, 3, 1, 2, 2, 1, 2, 1, 2, 1, 3,\\n\",\n       \"        2, 2, 0, 1, 2, 2, 1, 2, 2, 1, 3, 2, 2, 1, 2, 2, 3, 2, 1, 1, 1, 1,\\n\",\n       \"        2, 2, 2, 0, 2, 1, 0, 2, 1, 3, 1, 1, 1, 1, 2, 1, 3, 3, 2, 1, 0, 1,\\n\",\n       \"        2, 0, 2, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2,\\n\",\n       \"        0, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 3, 2, 1, 0, 2, 1, 2, 2, 1,\\n\",\n       \"        1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 3, 2, 1, 2, 0, 2, 2, 1, 2, 3,\\n\",\n       \"        2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 2, 2,\\n\",\n       \"        2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 1, 2, 2, 1, 3, 3, 0, 1, 3,\\n\",\n       \"        0, 2, 1, 1, 1, 1, 1, 0, 2, 1, 3, 2, 1, 2, 2, 1, 1, 3, 0, 3, 3, 2,\\n\",\n       \"        1, 1, 3, 3, 2, 3, 1, 1, 3, 1, 0, 1, 1, 1, 3, 0, 2, 2, 2, 1, 1, 2,\\n\",\n       \"        2, 1, 3, 2, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 0, 3, 0, 1, 2, 1,\\n\",\n       \"        3, 2, 3, 2, 2, 0, 2, 3, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1,\\n\",\n       \"        2, 2, 1, 2, 1, 1, 2, 2, 3, 1, 2, 2, 3, 2, 1, 1, 2, 0, 2, 0, 1, 1,\\n\",\n       \"        2, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 2, 1, 0, 3, 1, 3, 2, 2, 1, 1, 3,\\n\",\n       \"        2, 1, 2, 1, 3, 1, 2, 2, 1, 2, 2, 2, 1, 0, 3, 2, 1, 3, 1, 1, 2, 1,\\n\",\n       \"        2, 2, 0, 1, 2, 1, 2, 2, 3, 1, 1, 2, 2, 1, 2, 2, 0, 0, 1, 2, 1, 1,\\n\",\n       \"        2, 1, 1, 2, 1, 1, 3, 2, 3, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 1, 1, 1,\\n\",\n       \"        1, 1, 2, 1, 3, 1, 0, 2, 1, 3, 1, 2, 2, 1, 0, 2, 3, 2, 3, 2, 1, 1,\\n\",\n       \"        1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 2, 2, 2, 1, 2, 0, 1, 0, 1, 2, 2, 1,\\n\",\n       \"        2, 3, 2, 1, 2, 2, 2, 3, 1, 3, 2, 1, 2, 2, 2, 1, 3, 1, 1, 2, 2, 1,\\n\",\n       \"        2, 3, 2, 2, 0, 1, 2, 2, 2, 0, 1, 2, 1, 3, 0, 2, 3])}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Apply\\n\",\n    \"preprocess(df=train_df, class_to_index=class_to_index)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Distributed preprocessing\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"The main issue with our approach above is that we're limited by our single machine in terms how much data our dataframe can hold and that we can preprocess. With the increasing trend in ML for larger unstructured datasets and larger models (LLMs), we can quickly outgrow our single machine constraints and will need to go distributed.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from madewithml.data import stratify_split\\n\",\n    \"ray.data.DatasetContext.get_current().execution_options.preserve_order = True\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:26:57,951\\tINFO read_api.py:406 -- To satisfy the requested parallelism of 24, each read task output is split into 24 smaller blocks.\\n\",\n      \"2023-12-07 11:26:57,959\\tINFO dataset.py:2380 -- Tip: Use `take_batch()` instead of `take() / show()` to return records in pandas or numpy batch format.\\n\",\n      \"2023-12-07 11:26:57,960\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(24)] -> AllToAllOperator[RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-12-07 11:26:57,961\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-12-07 11:26:57,961\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'id': 695,\\n\",\n       \"  'created_on': datetime.datetime(2020, 5, 2, 21, 33, 31),\\n\",\n       \"  'title': 'Five Cool Python Libraries for Data Science',\\n\",\n       \"  'description': 'Python is a best friend for the majority of the Data Scientists. Libraries make their life simpler. I have come across five cool Python libraries while working ',\\n\",\n       \"  'tag': 'natural-language-processing'}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Data ingestion\\n\",\n    \"ds = ray.data.read_csv(DATASET_LOC)\\n\",\n    \"ds = ds.random_shuffle(seed=1234)\\n\",\n    \"ds.take(1)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:26:59,973\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(24)] -> AllToAllOperator[RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-12-07 11:26:59,974\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-12-07 11:26:59,974\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Split dataset\\n\",\n    \"test_size = 0.2\\n\",\n    \"train_ds, val_ds = stratify_split(ds, stratify=\\\"tag\\\", test_size=test_size)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:27:00,813\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(24)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-12-07 11:27:00,813\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-12-07 11:27:00,814\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/24 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:27:01,560\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(24)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> AllToAllOperator[Aggregate] -> TaskPoolMapOperator[MapBatches(<lambda>)]\\n\",\n      \"2023-12-07 11:27:01,561\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-12-07 11:27:01,562\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Aggregate 11:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 12:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 13:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/24 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/24 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Mapping\\n\",\n    \"tags = train_ds.unique(column=\\\"tag\\\")\\n\",\n    \"class_to_index = {tag: i for i, tag in enumerate(tags)}\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:27:02,546\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(24)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)] -> LimitOperator[limit=1]\\n\",\n      \"2023-12-07 11:27:02,546\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-12-07 11:27:02,546\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/24 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{'ids': array([  102, 15820, 30126,   796, 15820, 30126,   796, 11669,   446,\\n\",\n      \"        3396, 17192,  9096, 15522,  1966, 15820, 30126,   487, 13387,\\n\",\n      \"         544,  3808,  4912,  6283,  2886, 19188,  1967,   881,   103,\\n\",\n      \"           0,     0]), 'masks': array([1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\\n\",\n      \"       1, 1, 1, 1, 1, 0, 0]), 'targets': 2}\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess) pid=21398)\\u001b[0m Exception ignored in: <function Dataset.__del__ at 0x11b824e50>\\n\",\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess) pid=21398)\\u001b[0m Traceback (most recent call last):\\n\",\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess) pid=21398)\\u001b[0m   File \\\"/Users/goku/Documents/tobias/venv/lib/python3.10/site-packages/ray/data/dataset.py\\\", line 5222, in __del__\\n\",\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess) pid=21398)\\u001b[0m     if self._current_executor and ray is not None and ray.is_initialized():\\n\",\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess) pid=21398)\\u001b[0m KeyboardInterrupt: \\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Distributed preprocessing\\n\",\n    \"sample_ds = train_ds.map_batches(preprocess, fn_kwargs={\\\"class_to_index\\\": class_to_index}, batch_format=\\\"pandas\\\")\\n\",\n    \"sample_ds.show(1)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"lGvI2YuuNkSX\",\n    \"tags\": []\n   },\n   \"source\": [\n    \"# Training\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"When developing models, it's always a best practice to start with the simplest models and slowly motivate more complex models. For example our baseline model progression would be: \\n\",\n    \"\\n\",\n    \"1. random model (predict labels randomly)\\n\",\n    \"2. rule-based model (pattern match labels in input text)\\n\",\n    \"3. logistic regression (td-idf vectors from text)\\n\",\n    \"4. CNN (apply character filters over text)\\n\",\n    \"5. Fine-tune LLM (this notebook)\\n\",\n    \"\\n\",\n    \"We cover all of these methods in our [other lessons](https://madewithml.com/#foundations) but since our focus here in on MLOps, we will skip directly to fine-tuning an LLM for our task.\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"K9CfUuNh2YLE\"\n   },\n   \"source\": [\n    \"We'll first set up some functions that will help us achieve complete reproducibility.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"86sFERmsuPQl\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import os\\n\",\n    \"import random\\n\",\n    \"import torch\\n\",\n    \"from ray.data.preprocessor import Preprocessor\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"NXd8flJuNkSY\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def set_seeds(seed=42):\\n\",\n    \"    \\\"\\\"\\\"Set seeds for reproducibility.\\\"\\\"\\\"\\n\",\n    \"    np.random.seed(seed)\\n\",\n    \"    random.seed(seed)\\n\",\n    \"    torch.manual_seed(seed)\\n\",\n    \"    torch.cuda.manual_seed(seed)\\n\",\n    \"    eval(\\\"setattr(torch.backends.cudnn, 'deterministic', True)\\\")\\n\",\n    \"    eval(\\\"setattr(torch.backends.cudnn, 'benchmark', False)\\\")\\n\",\n    \"    os.environ[\\\"PYTHONHASHSEED\\\"] = str(seed)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def load_data(num_samples=None):\\n\",\n    \"    ds = ray.data.read_csv(DATASET_LOC)\\n\",\n    \"    ds = ds.random_shuffle(seed=1234)\\n\",\n    \"    ds = ray.data.from_items(ds.take(num_samples)) if num_samples else ds\\n\",\n    \"    return ds\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"class CustomPreprocessor():\\n\",\n    \"    \\\"\\\"\\\"Custom preprocessor class.\\\"\\\"\\\"\\n\",\n    \"    def __init__(self, class_to_index={}):\\n\",\n    \"        self.class_to_index = class_to_index or {}  # mutable defaults\\n\",\n    \"        self.index_to_class = {v: k for k, v in self.class_to_index.items()}\\n\",\n    \"        \\n\",\n    \"    def fit(self, ds):\\n\",\n    \"        tags = ds.unique(column=\\\"tag\\\")\\n\",\n    \"        self.class_to_index = {tag: i for i, tag in enumerate(tags)}\\n\",\n    \"        self.index_to_class = {v:k for k, v in self.class_to_index.items()}\\n\",\n    \"        return self\\n\",\n    \"    \\n\",\n    \"    def transform(self, ds):\\n\",\n    \"        return ds.map_batches(\\n\",\n    \"            preprocess, \\n\",\n    \"            fn_kwargs={\\\"class_to_index\\\": self.class_to_index}, \\n\",\n    \"            batch_format=\\\"pandas\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"## 🤖 Model\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import torch.nn as nn\\n\",\n    \"from transformers import BertModel\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Some weights of the model checkpoint at allenai/scibert_scivocab_uncased were not used when initializing BertModel: ['cls.predictions.decoder.weight', 'cls.predictions.transform.dense.bias', 'cls.predictions.bias', 'cls.seq_relationship.weight', 'cls.seq_relationship.bias', 'cls.predictions.transform.LayerNorm.weight', 'cls.predictions.transform.LayerNorm.bias', 'cls.predictions.transform.dense.weight', 'cls.predictions.decoder.bias']\\n\",\n      \"- This IS expected if you are initializing BertModel from the checkpoint of a model trained on another task or with another architecture (e.g. initializing a BertForSequenceClassification model from a BertForPreTraining model).\\n\",\n      \"- This IS NOT expected if you are initializing BertModel from the checkpoint of a model that you expect to be exactly identical (initializing a BertForSequenceClassification model from a BertForSequenceClassification model).\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Pretrained LLM\\n\",\n    \"llm = BertModel.from_pretrained(\\\"allenai/scibert_scivocab_uncased\\\", return_dict=False)\\n\",\n    \"embedding_dim = llm.config.hidden_size\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"(torch.Size([1, 10, 768]), torch.Size([1, 768]))\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Sample\\n\",\n    \"text = \\\"Transfer learning with transformers for text classification.\\\"\\n\",\n    \"batch = tokenizer([text], return_tensors=\\\"np\\\", padding=\\\"longest\\\")\\n\",\n    \"batch = {k:torch.tensor(v) for k,v in batch.items()}  # convert to torch tensors\\n\",\n    \"seq, pool = llm(input_ids=batch[\\\"input_ids\\\"], attention_mask=batch[\\\"attention_mask\\\"])\\n\",\n    \"np.shape(seq), np.shape(pool)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"class FinetunedLLM(nn.Module):\\n\",\n    \"    def __init__(self, llm, dropout_p, embedding_dim, num_classes):\\n\",\n    \"        super(FinetunedLLM, self).__init__()\\n\",\n    \"        self.llm = llm\\n\",\n    \"        self.dropout_p = dropout_p\\n\",\n    \"        self.embedding_dim = embedding_dim\\n\",\n    \"        self.num_classes = num_classes\\n\",\n    \"        self.dropout = torch.nn.Dropout(dropout_p)\\n\",\n    \"        self.fc1 = torch.nn.Linear(embedding_dim, num_classes)\\n\",\n    \"\\n\",\n    \"    def forward(self, batch):\\n\",\n    \"        ids, masks = batch[\\\"ids\\\"], batch[\\\"masks\\\"]\\n\",\n    \"        seq, pool = self.llm(input_ids=ids, attention_mask=masks)\\n\",\n    \"        z = self.dropout(pool)\\n\",\n    \"        z = self.fc1(z)\\n\",\n    \"        return z\\n\",\n    \"    \\n\",\n    \"    @torch.inference_mode()\\n\",\n    \"    def predict(self, batch):\\n\",\n    \"        self.eval()\\n\",\n    \"        z = self(batch)\\n\",\n    \"        y_pred = torch.argmax(z, dim=1).cpu().numpy()\\n\",\n    \"        return y_pred\\n\",\n    \"    \\n\",\n    \"    @torch.inference_mode()\\n\",\n    \"    def predict_proba(self, batch):\\n\",\n    \"        self.eval()\\n\",\n    \"        z = self(batch)\\n\",\n    \"        y_probs = F.softmax(z, dim=1).cpu().numpy()\\n\",\n    \"        return y_probs\\n\",\n    \"    \\n\",\n    \"    def save(self, dp):\\n\",\n    \"        with open(Path(dp, \\\"args.json\\\"), \\\"w\\\") as fp:\\n\",\n    \"            contents = {\\n\",\n    \"                \\\"dropout_p\\\": self.dropout_p,\\n\",\n    \"                \\\"embedding_dim\\\": self.embedding_dim,\\n\",\n    \"                \\\"num_classes\\\": self.num_classes,\\n\",\n    \"            }\\n\",\n    \"            json.dump(contents, fp, indent=4, sort_keys=False)\\n\",\n    \"        torch.save(self.state_dict(), os.path.join(dp, \\\"model.pt\\\"))\\n\",\n    \"\\n\",\n    \"    @classmethod\\n\",\n    \"    def load(cls, args_fp, state_dict_fp):\\n\",\n    \"        with open(args_fp, \\\"r\\\") as fp:\\n\",\n    \"            kwargs = json.load(fp=fp)\\n\",\n    \"        llm = BertModel.from_pretrained(\\\"allenai/scibert_scivocab_uncased\\\", return_dict=False)\\n\",\n    \"        model = cls(llm=llm, **kwargs)\\n\",\n    \"        model.load_state_dict(torch.load(state_dict_fp, map_location=torch.device(\\\"cpu\\\")))\\n\",\n    \"        return model\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"<bound method Module.named_parameters of FinetunedLLM(\\n\",\n      \"  (llm): BertModel(\\n\",\n      \"    (embeddings): BertEmbeddings(\\n\",\n      \"      (word_embeddings): Embedding(31090, 768, padding_idx=0)\\n\",\n      \"      (position_embeddings): Embedding(512, 768)\\n\",\n      \"      (token_type_embeddings): Embedding(2, 768)\\n\",\n      \"      (LayerNorm): LayerNorm((768,), eps=1e-12, elementwise_affine=True)\\n\",\n      \"      (dropout): Dropout(p=0.1, inplace=False)\\n\",\n      \"    )\\n\",\n      \"    (encoder): BertEncoder(\\n\",\n      \"      (layer): ModuleList(\\n\",\n      \"        (0-11): 12 x BertLayer(\\n\",\n      \"          (attention): BertAttention(\\n\",\n      \"            (self): BertSelfAttention(\\n\",\n      \"              (query): Linear(in_features=768, out_features=768, bias=True)\\n\",\n      \"              (key): Linear(in_features=768, out_features=768, bias=True)\\n\",\n      \"              (value): Linear(in_features=768, out_features=768, bias=True)\\n\",\n      \"              (dropout): Dropout(p=0.1, inplace=False)\\n\",\n      \"            )\\n\",\n      \"            (output): BertSelfOutput(\\n\",\n      \"              (dense): Linear(in_features=768, out_features=768, bias=True)\\n\",\n      \"              (LayerNorm): LayerNorm((768,), eps=1e-12, elementwise_affine=True)\\n\",\n      \"              (dropout): Dropout(p=0.1, inplace=False)\\n\",\n      \"            )\\n\",\n      \"          )\\n\",\n      \"          (intermediate): BertIntermediate(\\n\",\n      \"            (dense): Linear(in_features=768, out_features=3072, bias=True)\\n\",\n      \"            (intermediate_act_fn): GELUActivation()\\n\",\n      \"          )\\n\",\n      \"          (output): BertOutput(\\n\",\n      \"            (dense): Linear(in_features=3072, out_features=768, bias=True)\\n\",\n      \"            (LayerNorm): LayerNorm((768,), eps=1e-12, elementwise_affine=True)\\n\",\n      \"            (dropout): Dropout(p=0.1, inplace=False)\\n\",\n      \"          )\\n\",\n      \"        )\\n\",\n      \"      )\\n\",\n      \"    )\\n\",\n      \"    (pooler): BertPooler(\\n\",\n      \"      (dense): Linear(in_features=768, out_features=768, bias=True)\\n\",\n      \"      (activation): Tanh()\\n\",\n      \"    )\\n\",\n      \"  )\\n\",\n      \"  (dropout): Dropout(p=0.5, inplace=False)\\n\",\n      \"  (fc1): Linear(in_features=768, out_features=4, bias=True)\\n\",\n      \")>\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Initialize model\\n\",\n    \"model = FinetunedLLM(llm=llm, dropout_p=0.5, embedding_dim=embedding_dim, num_classes=num_classes)\\n\",\n    \"print (model.named_parameters)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"## 📦 Batching\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"We can iterate through our dataset in batches however we may have batches of different sizes. Recall that our tokenizer padded the inputs to the longest item in the batch (`padding=\\\"longest\\\"`). However, our batches for training will be smaller than our large data processing batches and so our batches here may have inputs with different lengths. To address this, we're going to define a custom `collate_fn` to repad the items in our training batches.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Created a temporary directory at /var/folders/x8/ffj4btjx0cv6r653rgfnffsc0000gn/T/tmpfieao6lq\\n\",\n      \"Writing /var/folders/x8/ffj4btjx0cv6r653rgfnffsc0000gn/T/tmpfieao6lq/_remote_module_non_scriptable.py\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"from ray.train.torch import get_device\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def pad_array(arr, dtype=np.int32):\\n\",\n    \"    max_len = max(len(row) for row in arr)\\n\",\n    \"    padded_arr = np.zeros((arr.shape[0], max_len), dtype=dtype)\\n\",\n    \"    for i, row in enumerate(arr):\\n\",\n    \"        padded_arr[i][:len(row)] = row\\n\",\n    \"    return padded_arr\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def collate_fn(batch):\\n\",\n    \"    batch[\\\"ids\\\"] = pad_array(batch[\\\"ids\\\"])\\n\",\n    \"    batch[\\\"masks\\\"] = pad_array(batch[\\\"masks\\\"])\\n\",\n    \"    dtypes = {\\\"ids\\\": torch.int32, \\\"masks\\\": torch.int32, \\\"targets\\\": torch.int64}\\n\",\n    \"    tensor_batch = {}\\n\",\n    \"    for key, array in batch.items():\\n\",\n    \"        tensor_batch[key] = torch.as_tensor(array, dtype=dtypes[key], device=get_device())\\n\",\n    \"    return tensor_batch\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"> `pad=(0, max_len)` in [F.pad](https://pytorch.org/docs/stable/generated/torch.nn.functional.pad.html#torch-nn-functional-pad) refers to (left_padding, right_padding) on the input. There will be no left-padding (hence the `0`) and only right-padding. And the `constant` mode refers to each element being padded to a constant size (size of longest element in the input).\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-12-07 11:27:34,483\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(24)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)] -> LimitOperator[limit=128]\\n\",\n      \"2023-12-07 11:27:34,484\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-12-07 11:27:34,484\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/576 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/24 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'ids': tensor([[  102,   638, 30108,  ...,     0,     0,     0],\\n\",\n       \"         [  102, 11448, 20591,  ...,     0,     0,     0],\\n\",\n       \"         [  102, 13564,  1995,  ...,     0,     0,     0],\\n\",\n       \"         ...,\\n\",\n       \"         [  102, 18403, 30114,  ...,     0,     0,     0],\\n\",\n       \"         [  102,  2567,  1995,  ...,     0,     0,     0],\\n\",\n       \"         [  102,   239, 30118,  ..., 24660, 30131,   103]], dtype=torch.int32),\\n\",\n       \" 'masks': tensor([[1, 1, 1,  ..., 0, 0, 0],\\n\",\n       \"         [1, 1, 1,  ..., 0, 0, 0],\\n\",\n       \"         [1, 1, 1,  ..., 0, 0, 0],\\n\",\n       \"         ...,\\n\",\n       \"         [1, 1, 1,  ..., 0, 0, 0],\\n\",\n       \"         [1, 1, 1,  ..., 0, 0, 0],\\n\",\n       \"         [1, 1, 1,  ..., 1, 1, 1]], dtype=torch.int32),\\n\",\n       \" 'targets': tensor([0, 0, 3, 0, 0, 0, 2, 1, 2, 2, 0, 3, 3, 0, 0, 2, 2, 2, 1, 0, 2, 3, 2, 1,\\n\",\n       \"         2, 0, 2, 2, 0, 0, 3, 0, 0, 0, 2, 1, 2, 2, 0, 3, 3, 0, 0, 2, 2, 2, 1, 0,\\n\",\n       \"         2, 3, 2, 1, 2, 0, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 3, 2, 3, 2, 2,\\n\",\n       \"         2, 0, 2, 3, 2, 3, 0, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 2, 1, 2, 2,\\n\",\n       \"         2, 1, 0, 2, 2, 1, 0, 2, 2, 0, 2, 0, 2, 2, 0, 0, 0, 0, 2, 2, 2, 2, 0, 0,\\n\",\n       \"         0, 2, 2, 0, 2, 2, 0, 0])}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Sample batch\\n\",\n    \"sample_batch = sample_ds.take_batch(batch_size=128)\\n\",\n    \"collate_fn(batch=sample_batch)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"## 🧮 Utilities\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from pathlib import Path\\n\",\n    \"import ray.train as train\\n\",\n    \"from ray.train import Checkpoint, CheckpointConfig, DataConfig, RunConfig, ScalingConfig\\n\",\n    \"from ray.train.torch import TorchCheckpoint, TorchTrainer\\n\",\n    \"import tempfile\\n\",\n    \"import torch.nn.functional as F\\n\",\n    \"from torch.nn.parallel.distributed import DistributedDataParallel\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def train_step(ds, batch_size, model, num_classes, loss_fn, optimizer):\\n\",\n    \"    \\\"\\\"\\\"Train step.\\\"\\\"\\\"\\n\",\n    \"    model.train()\\n\",\n    \"    loss = 0.0\\n\",\n    \"    ds_generator = ds.iter_torch_batches(batch_size=batch_size, collate_fn=collate_fn)\\n\",\n    \"    for i, batch in enumerate(ds_generator):\\n\",\n    \"        optimizer.zero_grad()  # reset gradients\\n\",\n    \"        z = model(batch)  # forward pass\\n\",\n    \"        targets = F.one_hot(batch[\\\"targets\\\"], num_classes=num_classes).float()  # one-hot (for loss_fn)\\n\",\n    \"        J = loss_fn(z, targets)  # define loss\\n\",\n    \"        J.backward()  # backward pass\\n\",\n    \"        optimizer.step()  # update weights\\n\",\n    \"        loss += (J.detach().item() - loss) / (i + 1)  # cumulative loss\\n\",\n    \"    return loss\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def eval_step(ds, batch_size, model, num_classes, loss_fn):\\n\",\n    \"    \\\"\\\"\\\"Eval step.\\\"\\\"\\\"\\n\",\n    \"    model.eval()\\n\",\n    \"    loss = 0.0\\n\",\n    \"    y_trues, y_preds = [], []\\n\",\n    \"    ds_generator = ds.iter_torch_batches(batch_size=batch_size, collate_fn=collate_fn)\\n\",\n    \"    with torch.inference_mode():\\n\",\n    \"        for i, batch in enumerate(ds_generator):\\n\",\n    \"            z = model(batch)\\n\",\n    \"            targets = F.one_hot(batch[\\\"targets\\\"], num_classes=num_classes).float()  # one-hot (for loss_fn)\\n\",\n    \"            J = loss_fn(z, targets).item()\\n\",\n    \"            loss += (J - loss) / (i + 1)\\n\",\n    \"            y_trues.extend(batch[\\\"targets\\\"].cpu().numpy())\\n\",\n    \"            y_preds.extend(torch.argmax(z, dim=1).cpu().numpy())\\n\",\n    \"    return loss, np.vstack(y_trues), np.vstack(y_preds)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Training loop\\n\",\n    \"def train_loop_per_worker(config):\\n\",\n    \"    # Hyperparameters\\n\",\n    \"    dropout_p = config[\\\"dropout_p\\\"]\\n\",\n    \"    lr = config[\\\"lr\\\"]\\n\",\n    \"    lr_factor = config[\\\"lr_factor\\\"]\\n\",\n    \"    lr_patience = config[\\\"lr_patience\\\"]\\n\",\n    \"    num_epochs = config[\\\"num_epochs\\\"]\\n\",\n    \"    batch_size = config[\\\"batch_size\\\"]\\n\",\n    \"    num_classes = config[\\\"num_classes\\\"]\\n\",\n    \"\\n\",\n    \"    # Get datasets\\n\",\n    \"    set_seeds()\\n\",\n    \"    train_ds = train.get_dataset_shard(\\\"train\\\")\\n\",\n    \"    val_ds = train.get_dataset_shard(\\\"val\\\")\\n\",\n    \"\\n\",\n    \"    # Model\\n\",\n    \"    llm = BertModel.from_pretrained(\\\"allenai/scibert_scivocab_uncased\\\", return_dict=False)\\n\",\n    \"    model = FinetunedLLM(llm=llm, dropout_p=dropout_p, embedding_dim=llm.config.hidden_size, num_classes=num_classes)\\n\",\n    \"    model = train.torch.prepare_model(model)\\n\",\n    \"\\n\",\n    \"    # Training components\\n\",\n    \"    loss_fn = nn.BCEWithLogitsLoss()\\n\",\n    \"    optimizer = torch.optim.Adam(model.parameters(), lr=lr)\\n\",\n    \"    scheduler = torch.optim.lr_scheduler.ReduceLROnPlateau(optimizer, mode=\\\"min\\\", factor=lr_factor, patience=lr_patience)\\n\",\n    \"\\n\",\n    \"    # Training\\n\",\n    \"    num_workers = train.get_context().get_world_size()\\n\",\n    \"    batch_size_per_worker = batch_size // num_workers\\n\",\n    \"    for epoch in range(num_epochs):\\n\",\n    \"        # Step\\n\",\n    \"        train_loss = train_step(train_ds, batch_size_per_worker, model, num_classes, loss_fn, optimizer)\\n\",\n    \"        val_loss, _, _ = eval_step(val_ds, batch_size_per_worker, model, num_classes, loss_fn)\\n\",\n    \"        scheduler.step(val_loss)\\n\",\n    \"\\n\",\n    \"        # Checkpoint\\n\",\n    \"        with tempfile.TemporaryDirectory() as dp:\\n\",\n    \"            if isinstance(model, DistributedDataParallel):  # cpu\\n\",\n    \"                model.module.save(dp=dp)\\n\",\n    \"            else:\\n\",\n    \"                model.save(dp=dp)\\n\",\n    \"            metrics = dict(epoch=epoch, lr=optimizer.param_groups[0][\\\"lr\\\"], train_loss=train_loss, val_loss=val_loss)\\n\",\n    \"            checkpoint = Checkpoint.from_directory(dp)\\n\",\n    \"            train.report(metrics, checkpoint=checkpoint)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"Our dataset doesn't suffer from horrible class imbalance, but if it did, we could easily account for it through our loss function. There are also other strategies such as [over-sampling](https://imbalanced-learn.org/stable/over_sampling.html) less frequent classes and [under-sampling](https://imbalanced-learn.org/stable/under_sampling.html) popular classes.\\n\",\n    \"\\n\",\n    \"```python\\n\",\n    \"# Class weights\\n\",\n    \"batch_counts = []\\n\",\n    \"for batch in train_ds.iter_torch_batches(batch_size=256, collate_fn=collate_fn):\\n\",\n    \"    batch_counts.append(np.bincount(batch[\\\"targets\\\"].cpu().numpy()))\\n\",\n    \"counts = [sum(count) for count in zip(*batch_counts)]\\n\",\n    \"class_weights = np.array([1.0/count for i, count in enumerate(counts)])\\n\",\n    \"class_weights_tensor = torch.Tensor(class_weights).to(get_device())\\n\",\n    \"\\n\",\n    \"# Training components\\n\",\n    \"loss_fn = nn.BCEWithLogitsLoss(weight=class_weights_tensor)\\n\",\n    \"...\\n\",\n    \"```\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"## 🗂️ Configurations\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from madewithml.config import EFS_DIR\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Train loop config\\n\",\n    \"train_loop_config = {\\n\",\n    \"    \\\"dropout_p\\\": 0.5,\\n\",\n    \"    \\\"lr\\\": 1e-4,\\n\",\n    \"    \\\"lr_factor\\\": 0.8,\\n\",\n    \"    \\\"lr_patience\\\": 3,\\n\",\n    \"    \\\"num_epochs\\\": 10,\\n\",\n    \"    \\\"batch_size\\\": 256,\\n\",\n    \"    \\\"num_classes\\\": num_classes,\\n\",\n    \"}\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Scaling config\\n\",\n    \"scaling_config = ScalingConfig(\\n\",\n    \"    num_workers=num_workers,\\n\",\n    \"    use_gpu=bool(resources_per_worker[\\\"GPU\\\"]),\\n\",\n    \"    resources_per_worker=resources_per_worker\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Run config\\n\",\n    \"checkpoint_config = CheckpointConfig(num_to_keep=1, checkpoint_score_attribute=\\\"val_loss\\\", checkpoint_score_order=\\\"min\\\")\\n\",\n    \"run_config = RunConfig(name=\\\"llm\\\", checkpoint_config=checkpoint_config, storage_path=EFS_DIR)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"## 🚂 Training\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-18 21:57:50,561\\tINFO read_api.py:406 -- To satisfy the requested parallelism of 64, each read task output is split into 64 smaller blocks.\\n\",\n      \"2023-09-18 21:57:50,565\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-18 21:57:50,565\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-18 21:57:50,566\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Dataset\\n\",\n    \"ds = load_data()\\n\",\n    \"train_ds, val_ds = stratify_split(ds, stratify=\\\"tag\\\", test_size=test_size)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-18 21:57:51,011\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-18 21:57:51,012\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-18 21:57:51,012\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-18 21:57:53,336\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> AllToAllOperator[Aggregate] -> TaskPoolMapOperator[MapBatches(<lambda>)]\\n\",\n      \"2023-09-18 21:57:53,337\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-18 21:57:53,338\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Aggregate 11:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 12:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 13:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-18 21:57:54,975\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)]\\n\",\n      \"2023-09-18 21:57:54,977\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-18 21:57:54,977\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-18 21:57:56,897\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)]\\n\",\n      \"2023-09-18 21:57:56,897\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-18 21:57:56,898\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"72c0d4598c23424b84a260a96734b4ee\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"74b3ba0e4d00446fbaf05eee2c653c4e\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"df8859dc1a4b46039854f6c27a396202\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"adebf2cf5b4648cb883bdd5b4682b01e\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"696e4c45121042158d4757b5b8635a68\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"e331b9efb4e14b068bb0ebce50dd7322\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Preprocess\\n\",\n    \"preprocessor = CustomPreprocessor()\\n\",\n    \"preprocessor =  preprocessor.fit(train_ds)\\n\",\n    \"train_ds = preprocessor.transform(train_ds)\\n\",\n    \"val_ds = preprocessor.transform(val_ds)\\n\",\n    \"train_ds = train_ds.materialize()\\n\",\n    \"val_ds = val_ds.materialize()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Dataset config\\n\",\n    \"options = ray.data.ExecutionOptions(preserve_order=True)\\n\",\n    \"dataset_config = DataConfig(\\n\",\n    \"    datasets_to_split=[\\\"train\\\"],\\n\",\n    \"    execution_options=options)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Trainer\\n\",\n    \"trainer = TorchTrainer(\\n\",\n    \"    train_loop_per_worker=train_loop_per_worker,\\n\",\n    \"    train_loop_config=train_loop_config,\\n\",\n    \"    scaling_config=scaling_config,\\n\",\n    \"    run_config=run_config,\\n\",\n    \"    datasets={\\\"train\\\": train_ds, \\\"val\\\": val_ds},\\n\",\n    \"    dataset_config=dataset_config,\\n\",\n    \"    metadata={\\\"class_to_index\\\": preprocessor.class_to_index}\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div class=\\\"tuneStatus\\\">\\n\",\n       \"  <div style=\\\"display: flex;flex-direction: row\\\">\\n\",\n       \"    <div style=\\\"display: flex;flex-direction: column;\\\">\\n\",\n       \"      <h3>Tune Status</h3>\\n\",\n       \"      <table>\\n\",\n       \"<tbody>\\n\",\n       \"<tr><td>Current time:</td><td>2023-09-18 21:59:12</td></tr>\\n\",\n       \"<tr><td>Running for: </td><td>00:01:13.39        </td></tr>\\n\",\n       \"<tr><td>Memory:      </td><td>22.2/62.1 GiB      </td></tr>\\n\",\n       \"</tbody>\\n\",\n       \"</table>\\n\",\n       \"    </div>\\n\",\n       \"    <div class=\\\"vDivider\\\"></div>\\n\",\n       \"    <div class=\\\"systemInfo\\\">\\n\",\n       \"      <h3>System Info</h3>\\n\",\n       \"      Using FIFO scheduling algorithm.<br>Logical resource usage: 4.0/32 CPUs, 1.0/2 GPUs (0.0/2.0 accelerator_type:A10G)\\n\",\n       \"    </div>\\n\",\n       \"    \\n\",\n       \"  </div>\\n\",\n       \"  <div class=\\\"hDivider\\\"></div>\\n\",\n       \"  <div class=\\\"trialStatus\\\">\\n\",\n       \"    <h3>Trial Status</h3>\\n\",\n       \"    <table>\\n\",\n       \"<thead>\\n\",\n       \"<tr><th>Trial name              </th><th>status    </th><th>loc               </th><th style=\\\"text-align: right;\\\">  iter</th><th style=\\\"text-align: right;\\\">  total time (s)</th><th style=\\\"text-align: right;\\\">  epoch</th><th style=\\\"text-align: right;\\\">    lr</th><th style=\\\"text-align: right;\\\">  train_loss</th></tr>\\n\",\n       \"</thead>\\n\",\n       \"<tbody>\\n\",\n       \"<tr><td>TorchTrainer_1a81f_00000</td><td>TERMINATED</td><td>10.0.34.101:727773</td><td style=\\\"text-align: right;\\\">    10</td><td style=\\\"text-align: right;\\\">         68.3685</td><td style=\\\"text-align: right;\\\">      9</td><td style=\\\"text-align: right;\\\">0.0001</td><td style=\\\"text-align: right;\\\">   0.0525064</td></tr>\\n\",\n       \"</tbody>\\n\",\n       \"</table>\\n\",\n       \"  </div>\\n\",\n       \"</div>\\n\",\n       \"<style>\\n\",\n       \".tuneStatus {\\n\",\n       \"  color: var(--jp-ui-font-color1);\\n\",\n       \"}\\n\",\n       \".tuneStatus .systemInfo {\\n\",\n       \"  display: flex;\\n\",\n       \"  flex-direction: column;\\n\",\n       \"}\\n\",\n       \".tuneStatus td {\\n\",\n       \"  white-space: nowrap;\\n\",\n       \"}\\n\",\n       \".tuneStatus .trialStatus {\\n\",\n       \"  display: flex;\\n\",\n       \"  flex-direction: column;\\n\",\n       \"}\\n\",\n       \".tuneStatus h3 {\\n\",\n       \"  font-weight: bold;\\n\",\n       \"}\\n\",\n       \".tuneStatus .hDivider {\\n\",\n       \"  border-bottom-width: var(--jp-border-width);\\n\",\n       \"  border-bottom-color: var(--jp-border-color0);\\n\",\n       \"  border-bottom-style: solid;\\n\",\n       \"}\\n\",\n       \".tuneStatus .vDivider {\\n\",\n       \"  border-left-width: var(--jp-border-width);\\n\",\n       \"  border-left-color: var(--jp-border-color0);\\n\",\n       \"  border-left-style: solid;\\n\",\n       \"  margin: 0.5em 1em 0.5em 1em;\\n\",\n       \"}\\n\",\n       \"</style>\\n\"\n      ],\n      \"text/plain\": [\n       \"<IPython.core.display.HTML object>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(TorchTrainer pid=727773, ip=10.0.34.101)\\u001b[0m Starting distributed worker processes: ['727834 (10.0.34.101)']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Setting up process group for: env:// [rank=0, world_size=1]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Auto configuring locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Moving model to device: cuda:0\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000000)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000001)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000002)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000003)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000004)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000005)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000006)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000007)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000008)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=727900, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=727900, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=727834, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_1a81f_00000_0_2023-09-18_21-57-58/checkpoint_000009)\\n\",\n      \"2023-09-18 21:59:12,318\\tINFO tune.py:1143 -- Total run time: 73.40 seconds (73.36 seconds for the tuning loop).\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"CPU times: user 1.31 s, sys: 364 ms, total: 1.68 s\\n\",\n      \"Wall time: 1min 13s\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"%%time\\n\",\n    \"# Train\\n\",\n    \"results = trainer.fit()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>epoch</th>\\n\",\n       \"      <th>lr</th>\\n\",\n       \"      <th>train_loss</th>\\n\",\n       \"      <th>val_loss</th>\\n\",\n       \"      <th>timestamp</th>\\n\",\n       \"      <th>should_checkpoint</th>\\n\",\n       \"      <th>done</th>\\n\",\n       \"      <th>training_iteration</th>\\n\",\n       \"      <th>trial_id</th>\\n\",\n       \"      <th>date</th>\\n\",\n       \"      <th>...</th>\\n\",\n       \"      <th>time_since_restore</th>\\n\",\n       \"      <th>iterations_since_restore</th>\\n\",\n       \"      <th>checkpoint_dir_name</th>\\n\",\n       \"      <th>config/train_loop_config/dropout_p</th>\\n\",\n       \"      <th>config/train_loop_config/lr</th>\\n\",\n       \"      <th>config/train_loop_config/lr_factor</th>\\n\",\n       \"      <th>config/train_loop_config/lr_patience</th>\\n\",\n       \"      <th>config/train_loop_config/num_epochs</th>\\n\",\n       \"      <th>config/train_loop_config/batch_size</th>\\n\",\n       \"      <th>config/train_loop_config/num_classes</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>0</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.577060</td>\\n\",\n       \"      <td>0.499463</td>\\n\",\n       \"      <td>1695099495</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-15</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>12.883882</td>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>checkpoint_000000</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.497796</td>\\n\",\n       \"      <td>0.454631</td>\\n\",\n       \"      <td>1695099501</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-21</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>18.986689</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>checkpoint_000001</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.432476</td>\\n\",\n       \"      <td>0.324219</td>\\n\",\n       \"      <td>1695099507</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-27</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>25.088869</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>checkpoint_000002</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.319699</td>\\n\",\n       \"      <td>0.250069</td>\\n\",\n       \"      <td>1695099513</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-33</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>31.192535</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>checkpoint_000003</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.243872</td>\\n\",\n       \"      <td>0.208918</td>\\n\",\n       \"      <td>1695099519</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-39</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>37.338241</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>checkpoint_000004</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>5</th>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.188871</td>\\n\",\n       \"      <td>0.183051</td>\\n\",\n       \"      <td>1695099525</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-45</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>43.458540</td>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>checkpoint_000005</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>6</th>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.145348</td>\\n\",\n       \"      <td>0.139673</td>\\n\",\n       \"      <td>1695099532</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-52</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>49.559415</td>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>checkpoint_000006</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>7</th>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.102919</td>\\n\",\n       \"      <td>0.126615</td>\\n\",\n       \"      <td>1695099538</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-58-58</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>56.116772</td>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>checkpoint_000007</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>8</th>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.074093</td>\\n\",\n       \"      <td>0.135746</td>\\n\",\n       \"      <td>1695099544</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-59-04</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>62.219563</td>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>checkpoint_000008</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>9</th>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.052506</td>\\n\",\n       \"      <td>0.113568</td>\\n\",\n       \"      <td>1695099550</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>1a81f_00000</td>\\n\",\n       \"      <td>2023-09-18_21-59-10</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>68.368526</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>checkpoint_000009</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"<p>10 rows × 25 columns</p>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   epoch      lr  train_loss  val_loss   timestamp  should_checkpoint   done  \\\\\\n\",\n       \"0      0  0.0001    0.577060  0.499463  1695099495               True  False   \\n\",\n       \"1      1  0.0001    0.497796  0.454631  1695099501               True  False   \\n\",\n       \"2      2  0.0001    0.432476  0.324219  1695099507               True  False   \\n\",\n       \"3      3  0.0001    0.319699  0.250069  1695099513               True  False   \\n\",\n       \"4      4  0.0001    0.243872  0.208918  1695099519               True  False   \\n\",\n       \"5      5  0.0001    0.188871  0.183051  1695099525               True  False   \\n\",\n       \"6      6  0.0001    0.145348  0.139673  1695099532               True  False   \\n\",\n       \"7      7  0.0001    0.102919  0.126615  1695099538               True  False   \\n\",\n       \"8      8  0.0001    0.074093  0.135746  1695099544               True  False   \\n\",\n       \"9      9  0.0001    0.052506  0.113568  1695099550               True  False   \\n\",\n       \"\\n\",\n       \"   training_iteration     trial_id                 date  ...  \\\\\\n\",\n       \"0                   1  1a81f_00000  2023-09-18_21-58-15  ...   \\n\",\n       \"1                   2  1a81f_00000  2023-09-18_21-58-21  ...   \\n\",\n       \"2                   3  1a81f_00000  2023-09-18_21-58-27  ...   \\n\",\n       \"3                   4  1a81f_00000  2023-09-18_21-58-33  ...   \\n\",\n       \"4                   5  1a81f_00000  2023-09-18_21-58-39  ...   \\n\",\n       \"5                   6  1a81f_00000  2023-09-18_21-58-45  ...   \\n\",\n       \"6                   7  1a81f_00000  2023-09-18_21-58-52  ...   \\n\",\n       \"7                   8  1a81f_00000  2023-09-18_21-58-58  ...   \\n\",\n       \"8                   9  1a81f_00000  2023-09-18_21-59-04  ...   \\n\",\n       \"9                  10  1a81f_00000  2023-09-18_21-59-10  ...   \\n\",\n       \"\\n\",\n       \"   time_since_restore  iterations_since_restore  checkpoint_dir_name  \\\\\\n\",\n       \"0           12.883882                         1    checkpoint_000000   \\n\",\n       \"1           18.986689                         2    checkpoint_000001   \\n\",\n       \"2           25.088869                         3    checkpoint_000002   \\n\",\n       \"3           31.192535                         4    checkpoint_000003   \\n\",\n       \"4           37.338241                         5    checkpoint_000004   \\n\",\n       \"5           43.458540                         6    checkpoint_000005   \\n\",\n       \"6           49.559415                         7    checkpoint_000006   \\n\",\n       \"7           56.116772                         8    checkpoint_000007   \\n\",\n       \"8           62.219563                         9    checkpoint_000008   \\n\",\n       \"9           68.368526                        10    checkpoint_000009   \\n\",\n       \"\\n\",\n       \"  config/train_loop_config/dropout_p config/train_loop_config/lr  \\\\\\n\",\n       \"0                                0.5                      0.0001   \\n\",\n       \"1                                0.5                      0.0001   \\n\",\n       \"2                                0.5                      0.0001   \\n\",\n       \"3                                0.5                      0.0001   \\n\",\n       \"4                                0.5                      0.0001   \\n\",\n       \"5                                0.5                      0.0001   \\n\",\n       \"6                                0.5                      0.0001   \\n\",\n       \"7                                0.5                      0.0001   \\n\",\n       \"8                                0.5                      0.0001   \\n\",\n       \"9                                0.5                      0.0001   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/lr_factor  config/train_loop_config/lr_patience  \\\\\\n\",\n       \"0                                 0.8                                     3   \\n\",\n       \"1                                 0.8                                     3   \\n\",\n       \"2                                 0.8                                     3   \\n\",\n       \"3                                 0.8                                     3   \\n\",\n       \"4                                 0.8                                     3   \\n\",\n       \"5                                 0.8                                     3   \\n\",\n       \"6                                 0.8                                     3   \\n\",\n       \"7                                 0.8                                     3   \\n\",\n       \"8                                 0.8                                     3   \\n\",\n       \"9                                 0.8                                     3   \\n\",\n       \"\\n\",\n       \"  config/train_loop_config/num_epochs  config/train_loop_config/batch_size  \\\\\\n\",\n       \"0                                  10                                  256   \\n\",\n       \"1                                  10                                  256   \\n\",\n       \"2                                  10                                  256   \\n\",\n       \"3                                  10                                  256   \\n\",\n       \"4                                  10                                  256   \\n\",\n       \"5                                  10                                  256   \\n\",\n       \"6                                  10                                  256   \\n\",\n       \"7                                  10                                  256   \\n\",\n       \"8                                  10                                  256   \\n\",\n       \"9                                  10                                  256   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/num_classes  \\n\",\n       \"0                                     4  \\n\",\n       \"1                                     4  \\n\",\n       \"2                                     4  \\n\",\n       \"3                                     4  \\n\",\n       \"4                                     4  \\n\",\n       \"5                                     4  \\n\",\n       \"6                                     4  \\n\",\n       \"7                                     4  \\n\",\n       \"8                                     4  \\n\",\n       \"9                                     4  \\n\",\n       \"\\n\",\n       \"[10 rows x 25 columns]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Metrics per epoch\\n\",\n    \"results.metrics_dataframe\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[(Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/llm/TorchTrainer_e2941_00000_0_2023-09-17_22-40-33/checkpoint_000009),\\n\",\n       \"  {'epoch': 9,\\n\",\n       \"   'lr': 0.0001,\\n\",\n       \"   'train_loss': 0.052506402134895325,\\n\",\n       \"   'val_loss': 0.11356845498085022,\\n\",\n       \"   'timestamp': 1695015703,\\n\",\n       \"   'should_checkpoint': True,\\n\",\n       \"   'done': False,\\n\",\n       \"   'training_iteration': 10,\\n\",\n       \"   'trial_id': 'e2941_00000',\\n\",\n       \"   'date': '2023-09-17_22-41-43',\\n\",\n       \"   'time_this_iter_s': 6.128554105758667,\\n\",\n       \"   'time_total_s': 66.49748063087463,\\n\",\n       \"   'pid': 842775,\\n\",\n       \"   'hostname': 'ip-10-0-35-174',\\n\",\n       \"   'node_ip': '10.0.35.174',\\n\",\n       \"   'config': {'train_loop_config': {'dropout_p': 0.5,\\n\",\n       \"     'lr': 0.0001,\\n\",\n       \"     'lr_factor': 0.8,\\n\",\n       \"     'lr_patience': 3,\\n\",\n       \"     'num_epochs': 10,\\n\",\n       \"     'batch_size': 256,\\n\",\n       \"     'num_classes': 4}},\\n\",\n       \"   'time_since_restore': 66.49748063087463,\\n\",\n       \"   'iterations_since_restore': 10})]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Best checkpoints\\n\",\n    \"results.best_checkpoints\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Evaluation\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from sklearn.metrics import precision_recall_fscore_support\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"class TorchPredictor:\\n\",\n    \"    def __init__(self, preprocessor, model):\\n\",\n    \"        self.preprocessor = preprocessor\\n\",\n    \"        self.model = model\\n\",\n    \"        self.model.eval()\\n\",\n    \"        \\n\",\n    \"    def __call__(self, batch):\\n\",\n    \"        results = self.model.predict(collate_fn(batch))\\n\",\n    \"        return {\\\"output\\\": results}\\n\",\n    \"\\n\",\n    \"    def predict_proba(self, batch):\\n\",\n    \"        results = self.model.predict_proba(collate_fn(batch))\\n\",\n    \"        return {\\\"output\\\": results}\\n\",\n    \"        \\n\",\n    \"    def get_preprocessor(self):\\n\",\n    \"        return self.preprocessor\\n\",\n    \"        \\n\",\n    \"    @classmethod\\n\",\n    \"    def from_checkpoint(cls, checkpoint):\\n\",\n    \"        metadata = checkpoint.get_metadata()\\n\",\n    \"        preprocessor = CustomPreprocessor(class_to_index=metadata[\\\"class_to_index\\\"])\\n\",\n    \"        model = FinetunedLLM.load(Path(checkpoint.path, \\\"args.json\\\"), Path(checkpoint.path, \\\"model.pt\\\"))\\n\",\n    \"        return cls(preprocessor=preprocessor, model=model)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Artifacts\\n\",\n    \"best_checkpoint = results.best_checkpoints[0][0]\\n\",\n    \"predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"preprocessor = predictor.get_preprocessor()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:41:46,264\\tINFO read_api.py:406 -- To satisfy the requested parallelism of 64, each read task output is split into 64 smaller blocks.\\n\",\n      \"2023-09-17 22:41:46,268\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-17 22:41:46,268\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:41:46,269\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'ids': array([  102,  4905,  2069,  2470,  2848,  4905, 30132, 22081,   691,\\n\",\n       \"          4324,  7491,  5896,   341,  6136,   934, 30137,   103,     0]),\\n\",\n       \"  'masks': array([1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]),\\n\",\n       \"  'targets': 3}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Test (holdout) dataset\\n\",\n    \"HOLDOUT_LOC = \\\"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/holdout.csv\\\"\\n\",\n    \"test_ds = ray.data.read_csv(HOLDOUT_LOC)\\n\",\n    \"preprocessed_ds = preprocessor.transform(test_ds)\\n\",\n    \"preprocessed_ds.take(1)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:41:46,831\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:41:46,831\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:41:46,832\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"[3 3 3 0 2 0 0 0 0 2 0 0 2 3 0 0 2 2 3 2 3 0 3 2 0 2 2 1 1 2 2 2 2 2 2 0 0\\n\",\n      \" 0 0 0 1 1 2 0 0 3 1 2 0 2 2 3 3 0 2 3 2 3 3 3 3 0 0 0 0 2 2 0 2 1 0 2 3 0\\n\",\n      \" 0 2 2 2 2 2 0 0 2 0 1 0 0 0 0 3 0 0 2 0 2 2 3 2 0 2 0 2 0 3 0 0 0 0 0 2 0\\n\",\n      \" 0 2 2 2 2 3 0 2 0 2 0 2 3 3 3 2 0 2 2 2 2 0 2 2 2 0 1 2 2 2 2 2 1 2 0 3 0\\n\",\n      \" 2 2 1 1 2 0 0 0 0 0 0 2 2 2 0 2 1 1 2 0 0 1 2 3 2 2 2 0 0 2 0 2 0 3 0 2 2\\n\",\n      \" 0 1 2 1 2 2]\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# y_true\\n\",\n    \"values = preprocessed_ds.select_columns(cols=[\\\"targets\\\"]).take_all()\\n\",\n    \"y_true = np.stack([item[\\\"targets\\\"] for item in values])\\n\",\n    \"print (y_true)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:41:47,783\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor)]\\n\",\n      \"2023-09-17 22:41:47,785\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:41:47,786\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess)->MapBatches(TorchPredictor) pid=348532, ip=10.0.34.101)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# y_pred\\n\",\n    \"predictions = preprocessed_ds.map_batches(predictor).take_all()\\n\",\n    \"y_pred = np.array([d[\\\"output\\\"] for d in predictions])\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'precision': 0.9138952286238713,\\n\",\n       \" 'recall': 0.9109947643979057,\\n\",\n       \" 'f1': 0.9114851103432928}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Evaluate\\n\",\n    \"metrics = precision_recall_fscore_support(y_true, y_pred, average=\\\"weighted\\\")\\n\",\n    \"{\\\"precision\\\": metrics[0], \\\"recall\\\": metrics[1], \\\"f1\\\": metrics[2]}\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def evaluate(ds, predictor):\\n\",\n    \"    # y_true\\n\",\n    \"    preprocessor = predictor.get_preprocessor()\\n\",\n    \"    preprocessed_ds = preprocessor.transform(ds)\\n\",\n    \"    values = preprocessed_ds.select_columns(cols=[\\\"targets\\\"]).take_all()\\n\",\n    \"    y_true = np.stack([item[\\\"targets\\\"] for item in values])\\n\",\n    \"    \\n\",\n    \"    # y_pred\\n\",\n    \"    predictions = preprocessed_ds.map_batches(predictor).take_all()\\n\",\n    \"    y_pred = np.array([d[\\\"output\\\"] for d in predictions])\\n\",\n    \"\\n\",\n    \"    # Evaluate\\n\",\n    \"    metrics = precision_recall_fscore_support(y_true, y_pred, average=\\\"weighted\\\")\\n\",\n    \"    performance = {\\\"precision\\\": metrics[0], \\\"recall\\\": metrics[1], \\\"f1\\\": metrics[2]}\\n\",\n    \"    return performance\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:41:54,734\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:41:54,734\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:41:54,735\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:41:55,455\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor)]\\n\",\n      \"2023-09-17 22:41:55,456\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:41:55,456\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.9138952286238713,\\n\",\n      \"  \\\"recall\\\": 0.9109947643979057,\\n\",\n      \"  \\\"f1\\\": 0.9114851103432928\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Evaluate on test split\\n\",\n    \"performance = evaluate(ds=test_ds, predictor=predictor)\\n\",\n    \"print (json.dumps(performance, indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Inference\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import pandas as pd\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def format_prob(prob, index_to_class):\\n\",\n    \"    d = {}\\n\",\n    \"    for i, item in enumerate(prob):\\n\",\n    \"        d[index_to_class[i]] = item\\n\",\n    \"    return d\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"def predict_proba(ds, predictor):\\n\",\n    \"    preprocessor = predictor.get_preprocessor()\\n\",\n    \"    preprocessed_ds = preprocessor.transform(ds)\\n\",\n    \"    outputs = preprocessed_ds.map_batches(predictor.predict_proba)\\n\",\n    \"    y_prob = np.array([d[\\\"output\\\"] for d in outputs.take_all()])\\n\",\n    \"    results = []\\n\",\n    \"    for i, prob in enumerate(y_prob):\\n\",\n    \"        tag = preprocessor.index_to_class[prob.argmax()]\\n\",\n    \"        results.append({\\\"prediction\\\": tag, \\\"probabilities\\\": format_prob(prob, preprocessor.index_to_class)})\\n\",\n    \"    return results\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:42:00,133\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:42:00,134\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:42:00,134\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'prediction': 'natural-language-processing',\\n\",\n       \"  'probabilities': {'computer-vision': 0.00035399722,\\n\",\n       \"   'mlops': 0.00030543839,\\n\",\n       \"   'natural-language-processing': 0.9990171,\\n\",\n       \"   'other': 0.0003234732}}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Predict on sample\\n\",\n    \"title = \\\"Transfer learning with transformers\\\"\\n\",\n    \"description = \\\"Using transformers for transfer learning on text classification tasks.\\\"\\n\",\n    \"sample_ds = ray.data.from_items([{\\\"title\\\": title, \\\"description\\\": description, \\\"tag\\\": \\\"other\\\"}])\\n\",\n    \"predict_proba(ds=sample_ds, predictor=predictor)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"# 🧪 Experiment tracking\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"So far, we've been training our models but we don't have a way to more deeply track and compare them. We'll achieve this but defining a proper process for experiment tracking which we'll use for all future experiments (including hyperparameter optimization). Experiment tracking is the processing of managing all the different experiments and their components, such as parameters, metrics, models and other artifacts and it enables us to:\\n\",\n    \"\\n\",\n    \"- **Organize** all the necessary components of a specific experiment. It's important to have everything in one place and know where it is so you can use them later.\\n\",\n    \"- **Reproduce** past results (easily) using saved experiments.\\n\",\n    \"- **Log** iterative improvements across time, data, ideas, teams, etc.\\n\",\n    \"\\n\",\n    \"There are many options for experiment tracking but we're going to use [MLflow](https://mlflow.org/) (100% free and [open-source](https://github.com/mlflow/mlflow)) because it has all the functionality we'll need (and [growing integration support](https://docs.ray.io/en/latest/tune/examples/tune-mlflow.html)). There are also several popular options such as a [Comet ML](https://www.comet.ml/site/) (Used by Google AI, HuggingFace, etc.) and [Weights and Biases](https://www.wandb.com/) (Used by Open AI, Toyota Research, etc.). These are fantastic options if you want a fully managed experiment tracking solution.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import mlflow\\n\",\n    \"from pathlib import Path\\n\",\n    \"from ray.tune.logger.mlflow import MLflowLoggerCallback\\n\",\n    \"import time\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"file:///efs/shared_storage/madewithml/GokuMohandas/mlflow\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Config MLflow\\n\",\n    \"MODEL_REGISTRY = Path(f\\\"{EFS_DIR}/mlflow\\\")\\n\",\n    \"Path(MODEL_REGISTRY).mkdir(parents=True, exist_ok=True)\\n\",\n    \"MLFLOW_TRACKING_URI = \\\"file://\\\" + str(MODEL_REGISTRY.absolute())\\n\",\n    \"mlflow.set_tracking_uri(MLFLOW_TRACKING_URI)\\n\",\n    \"print (mlflow.get_tracking_uri())\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# MLflow callback\\n\",\n    \"experiment_name = f\\\"llm-{int(time.time())}\\\"\\n\",\n    \"mlflow_callback = MLflowLoggerCallback(\\n\",\n    \"    tracking_uri=MLFLOW_TRACKING_URI,\\n\",\n    \"    experiment_name=experiment_name,\\n\",\n    \"    save_artifact=True)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Run configuration with MLflow callback\\n\",\n    \"run_config = RunConfig(\\n\",\n    \"    callbacks=[mlflow_callback],\\n\",\n    \"    checkpoint_config=checkpoint_config,\\n\",\n    \"    storage_path=EFS_DIR,\\n\",\n    \"    local_dir=EFS_DIR\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:42:01,332\\tINFO read_api.py:406 -- To satisfy the requested parallelism of 64, each read task output is split into 64 smaller blocks.\\n\",\n      \"2023-09-17 22:42:01,337\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-17 22:42:01,337\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:42:01,338\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Dataset\\n\",\n    \"ds = load_data()\\n\",\n    \"train_ds, val_ds = stratify_split(ds, stratify=\\\"tag\\\", test_size=test_size)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:42:01,795\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-17 22:42:01,795\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:42:01,796\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:42:03,339\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> AllToAllOperator[Aggregate] -> TaskPoolMapOperator[MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:42:03,340\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:42:03,340\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Aggregate 11:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 12:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 13:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:42:05,078\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)]\\n\",\n      \"2023-09-17 22:42:05,079\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:42:05,079\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:42:07,292\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)]\\n\",\n      \"2023-09-17 22:42:07,293\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:42:07,293\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Preprocess\\n\",\n    \"preprocessor = CustomPreprocessor()\\n\",\n    \"preprocessor = preprocessor.fit(train_ds)\\n\",\n    \"train_ds = preprocessor.transform(train_ds)\\n\",\n    \"val_ds = preprocessor.transform(val_ds)\\n\",\n    \"train_ds = train_ds.materialize()\\n\",\n    \"val_ds = val_ds.materialize()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Trainer\\n\",\n    \"trainer = TorchTrainer(\\n\",\n    \"    train_loop_per_worker=train_loop_per_worker,\\n\",\n    \"    train_loop_config=train_loop_config,\\n\",\n    \"    scaling_config=scaling_config,\\n\",\n    \"    run_config=run_config,  # uses RunConfig with MLflow callback\\n\",\n    \"    datasets={\\\"train\\\": train_ds, \\\"val\\\": val_ds},\\n\",\n    \"    dataset_config=dataset_config,\\n\",\n    \"    metadata={\\\"class_to_index\\\": preprocessor.class_to_index}\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div class=\\\"tuneStatus\\\">\\n\",\n       \"  <div style=\\\"display: flex;flex-direction: row\\\">\\n\",\n       \"    <div style=\\\"display: flex;flex-direction: column;\\\">\\n\",\n       \"      <h3>Tune Status</h3>\\n\",\n       \"      <table>\\n\",\n       \"<tbody>\\n\",\n       \"<tr><td>Current time:</td><td>2023-09-17 22:43:31</td></tr>\\n\",\n       \"<tr><td>Running for: </td><td>00:01:21.68        </td></tr>\\n\",\n       \"<tr><td>Memory:      </td><td>20.8/62.1 GiB      </td></tr>\\n\",\n       \"</tbody>\\n\",\n       \"</table>\\n\",\n       \"    </div>\\n\",\n       \"    <div class=\\\"vDivider\\\"></div>\\n\",\n       \"    <div class=\\\"systemInfo\\\">\\n\",\n       \"      <h3>System Info</h3>\\n\",\n       \"      Using FIFO scheduling algorithm.<br>Logical resource usage: 4.0/32 CPUs, 1.0/2 GPUs (0.0/2.0 accelerator_type:A10G)\\n\",\n       \"    </div>\\n\",\n       \"    \\n\",\n       \"  </div>\\n\",\n       \"  <div class=\\\"hDivider\\\"></div>\\n\",\n       \"  <div class=\\\"trialStatus\\\">\\n\",\n       \"    <h3>Trial Status</h3>\\n\",\n       \"    <table>\\n\",\n       \"<thead>\\n\",\n       \"<tr><th>Trial name              </th><th>status    </th><th>loc               </th><th style=\\\"text-align: right;\\\">  iter</th><th style=\\\"text-align: right;\\\">  total time (s)</th><th style=\\\"text-align: right;\\\">  epoch</th><th style=\\\"text-align: right;\\\">    lr</th><th style=\\\"text-align: right;\\\">  train_loss</th></tr>\\n\",\n       \"</thead>\\n\",\n       \"<tbody>\\n\",\n       \"<tr><td>TorchTrainer_1bd07_00000</td><td>TERMINATED</td><td>10.0.35.174:844750</td><td style=\\\"text-align: right;\\\">    10</td><td style=\\\"text-align: right;\\\">         63.6994</td><td style=\\\"text-align: right;\\\">      9</td><td style=\\\"text-align: right;\\\">0.0001</td><td style=\\\"text-align: right;\\\">   0.0421994</td></tr>\\n\",\n       \"</tbody>\\n\",\n       \"</table>\\n\",\n       \"  </div>\\n\",\n       \"</div>\\n\",\n       \"<style>\\n\",\n       \".tuneStatus {\\n\",\n       \"  color: var(--jp-ui-font-color1);\\n\",\n       \"}\\n\",\n       \".tuneStatus .systemInfo {\\n\",\n       \"  display: flex;\\n\",\n       \"  flex-direction: column;\\n\",\n       \"}\\n\",\n       \".tuneStatus td {\\n\",\n       \"  white-space: nowrap;\\n\",\n       \"}\\n\",\n       \".tuneStatus .trialStatus {\\n\",\n       \"  display: flex;\\n\",\n       \"  flex-direction: column;\\n\",\n       \"}\\n\",\n       \".tuneStatus h3 {\\n\",\n       \"  font-weight: bold;\\n\",\n       \"}\\n\",\n       \".tuneStatus .hDivider {\\n\",\n       \"  border-bottom-width: var(--jp-border-width);\\n\",\n       \"  border-bottom-color: var(--jp-border-color0);\\n\",\n       \"  border-bottom-style: solid;\\n\",\n       \"}\\n\",\n       \".tuneStatus .vDivider {\\n\",\n       \"  border-left-width: var(--jp-border-width);\\n\",\n       \"  border-left-color: var(--jp-border-color0);\\n\",\n       \"  border-left-style: solid;\\n\",\n       \"  margin: 0.5em 1em 0.5em 1em;\\n\",\n       \"}\\n\",\n       \"</style>\\n\"\n      ],\n      \"text/plain\": [\n       \"<IPython.core.display.HTML object>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(TorchTrainer pid=844750)\\u001b[0m Starting distributed worker processes: ['844833 (10.0.35.174)']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Setting up process group for: env:// [rank=0, world_size=1]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Auto configuring locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Moving model to device: cuda:0\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000000)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000001)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000002)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000003)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000004)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000005)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000006)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:43:01,995\\tWARNING worker.py:2012 -- [tqdm_ray] Failed to decode {\\\"__magic_token__\\\": \\\"__ray_tqdm_magic_token__\\\", \\\"x\\\": 47, \\\"pos\\\": 0, \\\"desc\\\": \\\"Running: 0.0/32.0 CPU, 0.0/2.0 GPU, 0.28 MiB/8.95 GiB object_store_memory\\\", \\\"total\\\": 64, \\\"ip\\\": \\\"10.0.35.174\\\", \\\"pid\\\": 844909, \\\"uuid\\\": \\\"54df93474628434c, this may be due to logging too fast. This warning will not be printed again.\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m 8d2fe8f67788261f\\\", \\\"closed\\\": false}\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000007)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000008)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=844909) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=844909)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=844833)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-42-09/TorchTrainer_1bd07_00000_0_2023-09-17_22-42-09/checkpoint_000009)\\n\",\n      \"2023-09-17 22:43:31,004\\tINFO tune.py:1143 -- Total run time: 81.76 seconds (81.66 seconds for the tuning loop).\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"CPU times: user 1.23 s, sys: 1.31 s, total: 2.53 s\\n\",\n      \"Wall time: 1min 21s\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"%%time\\n\",\n    \"# Train\\n\",\n    \"results = trainer.fit()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>epoch</th>\\n\",\n       \"      <th>lr</th>\\n\",\n       \"      <th>train_loss</th>\\n\",\n       \"      <th>val_loss</th>\\n\",\n       \"      <th>timestamp</th>\\n\",\n       \"      <th>should_checkpoint</th>\\n\",\n       \"      <th>done</th>\\n\",\n       \"      <th>training_iteration</th>\\n\",\n       \"      <th>trial_id</th>\\n\",\n       \"      <th>date</th>\\n\",\n       \"      <th>...</th>\\n\",\n       \"      <th>time_since_restore</th>\\n\",\n       \"      <th>iterations_since_restore</th>\\n\",\n       \"      <th>checkpoint_dir_name</th>\\n\",\n       \"      <th>config/train_loop_config/dropout_p</th>\\n\",\n       \"      <th>config/train_loop_config/lr</th>\\n\",\n       \"      <th>config/train_loop_config/lr_factor</th>\\n\",\n       \"      <th>config/train_loop_config/lr_patience</th>\\n\",\n       \"      <th>config/train_loop_config/num_epochs</th>\\n\",\n       \"      <th>config/train_loop_config/batch_size</th>\\n\",\n       \"      <th>config/train_loop_config/num_classes</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>0</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.577780</td>\\n\",\n       \"      <td>0.493102</td>\\n\",\n       \"      <td>1695015745</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-42-25</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>11.882575</td>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>checkpoint_000000</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.489653</td>\\n\",\n       \"      <td>0.431958</td>\\n\",\n       \"      <td>1695015751</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-42-31</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>17.654435</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>checkpoint_000001</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.398824</td>\\n\",\n       \"      <td>0.306201</td>\\n\",\n       \"      <td>1695015757</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-42-37</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>23.353752</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>checkpoint_000002</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.300513</td>\\n\",\n       \"      <td>0.238803</td>\\n\",\n       \"      <td>1695015763</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-42-43</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>29.118992</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>checkpoint_000003</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.220608</td>\\n\",\n       \"      <td>0.174411</td>\\n\",\n       \"      <td>1695015769</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-42-49</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>34.897485</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>checkpoint_000004</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>5</th>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.151499</td>\\n\",\n       \"      <td>0.158648</td>\\n\",\n       \"      <td>1695015775</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-42-55</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>40.645384</td>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>checkpoint_000005</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>6</th>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.105087</td>\\n\",\n       \"      <td>0.112829</td>\\n\",\n       \"      <td>1695015781</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-43-01</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>46.387568</td>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>checkpoint_000006</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>7</th>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.077385</td>\\n\",\n       \"      <td>0.091922</td>\\n\",\n       \"      <td>1695015788</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-43-08</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>52.153343</td>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>checkpoint_000007</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>8</th>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.053857</td>\\n\",\n       \"      <td>0.109810</td>\\n\",\n       \"      <td>1695015794</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-43-14</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>57.901084</td>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>checkpoint_000008</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>9</th>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.042199</td>\\n\",\n       \"      <td>0.121122</td>\\n\",\n       \"      <td>1695015800</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>1bd07_00000</td>\\n\",\n       \"      <td>2023-09-17_22-43-20</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>63.699444</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>checkpoint_000009</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"<p>10 rows × 25 columns</p>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   epoch      lr  train_loss  val_loss   timestamp  should_checkpoint   done  \\\\\\n\",\n       \"0      0  0.0001    0.577780  0.493102  1695015745               True  False   \\n\",\n       \"1      1  0.0001    0.489653  0.431958  1695015751               True  False   \\n\",\n       \"2      2  0.0001    0.398824  0.306201  1695015757               True  False   \\n\",\n       \"3      3  0.0001    0.300513  0.238803  1695015763               True  False   \\n\",\n       \"4      4  0.0001    0.220608  0.174411  1695015769               True  False   \\n\",\n       \"5      5  0.0001    0.151499  0.158648  1695015775               True  False   \\n\",\n       \"6      6  0.0001    0.105087  0.112829  1695015781               True  False   \\n\",\n       \"7      7  0.0001    0.077385  0.091922  1695015788               True  False   \\n\",\n       \"8      8  0.0001    0.053857  0.109810  1695015794               True  False   \\n\",\n       \"9      9  0.0001    0.042199  0.121122  1695015800               True  False   \\n\",\n       \"\\n\",\n       \"   training_iteration     trial_id                 date  ...  \\\\\\n\",\n       \"0                   1  1bd07_00000  2023-09-17_22-42-25  ...   \\n\",\n       \"1                   2  1bd07_00000  2023-09-17_22-42-31  ...   \\n\",\n       \"2                   3  1bd07_00000  2023-09-17_22-42-37  ...   \\n\",\n       \"3                   4  1bd07_00000  2023-09-17_22-42-43  ...   \\n\",\n       \"4                   5  1bd07_00000  2023-09-17_22-42-49  ...   \\n\",\n       \"5                   6  1bd07_00000  2023-09-17_22-42-55  ...   \\n\",\n       \"6                   7  1bd07_00000  2023-09-17_22-43-01  ...   \\n\",\n       \"7                   8  1bd07_00000  2023-09-17_22-43-08  ...   \\n\",\n       \"8                   9  1bd07_00000  2023-09-17_22-43-14  ...   \\n\",\n       \"9                  10  1bd07_00000  2023-09-17_22-43-20  ...   \\n\",\n       \"\\n\",\n       \"   time_since_restore  iterations_since_restore  checkpoint_dir_name  \\\\\\n\",\n       \"0           11.882575                         1    checkpoint_000000   \\n\",\n       \"1           17.654435                         2    checkpoint_000001   \\n\",\n       \"2           23.353752                         3    checkpoint_000002   \\n\",\n       \"3           29.118992                         4    checkpoint_000003   \\n\",\n       \"4           34.897485                         5    checkpoint_000004   \\n\",\n       \"5           40.645384                         6    checkpoint_000005   \\n\",\n       \"6           46.387568                         7    checkpoint_000006   \\n\",\n       \"7           52.153343                         8    checkpoint_000007   \\n\",\n       \"8           57.901084                         9    checkpoint_000008   \\n\",\n       \"9           63.699444                        10    checkpoint_000009   \\n\",\n       \"\\n\",\n       \"  config/train_loop_config/dropout_p config/train_loop_config/lr  \\\\\\n\",\n       \"0                                0.5                      0.0001   \\n\",\n       \"1                                0.5                      0.0001   \\n\",\n       \"2                                0.5                      0.0001   \\n\",\n       \"3                                0.5                      0.0001   \\n\",\n       \"4                                0.5                      0.0001   \\n\",\n       \"5                                0.5                      0.0001   \\n\",\n       \"6                                0.5                      0.0001   \\n\",\n       \"7                                0.5                      0.0001   \\n\",\n       \"8                                0.5                      0.0001   \\n\",\n       \"9                                0.5                      0.0001   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/lr_factor  config/train_loop_config/lr_patience  \\\\\\n\",\n       \"0                                 0.8                                     3   \\n\",\n       \"1                                 0.8                                     3   \\n\",\n       \"2                                 0.8                                     3   \\n\",\n       \"3                                 0.8                                     3   \\n\",\n       \"4                                 0.8                                     3   \\n\",\n       \"5                                 0.8                                     3   \\n\",\n       \"6                                 0.8                                     3   \\n\",\n       \"7                                 0.8                                     3   \\n\",\n       \"8                                 0.8                                     3   \\n\",\n       \"9                                 0.8                                     3   \\n\",\n       \"\\n\",\n       \"  config/train_loop_config/num_epochs  config/train_loop_config/batch_size  \\\\\\n\",\n       \"0                                  10                                  256   \\n\",\n       \"1                                  10                                  256   \\n\",\n       \"2                                  10                                  256   \\n\",\n       \"3                                  10                                  256   \\n\",\n       \"4                                  10                                  256   \\n\",\n       \"5                                  10                                  256   \\n\",\n       \"6                                  10                                  256   \\n\",\n       \"7                                  10                                  256   \\n\",\n       \"8                                  10                                  256   \\n\",\n       \"9                                  10                                  256   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/num_classes  \\n\",\n       \"0                                     4  \\n\",\n       \"1                                     4  \\n\",\n       \"2                                     4  \\n\",\n       \"3                                     4  \\n\",\n       \"4                                     4  \\n\",\n       \"5                                     4  \\n\",\n       \"6                                     4  \\n\",\n       \"7                                     4  \\n\",\n       \"8                                     4  \\n\",\n       \"9                                     4  \\n\",\n       \"\\n\",\n       \"[10 rows x 25 columns]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"results.metrics_dataframe\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>run_id</th>\\n\",\n       \"      <th>experiment_id</th>\\n\",\n       \"      <th>status</th>\\n\",\n       \"      <th>artifact_uri</th>\\n\",\n       \"      <th>start_time</th>\\n\",\n       \"      <th>end_time</th>\\n\",\n       \"      <th>metrics.config/train_loop_config/lr_patience</th>\\n\",\n       \"      <th>metrics.time_total_s</th>\\n\",\n       \"      <th>metrics.time_since_restore</th>\\n\",\n       \"      <th>metrics.config/train_loop_config/num_epochs</th>\\n\",\n       \"      <th>...</th>\\n\",\n       \"      <th>metrics.epoch</th>\\n\",\n       \"      <th>params.train_loop_config/num_epochs</th>\\n\",\n       \"      <th>params.train_loop_config/lr_patience</th>\\n\",\n       \"      <th>params.train_loop_config/batch_size</th>\\n\",\n       \"      <th>params.train_loop_config/lr</th>\\n\",\n       \"      <th>params.train_loop_config/lr_factor</th>\\n\",\n       \"      <th>params.train_loop_config/num_classes</th>\\n\",\n       \"      <th>params.train_loop_config/dropout_p</th>\\n\",\n       \"      <th>tags.trial_name</th>\\n\",\n       \"      <th>tags.mlflow.runName</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>a67f6ec4e10b49a7845b91db61efc7e0</td>\\n\",\n       \"      <td>703905858072772764</td>\\n\",\n       \"      <td>FINISHED</td>\\n\",\n       \"      <td>file:///efs/shared_storage/madewithml/GokuMoha...</td>\\n\",\n       \"      <td>2023-09-18 05:42:12.863000+00:00</td>\\n\",\n       \"      <td>2023-09-18 05:43:30.925000+00:00</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"      <td>63.699444</td>\\n\",\n       \"      <td>63.699444</td>\\n\",\n       \"      <td>10.0</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>9.0</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>TorchTrainer_1bd07_00000</td>\\n\",\n       \"      <td>TorchTrainer_1bd07_00000</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"<p>1 rows × 35 columns</p>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"                             run_id       experiment_id    status  \\\\\\n\",\n       \"0  a67f6ec4e10b49a7845b91db61efc7e0  703905858072772764  FINISHED   \\n\",\n       \"\\n\",\n       \"                                        artifact_uri  \\\\\\n\",\n       \"0  file:///efs/shared_storage/madewithml/GokuMoha...   \\n\",\n       \"\\n\",\n       \"                        start_time                         end_time  \\\\\\n\",\n       \"0 2023-09-18 05:42:12.863000+00:00 2023-09-18 05:43:30.925000+00:00   \\n\",\n       \"\\n\",\n       \"   metrics.config/train_loop_config/lr_patience  metrics.time_total_s  \\\\\\n\",\n       \"0                                           3.0             63.699444   \\n\",\n       \"\\n\",\n       \"   metrics.time_since_restore  metrics.config/train_loop_config/num_epochs  \\\\\\n\",\n       \"0                   63.699444                                         10.0   \\n\",\n       \"\\n\",\n       \"   ...  metrics.epoch  params.train_loop_config/num_epochs  \\\\\\n\",\n       \"0  ...            9.0                                   10   \\n\",\n       \"\\n\",\n       \"   params.train_loop_config/lr_patience  params.train_loop_config/batch_size  \\\\\\n\",\n       \"0                                     3                                  256   \\n\",\n       \"\\n\",\n       \"   params.train_loop_config/lr  params.train_loop_config/lr_factor  \\\\\\n\",\n       \"0                       0.0001                                 0.8   \\n\",\n       \"\\n\",\n       \"   params.train_loop_config/num_classes  params.train_loop_config/dropout_p  \\\\\\n\",\n       \"0                                     4                                 0.5   \\n\",\n       \"\\n\",\n       \"            tags.trial_name       tags.mlflow.runName  \\n\",\n       \"0  TorchTrainer_1bd07_00000  TorchTrainer_1bd07_00000  \\n\",\n       \"\\n\",\n       \"[1 rows x 35 columns]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Sorted runs\\n\",\n    \"sorted_runs = mlflow.search_runs(experiment_names=[experiment_name], order_by=[\\\"metrics.val_loss ASC\\\"])\\n\",\n    \"sorted_runs\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"run_id                                                           a67f6ec4e10b49a7845b91db61efc7e0\\n\",\n       \"experiment_id                                                                  703905858072772764\\n\",\n       \"status                                                                                   FINISHED\\n\",\n       \"artifact_uri                                    file:///efs/shared_storage/madewithml/GokuMoha...\\n\",\n       \"start_time                                                       2023-09-18 05:42:12.863000+00:00\\n\",\n       \"end_time                                                         2023-09-18 05:43:30.925000+00:00\\n\",\n       \"metrics.config/train_loop_config/lr_patience                                                  3.0\\n\",\n       \"metrics.time_total_s                                                                    63.699444\\n\",\n       \"metrics.time_since_restore                                                              63.699444\\n\",\n       \"metrics.config/train_loop_config/num_epochs                                                  10.0\\n\",\n       \"metrics.iterations_since_restore                                                             10.0\\n\",\n       \"metrics.config/train_loop_config/batch_size                                                 256.0\\n\",\n       \"metrics.pid                                                                              844750.0\\n\",\n       \"metrics.should_checkpoint                                                                     1.0\\n\",\n       \"metrics.timestamp                                                                    1695015800.0\\n\",\n       \"metrics.config/train_loop_config/num_classes                                                  4.0\\n\",\n       \"metrics.done                                                                                  0.0\\n\",\n       \"metrics.time_this_iter_s                                                                  5.79836\\n\",\n       \"metrics.train_loss                                                                       0.042199\\n\",\n       \"metrics.config/train_loop_config/lr                                                        0.0001\\n\",\n       \"metrics.lr                                                                                 0.0001\\n\",\n       \"metrics.val_loss                                                                         0.121122\\n\",\n       \"metrics.config/train_loop_config/dropout_p                                                    0.5\\n\",\n       \"metrics.training_iteration                                                                   10.0\\n\",\n       \"metrics.config/train_loop_config/lr_factor                                                    0.8\\n\",\n       \"metrics.epoch                                                                                 9.0\\n\",\n       \"params.train_loop_config/num_epochs                                                            10\\n\",\n       \"params.train_loop_config/lr_patience                                                            3\\n\",\n       \"params.train_loop_config/batch_size                                                           256\\n\",\n       \"params.train_loop_config/lr                                                                0.0001\\n\",\n       \"params.train_loop_config/lr_factor                                                            0.8\\n\",\n       \"params.train_loop_config/num_classes                                                            4\\n\",\n       \"params.train_loop_config/dropout_p                                                            0.5\\n\",\n       \"tags.trial_name                                                          TorchTrainer_1bd07_00000\\n\",\n       \"tags.mlflow.runName                                                      TorchTrainer_1bd07_00000\\n\",\n       \"Name: 0, dtype: object\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Best run\\n\",\n    \"best_run = sorted_runs.iloc[0]\\n\",\n    \"best_run\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Dashboard\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"Let's view what we've tracked from our experiment. MLFlow serves a dashboard for us to view and explore our experiments on a localhost port:\\n\",\n    \"\\n\",\n    \"```bash\\n\",\n    \"mlflow server -h 0.0.0.0 -p 8080 --backend-store-uri $EFS_DIR/mlflow\\n\",\n    \"```\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"MLFlow creates a main dashboard with all your experiments and their respective runs. We can sort runs by clicking on the column headers.\\n\",\n    \"\\n\",\n    \"<img src=\\\"https://madewithml.com/static/images/mlops/experiment_tracking/dashboard.png\\\" width=\\\"1000\\\" alt=\\\"mlflow runs\\\">\\n\",\n    \"\\n\",\n    \"And within each run, we can view metrics, parameters, artifacts, etc.\\n\",\n    \"\\n\",\n    \"<img src=\\\"https://madewithml.com/static/images/mlops/experiment_tracking/params.png\\\" width=\\\"1000\\\" alt=\\\"mlflow params\\\">\\n\",\n    \"\\n\",\n    \"And we can even create custom plots to help us visualize our results.\\n\",\n    \"\\n\",\n    \"<img src=\\\"https://madewithml.com/static/images/mlops/experiment_tracking/plots.png\\\" width=\\\"1000\\\" alt=\\\"mlflow plots\\\">\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Loading\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from ray.train import Result\\n\",\n    \"from urllib.parse import urlparse\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def get_best_checkpoint(run_id):\\n\",\n    \"    artifact_dir = urlparse(mlflow.get_run(run_id).info.artifact_uri).path  # get path from mlflow\\n\",\n    \"    results = Result.from_path(artifact_dir)\\n\",\n    \"    return results.best_checkpoints[0][0]\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"# Artifacts\\n\",\n    \"best_checkpoint = get_best_checkpoint(run_id=best_run.run_id)\\n\",\n    \"predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"preprocessor = predictor.get_preprocessor()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:36,691\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:43:36,692\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:36,692\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:37,551\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor)]\\n\",\n      \"2023-09-17 22:43:37,552\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:37,553\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess)->MapBatches(TorchPredictor) pid=845827)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.9168092951711627,\\n\",\n      \"  \\\"recall\\\": 0.9109947643979057,\\n\",\n      \"  \\\"f1\\\": 0.9105512639658029\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Evaluate on test split\\n\",\n    \"performance = evaluate(ds=test_ds, predictor=predictor)\\n\",\n    \"print (json.dumps(performance, indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:43,282\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:43:43,282\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:43,283\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'prediction': 'natural-language-processing',\\n\",\n       \"  'probabilities': {'computer-vision': 0.00043165276,\\n\",\n       \"   'mlops': 0.0008155016,\\n\",\n       \"   'natural-language-processing': 0.9978746,\\n\",\n       \"   'other': 0.0008782037}}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Predict on sample\\n\",\n    \"title = \\\"Transfer learning with transformers\\\"\\n\",\n    \"description = \\\"Using transformers for transfer learning on text classification tasks.\\\"\\n\",\n    \"sample_ds = ray.data.from_items([{\\\"title\\\": title, \\\"description\\\": description, \\\"tag\\\": \\\"other\\\"}])\\n\",\n    \"predict_proba(ds=sample_ds, predictor=predictor)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"# ⚙ Hyperparameter tuning\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from ray import tune\\n\",\n    \"from ray.tune import Tuner\\n\",\n    \"from ray.tune.schedulers import AsyncHyperBandScheduler\\n\",\n    \"from ray.tune.search import ConcurrencyLimiter\\n\",\n    \"from ray.tune.search.hyperopt import HyperOptSearch\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Number of trials (small sample)\\n\",\n    \"num_runs = 2\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Set up\\n\",\n    \"set_seeds()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:44,422\\tINFO read_api.py:406 -- To satisfy the requested parallelism of 64, each read task output is split into 64 smaller blocks.\\n\",\n      \"2023-09-17 22:43:44,426\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-17 22:43:44,427\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:44,427\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Dataset\\n\",\n    \"ds = load_data()\\n\",\n    \"train_ds, val_ds = stratify_split(ds, stratify=\\\"tag\\\", test_size=test_size)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:44,885\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> LimitOperator[limit=1]\\n\",\n      \"2023-09-17 22:43:44,886\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:44,887\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:46,122\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> AllToAllOperator[Aggregate] -> TaskPoolMapOperator[MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:43:46,123\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:46,123\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Aggregate 11:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 12:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 13:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:47,913\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)]\\n\",\n      \"2023-09-17 22:43:47,914\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:47,914\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:43:50,092\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> AllToAllOperator[RandomShuffle] -> AllToAllOperator[Sort] -> AllToAllOperator[MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle] -> TaskPoolMapOperator[MapBatches(preprocess)]\\n\",\n      \"2023-09-17 22:43:50,092\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:43:50,093\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- RandomShuffle 1:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 2:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 3:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- Sort 4:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 5:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 6:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"d1666b95eda549a0acdc4b6b7bccc1eb\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 7:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"a9039cefcb144ad3840ea713619f15a8\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"- MapBatches(group_fn)->MapBatches(_filter_split)->RandomShuffle 8:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"996dc852fc1744bf980a8d2fd4bef1d0\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Map 9:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"f106f77bf680486da0c315264801f64a\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Shuffle Reduce 10:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"b213c6862021401fb4acfab6fc424d13\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"79eedbed73be46afbe08139526f1079f\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Sort Sample 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Preprocess\\n\",\n    \"preprocessor = CustomPreprocessor()\\n\",\n    \"preprocessor = preprocessor.fit(train_ds)\\n\",\n    \"train_ds = preprocessor.transform(train_ds)\\n\",\n    \"val_ds = preprocessor.transform(val_ds)\\n\",\n    \"train_ds = train_ds.materialize()\\n\",\n    \"val_ds = val_ds.materialize()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Trainer\\n\",\n    \"trainer = TorchTrainer(\\n\",\n    \"    train_loop_per_worker=train_loop_per_worker,\\n\",\n    \"    train_loop_config=train_loop_config,\\n\",\n    \"    scaling_config=scaling_config,\\n\",\n    \"    datasets={\\\"train\\\": train_ds, \\\"val\\\": val_ds},\\n\",\n    \"    dataset_config=dataset_config,\\n\",\n    \"    metadata={\\\"class_to_index\\\": preprocessor.class_to_index}\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# MLflow callback\\n\",\n    \"mlflow_callback = MLflowLoggerCallback(\\n\",\n    \"    tracking_uri=MLFLOW_TRACKING_URI,\\n\",\n    \"    experiment_name=experiment_name,\\n\",\n    \"    save_artifact=True)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Run configuration\\n\",\n    \"checkpoint_config = CheckpointConfig(num_to_keep=1, checkpoint_score_attribute=\\\"val_loss\\\", checkpoint_score_order=\\\"min\\\")\\n\",\n    \"run_config = RunConfig(\\n\",\n    \"    callbacks=[mlflow_callback],\\n\",\n    \"    checkpoint_config=checkpoint_config,\\n\",\n    \"    storage_path=EFS_DIR,\\n\",\n    \"    local_dir=EFS_DIR)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Hyperparameters to start with\\n\",\n    \"initial_params = [{\\\"train_loop_config\\\": {\\\"dropout_p\\\": 0.5, \\\"lr\\\": 1e-4, \\\"lr_factor\\\": 0.8, \\\"lr_patience\\\": 3}}]\\n\",\n    \"search_alg = HyperOptSearch(points_to_evaluate=initial_params)\\n\",\n    \"search_alg = ConcurrencyLimiter(search_alg, max_concurrent=2)  # trade off b/w optimization and search space\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Parameter space\\n\",\n    \"param_space = {\\n\",\n    \"    \\\"train_loop_config\\\": {\\n\",\n    \"        \\\"dropout_p\\\": tune.uniform(0.3, 0.9),\\n\",\n    \"        \\\"lr\\\": tune.loguniform(1e-5, 5e-4),\\n\",\n    \"        \\\"lr_factor\\\": tune.uniform(0.1, 0.9),\\n\",\n    \"        \\\"lr_patience\\\": tune.uniform(1, 10),\\n\",\n    \"    }\\n\",\n    \"}\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Scheduler\\n\",\n    \"scheduler = AsyncHyperBandScheduler(\\n\",\n    \"    max_t=train_loop_config[\\\"num_epochs\\\"],  # max epoch (<time_attr>) per trial\\n\",\n    \"    grace_period=5,  # min epoch (<time_attr>) per trial\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Tune config\\n\",\n    \"tune_config = tune.TuneConfig(\\n\",\n    \"    metric=\\\"val_loss\\\",\\n\",\n    \"    mode=\\\"min\\\",\\n\",\n    \"    search_alg=search_alg,\\n\",\n    \"    scheduler=scheduler,\\n\",\n    \"    num_samples=num_runs,\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Tuner\\n\",\n    \"tuner = Tuner(\\n\",\n    \"    trainable=trainer,\\n\",\n    \"    run_config=run_config,\\n\",\n    \"    param_space=param_space,\\n\",\n    \"    tune_config=tune_config,\\n\",\n    \")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div class=\\\"tuneStatus\\\">\\n\",\n       \"  <div style=\\\"display: flex;flex-direction: row\\\">\\n\",\n       \"    <div style=\\\"display: flex;flex-direction: column;\\\">\\n\",\n       \"      <h3>Tune Status</h3>\\n\",\n       \"      <table>\\n\",\n       \"<tbody>\\n\",\n       \"<tr><td>Current time:</td><td>2023-09-17 22:45:41</td></tr>\\n\",\n       \"<tr><td>Running for: </td><td>00:01:49.07        </td></tr>\\n\",\n       \"<tr><td>Memory:      </td><td>21.8/62.1 GiB      </td></tr>\\n\",\n       \"</tbody>\\n\",\n       \"</table>\\n\",\n       \"    </div>\\n\",\n       \"    <div class=\\\"vDivider\\\"></div>\\n\",\n       \"    <div class=\\\"systemInfo\\\">\\n\",\n       \"      <h3>System Info</h3>\\n\",\n       \"      Using AsyncHyperBand: num_stopped=2<br>Bracket: Iter 5.000: -0.2372603341937065<br>Logical resource usage: 4.0/32 CPUs, 1.0/2 GPUs (0.0/2.0 accelerator_type:A10G)\\n\",\n       \"    </div>\\n\",\n       \"    \\n\",\n       \"  </div>\\n\",\n       \"  <div class=\\\"hDivider\\\"></div>\\n\",\n       \"  <div class=\\\"trialStatus\\\">\\n\",\n       \"    <h3>Trial Status</h3>\\n\",\n       \"    <table>\\n\",\n       \"<thead>\\n\",\n       \"<tr><th>Trial name           </th><th>status    </th><th>loc               </th><th style=\\\"text-align: right;\\\">         train_loop_config/dr\\n\",\n       \"opout_p</th><th style=\\\"text-align: right;\\\">  train_loop_config/lr</th><th style=\\\"text-align: right;\\\">         train_loop_config/lr\\n\",\n       \"_factor</th><th style=\\\"text-align: right;\\\">        train_loop_config/lr\\n\",\n       \"_patience</th><th style=\\\"text-align: right;\\\">  iter</th><th style=\\\"text-align: right;\\\">  total time (s)</th><th style=\\\"text-align: right;\\\">  epoch</th><th style=\\\"text-align: right;\\\">         lr</th><th style=\\\"text-align: right;\\\">  train_loss</th></tr>\\n\",\n       \"</thead>\\n\",\n       \"<tbody>\\n\",\n       \"<tr><td>TorchTrainer_639d7776</td><td>TERMINATED</td><td>10.0.35.174:846705</td><td style=\\\"text-align: right;\\\">0.5     </td><td style=\\\"text-align: right;\\\">           0.0001     </td><td style=\\\"text-align: right;\\\">0.8     </td><td style=\\\"text-align: right;\\\">3      </td><td style=\\\"text-align: right;\\\">    10</td><td style=\\\"text-align: right;\\\">         68.3885</td><td style=\\\"text-align: right;\\\">      9</td><td style=\\\"text-align: right;\\\">0.0001     </td><td style=\\\"text-align: right;\\\">   0.0520358</td></tr>\\n\",\n       \"<tr><td>TorchTrainer_145c1bc2</td><td>TERMINATED</td><td>10.0.34.101:349716</td><td style=\\\"text-align: right;\\\">0.841192</td><td style=\\\"text-align: right;\\\">           5.18042e-05</td><td style=\\\"text-align: right;\\\">0.758627</td><td style=\\\"text-align: right;\\\">2.25374</td><td style=\\\"text-align: right;\\\">     5</td><td style=\\\"text-align: right;\\\">         30.7297</td><td style=\\\"text-align: right;\\\">      4</td><td style=\\\"text-align: right;\\\">5.18042e-05</td><td style=\\\"text-align: right;\\\">   0.392521 </td></tr>\\n\",\n       \"</tbody>\\n\",\n       \"</table>\\n\",\n       \"  </div>\\n\",\n       \"</div>\\n\",\n       \"<style>\\n\",\n       \".tuneStatus {\\n\",\n       \"  color: var(--jp-ui-font-color1);\\n\",\n       \"}\\n\",\n       \".tuneStatus .systemInfo {\\n\",\n       \"  display: flex;\\n\",\n       \"  flex-direction: column;\\n\",\n       \"}\\n\",\n       \".tuneStatus td {\\n\",\n       \"  white-space: nowrap;\\n\",\n       \"}\\n\",\n       \".tuneStatus .trialStatus {\\n\",\n       \"  display: flex;\\n\",\n       \"  flex-direction: column;\\n\",\n       \"}\\n\",\n       \".tuneStatus h3 {\\n\",\n       \"  font-weight: bold;\\n\",\n       \"}\\n\",\n       \".tuneStatus .hDivider {\\n\",\n       \"  border-bottom-width: var(--jp-border-width);\\n\",\n       \"  border-bottom-color: var(--jp-border-color0);\\n\",\n       \"  border-bottom-style: solid;\\n\",\n       \"}\\n\",\n       \".tuneStatus .vDivider {\\n\",\n       \"  border-left-width: var(--jp-border-width);\\n\",\n       \"  border-left-color: var(--jp-border-color0);\\n\",\n       \"  border-left-style: solid;\\n\",\n       \"  margin: 0.5em 1em 0.5em 1em;\\n\",\n       \"}\\n\",\n       \"</style>\\n\"\n      ],\n      \"text/plain\": [\n       \"<IPython.core.display.HTML object>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(TorchTrainer pid=846705)\\u001b[0m Starting distributed worker processes: ['846788 (10.0.35.174)']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Setting up process group for: env:// [rank=0, world_size=1]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Auto configuring locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Moving model to device: cuda:0\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\",\n      \"\\u001b[2m\\u001b[36m(TorchTrainer pid=349716, ip=10.0.34.101)\\u001b[0m Starting distributed worker processes: ['349780 (10.0.34.101)']\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=349780, ip=10.0.34.101)\\u001b[0m Setting up process group for: env:// [rank=0, world_size=1]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Auto configuring locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b']\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=349841, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000000)\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=349780, ip=10.0.34.101)\\u001b[0m Moving model to device: cuda:0\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=349780, ip=10.0.34.101)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=349841, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000001)\\u001b[32m [repeated 2x across cluster]\\u001b[0m\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:44:16,982\\tWARNING util.py:315 -- The `callbacks.on_trial_result` operation took 3.185 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:16,983\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.187 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:16,984\\tWARNING util.py:315 -- Processing trial results took 3.188 s, which may be a performance bottleneck. Please consider reporting results less frequently to Ray Tune.\\n\",\n      \"2023-09-17 22:44:16,984\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.188 s, which may be a performance bottleneck.\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=349841, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000002)\\u001b[32m [repeated 2x across cluster]\\u001b[0m\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:44:25,141\\tWARNING util.py:315 -- The `callbacks.on_trial_result` operation took 3.025 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:25,143\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.028 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:25,144\\tWARNING util.py:315 -- Processing trial results took 3.028 s, which may be a performance bottleneck. Please consider reporting results less frequently to Ray Tune.\\n\",\n      \"2023-09-17 22:44:25,144\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.029 s, which may be a performance bottleneck.\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=349841, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000003)\\u001b[32m [repeated 2x across cluster]\\u001b[0m\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:44:33,395\\tWARNING util.py:315 -- The `callbacks.on_trial_result` operation took 3.181 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:33,397\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.183 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:33,398\\tWARNING util.py:315 -- Processing trial results took 3.184 s, which may be a performance bottleneck. Please consider reporting results less frequently to Ray Tune.\\n\",\n      \"2023-09-17 22:44:33,398\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.184 s, which may be a performance bottleneck.\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=349841, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000004)\\u001b[32m [repeated 2x across cluster]\\u001b[0m\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:44:41,574\\tWARNING util.py:315 -- The `callbacks.on_trial_result` operation took 3.101 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:41,576\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.102 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:41,576\\tWARNING util.py:315 -- Processing trial results took 3.103 s, which may be a performance bottleneck. Please consider reporting results less frequently to Ray Tune.\\n\",\n      \"2023-09-17 22:44:41,577\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.104 s, which may be a performance bottleneck.\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=349841, ip=10.0.34.101) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000005)\\u001b[32m [repeated 2x across cluster]\\u001b[0m\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=349841, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:44:49,825\\tWARNING util.py:315 -- The `callbacks.on_trial_result` operation took 3.286 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:49,828\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.289 s, which may be a performance bottleneck.\\n\",\n      \"2023-09-17 22:44:49,828\\tWARNING util.py:315 -- Processing trial results took 3.289 s, which may be a performance bottleneck. Please consider reporting results less frequently to Ray Tune.\\n\",\n      \"2023-09-17 22:44:49,828\\tWARNING util.py:315 -- The `process_trial_result` operation took 3.289 s, which may be a performance bottleneck.\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=349780, ip=10.0.34.101)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_145c1bc2_2_dropout_p=0.8412,lr=0.0001,lr_factor=0.7586,lr_patience=2.2537_2023-09-17_22-43-55/checkpoint_000005)\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000006)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000007)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000008)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=846864) Running 0:   0%|          | 0/64 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Executing DAG InputDataBuffer[Input] -> OutputSplitter[split(1, equal=True)]\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=['c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a'], preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(SplitCoordinator pid=846864)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"\\u001b[2m\\u001b[36m(RayTrainWorker pid=846788)\\u001b[0m Checkpoint successfully created at: Checkpoint(filesystem=local, path=/efs/shared_storage/madewithml/GokuMohandas/TorchTrainer_2023-09-17_22-43-52/TorchTrainer_639d7776_1_dropout_p=0.5000,lr=0.0001,lr_factor=0.8000,lr_patience=3.0000_2023-09-17_22-43-52/checkpoint_000009)\\n\",\n      \"2023-09-17 22:45:41,369\\tINFO tune.py:1143 -- Total run time: 109.13 seconds (109.03 seconds for the tuning loop).\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"CPU times: user 1.67 s, sys: 1.85 s, total: 3.52 s\\n\",\n      \"Wall time: 1min 49s\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"%%time\\n\",\n    \"# Tune\\n\",\n    \"results = tuner.fit()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>epoch</th>\\n\",\n       \"      <th>lr</th>\\n\",\n       \"      <th>train_loss</th>\\n\",\n       \"      <th>val_loss</th>\\n\",\n       \"      <th>timestamp</th>\\n\",\n       \"      <th>should_checkpoint</th>\\n\",\n       \"      <th>done</th>\\n\",\n       \"      <th>training_iteration</th>\\n\",\n       \"      <th>trial_id</th>\\n\",\n       \"      <th>date</th>\\n\",\n       \"      <th>...</th>\\n\",\n       \"      <th>hostname</th>\\n\",\n       \"      <th>node_ip</th>\\n\",\n       \"      <th>time_since_restore</th>\\n\",\n       \"      <th>iterations_since_restore</th>\\n\",\n       \"      <th>checkpoint_dir_name</th>\\n\",\n       \"      <th>config/train_loop_config/dropout_p</th>\\n\",\n       \"      <th>config/train_loop_config/lr</th>\\n\",\n       \"      <th>config/train_loop_config/lr_factor</th>\\n\",\n       \"      <th>config/train_loop_config/lr_patience</th>\\n\",\n       \"      <th>logdir</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>0.000100</td>\\n\",\n       \"      <td>0.052036</td>\\n\",\n       \"      <td>0.096391</td>\\n\",\n       \"      <td>1695015936</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-45-36</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>68.388524</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>checkpoint_000009</td>\\n\",\n       \"      <td>0.500000</td>\\n\",\n       \"      <td>0.000100</td>\\n\",\n       \"      <td>0.800000</td>\\n\",\n       \"      <td>3.000000</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>0.000052</td>\\n\",\n       \"      <td>0.392521</td>\\n\",\n       \"      <td>0.326320</td>\\n\",\n       \"      <td>1695015885</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>145c1bc2</td>\\n\",\n       \"      <td>2023-09-17_22-44-46</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>ip-10-0-34-101</td>\\n\",\n       \"      <td>10.0.34.101</td>\\n\",\n       \"      <td>30.729746</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>checkpoint_000004</td>\\n\",\n       \"      <td>0.841192</td>\\n\",\n       \"      <td>0.000052</td>\\n\",\n       \"      <td>0.758627</td>\\n\",\n       \"      <td>2.253736</td>\\n\",\n       \"      <td>145c1bc2</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"<p>2 rows × 23 columns</p>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   epoch        lr  train_loss  val_loss   timestamp  should_checkpoint  done  \\\\\\n\",\n       \"0      9  0.000100    0.052036  0.096391  1695015936               True  True   \\n\",\n       \"1      4  0.000052    0.392521  0.326320  1695015885               True  True   \\n\",\n       \"\\n\",\n       \"   training_iteration  trial_id                 date  ...        hostname  \\\\\\n\",\n       \"0                  10  639d7776  2023-09-17_22-45-36  ...  ip-10-0-35-174   \\n\",\n       \"1                   5  145c1bc2  2023-09-17_22-44-46  ...  ip-10-0-34-101   \\n\",\n       \"\\n\",\n       \"       node_ip  time_since_restore iterations_since_restore  \\\\\\n\",\n       \"0  10.0.35.174           68.388524                       10   \\n\",\n       \"1  10.0.34.101           30.729746                        5   \\n\",\n       \"\\n\",\n       \"  checkpoint_dir_name  config/train_loop_config/dropout_p  \\\\\\n\",\n       \"0   checkpoint_000009                            0.500000   \\n\",\n       \"1   checkpoint_000004                            0.841192   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/lr config/train_loop_config/lr_factor  \\\\\\n\",\n       \"0                     0.000100                           0.800000   \\n\",\n       \"1                     0.000052                           0.758627   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/lr_patience    logdir  \\n\",\n       \"0                              3.000000  639d7776  \\n\",\n       \"1                              2.253736  145c1bc2  \\n\",\n       \"\\n\",\n       \"[2 rows x 23 columns]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# All trials in experiment\\n\",\n    \"results.get_dataframe()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>epoch</th>\\n\",\n       \"      <th>lr</th>\\n\",\n       \"      <th>train_loss</th>\\n\",\n       \"      <th>val_loss</th>\\n\",\n       \"      <th>timestamp</th>\\n\",\n       \"      <th>should_checkpoint</th>\\n\",\n       \"      <th>done</th>\\n\",\n       \"      <th>training_iteration</th>\\n\",\n       \"      <th>trial_id</th>\\n\",\n       \"      <th>date</th>\\n\",\n       \"      <th>...</th>\\n\",\n       \"      <th>pid</th>\\n\",\n       \"      <th>hostname</th>\\n\",\n       \"      <th>node_ip</th>\\n\",\n       \"      <th>time_since_restore</th>\\n\",\n       \"      <th>iterations_since_restore</th>\\n\",\n       \"      <th>checkpoint_dir_name</th>\\n\",\n       \"      <th>config/train_loop_config/dropout_p</th>\\n\",\n       \"      <th>config/train_loop_config/lr</th>\\n\",\n       \"      <th>config/train_loop_config/lr_factor</th>\\n\",\n       \"      <th>config/train_loop_config/lr_patience</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>0</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.577860</td>\\n\",\n       \"      <td>0.492227</td>\\n\",\n       \"      <td>1695015848</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-44-08</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>12.828465</td>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>checkpoint_000000</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>1</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.475743</td>\\n\",\n       \"      <td>0.387187</td>\\n\",\n       \"      <td>1695015856</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-44-16</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>20.651286</td>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>checkpoint_000001</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>2</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.402374</td>\\n\",\n       \"      <td>0.372390</td>\\n\",\n       \"      <td>1695015864</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-44-24</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>28.235628</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>checkpoint_000002</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.349068</td>\\n\",\n       \"      <td>0.297704</td>\\n\",\n       \"      <td>1695015873</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-44-33</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>35.873792</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>checkpoint_000003</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.256888</td>\\n\",\n       \"      <td>0.207574</td>\\n\",\n       \"      <td>1695015881</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-44-41</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>43.487612</td>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>checkpoint_000004</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>5</th>\\n\",\n       \"      <td>5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.204279</td>\\n\",\n       \"      <td>0.161283</td>\\n\",\n       \"      <td>1695015889</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-44-49</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>51.113538</td>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>checkpoint_000005</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>6</th>\\n\",\n       \"      <td>6</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.142716</td>\\n\",\n       \"      <td>0.138546</td>\\n\",\n       \"      <td>1695015897</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-45-18</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>51.115670</td>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>checkpoint_000006</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>7</th>\\n\",\n       \"      <td>7</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.097615</td>\\n\",\n       \"      <td>0.108034</td>\\n\",\n       \"      <td>1695015924</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-45-24</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>56.781526</td>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>checkpoint_000007</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>8</th>\\n\",\n       \"      <td>8</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.070097</td>\\n\",\n       \"      <td>0.102292</td>\\n\",\n       \"      <td>1695015930</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>False</td>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-45-30</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>62.607184</td>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>checkpoint_000008</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>9</th>\\n\",\n       \"      <td>9</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.052036</td>\\n\",\n       \"      <td>0.096391</td>\\n\",\n       \"      <td>1695015936</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>True</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>639d7776</td>\\n\",\n       \"      <td>2023-09-17_22-45-36</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>846705</td>\\n\",\n       \"      <td>ip-10-0-35-174</td>\\n\",\n       \"      <td>10.0.35.174</td>\\n\",\n       \"      <td>68.388524</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>checkpoint_000009</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"<p>10 rows × 22 columns</p>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   epoch      lr  train_loss  val_loss   timestamp  should_checkpoint   done  \\\\\\n\",\n       \"0      0  0.0001    0.577860  0.492227  1695015848               True  False   \\n\",\n       \"1      1  0.0001    0.475743  0.387187  1695015856               True  False   \\n\",\n       \"2      2  0.0001    0.402374  0.372390  1695015864               True  False   \\n\",\n       \"3      3  0.0001    0.349068  0.297704  1695015873               True  False   \\n\",\n       \"4      4  0.0001    0.256888  0.207574  1695015881               True  False   \\n\",\n       \"5      5  0.0001    0.204279  0.161283  1695015889               True  False   \\n\",\n       \"6      6  0.0001    0.142716  0.138546  1695015897               True  False   \\n\",\n       \"7      7  0.0001    0.097615  0.108034  1695015924               True  False   \\n\",\n       \"8      8  0.0001    0.070097  0.102292  1695015930               True  False   \\n\",\n       \"9      9  0.0001    0.052036  0.096391  1695015936               True   True   \\n\",\n       \"\\n\",\n       \"   training_iteration  trial_id                 date  ...     pid  \\\\\\n\",\n       \"0                   1  639d7776  2023-09-17_22-44-08  ...  846705   \\n\",\n       \"1                   2  639d7776  2023-09-17_22-44-16  ...  846705   \\n\",\n       \"2                   3  639d7776  2023-09-17_22-44-24  ...  846705   \\n\",\n       \"3                   4  639d7776  2023-09-17_22-44-33  ...  846705   \\n\",\n       \"4                   5  639d7776  2023-09-17_22-44-41  ...  846705   \\n\",\n       \"5                   6  639d7776  2023-09-17_22-44-49  ...  846705   \\n\",\n       \"6                   7  639d7776  2023-09-17_22-45-18  ...  846705   \\n\",\n       \"7                   8  639d7776  2023-09-17_22-45-24  ...  846705   \\n\",\n       \"8                   9  639d7776  2023-09-17_22-45-30  ...  846705   \\n\",\n       \"9                  10  639d7776  2023-09-17_22-45-36  ...  846705   \\n\",\n       \"\\n\",\n       \"         hostname      node_ip time_since_restore iterations_since_restore  \\\\\\n\",\n       \"0  ip-10-0-35-174  10.0.35.174          12.828465                        1   \\n\",\n       \"1  ip-10-0-35-174  10.0.35.174          20.651286                        2   \\n\",\n       \"2  ip-10-0-35-174  10.0.35.174          28.235628                        3   \\n\",\n       \"3  ip-10-0-35-174  10.0.35.174          35.873792                        4   \\n\",\n       \"4  ip-10-0-35-174  10.0.35.174          43.487612                        5   \\n\",\n       \"5  ip-10-0-35-174  10.0.35.174          51.113538                        6   \\n\",\n       \"6  ip-10-0-35-174  10.0.35.174          51.115670                        7   \\n\",\n       \"7  ip-10-0-35-174  10.0.35.174          56.781526                        8   \\n\",\n       \"8  ip-10-0-35-174  10.0.35.174          62.607184                        9   \\n\",\n       \"9  ip-10-0-35-174  10.0.35.174          68.388524                       10   \\n\",\n       \"\\n\",\n       \"   checkpoint_dir_name  config/train_loop_config/dropout_p  \\\\\\n\",\n       \"0    checkpoint_000000                                 0.5   \\n\",\n       \"1    checkpoint_000001                                 0.5   \\n\",\n       \"2    checkpoint_000002                                 0.5   \\n\",\n       \"3    checkpoint_000003                                 0.5   \\n\",\n       \"4    checkpoint_000004                                 0.5   \\n\",\n       \"5    checkpoint_000005                                 0.5   \\n\",\n       \"6    checkpoint_000006                                 0.5   \\n\",\n       \"7    checkpoint_000007                                 0.5   \\n\",\n       \"8    checkpoint_000008                                 0.5   \\n\",\n       \"9    checkpoint_000009                                 0.5   \\n\",\n       \"\\n\",\n       \"  config/train_loop_config/lr  config/train_loop_config/lr_factor  \\\\\\n\",\n       \"0                      0.0001                                 0.8   \\n\",\n       \"1                      0.0001                                 0.8   \\n\",\n       \"2                      0.0001                                 0.8   \\n\",\n       \"3                      0.0001                                 0.8   \\n\",\n       \"4                      0.0001                                 0.8   \\n\",\n       \"5                      0.0001                                 0.8   \\n\",\n       \"6                      0.0001                                 0.8   \\n\",\n       \"7                      0.0001                                 0.8   \\n\",\n       \"8                      0.0001                                 0.8   \\n\",\n       \"9                      0.0001                                 0.8   \\n\",\n       \"\\n\",\n       \"   config/train_loop_config/lr_patience  \\n\",\n       \"0                                   3.0  \\n\",\n       \"1                                   3.0  \\n\",\n       \"2                                   3.0  \\n\",\n       \"3                                   3.0  \\n\",\n       \"4                                   3.0  \\n\",\n       \"5                                   3.0  \\n\",\n       \"6                                   3.0  \\n\",\n       \"7                                   3.0  \\n\",\n       \"8                                   3.0  \\n\",\n       \"9                                   3.0  \\n\",\n       \"\\n\",\n       \"[10 rows x 22 columns]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Best trial's epochs\\n\",\n    \"best_trial = results.get_best_result(metric=\\\"val_loss\\\", mode=\\\"min\\\")\\n\",\n    \"best_trial.metrics_dataframe\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'dropout_p': 0.5, 'lr': 0.0001, 'lr_factor': 0.8, 'lr_patience': 3.0}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Best trial's hyperparameters\\n\",\n    \"best_trial.config[\\\"train_loop_config\\\"]\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>run_id</th>\\n\",\n       \"      <th>experiment_id</th>\\n\",\n       \"      <th>status</th>\\n\",\n       \"      <th>artifact_uri</th>\\n\",\n       \"      <th>start_time</th>\\n\",\n       \"      <th>end_time</th>\\n\",\n       \"      <th>metrics.time_total_s</th>\\n\",\n       \"      <th>metrics.config/train_loop_config/lr_patience</th>\\n\",\n       \"      <th>metrics.time_since_restore</th>\\n\",\n       \"      <th>metrics.iterations_since_restore</th>\\n\",\n       \"      <th>...</th>\\n\",\n       \"      <th>metrics.config/train_loop_config/num_epochs</th>\\n\",\n       \"      <th>params.train_loop_config/lr</th>\\n\",\n       \"      <th>params.train_loop_config/lr_patience</th>\\n\",\n       \"      <th>params.train_loop_config/dropout_p</th>\\n\",\n       \"      <th>params.train_loop_config/lr_factor</th>\\n\",\n       \"      <th>params.train_loop_config/num_classes</th>\\n\",\n       \"      <th>params.train_loop_config/num_epochs</th>\\n\",\n       \"      <th>params.train_loop_config/batch_size</th>\\n\",\n       \"      <th>tags.trial_name</th>\\n\",\n       \"      <th>tags.mlflow.runName</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>ebc5576cd02e4430bbe949612a25bd45</td>\\n\",\n       \"      <td>703905858072772764</td>\\n\",\n       \"      <td>FINISHED</td>\\n\",\n       \"      <td>file:///efs/shared_storage/madewithml/GokuMoha...</td>\\n\",\n       \"      <td>2023-09-18 05:43:55.499000+00:00</td>\\n\",\n       \"      <td>2023-09-18 05:45:41.257000+00:00</td>\\n\",\n       \"      <td>68.388524</td>\\n\",\n       \"      <td>3.000000</td>\\n\",\n       \"      <td>68.388524</td>\\n\",\n       \"      <td>10.0</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>NaN</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>3.0</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>None</td>\\n\",\n       \"      <td>None</td>\\n\",\n       \"      <td>None</td>\\n\",\n       \"      <td>TorchTrainer_639d7776</td>\\n\",\n       \"      <td>TorchTrainer_639d7776</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>a67f6ec4e10b49a7845b91db61efc7e0</td>\\n\",\n       \"      <td>703905858072772764</td>\\n\",\n       \"      <td>FINISHED</td>\\n\",\n       \"      <td>file:///efs/shared_storage/madewithml/GokuMoha...</td>\\n\",\n       \"      <td>2023-09-18 05:42:12.863000+00:00</td>\\n\",\n       \"      <td>2023-09-18 05:43:30.925000+00:00</td>\\n\",\n       \"      <td>63.699444</td>\\n\",\n       \"      <td>3.000000</td>\\n\",\n       \"      <td>63.699444</td>\\n\",\n       \"      <td>10.0</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>10.0</td>\\n\",\n       \"      <td>0.0001</td>\\n\",\n       \"      <td>3</td>\\n\",\n       \"      <td>0.5</td>\\n\",\n       \"      <td>0.8</td>\\n\",\n       \"      <td>4</td>\\n\",\n       \"      <td>10</td>\\n\",\n       \"      <td>256</td>\\n\",\n       \"      <td>TorchTrainer_1bd07_00000</td>\\n\",\n       \"      <td>TorchTrainer_1bd07_00000</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>0d8a50554ecf498cb6f1471b58aedb9d</td>\\n\",\n       \"      <td>703905858072772764</td>\\n\",\n       \"      <td>FINISHED</td>\\n\",\n       \"      <td>file:///efs/shared_storage/madewithml/GokuMoha...</td>\\n\",\n       \"      <td>2023-09-18 05:43:59.010000+00:00</td>\\n\",\n       \"      <td>2023-09-18 05:45:17.549000+00:00</td>\\n\",\n       \"      <td>30.729746</td>\\n\",\n       \"      <td>2.253736</td>\\n\",\n       \"      <td>30.729746</td>\\n\",\n       \"      <td>5.0</td>\\n\",\n       \"      <td>...</td>\\n\",\n       \"      <td>NaN</td>\\n\",\n       \"      <td>5.1804178109970566e-05</td>\\n\",\n       \"      <td>2.253735644669187</td>\\n\",\n       \"      <td>0.8411920116073033</td>\\n\",\n       \"      <td>0.7586266131367906</td>\\n\",\n       \"      <td>None</td>\\n\",\n       \"      <td>None</td>\\n\",\n       \"      <td>None</td>\\n\",\n       \"      <td>TorchTrainer_145c1bc2</td>\\n\",\n       \"      <td>TorchTrainer_145c1bc2</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"<p>3 rows × 35 columns</p>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"                             run_id       experiment_id    status  \\\\\\n\",\n       \"0  ebc5576cd02e4430bbe949612a25bd45  703905858072772764  FINISHED   \\n\",\n       \"1  a67f6ec4e10b49a7845b91db61efc7e0  703905858072772764  FINISHED   \\n\",\n       \"2  0d8a50554ecf498cb6f1471b58aedb9d  703905858072772764  FINISHED   \\n\",\n       \"\\n\",\n       \"                                        artifact_uri  \\\\\\n\",\n       \"0  file:///efs/shared_storage/madewithml/GokuMoha...   \\n\",\n       \"1  file:///efs/shared_storage/madewithml/GokuMoha...   \\n\",\n       \"2  file:///efs/shared_storage/madewithml/GokuMoha...   \\n\",\n       \"\\n\",\n       \"                        start_time                         end_time  \\\\\\n\",\n       \"0 2023-09-18 05:43:55.499000+00:00 2023-09-18 05:45:41.257000+00:00   \\n\",\n       \"1 2023-09-18 05:42:12.863000+00:00 2023-09-18 05:43:30.925000+00:00   \\n\",\n       \"2 2023-09-18 05:43:59.010000+00:00 2023-09-18 05:45:17.549000+00:00   \\n\",\n       \"\\n\",\n       \"   metrics.time_total_s  metrics.config/train_loop_config/lr_patience  \\\\\\n\",\n       \"0             68.388524                                      3.000000   \\n\",\n       \"1             63.699444                                      3.000000   \\n\",\n       \"2             30.729746                                      2.253736   \\n\",\n       \"\\n\",\n       \"   metrics.time_since_restore  metrics.iterations_since_restore  ...  \\\\\\n\",\n       \"0                   68.388524                              10.0  ...   \\n\",\n       \"1                   63.699444                              10.0  ...   \\n\",\n       \"2                   30.729746                               5.0  ...   \\n\",\n       \"\\n\",\n       \"   metrics.config/train_loop_config/num_epochs  params.train_loop_config/lr  \\\\\\n\",\n       \"0                                          NaN                       0.0001   \\n\",\n       \"1                                         10.0                       0.0001   \\n\",\n       \"2                                          NaN       5.1804178109970566e-05   \\n\",\n       \"\\n\",\n       \"   params.train_loop_config/lr_patience  params.train_loop_config/dropout_p  \\\\\\n\",\n       \"0                                   3.0                                 0.5   \\n\",\n       \"1                                     3                                 0.5   \\n\",\n       \"2                     2.253735644669187                  0.8411920116073033   \\n\",\n       \"\\n\",\n       \"   params.train_loop_config/lr_factor  params.train_loop_config/num_classes  \\\\\\n\",\n       \"0                                 0.8                                  None   \\n\",\n       \"1                                 0.8                                     4   \\n\",\n       \"2                  0.7586266131367906                                  None   \\n\",\n       \"\\n\",\n       \"   params.train_loop_config/num_epochs  params.train_loop_config/batch_size  \\\\\\n\",\n       \"0                                 None                                 None   \\n\",\n       \"1                                   10                                  256   \\n\",\n       \"2                                 None                                 None   \\n\",\n       \"\\n\",\n       \"            tags.trial_name       tags.mlflow.runName  \\n\",\n       \"0     TorchTrainer_639d7776     TorchTrainer_639d7776  \\n\",\n       \"1  TorchTrainer_1bd07_00000  TorchTrainer_1bd07_00000  \\n\",\n       \"2     TorchTrainer_145c1bc2     TorchTrainer_145c1bc2  \\n\",\n       \"\\n\",\n       \"[3 rows x 35 columns]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Sorted runs\\n\",\n    \"sorted_runs = mlflow.search_runs(experiment_names=[experiment_name], order_by=[\\\"metrics.val_loss ASC\\\"])\\n\",\n    \"sorted_runs\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"# Artifacts\\n\",\n    \"best_checkpoint = get_best_checkpoint(run_id=best_run.run_id)\\n\",\n    \"predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"preprocessor = predictor.get_preprocessor()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:45:42,824\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:45:42,824\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:45:42,825\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:45:43,740\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor)]\\n\",\n      \"2023-09-17 22:45:43,741\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:45:43,742\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess)->MapBatches(TorchPredictor) pid=350325, ip=10.0.34.101)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.9168092951711627,\\n\",\n      \"  \\\"recall\\\": 0.9109947643979057,\\n\",\n      \"  \\\"f1\\\": 0.9105512639658029\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Evaluate on test split\\n\",\n    \"performance = evaluate(ds=test_ds, predictor=predictor)\\n\",\n    \"print (json.dumps(performance, indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:45:49,875\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:45:49,875\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:45:49,876\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'prediction': 'natural-language-processing',\\n\",\n       \"  'probabilities': {'computer-vision': 0.00043165276,\\n\",\n       \"   'mlops': 0.0008155016,\\n\",\n       \"   'natural-language-processing': 0.9978746,\\n\",\n       \"   'other': 0.0008782037}}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Predict on sample\\n\",\n    \"title = \\\"Transfer learning with transformers\\\"\\n\",\n    \"description = \\\"Using transformers for transfer learning on text classification tasks.\\\"\\n\",\n    \"sample_ds = ray.data.from_items([{\\\"title\\\": title, \\\"description\\\": description, \\\"tag\\\": \\\"other\\\"}])\\n\",\n    \"predict_proba(ds=sample_ds, predictor=predictor)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"9ofaM94omwgY\"\n   },\n   \"source\": [\n    \"# ⚖️ Evaluation\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"nsj8_EUEmynv\"\n   },\n   \"source\": [\n    \"So far we've been evaluating our models by determing the overall precision, recall and f1 scores. But since performance is one of the key decision making factors when comparing different models, we should have even more nuanced evaluation strategies.\\n\",\n    \"\\n\",\n    \"- Coarse-grained metrics\\n\",\n    \"- Fine-grained metrics\\n\",\n    \"- Confusion matrix\\n\",\n    \"- Confidence learning\\n\",\n    \"- Slice metrics\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"h51AAn1Fu4b5\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Metrics\\n\",\n    \"metrics = {\\\"overall\\\": {}, \\\"class\\\": {}}\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [],\n   \"source\": [\n    \"# Artifacts\\n\",\n    \"predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"preprocessor = predictor.get_preprocessor()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"H8BgzzHBZNMn\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:45:52,090\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(<lambda>)]\\n\",\n      \"2023-09-17 22:45:52,091\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:45:52,091\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# y_test\\n\",\n    \"preprocessed_ds = preprocessor.transform(test_ds)\\n\",\n    \"values = preprocessed_ds.select_columns(cols=[\\\"targets\\\"]).take_all()\\n\",\n    \"y_test = np.stack([item[\\\"targets\\\"] for item in values])\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:45:52,987\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:45:52,988\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:45:52,988\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# y_prob\\n\",\n    \"outputs = preprocessed_ds.map_batches(predictor.predict_proba)\\n\",\n    \"y_prob = np.array([d[\\\"output\\\"] for d in outputs.take_all()])\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"(191,)\\n\",\n      \"(191, 4)\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# y_prob\\n\",\n    \"print (np.shape(y_test))\\n\",\n    \"print (np.shape(y_prob))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Read progress 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Read progress 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>id</th>\\n\",\n       \"      <th>created_on</th>\\n\",\n       \"      <th>title</th>\\n\",\n       \"      <th>description</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"      <th>text</th>\\n\",\n       \"      <th>prediction</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>0</th>\\n\",\n       \"      <td>19</td>\\n\",\n       \"      <td>2020-03-03 13:54:31</td>\\n\",\n       \"      <td>Diffusion to Vector</td>\\n\",\n       \"      <td>Reference implementation of Diffusion2Vec (Com...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"      <td>Diffusion to Vector Reference implementation o...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>1</th>\\n\",\n       \"      <td>26</td>\\n\",\n       \"      <td>2020-03-07 23:11:58</td>\\n\",\n       \"      <td>Graph Wavelet Neural Network</td>\\n\",\n       \"      <td>A PyTorch implementation of \\\"Graph Wavelet Neu...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"      <td>Graph Wavelet Neural Network A PyTorch impleme...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>2</th>\\n\",\n       \"      <td>44</td>\\n\",\n       \"      <td>2020-03-08 00:32:58</td>\\n\",\n       \"      <td>Capsule Graph Neural Network</td>\\n\",\n       \"      <td>A PyTorch implementation of \\\"Capsule Graph Neu...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"      <td>Capsule Graph Neural Network A PyTorch impleme...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>3</th>\\n\",\n       \"      <td>80</td>\\n\",\n       \"      <td>2020-03-20 05:59:32</td>\\n\",\n       \"      <td>NeRF: Neural Radiance Fields</td>\\n\",\n       \"      <td>Representing scenes as neural radiance fields ...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"      <td>NeRF: Neural Radiance Fields Representing scen...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>4</th>\\n\",\n       \"      <td>84</td>\\n\",\n       \"      <td>2020-03-20 15:18:43</td>\\n\",\n       \"      <td>Mention Classifier</td>\\n\",\n       \"      <td>Category prediction model\\\\nThis repo contains ...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"      <td>Mention Classifier Category prediction model\\\\n...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"   id          created_on                         title  \\\\\\n\",\n       \"0  19 2020-03-03 13:54:31           Diffusion to Vector   \\n\",\n       \"1  26 2020-03-07 23:11:58  Graph Wavelet Neural Network   \\n\",\n       \"2  44 2020-03-08 00:32:58  Capsule Graph Neural Network   \\n\",\n       \"3  80 2020-03-20 05:59:32  NeRF: Neural Radiance Fields   \\n\",\n       \"4  84 2020-03-20 15:18:43            Mention Classifier   \\n\",\n       \"\\n\",\n       \"                                         description  \\\\\\n\",\n       \"0  Reference implementation of Diffusion2Vec (Com...   \\n\",\n       \"1  A PyTorch implementation of \\\"Graph Wavelet Neu...   \\n\",\n       \"2  A PyTorch implementation of \\\"Capsule Graph Neu...   \\n\",\n       \"3  Representing scenes as neural radiance fields ...   \\n\",\n       \"4  Category prediction model\\\\nThis repo contains ...   \\n\",\n       \"\\n\",\n       \"                           tag  \\\\\\n\",\n       \"0                        other   \\n\",\n       \"1                        other   \\n\",\n       \"2                        other   \\n\",\n       \"3              computer-vision   \\n\",\n       \"4  natural-language-processing   \\n\",\n       \"\\n\",\n       \"                                                text  \\\\\\n\",\n       \"0  Diffusion to Vector Reference implementation o...   \\n\",\n       \"1  Graph Wavelet Neural Network A PyTorch impleme...   \\n\",\n       \"2  Capsule Graph Neural Network A PyTorch impleme...   \\n\",\n       \"3  NeRF: Neural Radiance Fields Representing scen...   \\n\",\n       \"4  Mention Classifier Category prediction model\\\\n...   \\n\",\n       \"\\n\",\n       \"                    prediction  \\n\",\n       \"0              computer-vision  \\n\",\n       \"1                        other  \\n\",\n       \"2                        other  \\n\",\n       \"3              computer-vision  \\n\",\n       \"4  natural-language-processing  \"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Add columns (for convenience)\\n\",\n    \"test_df = test_ds.to_pandas()\\n\",\n    \"test_df[\\\"text\\\"] = test_df[\\\"title\\\"] + \\\" \\\" + test_df[\\\"description\\\"]\\n\",\n    \"test_df[\\\"prediction\\\"] = test_df.index.map(lambda i: preprocessor.index_to_class[y_pred[i]])\\n\",\n    \"test_df.head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"TiXcls5JoNA8\"\n   },\n   \"source\": [\n    \"### Coarse-grained metrics\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"h2OQtNODrh6c\",\n    \"outputId\": \"4c15bd9d-3465-4476-f02a-282aaaae0a91\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"    \\\"precision\\\": 0.9138952286238713,\\n\",\n      \"    \\\"recall\\\": 0.9109947643979057,\\n\",\n      \"    \\\"f1\\\": 0.9114851103432928,\\n\",\n      \"    \\\"num_samples\\\": 191.0\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Overall metrics\\n\",\n    \"overall_metrics = precision_recall_fscore_support(y_test, y_pred, average=\\\"weighted\\\")\\n\",\n    \"metrics[\\\"overall\\\"][\\\"precision\\\"] = overall_metrics[0]\\n\",\n    \"metrics[\\\"overall\\\"][\\\"recall\\\"] = overall_metrics[1]\\n\",\n    \"metrics[\\\"overall\\\"][\\\"f1\\\"] = overall_metrics[2]\\n\",\n    \"metrics[\\\"overall\\\"][\\\"num_samples\\\"] = np.float64(len(y_test))\\n\",\n    \"print (json.dumps(metrics[\\\"overall\\\"], indent=4))\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"zl3xSuXRutKG\"\n   },\n   \"source\": [\n    \"### Fine-grained metrics\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"jqetm3ybN9C1\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from collections import OrderedDict\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"1zIAI4mwusoX\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Per-class metrics\\n\",\n    \"class_metrics = precision_recall_fscore_support(y_test, y_pred, average=None)\\n\",\n    \"for i, _class in enumerate(preprocessor.class_to_index):\\n\",\n    \"    metrics[\\\"class\\\"][_class] = {\\n\",\n    \"        \\\"precision\\\": class_metrics[0][i],\\n\",\n    \"        \\\"recall\\\": class_metrics[1][i],\\n\",\n    \"        \\\"f1\\\": class_metrics[2][i],\\n\",\n    \"        \\\"num_samples\\\": np.float64(class_metrics[3][i]),\\n\",\n    \"    }\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"Rhh-tgpP0dvj\",\n    \"outputId\": \"1de2a5eb-b9fb-4d23-d890-39f7310e868c\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"precision\\\": 0.9146341463414634,\\n\",\n      \"  \\\"recall\\\": 0.9615384615384616,\\n\",\n      \"  \\\"f1\\\": 0.9375000000000001,\\n\",\n      \"  \\\"num_samples\\\": 78.0\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Metrics for a specific class\\n\",\n    \"tag = \\\"natural-language-processing\\\"\\n\",\n    \"print (json.dumps(metrics[\\\"class\\\"][tag], indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"vQVA6G-j__t5\",\n    \"outputId\": \"960e8f1e-21e9-4bc7-f284-ae4800c77913\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"[\\n\",\n      \"  \\\"other\\\",\\n\",\n      \"  {\\n\",\n      \"    \\\"precision\\\": 0.96,\\n\",\n      \"    \\\"recall\\\": 0.9230769230769231,\\n\",\n      \"    \\\"f1\\\": 0.9411764705882353,\\n\",\n      \"    \\\"num_samples\\\": 26.0\\n\",\n      \"  }\\n\",\n      \"]\\n\",\n      \"[\\n\",\n      \"  \\\"natural-language-processing\\\",\\n\",\n      \"  {\\n\",\n      \"    \\\"precision\\\": 0.9146341463414634,\\n\",\n      \"    \\\"recall\\\": 0.9615384615384616,\\n\",\n      \"    \\\"f1\\\": 0.9375000000000001,\\n\",\n      \"    \\\"num_samples\\\": 78.0\\n\",\n      \"  }\\n\",\n      \"]\\n\",\n      \"[\\n\",\n      \"  \\\"computer-vision\\\",\\n\",\n      \"  {\\n\",\n      \"    \\\"precision\\\": 0.9393939393939394,\\n\",\n      \"    \\\"recall\\\": 0.8732394366197183,\\n\",\n      \"    \\\"f1\\\": 0.9051094890510948,\\n\",\n      \"    \\\"num_samples\\\": 71.0\\n\",\n      \"  }\\n\",\n      \"]\\n\",\n      \"[\\n\",\n      \"  \\\"mlops\\\",\\n\",\n      \"  {\\n\",\n      \"    \\\"precision\\\": 0.7222222222222222,\\n\",\n      \"    \\\"recall\\\": 0.8125,\\n\",\n      \"    \\\"f1\\\": 0.7647058823529411,\\n\",\n      \"    \\\"num_samples\\\": 16.0\\n\",\n      \"  }\\n\",\n      \"]\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Sorted tags\\n\",\n    \"sorted_tags_by_f1 = OrderedDict(sorted(\\n\",\n    \"        metrics[\\\"class\\\"].items(), key=lambda tag: tag[1][\\\"f1\\\"], reverse=True))\\n\",\n    \"for item in sorted_tags_by_f1.items():\\n\",\n    \"    print (json.dumps(item, indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"f-juex26zvBF\"\n   },\n   \"source\": [\n    \"### Confusion matrix\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"xPUao0S4k99c\"\n   },\n   \"source\": [\n    \"- **True positives (TP)**: learn about where our model performs well.\\n\",\n    \"- **False positives (FP)**: potentially identify samples which may need to be relabeled.\\n\",\n    \"- False negatives (FN): identify the model's less performant areas to oversample later.\\n\",\n    \"\\n\",\n    \"> It's a good to have our FP/FN samples feed back into our annotation pipelines in the event we want to fix their labels and have those changes be reflected everywhere.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"ZG2SgsPAzukL\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# TP, FP, FN samples\\n\",\n    \"tag = \\\"natural-language-processing\\\"\\n\",\n    \"index = preprocessor.class_to_index[tag]\\n\",\n    \"tp, fp, fn = [], [], []\\n\",\n    \"for i, true in enumerate(y_test):\\n\",\n    \"    pred = y_pred[i]\\n\",\n    \"    if index==true==pred:\\n\",\n    \"        tp.append(i)\\n\",\n    \"    elif index!=true and index==pred:\\n\",\n    \"        fp.append(i)\\n\",\n    \"    elif index==true and index!=pred:\\n\",\n    \"        fn.append(i)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"ePrxeVkG0mmO\",\n    \"outputId\": \"c13e3881-e527-4a2a-b1dd-ef15187425ab\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"[4, 9, 12, 17, 19, 23, 25, 26, 29, 30, 31, 32, 33, 34, 42, 47, 49, 50, 54, 56, 65, 66, 68, 71, 75, 77, 78, 79, 82, 92, 94, 95, 97, 99, 101, 109, 113, 114, 115, 118, 120, 122, 126, 128, 129, 130, 131, 133, 134, 135, 138, 139, 140, 141, 142, 144, 148, 149, 152, 159, 160, 161, 163, 166, 170, 172, 173, 174, 177, 179, 183, 184, 187, 189, 190]\\n\",\n      \"[41, 61, 102, 104, 154, 165, 188]\\n\",\n      \"[16, 76, 112]\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"print (tp)\\n\",\n    \"print (fp)\\n\",\n    \"print (fn)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\n\",\n      \"=== True positives ===\\n\",\n      \"Mention Classifier Category prediction model\\n\",\n      \"This repo contains AllenNLP model for prediction of Named Entity categories by its mentions.\\n\",\n      \"    true: natural-language-processing\\n\",\n      \"    pred: natural-language-processing\\n\",\n      \"\\n\",\n      \"Finetune: Scikit-learn Style Model Finetuning for NLP Finetune is a library that allows users to leverage state-of-the-art pretrained NLP models for a wide variety of downstream tasks.\\n\",\n      \"    true: natural-language-processing\\n\",\n      \"    pred: natural-language-processing\\n\",\n      \"\\n\",\n      \"Finetuning Transformers with JAX + Haiku Walking through a port of the RoBERTa pre-trained model to JAX + Haiku, then fine-tuning the model to solve a downstream task.\\n\",\n      \"    true: natural-language-processing\\n\",\n      \"    pred: natural-language-processing\\n\",\n      \"\\n\",\n      \"\\n\",\n      \"=== False positives ===\\n\",\n      \"How Docker Can Help You Become A More Effective Data Scientist A look at Docker from the perspective of a data scientist.\\n\",\n      \"    true: mlops\\n\",\n      \"    pred: natural-language-processing\\n\",\n      \"\\n\",\n      \"Differential Subspace Search in High-Dimensional Latent Space Differential subspace search to allow efficient iterative user exploration in such a space, without relying on domain- or data-specific assumptions.\\n\",\n      \"    true: computer-vision\\n\",\n      \"    pred: natural-language-processing\\n\",\n      \"\\n\",\n      \"EfficientDet (PyTorch) A PyTorch implementation of EfficientDet faithful to the original Google implementation with ported weights.\\n\",\n      \"    true: computer-vision\\n\",\n      \"    pred: natural-language-processing\\n\",\n      \"\\n\",\n      \"\\n\",\n      \"=== False negatives ===\\n\",\n      \"The Unreasonable Effectiveness of Recurrent Neural Networks A close look at how RNNs are able to perform so well.\\n\",\n      \"    true: natural-language-processing\\n\",\n      \"    pred: computer-vision\\n\",\n      \"\\n\",\n      \"Get Subreddit Suggestions for a Post Trained on 4M Reddit posts from 4k Subreddits. End-to-end ML pipeline built with fasttext and FastAPI, deployed to Valohai.\\n\",\n      \"    true: natural-language-processing\\n\",\n      \"    pred: computer-vision\\n\",\n      \"\\n\",\n      \"Machine Learning Projects  This Repo contains projects done by me while learning the basics. All the familiar types of regression, classification, and clustering methods have been used.\\n\",\n      \"    true: natural-language-processing\\n\",\n      \"    pred: mlops\\n\",\n      \"\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Samples\\n\",\n    \"num_samples = 3\\n\",\n    \"cm = [(tp, \\\"True positives\\\"), (fp, \\\"False positives\\\"), (fn, \\\"False negatives\\\")]\\n\",\n    \"for item in cm:\\n\",\n    \"    if len(item[0]):\\n\",\n    \"        print (f\\\"\\\\n=== {item[1]} ===\\\")\\n\",\n    \"        for index in item[0][:num_samples]:\\n\",\n    \"            print (f\\\"{test_df.iloc[index].text}\\\")\\n\",\n    \"            print (f\\\"    true: {test_df.tag[index]}\\\")\\n\",\n    \"            print (f\\\"    pred: {test_df.prediction[index]}\\\\n\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"6S5LZdP2Myjh\"\n   },\n   \"source\": [\n    \"### Confidence learning\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"ZW5nY_h-M08p\"\n   },\n   \"source\": [\n    \"While the confusion-matrix sample analysis was a coarse-grained process, we can also use fine-grained confidence based approaches to identify potentially mislabeled samples. Here we’re going to focus on the specific labeling quality as opposed to the final model predictions.\\n\",\n    \"\\n\",\n    \"Simple confidence based techniques include identifying samples whose:\\n\",\n    \"\\n\",\n    \"**Categorical**\\n\",\n    \"- prediction is incorrect (also indicate TN, FP, FN)\\n\",\n    \"- confidence score for the correct class is below a threshold\\n\",\n    \"- confidence score for an incorrect class is above a threshold\\n\",\n    \"- standard deviation of confidence scores over top N samples is low\\n\",\n    \"- different predictions from same model using different parameters\\n\",\n    \"\\n\",\n    \"**Continuous**\\n\",\n    \"- difference between predicted and ground-truth values is above some %\\n\",\n    \"\\n\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"OuN8xKFZlo2t\"\n   },\n   \"source\": [\n    \"> The operations in this section can be applied to entire labeled dataset to discover labeling errors via confidence learning.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"3FCrRUb2GANr\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Tag to inspect\\n\",\n    \"tag = \\\"natural-language-processing\\\"\\n\",\n    \"index = class_to_index[tag]\\n\",\n    \"indices = np.where(y_test==index)[0]\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"sKQxFU0iU-w-\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Confidence score for the correct class is below a threshold\\n\",\n    \"low_confidence = []\\n\",\n    \"min_threshold = 0.5\\n\",\n    \"for i in indices:\\n\",\n    \"    prob = y_prob[i][index]\\n\",\n    \"    if prob <= 0.5:\\n\",\n    \"        low_confidence.append({\\n\",\n    \"            \\\"text\\\": f\\\"{test_df.iloc[i].text}\\\",\\n\",\n    \"            \\\"true\\\": test_df.tag[i], \\n\",\n    \"            \\\"pred\\\": test_df.prediction[i], \\n\",\n    \"            \\\"prob\\\": prob})\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"7DnkXhXFFMv_\",\n    \"outputId\": \"c93cd01b-8ad1-4e63-8254-79f885534ffb\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"[{'text': 'The Unreasonable Effectiveness of Recurrent Neural Networks A close look at how RNNs are able to perform so well.',\\n\",\n       \"  'true': 'natural-language-processing',\\n\",\n       \"  'pred': 'computer-vision',\\n\",\n       \"  'prob': 0.008757317},\\n\",\n       \" {'text': 'Machine Learning Projects  This Repo contains projects done by me while learning the basics. All the familiar types of regression, classification, and clustering methods have been used.',\\n\",\n       \"  'true': 'natural-language-processing',\\n\",\n       \"  'pred': 'mlops',\\n\",\n       \"  'prob': 0.020190474}]\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"low_confidence[0:3]\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"JwL1ltdiUjH2\"\n   },\n   \"source\": [\n    \"But these are fairly crude techniques because neural networks are easily [overconfident](https://arxiv.org/abs/1706.04599) and so their confidences cannot be used without calibrating them. \\n\",\n    \"\\n\",\n    \"<div class=\\\"ai-center-all\\\">\\n\",\n    \"    <img src=\\\"https://madewithml.com/static/images/mlops/evaluation/calibration.png\\\" width=\\\"300\\\" alt=\\\"accuracy vs. confidence\\\">\\n\",\n    \"</div>\\n\",\n    \"<div class=\\\"ai-center-all mt-1\\\">\\n\",\n    \"  <small>Modern (large) neural networks result in higher accuracies but are over confident.<br><a href=\\\"https://arxiv.org/abs/1706.04599\\\" target=\\\"_blank\\\">On Calibration of Modern Neural Networks</a></small>\\n\",\n    \"</div>\\n\",\n    \"\\n\",\n    \"* **Assumption**: *“the probability associated with the predicted class label should reflect its ground truth correctness likelihood.”*\\n\",\n    \"* **Reality**: *“modern (large) neural networks are no longer well-calibrated”*\\n\",\n    \"* **Solution**: apply temperature scaling (extension of [Platt scaling](https://en.wikipedia.org/wiki/Platt_scaling){:target=\\\"_blank\\\"}) on model outputs\\n\",\n    \"\\n\",\n    \"Recent work on [confident learning](https://arxiv.org/abs/1911.00068) focuses on identifying noisy labels while accounting for this overconfidence which can then be properly relabeled and used for training.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"XX3cORGPPXXM\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import cleanlab\\n\",\n    \"from cleanlab.filter import find_label_issues\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"*** SIGTERM received at time=1695015958 on cpu 1 ***\\n\",\n      \"PC: @           0x4edd8a  (unknown)  _PyEval_MakeFrameVector\\n\",\n      \"    @     0x7fe3ff0e9420  514711536  (unknown)\\n\",\n      \"    @           0x72c720  (unknown)  (unknown)\\n\",\n      \"[2023-09-17 22:45:58,798 E 848689 841208] logging.cc:361: *** SIGTERM received at time=1695015958 on cpu 1 ***\\n\",\n      \"[2023-09-17 22:45:58,799 E 848689 841208] logging.cc:361: PC: @           0x4edd8a  (unknown)  _PyEval_MakeFrameVector\\n\",\n      \"[2023-09-17 22:45:58,803 E 848689 841208] logging.cc:361:     @     0x7fe3ff0e9420  514711536  (unknown)\\n\",\n      \"[2023-09-17 22:45:58,808 E 848689 841208] logging.cc:361:     @           0x72c720  (unknown)  (unknown)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>id</th>\\n\",\n       \"      <th>created_on</th>\\n\",\n       \"      <th>title</th>\\n\",\n       \"      <th>description</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"      <th>prediction</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>103</th>\\n\",\n       \"      <td>1459</td>\\n\",\n       \"      <td>2020-06-16 03:06:10</td>\\n\",\n       \"      <td>SuperGlue: Learning Feature Matching with Grap...</td>\\n\",\n       \"      <td>SuperGlue, a neural network that matches two s...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>102</th>\\n\",\n       \"      <td>1451</td>\\n\",\n       \"      <td>2020-06-16 01:21:09</td>\\n\",\n       \"      <td>EfficientDet (PyTorch)</td>\\n\",\n       \"      <td>A PyTorch implementation of EfficientDet faith...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>165</th>\\n\",\n       \"      <td>2137</td>\\n\",\n       \"      <td>2020-08-13 02:10:03</td>\\n\",\n       \"      <td>Unpopular Opinion - Data Scientists Should Be ...</td>\\n\",\n       \"      <td>I believe data scientists can be more effectiv...</td>\\n\",\n       \"      <td>mlops</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>61</th>\\n\",\n       \"      <td>710</td>\\n\",\n       \"      <td>2020-05-05 04:01:24</td>\\n\",\n       \"      <td>Differential Subspace Search in High-Dimension...</td>\\n\",\n       \"      <td>Differential subspace search to allow efficien...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>16</th>\\n\",\n       \"      <td>264</td>\\n\",\n       \"      <td>2020-04-06 21:33:32</td>\\n\",\n       \"      <td>The Unreasonable Effectiveness of Recurrent Ne...</td>\\n\",\n       \"      <td>A close look at how RNNs are able to perform s...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"       id          created_on  \\\\\\n\",\n       \"103  1459 2020-06-16 03:06:10   \\n\",\n       \"102  1451 2020-06-16 01:21:09   \\n\",\n       \"165  2137 2020-08-13 02:10:03   \\n\",\n       \"61    710 2020-05-05 04:01:24   \\n\",\n       \"16    264 2020-04-06 21:33:32   \\n\",\n       \"\\n\",\n       \"                                                 title  \\\\\\n\",\n       \"103  SuperGlue: Learning Feature Matching with Grap...   \\n\",\n       \"102                             EfficientDet (PyTorch)   \\n\",\n       \"165  Unpopular Opinion - Data Scientists Should Be ...   \\n\",\n       \"61   Differential Subspace Search in High-Dimension...   \\n\",\n       \"16   The Unreasonable Effectiveness of Recurrent Ne...   \\n\",\n       \"\\n\",\n       \"                                           description  \\\\\\n\",\n       \"103  SuperGlue, a neural network that matches two s...   \\n\",\n       \"102  A PyTorch implementation of EfficientDet faith...   \\n\",\n       \"165  I believe data scientists can be more effectiv...   \\n\",\n       \"61   Differential subspace search to allow efficien...   \\n\",\n       \"16   A close look at how RNNs are able to perform s...   \\n\",\n       \"\\n\",\n       \"                             tag                   prediction  \\n\",\n       \"103                        other              computer-vision  \\n\",\n       \"102              computer-vision  natural-language-processing  \\n\",\n       \"165                        mlops  natural-language-processing  \\n\",\n       \"61               computer-vision  natural-language-processing  \\n\",\n       \"16   natural-language-processing              computer-vision  \"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Find label issues\\n\",\n    \"label_issues = find_label_issues(labels=y_test, pred_probs=y_prob, return_indices_ranked_by=\\\"self_confidence\\\")\\n\",\n    \"test_df.iloc[label_issues].drop(columns=[\\\"text\\\"]).head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"UtXjpKf9FU4C\"\n   },\n   \"source\": [\n    \"Not all of these are necessarily labeling errors but situations where the predicted probabilities were not so confident. Therefore, it will be useful to attach the predictions alongside the data. This way, we can know if we need to relabel, upsample, etc. to improve our performance. Analysis like this could also shed light on the task itself. For example, you may notice that some projects involve multiple data modalities and so it's difficult to just assing one tag. So perhaps it might be better to make this taks a multilabel classification task instead (it does but we simplified it for this course).\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"dvS3UpusXP_R\"\n   },\n   \"source\": [\n    \"### Slice metrics\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"eeWWMG38Ny4U\"\n   },\n   \"source\": [\n    \"Just inspecting the overall and class metrics isn't enough to deploy our new version to production. There may be key slices of our dataset that we need to do really well on:\\n\",\n    \"\\n\",\n    \"- Target / predicted classes (+ combinations)\\n\",\n    \"- Features (explicit and implicit)\\n\",\n    \"- Metadata (timestamps, sources, etc.)\\n\",\n    \"- Priority slices / experience (minority groups, large customers, etc.)\\n\",\n    \"\\n\",\n    \"An easy way to create and evaluate slices is to define slicing functions.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"ZyueOtQsXdGm\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from snorkel.slicing import PandasSFApplier\\n\",\n    \"from snorkel.slicing import slice_dataframe\\n\",\n    \"from snorkel.slicing import slicing_function\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"coutP2KtXdLG\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"@slicing_function()\\n\",\n    \"def nlp_llm(x):\\n\",\n    \"    \\\"\\\"\\\"NLP projects that use LLMs.\\\"\\\"\\\"\\n\",\n    \"    nlp_project = \\\"natural-language-processing\\\" in x.tag\\n\",\n    \"    llm_terms = [\\\"transformer\\\", \\\"llm\\\", \\\"bert\\\"]\\n\",\n    \"    llm_project = any(s.lower() in x.text.lower() for s in llm_terms)\\n\",\n    \"    return (nlp_project and llm_project)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"PbxmLvi-D7lq\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"@slicing_function()\\n\",\n    \"def short_text(x):\\n\",\n    \"    \\\"\\\"\\\"Projects with short titles and descriptions.\\\"\\\"\\\"\\n\",\n    \"    return len(x.text.split()) < 8  # less than 8 words\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"2Vxg5X9OD-Ax\"\n   },\n   \"source\": [\n    \"Here we're using Snorkel's [`slicing_function`](https://snorkel.readthedocs.io/en/latest/packages/_autosummary/slicing/snorkel.slicing.slicing_function.html) to create our different slices. We can visualize our slices by applying this slicing function to a relevant DataFrame using [`slice_dataframe`](https://snorkel.readthedocs.io/en/latest/packages/_autosummary/slicing/snorkel.slicing.slice_dataframe.html).\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\",\n     \"height\": 98\n    },\n    \"id\": \"VRs93KeBMthW\",\n    \"outputId\": \"b58e5925-7b89-4925-8afc-2f1eaa9b91db\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [00:00<00:00, 32805.57it/s]\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>text</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>12</th>\\n\",\n       \"      <td>Finetuning Transformers with JAX + Haiku Walki...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>19</th>\\n\",\n       \"      <td>Question Answering with a Fine-Tuned BERT What...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>29</th>\\n\",\n       \"      <td>BertViz Tool for visualizing attention in the ...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>30</th>\\n\",\n       \"      <td>The Transformer Family This post presents how ...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>31</th>\\n\",\n       \"      <td>Pruning Bert to Accelerate Inference After pre...</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"                                                 text  \\\\\\n\",\n       \"12  Finetuning Transformers with JAX + Haiku Walki...   \\n\",\n       \"19  Question Answering with a Fine-Tuned BERT What...   \\n\",\n       \"29  BertViz Tool for visualizing attention in the ...   \\n\",\n       \"30  The Transformer Family This post presents how ...   \\n\",\n       \"31  Pruning Bert to Accelerate Inference After pre...   \\n\",\n       \"\\n\",\n       \"                            tag  \\n\",\n       \"12  natural-language-processing  \\n\",\n       \"19  natural-language-processing  \\n\",\n       \"29  natural-language-processing  \\n\",\n       \"30  natural-language-processing  \\n\",\n       \"31  natural-language-processing  \"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"nlp_llm_df = slice_dataframe(test_df, nlp_llm)\\n\",\n    \"nlp_llm_df[[\\\"text\\\", \\\"tag\\\"]].head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\",\n     \"height\": 224\n    },\n    \"id\": \"B7jmdmNaXuA2\",\n    \"outputId\": \"84b59a83-9e58-44f1-f5c4-98e1a31507ea\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [00:00<00:00, 64413.61it/s]\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<div>\\n\",\n       \"<style scoped>\\n\",\n       \"    .dataframe tbody tr th:only-of-type {\\n\",\n       \"        vertical-align: middle;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe tbody tr th {\\n\",\n       \"        vertical-align: top;\\n\",\n       \"    }\\n\",\n       \"\\n\",\n       \"    .dataframe thead th {\\n\",\n       \"        text-align: right;\\n\",\n       \"    }\\n\",\n       \"</style>\\n\",\n       \"<table border=\\\"1\\\" class=\\\"dataframe\\\">\\n\",\n       \"  <thead>\\n\",\n       \"    <tr style=\\\"text-align: right;\\\">\\n\",\n       \"      <th></th>\\n\",\n       \"      <th>text</th>\\n\",\n       \"      <th>tag</th>\\n\",\n       \"    </tr>\\n\",\n       \"  </thead>\\n\",\n       \"  <tbody>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>75</th>\\n\",\n       \"      <td>NLPAug Data augmentation for NLP</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>123</th>\\n\",\n       \"      <td>Offline Reinforcement Learning Challenges, alg...</td>\\n\",\n       \"      <td>other</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>127</th>\\n\",\n       \"      <td>Image Classifier Pure JavaScript Image Classifier</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>132</th>\\n\",\n       \"      <td>imgaug Image augmentation for machine learning...</td>\\n\",\n       \"      <td>computer-vision</td>\\n\",\n       \"    </tr>\\n\",\n       \"    <tr>\\n\",\n       \"      <th>140</th>\\n\",\n       \"      <td>QSVM Quantum SVM for sentiment analysis</td>\\n\",\n       \"      <td>natural-language-processing</td>\\n\",\n       \"    </tr>\\n\",\n       \"  </tbody>\\n\",\n       \"</table>\\n\",\n       \"</div>\"\n      ],\n      \"text/plain\": [\n       \"                                                  text  \\\\\\n\",\n       \"75                    NLPAug Data augmentation for NLP   \\n\",\n       \"123  Offline Reinforcement Learning Challenges, alg...   \\n\",\n       \"127  Image Classifier Pure JavaScript Image Classifier   \\n\",\n       \"132  imgaug Image augmentation for machine learning...   \\n\",\n       \"140            QSVM Quantum SVM for sentiment analysis   \\n\",\n       \"\\n\",\n       \"                             tag  \\n\",\n       \"75   natural-language-processing  \\n\",\n       \"123                        other  \\n\",\n       \"127              computer-vision  \\n\",\n       \"132              computer-vision  \\n\",\n       \"140  natural-language-processing  \"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"short_text_df = slice_dataframe(test_df, short_text)\\n\",\n    \"short_text_df[[\\\"text\\\", \\\"tag\\\"]].head()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"kZuDZwTNO93Q\"\n   },\n   \"source\": [\n    \"We can define even more slicing functions and create a slices record array using the [`PandasSFApplier`](https://snorkel.readthedocs.io/en/latest/packages/_autosummary/slicing/snorkel.slicing.PandasSFApplier.html). The slices array has N (# of data points) items and each item has S (# of slicing functions) items, indicating whether that data point is part of that slice. Think of this record array as a masking layer for each slicing function on our data.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"mQG8PFovXfEm\",\n    \"outputId\": \"22f16ecb-ed18-4502-e734-7fe73041d597\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"100%|██████████| 191/191 [00:00<00:00, 27137.02it/s]\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"rec.array([(0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (1, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (1, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (1, 0), (1, 0), (1, 0),\\n\",\n       \"           (1, 0), (0, 0), (1, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (1, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (1, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 1), (0, 0), (0, 0), (1, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (1, 0), (0, 0),\\n\",\n       \"           (0, 0), (1, 0), (0, 0), (0, 0), (0, 0), (1, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (1, 0), (1, 0), (1, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (1, 0), (0, 0), (0, 0), (0, 1), (0, 0), (0, 0), (0, 0), (0, 1),\\n\",\n       \"           (1, 0), (0, 0), (1, 0), (1, 0), (0, 1), (1, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (1, 0), (0, 1), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 1), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (1, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (1, 0), (1, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (1, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (1, 0), (0, 0), (0, 0), (0, 1), (0, 0), (0, 0), (0, 0),\\n\",\n       \"           (0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (1, 0), (0, 0)],\\n\",\n       \"          dtype=[('nlp_llm', '<i8'), ('short_text', '<i8')])\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Slices\\n\",\n    \"slicing_functions = [nlp_llm, short_text]\\n\",\n    \"applier = PandasSFApplier(slicing_functions)\\n\",\n    \"slices = applier.apply(test_df)\\n\",\n    \"slices\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"QAWPU-f-GIOD\"\n   },\n   \"source\": [\n    \"To calculate metrics for our slices, we could use [snorkel.analysis.Scorer](https://snorkel.readthedocs.io/en/latest/packages/_autosummary/analysis/snorkel.analysis.Scorer.html) but we've implemented a version that will work for multiclass or multilabel scenarios.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"GqkwQenBXfIa\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Score slices\\n\",\n    \"metrics[\\\"slices\\\"] = {}\\n\",\n    \"for slice_name in slices.dtype.names:\\n\",\n    \"    mask = slices[slice_name].astype(bool)\\n\",\n    \"    if sum(mask):  \\n\",\n    \"        slice_metrics = precision_recall_fscore_support(\\n\",\n    \"            y_test[mask], y_pred[mask], average=\\\"micro\\\"\\n\",\n    \"        )\\n\",\n    \"        metrics[\\\"slices\\\"][slice_name] = {}\\n\",\n    \"        metrics[\\\"slices\\\"][slice_name][\\\"precision\\\"] = slice_metrics[0]\\n\",\n    \"        metrics[\\\"slices\\\"][slice_name][\\\"recall\\\"] = slice_metrics[1]\\n\",\n    \"        metrics[\\\"slices\\\"][slice_name][\\\"f1\\\"] = slice_metrics[2]\\n\",\n    \"        metrics[\\\"slices\\\"][slice_name][\\\"num_samples\\\"] = len(y_test[mask])\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"QapvZ3bgX3J6\",\n    \"outputId\": \"38dcc4d9-8d90-4edb-a218-c6228d9c22c4\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"{\\n\",\n      \"  \\\"nlp_llm\\\": {\\n\",\n      \"    \\\"precision\\\": 1.0,\\n\",\n      \"    \\\"recall\\\": 1.0,\\n\",\n      \"    \\\"f1\\\": 1.0,\\n\",\n      \"    \\\"num_samples\\\": 28\\n\",\n      \"  },\\n\",\n      \"  \\\"short_text\\\": {\\n\",\n      \"    \\\"precision\\\": 0.8571428571428571,\\n\",\n      \"    \\\"recall\\\": 0.8571428571428571,\\n\",\n      \"    \\\"f1\\\": 0.8571428571428571,\\n\",\n      \"    \\\"num_samples\\\": 7\\n\",\n      \"  }\\n\",\n      \"}\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"print(json.dumps(metrics[\\\"slices\\\"], indent=2))\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"AmEOEHFEMyI1\"\n   },\n   \"source\": [\n    \"Slicing can help identify sources of *bias* in our data. For example, our model has most likely learned to associated algorithms with certain applications such as CNNs used for computer vision or transformers used for NLP projects. However, these algorithms are not being applied beyond their initial use cases. We’d need ensure that our model learns to focus on the application over algorithm. This could be learned with:\\n\",\n    \"\\n\",\n    \"- enough data (new or oversampling incorrect predictions)\\n\",\n    \"- masking the algorithm (using text matching heuristics).\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"TuCLIa2c9YEY\"\n   },\n   \"source\": [\n    \"### Interpretability\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"4v0CxdbqLCvd\"\n   },\n   \"source\": [\n    \"Besides just comparing predicted outputs with ground truth values, we can also inspect the inputs to our models. What aspects of the input are more influential towards the prediction? If the focus is not on the relevant features of our input, then we need to explore if there is a hidden pattern we're missing or if our model has learned to overfit on the incorrect features. We can use techniques such as [SHAP](https://github.com/slundberg/shap) (SHapley Additive exPlanations) or [LIME](https://github.com/marcotcr/lime) (Local Interpretable Model-agnostic Explanations) to inspect feature importance. On a high level, these techniques learn which features have the most signal by assessing the performance in their absence. These inspections can be performed on a global level (ex. per-class) or on a local level (ex. single prediction).\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"aW6CPXnPC61M\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from lime.lime_text import LimeTextExplainer\\n\",\n    \"from sklearn.pipeline import make_pipeline\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"ndrizK-DLRSA\"\n   },\n   \"source\": [\n    \"[`LimeTextExplainer.explain_instance`](https://lime-ml.readthedocs.io/en/latest/lime.html#lime.lime_text.LimeTextExplainer.explain_instance) function requires a `classifier_fn` that takes in a list of strings and outputs the predicted probabilities.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"id\": \"5dYPTovdL6QX\",\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"def classifier_fn(texts):\\n\",\n    \"    ds = ray.data.from_items([{\\\"title\\\": text, \\\"description\\\": \\\"\\\", \\\"tag\\\": \\\"other\\\"} for text in texts])\\n\",\n    \"    preprocessed_ds = preprocessor.transform(ds)\\n\",\n    \"    outputs = preprocessed_ds.map_batches(predictor.predict_proba)\\n\",\n    \"    y_prob = np.array([d[\\\"output\\\"] for d in outputs.take_all()])\\n\",\n    \"    return y_prob\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\",\n     \"height\": 273\n    },\n    \"id\": \"r1tR1lyJC68X\",\n    \"outputId\": \"4f229f39-f90a-4a05-d4b1-04dcab505b53\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:45:59,447\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:45:59,447\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:45:59,448\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/200 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/html\": [\n       \"<html>\\n\",\n       \"        <meta http-equiv=\\\"content-type\\\" content=\\\"text/html; charset=UTF8\\\">\\n\",\n       \"        <head><script>var lime =\\n\",\n       \"/******/ (function(modules) { // webpackBootstrap\\n\",\n       \"/******/ \\t// The module cache\\n\",\n       \"/******/ \\tvar installedModules = {};\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t// The require function\\n\",\n       \"/******/ \\tfunction __webpack_require__(moduleId) {\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t\\t// Check if module is in cache\\n\",\n       \"/******/ \\t\\tif(installedModules[moduleId])\\n\",\n       \"/******/ \\t\\t\\treturn installedModules[moduleId].exports;\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t\\t// Create a new module (and put it into the cache)\\n\",\n       \"/******/ \\t\\tvar module = installedModules[moduleId] = {\\n\",\n       \"/******/ \\t\\t\\texports: {},\\n\",\n       \"/******/ \\t\\t\\tid: moduleId,\\n\",\n       \"/******/ \\t\\t\\tloaded: false\\n\",\n       \"/******/ \\t\\t};\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t\\t// Execute the module function\\n\",\n       \"/******/ \\t\\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t\\t// Flag the module as loaded\\n\",\n       \"/******/ \\t\\tmodule.loaded = true;\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t\\t// Return the exports of the module\\n\",\n       \"/******/ \\t\\treturn module.exports;\\n\",\n       \"/******/ \\t}\\n\",\n       \"/******/\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t// expose the modules object (__webpack_modules__)\\n\",\n       \"/******/ \\t__webpack_require__.m = modules;\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t// expose the module cache\\n\",\n       \"/******/ \\t__webpack_require__.c = installedModules;\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t// __webpack_public_path__\\n\",\n       \"/******/ \\t__webpack_require__.p = \\\"\\\";\\n\",\n       \"/******/\\n\",\n       \"/******/ \\t// Load entry module and return exports\\n\",\n       \"/******/ \\treturn __webpack_require__(0);\\n\",\n       \"/******/ })\\n\",\n       \"/************************************************************************/\\n\",\n       \"/******/ ([\\n\",\n       \"/* 0 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */(function(global) {'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tObject.defineProperty(exports, \\\"__esModule\\\", {\\n\",\n       \"\\t  value: true\\n\",\n       \"\\t});\\n\",\n       \"\\texports.PredictedValue = exports.PredictProba = exports.Barchart = exports.Explanation = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\tvar _explanation = __webpack_require__(1);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _explanation2 = _interopRequireDefault(_explanation);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _bar_chart = __webpack_require__(3);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _bar_chart2 = _interopRequireDefault(_bar_chart);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _predict_proba = __webpack_require__(6);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _predict_proba2 = _interopRequireDefault(_predict_proba);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _predicted_value = __webpack_require__(7);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _predicted_value2 = _interopRequireDefault(_predicted_value);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\\n\",\n       \"\\t\\n\",\n       \"\\tif (!global._babelPolyfill) {\\n\",\n       \"\\t  __webpack_require__(8);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(339);\\n\",\n       \"\\t\\n\",\n       \"\\texports.Explanation = _explanation2.default;\\n\",\n       \"\\texports.Barchart = _bar_chart2.default;\\n\",\n       \"\\texports.PredictProba = _predict_proba2.default;\\n\",\n       \"\\texports.PredictedValue = _predicted_value2.default;\\n\",\n       \"\\t//require('style-loader');\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }())))\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 1 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tObject.defineProperty(exports, \\\"__esModule\\\", {\\n\",\n       \"\\t  value: true\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar _slicedToArray = function () { function sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\\\"return\\\"]) _i[\\\"return\\\"](); } finally { if (_d) throw _e; } } return _arr; } return function (arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return sliceIterator(arr, i); } else { throw new TypeError(\\\"Invalid attempt to destructure non-iterable instance\\\"); } }; }();\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d2 = __webpack_require__(2);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d3 = _interopRequireDefault(_d2);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _bar_chart = __webpack_require__(3);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _bar_chart2 = _interopRequireDefault(_bar_chart);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _lodash = __webpack_require__(4);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\\\"Cannot call a class as a function\\\"); } }\\n\",\n       \"\\t\\n\",\n       \"\\tvar Explanation = function () {\\n\",\n       \"\\t  function Explanation(class_names) {\\n\",\n       \"\\t    _classCallCheck(this, Explanation);\\n\",\n       \"\\t\\n\",\n       \"\\t    this.names = class_names;\\n\",\n       \"\\t    if (class_names.length < 10) {\\n\",\n       \"\\t      this.colors = _d3.default.scale.category10().domain(this.names);\\n\",\n       \"\\t      this.colors_i = _d3.default.scale.category10().domain((0, _lodash.range)(this.names.length));\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      this.colors = _d3.default.scale.category20().domain(this.names);\\n\",\n       \"\\t      this.colors_i = _d3.default.scale.category20().domain((0, _lodash.range)(this.names.length));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  // exp: [(feature-name, weight), ...]\\n\",\n       \"\\t  // label: int\\n\",\n       \"\\t  // div: d3 selection\\n\",\n       \"\\t\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.show = function show(exp, label, div) {\\n\",\n       \"\\t    var svg = div.append('svg').style('width', '100%');\\n\",\n       \"\\t    var colors = ['#5F9EA0', this.colors_i(label)];\\n\",\n       \"\\t    var names = ['NOT ' + this.names[label], this.names[label]];\\n\",\n       \"\\t    if (this.names.length == 2) {\\n\",\n       \"\\t      colors = [this.colors_i(0), this.colors_i(1)];\\n\",\n       \"\\t      names = this.names;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var plot = new _bar_chart2.default(svg, exp, true, names, colors, true, 10);\\n\",\n       \"\\t    svg.style('height', plot.svg_height + 'px');\\n\",\n       \"\\t  };\\n\",\n       \"\\t  // exp has all ocurrences of words, with start index and weight:\\n\",\n       \"\\t  // exp = [('word', 132, -0.13), ('word3', 111, 1.3)\\n\",\n       \"\\t\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.show_raw_text = function show_raw_text(exp, label, raw, div) {\\n\",\n       \"\\t    var opacity = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;\\n\",\n       \"\\t\\n\",\n       \"\\t    //let colors=['#5F9EA0', this.colors(this.exp['class'])];\\n\",\n       \"\\t    var colors = ['#5F9EA0', this.colors_i(label)];\\n\",\n       \"\\t    if (this.names.length == 2) {\\n\",\n       \"\\t      colors = [this.colors_i(0), this.colors_i(1)];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var word_lists = [[], []];\\n\",\n       \"\\t    var max_weight = -1;\\n\",\n       \"\\t    var _iteratorNormalCompletion = true;\\n\",\n       \"\\t    var _didIteratorError = false;\\n\",\n       \"\\t    var _iteratorError = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      for (var _iterator = exp[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n\",\n       \"\\t        var _step$value = _slicedToArray(_step.value, 3),\\n\",\n       \"\\t            word = _step$value[0],\\n\",\n       \"\\t            start = _step$value[1],\\n\",\n       \"\\t            weight = _step$value[2];\\n\",\n       \"\\t\\n\",\n       \"\\t        if (weight > 0) {\\n\",\n       \"\\t          word_lists[1].push([start, start + word.length, weight]);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          word_lists[0].push([start, start + word.length, -weight]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        max_weight = Math.max(max_weight, Math.abs(weight));\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError = true;\\n\",\n       \"\\t      _iteratorError = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion && _iterator.return) {\\n\",\n       \"\\t          _iterator.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError) {\\n\",\n       \"\\t          throw _iteratorError;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    if (!opacity) {\\n\",\n       \"\\t      max_weight = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    this.display_raw_text(div, raw, word_lists, colors, max_weight, true);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  // exp is list of (feature_name, value, weight)\\n\",\n       \"\\t\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.show_raw_tabular = function show_raw_tabular(exp, label, div) {\\n\",\n       \"\\t    div.classed('lime', true).classed('table_div', true);\\n\",\n       \"\\t    var colors = ['#5F9EA0', this.colors_i(label)];\\n\",\n       \"\\t    if (this.names.length == 2) {\\n\",\n       \"\\t      colors = [this.colors_i(0), this.colors_i(1)];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var table = div.append('table');\\n\",\n       \"\\t    var thead = table.append('tr');\\n\",\n       \"\\t    thead.append('td').text('Feature');\\n\",\n       \"\\t    thead.append('td').text('Value');\\n\",\n       \"\\t    thead.style('color', 'black').style('font-size', '20px');\\n\",\n       \"\\t    var _iteratorNormalCompletion2 = true;\\n\",\n       \"\\t    var _didIteratorError2 = false;\\n\",\n       \"\\t    var _iteratorError2 = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      for (var _iterator2 = exp[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n\",\n       \"\\t        var _step2$value = _slicedToArray(_step2.value, 3),\\n\",\n       \"\\t            fname = _step2$value[0],\\n\",\n       \"\\t            value = _step2$value[1],\\n\",\n       \"\\t            weight = _step2$value[2];\\n\",\n       \"\\t\\n\",\n       \"\\t        var tr = table.append('tr');\\n\",\n       \"\\t        tr.style('border-style', 'hidden');\\n\",\n       \"\\t        tr.append('td').text(fname);\\n\",\n       \"\\t        tr.append('td').text(value);\\n\",\n       \"\\t        if (weight > 0) {\\n\",\n       \"\\t          tr.style('background-color', colors[1]);\\n\",\n       \"\\t        } else if (weight < 0) {\\n\",\n       \"\\t          tr.style('background-color', colors[0]);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          tr.style('color', 'black');\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError2 = true;\\n\",\n       \"\\t      _iteratorError2 = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion2 && _iterator2.return) {\\n\",\n       \"\\t          _iterator2.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError2) {\\n\",\n       \"\\t          throw _iteratorError2;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.hexToRgb = function hexToRgb(hex) {\\n\",\n       \"\\t    var result = /^#?([a-f\\\\d]{2})([a-f\\\\d]{2})([a-f\\\\d]{2})$/i.exec(hex);\\n\",\n       \"\\t    return result ? {\\n\",\n       \"\\t      r: parseInt(result[1], 16),\\n\",\n       \"\\t      g: parseInt(result[2], 16),\\n\",\n       \"\\t      b: parseInt(result[3], 16)\\n\",\n       \"\\t    } : null;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.applyAlpha = function applyAlpha(hex, alpha) {\\n\",\n       \"\\t    var components = this.hexToRgb(hex);\\n\",\n       \"\\t    return 'rgba(' + components.r + \\\",\\\" + components.g + \\\",\\\" + components.b + \\\",\\\" + alpha.toFixed(3) + \\\")\\\";\\n\",\n       \"\\t  };\\n\",\n       \"\\t  // sord_lists is an array of arrays, of length (colors). if with_positions is true,\\n\",\n       \"\\t  // word_lists is an array of [start,end] positions instead\\n\",\n       \"\\t\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.display_raw_text = function display_raw_text(div, raw_text) {\\n\",\n       \"\\t    var word_lists = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];\\n\",\n       \"\\t    var colors = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];\\n\",\n       \"\\t    var max_weight = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 1;\\n\",\n       \"\\t    var positions = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : false;\\n\",\n       \"\\t\\n\",\n       \"\\t    div.classed('lime', true).classed('text_div', true);\\n\",\n       \"\\t    div.append('h3').text('Text with highlighted words');\\n\",\n       \"\\t    var highlight_tag = 'span';\\n\",\n       \"\\t    var text_span = div.append('span').style('white-space', 'pre-wrap').text(raw_text);\\n\",\n       \"\\t    var position_lists = word_lists;\\n\",\n       \"\\t    if (!positions) {\\n\",\n       \"\\t      position_lists = this.wordlists_to_positions(word_lists, raw_text);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var objects = [];\\n\",\n       \"\\t    var _iteratorNormalCompletion3 = true;\\n\",\n       \"\\t    var _didIteratorError3 = false;\\n\",\n       \"\\t    var _iteratorError3 = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      var _loop = function _loop() {\\n\",\n       \"\\t        var i = _step3.value;\\n\",\n       \"\\t\\n\",\n       \"\\t        position_lists[i].map(function (x) {\\n\",\n       \"\\t          return objects.push({ 'label': i, 'start': x[0], 'end': x[1], 'alpha': max_weight === 0 ? 1 : x[2] / max_weight });\\n\",\n       \"\\t        });\\n\",\n       \"\\t      };\\n\",\n       \"\\t\\n\",\n       \"\\t      for (var _iterator3 = (0, _lodash.range)(position_lists.length)[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n\",\n       \"\\t        _loop();\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError3 = true;\\n\",\n       \"\\t      _iteratorError3 = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion3 && _iterator3.return) {\\n\",\n       \"\\t          _iterator3.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError3) {\\n\",\n       \"\\t          throw _iteratorError3;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    objects = (0, _lodash.sortBy)(objects, function (x) {\\n\",\n       \"\\t      return x['start'];\\n\",\n       \"\\t    });\\n\",\n       \"\\t    var node = text_span.node().childNodes[0];\\n\",\n       \"\\t    var subtract = 0;\\n\",\n       \"\\t    var _iteratorNormalCompletion4 = true;\\n\",\n       \"\\t    var _didIteratorError4 = false;\\n\",\n       \"\\t    var _iteratorError4 = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      for (var _iterator4 = objects[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n\",\n       \"\\t        var obj = _step4.value;\\n\",\n       \"\\t\\n\",\n       \"\\t        var word = raw_text.slice(obj.start, obj.end);\\n\",\n       \"\\t        var start = obj.start - subtract;\\n\",\n       \"\\t        var end = obj.end - subtract;\\n\",\n       \"\\t        var match = document.createElement(highlight_tag);\\n\",\n       \"\\t        match.appendChild(document.createTextNode(word));\\n\",\n       \"\\t        match.style.backgroundColor = this.applyAlpha(colors[obj.label], obj.alpha);\\n\",\n       \"\\t        var after = node.splitText(start);\\n\",\n       \"\\t        after.nodeValue = after.nodeValue.substring(word.length);\\n\",\n       \"\\t        node.parentNode.insertBefore(match, after);\\n\",\n       \"\\t        subtract += end;\\n\",\n       \"\\t        node = after;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError4 = true;\\n\",\n       \"\\t      _iteratorError4 = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion4 && _iterator4.return) {\\n\",\n       \"\\t          _iterator4.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError4) {\\n\",\n       \"\\t          throw _iteratorError4;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  Explanation.prototype.wordlists_to_positions = function wordlists_to_positions(word_lists, raw_text) {\\n\",\n       \"\\t    var ret = [];\\n\",\n       \"\\t    var _iteratorNormalCompletion5 = true;\\n\",\n       \"\\t    var _didIteratorError5 = false;\\n\",\n       \"\\t    var _iteratorError5 = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      for (var _iterator5 = word_lists[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\\n\",\n       \"\\t        var words = _step5.value;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (words.length === 0) {\\n\",\n       \"\\t          ret.push([]);\\n\",\n       \"\\t          continue;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var re = new RegExp(\\\"\\\\\\\\b(\\\" + words.join('|') + \\\")\\\\\\\\b\\\", 'gm');\\n\",\n       \"\\t        var temp = void 0;\\n\",\n       \"\\t        var list = [];\\n\",\n       \"\\t        while ((temp = re.exec(raw_text)) !== null) {\\n\",\n       \"\\t          list.push([temp.index, temp.index + temp[0].length]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        ret.push(list);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError5 = true;\\n\",\n       \"\\t      _iteratorError5 = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion5 && _iterator5.return) {\\n\",\n       \"\\t          _iterator5.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError5) {\\n\",\n       \"\\t          throw _iteratorError5;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    return ret;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  return Explanation;\\n\",\n       \"\\t}();\\n\",\n       \"\\t\\n\",\n       \"\\texports.default = Explanation;\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 2 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_RESULT__;!function() {\\n\",\n       \"\\t  var d3 = {\\n\",\n       \"\\t    version: \\\"3.5.17\\\"\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_arraySlice = [].slice, d3_array = function(list) {\\n\",\n       \"\\t    return d3_arraySlice.call(list);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_document = this.document;\\n\",\n       \"\\t  function d3_documentElement(node) {\\n\",\n       \"\\t    return node && (node.ownerDocument || node.document || node).documentElement;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_window(node) {\\n\",\n       \"\\t    return node && (node.ownerDocument && node.ownerDocument.defaultView || node.document && node || node.defaultView);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  if (d3_document) {\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      d3_array(d3_document.documentElement.childNodes)[0].nodeType;\\n\",\n       \"\\t    } catch (e) {\\n\",\n       \"\\t      d3_array = function(list) {\\n\",\n       \"\\t        var i = list.length, array = new Array(i);\\n\",\n       \"\\t        while (i--) array[i] = list[i];\\n\",\n       \"\\t        return array;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  if (!Date.now) Date.now = function() {\\n\",\n       \"\\t    return +new Date();\\n\",\n       \"\\t  };\\n\",\n       \"\\t  if (d3_document) {\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      d3_document.createElement(\\\"DIV\\\").style.setProperty(\\\"opacity\\\", 0, \\\"\\\");\\n\",\n       \"\\t    } catch (error) {\\n\",\n       \"\\t      var d3_element_prototype = this.Element.prototype, d3_element_setAttribute = d3_element_prototype.setAttribute, d3_element_setAttributeNS = d3_element_prototype.setAttributeNS, d3_style_prototype = this.CSSStyleDeclaration.prototype, d3_style_setProperty = d3_style_prototype.setProperty;\\n\",\n       \"\\t      d3_element_prototype.setAttribute = function(name, value) {\\n\",\n       \"\\t        d3_element_setAttribute.call(this, name, value + \\\"\\\");\\n\",\n       \"\\t      };\\n\",\n       \"\\t      d3_element_prototype.setAttributeNS = function(space, local, value) {\\n\",\n       \"\\t        d3_element_setAttributeNS.call(this, space, local, value + \\\"\\\");\\n\",\n       \"\\t      };\\n\",\n       \"\\t      d3_style_prototype.setProperty = function(name, value, priority) {\\n\",\n       \"\\t        d3_style_setProperty.call(this, name, value + \\\"\\\", priority);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.ascending = d3_ascending;\\n\",\n       \"\\t  function d3_ascending(a, b) {\\n\",\n       \"\\t    return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.descending = function(a, b) {\\n\",\n       \"\\t    return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.min = function(array, f) {\\n\",\n       \"\\t    var i = -1, n = array.length, a, b;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) if ((b = array[i]) != null && b >= b) {\\n\",\n       \"\\t        a = b;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) if ((b = array[i]) != null && a > b) a = b;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) if ((b = f.call(array, array[i], i)) != null && b >= b) {\\n\",\n       \"\\t        a = b;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) if ((b = f.call(array, array[i], i)) != null && a > b) a = b;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return a;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.max = function(array, f) {\\n\",\n       \"\\t    var i = -1, n = array.length, a, b;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) if ((b = array[i]) != null && b >= b) {\\n\",\n       \"\\t        a = b;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) if ((b = array[i]) != null && b > a) a = b;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) if ((b = f.call(array, array[i], i)) != null && b >= b) {\\n\",\n       \"\\t        a = b;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) if ((b = f.call(array, array[i], i)) != null && b > a) a = b;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return a;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.extent = function(array, f) {\\n\",\n       \"\\t    var i = -1, n = array.length, a, b, c;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) if ((b = array[i]) != null && b >= b) {\\n\",\n       \"\\t        a = c = b;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) if ((b = array[i]) != null) {\\n\",\n       \"\\t        if (a > b) a = b;\\n\",\n       \"\\t        if (c < b) c = b;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) if ((b = f.call(array, array[i], i)) != null && b >= b) {\\n\",\n       \"\\t        a = c = b;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) if ((b = f.call(array, array[i], i)) != null) {\\n\",\n       \"\\t        if (a > b) a = b;\\n\",\n       \"\\t        if (c < b) c = b;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return [ a, c ];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_number(x) {\\n\",\n       \"\\t    return x === null ? NaN : +x;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_numeric(x) {\\n\",\n       \"\\t    return !isNaN(x);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.sum = function(array, f) {\\n\",\n       \"\\t    var s = 0, n = array.length, a, i = -1;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) if (d3_numeric(a = +array[i])) s += a;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) if (d3_numeric(a = +f.call(array, array[i], i))) s += a;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return s;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.mean = function(array, f) {\\n\",\n       \"\\t    var s = 0, n = array.length, a, i = -1, j = n;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) if (d3_numeric(a = d3_number(array[i]))) s += a; else --j;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) if (d3_numeric(a = d3_number(f.call(array, array[i], i)))) s += a; else --j;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (j) return s / j;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.quantile = function(values, p) {\\n\",\n       \"\\t    var H = (values.length - 1) * p + 1, h = Math.floor(H), v = +values[h - 1], e = H - h;\\n\",\n       \"\\t    return e ? v + e * (values[h] - v) : v;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.median = function(array, f) {\\n\",\n       \"\\t    var numbers = [], n = array.length, a, i = -1;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) if (d3_numeric(a = d3_number(array[i]))) numbers.push(a);\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) if (d3_numeric(a = d3_number(f.call(array, array[i], i)))) numbers.push(a);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (numbers.length) return d3.quantile(numbers.sort(d3_ascending), .5);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.variance = function(array, f) {\\n\",\n       \"\\t    var n = array.length, m = 0, a, d, s = 0, i = -1, j = 0;\\n\",\n       \"\\t    if (arguments.length === 1) {\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (d3_numeric(a = d3_number(array[i]))) {\\n\",\n       \"\\t          d = a - m;\\n\",\n       \"\\t          m += d / ++j;\\n\",\n       \"\\t          s += d * (a - m);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (d3_numeric(a = d3_number(f.call(array, array[i], i)))) {\\n\",\n       \"\\t          d = a - m;\\n\",\n       \"\\t          m += d / ++j;\\n\",\n       \"\\t          s += d * (a - m);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (j > 1) return s / (j - 1);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.deviation = function() {\\n\",\n       \"\\t    var v = d3.variance.apply(this, arguments);\\n\",\n       \"\\t    return v ? Math.sqrt(v) : v;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_bisector(compare) {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      left: function(a, x, lo, hi) {\\n\",\n       \"\\t        if (arguments.length < 3) lo = 0;\\n\",\n       \"\\t        if (arguments.length < 4) hi = a.length;\\n\",\n       \"\\t        while (lo < hi) {\\n\",\n       \"\\t          var mid = lo + hi >>> 1;\\n\",\n       \"\\t          if (compare(a[mid], x) < 0) lo = mid + 1; else hi = mid;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return lo;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      right: function(a, x, lo, hi) {\\n\",\n       \"\\t        if (arguments.length < 3) lo = 0;\\n\",\n       \"\\t        if (arguments.length < 4) hi = a.length;\\n\",\n       \"\\t        while (lo < hi) {\\n\",\n       \"\\t          var mid = lo + hi >>> 1;\\n\",\n       \"\\t          if (compare(a[mid], x) > 0) hi = mid; else lo = mid + 1;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return lo;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_bisect = d3_bisector(d3_ascending);\\n\",\n       \"\\t  d3.bisectLeft = d3_bisect.left;\\n\",\n       \"\\t  d3.bisect = d3.bisectRight = d3_bisect.right;\\n\",\n       \"\\t  d3.bisector = function(f) {\\n\",\n       \"\\t    return d3_bisector(f.length === 1 ? function(d, x) {\\n\",\n       \"\\t      return d3_ascending(f(d), x);\\n\",\n       \"\\t    } : f);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.shuffle = function(array, i0, i1) {\\n\",\n       \"\\t    if ((m = arguments.length) < 3) {\\n\",\n       \"\\t      i1 = array.length;\\n\",\n       \"\\t      if (m < 2) i0 = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var m = i1 - i0, t, i;\\n\",\n       \"\\t    while (m) {\\n\",\n       \"\\t      i = Math.random() * m-- | 0;\\n\",\n       \"\\t      t = array[m + i0], array[m + i0] = array[i + i0], array[i + i0] = t;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return array;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.permute = function(array, indexes) {\\n\",\n       \"\\t    var i = indexes.length, permutes = new Array(i);\\n\",\n       \"\\t    while (i--) permutes[i] = array[indexes[i]];\\n\",\n       \"\\t    return permutes;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.pairs = function(array) {\\n\",\n       \"\\t    var i = 0, n = array.length - 1, p0, p1 = array[0], pairs = new Array(n < 0 ? 0 : n);\\n\",\n       \"\\t    while (i < n) pairs[i] = [ p0 = p1, p1 = array[++i] ];\\n\",\n       \"\\t    return pairs;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.transpose = function(matrix) {\\n\",\n       \"\\t    if (!(n = matrix.length)) return [];\\n\",\n       \"\\t    for (var i = -1, m = d3.min(matrix, d3_transposeLength), transpose = new Array(m); ++i < m; ) {\\n\",\n       \"\\t      for (var j = -1, n, row = transpose[i] = new Array(n); ++j < n; ) {\\n\",\n       \"\\t        row[j] = matrix[j][i];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return transpose;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_transposeLength(d) {\\n\",\n       \"\\t    return d.length;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.zip = function() {\\n\",\n       \"\\t    return d3.transpose(arguments);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.keys = function(map) {\\n\",\n       \"\\t    var keys = [];\\n\",\n       \"\\t    for (var key in map) keys.push(key);\\n\",\n       \"\\t    return keys;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.values = function(map) {\\n\",\n       \"\\t    var values = [];\\n\",\n       \"\\t    for (var key in map) values.push(map[key]);\\n\",\n       \"\\t    return values;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.entries = function(map) {\\n\",\n       \"\\t    var entries = [];\\n\",\n       \"\\t    for (var key in map) entries.push({\\n\",\n       \"\\t      key: key,\\n\",\n       \"\\t      value: map[key]\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return entries;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.merge = function(arrays) {\\n\",\n       \"\\t    var n = arrays.length, m, i = -1, j = 0, merged, array;\\n\",\n       \"\\t    while (++i < n) j += arrays[i].length;\\n\",\n       \"\\t    merged = new Array(j);\\n\",\n       \"\\t    while (--n >= 0) {\\n\",\n       \"\\t      array = arrays[n];\\n\",\n       \"\\t      m = array.length;\\n\",\n       \"\\t      while (--m >= 0) {\\n\",\n       \"\\t        merged[--j] = array[m];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return merged;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var abs = Math.abs;\\n\",\n       \"\\t  d3.range = function(start, stop, step) {\\n\",\n       \"\\t    if (arguments.length < 3) {\\n\",\n       \"\\t      step = 1;\\n\",\n       \"\\t      if (arguments.length < 2) {\\n\",\n       \"\\t        stop = start;\\n\",\n       \"\\t        start = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if ((stop - start) / step === Infinity) throw new Error(\\\"infinite range\\\");\\n\",\n       \"\\t    var range = [], k = d3_range_integerScale(abs(step)), i = -1, j;\\n\",\n       \"\\t    start *= k, stop *= k, step *= k;\\n\",\n       \"\\t    if (step < 0) while ((j = start + step * ++i) > stop) range.push(j / k); else while ((j = start + step * ++i) < stop) range.push(j / k);\\n\",\n       \"\\t    return range;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_range_integerScale(x) {\\n\",\n       \"\\t    var k = 1;\\n\",\n       \"\\t    while (x * k % 1) k *= 10;\\n\",\n       \"\\t    return k;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_class(ctor, properties) {\\n\",\n       \"\\t    for (var key in properties) {\\n\",\n       \"\\t      Object.defineProperty(ctor.prototype, key, {\\n\",\n       \"\\t        value: properties[key],\\n\",\n       \"\\t        enumerable: false\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.map = function(object, f) {\\n\",\n       \"\\t    var map = new d3_Map();\\n\",\n       \"\\t    if (object instanceof d3_Map) {\\n\",\n       \"\\t      object.forEach(function(key, value) {\\n\",\n       \"\\t        map.set(key, value);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else if (Array.isArray(object)) {\\n\",\n       \"\\t      var i = -1, n = object.length, o;\\n\",\n       \"\\t      if (arguments.length === 1) while (++i < n) map.set(i, object[i]); else while (++i < n) map.set(f.call(object, o = object[i], i), o);\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      for (var key in object) map.set(key, object[key]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return map;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_Map() {\\n\",\n       \"\\t    this._ = Object.create(null);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_map_proto = \\\"__proto__\\\", d3_map_zero = \\\"\\\\x00\\\";\\n\",\n       \"\\t  d3_class(d3_Map, {\\n\",\n       \"\\t    has: d3_map_has,\\n\",\n       \"\\t    get: function(key) {\\n\",\n       \"\\t      return this._[d3_map_escape(key)];\\n\",\n       \"\\t    },\\n\",\n       \"\\t    set: function(key, value) {\\n\",\n       \"\\t      return this._[d3_map_escape(key)] = value;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    remove: d3_map_remove,\\n\",\n       \"\\t    keys: d3_map_keys,\\n\",\n       \"\\t    values: function() {\\n\",\n       \"\\t      var values = [];\\n\",\n       \"\\t      for (var key in this._) values.push(this._[key]);\\n\",\n       \"\\t      return values;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    entries: function() {\\n\",\n       \"\\t      var entries = [];\\n\",\n       \"\\t      for (var key in this._) entries.push({\\n\",\n       \"\\t        key: d3_map_unescape(key),\\n\",\n       \"\\t        value: this._[key]\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return entries;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    size: d3_map_size,\\n\",\n       \"\\t    empty: d3_map_empty,\\n\",\n       \"\\t    forEach: function(f) {\\n\",\n       \"\\t      for (var key in this._) f.call(this, d3_map_unescape(key), this._[key]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  function d3_map_escape(key) {\\n\",\n       \"\\t    return (key += \\\"\\\") === d3_map_proto || key[0] === d3_map_zero ? d3_map_zero + key : key;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_map_unescape(key) {\\n\",\n       \"\\t    return (key += \\\"\\\")[0] === d3_map_zero ? key.slice(1) : key;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_map_has(key) {\\n\",\n       \"\\t    return d3_map_escape(key) in this._;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_map_remove(key) {\\n\",\n       \"\\t    return (key = d3_map_escape(key)) in this._ && delete this._[key];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_map_keys() {\\n\",\n       \"\\t    var keys = [];\\n\",\n       \"\\t    for (var key in this._) keys.push(d3_map_unescape(key));\\n\",\n       \"\\t    return keys;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_map_size() {\\n\",\n       \"\\t    var size = 0;\\n\",\n       \"\\t    for (var key in this._) ++size;\\n\",\n       \"\\t    return size;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_map_empty() {\\n\",\n       \"\\t    for (var key in this._) return false;\\n\",\n       \"\\t    return true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.nest = function() {\\n\",\n       \"\\t    var nest = {}, keys = [], sortKeys = [], sortValues, rollup;\\n\",\n       \"\\t    function map(mapType, array, depth) {\\n\",\n       \"\\t      if (depth >= keys.length) return rollup ? rollup.call(nest, array) : sortValues ? array.sort(sortValues) : array;\\n\",\n       \"\\t      var i = -1, n = array.length, key = keys[depth++], keyValue, object, setter, valuesByKey = new d3_Map(), values;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (values = valuesByKey.get(keyValue = key(object = array[i]))) {\\n\",\n       \"\\t          values.push(object);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          valuesByKey.set(keyValue, [ object ]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (mapType) {\\n\",\n       \"\\t        object = mapType();\\n\",\n       \"\\t        setter = function(keyValue, values) {\\n\",\n       \"\\t          object.set(keyValue, map(mapType, values, depth));\\n\",\n       \"\\t        };\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        object = {};\\n\",\n       \"\\t        setter = function(keyValue, values) {\\n\",\n       \"\\t          object[keyValue] = map(mapType, values, depth);\\n\",\n       \"\\t        };\\n\",\n       \"\\t      }\\n\",\n       \"\\t      valuesByKey.forEach(setter);\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function entries(map, depth) {\\n\",\n       \"\\t      if (depth >= keys.length) return map;\\n\",\n       \"\\t      var array = [], sortKey = sortKeys[depth++];\\n\",\n       \"\\t      map.forEach(function(key, keyMap) {\\n\",\n       \"\\t        array.push({\\n\",\n       \"\\t          key: key,\\n\",\n       \"\\t          values: entries(keyMap, depth)\\n\",\n       \"\\t        });\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return sortKey ? array.sort(function(a, b) {\\n\",\n       \"\\t        return sortKey(a.key, b.key);\\n\",\n       \"\\t      }) : array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    nest.map = function(array, mapType) {\\n\",\n       \"\\t      return map(mapType, array, 0);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    nest.entries = function(array) {\\n\",\n       \"\\t      return entries(map(d3.map, array, 0), 0);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    nest.key = function(d) {\\n\",\n       \"\\t      keys.push(d);\\n\",\n       \"\\t      return nest;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    nest.sortKeys = function(order) {\\n\",\n       \"\\t      sortKeys[keys.length - 1] = order;\\n\",\n       \"\\t      return nest;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    nest.sortValues = function(order) {\\n\",\n       \"\\t      sortValues = order;\\n\",\n       \"\\t      return nest;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    nest.rollup = function(f) {\\n\",\n       \"\\t      rollup = f;\\n\",\n       \"\\t      return nest;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return nest;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.set = function(array) {\\n\",\n       \"\\t    var set = new d3_Set();\\n\",\n       \"\\t    if (array) for (var i = 0, n = array.length; i < n; ++i) set.add(array[i]);\\n\",\n       \"\\t    return set;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_Set() {\\n\",\n       \"\\t    this._ = Object.create(null);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_class(d3_Set, {\\n\",\n       \"\\t    has: d3_map_has,\\n\",\n       \"\\t    add: function(key) {\\n\",\n       \"\\t      this._[d3_map_escape(key += \\\"\\\")] = true;\\n\",\n       \"\\t      return key;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    remove: d3_map_remove,\\n\",\n       \"\\t    values: d3_map_keys,\\n\",\n       \"\\t    size: d3_map_size,\\n\",\n       \"\\t    empty: d3_map_empty,\\n\",\n       \"\\t    forEach: function(f) {\\n\",\n       \"\\t      for (var key in this._) f.call(this, d3_map_unescape(key));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3.behavior = {};\\n\",\n       \"\\t  function d3_identity(d) {\\n\",\n       \"\\t    return d;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.rebind = function(target, source) {\\n\",\n       \"\\t    var i = 1, n = arguments.length, method;\\n\",\n       \"\\t    while (++i < n) target[method = arguments[i]] = d3_rebind(target, source, source[method]);\\n\",\n       \"\\t    return target;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_rebind(target, source, method) {\\n\",\n       \"\\t    return function() {\\n\",\n       \"\\t      var value = method.apply(source, arguments);\\n\",\n       \"\\t      return value === source ? target : value;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_vendorSymbol(object, name) {\\n\",\n       \"\\t    if (name in object) return name;\\n\",\n       \"\\t    name = name.charAt(0).toUpperCase() + name.slice(1);\\n\",\n       \"\\t    for (var i = 0, n = d3_vendorPrefixes.length; i < n; ++i) {\\n\",\n       \"\\t      var prefixName = d3_vendorPrefixes[i] + name;\\n\",\n       \"\\t      if (prefixName in object) return prefixName;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_vendorPrefixes = [ \\\"webkit\\\", \\\"ms\\\", \\\"moz\\\", \\\"Moz\\\", \\\"o\\\", \\\"O\\\" ];\\n\",\n       \"\\t  function d3_noop() {}\\n\",\n       \"\\t  d3.dispatch = function() {\\n\",\n       \"\\t    var dispatch = new d3_dispatch(), i = -1, n = arguments.length;\\n\",\n       \"\\t    while (++i < n) dispatch[arguments[i]] = d3_dispatch_event(dispatch);\\n\",\n       \"\\t    return dispatch;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_dispatch() {}\\n\",\n       \"\\t  d3_dispatch.prototype.on = function(type, listener) {\\n\",\n       \"\\t    var i = type.indexOf(\\\".\\\"), name = \\\"\\\";\\n\",\n       \"\\t    if (i >= 0) {\\n\",\n       \"\\t      name = type.slice(i + 1);\\n\",\n       \"\\t      type = type.slice(0, i);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (type) return arguments.length < 2 ? this[type].on(name) : this[type].on(name, listener);\\n\",\n       \"\\t    if (arguments.length === 2) {\\n\",\n       \"\\t      if (listener == null) for (type in this) {\\n\",\n       \"\\t        if (this.hasOwnProperty(type)) this[type].on(name, null);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_dispatch_event(dispatch) {\\n\",\n       \"\\t    var listeners = [], listenerByName = new d3_Map();\\n\",\n       \"\\t    function event() {\\n\",\n       \"\\t      var z = listeners, i = -1, n = z.length, l;\\n\",\n       \"\\t      while (++i < n) if (l = z[i].on) l.apply(this, arguments);\\n\",\n       \"\\t      return dispatch;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    event.on = function(name, listener) {\\n\",\n       \"\\t      var l = listenerByName.get(name), i;\\n\",\n       \"\\t      if (arguments.length < 2) return l && l.on;\\n\",\n       \"\\t      if (l) {\\n\",\n       \"\\t        l.on = null;\\n\",\n       \"\\t        listeners = listeners.slice(0, i = listeners.indexOf(l)).concat(listeners.slice(i + 1));\\n\",\n       \"\\t        listenerByName.remove(name);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (listener) listeners.push(listenerByName.set(name, {\\n\",\n       \"\\t        on: listener\\n\",\n       \"\\t      }));\\n\",\n       \"\\t      return dispatch;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return event;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.event = null;\\n\",\n       \"\\t  function d3_eventPreventDefault() {\\n\",\n       \"\\t    d3.event.preventDefault();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_eventSource() {\\n\",\n       \"\\t    var e = d3.event, s;\\n\",\n       \"\\t    while (s = e.sourceEvent) e = s;\\n\",\n       \"\\t    return e;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_eventDispatch(target) {\\n\",\n       \"\\t    var dispatch = new d3_dispatch(), i = 0, n = arguments.length;\\n\",\n       \"\\t    while (++i < n) dispatch[arguments[i]] = d3_dispatch_event(dispatch);\\n\",\n       \"\\t    dispatch.of = function(thiz, argumentz) {\\n\",\n       \"\\t      return function(e1) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          var e0 = e1.sourceEvent = d3.event;\\n\",\n       \"\\t          e1.target = target;\\n\",\n       \"\\t          d3.event = e1;\\n\",\n       \"\\t          dispatch[e1.type].apply(thiz, argumentz);\\n\",\n       \"\\t        } finally {\\n\",\n       \"\\t          d3.event = e0;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return dispatch;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.requote = function(s) {\\n\",\n       \"\\t    return s.replace(d3_requote_re, \\\"\\\\\\\\$&\\\");\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_requote_re = /[\\\\\\\\\\\\^\\\\$\\\\*\\\\+\\\\?\\\\|\\\\[\\\\]\\\\(\\\\)\\\\.\\\\{\\\\}]/g;\\n\",\n       \"\\t  var d3_subclass = {}.__proto__ ? function(object, prototype) {\\n\",\n       \"\\t    object.__proto__ = prototype;\\n\",\n       \"\\t  } : function(object, prototype) {\\n\",\n       \"\\t    for (var property in prototype) object[property] = prototype[property];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection(groups) {\\n\",\n       \"\\t    d3_subclass(groups, d3_selectionPrototype);\\n\",\n       \"\\t    return groups;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_select = function(s, n) {\\n\",\n       \"\\t    return n.querySelector(s);\\n\",\n       \"\\t  }, d3_selectAll = function(s, n) {\\n\",\n       \"\\t    return n.querySelectorAll(s);\\n\",\n       \"\\t  }, d3_selectMatches = function(n, s) {\\n\",\n       \"\\t    var d3_selectMatcher = n.matches || n[d3_vendorSymbol(n, \\\"matchesSelector\\\")];\\n\",\n       \"\\t    d3_selectMatches = function(n, s) {\\n\",\n       \"\\t      return d3_selectMatcher.call(n, s);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_selectMatches(n, s);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  if (typeof Sizzle === \\\"function\\\") {\\n\",\n       \"\\t    d3_select = function(s, n) {\\n\",\n       \"\\t      return Sizzle(s, n)[0] || null;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3_selectAll = Sizzle;\\n\",\n       \"\\t    d3_selectMatches = Sizzle.matchesSelector;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.selection = function() {\\n\",\n       \"\\t    return d3.select(d3_document.documentElement);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_selectionPrototype = d3.selection.prototype = [];\\n\",\n       \"\\t  d3_selectionPrototype.select = function(selector) {\\n\",\n       \"\\t    var subgroups = [], subgroup, subnode, group, node;\\n\",\n       \"\\t    selector = d3_selection_selector(selector);\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      subgroup.parentNode = (group = this[j]).parentNode;\\n\",\n       \"\\t      for (var i = -1, n = group.length; ++i < n; ) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          subgroup.push(subnode = selector.call(node, node.__data__, i, j));\\n\",\n       \"\\t          if (subnode && \\\"__data__\\\" in node) subnode.__data__ = node.__data__;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          subgroup.push(null);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_selection(subgroups);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_selector(selector) {\\n\",\n       \"\\t    return typeof selector === \\\"function\\\" ? selector : function() {\\n\",\n       \"\\t      return d3_select(selector, this);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.selectAll = function(selector) {\\n\",\n       \"\\t    var subgroups = [], subgroup, node;\\n\",\n       \"\\t    selector = d3_selection_selectorAll(selector);\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      for (var group = this[j], i = -1, n = group.length; ++i < n; ) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          subgroups.push(subgroup = d3_array(selector.call(node, node.__data__, i, j)));\\n\",\n       \"\\t          subgroup.parentNode = node;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_selection(subgroups);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_selectorAll(selector) {\\n\",\n       \"\\t    return typeof selector === \\\"function\\\" ? selector : function() {\\n\",\n       \"\\t      return d3_selectAll(selector, this);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_nsXhtml = \\\"http://www.w3.org/1999/xhtml\\\";\\n\",\n       \"\\t  var d3_nsPrefix = {\\n\",\n       \"\\t    svg: \\\"http://www.w3.org/2000/svg\\\",\\n\",\n       \"\\t    xhtml: d3_nsXhtml,\\n\",\n       \"\\t    xlink: \\\"http://www.w3.org/1999/xlink\\\",\\n\",\n       \"\\t    xml: \\\"http://www.w3.org/XML/1998/namespace\\\",\\n\",\n       \"\\t    xmlns: \\\"http://www.w3.org/2000/xmlns/\\\"\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.ns = {\\n\",\n       \"\\t    prefix: d3_nsPrefix,\\n\",\n       \"\\t    qualify: function(name) {\\n\",\n       \"\\t      var i = name.indexOf(\\\":\\\"), prefix = name;\\n\",\n       \"\\t      if (i >= 0 && (prefix = name.slice(0, i)) !== \\\"xmlns\\\") name = name.slice(i + 1);\\n\",\n       \"\\t      return d3_nsPrefix.hasOwnProperty(prefix) ? {\\n\",\n       \"\\t        space: d3_nsPrefix[prefix],\\n\",\n       \"\\t        local: name\\n\",\n       \"\\t      } : name;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.attr = function(name, value) {\\n\",\n       \"\\t    if (arguments.length < 2) {\\n\",\n       \"\\t      if (typeof name === \\\"string\\\") {\\n\",\n       \"\\t        var node = this.node();\\n\",\n       \"\\t        name = d3.ns.qualify(name);\\n\",\n       \"\\t        return name.local ? node.getAttributeNS(name.space, name.local) : node.getAttribute(name);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (value in name) this.each(d3_selection_attr(value, name[value]));\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.each(d3_selection_attr(name, value));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_attr(name, value) {\\n\",\n       \"\\t    name = d3.ns.qualify(name);\\n\",\n       \"\\t    function attrNull() {\\n\",\n       \"\\t      this.removeAttribute(name);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrNullNS() {\\n\",\n       \"\\t      this.removeAttributeNS(name.space, name.local);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrConstant() {\\n\",\n       \"\\t      this.setAttribute(name, value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrConstantNS() {\\n\",\n       \"\\t      this.setAttributeNS(name.space, name.local, value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrFunction() {\\n\",\n       \"\\t      var x = value.apply(this, arguments);\\n\",\n       \"\\t      if (x == null) this.removeAttribute(name); else this.setAttribute(name, x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrFunctionNS() {\\n\",\n       \"\\t      var x = value.apply(this, arguments);\\n\",\n       \"\\t      if (x == null) this.removeAttributeNS(name.space, name.local); else this.setAttributeNS(name.space, name.local, x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return value == null ? name.local ? attrNullNS : attrNull : typeof value === \\\"function\\\" ? name.local ? attrFunctionNS : attrFunction : name.local ? attrConstantNS : attrConstant;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_collapse(s) {\\n\",\n       \"\\t    return s.trim().replace(/\\\\s+/g, \\\" \\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.classed = function(name, value) {\\n\",\n       \"\\t    if (arguments.length < 2) {\\n\",\n       \"\\t      if (typeof name === \\\"string\\\") {\\n\",\n       \"\\t        var node = this.node(), n = (name = d3_selection_classes(name)).length, i = -1;\\n\",\n       \"\\t        if (value = node.classList) {\\n\",\n       \"\\t          while (++i < n) if (!value.contains(name[i])) return false;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          value = node.getAttribute(\\\"class\\\");\\n\",\n       \"\\t          while (++i < n) if (!d3_selection_classedRe(name[i]).test(value)) return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (value in name) this.each(d3_selection_classed(value, name[value]));\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.each(d3_selection_classed(name, value));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_classedRe(name) {\\n\",\n       \"\\t    return new RegExp(\\\"(?:^|\\\\\\\\s+)\\\" + d3.requote(name) + \\\"(?:\\\\\\\\s+|$)\\\", \\\"g\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_selection_classes(name) {\\n\",\n       \"\\t    return (name + \\\"\\\").trim().split(/^|\\\\s+/);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_selection_classed(name, value) {\\n\",\n       \"\\t    name = d3_selection_classes(name).map(d3_selection_classedName);\\n\",\n       \"\\t    var n = name.length;\\n\",\n       \"\\t    function classedConstant() {\\n\",\n       \"\\t      var i = -1;\\n\",\n       \"\\t      while (++i < n) name[i](this, value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function classedFunction() {\\n\",\n       \"\\t      var i = -1, x = value.apply(this, arguments);\\n\",\n       \"\\t      while (++i < n) name[i](this, x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return typeof value === \\\"function\\\" ? classedFunction : classedConstant;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_selection_classedName(name) {\\n\",\n       \"\\t    var re = d3_selection_classedRe(name);\\n\",\n       \"\\t    return function(node, value) {\\n\",\n       \"\\t      if (c = node.classList) return value ? c.add(name) : c.remove(name);\\n\",\n       \"\\t      var c = node.getAttribute(\\\"class\\\") || \\\"\\\";\\n\",\n       \"\\t      if (value) {\\n\",\n       \"\\t        re.lastIndex = 0;\\n\",\n       \"\\t        if (!re.test(c)) node.setAttribute(\\\"class\\\", d3_collapse(c + \\\" \\\" + name));\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        node.setAttribute(\\\"class\\\", d3_collapse(c.replace(re, \\\" \\\")));\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.style = function(name, value, priority) {\\n\",\n       \"\\t    var n = arguments.length;\\n\",\n       \"\\t    if (n < 3) {\\n\",\n       \"\\t      if (typeof name !== \\\"string\\\") {\\n\",\n       \"\\t        if (n < 2) value = \\\"\\\";\\n\",\n       \"\\t        for (priority in name) this.each(d3_selection_style(priority, name[priority], value));\\n\",\n       \"\\t        return this;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (n < 2) {\\n\",\n       \"\\t        var node = this.node();\\n\",\n       \"\\t        return d3_window(node).getComputedStyle(node, null).getPropertyValue(name);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      priority = \\\"\\\";\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.each(d3_selection_style(name, value, priority));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_style(name, value, priority) {\\n\",\n       \"\\t    function styleNull() {\\n\",\n       \"\\t      this.style.removeProperty(name);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function styleConstant() {\\n\",\n       \"\\t      this.style.setProperty(name, value, priority);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function styleFunction() {\\n\",\n       \"\\t      var x = value.apply(this, arguments);\\n\",\n       \"\\t      if (x == null) this.style.removeProperty(name); else this.style.setProperty(name, x, priority);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return value == null ? styleNull : typeof value === \\\"function\\\" ? styleFunction : styleConstant;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.property = function(name, value) {\\n\",\n       \"\\t    if (arguments.length < 2) {\\n\",\n       \"\\t      if (typeof name === \\\"string\\\") return this.node()[name];\\n\",\n       \"\\t      for (value in name) this.each(d3_selection_property(value, name[value]));\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.each(d3_selection_property(name, value));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_property(name, value) {\\n\",\n       \"\\t    function propertyNull() {\\n\",\n       \"\\t      delete this[name];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function propertyConstant() {\\n\",\n       \"\\t      this[name] = value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function propertyFunction() {\\n\",\n       \"\\t      var x = value.apply(this, arguments);\\n\",\n       \"\\t      if (x == null) delete this[name]; else this[name] = x;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return value == null ? propertyNull : typeof value === \\\"function\\\" ? propertyFunction : propertyConstant;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.text = function(value) {\\n\",\n       \"\\t    return arguments.length ? this.each(typeof value === \\\"function\\\" ? function() {\\n\",\n       \"\\t      var v = value.apply(this, arguments);\\n\",\n       \"\\t      this.textContent = v == null ? \\\"\\\" : v;\\n\",\n       \"\\t    } : value == null ? function() {\\n\",\n       \"\\t      this.textContent = \\\"\\\";\\n\",\n       \"\\t    } : function() {\\n\",\n       \"\\t      this.textContent = value;\\n\",\n       \"\\t    }) : this.node().textContent;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.html = function(value) {\\n\",\n       \"\\t    return arguments.length ? this.each(typeof value === \\\"function\\\" ? function() {\\n\",\n       \"\\t      var v = value.apply(this, arguments);\\n\",\n       \"\\t      this.innerHTML = v == null ? \\\"\\\" : v;\\n\",\n       \"\\t    } : value == null ? function() {\\n\",\n       \"\\t      this.innerHTML = \\\"\\\";\\n\",\n       \"\\t    } : function() {\\n\",\n       \"\\t      this.innerHTML = value;\\n\",\n       \"\\t    }) : this.node().innerHTML;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.append = function(name) {\\n\",\n       \"\\t    name = d3_selection_creator(name);\\n\",\n       \"\\t    return this.select(function() {\\n\",\n       \"\\t      return this.appendChild(name.apply(this, arguments));\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_creator(name) {\\n\",\n       \"\\t    function create() {\\n\",\n       \"\\t      var document = this.ownerDocument, namespace = this.namespaceURI;\\n\",\n       \"\\t      return namespace === d3_nsXhtml && document.documentElement.namespaceURI === d3_nsXhtml ? document.createElement(name) : document.createElementNS(namespace, name);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function createNS() {\\n\",\n       \"\\t      return this.ownerDocument.createElementNS(name.space, name.local);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return typeof name === \\\"function\\\" ? name : (name = d3.ns.qualify(name)).local ? createNS : create;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.insert = function(name, before) {\\n\",\n       \"\\t    name = d3_selection_creator(name);\\n\",\n       \"\\t    before = d3_selection_selector(before);\\n\",\n       \"\\t    return this.select(function() {\\n\",\n       \"\\t      return this.insertBefore(name.apply(this, arguments), before.apply(this, arguments) || null);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.remove = function() {\\n\",\n       \"\\t    return this.each(d3_selectionRemove);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selectionRemove() {\\n\",\n       \"\\t    var parent = this.parentNode;\\n\",\n       \"\\t    if (parent) parent.removeChild(this);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.data = function(value, key) {\\n\",\n       \"\\t    var i = -1, n = this.length, group, node;\\n\",\n       \"\\t    if (!arguments.length) {\\n\",\n       \"\\t      value = new Array(n = (group = this[0]).length);\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          value[i] = node.__data__;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function bind(group, groupData) {\\n\",\n       \"\\t      var i, n = group.length, m = groupData.length, n0 = Math.min(n, m), updateNodes = new Array(m), enterNodes = new Array(m), exitNodes = new Array(n), node, nodeData;\\n\",\n       \"\\t      if (key) {\\n\",\n       \"\\t        var nodeByKeyValue = new d3_Map(), keyValues = new Array(n), keyValue;\\n\",\n       \"\\t        for (i = -1; ++i < n; ) {\\n\",\n       \"\\t          if (node = group[i]) {\\n\",\n       \"\\t            if (nodeByKeyValue.has(keyValue = key.call(node, node.__data__, i))) {\\n\",\n       \"\\t              exitNodes[i] = node;\\n\",\n       \"\\t            } else {\\n\",\n       \"\\t              nodeByKeyValue.set(keyValue, node);\\n\",\n       \"\\t            }\\n\",\n       \"\\t            keyValues[i] = keyValue;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        for (i = -1; ++i < m; ) {\\n\",\n       \"\\t          if (!(node = nodeByKeyValue.get(keyValue = key.call(groupData, nodeData = groupData[i], i)))) {\\n\",\n       \"\\t            enterNodes[i] = d3_selection_dataNode(nodeData);\\n\",\n       \"\\t          } else if (node !== true) {\\n\",\n       \"\\t            updateNodes[i] = node;\\n\",\n       \"\\t            node.__data__ = nodeData;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          nodeByKeyValue.set(keyValue, true);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        for (i = -1; ++i < n; ) {\\n\",\n       \"\\t          if (i in keyValues && nodeByKeyValue.get(keyValues[i]) !== true) {\\n\",\n       \"\\t            exitNodes[i] = group[i];\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        for (i = -1; ++i < n0; ) {\\n\",\n       \"\\t          node = group[i];\\n\",\n       \"\\t          nodeData = groupData[i];\\n\",\n       \"\\t          if (node) {\\n\",\n       \"\\t            node.__data__ = nodeData;\\n\",\n       \"\\t            updateNodes[i] = node;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            enterNodes[i] = d3_selection_dataNode(nodeData);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        for (;i < m; ++i) {\\n\",\n       \"\\t          enterNodes[i] = d3_selection_dataNode(groupData[i]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        for (;i < n; ++i) {\\n\",\n       \"\\t          exitNodes[i] = group[i];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      enterNodes.update = updateNodes;\\n\",\n       \"\\t      enterNodes.parentNode = updateNodes.parentNode = exitNodes.parentNode = group.parentNode;\\n\",\n       \"\\t      enter.push(enterNodes);\\n\",\n       \"\\t      update.push(updateNodes);\\n\",\n       \"\\t      exit.push(exitNodes);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var enter = d3_selection_enter([]), update = d3_selection([]), exit = d3_selection([]);\\n\",\n       \"\\t    if (typeof value === \\\"function\\\") {\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        bind(group = this[i], value.call(group, group.parentNode.__data__, i));\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        bind(group = this[i], value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    update.enter = function() {\\n\",\n       \"\\t      return enter;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    update.exit = function() {\\n\",\n       \"\\t      return exit;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return update;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_dataNode(data) {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      __data__: data\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.datum = function(value) {\\n\",\n       \"\\t    return arguments.length ? this.property(\\\"__data__\\\", value) : this.property(\\\"__data__\\\");\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.filter = function(filter) {\\n\",\n       \"\\t    var subgroups = [], subgroup, group, node;\\n\",\n       \"\\t    if (typeof filter !== \\\"function\\\") filter = d3_selection_filter(filter);\\n\",\n       \"\\t    for (var j = 0, m = this.length; j < m; j++) {\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      subgroup.parentNode = (group = this[j]).parentNode;\\n\",\n       \"\\t      for (var i = 0, n = group.length; i < n; i++) {\\n\",\n       \"\\t        if ((node = group[i]) && filter.call(node, node.__data__, i, j)) {\\n\",\n       \"\\t          subgroup.push(node);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_selection(subgroups);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_filter(selector) {\\n\",\n       \"\\t    return function() {\\n\",\n       \"\\t      return d3_selectMatches(this, selector);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.order = function() {\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      for (var group = this[j], i = group.length - 1, next = group[i], node; --i >= 0; ) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          if (next && next !== node.nextSibling) next.parentNode.insertBefore(node, next);\\n\",\n       \"\\t          next = node;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.sort = function(comparator) {\\n\",\n       \"\\t    comparator = d3_selection_sortComparator.apply(this, arguments);\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) this[j].sort(comparator);\\n\",\n       \"\\t    return this.order();\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_sortComparator(comparator) {\\n\",\n       \"\\t    if (!arguments.length) comparator = d3_ascending;\\n\",\n       \"\\t    return function(a, b) {\\n\",\n       \"\\t      return a && b ? comparator(a.__data__, b.__data__) : !a - !b;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.each = function(callback) {\\n\",\n       \"\\t    return d3_selection_each(this, function(node, i, j) {\\n\",\n       \"\\t      callback.call(node, node.__data__, i, j);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_each(groups, callback) {\\n\",\n       \"\\t    for (var j = 0, m = groups.length; j < m; j++) {\\n\",\n       \"\\t      for (var group = groups[j], i = 0, n = group.length, node; i < n; i++) {\\n\",\n       \"\\t        if (node = group[i]) callback(node, i, j);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return groups;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_selectionPrototype.call = function(callback) {\\n\",\n       \"\\t    var args = d3_array(arguments);\\n\",\n       \"\\t    callback.apply(args[0] = this, args);\\n\",\n       \"\\t    return this;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.empty = function() {\\n\",\n       \"\\t    return !this.node();\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.node = function() {\\n\",\n       \"\\t    for (var j = 0, m = this.length; j < m; j++) {\\n\",\n       \"\\t      for (var group = this[j], i = 0, n = group.length; i < n; i++) {\\n\",\n       \"\\t        var node = group[i];\\n\",\n       \"\\t        if (node) return node;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return null;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.size = function() {\\n\",\n       \"\\t    var n = 0;\\n\",\n       \"\\t    d3_selection_each(this, function() {\\n\",\n       \"\\t      ++n;\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return n;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_enter(selection) {\\n\",\n       \"\\t    d3_subclass(selection, d3_selection_enterPrototype);\\n\",\n       \"\\t    return selection;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_selection_enterPrototype = [];\\n\",\n       \"\\t  d3.selection.enter = d3_selection_enter;\\n\",\n       \"\\t  d3.selection.enter.prototype = d3_selection_enterPrototype;\\n\",\n       \"\\t  d3_selection_enterPrototype.append = d3_selectionPrototype.append;\\n\",\n       \"\\t  d3_selection_enterPrototype.empty = d3_selectionPrototype.empty;\\n\",\n       \"\\t  d3_selection_enterPrototype.node = d3_selectionPrototype.node;\\n\",\n       \"\\t  d3_selection_enterPrototype.call = d3_selectionPrototype.call;\\n\",\n       \"\\t  d3_selection_enterPrototype.size = d3_selectionPrototype.size;\\n\",\n       \"\\t  d3_selection_enterPrototype.select = function(selector) {\\n\",\n       \"\\t    var subgroups = [], subgroup, subnode, upgroup, group, node;\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      upgroup = (group = this[j]).update;\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      subgroup.parentNode = group.parentNode;\\n\",\n       \"\\t      for (var i = -1, n = group.length; ++i < n; ) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          subgroup.push(upgroup[i] = subnode = selector.call(group.parentNode, node.__data__, i, j));\\n\",\n       \"\\t          subnode.__data__ = node.__data__;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          subgroup.push(null);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_selection(subgroups);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selection_enterPrototype.insert = function(name, before) {\\n\",\n       \"\\t    if (arguments.length < 2) before = d3_selection_enterInsertBefore(this);\\n\",\n       \"\\t    return d3_selectionPrototype.insert.call(this, name, before);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_enterInsertBefore(enter) {\\n\",\n       \"\\t    var i0, j0;\\n\",\n       \"\\t    return function(d, i, j) {\\n\",\n       \"\\t      var group = enter[j].update, n = group.length, node;\\n\",\n       \"\\t      if (j != j0) j0 = j, i0 = 0;\\n\",\n       \"\\t      if (i >= i0) i0 = i + 1;\\n\",\n       \"\\t      while (!(node = group[i0]) && ++i0 < n) ;\\n\",\n       \"\\t      return node;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.select = function(node) {\\n\",\n       \"\\t    var group;\\n\",\n       \"\\t    if (typeof node === \\\"string\\\") {\\n\",\n       \"\\t      group = [ d3_select(node, d3_document) ];\\n\",\n       \"\\t      group.parentNode = d3_document.documentElement;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      group = [ node ];\\n\",\n       \"\\t      group.parentNode = d3_documentElement(node);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_selection([ group ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.selectAll = function(nodes) {\\n\",\n       \"\\t    var group;\\n\",\n       \"\\t    if (typeof nodes === \\\"string\\\") {\\n\",\n       \"\\t      group = d3_array(d3_selectAll(nodes, d3_document));\\n\",\n       \"\\t      group.parentNode = d3_document.documentElement;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      group = d3_array(nodes);\\n\",\n       \"\\t      group.parentNode = null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_selection([ group ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.on = function(type, listener, capture) {\\n\",\n       \"\\t    var n = arguments.length;\\n\",\n       \"\\t    if (n < 3) {\\n\",\n       \"\\t      if (typeof type !== \\\"string\\\") {\\n\",\n       \"\\t        if (n < 2) listener = false;\\n\",\n       \"\\t        for (capture in type) this.each(d3_selection_on(capture, type[capture], listener));\\n\",\n       \"\\t        return this;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (n < 2) return (n = this.node()[\\\"__on\\\" + type]) && n._;\\n\",\n       \"\\t      capture = false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.each(d3_selection_on(type, listener, capture));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_selection_on(type, listener, capture) {\\n\",\n       \"\\t    var name = \\\"__on\\\" + type, i = type.indexOf(\\\".\\\"), wrap = d3_selection_onListener;\\n\",\n       \"\\t    if (i > 0) type = type.slice(0, i);\\n\",\n       \"\\t    var filter = d3_selection_onFilters.get(type);\\n\",\n       \"\\t    if (filter) type = filter, wrap = d3_selection_onFilter;\\n\",\n       \"\\t    function onRemove() {\\n\",\n       \"\\t      var l = this[name];\\n\",\n       \"\\t      if (l) {\\n\",\n       \"\\t        this.removeEventListener(type, l, l.$);\\n\",\n       \"\\t        delete this[name];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function onAdd() {\\n\",\n       \"\\t      var l = wrap(listener, d3_array(arguments));\\n\",\n       \"\\t      onRemove.call(this);\\n\",\n       \"\\t      this.addEventListener(type, this[name] = l, l.$ = capture);\\n\",\n       \"\\t      l._ = listener;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function removeAll() {\\n\",\n       \"\\t      var re = new RegExp(\\\"^__on([^.]+)\\\" + d3.requote(type) + \\\"$\\\"), match;\\n\",\n       \"\\t      for (var name in this) {\\n\",\n       \"\\t        if (match = name.match(re)) {\\n\",\n       \"\\t          var l = this[name];\\n\",\n       \"\\t          this.removeEventListener(match[1], l, l.$);\\n\",\n       \"\\t          delete this[name];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return i ? listener ? onAdd : onRemove : listener ? d3_noop : removeAll;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_selection_onFilters = d3.map({\\n\",\n       \"\\t    mouseenter: \\\"mouseover\\\",\\n\",\n       \"\\t    mouseleave: \\\"mouseout\\\"\\n\",\n       \"\\t  });\\n\",\n       \"\\t  if (d3_document) {\\n\",\n       \"\\t    d3_selection_onFilters.forEach(function(k) {\\n\",\n       \"\\t      if (\\\"on\\\" + k in d3_document) d3_selection_onFilters.remove(k);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_selection_onListener(listener, argumentz) {\\n\",\n       \"\\t    return function(e) {\\n\",\n       \"\\t      var o = d3.event;\\n\",\n       \"\\t      d3.event = e;\\n\",\n       \"\\t      argumentz[0] = this.__data__;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        listener.apply(this, argumentz);\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        d3.event = o;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_selection_onFilter(listener, argumentz) {\\n\",\n       \"\\t    var l = d3_selection_onListener(listener, argumentz);\\n\",\n       \"\\t    return function(e) {\\n\",\n       \"\\t      var target = this, related = e.relatedTarget;\\n\",\n       \"\\t      if (!related || related !== target && !(related.compareDocumentPosition(target) & 8)) {\\n\",\n       \"\\t        l.call(target, e);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_event_dragSelect, d3_event_dragId = 0;\\n\",\n       \"\\t  function d3_event_dragSuppress(node) {\\n\",\n       \"\\t    var name = \\\".dragsuppress-\\\" + ++d3_event_dragId, click = \\\"click\\\" + name, w = d3.select(d3_window(node)).on(\\\"touchmove\\\" + name, d3_eventPreventDefault).on(\\\"dragstart\\\" + name, d3_eventPreventDefault).on(\\\"selectstart\\\" + name, d3_eventPreventDefault);\\n\",\n       \"\\t    if (d3_event_dragSelect == null) {\\n\",\n       \"\\t      d3_event_dragSelect = \\\"onselectstart\\\" in node ? false : d3_vendorSymbol(node.style, \\\"userSelect\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (d3_event_dragSelect) {\\n\",\n       \"\\t      var style = d3_documentElement(node).style, select = style[d3_event_dragSelect];\\n\",\n       \"\\t      style[d3_event_dragSelect] = \\\"none\\\";\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return function(suppressClick) {\\n\",\n       \"\\t      w.on(name, null);\\n\",\n       \"\\t      if (d3_event_dragSelect) style[d3_event_dragSelect] = select;\\n\",\n       \"\\t      if (suppressClick) {\\n\",\n       \"\\t        var off = function() {\\n\",\n       \"\\t          w.on(click, null);\\n\",\n       \"\\t        };\\n\",\n       \"\\t        w.on(click, function() {\\n\",\n       \"\\t          d3_eventPreventDefault();\\n\",\n       \"\\t          off();\\n\",\n       \"\\t        }, true);\\n\",\n       \"\\t        setTimeout(off, 0);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.mouse = function(container) {\\n\",\n       \"\\t    return d3_mousePoint(container, d3_eventSource());\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_mouse_bug44083 = this.navigator && /WebKit/.test(this.navigator.userAgent) ? -1 : 0;\\n\",\n       \"\\t  function d3_mousePoint(container, e) {\\n\",\n       \"\\t    if (e.changedTouches) e = e.changedTouches[0];\\n\",\n       \"\\t    var svg = container.ownerSVGElement || container;\\n\",\n       \"\\t    if (svg.createSVGPoint) {\\n\",\n       \"\\t      var point = svg.createSVGPoint();\\n\",\n       \"\\t      if (d3_mouse_bug44083 < 0) {\\n\",\n       \"\\t        var window = d3_window(container);\\n\",\n       \"\\t        if (window.scrollX || window.scrollY) {\\n\",\n       \"\\t          svg = d3.select(\\\"body\\\").append(\\\"svg\\\").style({\\n\",\n       \"\\t            position: \\\"absolute\\\",\\n\",\n       \"\\t            top: 0,\\n\",\n       \"\\t            left: 0,\\n\",\n       \"\\t            margin: 0,\\n\",\n       \"\\t            padding: 0,\\n\",\n       \"\\t            border: \\\"none\\\"\\n\",\n       \"\\t          }, \\\"important\\\");\\n\",\n       \"\\t          var ctm = svg[0][0].getScreenCTM();\\n\",\n       \"\\t          d3_mouse_bug44083 = !(ctm.f || ctm.e);\\n\",\n       \"\\t          svg.remove();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (d3_mouse_bug44083) point.x = e.pageX, point.y = e.pageY; else point.x = e.clientX, \\n\",\n       \"\\t      point.y = e.clientY;\\n\",\n       \"\\t      point = point.matrixTransform(container.getScreenCTM().inverse());\\n\",\n       \"\\t      return [ point.x, point.y ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var rect = container.getBoundingClientRect();\\n\",\n       \"\\t    return [ e.clientX - rect.left - container.clientLeft, e.clientY - rect.top - container.clientTop ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.touch = function(container, touches, identifier) {\\n\",\n       \"\\t    if (arguments.length < 3) identifier = touches, touches = d3_eventSource().changedTouches;\\n\",\n       \"\\t    if (touches) for (var i = 0, n = touches.length, touch; i < n; ++i) {\\n\",\n       \"\\t      if ((touch = touches[i]).identifier === identifier) {\\n\",\n       \"\\t        return d3_mousePoint(container, touch);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.behavior.drag = function() {\\n\",\n       \"\\t    var event = d3_eventDispatch(drag, \\\"drag\\\", \\\"dragstart\\\", \\\"dragend\\\"), origin = null, mousedown = dragstart(d3_noop, d3.mouse, d3_window, \\\"mousemove\\\", \\\"mouseup\\\"), touchstart = dragstart(d3_behavior_dragTouchId, d3.touch, d3_identity, \\\"touchmove\\\", \\\"touchend\\\");\\n\",\n       \"\\t    function drag() {\\n\",\n       \"\\t      this.on(\\\"mousedown.drag\\\", mousedown).on(\\\"touchstart.drag\\\", touchstart);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function dragstart(id, position, subject, move, end) {\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        var that = this, target = d3.event.target.correspondingElement || d3.event.target, parent = that.parentNode, dispatch = event.of(that, arguments), dragged = 0, dragId = id(), dragName = \\\".drag\\\" + (dragId == null ? \\\"\\\" : \\\"-\\\" + dragId), dragOffset, dragSubject = d3.select(subject(target)).on(move + dragName, moved).on(end + dragName, ended), dragRestore = d3_event_dragSuppress(target), position0 = position(parent, dragId);\\n\",\n       \"\\t        if (origin) {\\n\",\n       \"\\t          dragOffset = origin.apply(that, arguments);\\n\",\n       \"\\t          dragOffset = [ dragOffset.x - position0[0], dragOffset.y - position0[1] ];\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          dragOffset = [ 0, 0 ];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        dispatch({\\n\",\n       \"\\t          type: \\\"dragstart\\\"\\n\",\n       \"\\t        });\\n\",\n       \"\\t        function moved() {\\n\",\n       \"\\t          var position1 = position(parent, dragId), dx, dy;\\n\",\n       \"\\t          if (!position1) return;\\n\",\n       \"\\t          dx = position1[0] - position0[0];\\n\",\n       \"\\t          dy = position1[1] - position0[1];\\n\",\n       \"\\t          dragged |= dx | dy;\\n\",\n       \"\\t          position0 = position1;\\n\",\n       \"\\t          dispatch({\\n\",\n       \"\\t            type: \\\"drag\\\",\\n\",\n       \"\\t            x: position1[0] + dragOffset[0],\\n\",\n       \"\\t            y: position1[1] + dragOffset[1],\\n\",\n       \"\\t            dx: dx,\\n\",\n       \"\\t            dy: dy\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t        function ended() {\\n\",\n       \"\\t          if (!position(parent, dragId)) return;\\n\",\n       \"\\t          dragSubject.on(move + dragName, null).on(end + dragName, null);\\n\",\n       \"\\t          dragRestore(dragged);\\n\",\n       \"\\t          dispatch({\\n\",\n       \"\\t            type: \\\"dragend\\\"\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    drag.origin = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return origin;\\n\",\n       \"\\t      origin = x;\\n\",\n       \"\\t      return drag;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3.rebind(drag, event, \\\"on\\\");\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_behavior_dragTouchId() {\\n\",\n       \"\\t    return d3.event.changedTouches[0].identifier;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.touches = function(container, touches) {\\n\",\n       \"\\t    if (arguments.length < 2) touches = d3_eventSource().touches;\\n\",\n       \"\\t    return touches ? d3_array(touches).map(function(touch) {\\n\",\n       \"\\t      var point = d3_mousePoint(container, touch);\\n\",\n       \"\\t      point.identifier = touch.identifier;\\n\",\n       \"\\t      return point;\\n\",\n       \"\\t    }) : [];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var ε = 1e-6, ε2 = ε * ε, π = Math.PI, τ = 2 * π, τε = τ - ε, halfπ = π / 2, d3_radians = π / 180, d3_degrees = 180 / π;\\n\",\n       \"\\t  function d3_sgn(x) {\\n\",\n       \"\\t    return x > 0 ? 1 : x < 0 ? -1 : 0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_cross2d(a, b, c) {\\n\",\n       \"\\t    return (b[0] - a[0]) * (c[1] - a[1]) - (b[1] - a[1]) * (c[0] - a[0]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_acos(x) {\\n\",\n       \"\\t    return x > 1 ? 0 : x < -1 ? π : Math.acos(x);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_asin(x) {\\n\",\n       \"\\t    return x > 1 ? halfπ : x < -1 ? -halfπ : Math.asin(x);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_sinh(x) {\\n\",\n       \"\\t    return ((x = Math.exp(x)) - 1 / x) / 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_cosh(x) {\\n\",\n       \"\\t    return ((x = Math.exp(x)) + 1 / x) / 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_tanh(x) {\\n\",\n       \"\\t    return ((x = Math.exp(2 * x)) - 1) / (x + 1);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_haversin(x) {\\n\",\n       \"\\t    return (x = Math.sin(x / 2)) * x;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var ρ = Math.SQRT2, ρ2 = 2, ρ4 = 4;\\n\",\n       \"\\t  d3.interpolateZoom = function(p0, p1) {\\n\",\n       \"\\t    var ux0 = p0[0], uy0 = p0[1], w0 = p0[2], ux1 = p1[0], uy1 = p1[1], w1 = p1[2], dx = ux1 - ux0, dy = uy1 - uy0, d2 = dx * dx + dy * dy, i, S;\\n\",\n       \"\\t    if (d2 < ε2) {\\n\",\n       \"\\t      S = Math.log(w1 / w0) / ρ;\\n\",\n       \"\\t      i = function(t) {\\n\",\n       \"\\t        return [ ux0 + t * dx, uy0 + t * dy, w0 * Math.exp(ρ * t * S) ];\\n\",\n       \"\\t      };\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      var d1 = Math.sqrt(d2), b0 = (w1 * w1 - w0 * w0 + ρ4 * d2) / (2 * w0 * ρ2 * d1), b1 = (w1 * w1 - w0 * w0 - ρ4 * d2) / (2 * w1 * ρ2 * d1), r0 = Math.log(Math.sqrt(b0 * b0 + 1) - b0), r1 = Math.log(Math.sqrt(b1 * b1 + 1) - b1);\\n\",\n       \"\\t      S = (r1 - r0) / ρ;\\n\",\n       \"\\t      i = function(t) {\\n\",\n       \"\\t        var s = t * S, coshr0 = d3_cosh(r0), u = w0 / (ρ2 * d1) * (coshr0 * d3_tanh(ρ * s + r0) - d3_sinh(r0));\\n\",\n       \"\\t        return [ ux0 + u * dx, uy0 + u * dy, w0 * coshr0 / d3_cosh(ρ * s + r0) ];\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    i.duration = S * 1e3;\\n\",\n       \"\\t    return i;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.behavior.zoom = function() {\\n\",\n       \"\\t    var view = {\\n\",\n       \"\\t      x: 0,\\n\",\n       \"\\t      y: 0,\\n\",\n       \"\\t      k: 1\\n\",\n       \"\\t    }, translate0, center0, center, size = [ 960, 500 ], scaleExtent = d3_behavior_zoomInfinity, duration = 250, zooming = 0, mousedown = \\\"mousedown.zoom\\\", mousemove = \\\"mousemove.zoom\\\", mouseup = \\\"mouseup.zoom\\\", mousewheelTimer, touchstart = \\\"touchstart.zoom\\\", touchtime, event = d3_eventDispatch(zoom, \\\"zoomstart\\\", \\\"zoom\\\", \\\"zoomend\\\"), x0, x1, y0, y1;\\n\",\n       \"\\t    if (!d3_behavior_zoomWheel) {\\n\",\n       \"\\t      d3_behavior_zoomWheel = \\\"onwheel\\\" in d3_document ? (d3_behavior_zoomDelta = function() {\\n\",\n       \"\\t        return -d3.event.deltaY * (d3.event.deltaMode ? 120 : 1);\\n\",\n       \"\\t      }, \\\"wheel\\\") : \\\"onmousewheel\\\" in d3_document ? (d3_behavior_zoomDelta = function() {\\n\",\n       \"\\t        return d3.event.wheelDelta;\\n\",\n       \"\\t      }, \\\"mousewheel\\\") : (d3_behavior_zoomDelta = function() {\\n\",\n       \"\\t        return -d3.event.detail;\\n\",\n       \"\\t      }, \\\"MozMousePixelScroll\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function zoom(g) {\\n\",\n       \"\\t      g.on(mousedown, mousedowned).on(d3_behavior_zoomWheel + \\\".zoom\\\", mousewheeled).on(\\\"dblclick.zoom\\\", dblclicked).on(touchstart, touchstarted);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    zoom.event = function(g) {\\n\",\n       \"\\t      g.each(function() {\\n\",\n       \"\\t        var dispatch = event.of(this, arguments), view1 = view;\\n\",\n       \"\\t        if (d3_transitionInheritId) {\\n\",\n       \"\\t          d3.select(this).transition().each(\\\"start.zoom\\\", function() {\\n\",\n       \"\\t            view = this.__chart__ || {\\n\",\n       \"\\t              x: 0,\\n\",\n       \"\\t              y: 0,\\n\",\n       \"\\t              k: 1\\n\",\n       \"\\t            };\\n\",\n       \"\\t            zoomstarted(dispatch);\\n\",\n       \"\\t          }).tween(\\\"zoom:zoom\\\", function() {\\n\",\n       \"\\t            var dx = size[0], dy = size[1], cx = center0 ? center0[0] : dx / 2, cy = center0 ? center0[1] : dy / 2, i = d3.interpolateZoom([ (cx - view.x) / view.k, (cy - view.y) / view.k, dx / view.k ], [ (cx - view1.x) / view1.k, (cy - view1.y) / view1.k, dx / view1.k ]);\\n\",\n       \"\\t            return function(t) {\\n\",\n       \"\\t              var l = i(t), k = dx / l[2];\\n\",\n       \"\\t              this.__chart__ = view = {\\n\",\n       \"\\t                x: cx - l[0] * k,\\n\",\n       \"\\t                y: cy - l[1] * k,\\n\",\n       \"\\t                k: k\\n\",\n       \"\\t              };\\n\",\n       \"\\t              zoomed(dispatch);\\n\",\n       \"\\t            };\\n\",\n       \"\\t          }).each(\\\"interrupt.zoom\\\", function() {\\n\",\n       \"\\t            zoomended(dispatch);\\n\",\n       \"\\t          }).each(\\\"end.zoom\\\", function() {\\n\",\n       \"\\t            zoomended(dispatch);\\n\",\n       \"\\t          });\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          this.__chart__ = view;\\n\",\n       \"\\t          zoomstarted(dispatch);\\n\",\n       \"\\t          zoomed(dispatch);\\n\",\n       \"\\t          zoomended(dispatch);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.translate = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ view.x, view.y ];\\n\",\n       \"\\t      view = {\\n\",\n       \"\\t        x: +_[0],\\n\",\n       \"\\t        y: +_[1],\\n\",\n       \"\\t        k: view.k\\n\",\n       \"\\t      };\\n\",\n       \"\\t      rescale();\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.scale = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return view.k;\\n\",\n       \"\\t      view = {\\n\",\n       \"\\t        x: view.x,\\n\",\n       \"\\t        y: view.y,\\n\",\n       \"\\t        k: null\\n\",\n       \"\\t      };\\n\",\n       \"\\t      scaleTo(+_);\\n\",\n       \"\\t      rescale();\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.scaleExtent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return scaleExtent;\\n\",\n       \"\\t      scaleExtent = _ == null ? d3_behavior_zoomInfinity : [ +_[0], +_[1] ];\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.center = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return center;\\n\",\n       \"\\t      center = _ && [ +_[0], +_[1] ];\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.size = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return size;\\n\",\n       \"\\t      size = _ && [ +_[0], +_[1] ];\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.duration = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return duration;\\n\",\n       \"\\t      duration = +_;\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.x = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return x1;\\n\",\n       \"\\t      x1 = z;\\n\",\n       \"\\t      x0 = z.copy();\\n\",\n       \"\\t      view = {\\n\",\n       \"\\t        x: 0,\\n\",\n       \"\\t        y: 0,\\n\",\n       \"\\t        k: 1\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    zoom.y = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return y1;\\n\",\n       \"\\t      y1 = z;\\n\",\n       \"\\t      y0 = z.copy();\\n\",\n       \"\\t      view = {\\n\",\n       \"\\t        x: 0,\\n\",\n       \"\\t        y: 0,\\n\",\n       \"\\t        k: 1\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return zoom;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function location(p) {\\n\",\n       \"\\t      return [ (p[0] - view.x) / view.k, (p[1] - view.y) / view.k ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function point(l) {\\n\",\n       \"\\t      return [ l[0] * view.k + view.x, l[1] * view.k + view.y ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function scaleTo(s) {\\n\",\n       \"\\t      view.k = Math.max(scaleExtent[0], Math.min(scaleExtent[1], s));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function translateTo(p, l) {\\n\",\n       \"\\t      l = point(l);\\n\",\n       \"\\t      view.x += p[0] - l[0];\\n\",\n       \"\\t      view.y += p[1] - l[1];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function zoomTo(that, p, l, k) {\\n\",\n       \"\\t      that.__chart__ = {\\n\",\n       \"\\t        x: view.x,\\n\",\n       \"\\t        y: view.y,\\n\",\n       \"\\t        k: view.k\\n\",\n       \"\\t      };\\n\",\n       \"\\t      scaleTo(Math.pow(2, k));\\n\",\n       \"\\t      translateTo(center0 = p, l);\\n\",\n       \"\\t      that = d3.select(that);\\n\",\n       \"\\t      if (duration > 0) that = that.transition().duration(duration);\\n\",\n       \"\\t      that.call(zoom.event);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function rescale() {\\n\",\n       \"\\t      if (x1) x1.domain(x0.range().map(function(x) {\\n\",\n       \"\\t        return (x - view.x) / view.k;\\n\",\n       \"\\t      }).map(x0.invert));\\n\",\n       \"\\t      if (y1) y1.domain(y0.range().map(function(y) {\\n\",\n       \"\\t        return (y - view.y) / view.k;\\n\",\n       \"\\t      }).map(y0.invert));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function zoomstarted(dispatch) {\\n\",\n       \"\\t      if (!zooming++) dispatch({\\n\",\n       \"\\t        type: \\\"zoomstart\\\"\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function zoomed(dispatch) {\\n\",\n       \"\\t      rescale();\\n\",\n       \"\\t      dispatch({\\n\",\n       \"\\t        type: \\\"zoom\\\",\\n\",\n       \"\\t        scale: view.k,\\n\",\n       \"\\t        translate: [ view.x, view.y ]\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function zoomended(dispatch) {\\n\",\n       \"\\t      if (!--zooming) dispatch({\\n\",\n       \"\\t        type: \\\"zoomend\\\"\\n\",\n       \"\\t      }), center0 = null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function mousedowned() {\\n\",\n       \"\\t      var that = this, dispatch = event.of(that, arguments), dragged = 0, subject = d3.select(d3_window(that)).on(mousemove, moved).on(mouseup, ended), location0 = location(d3.mouse(that)), dragRestore = d3_event_dragSuppress(that);\\n\",\n       \"\\t      d3_selection_interrupt.call(that);\\n\",\n       \"\\t      zoomstarted(dispatch);\\n\",\n       \"\\t      function moved() {\\n\",\n       \"\\t        dragged = 1;\\n\",\n       \"\\t        translateTo(d3.mouse(that), location0);\\n\",\n       \"\\t        zoomed(dispatch);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ended() {\\n\",\n       \"\\t        subject.on(mousemove, null).on(mouseup, null);\\n\",\n       \"\\t        dragRestore(dragged);\\n\",\n       \"\\t        zoomended(dispatch);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function touchstarted() {\\n\",\n       \"\\t      var that = this, dispatch = event.of(that, arguments), locations0 = {}, distance0 = 0, scale0, zoomName = \\\".zoom-\\\" + d3.event.changedTouches[0].identifier, touchmove = \\\"touchmove\\\" + zoomName, touchend = \\\"touchend\\\" + zoomName, targets = [], subject = d3.select(that), dragRestore = d3_event_dragSuppress(that);\\n\",\n       \"\\t      started();\\n\",\n       \"\\t      zoomstarted(dispatch);\\n\",\n       \"\\t      subject.on(mousedown, null).on(touchstart, started);\\n\",\n       \"\\t      function relocate() {\\n\",\n       \"\\t        var touches = d3.touches(that);\\n\",\n       \"\\t        scale0 = view.k;\\n\",\n       \"\\t        touches.forEach(function(t) {\\n\",\n       \"\\t          if (t.identifier in locations0) locations0[t.identifier] = location(t);\\n\",\n       \"\\t        });\\n\",\n       \"\\t        return touches;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function started() {\\n\",\n       \"\\t        var target = d3.event.target;\\n\",\n       \"\\t        d3.select(target).on(touchmove, moved).on(touchend, ended);\\n\",\n       \"\\t        targets.push(target);\\n\",\n       \"\\t        var changed = d3.event.changedTouches;\\n\",\n       \"\\t        for (var i = 0, n = changed.length; i < n; ++i) {\\n\",\n       \"\\t          locations0[changed[i].identifier] = null;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var touches = relocate(), now = Date.now();\\n\",\n       \"\\t        if (touches.length === 1) {\\n\",\n       \"\\t          if (now - touchtime < 500) {\\n\",\n       \"\\t            var p = touches[0];\\n\",\n       \"\\t            zoomTo(that, p, locations0[p.identifier], Math.floor(Math.log(view.k) / Math.LN2) + 1);\\n\",\n       \"\\t            d3_eventPreventDefault();\\n\",\n       \"\\t          }\\n\",\n       \"\\t          touchtime = now;\\n\",\n       \"\\t        } else if (touches.length > 1) {\\n\",\n       \"\\t          var p = touches[0], q = touches[1], dx = p[0] - q[0], dy = p[1] - q[1];\\n\",\n       \"\\t          distance0 = dx * dx + dy * dy;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function moved() {\\n\",\n       \"\\t        var touches = d3.touches(that), p0, l0, p1, l1;\\n\",\n       \"\\t        d3_selection_interrupt.call(that);\\n\",\n       \"\\t        for (var i = 0, n = touches.length; i < n; ++i, l1 = null) {\\n\",\n       \"\\t          p1 = touches[i];\\n\",\n       \"\\t          if (l1 = locations0[p1.identifier]) {\\n\",\n       \"\\t            if (l0) break;\\n\",\n       \"\\t            p0 = p1, l0 = l1;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (l1) {\\n\",\n       \"\\t          var distance1 = (distance1 = p1[0] - p0[0]) * distance1 + (distance1 = p1[1] - p0[1]) * distance1, scale1 = distance0 && Math.sqrt(distance1 / distance0);\\n\",\n       \"\\t          p0 = [ (p0[0] + p1[0]) / 2, (p0[1] + p1[1]) / 2 ];\\n\",\n       \"\\t          l0 = [ (l0[0] + l1[0]) / 2, (l0[1] + l1[1]) / 2 ];\\n\",\n       \"\\t          scaleTo(scale1 * scale0);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        touchtime = null;\\n\",\n       \"\\t        translateTo(p0, l0);\\n\",\n       \"\\t        zoomed(dispatch);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ended() {\\n\",\n       \"\\t        if (d3.event.touches.length) {\\n\",\n       \"\\t          var changed = d3.event.changedTouches;\\n\",\n       \"\\t          for (var i = 0, n = changed.length; i < n; ++i) {\\n\",\n       \"\\t            delete locations0[changed[i].identifier];\\n\",\n       \"\\t          }\\n\",\n       \"\\t          for (var identifier in locations0) {\\n\",\n       \"\\t            return void relocate();\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        d3.selectAll(targets).on(zoomName, null);\\n\",\n       \"\\t        subject.on(mousedown, mousedowned).on(touchstart, touchstarted);\\n\",\n       \"\\t        dragRestore();\\n\",\n       \"\\t        zoomended(dispatch);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function mousewheeled() {\\n\",\n       \"\\t      var dispatch = event.of(this, arguments);\\n\",\n       \"\\t      if (mousewheelTimer) clearTimeout(mousewheelTimer); else d3_selection_interrupt.call(this), \\n\",\n       \"\\t      translate0 = location(center0 = center || d3.mouse(this)), zoomstarted(dispatch);\\n\",\n       \"\\t      mousewheelTimer = setTimeout(function() {\\n\",\n       \"\\t        mousewheelTimer = null;\\n\",\n       \"\\t        zoomended(dispatch);\\n\",\n       \"\\t      }, 50);\\n\",\n       \"\\t      d3_eventPreventDefault();\\n\",\n       \"\\t      scaleTo(Math.pow(2, d3_behavior_zoomDelta() * .002) * view.k);\\n\",\n       \"\\t      translateTo(center0, translate0);\\n\",\n       \"\\t      zoomed(dispatch);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function dblclicked() {\\n\",\n       \"\\t      var p = d3.mouse(this), k = Math.log(view.k) / Math.LN2;\\n\",\n       \"\\t      zoomTo(this, p, location(p), d3.event.shiftKey ? Math.ceil(k) - 1 : Math.floor(k) + 1);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3.rebind(zoom, event, \\\"on\\\");\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_behavior_zoomInfinity = [ 0, Infinity ], d3_behavior_zoomDelta, d3_behavior_zoomWheel;\\n\",\n       \"\\t  d3.color = d3_color;\\n\",\n       \"\\t  function d3_color() {}\\n\",\n       \"\\t  d3_color.prototype.toString = function() {\\n\",\n       \"\\t    return this.rgb() + \\\"\\\";\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.hsl = d3_hsl;\\n\",\n       \"\\t  function d3_hsl(h, s, l) {\\n\",\n       \"\\t    return this instanceof d3_hsl ? void (this.h = +h, this.s = +s, this.l = +l) : arguments.length < 2 ? h instanceof d3_hsl ? new d3_hsl(h.h, h.s, h.l) : d3_rgb_parse(\\\"\\\" + h, d3_rgb_hsl, d3_hsl) : new d3_hsl(h, s, l);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_hslPrototype = d3_hsl.prototype = new d3_color();\\n\",\n       \"\\t  d3_hslPrototype.brighter = function(k) {\\n\",\n       \"\\t    k = Math.pow(.7, arguments.length ? k : 1);\\n\",\n       \"\\t    return new d3_hsl(this.h, this.s, this.l / k);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_hslPrototype.darker = function(k) {\\n\",\n       \"\\t    k = Math.pow(.7, arguments.length ? k : 1);\\n\",\n       \"\\t    return new d3_hsl(this.h, this.s, k * this.l);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_hslPrototype.rgb = function() {\\n\",\n       \"\\t    return d3_hsl_rgb(this.h, this.s, this.l);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_hsl_rgb(h, s, l) {\\n\",\n       \"\\t    var m1, m2;\\n\",\n       \"\\t    h = isNaN(h) ? 0 : (h %= 360) < 0 ? h + 360 : h;\\n\",\n       \"\\t    s = isNaN(s) ? 0 : s < 0 ? 0 : s > 1 ? 1 : s;\\n\",\n       \"\\t    l = l < 0 ? 0 : l > 1 ? 1 : l;\\n\",\n       \"\\t    m2 = l <= .5 ? l * (1 + s) : l + s - l * s;\\n\",\n       \"\\t    m1 = 2 * l - m2;\\n\",\n       \"\\t    function v(h) {\\n\",\n       \"\\t      if (h > 360) h -= 360; else if (h < 0) h += 360;\\n\",\n       \"\\t      if (h < 60) return m1 + (m2 - m1) * h / 60;\\n\",\n       \"\\t      if (h < 180) return m2;\\n\",\n       \"\\t      if (h < 240) return m1 + (m2 - m1) * (240 - h) / 60;\\n\",\n       \"\\t      return m1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function vv(h) {\\n\",\n       \"\\t      return Math.round(v(h) * 255);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return new d3_rgb(vv(h + 120), vv(h), vv(h - 120));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.hcl = d3_hcl;\\n\",\n       \"\\t  function d3_hcl(h, c, l) {\\n\",\n       \"\\t    return this instanceof d3_hcl ? void (this.h = +h, this.c = +c, this.l = +l) : arguments.length < 2 ? h instanceof d3_hcl ? new d3_hcl(h.h, h.c, h.l) : h instanceof d3_lab ? d3_lab_hcl(h.l, h.a, h.b) : d3_lab_hcl((h = d3_rgb_lab((h = d3.rgb(h)).r, h.g, h.b)).l, h.a, h.b) : new d3_hcl(h, c, l);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_hclPrototype = d3_hcl.prototype = new d3_color();\\n\",\n       \"\\t  d3_hclPrototype.brighter = function(k) {\\n\",\n       \"\\t    return new d3_hcl(this.h, this.c, Math.min(100, this.l + d3_lab_K * (arguments.length ? k : 1)));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_hclPrototype.darker = function(k) {\\n\",\n       \"\\t    return new d3_hcl(this.h, this.c, Math.max(0, this.l - d3_lab_K * (arguments.length ? k : 1)));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_hclPrototype.rgb = function() {\\n\",\n       \"\\t    return d3_hcl_lab(this.h, this.c, this.l).rgb();\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_hcl_lab(h, c, l) {\\n\",\n       \"\\t    if (isNaN(h)) h = 0;\\n\",\n       \"\\t    if (isNaN(c)) c = 0;\\n\",\n       \"\\t    return new d3_lab(l, Math.cos(h *= d3_radians) * c, Math.sin(h) * c);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.lab = d3_lab;\\n\",\n       \"\\t  function d3_lab(l, a, b) {\\n\",\n       \"\\t    return this instanceof d3_lab ? void (this.l = +l, this.a = +a, this.b = +b) : arguments.length < 2 ? l instanceof d3_lab ? new d3_lab(l.l, l.a, l.b) : l instanceof d3_hcl ? d3_hcl_lab(l.h, l.c, l.l) : d3_rgb_lab((l = d3_rgb(l)).r, l.g, l.b) : new d3_lab(l, a, b);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_lab_K = 18;\\n\",\n       \"\\t  var d3_lab_X = .95047, d3_lab_Y = 1, d3_lab_Z = 1.08883;\\n\",\n       \"\\t  var d3_labPrototype = d3_lab.prototype = new d3_color();\\n\",\n       \"\\t  d3_labPrototype.brighter = function(k) {\\n\",\n       \"\\t    return new d3_lab(Math.min(100, this.l + d3_lab_K * (arguments.length ? k : 1)), this.a, this.b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_labPrototype.darker = function(k) {\\n\",\n       \"\\t    return new d3_lab(Math.max(0, this.l - d3_lab_K * (arguments.length ? k : 1)), this.a, this.b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_labPrototype.rgb = function() {\\n\",\n       \"\\t    return d3_lab_rgb(this.l, this.a, this.b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_lab_rgb(l, a, b) {\\n\",\n       \"\\t    var y = (l + 16) / 116, x = y + a / 500, z = y - b / 200;\\n\",\n       \"\\t    x = d3_lab_xyz(x) * d3_lab_X;\\n\",\n       \"\\t    y = d3_lab_xyz(y) * d3_lab_Y;\\n\",\n       \"\\t    z = d3_lab_xyz(z) * d3_lab_Z;\\n\",\n       \"\\t    return new d3_rgb(d3_xyz_rgb(3.2404542 * x - 1.5371385 * y - .4985314 * z), d3_xyz_rgb(-.969266 * x + 1.8760108 * y + .041556 * z), d3_xyz_rgb(.0556434 * x - .2040259 * y + 1.0572252 * z));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_lab_hcl(l, a, b) {\\n\",\n       \"\\t    return l > 0 ? new d3_hcl(Math.atan2(b, a) * d3_degrees, Math.sqrt(a * a + b * b), l) : new d3_hcl(NaN, NaN, l);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_lab_xyz(x) {\\n\",\n       \"\\t    return x > .206893034 ? x * x * x : (x - 4 / 29) / 7.787037;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_xyz_lab(x) {\\n\",\n       \"\\t    return x > .008856 ? Math.pow(x, 1 / 3) : 7.787037 * x + 4 / 29;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_xyz_rgb(r) {\\n\",\n       \"\\t    return Math.round(255 * (r <= .00304 ? 12.92 * r : 1.055 * Math.pow(r, 1 / 2.4) - .055));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.rgb = d3_rgb;\\n\",\n       \"\\t  function d3_rgb(r, g, b) {\\n\",\n       \"\\t    return this instanceof d3_rgb ? void (this.r = ~~r, this.g = ~~g, this.b = ~~b) : arguments.length < 2 ? r instanceof d3_rgb ? new d3_rgb(r.r, r.g, r.b) : d3_rgb_parse(\\\"\\\" + r, d3_rgb, d3_hsl_rgb) : new d3_rgb(r, g, b);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgbNumber(value) {\\n\",\n       \"\\t    return new d3_rgb(value >> 16, value >> 8 & 255, value & 255);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgbString(value) {\\n\",\n       \"\\t    return d3_rgbNumber(value) + \\\"\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_rgbPrototype = d3_rgb.prototype = new d3_color();\\n\",\n       \"\\t  d3_rgbPrototype.brighter = function(k) {\\n\",\n       \"\\t    k = Math.pow(.7, arguments.length ? k : 1);\\n\",\n       \"\\t    var r = this.r, g = this.g, b = this.b, i = 30;\\n\",\n       \"\\t    if (!r && !g && !b) return new d3_rgb(i, i, i);\\n\",\n       \"\\t    if (r && r < i) r = i;\\n\",\n       \"\\t    if (g && g < i) g = i;\\n\",\n       \"\\t    if (b && b < i) b = i;\\n\",\n       \"\\t    return new d3_rgb(Math.min(255, r / k), Math.min(255, g / k), Math.min(255, b / k));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_rgbPrototype.darker = function(k) {\\n\",\n       \"\\t    k = Math.pow(.7, arguments.length ? k : 1);\\n\",\n       \"\\t    return new d3_rgb(k * this.r, k * this.g, k * this.b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_rgbPrototype.hsl = function() {\\n\",\n       \"\\t    return d3_rgb_hsl(this.r, this.g, this.b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_rgbPrototype.toString = function() {\\n\",\n       \"\\t    return \\\"#\\\" + d3_rgb_hex(this.r) + d3_rgb_hex(this.g) + d3_rgb_hex(this.b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_rgb_hex(v) {\\n\",\n       \"\\t    return v < 16 ? \\\"0\\\" + Math.max(0, v).toString(16) : Math.min(255, v).toString(16);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgb_parse(format, rgb, hsl) {\\n\",\n       \"\\t    var r = 0, g = 0, b = 0, m1, m2, color;\\n\",\n       \"\\t    m1 = /([a-z]+)\\\\((.*)\\\\)/.exec(format = format.toLowerCase());\\n\",\n       \"\\t    if (m1) {\\n\",\n       \"\\t      m2 = m1[2].split(\\\",\\\");\\n\",\n       \"\\t      switch (m1[1]) {\\n\",\n       \"\\t       case \\\"hsl\\\":\\n\",\n       \"\\t        {\\n\",\n       \"\\t          return hsl(parseFloat(m2[0]), parseFloat(m2[1]) / 100, parseFloat(m2[2]) / 100);\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"rgb\\\":\\n\",\n       \"\\t        {\\n\",\n       \"\\t          return rgb(d3_rgb_parseNumber(m2[0]), d3_rgb_parseNumber(m2[1]), d3_rgb_parseNumber(m2[2]));\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (color = d3_rgb_names.get(format)) {\\n\",\n       \"\\t      return rgb(color.r, color.g, color.b);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (format != null && format.charAt(0) === \\\"#\\\" && !isNaN(color = parseInt(format.slice(1), 16))) {\\n\",\n       \"\\t      if (format.length === 4) {\\n\",\n       \"\\t        r = (color & 3840) >> 4;\\n\",\n       \"\\t        r = r >> 4 | r;\\n\",\n       \"\\t        g = color & 240;\\n\",\n       \"\\t        g = g >> 4 | g;\\n\",\n       \"\\t        b = color & 15;\\n\",\n       \"\\t        b = b << 4 | b;\\n\",\n       \"\\t      } else if (format.length === 7) {\\n\",\n       \"\\t        r = (color & 16711680) >> 16;\\n\",\n       \"\\t        g = (color & 65280) >> 8;\\n\",\n       \"\\t        b = color & 255;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return rgb(r, g, b);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgb_hsl(r, g, b) {\\n\",\n       \"\\t    var min = Math.min(r /= 255, g /= 255, b /= 255), max = Math.max(r, g, b), d = max - min, h, s, l = (max + min) / 2;\\n\",\n       \"\\t    if (d) {\\n\",\n       \"\\t      s = l < .5 ? d / (max + min) : d / (2 - max - min);\\n\",\n       \"\\t      if (r == max) h = (g - b) / d + (g < b ? 6 : 0); else if (g == max) h = (b - r) / d + 2; else h = (r - g) / d + 4;\\n\",\n       \"\\t      h *= 60;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      h = NaN;\\n\",\n       \"\\t      s = l > 0 && l < 1 ? 0 : h;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return new d3_hsl(h, s, l);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgb_lab(r, g, b) {\\n\",\n       \"\\t    r = d3_rgb_xyz(r);\\n\",\n       \"\\t    g = d3_rgb_xyz(g);\\n\",\n       \"\\t    b = d3_rgb_xyz(b);\\n\",\n       \"\\t    var x = d3_xyz_lab((.4124564 * r + .3575761 * g + .1804375 * b) / d3_lab_X), y = d3_xyz_lab((.2126729 * r + .7151522 * g + .072175 * b) / d3_lab_Y), z = d3_xyz_lab((.0193339 * r + .119192 * g + .9503041 * b) / d3_lab_Z);\\n\",\n       \"\\t    return d3_lab(116 * y - 16, 500 * (x - y), 200 * (y - z));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgb_xyz(r) {\\n\",\n       \"\\t    return (r /= 255) <= .04045 ? r / 12.92 : Math.pow((r + .055) / 1.055, 2.4);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_rgb_parseNumber(c) {\\n\",\n       \"\\t    var f = parseFloat(c);\\n\",\n       \"\\t    return c.charAt(c.length - 1) === \\\"%\\\" ? Math.round(f * 2.55) : f;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_rgb_names = d3.map({\\n\",\n       \"\\t    aliceblue: 15792383,\\n\",\n       \"\\t    antiquewhite: 16444375,\\n\",\n       \"\\t    aqua: 65535,\\n\",\n       \"\\t    aquamarine: 8388564,\\n\",\n       \"\\t    azure: 15794175,\\n\",\n       \"\\t    beige: 16119260,\\n\",\n       \"\\t    bisque: 16770244,\\n\",\n       \"\\t    black: 0,\\n\",\n       \"\\t    blanchedalmond: 16772045,\\n\",\n       \"\\t    blue: 255,\\n\",\n       \"\\t    blueviolet: 9055202,\\n\",\n       \"\\t    brown: 10824234,\\n\",\n       \"\\t    burlywood: 14596231,\\n\",\n       \"\\t    cadetblue: 6266528,\\n\",\n       \"\\t    chartreuse: 8388352,\\n\",\n       \"\\t    chocolate: 13789470,\\n\",\n       \"\\t    coral: 16744272,\\n\",\n       \"\\t    cornflowerblue: 6591981,\\n\",\n       \"\\t    cornsilk: 16775388,\\n\",\n       \"\\t    crimson: 14423100,\\n\",\n       \"\\t    cyan: 65535,\\n\",\n       \"\\t    darkblue: 139,\\n\",\n       \"\\t    darkcyan: 35723,\\n\",\n       \"\\t    darkgoldenrod: 12092939,\\n\",\n       \"\\t    darkgray: 11119017,\\n\",\n       \"\\t    darkgreen: 25600,\\n\",\n       \"\\t    darkgrey: 11119017,\\n\",\n       \"\\t    darkkhaki: 12433259,\\n\",\n       \"\\t    darkmagenta: 9109643,\\n\",\n       \"\\t    darkolivegreen: 5597999,\\n\",\n       \"\\t    darkorange: 16747520,\\n\",\n       \"\\t    darkorchid: 10040012,\\n\",\n       \"\\t    darkred: 9109504,\\n\",\n       \"\\t    darksalmon: 15308410,\\n\",\n       \"\\t    darkseagreen: 9419919,\\n\",\n       \"\\t    darkslateblue: 4734347,\\n\",\n       \"\\t    darkslategray: 3100495,\\n\",\n       \"\\t    darkslategrey: 3100495,\\n\",\n       \"\\t    darkturquoise: 52945,\\n\",\n       \"\\t    darkviolet: 9699539,\\n\",\n       \"\\t    deeppink: 16716947,\\n\",\n       \"\\t    deepskyblue: 49151,\\n\",\n       \"\\t    dimgray: 6908265,\\n\",\n       \"\\t    dimgrey: 6908265,\\n\",\n       \"\\t    dodgerblue: 2003199,\\n\",\n       \"\\t    firebrick: 11674146,\\n\",\n       \"\\t    floralwhite: 16775920,\\n\",\n       \"\\t    forestgreen: 2263842,\\n\",\n       \"\\t    fuchsia: 16711935,\\n\",\n       \"\\t    gainsboro: 14474460,\\n\",\n       \"\\t    ghostwhite: 16316671,\\n\",\n       \"\\t    gold: 16766720,\\n\",\n       \"\\t    goldenrod: 14329120,\\n\",\n       \"\\t    gray: 8421504,\\n\",\n       \"\\t    green: 32768,\\n\",\n       \"\\t    greenyellow: 11403055,\\n\",\n       \"\\t    grey: 8421504,\\n\",\n       \"\\t    honeydew: 15794160,\\n\",\n       \"\\t    hotpink: 16738740,\\n\",\n       \"\\t    indianred: 13458524,\\n\",\n       \"\\t    indigo: 4915330,\\n\",\n       \"\\t    ivory: 16777200,\\n\",\n       \"\\t    khaki: 15787660,\\n\",\n       \"\\t    lavender: 15132410,\\n\",\n       \"\\t    lavenderblush: 16773365,\\n\",\n       \"\\t    lawngreen: 8190976,\\n\",\n       \"\\t    lemonchiffon: 16775885,\\n\",\n       \"\\t    lightblue: 11393254,\\n\",\n       \"\\t    lightcoral: 15761536,\\n\",\n       \"\\t    lightcyan: 14745599,\\n\",\n       \"\\t    lightgoldenrodyellow: 16448210,\\n\",\n       \"\\t    lightgray: 13882323,\\n\",\n       \"\\t    lightgreen: 9498256,\\n\",\n       \"\\t    lightgrey: 13882323,\\n\",\n       \"\\t    lightpink: 16758465,\\n\",\n       \"\\t    lightsalmon: 16752762,\\n\",\n       \"\\t    lightseagreen: 2142890,\\n\",\n       \"\\t    lightskyblue: 8900346,\\n\",\n       \"\\t    lightslategray: 7833753,\\n\",\n       \"\\t    lightslategrey: 7833753,\\n\",\n       \"\\t    lightsteelblue: 11584734,\\n\",\n       \"\\t    lightyellow: 16777184,\\n\",\n       \"\\t    lime: 65280,\\n\",\n       \"\\t    limegreen: 3329330,\\n\",\n       \"\\t    linen: 16445670,\\n\",\n       \"\\t    magenta: 16711935,\\n\",\n       \"\\t    maroon: 8388608,\\n\",\n       \"\\t    mediumaquamarine: 6737322,\\n\",\n       \"\\t    mediumblue: 205,\\n\",\n       \"\\t    mediumorchid: 12211667,\\n\",\n       \"\\t    mediumpurple: 9662683,\\n\",\n       \"\\t    mediumseagreen: 3978097,\\n\",\n       \"\\t    mediumslateblue: 8087790,\\n\",\n       \"\\t    mediumspringgreen: 64154,\\n\",\n       \"\\t    mediumturquoise: 4772300,\\n\",\n       \"\\t    mediumvioletred: 13047173,\\n\",\n       \"\\t    midnightblue: 1644912,\\n\",\n       \"\\t    mintcream: 16121850,\\n\",\n       \"\\t    mistyrose: 16770273,\\n\",\n       \"\\t    moccasin: 16770229,\\n\",\n       \"\\t    navajowhite: 16768685,\\n\",\n       \"\\t    navy: 128,\\n\",\n       \"\\t    oldlace: 16643558,\\n\",\n       \"\\t    olive: 8421376,\\n\",\n       \"\\t    olivedrab: 7048739,\\n\",\n       \"\\t    orange: 16753920,\\n\",\n       \"\\t    orangered: 16729344,\\n\",\n       \"\\t    orchid: 14315734,\\n\",\n       \"\\t    palegoldenrod: 15657130,\\n\",\n       \"\\t    palegreen: 10025880,\\n\",\n       \"\\t    paleturquoise: 11529966,\\n\",\n       \"\\t    palevioletred: 14381203,\\n\",\n       \"\\t    papayawhip: 16773077,\\n\",\n       \"\\t    peachpuff: 16767673,\\n\",\n       \"\\t    peru: 13468991,\\n\",\n       \"\\t    pink: 16761035,\\n\",\n       \"\\t    plum: 14524637,\\n\",\n       \"\\t    powderblue: 11591910,\\n\",\n       \"\\t    purple: 8388736,\\n\",\n       \"\\t    rebeccapurple: 6697881,\\n\",\n       \"\\t    red: 16711680,\\n\",\n       \"\\t    rosybrown: 12357519,\\n\",\n       \"\\t    royalblue: 4286945,\\n\",\n       \"\\t    saddlebrown: 9127187,\\n\",\n       \"\\t    salmon: 16416882,\\n\",\n       \"\\t    sandybrown: 16032864,\\n\",\n       \"\\t    seagreen: 3050327,\\n\",\n       \"\\t    seashell: 16774638,\\n\",\n       \"\\t    sienna: 10506797,\\n\",\n       \"\\t    silver: 12632256,\\n\",\n       \"\\t    skyblue: 8900331,\\n\",\n       \"\\t    slateblue: 6970061,\\n\",\n       \"\\t    slategray: 7372944,\\n\",\n       \"\\t    slategrey: 7372944,\\n\",\n       \"\\t    snow: 16775930,\\n\",\n       \"\\t    springgreen: 65407,\\n\",\n       \"\\t    steelblue: 4620980,\\n\",\n       \"\\t    tan: 13808780,\\n\",\n       \"\\t    teal: 32896,\\n\",\n       \"\\t    thistle: 14204888,\\n\",\n       \"\\t    tomato: 16737095,\\n\",\n       \"\\t    turquoise: 4251856,\\n\",\n       \"\\t    violet: 15631086,\\n\",\n       \"\\t    wheat: 16113331,\\n\",\n       \"\\t    white: 16777215,\\n\",\n       \"\\t    whitesmoke: 16119285,\\n\",\n       \"\\t    yellow: 16776960,\\n\",\n       \"\\t    yellowgreen: 10145074\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_rgb_names.forEach(function(key, value) {\\n\",\n       \"\\t    d3_rgb_names.set(key, d3_rgbNumber(value));\\n\",\n       \"\\t  });\\n\",\n       \"\\t  function d3_functor(v) {\\n\",\n       \"\\t    return typeof v === \\\"function\\\" ? v : function() {\\n\",\n       \"\\t      return v;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.functor = d3_functor;\\n\",\n       \"\\t  d3.xhr = d3_xhrType(d3_identity);\\n\",\n       \"\\t  function d3_xhrType(response) {\\n\",\n       \"\\t    return function(url, mimeType, callback) {\\n\",\n       \"\\t      if (arguments.length === 2 && typeof mimeType === \\\"function\\\") callback = mimeType, \\n\",\n       \"\\t      mimeType = null;\\n\",\n       \"\\t      return d3_xhr(url, mimeType, response, callback);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_xhr(url, mimeType, response, callback) {\\n\",\n       \"\\t    var xhr = {}, dispatch = d3.dispatch(\\\"beforesend\\\", \\\"progress\\\", \\\"load\\\", \\\"error\\\"), headers = {}, request = new XMLHttpRequest(), responseType = null;\\n\",\n       \"\\t    if (this.XDomainRequest && !(\\\"withCredentials\\\" in request) && /^(http(s)?:)?\\\\/\\\\//.test(url)) request = new XDomainRequest();\\n\",\n       \"\\t    \\\"onload\\\" in request ? request.onload = request.onerror = respond : request.onreadystatechange = function() {\\n\",\n       \"\\t      request.readyState > 3 && respond();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function respond() {\\n\",\n       \"\\t      var status = request.status, result;\\n\",\n       \"\\t      if (!status && d3_xhrHasResponse(request) || status >= 200 && status < 300 || status === 304) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          result = response.call(xhr, request);\\n\",\n       \"\\t        } catch (e) {\\n\",\n       \"\\t          dispatch.error.call(xhr, e);\\n\",\n       \"\\t          return;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        dispatch.load.call(xhr, result);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        dispatch.error.call(xhr, request);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    request.onprogress = function(event) {\\n\",\n       \"\\t      var o = d3.event;\\n\",\n       \"\\t      d3.event = event;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        dispatch.progress.call(xhr, request);\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        d3.event = o;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t    xhr.header = function(name, value) {\\n\",\n       \"\\t      name = (name + \\\"\\\").toLowerCase();\\n\",\n       \"\\t      if (arguments.length < 2) return headers[name];\\n\",\n       \"\\t      if (value == null) delete headers[name]; else headers[name] = value + \\\"\\\";\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    xhr.mimeType = function(value) {\\n\",\n       \"\\t      if (!arguments.length) return mimeType;\\n\",\n       \"\\t      mimeType = value == null ? null : value + \\\"\\\";\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    xhr.responseType = function(value) {\\n\",\n       \"\\t      if (!arguments.length) return responseType;\\n\",\n       \"\\t      responseType = value;\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    xhr.response = function(value) {\\n\",\n       \"\\t      response = value;\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    [ \\\"get\\\", \\\"post\\\" ].forEach(function(method) {\\n\",\n       \"\\t      xhr[method] = function() {\\n\",\n       \"\\t        return xhr.send.apply(xhr, [ method ].concat(d3_array(arguments)));\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t    xhr.send = function(method, data, callback) {\\n\",\n       \"\\t      if (arguments.length === 2 && typeof data === \\\"function\\\") callback = data, data = null;\\n\",\n       \"\\t      request.open(method, url, true);\\n\",\n       \"\\t      if (mimeType != null && !(\\\"accept\\\" in headers)) headers[\\\"accept\\\"] = mimeType + \\\",*/*\\\";\\n\",\n       \"\\t      if (request.setRequestHeader) for (var name in headers) request.setRequestHeader(name, headers[name]);\\n\",\n       \"\\t      if (mimeType != null && request.overrideMimeType) request.overrideMimeType(mimeType);\\n\",\n       \"\\t      if (responseType != null) request.responseType = responseType;\\n\",\n       \"\\t      if (callback != null) xhr.on(\\\"error\\\", callback).on(\\\"load\\\", function(request) {\\n\",\n       \"\\t        callback(null, request);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      dispatch.beforesend.call(xhr, request);\\n\",\n       \"\\t      request.send(data == null ? null : data);\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    xhr.abort = function() {\\n\",\n       \"\\t      request.abort();\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3.rebind(xhr, dispatch, \\\"on\\\");\\n\",\n       \"\\t    return callback == null ? xhr : xhr.get(d3_xhr_fixCallback(callback));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_xhr_fixCallback(callback) {\\n\",\n       \"\\t    return callback.length === 1 ? function(error, request) {\\n\",\n       \"\\t      callback(error == null ? request : null);\\n\",\n       \"\\t    } : callback;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_xhrHasResponse(request) {\\n\",\n       \"\\t    var type = request.responseType;\\n\",\n       \"\\t    return type && type !== \\\"text\\\" ? request.response : request.responseText;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.dsv = function(delimiter, mimeType) {\\n\",\n       \"\\t    var reFormat = new RegExp('[\\\"' + delimiter + \\\"\\\\n]\\\"), delimiterCode = delimiter.charCodeAt(0);\\n\",\n       \"\\t    function dsv(url, row, callback) {\\n\",\n       \"\\t      if (arguments.length < 3) callback = row, row = null;\\n\",\n       \"\\t      var xhr = d3_xhr(url, mimeType, row == null ? response : typedResponse(row), callback);\\n\",\n       \"\\t      xhr.row = function(_) {\\n\",\n       \"\\t        return arguments.length ? xhr.response((row = _) == null ? response : typedResponse(_)) : row;\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return xhr;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function response(request) {\\n\",\n       \"\\t      return dsv.parse(request.responseText);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function typedResponse(f) {\\n\",\n       \"\\t      return function(request) {\\n\",\n       \"\\t        return dsv.parse(request.responseText, f);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    dsv.parse = function(text, f) {\\n\",\n       \"\\t      var o;\\n\",\n       \"\\t      return dsv.parseRows(text, function(row, i) {\\n\",\n       \"\\t        if (o) return o(row, i - 1);\\n\",\n       \"\\t        var a = new Function(\\\"d\\\", \\\"return {\\\" + row.map(function(name, i) {\\n\",\n       \"\\t          return JSON.stringify(name) + \\\": d[\\\" + i + \\\"]\\\";\\n\",\n       \"\\t        }).join(\\\",\\\") + \\\"}\\\");\\n\",\n       \"\\t        o = f ? function(row, i) {\\n\",\n       \"\\t          return f(a(row), i);\\n\",\n       \"\\t        } : a;\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    dsv.parseRows = function(text, f) {\\n\",\n       \"\\t      var EOL = {}, EOF = {}, rows = [], N = text.length, I = 0, n = 0, t, eol;\\n\",\n       \"\\t      function token() {\\n\",\n       \"\\t        if (I >= N) return EOF;\\n\",\n       \"\\t        if (eol) return eol = false, EOL;\\n\",\n       \"\\t        var j = I;\\n\",\n       \"\\t        if (text.charCodeAt(j) === 34) {\\n\",\n       \"\\t          var i = j;\\n\",\n       \"\\t          while (i++ < N) {\\n\",\n       \"\\t            if (text.charCodeAt(i) === 34) {\\n\",\n       \"\\t              if (text.charCodeAt(i + 1) !== 34) break;\\n\",\n       \"\\t              ++i;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          I = i + 2;\\n\",\n       \"\\t          var c = text.charCodeAt(i + 1);\\n\",\n       \"\\t          if (c === 13) {\\n\",\n       \"\\t            eol = true;\\n\",\n       \"\\t            if (text.charCodeAt(i + 2) === 10) ++I;\\n\",\n       \"\\t          } else if (c === 10) {\\n\",\n       \"\\t            eol = true;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          return text.slice(j + 1, i).replace(/\\\"\\\"/g, '\\\"');\\n\",\n       \"\\t        }\\n\",\n       \"\\t        while (I < N) {\\n\",\n       \"\\t          var c = text.charCodeAt(I++), k = 1;\\n\",\n       \"\\t          if (c === 10) eol = true; else if (c === 13) {\\n\",\n       \"\\t            eol = true;\\n\",\n       \"\\t            if (text.charCodeAt(I) === 10) ++I, ++k;\\n\",\n       \"\\t          } else if (c !== delimiterCode) continue;\\n\",\n       \"\\t          return text.slice(j, I - k);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return text.slice(j);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while ((t = token()) !== EOF) {\\n\",\n       \"\\t        var a = [];\\n\",\n       \"\\t        while (t !== EOL && t !== EOF) {\\n\",\n       \"\\t          a.push(t);\\n\",\n       \"\\t          t = token();\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (f && (a = f(a, n++)) == null) continue;\\n\",\n       \"\\t        rows.push(a);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return rows;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    dsv.format = function(rows) {\\n\",\n       \"\\t      if (Array.isArray(rows[0])) return dsv.formatRows(rows);\\n\",\n       \"\\t      var fieldSet = new d3_Set(), fields = [];\\n\",\n       \"\\t      rows.forEach(function(row) {\\n\",\n       \"\\t        for (var field in row) {\\n\",\n       \"\\t          if (!fieldSet.has(field)) {\\n\",\n       \"\\t            fields.push(fieldSet.add(field));\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return [ fields.map(formatValue).join(delimiter) ].concat(rows.map(function(row) {\\n\",\n       \"\\t        return fields.map(function(field) {\\n\",\n       \"\\t          return formatValue(row[field]);\\n\",\n       \"\\t        }).join(delimiter);\\n\",\n       \"\\t      })).join(\\\"\\\\n\\\");\\n\",\n       \"\\t    };\\n\",\n       \"\\t    dsv.formatRows = function(rows) {\\n\",\n       \"\\t      return rows.map(formatRow).join(\\\"\\\\n\\\");\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function formatRow(row) {\\n\",\n       \"\\t      return row.map(formatValue).join(delimiter);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function formatValue(text) {\\n\",\n       \"\\t      return reFormat.test(text) ? '\\\"' + text.replace(/\\\\\\\"/g, '\\\"\\\"') + '\\\"' : text;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return dsv;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.csv = d3.dsv(\\\",\\\", \\\"text/csv\\\");\\n\",\n       \"\\t  d3.tsv = d3.dsv(\\\"\\t\\\", \\\"text/tab-separated-values\\\");\\n\",\n       \"\\t  var d3_timer_queueHead, d3_timer_queueTail, d3_timer_interval, d3_timer_timeout, d3_timer_frame = this[d3_vendorSymbol(this, \\\"requestAnimationFrame\\\")] || function(callback) {\\n\",\n       \"\\t    setTimeout(callback, 17);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.timer = function() {\\n\",\n       \"\\t    d3_timer.apply(this, arguments);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_timer(callback, delay, then) {\\n\",\n       \"\\t    var n = arguments.length;\\n\",\n       \"\\t    if (n < 2) delay = 0;\\n\",\n       \"\\t    if (n < 3) then = Date.now();\\n\",\n       \"\\t    var time = then + delay, timer = {\\n\",\n       \"\\t      c: callback,\\n\",\n       \"\\t      t: time,\\n\",\n       \"\\t      n: null\\n\",\n       \"\\t    };\\n\",\n       \"\\t    if (d3_timer_queueTail) d3_timer_queueTail.n = timer; else d3_timer_queueHead = timer;\\n\",\n       \"\\t    d3_timer_queueTail = timer;\\n\",\n       \"\\t    if (!d3_timer_interval) {\\n\",\n       \"\\t      d3_timer_timeout = clearTimeout(d3_timer_timeout);\\n\",\n       \"\\t      d3_timer_interval = 1;\\n\",\n       \"\\t      d3_timer_frame(d3_timer_step);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return timer;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_timer_step() {\\n\",\n       \"\\t    var now = d3_timer_mark(), delay = d3_timer_sweep() - now;\\n\",\n       \"\\t    if (delay > 24) {\\n\",\n       \"\\t      if (isFinite(delay)) {\\n\",\n       \"\\t        clearTimeout(d3_timer_timeout);\\n\",\n       \"\\t        d3_timer_timeout = setTimeout(d3_timer_step, delay);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      d3_timer_interval = 0;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      d3_timer_interval = 1;\\n\",\n       \"\\t      d3_timer_frame(d3_timer_step);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.timer.flush = function() {\\n\",\n       \"\\t    d3_timer_mark();\\n\",\n       \"\\t    d3_timer_sweep();\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_timer_mark() {\\n\",\n       \"\\t    var now = Date.now(), timer = d3_timer_queueHead;\\n\",\n       \"\\t    while (timer) {\\n\",\n       \"\\t      if (now >= timer.t && timer.c(now - timer.t)) timer.c = null;\\n\",\n       \"\\t      timer = timer.n;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return now;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_timer_sweep() {\\n\",\n       \"\\t    var t0, t1 = d3_timer_queueHead, time = Infinity;\\n\",\n       \"\\t    while (t1) {\\n\",\n       \"\\t      if (t1.c) {\\n\",\n       \"\\t        if (t1.t < time) time = t1.t;\\n\",\n       \"\\t        t1 = (t0 = t1).n;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        t1 = t0 ? t0.n = t1.n : d3_timer_queueHead = t1.n;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_timer_queueTail = t0;\\n\",\n       \"\\t    return time;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_format_precision(x, p) {\\n\",\n       \"\\t    return p - (x ? Math.ceil(Math.log(x) / Math.LN10) : 1);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.round = function(x, n) {\\n\",\n       \"\\t    return n ? Math.round(x * (n = Math.pow(10, n))) / n : Math.round(x);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_formatPrefixes = [ \\\"y\\\", \\\"z\\\", \\\"a\\\", \\\"f\\\", \\\"p\\\", \\\"n\\\", \\\"µ\\\", \\\"m\\\", \\\"\\\", \\\"k\\\", \\\"M\\\", \\\"G\\\", \\\"T\\\", \\\"P\\\", \\\"E\\\", \\\"Z\\\", \\\"Y\\\" ].map(d3_formatPrefix);\\n\",\n       \"\\t  d3.formatPrefix = function(value, precision) {\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    if (value = +value) {\\n\",\n       \"\\t      if (value < 0) value *= -1;\\n\",\n       \"\\t      if (precision) value = d3.round(value, d3_format_precision(value, precision));\\n\",\n       \"\\t      i = 1 + Math.floor(1e-12 + Math.log(value) / Math.LN10);\\n\",\n       \"\\t      i = Math.max(-24, Math.min(24, Math.floor((i - 1) / 3) * 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_formatPrefixes[8 + i / 3];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_formatPrefix(d, i) {\\n\",\n       \"\\t    var k = Math.pow(10, abs(8 - i) * 3);\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      scale: i > 8 ? function(d) {\\n\",\n       \"\\t        return d / k;\\n\",\n       \"\\t      } : function(d) {\\n\",\n       \"\\t        return d * k;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      symbol: d\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_locale_numberFormat(locale) {\\n\",\n       \"\\t    var locale_decimal = locale.decimal, locale_thousands = locale.thousands, locale_grouping = locale.grouping, locale_currency = locale.currency, formatGroup = locale_grouping && locale_thousands ? function(value, width) {\\n\",\n       \"\\t      var i = value.length, t = [], j = 0, g = locale_grouping[0], length = 0;\\n\",\n       \"\\t      while (i > 0 && g > 0) {\\n\",\n       \"\\t        if (length + g + 1 > width) g = Math.max(1, width - length);\\n\",\n       \"\\t        t.push(value.substring(i -= g, i + g));\\n\",\n       \"\\t        if ((length += g + 1) > width) break;\\n\",\n       \"\\t        g = locale_grouping[j = (j + 1) % locale_grouping.length];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return t.reverse().join(locale_thousands);\\n\",\n       \"\\t    } : d3_identity;\\n\",\n       \"\\t    return function(specifier) {\\n\",\n       \"\\t      var match = d3_format_re.exec(specifier), fill = match[1] || \\\" \\\", align = match[2] || \\\">\\\", sign = match[3] || \\\"-\\\", symbol = match[4] || \\\"\\\", zfill = match[5], width = +match[6], comma = match[7], precision = match[8], type = match[9], scale = 1, prefix = \\\"\\\", suffix = \\\"\\\", integer = false, exponent = true;\\n\",\n       \"\\t      if (precision) precision = +precision.substring(1);\\n\",\n       \"\\t      if (zfill || fill === \\\"0\\\" && align === \\\"=\\\") {\\n\",\n       \"\\t        zfill = fill = \\\"0\\\";\\n\",\n       \"\\t        align = \\\"=\\\";\\n\",\n       \"\\t      }\\n\",\n       \"\\t      switch (type) {\\n\",\n       \"\\t       case \\\"n\\\":\\n\",\n       \"\\t        comma = true;\\n\",\n       \"\\t        type = \\\"g\\\";\\n\",\n       \"\\t        break;\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"%\\\":\\n\",\n       \"\\t        scale = 100;\\n\",\n       \"\\t        suffix = \\\"%\\\";\\n\",\n       \"\\t        type = \\\"f\\\";\\n\",\n       \"\\t        break;\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"p\\\":\\n\",\n       \"\\t        scale = 100;\\n\",\n       \"\\t        suffix = \\\"%\\\";\\n\",\n       \"\\t        type = \\\"r\\\";\\n\",\n       \"\\t        break;\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"b\\\":\\n\",\n       \"\\t       case \\\"o\\\":\\n\",\n       \"\\t       case \\\"x\\\":\\n\",\n       \"\\t       case \\\"X\\\":\\n\",\n       \"\\t        if (symbol === \\\"#\\\") prefix = \\\"0\\\" + type.toLowerCase();\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"c\\\":\\n\",\n       \"\\t        exponent = false;\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"d\\\":\\n\",\n       \"\\t        integer = true;\\n\",\n       \"\\t        precision = 0;\\n\",\n       \"\\t        break;\\n\",\n       \"\\t\\n\",\n       \"\\t       case \\\"s\\\":\\n\",\n       \"\\t        scale = -1;\\n\",\n       \"\\t        type = \\\"r\\\";\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (symbol === \\\"$\\\") prefix = locale_currency[0], suffix = locale_currency[1];\\n\",\n       \"\\t      if (type == \\\"r\\\" && !precision) type = \\\"g\\\";\\n\",\n       \"\\t      if (precision != null) {\\n\",\n       \"\\t        if (type == \\\"g\\\") precision = Math.max(1, Math.min(21, precision)); else if (type == \\\"e\\\" || type == \\\"f\\\") precision = Math.max(0, Math.min(20, precision));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      type = d3_format_types.get(type) || d3_format_typeDefault;\\n\",\n       \"\\t      var zcomma = zfill && comma;\\n\",\n       \"\\t      return function(value) {\\n\",\n       \"\\t        var fullSuffix = suffix;\\n\",\n       \"\\t        if (integer && value % 1) return \\\"\\\";\\n\",\n       \"\\t        var negative = value < 0 || value === 0 && 1 / value < 0 ? (value = -value, \\\"-\\\") : sign === \\\"-\\\" ? \\\"\\\" : sign;\\n\",\n       \"\\t        if (scale < 0) {\\n\",\n       \"\\t          var unit = d3.formatPrefix(value, precision);\\n\",\n       \"\\t          value = unit.scale(value);\\n\",\n       \"\\t          fullSuffix = unit.symbol + suffix;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          value *= scale;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        value = type(value, precision);\\n\",\n       \"\\t        var i = value.lastIndexOf(\\\".\\\"), before, after;\\n\",\n       \"\\t        if (i < 0) {\\n\",\n       \"\\t          var j = exponent ? value.lastIndexOf(\\\"e\\\") : -1;\\n\",\n       \"\\t          if (j < 0) before = value, after = \\\"\\\"; else before = value.substring(0, j), after = value.substring(j);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          before = value.substring(0, i);\\n\",\n       \"\\t          after = locale_decimal + value.substring(i + 1);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (!zfill && comma) before = formatGroup(before, Infinity);\\n\",\n       \"\\t        var length = prefix.length + before.length + after.length + (zcomma ? 0 : negative.length), padding = length < width ? new Array(length = width - length + 1).join(fill) : \\\"\\\";\\n\",\n       \"\\t        if (zcomma) before = formatGroup(padding + before, padding.length ? width - after.length : Infinity);\\n\",\n       \"\\t        negative += prefix;\\n\",\n       \"\\t        value = before + after;\\n\",\n       \"\\t        return (align === \\\"<\\\" ? negative + value + padding : align === \\\">\\\" ? padding + negative + value : align === \\\"^\\\" ? padding.substring(0, length >>= 1) + negative + value + padding.substring(length) : negative + (zcomma ? value : padding + value)) + fullSuffix;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_format_re = /(?:([^{])?([<>=^]))?([+\\\\- ])?([$#])?(0)?(\\\\d+)?(,)?(\\\\.-?\\\\d+)?([a-z%])?/i;\\n\",\n       \"\\t  var d3_format_types = d3.map({\\n\",\n       \"\\t    b: function(x) {\\n\",\n       \"\\t      return x.toString(2);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    c: function(x) {\\n\",\n       \"\\t      return String.fromCharCode(x);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    o: function(x) {\\n\",\n       \"\\t      return x.toString(8);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    x: function(x) {\\n\",\n       \"\\t      return x.toString(16);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    X: function(x) {\\n\",\n       \"\\t      return x.toString(16).toUpperCase();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    g: function(x, p) {\\n\",\n       \"\\t      return x.toPrecision(p);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    e: function(x, p) {\\n\",\n       \"\\t      return x.toExponential(p);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    f: function(x, p) {\\n\",\n       \"\\t      return x.toFixed(p);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    r: function(x, p) {\\n\",\n       \"\\t      return (x = d3.round(x, d3_format_precision(x, p))).toFixed(Math.max(0, Math.min(20, d3_format_precision(x * (1 + 1e-15), p))));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  function d3_format_typeDefault(x) {\\n\",\n       \"\\t    return x + \\\"\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_time = d3.time = {}, d3_date = Date;\\n\",\n       \"\\t  function d3_date_utc() {\\n\",\n       \"\\t    this._ = new Date(arguments.length > 1 ? Date.UTC.apply(this, arguments) : arguments[0]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_date_utc.prototype = {\\n\",\n       \"\\t    getDate: function() {\\n\",\n       \"\\t      return this._.getUTCDate();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getDay: function() {\\n\",\n       \"\\t      return this._.getUTCDay();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getFullYear: function() {\\n\",\n       \"\\t      return this._.getUTCFullYear();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getHours: function() {\\n\",\n       \"\\t      return this._.getUTCHours();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getMilliseconds: function() {\\n\",\n       \"\\t      return this._.getUTCMilliseconds();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getMinutes: function() {\\n\",\n       \"\\t      return this._.getUTCMinutes();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getMonth: function() {\\n\",\n       \"\\t      return this._.getUTCMonth();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getSeconds: function() {\\n\",\n       \"\\t      return this._.getUTCSeconds();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getTime: function() {\\n\",\n       \"\\t      return this._.getTime();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getTimezoneOffset: function() {\\n\",\n       \"\\t      return 0;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    valueOf: function() {\\n\",\n       \"\\t      return this._.valueOf();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setDate: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCDate.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setDay: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCDay.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setFullYear: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCFullYear.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setHours: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCHours.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setMilliseconds: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCMilliseconds.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setMinutes: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCMinutes.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setMonth: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCMonth.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setSeconds: function() {\\n\",\n       \"\\t      d3_time_prototype.setUTCSeconds.apply(this._, arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setTime: function() {\\n\",\n       \"\\t      d3_time_prototype.setTime.apply(this._, arguments);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_time_prototype = Date.prototype;\\n\",\n       \"\\t  function d3_time_interval(local, step, number) {\\n\",\n       \"\\t    function round(date) {\\n\",\n       \"\\t      var d0 = local(date), d1 = offset(d0, 1);\\n\",\n       \"\\t      return date - d0 < d1 - date ? d0 : d1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function ceil(date) {\\n\",\n       \"\\t      step(date = local(new d3_date(date - 1)), 1);\\n\",\n       \"\\t      return date;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function offset(date, k) {\\n\",\n       \"\\t      step(date = new d3_date(+date), k);\\n\",\n       \"\\t      return date;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function range(t0, t1, dt) {\\n\",\n       \"\\t      var time = ceil(t0), times = [];\\n\",\n       \"\\t      if (dt > 1) {\\n\",\n       \"\\t        while (time < t1) {\\n\",\n       \"\\t          if (!(number(time) % dt)) times.push(new Date(+time));\\n\",\n       \"\\t          step(time, 1);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        while (time < t1) times.push(new Date(+time)), step(time, 1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return times;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function range_utc(t0, t1, dt) {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        d3_date = d3_date_utc;\\n\",\n       \"\\t        var utc = new d3_date_utc();\\n\",\n       \"\\t        utc._ = t0;\\n\",\n       \"\\t        return range(utc, t1, dt);\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        d3_date = Date;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    local.floor = local;\\n\",\n       \"\\t    local.round = round;\\n\",\n       \"\\t    local.ceil = ceil;\\n\",\n       \"\\t    local.offset = offset;\\n\",\n       \"\\t    local.range = range;\\n\",\n       \"\\t    var utc = local.utc = d3_time_interval_utc(local);\\n\",\n       \"\\t    utc.floor = utc;\\n\",\n       \"\\t    utc.round = d3_time_interval_utc(round);\\n\",\n       \"\\t    utc.ceil = d3_time_interval_utc(ceil);\\n\",\n       \"\\t    utc.offset = d3_time_interval_utc(offset);\\n\",\n       \"\\t    utc.range = range_utc;\\n\",\n       \"\\t    return local;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_interval_utc(method) {\\n\",\n       \"\\t    return function(date, k) {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        d3_date = d3_date_utc;\\n\",\n       \"\\t        var utc = new d3_date_utc();\\n\",\n       \"\\t        utc._ = date;\\n\",\n       \"\\t        return method(utc, k)._;\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        d3_date = Date;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_time.year = d3_time_interval(function(date) {\\n\",\n       \"\\t    date = d3_time.day(date);\\n\",\n       \"\\t    date.setMonth(0, 1);\\n\",\n       \"\\t    return date;\\n\",\n       \"\\t  }, function(date, offset) {\\n\",\n       \"\\t    date.setFullYear(date.getFullYear() + offset);\\n\",\n       \"\\t  }, function(date) {\\n\",\n       \"\\t    return date.getFullYear();\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.years = d3_time.year.range;\\n\",\n       \"\\t  d3_time.years.utc = d3_time.year.utc.range;\\n\",\n       \"\\t  d3_time.day = d3_time_interval(function(date) {\\n\",\n       \"\\t    var day = new d3_date(2e3, 0);\\n\",\n       \"\\t    day.setFullYear(date.getFullYear(), date.getMonth(), date.getDate());\\n\",\n       \"\\t    return day;\\n\",\n       \"\\t  }, function(date, offset) {\\n\",\n       \"\\t    date.setDate(date.getDate() + offset);\\n\",\n       \"\\t  }, function(date) {\\n\",\n       \"\\t    return date.getDate() - 1;\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.days = d3_time.day.range;\\n\",\n       \"\\t  d3_time.days.utc = d3_time.day.utc.range;\\n\",\n       \"\\t  d3_time.dayOfYear = function(date) {\\n\",\n       \"\\t    var year = d3_time.year(date);\\n\",\n       \"\\t    return Math.floor((date - year - (date.getTimezoneOffset() - year.getTimezoneOffset()) * 6e4) / 864e5);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  [ \\\"sunday\\\", \\\"monday\\\", \\\"tuesday\\\", \\\"wednesday\\\", \\\"thursday\\\", \\\"friday\\\", \\\"saturday\\\" ].forEach(function(day, i) {\\n\",\n       \"\\t    i = 7 - i;\\n\",\n       \"\\t    var interval = d3_time[day] = d3_time_interval(function(date) {\\n\",\n       \"\\t      (date = d3_time.day(date)).setDate(date.getDate() - (date.getDay() + i) % 7);\\n\",\n       \"\\t      return date;\\n\",\n       \"\\t    }, function(date, offset) {\\n\",\n       \"\\t      date.setDate(date.getDate() + Math.floor(offset) * 7);\\n\",\n       \"\\t    }, function(date) {\\n\",\n       \"\\t      var day = d3_time.year(date).getDay();\\n\",\n       \"\\t      return Math.floor((d3_time.dayOfYear(date) + (day + i) % 7) / 7) - (day !== i);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    d3_time[day + \\\"s\\\"] = interval.range;\\n\",\n       \"\\t    d3_time[day + \\\"s\\\"].utc = interval.utc.range;\\n\",\n       \"\\t    d3_time[day + \\\"OfYear\\\"] = function(date) {\\n\",\n       \"\\t      var day = d3_time.year(date).getDay();\\n\",\n       \"\\t      return Math.floor((d3_time.dayOfYear(date) + (day + i) % 7) / 7);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.week = d3_time.sunday;\\n\",\n       \"\\t  d3_time.weeks = d3_time.sunday.range;\\n\",\n       \"\\t  d3_time.weeks.utc = d3_time.sunday.utc.range;\\n\",\n       \"\\t  d3_time.weekOfYear = d3_time.sundayOfYear;\\n\",\n       \"\\t  function d3_locale_timeFormat(locale) {\\n\",\n       \"\\t    var locale_dateTime = locale.dateTime, locale_date = locale.date, locale_time = locale.time, locale_periods = locale.periods, locale_days = locale.days, locale_shortDays = locale.shortDays, locale_months = locale.months, locale_shortMonths = locale.shortMonths;\\n\",\n       \"\\t    function d3_time_format(template) {\\n\",\n       \"\\t      var n = template.length;\\n\",\n       \"\\t      function format(date) {\\n\",\n       \"\\t        var string = [], i = -1, j = 0, c, p, f;\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          if (template.charCodeAt(i) === 37) {\\n\",\n       \"\\t            string.push(template.slice(j, i));\\n\",\n       \"\\t            if ((p = d3_time_formatPads[c = template.charAt(++i)]) != null) c = template.charAt(++i);\\n\",\n       \"\\t            if (f = d3_time_formats[c]) c = f(date, p == null ? c === \\\"e\\\" ? \\\" \\\" : \\\"0\\\" : p);\\n\",\n       \"\\t            string.push(c);\\n\",\n       \"\\t            j = i + 1;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        string.push(template.slice(j, i));\\n\",\n       \"\\t        return string.join(\\\"\\\");\\n\",\n       \"\\t      }\\n\",\n       \"\\t      format.parse = function(string) {\\n\",\n       \"\\t        var d = {\\n\",\n       \"\\t          y: 1900,\\n\",\n       \"\\t          m: 0,\\n\",\n       \"\\t          d: 1,\\n\",\n       \"\\t          H: 0,\\n\",\n       \"\\t          M: 0,\\n\",\n       \"\\t          S: 0,\\n\",\n       \"\\t          L: 0,\\n\",\n       \"\\t          Z: null\\n\",\n       \"\\t        }, i = d3_time_parse(d, template, string, 0);\\n\",\n       \"\\t        if (i != string.length) return null;\\n\",\n       \"\\t        if (\\\"p\\\" in d) d.H = d.H % 12 + d.p * 12;\\n\",\n       \"\\t        var localZ = d.Z != null && d3_date !== d3_date_utc, date = new (localZ ? d3_date_utc : d3_date)();\\n\",\n       \"\\t        if (\\\"j\\\" in d) date.setFullYear(d.y, 0, d.j); else if (\\\"W\\\" in d || \\\"U\\\" in d) {\\n\",\n       \"\\t          if (!(\\\"w\\\" in d)) d.w = \\\"W\\\" in d ? 1 : 0;\\n\",\n       \"\\t          date.setFullYear(d.y, 0, 1);\\n\",\n       \"\\t          date.setFullYear(d.y, 0, \\\"W\\\" in d ? (d.w + 6) % 7 + d.W * 7 - (date.getDay() + 5) % 7 : d.w + d.U * 7 - (date.getDay() + 6) % 7);\\n\",\n       \"\\t        } else date.setFullYear(d.y, d.m, d.d);\\n\",\n       \"\\t        date.setHours(d.H + (d.Z / 100 | 0), d.M + d.Z % 100, d.S, d.L);\\n\",\n       \"\\t        return localZ ? date._ : date;\\n\",\n       \"\\t      };\\n\",\n       \"\\t      format.toString = function() {\\n\",\n       \"\\t        return template;\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return format;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parse(date, template, string, j) {\\n\",\n       \"\\t      var c, p, t, i = 0, n = template.length, m = string.length;\\n\",\n       \"\\t      while (i < n) {\\n\",\n       \"\\t        if (j >= m) return -1;\\n\",\n       \"\\t        c = template.charCodeAt(i++);\\n\",\n       \"\\t        if (c === 37) {\\n\",\n       \"\\t          t = template.charAt(i++);\\n\",\n       \"\\t          p = d3_time_parsers[t in d3_time_formatPads ? template.charAt(i++) : t];\\n\",\n       \"\\t          if (!p || (j = p(date, string, j)) < 0) return -1;\\n\",\n       \"\\t        } else if (c != string.charCodeAt(j++)) {\\n\",\n       \"\\t          return -1;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return j;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_time_format.utc = function(template) {\\n\",\n       \"\\t      var local = d3_time_format(template);\\n\",\n       \"\\t      function format(date) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          d3_date = d3_date_utc;\\n\",\n       \"\\t          var utc = new d3_date();\\n\",\n       \"\\t          utc._ = date;\\n\",\n       \"\\t          return local(utc);\\n\",\n       \"\\t        } finally {\\n\",\n       \"\\t          d3_date = Date;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      format.parse = function(string) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          d3_date = d3_date_utc;\\n\",\n       \"\\t          var date = local.parse(string);\\n\",\n       \"\\t          return date && date._;\\n\",\n       \"\\t        } finally {\\n\",\n       \"\\t          d3_date = Date;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t      format.toString = local.toString;\\n\",\n       \"\\t      return format;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3_time_format.multi = d3_time_format.utc.multi = d3_time_formatMulti;\\n\",\n       \"\\t    var d3_time_periodLookup = d3.map(), d3_time_dayRe = d3_time_formatRe(locale_days), d3_time_dayLookup = d3_time_formatLookup(locale_days), d3_time_dayAbbrevRe = d3_time_formatRe(locale_shortDays), d3_time_dayAbbrevLookup = d3_time_formatLookup(locale_shortDays), d3_time_monthRe = d3_time_formatRe(locale_months), d3_time_monthLookup = d3_time_formatLookup(locale_months), d3_time_monthAbbrevRe = d3_time_formatRe(locale_shortMonths), d3_time_monthAbbrevLookup = d3_time_formatLookup(locale_shortMonths);\\n\",\n       \"\\t    locale_periods.forEach(function(p, i) {\\n\",\n       \"\\t      d3_time_periodLookup.set(p.toLowerCase(), i);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    var d3_time_formats = {\\n\",\n       \"\\t      a: function(d) {\\n\",\n       \"\\t        return locale_shortDays[d.getDay()];\\n\",\n       \"\\t      },\\n\",\n       \"\\t      A: function(d) {\\n\",\n       \"\\t        return locale_days[d.getDay()];\\n\",\n       \"\\t      },\\n\",\n       \"\\t      b: function(d) {\\n\",\n       \"\\t        return locale_shortMonths[d.getMonth()];\\n\",\n       \"\\t      },\\n\",\n       \"\\t      B: function(d) {\\n\",\n       \"\\t        return locale_months[d.getMonth()];\\n\",\n       \"\\t      },\\n\",\n       \"\\t      c: d3_time_format(locale_dateTime),\\n\",\n       \"\\t      d: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getDate(), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      e: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getDate(), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      H: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getHours(), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      I: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getHours() % 12 || 12, p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      j: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(1 + d3_time.dayOfYear(d), p, 3);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      L: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getMilliseconds(), p, 3);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      m: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getMonth() + 1, p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      M: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getMinutes(), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      p: function(d) {\\n\",\n       \"\\t        return locale_periods[+(d.getHours() >= 12)];\\n\",\n       \"\\t      },\\n\",\n       \"\\t      S: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getSeconds(), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      U: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d3_time.sundayOfYear(d), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      w: function(d) {\\n\",\n       \"\\t        return d.getDay();\\n\",\n       \"\\t      },\\n\",\n       \"\\t      W: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d3_time.mondayOfYear(d), p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      x: d3_time_format(locale_date),\\n\",\n       \"\\t      X: d3_time_format(locale_time),\\n\",\n       \"\\t      y: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getFullYear() % 100, p, 2);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      Y: function(d, p) {\\n\",\n       \"\\t        return d3_time_formatPad(d.getFullYear() % 1e4, p, 4);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      Z: d3_time_zone,\\n\",\n       \"\\t      \\\"%\\\": function() {\\n\",\n       \"\\t        return \\\"%\\\";\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t    var d3_time_parsers = {\\n\",\n       \"\\t      a: d3_time_parseWeekdayAbbrev,\\n\",\n       \"\\t      A: d3_time_parseWeekday,\\n\",\n       \"\\t      b: d3_time_parseMonthAbbrev,\\n\",\n       \"\\t      B: d3_time_parseMonth,\\n\",\n       \"\\t      c: d3_time_parseLocaleFull,\\n\",\n       \"\\t      d: d3_time_parseDay,\\n\",\n       \"\\t      e: d3_time_parseDay,\\n\",\n       \"\\t      H: d3_time_parseHour24,\\n\",\n       \"\\t      I: d3_time_parseHour24,\\n\",\n       \"\\t      j: d3_time_parseDayOfYear,\\n\",\n       \"\\t      L: d3_time_parseMilliseconds,\\n\",\n       \"\\t      m: d3_time_parseMonthNumber,\\n\",\n       \"\\t      M: d3_time_parseMinutes,\\n\",\n       \"\\t      p: d3_time_parseAmPm,\\n\",\n       \"\\t      S: d3_time_parseSeconds,\\n\",\n       \"\\t      U: d3_time_parseWeekNumberSunday,\\n\",\n       \"\\t      w: d3_time_parseWeekdayNumber,\\n\",\n       \"\\t      W: d3_time_parseWeekNumberMonday,\\n\",\n       \"\\t      x: d3_time_parseLocaleDate,\\n\",\n       \"\\t      X: d3_time_parseLocaleTime,\\n\",\n       \"\\t      y: d3_time_parseYear,\\n\",\n       \"\\t      Y: d3_time_parseFullYear,\\n\",\n       \"\\t      Z: d3_time_parseZone,\\n\",\n       \"\\t      \\\"%\\\": d3_time_parseLiteralPercent\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function d3_time_parseWeekdayAbbrev(date, string, i) {\\n\",\n       \"\\t      d3_time_dayAbbrevRe.lastIndex = 0;\\n\",\n       \"\\t      var n = d3_time_dayAbbrevRe.exec(string.slice(i));\\n\",\n       \"\\t      return n ? (date.w = d3_time_dayAbbrevLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseWeekday(date, string, i) {\\n\",\n       \"\\t      d3_time_dayRe.lastIndex = 0;\\n\",\n       \"\\t      var n = d3_time_dayRe.exec(string.slice(i));\\n\",\n       \"\\t      return n ? (date.w = d3_time_dayLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseMonthAbbrev(date, string, i) {\\n\",\n       \"\\t      d3_time_monthAbbrevRe.lastIndex = 0;\\n\",\n       \"\\t      var n = d3_time_monthAbbrevRe.exec(string.slice(i));\\n\",\n       \"\\t      return n ? (date.m = d3_time_monthAbbrevLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseMonth(date, string, i) {\\n\",\n       \"\\t      d3_time_monthRe.lastIndex = 0;\\n\",\n       \"\\t      var n = d3_time_monthRe.exec(string.slice(i));\\n\",\n       \"\\t      return n ? (date.m = d3_time_monthLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseLocaleFull(date, string, i) {\\n\",\n       \"\\t      return d3_time_parse(date, d3_time_formats.c.toString(), string, i);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseLocaleDate(date, string, i) {\\n\",\n       \"\\t      return d3_time_parse(date, d3_time_formats.x.toString(), string, i);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseLocaleTime(date, string, i) {\\n\",\n       \"\\t      return d3_time_parse(date, d3_time_formats.X.toString(), string, i);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function d3_time_parseAmPm(date, string, i) {\\n\",\n       \"\\t      var n = d3_time_periodLookup.get(string.slice(i, i += 2).toLowerCase());\\n\",\n       \"\\t      return n == null ? -1 : (date.p = n, i);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_time_format;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_time_formatPads = {\\n\",\n       \"\\t    \\\"-\\\": \\\"\\\",\\n\",\n       \"\\t    _: \\\" \\\",\\n\",\n       \"\\t    \\\"0\\\": \\\"0\\\"\\n\",\n       \"\\t  }, d3_time_numberRe = /^\\\\s*\\\\d+/, d3_time_percentRe = /^%/;\\n\",\n       \"\\t  function d3_time_formatPad(value, fill, width) {\\n\",\n       \"\\t    var sign = value < 0 ? \\\"-\\\" : \\\"\\\", string = (sign ? -value : value) + \\\"\\\", length = string.length;\\n\",\n       \"\\t    return sign + (length < width ? new Array(width - length + 1).join(fill) + string : string);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_formatRe(names) {\\n\",\n       \"\\t    return new RegExp(\\\"^(?:\\\" + names.map(d3.requote).join(\\\"|\\\") + \\\")\\\", \\\"i\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_formatLookup(names) {\\n\",\n       \"\\t    var map = new d3_Map(), i = -1, n = names.length;\\n\",\n       \"\\t    while (++i < n) map.set(names[i].toLowerCase(), i);\\n\",\n       \"\\t    return map;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseWeekdayNumber(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 1));\\n\",\n       \"\\t    return n ? (date.w = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseWeekNumberSunday(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i));\\n\",\n       \"\\t    return n ? (date.U = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseWeekNumberMonday(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i));\\n\",\n       \"\\t    return n ? (date.W = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseFullYear(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 4));\\n\",\n       \"\\t    return n ? (date.y = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseYear(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 2));\\n\",\n       \"\\t    return n ? (date.y = d3_time_expandYear(+n[0]), i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseZone(date, string, i) {\\n\",\n       \"\\t    return /^[+-]\\\\d{4}$/.test(string = string.slice(i, i + 5)) ? (date.Z = -string, \\n\",\n       \"\\t    i + 5) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_expandYear(d) {\\n\",\n       \"\\t    return d + (d > 68 ? 1900 : 2e3);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseMonthNumber(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 2));\\n\",\n       \"\\t    return n ? (date.m = n[0] - 1, i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseDay(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 2));\\n\",\n       \"\\t    return n ? (date.d = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseDayOfYear(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 3));\\n\",\n       \"\\t    return n ? (date.j = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseHour24(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 2));\\n\",\n       \"\\t    return n ? (date.H = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseMinutes(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 2));\\n\",\n       \"\\t    return n ? (date.M = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseSeconds(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 2));\\n\",\n       \"\\t    return n ? (date.S = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseMilliseconds(date, string, i) {\\n\",\n       \"\\t    d3_time_numberRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_numberRe.exec(string.slice(i, i + 3));\\n\",\n       \"\\t    return n ? (date.L = +n[0], i + n[0].length) : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_zone(d) {\\n\",\n       \"\\t    var z = d.getTimezoneOffset(), zs = z > 0 ? \\\"-\\\" : \\\"+\\\", zh = abs(z) / 60 | 0, zm = abs(z) % 60;\\n\",\n       \"\\t    return zs + d3_time_formatPad(zh, \\\"0\\\", 2) + d3_time_formatPad(zm, \\\"0\\\", 2);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_parseLiteralPercent(date, string, i) {\\n\",\n       \"\\t    d3_time_percentRe.lastIndex = 0;\\n\",\n       \"\\t    var n = d3_time_percentRe.exec(string.slice(i, i + 1));\\n\",\n       \"\\t    return n ? i + n[0].length : -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_formatMulti(formats) {\\n\",\n       \"\\t    var n = formats.length, i = -1;\\n\",\n       \"\\t    while (++i < n) formats[i][0] = this(formats[i][0]);\\n\",\n       \"\\t    return function(date) {\\n\",\n       \"\\t      var i = 0, f = formats[i];\\n\",\n       \"\\t      while (!f[1](date)) f = formats[++i];\\n\",\n       \"\\t      return f[0](date);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.locale = function(locale) {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      numberFormat: d3_locale_numberFormat(locale),\\n\",\n       \"\\t      timeFormat: d3_locale_timeFormat(locale)\\n\",\n       \"\\t    };\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_locale_enUS = d3.locale({\\n\",\n       \"\\t    decimal: \\\".\\\",\\n\",\n       \"\\t    thousands: \\\",\\\",\\n\",\n       \"\\t    grouping: [ 3 ],\\n\",\n       \"\\t    currency: [ \\\"$\\\", \\\"\\\" ],\\n\",\n       \"\\t    dateTime: \\\"%a %b %e %X %Y\\\",\\n\",\n       \"\\t    date: \\\"%m/%d/%Y\\\",\\n\",\n       \"\\t    time: \\\"%H:%M:%S\\\",\\n\",\n       \"\\t    periods: [ \\\"AM\\\", \\\"PM\\\" ],\\n\",\n       \"\\t    days: [ \\\"Sunday\\\", \\\"Monday\\\", \\\"Tuesday\\\", \\\"Wednesday\\\", \\\"Thursday\\\", \\\"Friday\\\", \\\"Saturday\\\" ],\\n\",\n       \"\\t    shortDays: [ \\\"Sun\\\", \\\"Mon\\\", \\\"Tue\\\", \\\"Wed\\\", \\\"Thu\\\", \\\"Fri\\\", \\\"Sat\\\" ],\\n\",\n       \"\\t    months: [ \\\"January\\\", \\\"February\\\", \\\"March\\\", \\\"April\\\", \\\"May\\\", \\\"June\\\", \\\"July\\\", \\\"August\\\", \\\"September\\\", \\\"October\\\", \\\"November\\\", \\\"December\\\" ],\\n\",\n       \"\\t    shortMonths: [ \\\"Jan\\\", \\\"Feb\\\", \\\"Mar\\\", \\\"Apr\\\", \\\"May\\\", \\\"Jun\\\", \\\"Jul\\\", \\\"Aug\\\", \\\"Sep\\\", \\\"Oct\\\", \\\"Nov\\\", \\\"Dec\\\" ]\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3.format = d3_locale_enUS.numberFormat;\\n\",\n       \"\\t  d3.geo = {};\\n\",\n       \"\\t  function d3_adder() {}\\n\",\n       \"\\t  d3_adder.prototype = {\\n\",\n       \"\\t    s: 0,\\n\",\n       \"\\t    t: 0,\\n\",\n       \"\\t    add: function(y) {\\n\",\n       \"\\t      d3_adderSum(y, this.t, d3_adderTemp);\\n\",\n       \"\\t      d3_adderSum(d3_adderTemp.s, this.s, this);\\n\",\n       \"\\t      if (this.s) this.t += d3_adderTemp.t; else this.s = d3_adderTemp.t;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    reset: function() {\\n\",\n       \"\\t      this.s = this.t = 0;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    valueOf: function() {\\n\",\n       \"\\t      return this.s;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_adderTemp = new d3_adder();\\n\",\n       \"\\t  function d3_adderSum(a, b, o) {\\n\",\n       \"\\t    var x = o.s = a + b, bv = x - a, av = x - bv;\\n\",\n       \"\\t    o.t = a - av + (b - bv);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.stream = function(object, listener) {\\n\",\n       \"\\t    if (object && d3_geo_streamObjectType.hasOwnProperty(object.type)) {\\n\",\n       \"\\t      d3_geo_streamObjectType[object.type](object, listener);\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      d3_geo_streamGeometry(object, listener);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_streamGeometry(geometry, listener) {\\n\",\n       \"\\t    if (geometry && d3_geo_streamGeometryType.hasOwnProperty(geometry.type)) {\\n\",\n       \"\\t      d3_geo_streamGeometryType[geometry.type](geometry, listener);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geo_streamObjectType = {\\n\",\n       \"\\t    Feature: function(feature, listener) {\\n\",\n       \"\\t      d3_geo_streamGeometry(feature.geometry, listener);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    FeatureCollection: function(object, listener) {\\n\",\n       \"\\t      var features = object.features, i = -1, n = features.length;\\n\",\n       \"\\t      while (++i < n) d3_geo_streamGeometry(features[i].geometry, listener);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geo_streamGeometryType = {\\n\",\n       \"\\t    Sphere: function(object, listener) {\\n\",\n       \"\\t      listener.sphere();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    Point: function(object, listener) {\\n\",\n       \"\\t      object = object.coordinates;\\n\",\n       \"\\t      listener.point(object[0], object[1], object[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    MultiPoint: function(object, listener) {\\n\",\n       \"\\t      var coordinates = object.coordinates, i = -1, n = coordinates.length;\\n\",\n       \"\\t      while (++i < n) object = coordinates[i], listener.point(object[0], object[1], object[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    LineString: function(object, listener) {\\n\",\n       \"\\t      d3_geo_streamLine(object.coordinates, listener, 0);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    MultiLineString: function(object, listener) {\\n\",\n       \"\\t      var coordinates = object.coordinates, i = -1, n = coordinates.length;\\n\",\n       \"\\t      while (++i < n) d3_geo_streamLine(coordinates[i], listener, 0);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    Polygon: function(object, listener) {\\n\",\n       \"\\t      d3_geo_streamPolygon(object.coordinates, listener);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    MultiPolygon: function(object, listener) {\\n\",\n       \"\\t      var coordinates = object.coordinates, i = -1, n = coordinates.length;\\n\",\n       \"\\t      while (++i < n) d3_geo_streamPolygon(coordinates[i], listener);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    GeometryCollection: function(object, listener) {\\n\",\n       \"\\t      var geometries = object.geometries, i = -1, n = geometries.length;\\n\",\n       \"\\t      while (++i < n) d3_geo_streamGeometry(geometries[i], listener);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_streamLine(coordinates, listener, closed) {\\n\",\n       \"\\t    var i = -1, n = coordinates.length - closed, coordinate;\\n\",\n       \"\\t    listener.lineStart();\\n\",\n       \"\\t    while (++i < n) coordinate = coordinates[i], listener.point(coordinate[0], coordinate[1], coordinate[2]);\\n\",\n       \"\\t    listener.lineEnd();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_streamPolygon(coordinates, listener) {\\n\",\n       \"\\t    var i = -1, n = coordinates.length;\\n\",\n       \"\\t    listener.polygonStart();\\n\",\n       \"\\t    while (++i < n) d3_geo_streamLine(coordinates[i], listener, 1);\\n\",\n       \"\\t    listener.polygonEnd();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.area = function(object) {\\n\",\n       \"\\t    d3_geo_areaSum = 0;\\n\",\n       \"\\t    d3.geo.stream(object, d3_geo_area);\\n\",\n       \"\\t    return d3_geo_areaSum;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geo_areaSum, d3_geo_areaRingSum = new d3_adder();\\n\",\n       \"\\t  var d3_geo_area = {\\n\",\n       \"\\t    sphere: function() {\\n\",\n       \"\\t      d3_geo_areaSum += 4 * π;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    point: d3_noop,\\n\",\n       \"\\t    lineStart: d3_noop,\\n\",\n       \"\\t    lineEnd: d3_noop,\\n\",\n       \"\\t    polygonStart: function() {\\n\",\n       \"\\t      d3_geo_areaRingSum.reset();\\n\",\n       \"\\t      d3_geo_area.lineStart = d3_geo_areaRingStart;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    polygonEnd: function() {\\n\",\n       \"\\t      var area = 2 * d3_geo_areaRingSum;\\n\",\n       \"\\t      d3_geo_areaSum += area < 0 ? 4 * π + area : area;\\n\",\n       \"\\t      d3_geo_area.lineStart = d3_geo_area.lineEnd = d3_geo_area.point = d3_noop;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_areaRingStart() {\\n\",\n       \"\\t    var λ00, φ00, λ0, cosφ0, sinφ0;\\n\",\n       \"\\t    d3_geo_area.point = function(λ, φ) {\\n\",\n       \"\\t      d3_geo_area.point = nextPoint;\\n\",\n       \"\\t      λ0 = (λ00 = λ) * d3_radians, cosφ0 = Math.cos(φ = (φ00 = φ) * d3_radians / 2 + π / 4), \\n\",\n       \"\\t      sinφ0 = Math.sin(φ);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(λ, φ) {\\n\",\n       \"\\t      λ *= d3_radians;\\n\",\n       \"\\t      φ = φ * d3_radians / 2 + π / 4;\\n\",\n       \"\\t      var dλ = λ - λ0, sdλ = dλ >= 0 ? 1 : -1, adλ = sdλ * dλ, cosφ = Math.cos(φ), sinφ = Math.sin(φ), k = sinφ0 * sinφ, u = cosφ0 * cosφ + k * Math.cos(adλ), v = k * sdλ * Math.sin(adλ);\\n\",\n       \"\\t      d3_geo_areaRingSum.add(Math.atan2(v, u));\\n\",\n       \"\\t      λ0 = λ, cosφ0 = cosφ, sinφ0 = sinφ;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_geo_area.lineEnd = function() {\\n\",\n       \"\\t      nextPoint(λ00, φ00);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_cartesian(spherical) {\\n\",\n       \"\\t    var λ = spherical[0], φ = spherical[1], cosφ = Math.cos(φ);\\n\",\n       \"\\t    return [ cosφ * Math.cos(λ), cosφ * Math.sin(λ), Math.sin(φ) ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_cartesianDot(a, b) {\\n\",\n       \"\\t    return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_cartesianCross(a, b) {\\n\",\n       \"\\t    return [ a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0] ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_cartesianAdd(a, b) {\\n\",\n       \"\\t    a[0] += b[0];\\n\",\n       \"\\t    a[1] += b[1];\\n\",\n       \"\\t    a[2] += b[2];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_cartesianScale(vector, k) {\\n\",\n       \"\\t    return [ vector[0] * k, vector[1] * k, vector[2] * k ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_cartesianNormalize(d) {\\n\",\n       \"\\t    var l = Math.sqrt(d[0] * d[0] + d[1] * d[1] + d[2] * d[2]);\\n\",\n       \"\\t    d[0] /= l;\\n\",\n       \"\\t    d[1] /= l;\\n\",\n       \"\\t    d[2] /= l;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_spherical(cartesian) {\\n\",\n       \"\\t    return [ Math.atan2(cartesian[1], cartesian[0]), d3_asin(cartesian[2]) ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_sphericalEqual(a, b) {\\n\",\n       \"\\t    return abs(a[0] - b[0]) < ε && abs(a[1] - b[1]) < ε;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.bounds = function() {\\n\",\n       \"\\t    var λ0, φ0, λ1, φ1, λ_, λ__, φ__, p0, dλSum, ranges, range;\\n\",\n       \"\\t    var bound = {\\n\",\n       \"\\t      point: point,\\n\",\n       \"\\t      lineStart: lineStart,\\n\",\n       \"\\t      lineEnd: lineEnd,\\n\",\n       \"\\t      polygonStart: function() {\\n\",\n       \"\\t        bound.point = ringPoint;\\n\",\n       \"\\t        bound.lineStart = ringStart;\\n\",\n       \"\\t        bound.lineEnd = ringEnd;\\n\",\n       \"\\t        dλSum = 0;\\n\",\n       \"\\t        d3_geo_area.polygonStart();\\n\",\n       \"\\t      },\\n\",\n       \"\\t      polygonEnd: function() {\\n\",\n       \"\\t        d3_geo_area.polygonEnd();\\n\",\n       \"\\t        bound.point = point;\\n\",\n       \"\\t        bound.lineStart = lineStart;\\n\",\n       \"\\t        bound.lineEnd = lineEnd;\\n\",\n       \"\\t        if (d3_geo_areaRingSum < 0) λ0 = -(λ1 = 180), φ0 = -(φ1 = 90); else if (dλSum > ε) φ1 = 90; else if (dλSum < -ε) φ0 = -90;\\n\",\n       \"\\t        range[0] = λ0, range[1] = λ1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function point(λ, φ) {\\n\",\n       \"\\t      ranges.push(range = [ λ0 = λ, λ1 = λ ]);\\n\",\n       \"\\t      if (φ < φ0) φ0 = φ;\\n\",\n       \"\\t      if (φ > φ1) φ1 = φ;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function linePoint(λ, φ) {\\n\",\n       \"\\t      var p = d3_geo_cartesian([ λ * d3_radians, φ * d3_radians ]);\\n\",\n       \"\\t      if (p0) {\\n\",\n       \"\\t        var normal = d3_geo_cartesianCross(p0, p), equatorial = [ normal[1], -normal[0], 0 ], inflection = d3_geo_cartesianCross(equatorial, normal);\\n\",\n       \"\\t        d3_geo_cartesianNormalize(inflection);\\n\",\n       \"\\t        inflection = d3_geo_spherical(inflection);\\n\",\n       \"\\t        var dλ = λ - λ_, s = dλ > 0 ? 1 : -1, λi = inflection[0] * d3_degrees * s, antimeridian = abs(dλ) > 180;\\n\",\n       \"\\t        if (antimeridian ^ (s * λ_ < λi && λi < s * λ)) {\\n\",\n       \"\\t          var φi = inflection[1] * d3_degrees;\\n\",\n       \"\\t          if (φi > φ1) φ1 = φi;\\n\",\n       \"\\t        } else if (λi = (λi + 360) % 360 - 180, antimeridian ^ (s * λ_ < λi && λi < s * λ)) {\\n\",\n       \"\\t          var φi = -inflection[1] * d3_degrees;\\n\",\n       \"\\t          if (φi < φ0) φ0 = φi;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (φ < φ0) φ0 = φ;\\n\",\n       \"\\t          if (φ > φ1) φ1 = φ;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (antimeridian) {\\n\",\n       \"\\t          if (λ < λ_) {\\n\",\n       \"\\t            if (angle(λ0, λ) > angle(λ0, λ1)) λ1 = λ;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            if (angle(λ, λ1) > angle(λ0, λ1)) λ0 = λ;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (λ1 >= λ0) {\\n\",\n       \"\\t            if (λ < λ0) λ0 = λ;\\n\",\n       \"\\t            if (λ > λ1) λ1 = λ;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            if (λ > λ_) {\\n\",\n       \"\\t              if (angle(λ0, λ) > angle(λ0, λ1)) λ1 = λ;\\n\",\n       \"\\t            } else {\\n\",\n       \"\\t              if (angle(λ, λ1) > angle(λ0, λ1)) λ0 = λ;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        point(λ, φ);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      p0 = p, λ_ = λ;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lineStart() {\\n\",\n       \"\\t      bound.point = linePoint;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lineEnd() {\\n\",\n       \"\\t      range[0] = λ0, range[1] = λ1;\\n\",\n       \"\\t      bound.point = point;\\n\",\n       \"\\t      p0 = null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function ringPoint(λ, φ) {\\n\",\n       \"\\t      if (p0) {\\n\",\n       \"\\t        var dλ = λ - λ_;\\n\",\n       \"\\t        dλSum += abs(dλ) > 180 ? dλ + (dλ > 0 ? 360 : -360) : dλ;\\n\",\n       \"\\t      } else λ__ = λ, φ__ = φ;\\n\",\n       \"\\t      d3_geo_area.point(λ, φ);\\n\",\n       \"\\t      linePoint(λ, φ);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function ringStart() {\\n\",\n       \"\\t      d3_geo_area.lineStart();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function ringEnd() {\\n\",\n       \"\\t      ringPoint(λ__, φ__);\\n\",\n       \"\\t      d3_geo_area.lineEnd();\\n\",\n       \"\\t      if (abs(dλSum) > ε) λ0 = -(λ1 = 180);\\n\",\n       \"\\t      range[0] = λ0, range[1] = λ1;\\n\",\n       \"\\t      p0 = null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function angle(λ0, λ1) {\\n\",\n       \"\\t      return (λ1 -= λ0) < 0 ? λ1 + 360 : λ1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function compareRanges(a, b) {\\n\",\n       \"\\t      return a[0] - b[0];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function withinRange(x, range) {\\n\",\n       \"\\t      return range[0] <= range[1] ? range[0] <= x && x <= range[1] : x < range[0] || range[1] < x;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return function(feature) {\\n\",\n       \"\\t      φ1 = λ1 = -(λ0 = φ0 = Infinity);\\n\",\n       \"\\t      ranges = [];\\n\",\n       \"\\t      d3.geo.stream(feature, bound);\\n\",\n       \"\\t      var n = ranges.length;\\n\",\n       \"\\t      if (n) {\\n\",\n       \"\\t        ranges.sort(compareRanges);\\n\",\n       \"\\t        for (var i = 1, a = ranges[0], b, merged = [ a ]; i < n; ++i) {\\n\",\n       \"\\t          b = ranges[i];\\n\",\n       \"\\t          if (withinRange(b[0], a) || withinRange(b[1], a)) {\\n\",\n       \"\\t            if (angle(a[0], b[1]) > angle(a[0], a[1])) a[1] = b[1];\\n\",\n       \"\\t            if (angle(b[0], a[1]) > angle(a[0], a[1])) a[0] = b[0];\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            merged.push(a = b);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var best = -Infinity, dλ;\\n\",\n       \"\\t        for (var n = merged.length - 1, i = 0, a = merged[n], b; i <= n; a = b, ++i) {\\n\",\n       \"\\t          b = merged[i];\\n\",\n       \"\\t          if ((dλ = angle(a[1], b[0])) > best) best = dλ, λ0 = b[0], λ1 = a[1];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      ranges = range = null;\\n\",\n       \"\\t      return λ0 === Infinity || φ0 === Infinity ? [ [ NaN, NaN ], [ NaN, NaN ] ] : [ [ λ0, φ0 ], [ λ1, φ1 ] ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }();\\n\",\n       \"\\t  d3.geo.centroid = function(object) {\\n\",\n       \"\\t    d3_geo_centroidW0 = d3_geo_centroidW1 = d3_geo_centroidX0 = d3_geo_centroidY0 = d3_geo_centroidZ0 = d3_geo_centroidX1 = d3_geo_centroidY1 = d3_geo_centroidZ1 = d3_geo_centroidX2 = d3_geo_centroidY2 = d3_geo_centroidZ2 = 0;\\n\",\n       \"\\t    d3.geo.stream(object, d3_geo_centroid);\\n\",\n       \"\\t    var x = d3_geo_centroidX2, y = d3_geo_centroidY2, z = d3_geo_centroidZ2, m = x * x + y * y + z * z;\\n\",\n       \"\\t    if (m < ε2) {\\n\",\n       \"\\t      x = d3_geo_centroidX1, y = d3_geo_centroidY1, z = d3_geo_centroidZ1;\\n\",\n       \"\\t      if (d3_geo_centroidW1 < ε) x = d3_geo_centroidX0, y = d3_geo_centroidY0, z = d3_geo_centroidZ0;\\n\",\n       \"\\t      m = x * x + y * y + z * z;\\n\",\n       \"\\t      if (m < ε2) return [ NaN, NaN ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return [ Math.atan2(y, x) * d3_degrees, d3_asin(z / Math.sqrt(m)) * d3_degrees ];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geo_centroidW0, d3_geo_centroidW1, d3_geo_centroidX0, d3_geo_centroidY0, d3_geo_centroidZ0, d3_geo_centroidX1, d3_geo_centroidY1, d3_geo_centroidZ1, d3_geo_centroidX2, d3_geo_centroidY2, d3_geo_centroidZ2;\\n\",\n       \"\\t  var d3_geo_centroid = {\\n\",\n       \"\\t    sphere: d3_noop,\\n\",\n       \"\\t    point: d3_geo_centroidPoint,\\n\",\n       \"\\t    lineStart: d3_geo_centroidLineStart,\\n\",\n       \"\\t    lineEnd: d3_geo_centroidLineEnd,\\n\",\n       \"\\t    polygonStart: function() {\\n\",\n       \"\\t      d3_geo_centroid.lineStart = d3_geo_centroidRingStart;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    polygonEnd: function() {\\n\",\n       \"\\t      d3_geo_centroid.lineStart = d3_geo_centroidLineStart;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_centroidPoint(λ, φ) {\\n\",\n       \"\\t    λ *= d3_radians;\\n\",\n       \"\\t    var cosφ = Math.cos(φ *= d3_radians);\\n\",\n       \"\\t    d3_geo_centroidPointXYZ(cosφ * Math.cos(λ), cosφ * Math.sin(λ), Math.sin(φ));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_centroidPointXYZ(x, y, z) {\\n\",\n       \"\\t    ++d3_geo_centroidW0;\\n\",\n       \"\\t    d3_geo_centroidX0 += (x - d3_geo_centroidX0) / d3_geo_centroidW0;\\n\",\n       \"\\t    d3_geo_centroidY0 += (y - d3_geo_centroidY0) / d3_geo_centroidW0;\\n\",\n       \"\\t    d3_geo_centroidZ0 += (z - d3_geo_centroidZ0) / d3_geo_centroidW0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_centroidLineStart() {\\n\",\n       \"\\t    var x0, y0, z0;\\n\",\n       \"\\t    d3_geo_centroid.point = function(λ, φ) {\\n\",\n       \"\\t      λ *= d3_radians;\\n\",\n       \"\\t      var cosφ = Math.cos(φ *= d3_radians);\\n\",\n       \"\\t      x0 = cosφ * Math.cos(λ);\\n\",\n       \"\\t      y0 = cosφ * Math.sin(λ);\\n\",\n       \"\\t      z0 = Math.sin(φ);\\n\",\n       \"\\t      d3_geo_centroid.point = nextPoint;\\n\",\n       \"\\t      d3_geo_centroidPointXYZ(x0, y0, z0);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(λ, φ) {\\n\",\n       \"\\t      λ *= d3_radians;\\n\",\n       \"\\t      var cosφ = Math.cos(φ *= d3_radians), x = cosφ * Math.cos(λ), y = cosφ * Math.sin(λ), z = Math.sin(φ), w = Math.atan2(Math.sqrt((w = y0 * z - z0 * y) * w + (w = z0 * x - x0 * z) * w + (w = x0 * y - y0 * x) * w), x0 * x + y0 * y + z0 * z);\\n\",\n       \"\\t      d3_geo_centroidW1 += w;\\n\",\n       \"\\t      d3_geo_centroidX1 += w * (x0 + (x0 = x));\\n\",\n       \"\\t      d3_geo_centroidY1 += w * (y0 + (y0 = y));\\n\",\n       \"\\t      d3_geo_centroidZ1 += w * (z0 + (z0 = z));\\n\",\n       \"\\t      d3_geo_centroidPointXYZ(x0, y0, z0);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_centroidLineEnd() {\\n\",\n       \"\\t    d3_geo_centroid.point = d3_geo_centroidPoint;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_centroidRingStart() {\\n\",\n       \"\\t    var λ00, φ00, x0, y0, z0;\\n\",\n       \"\\t    d3_geo_centroid.point = function(λ, φ) {\\n\",\n       \"\\t      λ00 = λ, φ00 = φ;\\n\",\n       \"\\t      d3_geo_centroid.point = nextPoint;\\n\",\n       \"\\t      λ *= d3_radians;\\n\",\n       \"\\t      var cosφ = Math.cos(φ *= d3_radians);\\n\",\n       \"\\t      x0 = cosφ * Math.cos(λ);\\n\",\n       \"\\t      y0 = cosφ * Math.sin(λ);\\n\",\n       \"\\t      z0 = Math.sin(φ);\\n\",\n       \"\\t      d3_geo_centroidPointXYZ(x0, y0, z0);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3_geo_centroid.lineEnd = function() {\\n\",\n       \"\\t      nextPoint(λ00, φ00);\\n\",\n       \"\\t      d3_geo_centroid.lineEnd = d3_geo_centroidLineEnd;\\n\",\n       \"\\t      d3_geo_centroid.point = d3_geo_centroidPoint;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(λ, φ) {\\n\",\n       \"\\t      λ *= d3_radians;\\n\",\n       \"\\t      var cosφ = Math.cos(φ *= d3_radians), x = cosφ * Math.cos(λ), y = cosφ * Math.sin(λ), z = Math.sin(φ), cx = y0 * z - z0 * y, cy = z0 * x - x0 * z, cz = x0 * y - y0 * x, m = Math.sqrt(cx * cx + cy * cy + cz * cz), u = x0 * x + y0 * y + z0 * z, v = m && -d3_acos(u) / m, w = Math.atan2(m, u);\\n\",\n       \"\\t      d3_geo_centroidX2 += v * cx;\\n\",\n       \"\\t      d3_geo_centroidY2 += v * cy;\\n\",\n       \"\\t      d3_geo_centroidZ2 += v * cz;\\n\",\n       \"\\t      d3_geo_centroidW1 += w;\\n\",\n       \"\\t      d3_geo_centroidX1 += w * (x0 + (x0 = x));\\n\",\n       \"\\t      d3_geo_centroidY1 += w * (y0 + (y0 = y));\\n\",\n       \"\\t      d3_geo_centroidZ1 += w * (z0 + (z0 = z));\\n\",\n       \"\\t      d3_geo_centroidPointXYZ(x0, y0, z0);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_compose(a, b) {\\n\",\n       \"\\t    function compose(x, y) {\\n\",\n       \"\\t      return x = a(x, y), b(x[0], x[1]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (a.invert && b.invert) compose.invert = function(x, y) {\\n\",\n       \"\\t      return x = b.invert(x, y), x && a.invert(x[0], x[1]);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return compose;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_true() {\\n\",\n       \"\\t    return true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipPolygon(segments, compare, clipStartInside, interpolate, listener) {\\n\",\n       \"\\t    var subject = [], clip = [];\\n\",\n       \"\\t    segments.forEach(function(segment) {\\n\",\n       \"\\t      if ((n = segment.length - 1) <= 0) return;\\n\",\n       \"\\t      var n, p0 = segment[0], p1 = segment[n];\\n\",\n       \"\\t      if (d3_geo_sphericalEqual(p0, p1)) {\\n\",\n       \"\\t        listener.lineStart();\\n\",\n       \"\\t        for (var i = 0; i < n; ++i) listener.point((p0 = segment[i])[0], p0[1]);\\n\",\n       \"\\t        listener.lineEnd();\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var a = new d3_geo_clipPolygonIntersection(p0, segment, null, true), b = new d3_geo_clipPolygonIntersection(p0, null, a, false);\\n\",\n       \"\\t      a.o = b;\\n\",\n       \"\\t      subject.push(a);\\n\",\n       \"\\t      clip.push(b);\\n\",\n       \"\\t      a = new d3_geo_clipPolygonIntersection(p1, segment, null, false);\\n\",\n       \"\\t      b = new d3_geo_clipPolygonIntersection(p1, null, a, true);\\n\",\n       \"\\t      a.o = b;\\n\",\n       \"\\t      subject.push(a);\\n\",\n       \"\\t      clip.push(b);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    clip.sort(compare);\\n\",\n       \"\\t    d3_geo_clipPolygonLinkCircular(subject);\\n\",\n       \"\\t    d3_geo_clipPolygonLinkCircular(clip);\\n\",\n       \"\\t    if (!subject.length) return;\\n\",\n       \"\\t    for (var i = 0, entry = clipStartInside, n = clip.length; i < n; ++i) {\\n\",\n       \"\\t      clip[i].e = entry = !entry;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var start = subject[0], points, point;\\n\",\n       \"\\t    while (1) {\\n\",\n       \"\\t      var current = start, isSubject = true;\\n\",\n       \"\\t      while (current.v) if ((current = current.n) === start) return;\\n\",\n       \"\\t      points = current.z;\\n\",\n       \"\\t      listener.lineStart();\\n\",\n       \"\\t      do {\\n\",\n       \"\\t        current.v = current.o.v = true;\\n\",\n       \"\\t        if (current.e) {\\n\",\n       \"\\t          if (isSubject) {\\n\",\n       \"\\t            for (var i = 0, n = points.length; i < n; ++i) listener.point((point = points[i])[0], point[1]);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            interpolate(current.x, current.n.x, 1, listener);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          current = current.n;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (isSubject) {\\n\",\n       \"\\t            points = current.p.z;\\n\",\n       \"\\t            for (var i = points.length - 1; i >= 0; --i) listener.point((point = points[i])[0], point[1]);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            interpolate(current.x, current.p.x, -1, listener);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          current = current.p;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        current = current.o;\\n\",\n       \"\\t        points = current.z;\\n\",\n       \"\\t        isSubject = !isSubject;\\n\",\n       \"\\t      } while (!current.v);\\n\",\n       \"\\t      listener.lineEnd();\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipPolygonLinkCircular(array) {\\n\",\n       \"\\t    if (!(n = array.length)) return;\\n\",\n       \"\\t    var n, i = 0, a = array[0], b;\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      a.n = b = array[i];\\n\",\n       \"\\t      b.p = a;\\n\",\n       \"\\t      a = b;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    a.n = b = array[0];\\n\",\n       \"\\t    b.p = a;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipPolygonIntersection(point, points, other, entry) {\\n\",\n       \"\\t    this.x = point;\\n\",\n       \"\\t    this.z = points;\\n\",\n       \"\\t    this.o = other;\\n\",\n       \"\\t    this.e = entry;\\n\",\n       \"\\t    this.v = false;\\n\",\n       \"\\t    this.n = this.p = null;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clip(pointVisible, clipLine, interpolate, clipStart) {\\n\",\n       \"\\t    return function(rotate, listener) {\\n\",\n       \"\\t      var line = clipLine(listener), rotatedClipStart = rotate.invert(clipStart[0], clipStart[1]);\\n\",\n       \"\\t      var clip = {\\n\",\n       \"\\t        point: point,\\n\",\n       \"\\t        lineStart: lineStart,\\n\",\n       \"\\t        lineEnd: lineEnd,\\n\",\n       \"\\t        polygonStart: function() {\\n\",\n       \"\\t          clip.point = pointRing;\\n\",\n       \"\\t          clip.lineStart = ringStart;\\n\",\n       \"\\t          clip.lineEnd = ringEnd;\\n\",\n       \"\\t          segments = [];\\n\",\n       \"\\t          polygon = [];\\n\",\n       \"\\t        },\\n\",\n       \"\\t        polygonEnd: function() {\\n\",\n       \"\\t          clip.point = point;\\n\",\n       \"\\t          clip.lineStart = lineStart;\\n\",\n       \"\\t          clip.lineEnd = lineEnd;\\n\",\n       \"\\t          segments = d3.merge(segments);\\n\",\n       \"\\t          var clipStartInside = d3_geo_pointInPolygon(rotatedClipStart, polygon);\\n\",\n       \"\\t          if (segments.length) {\\n\",\n       \"\\t            if (!polygonStarted) listener.polygonStart(), polygonStarted = true;\\n\",\n       \"\\t            d3_geo_clipPolygon(segments, d3_geo_clipSort, clipStartInside, interpolate, listener);\\n\",\n       \"\\t          } else if (clipStartInside) {\\n\",\n       \"\\t            if (!polygonStarted) listener.polygonStart(), polygonStarted = true;\\n\",\n       \"\\t            listener.lineStart();\\n\",\n       \"\\t            interpolate(null, null, 1, listener);\\n\",\n       \"\\t            listener.lineEnd();\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (polygonStarted) listener.polygonEnd(), polygonStarted = false;\\n\",\n       \"\\t          segments = polygon = null;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        sphere: function() {\\n\",\n       \"\\t          listener.polygonStart();\\n\",\n       \"\\t          listener.lineStart();\\n\",\n       \"\\t          interpolate(null, null, 1, listener);\\n\",\n       \"\\t          listener.lineEnd();\\n\",\n       \"\\t          listener.polygonEnd();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t      function point(λ, φ) {\\n\",\n       \"\\t        var point = rotate(λ, φ);\\n\",\n       \"\\t        if (pointVisible(λ = point[0], φ = point[1])) listener.point(λ, φ);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function pointLine(λ, φ) {\\n\",\n       \"\\t        var point = rotate(λ, φ);\\n\",\n       \"\\t        line.point(point[0], point[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function lineStart() {\\n\",\n       \"\\t        clip.point = pointLine;\\n\",\n       \"\\t        line.lineStart();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function lineEnd() {\\n\",\n       \"\\t        clip.point = point;\\n\",\n       \"\\t        line.lineEnd();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var segments;\\n\",\n       \"\\t      var buffer = d3_geo_clipBufferListener(), ringListener = clipLine(buffer), polygonStarted = false, polygon, ring;\\n\",\n       \"\\t      function pointRing(λ, φ) {\\n\",\n       \"\\t        ring.push([ λ, φ ]);\\n\",\n       \"\\t        var point = rotate(λ, φ);\\n\",\n       \"\\t        ringListener.point(point[0], point[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ringStart() {\\n\",\n       \"\\t        ringListener.lineStart();\\n\",\n       \"\\t        ring = [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ringEnd() {\\n\",\n       \"\\t        pointRing(ring[0][0], ring[0][1]);\\n\",\n       \"\\t        ringListener.lineEnd();\\n\",\n       \"\\t        var clean = ringListener.clean(), ringSegments = buffer.buffer(), segment, n = ringSegments.length;\\n\",\n       \"\\t        ring.pop();\\n\",\n       \"\\t        polygon.push(ring);\\n\",\n       \"\\t        ring = null;\\n\",\n       \"\\t        if (!n) return;\\n\",\n       \"\\t        if (clean & 1) {\\n\",\n       \"\\t          segment = ringSegments[0];\\n\",\n       \"\\t          var n = segment.length - 1, i = -1, point;\\n\",\n       \"\\t          if (n > 0) {\\n\",\n       \"\\t            if (!polygonStarted) listener.polygonStart(), polygonStarted = true;\\n\",\n       \"\\t            listener.lineStart();\\n\",\n       \"\\t            while (++i < n) listener.point((point = segment[i])[0], point[1]);\\n\",\n       \"\\t            listener.lineEnd();\\n\",\n       \"\\t          }\\n\",\n       \"\\t          return;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (n > 1 && clean & 2) ringSegments.push(ringSegments.pop().concat(ringSegments.shift()));\\n\",\n       \"\\t        segments.push(ringSegments.filter(d3_geo_clipSegmentLength1));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return clip;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipSegmentLength1(segment) {\\n\",\n       \"\\t    return segment.length > 1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipBufferListener() {\\n\",\n       \"\\t    var lines = [], line;\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      lineStart: function() {\\n\",\n       \"\\t        lines.push(line = []);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      point: function(λ, φ) {\\n\",\n       \"\\t        line.push([ λ, φ ]);\\n\",\n       \"\\t      },\\n\",\n       \"\\t      lineEnd: d3_noop,\\n\",\n       \"\\t      buffer: function() {\\n\",\n       \"\\t        var buffer = lines;\\n\",\n       \"\\t        lines = [];\\n\",\n       \"\\t        line = null;\\n\",\n       \"\\t        return buffer;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      rejoin: function() {\\n\",\n       \"\\t        if (lines.length > 1) lines.push(lines.pop().concat(lines.shift()));\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipSort(a, b) {\\n\",\n       \"\\t    return ((a = a.x)[0] < 0 ? a[1] - halfπ - ε : halfπ - a[1]) - ((b = b.x)[0] < 0 ? b[1] - halfπ - ε : halfπ - b[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geo_clipAntimeridian = d3_geo_clip(d3_true, d3_geo_clipAntimeridianLine, d3_geo_clipAntimeridianInterpolate, [ -π, -π / 2 ]);\\n\",\n       \"\\t  function d3_geo_clipAntimeridianLine(listener) {\\n\",\n       \"\\t    var λ0 = NaN, φ0 = NaN, sλ0 = NaN, clean;\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      lineStart: function() {\\n\",\n       \"\\t        listener.lineStart();\\n\",\n       \"\\t        clean = 1;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      point: function(λ1, φ1) {\\n\",\n       \"\\t        var sλ1 = λ1 > 0 ? π : -π, dλ = abs(λ1 - λ0);\\n\",\n       \"\\t        if (abs(dλ - π) < ε) {\\n\",\n       \"\\t          listener.point(λ0, φ0 = (φ0 + φ1) / 2 > 0 ? halfπ : -halfπ);\\n\",\n       \"\\t          listener.point(sλ0, φ0);\\n\",\n       \"\\t          listener.lineEnd();\\n\",\n       \"\\t          listener.lineStart();\\n\",\n       \"\\t          listener.point(sλ1, φ0);\\n\",\n       \"\\t          listener.point(λ1, φ0);\\n\",\n       \"\\t          clean = 0;\\n\",\n       \"\\t        } else if (sλ0 !== sλ1 && dλ >= π) {\\n\",\n       \"\\t          if (abs(λ0 - sλ0) < ε) λ0 -= sλ0 * ε;\\n\",\n       \"\\t          if (abs(λ1 - sλ1) < ε) λ1 -= sλ1 * ε;\\n\",\n       \"\\t          φ0 = d3_geo_clipAntimeridianIntersect(λ0, φ0, λ1, φ1);\\n\",\n       \"\\t          listener.point(sλ0, φ0);\\n\",\n       \"\\t          listener.lineEnd();\\n\",\n       \"\\t          listener.lineStart();\\n\",\n       \"\\t          listener.point(sλ1, φ0);\\n\",\n       \"\\t          clean = 0;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        listener.point(λ0 = λ1, φ0 = φ1);\\n\",\n       \"\\t        sλ0 = sλ1;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      lineEnd: function() {\\n\",\n       \"\\t        listener.lineEnd();\\n\",\n       \"\\t        λ0 = φ0 = NaN;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      clean: function() {\\n\",\n       \"\\t        return 2 - clean;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipAntimeridianIntersect(λ0, φ0, λ1, φ1) {\\n\",\n       \"\\t    var cosφ0, cosφ1, sinλ0_λ1 = Math.sin(λ0 - λ1);\\n\",\n       \"\\t    return abs(sinλ0_λ1) > ε ? Math.atan((Math.sin(φ0) * (cosφ1 = Math.cos(φ1)) * Math.sin(λ1) - Math.sin(φ1) * (cosφ0 = Math.cos(φ0)) * Math.sin(λ0)) / (cosφ0 * cosφ1 * sinλ0_λ1)) : (φ0 + φ1) / 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipAntimeridianInterpolate(from, to, direction, listener) {\\n\",\n       \"\\t    var φ;\\n\",\n       \"\\t    if (from == null) {\\n\",\n       \"\\t      φ = direction * halfπ;\\n\",\n       \"\\t      listener.point(-π, φ);\\n\",\n       \"\\t      listener.point(0, φ);\\n\",\n       \"\\t      listener.point(π, φ);\\n\",\n       \"\\t      listener.point(π, 0);\\n\",\n       \"\\t      listener.point(π, -φ);\\n\",\n       \"\\t      listener.point(0, -φ);\\n\",\n       \"\\t      listener.point(-π, -φ);\\n\",\n       \"\\t      listener.point(-π, 0);\\n\",\n       \"\\t      listener.point(-π, φ);\\n\",\n       \"\\t    } else if (abs(from[0] - to[0]) > ε) {\\n\",\n       \"\\t      var s = from[0] < to[0] ? π : -π;\\n\",\n       \"\\t      φ = direction * s / 2;\\n\",\n       \"\\t      listener.point(-s, φ);\\n\",\n       \"\\t      listener.point(0, φ);\\n\",\n       \"\\t      listener.point(s, φ);\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      listener.point(to[0], to[1]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pointInPolygon(point, polygon) {\\n\",\n       \"\\t    var meridian = point[0], parallel = point[1], meridianNormal = [ Math.sin(meridian), -Math.cos(meridian), 0 ], polarAngle = 0, winding = 0;\\n\",\n       \"\\t    d3_geo_areaRingSum.reset();\\n\",\n       \"\\t    for (var i = 0, n = polygon.length; i < n; ++i) {\\n\",\n       \"\\t      var ring = polygon[i], m = ring.length;\\n\",\n       \"\\t      if (!m) continue;\\n\",\n       \"\\t      var point0 = ring[0], λ0 = point0[0], φ0 = point0[1] / 2 + π / 4, sinφ0 = Math.sin(φ0), cosφ0 = Math.cos(φ0), j = 1;\\n\",\n       \"\\t      while (true) {\\n\",\n       \"\\t        if (j === m) j = 0;\\n\",\n       \"\\t        point = ring[j];\\n\",\n       \"\\t        var λ = point[0], φ = point[1] / 2 + π / 4, sinφ = Math.sin(φ), cosφ = Math.cos(φ), dλ = λ - λ0, sdλ = dλ >= 0 ? 1 : -1, adλ = sdλ * dλ, antimeridian = adλ > π, k = sinφ0 * sinφ;\\n\",\n       \"\\t        d3_geo_areaRingSum.add(Math.atan2(k * sdλ * Math.sin(adλ), cosφ0 * cosφ + k * Math.cos(adλ)));\\n\",\n       \"\\t        polarAngle += antimeridian ? dλ + sdλ * τ : dλ;\\n\",\n       \"\\t        if (antimeridian ^ λ0 >= meridian ^ λ >= meridian) {\\n\",\n       \"\\t          var arc = d3_geo_cartesianCross(d3_geo_cartesian(point0), d3_geo_cartesian(point));\\n\",\n       \"\\t          d3_geo_cartesianNormalize(arc);\\n\",\n       \"\\t          var intersection = d3_geo_cartesianCross(meridianNormal, arc);\\n\",\n       \"\\t          d3_geo_cartesianNormalize(intersection);\\n\",\n       \"\\t          var φarc = (antimeridian ^ dλ >= 0 ? -1 : 1) * d3_asin(intersection[2]);\\n\",\n       \"\\t          if (parallel > φarc || parallel === φarc && (arc[0] || arc[1])) {\\n\",\n       \"\\t            winding += antimeridian ^ dλ >= 0 ? 1 : -1;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (!j++) break;\\n\",\n       \"\\t        λ0 = λ, sinφ0 = sinφ, cosφ0 = cosφ, point0 = point;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return (polarAngle < -ε || polarAngle < ε && d3_geo_areaRingSum < -ε) ^ winding & 1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_clipCircle(radius) {\\n\",\n       \"\\t    var cr = Math.cos(radius), smallRadius = cr > 0, notHemisphere = abs(cr) > ε, interpolate = d3_geo_circleInterpolate(radius, 6 * d3_radians);\\n\",\n       \"\\t    return d3_geo_clip(visible, clipLine, interpolate, smallRadius ? [ 0, -radius ] : [ -π, radius - π ]);\\n\",\n       \"\\t    function visible(λ, φ) {\\n\",\n       \"\\t      return Math.cos(λ) * Math.cos(φ) > cr;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function clipLine(listener) {\\n\",\n       \"\\t      var point0, c0, v0, v00, clean;\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        lineStart: function() {\\n\",\n       \"\\t          v00 = v0 = false;\\n\",\n       \"\\t          clean = 1;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        point: function(λ, φ) {\\n\",\n       \"\\t          var point1 = [ λ, φ ], point2, v = visible(λ, φ), c = smallRadius ? v ? 0 : code(λ, φ) : v ? code(λ + (λ < 0 ? π : -π), φ) : 0;\\n\",\n       \"\\t          if (!point0 && (v00 = v0 = v)) listener.lineStart();\\n\",\n       \"\\t          if (v !== v0) {\\n\",\n       \"\\t            point2 = intersect(point0, point1);\\n\",\n       \"\\t            if (d3_geo_sphericalEqual(point0, point2) || d3_geo_sphericalEqual(point1, point2)) {\\n\",\n       \"\\t              point1[0] += ε;\\n\",\n       \"\\t              point1[1] += ε;\\n\",\n       \"\\t              v = visible(point1[0], point1[1]);\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (v !== v0) {\\n\",\n       \"\\t            clean = 0;\\n\",\n       \"\\t            if (v) {\\n\",\n       \"\\t              listener.lineStart();\\n\",\n       \"\\t              point2 = intersect(point1, point0);\\n\",\n       \"\\t              listener.point(point2[0], point2[1]);\\n\",\n       \"\\t            } else {\\n\",\n       \"\\t              point2 = intersect(point0, point1);\\n\",\n       \"\\t              listener.point(point2[0], point2[1]);\\n\",\n       \"\\t              listener.lineEnd();\\n\",\n       \"\\t            }\\n\",\n       \"\\t            point0 = point2;\\n\",\n       \"\\t          } else if (notHemisphere && point0 && smallRadius ^ v) {\\n\",\n       \"\\t            var t;\\n\",\n       \"\\t            if (!(c & c0) && (t = intersect(point1, point0, true))) {\\n\",\n       \"\\t              clean = 0;\\n\",\n       \"\\t              if (smallRadius) {\\n\",\n       \"\\t                listener.lineStart();\\n\",\n       \"\\t                listener.point(t[0][0], t[0][1]);\\n\",\n       \"\\t                listener.point(t[1][0], t[1][1]);\\n\",\n       \"\\t                listener.lineEnd();\\n\",\n       \"\\t              } else {\\n\",\n       \"\\t                listener.point(t[1][0], t[1][1]);\\n\",\n       \"\\t                listener.lineEnd();\\n\",\n       \"\\t                listener.lineStart();\\n\",\n       \"\\t                listener.point(t[0][0], t[0][1]);\\n\",\n       \"\\t              }\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (v && (!point0 || !d3_geo_sphericalEqual(point0, point1))) {\\n\",\n       \"\\t            listener.point(point1[0], point1[1]);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          point0 = point1, v0 = v, c0 = c;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        lineEnd: function() {\\n\",\n       \"\\t          if (v0) listener.lineEnd();\\n\",\n       \"\\t          point0 = null;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        clean: function() {\\n\",\n       \"\\t          return clean | (v00 && v0) << 1;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function intersect(a, b, two) {\\n\",\n       \"\\t      var pa = d3_geo_cartesian(a), pb = d3_geo_cartesian(b);\\n\",\n       \"\\t      var n1 = [ 1, 0, 0 ], n2 = d3_geo_cartesianCross(pa, pb), n2n2 = d3_geo_cartesianDot(n2, n2), n1n2 = n2[0], determinant = n2n2 - n1n2 * n1n2;\\n\",\n       \"\\t      if (!determinant) return !two && a;\\n\",\n       \"\\t      var c1 = cr * n2n2 / determinant, c2 = -cr * n1n2 / determinant, n1xn2 = d3_geo_cartesianCross(n1, n2), A = d3_geo_cartesianScale(n1, c1), B = d3_geo_cartesianScale(n2, c2);\\n\",\n       \"\\t      d3_geo_cartesianAdd(A, B);\\n\",\n       \"\\t      var u = n1xn2, w = d3_geo_cartesianDot(A, u), uu = d3_geo_cartesianDot(u, u), t2 = w * w - uu * (d3_geo_cartesianDot(A, A) - 1);\\n\",\n       \"\\t      if (t2 < 0) return;\\n\",\n       \"\\t      var t = Math.sqrt(t2), q = d3_geo_cartesianScale(u, (-w - t) / uu);\\n\",\n       \"\\t      d3_geo_cartesianAdd(q, A);\\n\",\n       \"\\t      q = d3_geo_spherical(q);\\n\",\n       \"\\t      if (!two) return q;\\n\",\n       \"\\t      var λ0 = a[0], λ1 = b[0], φ0 = a[1], φ1 = b[1], z;\\n\",\n       \"\\t      if (λ1 < λ0) z = λ0, λ0 = λ1, λ1 = z;\\n\",\n       \"\\t      var δλ = λ1 - λ0, polar = abs(δλ - π) < ε, meridian = polar || δλ < ε;\\n\",\n       \"\\t      if (!polar && φ1 < φ0) z = φ0, φ0 = φ1, φ1 = z;\\n\",\n       \"\\t      if (meridian ? polar ? φ0 + φ1 > 0 ^ q[1] < (abs(q[0] - λ0) < ε ? φ0 : φ1) : φ0 <= q[1] && q[1] <= φ1 : δλ > π ^ (λ0 <= q[0] && q[0] <= λ1)) {\\n\",\n       \"\\t        var q1 = d3_geo_cartesianScale(u, (-w + t) / uu);\\n\",\n       \"\\t        d3_geo_cartesianAdd(q1, A);\\n\",\n       \"\\t        return [ q, d3_geo_spherical(q1) ];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function code(λ, φ) {\\n\",\n       \"\\t      var r = smallRadius ? radius : π - radius, code = 0;\\n\",\n       \"\\t      if (λ < -r) code |= 1; else if (λ > r) code |= 2;\\n\",\n       \"\\t      if (φ < -r) code |= 4; else if (φ > r) code |= 8;\\n\",\n       \"\\t      return code;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_clipLine(x0, y0, x1, y1) {\\n\",\n       \"\\t    return function(line) {\\n\",\n       \"\\t      var a = line.a, b = line.b, ax = a.x, ay = a.y, bx = b.x, by = b.y, t0 = 0, t1 = 1, dx = bx - ax, dy = by - ay, r;\\n\",\n       \"\\t      r = x0 - ax;\\n\",\n       \"\\t      if (!dx && r > 0) return;\\n\",\n       \"\\t      r /= dx;\\n\",\n       \"\\t      if (dx < 0) {\\n\",\n       \"\\t        if (r < t0) return;\\n\",\n       \"\\t        if (r < t1) t1 = r;\\n\",\n       \"\\t      } else if (dx > 0) {\\n\",\n       \"\\t        if (r > t1) return;\\n\",\n       \"\\t        if (r > t0) t0 = r;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      r = x1 - ax;\\n\",\n       \"\\t      if (!dx && r < 0) return;\\n\",\n       \"\\t      r /= dx;\\n\",\n       \"\\t      if (dx < 0) {\\n\",\n       \"\\t        if (r > t1) return;\\n\",\n       \"\\t        if (r > t0) t0 = r;\\n\",\n       \"\\t      } else if (dx > 0) {\\n\",\n       \"\\t        if (r < t0) return;\\n\",\n       \"\\t        if (r < t1) t1 = r;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      r = y0 - ay;\\n\",\n       \"\\t      if (!dy && r > 0) return;\\n\",\n       \"\\t      r /= dy;\\n\",\n       \"\\t      if (dy < 0) {\\n\",\n       \"\\t        if (r < t0) return;\\n\",\n       \"\\t        if (r < t1) t1 = r;\\n\",\n       \"\\t      } else if (dy > 0) {\\n\",\n       \"\\t        if (r > t1) return;\\n\",\n       \"\\t        if (r > t0) t0 = r;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      r = y1 - ay;\\n\",\n       \"\\t      if (!dy && r < 0) return;\\n\",\n       \"\\t      r /= dy;\\n\",\n       \"\\t      if (dy < 0) {\\n\",\n       \"\\t        if (r > t1) return;\\n\",\n       \"\\t        if (r > t0) t0 = r;\\n\",\n       \"\\t      } else if (dy > 0) {\\n\",\n       \"\\t        if (r < t0) return;\\n\",\n       \"\\t        if (r < t1) t1 = r;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (t0 > 0) line.a = {\\n\",\n       \"\\t        x: ax + t0 * dx,\\n\",\n       \"\\t        y: ay + t0 * dy\\n\",\n       \"\\t      };\\n\",\n       \"\\t      if (t1 < 1) line.b = {\\n\",\n       \"\\t        x: ax + t1 * dx,\\n\",\n       \"\\t        y: ay + t1 * dy\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return line;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geo_clipExtentMAX = 1e9;\\n\",\n       \"\\t  d3.geo.clipExtent = function() {\\n\",\n       \"\\t    var x0, y0, x1, y1, stream, clip, clipExtent = {\\n\",\n       \"\\t      stream: function(output) {\\n\",\n       \"\\t        if (stream) stream.valid = false;\\n\",\n       \"\\t        stream = clip(output);\\n\",\n       \"\\t        stream.valid = true;\\n\",\n       \"\\t        return stream;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      extent: function(_) {\\n\",\n       \"\\t        if (!arguments.length) return [ [ x0, y0 ], [ x1, y1 ] ];\\n\",\n       \"\\t        clip = d3_geo_clipExtent(x0 = +_[0][0], y0 = +_[0][1], x1 = +_[1][0], y1 = +_[1][1]);\\n\",\n       \"\\t        if (stream) stream.valid = false, stream = null;\\n\",\n       \"\\t        return clipExtent;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return clipExtent.extent([ [ 0, 0 ], [ 960, 500 ] ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_clipExtent(x0, y0, x1, y1) {\\n\",\n       \"\\t    return function(listener) {\\n\",\n       \"\\t      var listener_ = listener, bufferListener = d3_geo_clipBufferListener(), clipLine = d3_geom_clipLine(x0, y0, x1, y1), segments, polygon, ring;\\n\",\n       \"\\t      var clip = {\\n\",\n       \"\\t        point: point,\\n\",\n       \"\\t        lineStart: lineStart,\\n\",\n       \"\\t        lineEnd: lineEnd,\\n\",\n       \"\\t        polygonStart: function() {\\n\",\n       \"\\t          listener = bufferListener;\\n\",\n       \"\\t          segments = [];\\n\",\n       \"\\t          polygon = [];\\n\",\n       \"\\t          clean = true;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        polygonEnd: function() {\\n\",\n       \"\\t          listener = listener_;\\n\",\n       \"\\t          segments = d3.merge(segments);\\n\",\n       \"\\t          var clipStartInside = insidePolygon([ x0, y1 ]), inside = clean && clipStartInside, visible = segments.length;\\n\",\n       \"\\t          if (inside || visible) {\\n\",\n       \"\\t            listener.polygonStart();\\n\",\n       \"\\t            if (inside) {\\n\",\n       \"\\t              listener.lineStart();\\n\",\n       \"\\t              interpolate(null, null, 1, listener);\\n\",\n       \"\\t              listener.lineEnd();\\n\",\n       \"\\t            }\\n\",\n       \"\\t            if (visible) {\\n\",\n       \"\\t              d3_geo_clipPolygon(segments, compare, clipStartInside, interpolate, listener);\\n\",\n       \"\\t            }\\n\",\n       \"\\t            listener.polygonEnd();\\n\",\n       \"\\t          }\\n\",\n       \"\\t          segments = polygon = ring = null;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t      function insidePolygon(p) {\\n\",\n       \"\\t        var wn = 0, n = polygon.length, y = p[1];\\n\",\n       \"\\t        for (var i = 0; i < n; ++i) {\\n\",\n       \"\\t          for (var j = 1, v = polygon[i], m = v.length, a = v[0], b; j < m; ++j) {\\n\",\n       \"\\t            b = v[j];\\n\",\n       \"\\t            if (a[1] <= y) {\\n\",\n       \"\\t              if (b[1] > y && d3_cross2d(a, b, p) > 0) ++wn;\\n\",\n       \"\\t            } else {\\n\",\n       \"\\t              if (b[1] <= y && d3_cross2d(a, b, p) < 0) --wn;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            a = b;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return wn !== 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function interpolate(from, to, direction, listener) {\\n\",\n       \"\\t        var a = 0, a1 = 0;\\n\",\n       \"\\t        if (from == null || (a = corner(from, direction)) !== (a1 = corner(to, direction)) || comparePoints(from, to) < 0 ^ direction > 0) {\\n\",\n       \"\\t          do {\\n\",\n       \"\\t            listener.point(a === 0 || a === 3 ? x0 : x1, a > 1 ? y1 : y0);\\n\",\n       \"\\t          } while ((a = (a + direction + 4) % 4) !== a1);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          listener.point(to[0], to[1]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function pointVisible(x, y) {\\n\",\n       \"\\t        return x0 <= x && x <= x1 && y0 <= y && y <= y1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function point(x, y) {\\n\",\n       \"\\t        if (pointVisible(x, y)) listener.point(x, y);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var x__, y__, v__, x_, y_, v_, first, clean;\\n\",\n       \"\\t      function lineStart() {\\n\",\n       \"\\t        clip.point = linePoint;\\n\",\n       \"\\t        if (polygon) polygon.push(ring = []);\\n\",\n       \"\\t        first = true;\\n\",\n       \"\\t        v_ = false;\\n\",\n       \"\\t        x_ = y_ = NaN;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function lineEnd() {\\n\",\n       \"\\t        if (segments) {\\n\",\n       \"\\t          linePoint(x__, y__);\\n\",\n       \"\\t          if (v__ && v_) bufferListener.rejoin();\\n\",\n       \"\\t          segments.push(bufferListener.buffer());\\n\",\n       \"\\t        }\\n\",\n       \"\\t        clip.point = point;\\n\",\n       \"\\t        if (v_) listener.lineEnd();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function linePoint(x, y) {\\n\",\n       \"\\t        x = Math.max(-d3_geo_clipExtentMAX, Math.min(d3_geo_clipExtentMAX, x));\\n\",\n       \"\\t        y = Math.max(-d3_geo_clipExtentMAX, Math.min(d3_geo_clipExtentMAX, y));\\n\",\n       \"\\t        var v = pointVisible(x, y);\\n\",\n       \"\\t        if (polygon) ring.push([ x, y ]);\\n\",\n       \"\\t        if (first) {\\n\",\n       \"\\t          x__ = x, y__ = y, v__ = v;\\n\",\n       \"\\t          first = false;\\n\",\n       \"\\t          if (v) {\\n\",\n       \"\\t            listener.lineStart();\\n\",\n       \"\\t            listener.point(x, y);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (v && v_) listener.point(x, y); else {\\n\",\n       \"\\t            var l = {\\n\",\n       \"\\t              a: {\\n\",\n       \"\\t                x: x_,\\n\",\n       \"\\t                y: y_\\n\",\n       \"\\t              },\\n\",\n       \"\\t              b: {\\n\",\n       \"\\t                x: x,\\n\",\n       \"\\t                y: y\\n\",\n       \"\\t              }\\n\",\n       \"\\t            };\\n\",\n       \"\\t            if (clipLine(l)) {\\n\",\n       \"\\t              if (!v_) {\\n\",\n       \"\\t                listener.lineStart();\\n\",\n       \"\\t                listener.point(l.a.x, l.a.y);\\n\",\n       \"\\t              }\\n\",\n       \"\\t              listener.point(l.b.x, l.b.y);\\n\",\n       \"\\t              if (!v) listener.lineEnd();\\n\",\n       \"\\t              clean = false;\\n\",\n       \"\\t            } else if (v) {\\n\",\n       \"\\t              listener.lineStart();\\n\",\n       \"\\t              listener.point(x, y);\\n\",\n       \"\\t              clean = false;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        x_ = x, y_ = y, v_ = v;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return clip;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function corner(p, direction) {\\n\",\n       \"\\t      return abs(p[0] - x0) < ε ? direction > 0 ? 0 : 3 : abs(p[0] - x1) < ε ? direction > 0 ? 2 : 1 : abs(p[1] - y0) < ε ? direction > 0 ? 1 : 0 : direction > 0 ? 3 : 2;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function compare(a, b) {\\n\",\n       \"\\t      return comparePoints(a.x, b.x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function comparePoints(a, b) {\\n\",\n       \"\\t      var ca = corner(a, 1), cb = corner(b, 1);\\n\",\n       \"\\t      return ca !== cb ? ca - cb : ca === 0 ? b[1] - a[1] : ca === 1 ? a[0] - b[0] : ca === 2 ? a[1] - b[1] : b[0] - a[0];\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_conic(projectAt) {\\n\",\n       \"\\t    var φ0 = 0, φ1 = π / 3, m = d3_geo_projectionMutator(projectAt), p = m(φ0, φ1);\\n\",\n       \"\\t    p.parallels = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ φ0 / π * 180, φ1 / π * 180 ];\\n\",\n       \"\\t      return m(φ0 = _[0] * π / 180, φ1 = _[1] * π / 180);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return p;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_conicEqualArea(φ0, φ1) {\\n\",\n       \"\\t    var sinφ0 = Math.sin(φ0), n = (sinφ0 + Math.sin(φ1)) / 2, C = 1 + sinφ0 * (2 * n - sinφ0), ρ0 = Math.sqrt(C) / n;\\n\",\n       \"\\t    function forward(λ, φ) {\\n\",\n       \"\\t      var ρ = Math.sqrt(C - 2 * n * Math.sin(φ)) / n;\\n\",\n       \"\\t      return [ ρ * Math.sin(λ *= n), ρ0 - ρ * Math.cos(λ) ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    forward.invert = function(x, y) {\\n\",\n       \"\\t      var ρ0_y = ρ0 - y;\\n\",\n       \"\\t      return [ Math.atan2(x, ρ0_y) / n, d3_asin((C - (x * x + ρ0_y * ρ0_y) * n * n) / (2 * n)) ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return forward;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  (d3.geo.conicEqualArea = function() {\\n\",\n       \"\\t    return d3_geo_conic(d3_geo_conicEqualArea);\\n\",\n       \"\\t  }).raw = d3_geo_conicEqualArea;\\n\",\n       \"\\t  d3.geo.albers = function() {\\n\",\n       \"\\t    return d3.geo.conicEqualArea().rotate([ 96, 0 ]).center([ -.6, 38.7 ]).parallels([ 29.5, 45.5 ]).scale(1070);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.geo.albersUsa = function() {\\n\",\n       \"\\t    var lower48 = d3.geo.albers();\\n\",\n       \"\\t    var alaska = d3.geo.conicEqualArea().rotate([ 154, 0 ]).center([ -2, 58.5 ]).parallels([ 55, 65 ]);\\n\",\n       \"\\t    var hawaii = d3.geo.conicEqualArea().rotate([ 157, 0 ]).center([ -3, 19.9 ]).parallels([ 8, 18 ]);\\n\",\n       \"\\t    var point, pointStream = {\\n\",\n       \"\\t      point: function(x, y) {\\n\",\n       \"\\t        point = [ x, y ];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }, lower48Point, alaskaPoint, hawaiiPoint;\\n\",\n       \"\\t    function albersUsa(coordinates) {\\n\",\n       \"\\t      var x = coordinates[0], y = coordinates[1];\\n\",\n       \"\\t      point = null;\\n\",\n       \"\\t      (lower48Point(x, y), point) || (alaskaPoint(x, y), point) || hawaiiPoint(x, y);\\n\",\n       \"\\t      return point;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    albersUsa.invert = function(coordinates) {\\n\",\n       \"\\t      var k = lower48.scale(), t = lower48.translate(), x = (coordinates[0] - t[0]) / k, y = (coordinates[1] - t[1]) / k;\\n\",\n       \"\\t      return (y >= .12 && y < .234 && x >= -.425 && x < -.214 ? alaska : y >= .166 && y < .234 && x >= -.214 && x < -.115 ? hawaii : lower48).invert(coordinates);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    albersUsa.stream = function(stream) {\\n\",\n       \"\\t      var lower48Stream = lower48.stream(stream), alaskaStream = alaska.stream(stream), hawaiiStream = hawaii.stream(stream);\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        point: function(x, y) {\\n\",\n       \"\\t          lower48Stream.point(x, y);\\n\",\n       \"\\t          alaskaStream.point(x, y);\\n\",\n       \"\\t          hawaiiStream.point(x, y);\\n\",\n       \"\\t        },\\n\",\n       \"\\t        sphere: function() {\\n\",\n       \"\\t          lower48Stream.sphere();\\n\",\n       \"\\t          alaskaStream.sphere();\\n\",\n       \"\\t          hawaiiStream.sphere();\\n\",\n       \"\\t        },\\n\",\n       \"\\t        lineStart: function() {\\n\",\n       \"\\t          lower48Stream.lineStart();\\n\",\n       \"\\t          alaskaStream.lineStart();\\n\",\n       \"\\t          hawaiiStream.lineStart();\\n\",\n       \"\\t        },\\n\",\n       \"\\t        lineEnd: function() {\\n\",\n       \"\\t          lower48Stream.lineEnd();\\n\",\n       \"\\t          alaskaStream.lineEnd();\\n\",\n       \"\\t          hawaiiStream.lineEnd();\\n\",\n       \"\\t        },\\n\",\n       \"\\t        polygonStart: function() {\\n\",\n       \"\\t          lower48Stream.polygonStart();\\n\",\n       \"\\t          alaskaStream.polygonStart();\\n\",\n       \"\\t          hawaiiStream.polygonStart();\\n\",\n       \"\\t        },\\n\",\n       \"\\t        polygonEnd: function() {\\n\",\n       \"\\t          lower48Stream.polygonEnd();\\n\",\n       \"\\t          alaskaStream.polygonEnd();\\n\",\n       \"\\t          hawaiiStream.polygonEnd();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t    };\\n\",\n       \"\\t    albersUsa.precision = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return lower48.precision();\\n\",\n       \"\\t      lower48.precision(_);\\n\",\n       \"\\t      alaska.precision(_);\\n\",\n       \"\\t      hawaii.precision(_);\\n\",\n       \"\\t      return albersUsa;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    albersUsa.scale = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return lower48.scale();\\n\",\n       \"\\t      lower48.scale(_);\\n\",\n       \"\\t      alaska.scale(_ * .35);\\n\",\n       \"\\t      hawaii.scale(_);\\n\",\n       \"\\t      return albersUsa.translate(lower48.translate());\\n\",\n       \"\\t    };\\n\",\n       \"\\t    albersUsa.translate = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return lower48.translate();\\n\",\n       \"\\t      var k = lower48.scale(), x = +_[0], y = +_[1];\\n\",\n       \"\\t      lower48Point = lower48.translate(_).clipExtent([ [ x - .455 * k, y - .238 * k ], [ x + .455 * k, y + .238 * k ] ]).stream(pointStream).point;\\n\",\n       \"\\t      alaskaPoint = alaska.translate([ x - .307 * k, y + .201 * k ]).clipExtent([ [ x - .425 * k + ε, y + .12 * k + ε ], [ x - .214 * k - ε, y + .234 * k - ε ] ]).stream(pointStream).point;\\n\",\n       \"\\t      hawaiiPoint = hawaii.translate([ x - .205 * k, y + .212 * k ]).clipExtent([ [ x - .214 * k + ε, y + .166 * k + ε ], [ x - .115 * k - ε, y + .234 * k - ε ] ]).stream(pointStream).point;\\n\",\n       \"\\t      return albersUsa;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return albersUsa.scale(1070);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geo_pathAreaSum, d3_geo_pathAreaPolygon, d3_geo_pathArea = {\\n\",\n       \"\\t    point: d3_noop,\\n\",\n       \"\\t    lineStart: d3_noop,\\n\",\n       \"\\t    lineEnd: d3_noop,\\n\",\n       \"\\t    polygonStart: function() {\\n\",\n       \"\\t      d3_geo_pathAreaPolygon = 0;\\n\",\n       \"\\t      d3_geo_pathArea.lineStart = d3_geo_pathAreaRingStart;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    polygonEnd: function() {\\n\",\n       \"\\t      d3_geo_pathArea.lineStart = d3_geo_pathArea.lineEnd = d3_geo_pathArea.point = d3_noop;\\n\",\n       \"\\t      d3_geo_pathAreaSum += abs(d3_geo_pathAreaPolygon / 2);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_pathAreaRingStart() {\\n\",\n       \"\\t    var x00, y00, x0, y0;\\n\",\n       \"\\t    d3_geo_pathArea.point = function(x, y) {\\n\",\n       \"\\t      d3_geo_pathArea.point = nextPoint;\\n\",\n       \"\\t      x00 = x0 = x, y00 = y0 = y;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(x, y) {\\n\",\n       \"\\t      d3_geo_pathAreaPolygon += y0 * x - x0 * y;\\n\",\n       \"\\t      x0 = x, y0 = y;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_geo_pathArea.lineEnd = function() {\\n\",\n       \"\\t      nextPoint(x00, y00);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geo_pathBoundsX0, d3_geo_pathBoundsY0, d3_geo_pathBoundsX1, d3_geo_pathBoundsY1;\\n\",\n       \"\\t  var d3_geo_pathBounds = {\\n\",\n       \"\\t    point: d3_geo_pathBoundsPoint,\\n\",\n       \"\\t    lineStart: d3_noop,\\n\",\n       \"\\t    lineEnd: d3_noop,\\n\",\n       \"\\t    polygonStart: d3_noop,\\n\",\n       \"\\t    polygonEnd: d3_noop\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_pathBoundsPoint(x, y) {\\n\",\n       \"\\t    if (x < d3_geo_pathBoundsX0) d3_geo_pathBoundsX0 = x;\\n\",\n       \"\\t    if (x > d3_geo_pathBoundsX1) d3_geo_pathBoundsX1 = x;\\n\",\n       \"\\t    if (y < d3_geo_pathBoundsY0) d3_geo_pathBoundsY0 = y;\\n\",\n       \"\\t    if (y > d3_geo_pathBoundsY1) d3_geo_pathBoundsY1 = y;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pathBuffer() {\\n\",\n       \"\\t    var pointCircle = d3_geo_pathBufferCircle(4.5), buffer = [];\\n\",\n       \"\\t    var stream = {\\n\",\n       \"\\t      point: point,\\n\",\n       \"\\t      lineStart: function() {\\n\",\n       \"\\t        stream.point = pointLineStart;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      lineEnd: lineEnd,\\n\",\n       \"\\t      polygonStart: function() {\\n\",\n       \"\\t        stream.lineEnd = lineEndPolygon;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      polygonEnd: function() {\\n\",\n       \"\\t        stream.lineEnd = lineEnd;\\n\",\n       \"\\t        stream.point = point;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      pointRadius: function(_) {\\n\",\n       \"\\t        pointCircle = d3_geo_pathBufferCircle(_);\\n\",\n       \"\\t        return stream;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      result: function() {\\n\",\n       \"\\t        if (buffer.length) {\\n\",\n       \"\\t          var result = buffer.join(\\\"\\\");\\n\",\n       \"\\t          buffer = [];\\n\",\n       \"\\t          return result;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function point(x, y) {\\n\",\n       \"\\t      buffer.push(\\\"M\\\", x, \\\",\\\", y, pointCircle);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function pointLineStart(x, y) {\\n\",\n       \"\\t      buffer.push(\\\"M\\\", x, \\\",\\\", y);\\n\",\n       \"\\t      stream.point = pointLine;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function pointLine(x, y) {\\n\",\n       \"\\t      buffer.push(\\\"L\\\", x, \\\",\\\", y);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lineEnd() {\\n\",\n       \"\\t      stream.point = point;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lineEndPolygon() {\\n\",\n       \"\\t      buffer.push(\\\"Z\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return stream;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pathBufferCircle(radius) {\\n\",\n       \"\\t    return \\\"m0,\\\" + radius + \\\"a\\\" + radius + \\\",\\\" + radius + \\\" 0 1,1 0,\\\" + -2 * radius + \\\"a\\\" + radius + \\\",\\\" + radius + \\\" 0 1,1 0,\\\" + 2 * radius + \\\"z\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geo_pathCentroid = {\\n\",\n       \"\\t    point: d3_geo_pathCentroidPoint,\\n\",\n       \"\\t    lineStart: d3_geo_pathCentroidLineStart,\\n\",\n       \"\\t    lineEnd: d3_geo_pathCentroidLineEnd,\\n\",\n       \"\\t    polygonStart: function() {\\n\",\n       \"\\t      d3_geo_pathCentroid.lineStart = d3_geo_pathCentroidRingStart;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    polygonEnd: function() {\\n\",\n       \"\\t      d3_geo_pathCentroid.point = d3_geo_pathCentroidPoint;\\n\",\n       \"\\t      d3_geo_pathCentroid.lineStart = d3_geo_pathCentroidLineStart;\\n\",\n       \"\\t      d3_geo_pathCentroid.lineEnd = d3_geo_pathCentroidLineEnd;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_pathCentroidPoint(x, y) {\\n\",\n       \"\\t    d3_geo_centroidX0 += x;\\n\",\n       \"\\t    d3_geo_centroidY0 += y;\\n\",\n       \"\\t    ++d3_geo_centroidZ0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pathCentroidLineStart() {\\n\",\n       \"\\t    var x0, y0;\\n\",\n       \"\\t    d3_geo_pathCentroid.point = function(x, y) {\\n\",\n       \"\\t      d3_geo_pathCentroid.point = nextPoint;\\n\",\n       \"\\t      d3_geo_pathCentroidPoint(x0 = x, y0 = y);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(x, y) {\\n\",\n       \"\\t      var dx = x - x0, dy = y - y0, z = Math.sqrt(dx * dx + dy * dy);\\n\",\n       \"\\t      d3_geo_centroidX1 += z * (x0 + x) / 2;\\n\",\n       \"\\t      d3_geo_centroidY1 += z * (y0 + y) / 2;\\n\",\n       \"\\t      d3_geo_centroidZ1 += z;\\n\",\n       \"\\t      d3_geo_pathCentroidPoint(x0 = x, y0 = y);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pathCentroidLineEnd() {\\n\",\n       \"\\t    d3_geo_pathCentroid.point = d3_geo_pathCentroidPoint;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pathCentroidRingStart() {\\n\",\n       \"\\t    var x00, y00, x0, y0;\\n\",\n       \"\\t    d3_geo_pathCentroid.point = function(x, y) {\\n\",\n       \"\\t      d3_geo_pathCentroid.point = nextPoint;\\n\",\n       \"\\t      d3_geo_pathCentroidPoint(x00 = x0 = x, y00 = y0 = y);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(x, y) {\\n\",\n       \"\\t      var dx = x - x0, dy = y - y0, z = Math.sqrt(dx * dx + dy * dy);\\n\",\n       \"\\t      d3_geo_centroidX1 += z * (x0 + x) / 2;\\n\",\n       \"\\t      d3_geo_centroidY1 += z * (y0 + y) / 2;\\n\",\n       \"\\t      d3_geo_centroidZ1 += z;\\n\",\n       \"\\t      z = y0 * x - x0 * y;\\n\",\n       \"\\t      d3_geo_centroidX2 += z * (x0 + x);\\n\",\n       \"\\t      d3_geo_centroidY2 += z * (y0 + y);\\n\",\n       \"\\t      d3_geo_centroidZ2 += z * 3;\\n\",\n       \"\\t      d3_geo_pathCentroidPoint(x0 = x, y0 = y);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_geo_pathCentroid.lineEnd = function() {\\n\",\n       \"\\t      nextPoint(x00, y00);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_pathContext(context) {\\n\",\n       \"\\t    var pointRadius = 4.5;\\n\",\n       \"\\t    var stream = {\\n\",\n       \"\\t      point: point,\\n\",\n       \"\\t      lineStart: function() {\\n\",\n       \"\\t        stream.point = pointLineStart;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      lineEnd: lineEnd,\\n\",\n       \"\\t      polygonStart: function() {\\n\",\n       \"\\t        stream.lineEnd = lineEndPolygon;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      polygonEnd: function() {\\n\",\n       \"\\t        stream.lineEnd = lineEnd;\\n\",\n       \"\\t        stream.point = point;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      pointRadius: function(_) {\\n\",\n       \"\\t        pointRadius = _;\\n\",\n       \"\\t        return stream;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      result: d3_noop\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function point(x, y) {\\n\",\n       \"\\t      context.moveTo(x + pointRadius, y);\\n\",\n       \"\\t      context.arc(x, y, pointRadius, 0, τ);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function pointLineStart(x, y) {\\n\",\n       \"\\t      context.moveTo(x, y);\\n\",\n       \"\\t      stream.point = pointLine;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function pointLine(x, y) {\\n\",\n       \"\\t      context.lineTo(x, y);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lineEnd() {\\n\",\n       \"\\t      stream.point = point;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lineEndPolygon() {\\n\",\n       \"\\t      context.closePath();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return stream;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_resample(project) {\\n\",\n       \"\\t    var δ2 = .5, cosMinDistance = Math.cos(30 * d3_radians), maxDepth = 16;\\n\",\n       \"\\t    function resample(stream) {\\n\",\n       \"\\t      return (maxDepth ? resampleRecursive : resampleNone)(stream);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function resampleNone(stream) {\\n\",\n       \"\\t      return d3_geo_transformPoint(stream, function(x, y) {\\n\",\n       \"\\t        x = project(x, y);\\n\",\n       \"\\t        stream.point(x[0], x[1]);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function resampleRecursive(stream) {\\n\",\n       \"\\t      var λ00, φ00, x00, y00, a00, b00, c00, λ0, x0, y0, a0, b0, c0;\\n\",\n       \"\\t      var resample = {\\n\",\n       \"\\t        point: point,\\n\",\n       \"\\t        lineStart: lineStart,\\n\",\n       \"\\t        lineEnd: lineEnd,\\n\",\n       \"\\t        polygonStart: function() {\\n\",\n       \"\\t          stream.polygonStart();\\n\",\n       \"\\t          resample.lineStart = ringStart;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        polygonEnd: function() {\\n\",\n       \"\\t          stream.polygonEnd();\\n\",\n       \"\\t          resample.lineStart = lineStart;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t      function point(x, y) {\\n\",\n       \"\\t        x = project(x, y);\\n\",\n       \"\\t        stream.point(x[0], x[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function lineStart() {\\n\",\n       \"\\t        x0 = NaN;\\n\",\n       \"\\t        resample.point = linePoint;\\n\",\n       \"\\t        stream.lineStart();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function linePoint(λ, φ) {\\n\",\n       \"\\t        var c = d3_geo_cartesian([ λ, φ ]), p = project(λ, φ);\\n\",\n       \"\\t        resampleLineTo(x0, y0, λ0, a0, b0, c0, x0 = p[0], y0 = p[1], λ0 = λ, a0 = c[0], b0 = c[1], c0 = c[2], maxDepth, stream);\\n\",\n       \"\\t        stream.point(x0, y0);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function lineEnd() {\\n\",\n       \"\\t        resample.point = point;\\n\",\n       \"\\t        stream.lineEnd();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ringStart() {\\n\",\n       \"\\t        lineStart();\\n\",\n       \"\\t        resample.point = ringPoint;\\n\",\n       \"\\t        resample.lineEnd = ringEnd;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ringPoint(λ, φ) {\\n\",\n       \"\\t        linePoint(λ00 = λ, φ00 = φ), x00 = x0, y00 = y0, a00 = a0, b00 = b0, c00 = c0;\\n\",\n       \"\\t        resample.point = linePoint;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function ringEnd() {\\n\",\n       \"\\t        resampleLineTo(x0, y0, λ0, a0, b0, c0, x00, y00, λ00, a00, b00, c00, maxDepth, stream);\\n\",\n       \"\\t        resample.lineEnd = lineEnd;\\n\",\n       \"\\t        lineEnd();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return resample;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function resampleLineTo(x0, y0, λ0, a0, b0, c0, x1, y1, λ1, a1, b1, c1, depth, stream) {\\n\",\n       \"\\t      var dx = x1 - x0, dy = y1 - y0, d2 = dx * dx + dy * dy;\\n\",\n       \"\\t      if (d2 > 4 * δ2 && depth--) {\\n\",\n       \"\\t        var a = a0 + a1, b = b0 + b1, c = c0 + c1, m = Math.sqrt(a * a + b * b + c * c), φ2 = Math.asin(c /= m), λ2 = abs(abs(c) - 1) < ε || abs(λ0 - λ1) < ε ? (λ0 + λ1) / 2 : Math.atan2(b, a), p = project(λ2, φ2), x2 = p[0], y2 = p[1], dx2 = x2 - x0, dy2 = y2 - y0, dz = dy * dx2 - dx * dy2;\\n\",\n       \"\\t        if (dz * dz / d2 > δ2 || abs((dx * dx2 + dy * dy2) / d2 - .5) > .3 || a0 * a1 + b0 * b1 + c0 * c1 < cosMinDistance) {\\n\",\n       \"\\t          resampleLineTo(x0, y0, λ0, a0, b0, c0, x2, y2, λ2, a /= m, b /= m, c, depth, stream);\\n\",\n       \"\\t          stream.point(x2, y2);\\n\",\n       \"\\t          resampleLineTo(x2, y2, λ2, a, b, c, x1, y1, λ1, a1, b1, c1, depth, stream);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    resample.precision = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return Math.sqrt(δ2);\\n\",\n       \"\\t      maxDepth = (δ2 = _ * _) > 0 && 16;\\n\",\n       \"\\t      return resample;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return resample;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.path = function() {\\n\",\n       \"\\t    var pointRadius = 4.5, projection, context, projectStream, contextStream, cacheStream;\\n\",\n       \"\\t    function path(object) {\\n\",\n       \"\\t      if (object) {\\n\",\n       \"\\t        if (typeof pointRadius === \\\"function\\\") contextStream.pointRadius(+pointRadius.apply(this, arguments));\\n\",\n       \"\\t        if (!cacheStream || !cacheStream.valid) cacheStream = projectStream(contextStream);\\n\",\n       \"\\t        d3.geo.stream(object, cacheStream);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return contextStream.result();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    path.area = function(object) {\\n\",\n       \"\\t      d3_geo_pathAreaSum = 0;\\n\",\n       \"\\t      d3.geo.stream(object, projectStream(d3_geo_pathArea));\\n\",\n       \"\\t      return d3_geo_pathAreaSum;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    path.centroid = function(object) {\\n\",\n       \"\\t      d3_geo_centroidX0 = d3_geo_centroidY0 = d3_geo_centroidZ0 = d3_geo_centroidX1 = d3_geo_centroidY1 = d3_geo_centroidZ1 = d3_geo_centroidX2 = d3_geo_centroidY2 = d3_geo_centroidZ2 = 0;\\n\",\n       \"\\t      d3.geo.stream(object, projectStream(d3_geo_pathCentroid));\\n\",\n       \"\\t      return d3_geo_centroidZ2 ? [ d3_geo_centroidX2 / d3_geo_centroidZ2, d3_geo_centroidY2 / d3_geo_centroidZ2 ] : d3_geo_centroidZ1 ? [ d3_geo_centroidX1 / d3_geo_centroidZ1, d3_geo_centroidY1 / d3_geo_centroidZ1 ] : d3_geo_centroidZ0 ? [ d3_geo_centroidX0 / d3_geo_centroidZ0, d3_geo_centroidY0 / d3_geo_centroidZ0 ] : [ NaN, NaN ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    path.bounds = function(object) {\\n\",\n       \"\\t      d3_geo_pathBoundsX1 = d3_geo_pathBoundsY1 = -(d3_geo_pathBoundsX0 = d3_geo_pathBoundsY0 = Infinity);\\n\",\n       \"\\t      d3.geo.stream(object, projectStream(d3_geo_pathBounds));\\n\",\n       \"\\t      return [ [ d3_geo_pathBoundsX0, d3_geo_pathBoundsY0 ], [ d3_geo_pathBoundsX1, d3_geo_pathBoundsY1 ] ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    path.projection = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return projection;\\n\",\n       \"\\t      projectStream = (projection = _) ? _.stream || d3_geo_pathProjectStream(_) : d3_identity;\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    path.context = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return context;\\n\",\n       \"\\t      contextStream = (context = _) == null ? new d3_geo_pathBuffer() : new d3_geo_pathContext(_);\\n\",\n       \"\\t      if (typeof pointRadius !== \\\"function\\\") contextStream.pointRadius(pointRadius);\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    path.pointRadius = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return pointRadius;\\n\",\n       \"\\t      pointRadius = typeof _ === \\\"function\\\" ? _ : (contextStream.pointRadius(+_), +_);\\n\",\n       \"\\t      return path;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function reset() {\\n\",\n       \"\\t      cacheStream = null;\\n\",\n       \"\\t      return path;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return path.projection(d3.geo.albersUsa()).context(null);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_pathProjectStream(project) {\\n\",\n       \"\\t    var resample = d3_geo_resample(function(x, y) {\\n\",\n       \"\\t      return project([ x * d3_degrees, y * d3_degrees ]);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return function(stream) {\\n\",\n       \"\\t      return d3_geo_projectionRadians(resample(stream));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.transform = function(methods) {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      stream: function(stream) {\\n\",\n       \"\\t        var transform = new d3_geo_transform(stream);\\n\",\n       \"\\t        for (var k in methods) transform[k] = methods[k];\\n\",\n       \"\\t        return transform;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_transform(stream) {\\n\",\n       \"\\t    this.stream = stream;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geo_transform.prototype = {\\n\",\n       \"\\t    point: function(x, y) {\\n\",\n       \"\\t      this.stream.point(x, y);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    sphere: function() {\\n\",\n       \"\\t      this.stream.sphere();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    lineStart: function() {\\n\",\n       \"\\t      this.stream.lineStart();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    lineEnd: function() {\\n\",\n       \"\\t      this.stream.lineEnd();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    polygonStart: function() {\\n\",\n       \"\\t      this.stream.polygonStart();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    polygonEnd: function() {\\n\",\n       \"\\t      this.stream.polygonEnd();\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_transformPoint(stream, point) {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      point: point,\\n\",\n       \"\\t      sphere: function() {\\n\",\n       \"\\t        stream.sphere();\\n\",\n       \"\\t      },\\n\",\n       \"\\t      lineStart: function() {\\n\",\n       \"\\t        stream.lineStart();\\n\",\n       \"\\t      },\\n\",\n       \"\\t      lineEnd: function() {\\n\",\n       \"\\t        stream.lineEnd();\\n\",\n       \"\\t      },\\n\",\n       \"\\t      polygonStart: function() {\\n\",\n       \"\\t        stream.polygonStart();\\n\",\n       \"\\t      },\\n\",\n       \"\\t      polygonEnd: function() {\\n\",\n       \"\\t        stream.polygonEnd();\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.projection = d3_geo_projection;\\n\",\n       \"\\t  d3.geo.projectionMutator = d3_geo_projectionMutator;\\n\",\n       \"\\t  function d3_geo_projection(project) {\\n\",\n       \"\\t    return d3_geo_projectionMutator(function() {\\n\",\n       \"\\t      return project;\\n\",\n       \"\\t    })();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_projectionMutator(projectAt) {\\n\",\n       \"\\t    var project, rotate, projectRotate, projectResample = d3_geo_resample(function(x, y) {\\n\",\n       \"\\t      x = project(x, y);\\n\",\n       \"\\t      return [ x[0] * k + δx, δy - x[1] * k ];\\n\",\n       \"\\t    }), k = 150, x = 480, y = 250, λ = 0, φ = 0, δλ = 0, δφ = 0, δγ = 0, δx, δy, preclip = d3_geo_clipAntimeridian, postclip = d3_identity, clipAngle = null, clipExtent = null, stream;\\n\",\n       \"\\t    function projection(point) {\\n\",\n       \"\\t      point = projectRotate(point[0] * d3_radians, point[1] * d3_radians);\\n\",\n       \"\\t      return [ point[0] * k + δx, δy - point[1] * k ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function invert(point) {\\n\",\n       \"\\t      point = projectRotate.invert((point[0] - δx) / k, (δy - point[1]) / k);\\n\",\n       \"\\t      return point && [ point[0] * d3_degrees, point[1] * d3_degrees ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    projection.stream = function(output) {\\n\",\n       \"\\t      if (stream) stream.valid = false;\\n\",\n       \"\\t      stream = d3_geo_projectionRadians(preclip(rotate, projectResample(postclip(output))));\\n\",\n       \"\\t      stream.valid = true;\\n\",\n       \"\\t      return stream;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.clipAngle = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return clipAngle;\\n\",\n       \"\\t      preclip = _ == null ? (clipAngle = _, d3_geo_clipAntimeridian) : d3_geo_clipCircle((clipAngle = +_) * d3_radians);\\n\",\n       \"\\t      return invalidate();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.clipExtent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return clipExtent;\\n\",\n       \"\\t      clipExtent = _;\\n\",\n       \"\\t      postclip = _ ? d3_geo_clipExtent(_[0][0], _[0][1], _[1][0], _[1][1]) : d3_identity;\\n\",\n       \"\\t      return invalidate();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.scale = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return k;\\n\",\n       \"\\t      k = +_;\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.translate = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ x, y ];\\n\",\n       \"\\t      x = +_[0];\\n\",\n       \"\\t      y = +_[1];\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.center = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ λ * d3_degrees, φ * d3_degrees ];\\n\",\n       \"\\t      λ = _[0] % 360 * d3_radians;\\n\",\n       \"\\t      φ = _[1] % 360 * d3_radians;\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.rotate = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ δλ * d3_degrees, δφ * d3_degrees, δγ * d3_degrees ];\\n\",\n       \"\\t      δλ = _[0] % 360 * d3_radians;\\n\",\n       \"\\t      δφ = _[1] % 360 * d3_radians;\\n\",\n       \"\\t      δγ = _.length > 2 ? _[2] % 360 * d3_radians : 0;\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3.rebind(projection, projectResample, \\\"precision\\\");\\n\",\n       \"\\t    function reset() {\\n\",\n       \"\\t      projectRotate = d3_geo_compose(rotate = d3_geo_rotation(δλ, δφ, δγ), project);\\n\",\n       \"\\t      var center = project(λ, φ);\\n\",\n       \"\\t      δx = x - center[0] * k;\\n\",\n       \"\\t      δy = y + center[1] * k;\\n\",\n       \"\\t      return invalidate();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function invalidate() {\\n\",\n       \"\\t      if (stream) stream.valid = false, stream = null;\\n\",\n       \"\\t      return projection;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return function() {\\n\",\n       \"\\t      project = projectAt.apply(this, arguments);\\n\",\n       \"\\t      projection.invert = project.invert && invert;\\n\",\n       \"\\t      return reset();\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_projectionRadians(stream) {\\n\",\n       \"\\t    return d3_geo_transformPoint(stream, function(x, y) {\\n\",\n       \"\\t      stream.point(x * d3_radians, y * d3_radians);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_equirectangular(λ, φ) {\\n\",\n       \"\\t    return [ λ, φ ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  (d3.geo.equirectangular = function() {\\n\",\n       \"\\t    return d3_geo_projection(d3_geo_equirectangular);\\n\",\n       \"\\t  }).raw = d3_geo_equirectangular.invert = d3_geo_equirectangular;\\n\",\n       \"\\t  d3.geo.rotation = function(rotate) {\\n\",\n       \"\\t    rotate = d3_geo_rotation(rotate[0] % 360 * d3_radians, rotate[1] * d3_radians, rotate.length > 2 ? rotate[2] * d3_radians : 0);\\n\",\n       \"\\t    function forward(coordinates) {\\n\",\n       \"\\t      coordinates = rotate(coordinates[0] * d3_radians, coordinates[1] * d3_radians);\\n\",\n       \"\\t      return coordinates[0] *= d3_degrees, coordinates[1] *= d3_degrees, coordinates;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    forward.invert = function(coordinates) {\\n\",\n       \"\\t      coordinates = rotate.invert(coordinates[0] * d3_radians, coordinates[1] * d3_radians);\\n\",\n       \"\\t      return coordinates[0] *= d3_degrees, coordinates[1] *= d3_degrees, coordinates;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return forward;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_identityRotation(λ, φ) {\\n\",\n       \"\\t    return [ λ > π ? λ - τ : λ < -π ? λ + τ : λ, φ ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geo_identityRotation.invert = d3_geo_equirectangular;\\n\",\n       \"\\t  function d3_geo_rotation(δλ, δφ, δγ) {\\n\",\n       \"\\t    return δλ ? δφ || δγ ? d3_geo_compose(d3_geo_rotationλ(δλ), d3_geo_rotationφγ(δφ, δγ)) : d3_geo_rotationλ(δλ) : δφ || δγ ? d3_geo_rotationφγ(δφ, δγ) : d3_geo_identityRotation;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_forwardRotationλ(δλ) {\\n\",\n       \"\\t    return function(λ, φ) {\\n\",\n       \"\\t      return λ += δλ, [ λ > π ? λ - τ : λ < -π ? λ + τ : λ, φ ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_rotationλ(δλ) {\\n\",\n       \"\\t    var rotation = d3_geo_forwardRotationλ(δλ);\\n\",\n       \"\\t    rotation.invert = d3_geo_forwardRotationλ(-δλ);\\n\",\n       \"\\t    return rotation;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_rotationφγ(δφ, δγ) {\\n\",\n       \"\\t    var cosδφ = Math.cos(δφ), sinδφ = Math.sin(δφ), cosδγ = Math.cos(δγ), sinδγ = Math.sin(δγ);\\n\",\n       \"\\t    function rotation(λ, φ) {\\n\",\n       \"\\t      var cosφ = Math.cos(φ), x = Math.cos(λ) * cosφ, y = Math.sin(λ) * cosφ, z = Math.sin(φ), k = z * cosδφ + x * sinδφ;\\n\",\n       \"\\t      return [ Math.atan2(y * cosδγ - k * sinδγ, x * cosδφ - z * sinδφ), d3_asin(k * cosδγ + y * sinδγ) ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    rotation.invert = function(λ, φ) {\\n\",\n       \"\\t      var cosφ = Math.cos(φ), x = Math.cos(λ) * cosφ, y = Math.sin(λ) * cosφ, z = Math.sin(φ), k = z * cosδγ - y * sinδγ;\\n\",\n       \"\\t      return [ Math.atan2(y * cosδγ + z * sinδγ, x * cosδφ + k * sinδφ), d3_asin(k * cosδφ - x * sinδφ) ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return rotation;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.circle = function() {\\n\",\n       \"\\t    var origin = [ 0, 0 ], angle, precision = 6, interpolate;\\n\",\n       \"\\t    function circle() {\\n\",\n       \"\\t      var center = typeof origin === \\\"function\\\" ? origin.apply(this, arguments) : origin, rotate = d3_geo_rotation(-center[0] * d3_radians, -center[1] * d3_radians, 0).invert, ring = [];\\n\",\n       \"\\t      interpolate(null, null, 1, {\\n\",\n       \"\\t        point: function(x, y) {\\n\",\n       \"\\t          ring.push(x = rotate(x, y));\\n\",\n       \"\\t          x[0] *= d3_degrees, x[1] *= d3_degrees;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        type: \\\"Polygon\\\",\\n\",\n       \"\\t        coordinates: [ ring ]\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    circle.origin = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return origin;\\n\",\n       \"\\t      origin = x;\\n\",\n       \"\\t      return circle;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    circle.angle = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return angle;\\n\",\n       \"\\t      interpolate = d3_geo_circleInterpolate((angle = +x) * d3_radians, precision * d3_radians);\\n\",\n       \"\\t      return circle;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    circle.precision = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return precision;\\n\",\n       \"\\t      interpolate = d3_geo_circleInterpolate(angle * d3_radians, (precision = +_) * d3_radians);\\n\",\n       \"\\t      return circle;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return circle.angle(90);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_circleInterpolate(radius, precision) {\\n\",\n       \"\\t    var cr = Math.cos(radius), sr = Math.sin(radius);\\n\",\n       \"\\t    return function(from, to, direction, listener) {\\n\",\n       \"\\t      var step = direction * precision;\\n\",\n       \"\\t      if (from != null) {\\n\",\n       \"\\t        from = d3_geo_circleAngle(cr, from);\\n\",\n       \"\\t        to = d3_geo_circleAngle(cr, to);\\n\",\n       \"\\t        if (direction > 0 ? from < to : from > to) from += direction * τ;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        from = radius + direction * τ;\\n\",\n       \"\\t        to = radius - .5 * step;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (var point, t = from; direction > 0 ? t > to : t < to; t -= step) {\\n\",\n       \"\\t        listener.point((point = d3_geo_spherical([ cr, -sr * Math.cos(t), -sr * Math.sin(t) ]))[0], point[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_circleAngle(cr, point) {\\n\",\n       \"\\t    var a = d3_geo_cartesian(point);\\n\",\n       \"\\t    a[0] -= cr;\\n\",\n       \"\\t    d3_geo_cartesianNormalize(a);\\n\",\n       \"\\t    var angle = d3_acos(-a[1]);\\n\",\n       \"\\t    return ((-a[2] < 0 ? -angle : angle) + 2 * Math.PI - ε) % (2 * Math.PI);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.distance = function(a, b) {\\n\",\n       \"\\t    var Δλ = (b[0] - a[0]) * d3_radians, φ0 = a[1] * d3_radians, φ1 = b[1] * d3_radians, sinΔλ = Math.sin(Δλ), cosΔλ = Math.cos(Δλ), sinφ0 = Math.sin(φ0), cosφ0 = Math.cos(φ0), sinφ1 = Math.sin(φ1), cosφ1 = Math.cos(φ1), t;\\n\",\n       \"\\t    return Math.atan2(Math.sqrt((t = cosφ1 * sinΔλ) * t + (t = cosφ0 * sinφ1 - sinφ0 * cosφ1 * cosΔλ) * t), sinφ0 * sinφ1 + cosφ0 * cosφ1 * cosΔλ);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.geo.graticule = function() {\\n\",\n       \"\\t    var x1, x0, X1, X0, y1, y0, Y1, Y0, dx = 10, dy = dx, DX = 90, DY = 360, x, y, X, Y, precision = 2.5;\\n\",\n       \"\\t    function graticule() {\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        type: \\\"MultiLineString\\\",\\n\",\n       \"\\t        coordinates: lines()\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function lines() {\\n\",\n       \"\\t      return d3.range(Math.ceil(X0 / DX) * DX, X1, DX).map(X).concat(d3.range(Math.ceil(Y0 / DY) * DY, Y1, DY).map(Y)).concat(d3.range(Math.ceil(x0 / dx) * dx, x1, dx).filter(function(x) {\\n\",\n       \"\\t        return abs(x % DX) > ε;\\n\",\n       \"\\t      }).map(x)).concat(d3.range(Math.ceil(y0 / dy) * dy, y1, dy).filter(function(y) {\\n\",\n       \"\\t        return abs(y % DY) > ε;\\n\",\n       \"\\t      }).map(y));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    graticule.lines = function() {\\n\",\n       \"\\t      return lines().map(function(coordinates) {\\n\",\n       \"\\t        return {\\n\",\n       \"\\t          type: \\\"LineString\\\",\\n\",\n       \"\\t          coordinates: coordinates\\n\",\n       \"\\t        };\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.outline = function() {\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        type: \\\"Polygon\\\",\\n\",\n       \"\\t        coordinates: [ X(X0).concat(Y(Y1).slice(1), X(X1).reverse().slice(1), Y(Y0).reverse().slice(1)) ]\\n\",\n       \"\\t      };\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.extent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return graticule.minorExtent();\\n\",\n       \"\\t      return graticule.majorExtent(_).minorExtent(_);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.majorExtent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ [ X0, Y0 ], [ X1, Y1 ] ];\\n\",\n       \"\\t      X0 = +_[0][0], X1 = +_[1][0];\\n\",\n       \"\\t      Y0 = +_[0][1], Y1 = +_[1][1];\\n\",\n       \"\\t      if (X0 > X1) _ = X0, X0 = X1, X1 = _;\\n\",\n       \"\\t      if (Y0 > Y1) _ = Y0, Y0 = Y1, Y1 = _;\\n\",\n       \"\\t      return graticule.precision(precision);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.minorExtent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ [ x0, y0 ], [ x1, y1 ] ];\\n\",\n       \"\\t      x0 = +_[0][0], x1 = +_[1][0];\\n\",\n       \"\\t      y0 = +_[0][1], y1 = +_[1][1];\\n\",\n       \"\\t      if (x0 > x1) _ = x0, x0 = x1, x1 = _;\\n\",\n       \"\\t      if (y0 > y1) _ = y0, y0 = y1, y1 = _;\\n\",\n       \"\\t      return graticule.precision(precision);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.step = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return graticule.minorStep();\\n\",\n       \"\\t      return graticule.majorStep(_).minorStep(_);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.majorStep = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ DX, DY ];\\n\",\n       \"\\t      DX = +_[0], DY = +_[1];\\n\",\n       \"\\t      return graticule;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.minorStep = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return [ dx, dy ];\\n\",\n       \"\\t      dx = +_[0], dy = +_[1];\\n\",\n       \"\\t      return graticule;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    graticule.precision = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return precision;\\n\",\n       \"\\t      precision = +_;\\n\",\n       \"\\t      x = d3_geo_graticuleX(y0, y1, 90);\\n\",\n       \"\\t      y = d3_geo_graticuleY(x0, x1, precision);\\n\",\n       \"\\t      X = d3_geo_graticuleX(Y0, Y1, 90);\\n\",\n       \"\\t      Y = d3_geo_graticuleY(X0, X1, precision);\\n\",\n       \"\\t      return graticule;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return graticule.majorExtent([ [ -180, -90 + ε ], [ 180, 90 - ε ] ]).minorExtent([ [ -180, -80 - ε ], [ 180, 80 + ε ] ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_graticuleX(y0, y1, dy) {\\n\",\n       \"\\t    var y = d3.range(y0, y1 - ε, dy).concat(y1);\\n\",\n       \"\\t    return function(x) {\\n\",\n       \"\\t      return y.map(function(y) {\\n\",\n       \"\\t        return [ x, y ];\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_graticuleY(x0, x1, dx) {\\n\",\n       \"\\t    var x = d3.range(x0, x1 - ε, dx).concat(x1);\\n\",\n       \"\\t    return function(y) {\\n\",\n       \"\\t      return x.map(function(x) {\\n\",\n       \"\\t        return [ x, y ];\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_source(d) {\\n\",\n       \"\\t    return d.source;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_target(d) {\\n\",\n       \"\\t    return d.target;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.greatArc = function() {\\n\",\n       \"\\t    var source = d3_source, source_, target = d3_target, target_;\\n\",\n       \"\\t    function greatArc() {\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        type: \\\"LineString\\\",\\n\",\n       \"\\t        coordinates: [ source_ || source.apply(this, arguments), target_ || target.apply(this, arguments) ]\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    greatArc.distance = function() {\\n\",\n       \"\\t      return d3.geo.distance(source_ || source.apply(this, arguments), target_ || target.apply(this, arguments));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    greatArc.source = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return source;\\n\",\n       \"\\t      source = _, source_ = typeof _ === \\\"function\\\" ? null : _;\\n\",\n       \"\\t      return greatArc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    greatArc.target = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return target;\\n\",\n       \"\\t      target = _, target_ = typeof _ === \\\"function\\\" ? null : _;\\n\",\n       \"\\t      return greatArc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    greatArc.precision = function() {\\n\",\n       \"\\t      return arguments.length ? greatArc : 0;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return greatArc;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.geo.interpolate = function(source, target) {\\n\",\n       \"\\t    return d3_geo_interpolate(source[0] * d3_radians, source[1] * d3_radians, target[0] * d3_radians, target[1] * d3_radians);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_interpolate(x0, y0, x1, y1) {\\n\",\n       \"\\t    var cy0 = Math.cos(y0), sy0 = Math.sin(y0), cy1 = Math.cos(y1), sy1 = Math.sin(y1), kx0 = cy0 * Math.cos(x0), ky0 = cy0 * Math.sin(x0), kx1 = cy1 * Math.cos(x1), ky1 = cy1 * Math.sin(x1), d = 2 * Math.asin(Math.sqrt(d3_haversin(y1 - y0) + cy0 * cy1 * d3_haversin(x1 - x0))), k = 1 / Math.sin(d);\\n\",\n       \"\\t    var interpolate = d ? function(t) {\\n\",\n       \"\\t      var B = Math.sin(t *= d) * k, A = Math.sin(d - t) * k, x = A * kx0 + B * kx1, y = A * ky0 + B * ky1, z = A * sy0 + B * sy1;\\n\",\n       \"\\t      return [ Math.atan2(y, x) * d3_degrees, Math.atan2(z, Math.sqrt(x * x + y * y)) * d3_degrees ];\\n\",\n       \"\\t    } : function() {\\n\",\n       \"\\t      return [ x0 * d3_degrees, y0 * d3_degrees ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    interpolate.distance = d;\\n\",\n       \"\\t    return interpolate;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geo.length = function(object) {\\n\",\n       \"\\t    d3_geo_lengthSum = 0;\\n\",\n       \"\\t    d3.geo.stream(object, d3_geo_length);\\n\",\n       \"\\t    return d3_geo_lengthSum;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geo_lengthSum;\\n\",\n       \"\\t  var d3_geo_length = {\\n\",\n       \"\\t    sphere: d3_noop,\\n\",\n       \"\\t    point: d3_noop,\\n\",\n       \"\\t    lineStart: d3_geo_lengthLineStart,\\n\",\n       \"\\t    lineEnd: d3_noop,\\n\",\n       \"\\t    polygonStart: d3_noop,\\n\",\n       \"\\t    polygonEnd: d3_noop\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_lengthLineStart() {\\n\",\n       \"\\t    var λ0, sinφ0, cosφ0;\\n\",\n       \"\\t    d3_geo_length.point = function(λ, φ) {\\n\",\n       \"\\t      λ0 = λ * d3_radians, sinφ0 = Math.sin(φ *= d3_radians), cosφ0 = Math.cos(φ);\\n\",\n       \"\\t      d3_geo_length.point = nextPoint;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3_geo_length.lineEnd = function() {\\n\",\n       \"\\t      d3_geo_length.point = d3_geo_length.lineEnd = d3_noop;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function nextPoint(λ, φ) {\\n\",\n       \"\\t      var sinφ = Math.sin(φ *= d3_radians), cosφ = Math.cos(φ), t = abs((λ *= d3_radians) - λ0), cosΔλ = Math.cos(t);\\n\",\n       \"\\t      d3_geo_lengthSum += Math.atan2(Math.sqrt((t = cosφ * Math.sin(t)) * t + (t = cosφ0 * sinφ - sinφ0 * cosφ * cosΔλ) * t), sinφ0 * sinφ + cosφ0 * cosφ * cosΔλ);\\n\",\n       \"\\t      λ0 = λ, sinφ0 = sinφ, cosφ0 = cosφ;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geo_azimuthal(scale, angle) {\\n\",\n       \"\\t    function azimuthal(λ, φ) {\\n\",\n       \"\\t      var cosλ = Math.cos(λ), cosφ = Math.cos(φ), k = scale(cosλ * cosφ);\\n\",\n       \"\\t      return [ k * cosφ * Math.sin(λ), k * Math.sin(φ) ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    azimuthal.invert = function(x, y) {\\n\",\n       \"\\t      var ρ = Math.sqrt(x * x + y * y), c = angle(ρ), sinc = Math.sin(c), cosc = Math.cos(c);\\n\",\n       \"\\t      return [ Math.atan2(x * sinc, ρ * cosc), Math.asin(ρ && y * sinc / ρ) ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return azimuthal;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geo_azimuthalEqualArea = d3_geo_azimuthal(function(cosλcosφ) {\\n\",\n       \"\\t    return Math.sqrt(2 / (1 + cosλcosφ));\\n\",\n       \"\\t  }, function(ρ) {\\n\",\n       \"\\t    return 2 * Math.asin(ρ / 2);\\n\",\n       \"\\t  });\\n\",\n       \"\\t  (d3.geo.azimuthalEqualArea = function() {\\n\",\n       \"\\t    return d3_geo_projection(d3_geo_azimuthalEqualArea);\\n\",\n       \"\\t  }).raw = d3_geo_azimuthalEqualArea;\\n\",\n       \"\\t  var d3_geo_azimuthalEquidistant = d3_geo_azimuthal(function(cosλcosφ) {\\n\",\n       \"\\t    var c = Math.acos(cosλcosφ);\\n\",\n       \"\\t    return c && c / Math.sin(c);\\n\",\n       \"\\t  }, d3_identity);\\n\",\n       \"\\t  (d3.geo.azimuthalEquidistant = function() {\\n\",\n       \"\\t    return d3_geo_projection(d3_geo_azimuthalEquidistant);\\n\",\n       \"\\t  }).raw = d3_geo_azimuthalEquidistant;\\n\",\n       \"\\t  function d3_geo_conicConformal(φ0, φ1) {\\n\",\n       \"\\t    var cosφ0 = Math.cos(φ0), t = function(φ) {\\n\",\n       \"\\t      return Math.tan(π / 4 + φ / 2);\\n\",\n       \"\\t    }, n = φ0 === φ1 ? Math.sin(φ0) : Math.log(cosφ0 / Math.cos(φ1)) / Math.log(t(φ1) / t(φ0)), F = cosφ0 * Math.pow(t(φ0), n) / n;\\n\",\n       \"\\t    if (!n) return d3_geo_mercator;\\n\",\n       \"\\t    function forward(λ, φ) {\\n\",\n       \"\\t      if (F > 0) {\\n\",\n       \"\\t        if (φ < -halfπ + ε) φ = -halfπ + ε;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        if (φ > halfπ - ε) φ = halfπ - ε;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var ρ = F / Math.pow(t(φ), n);\\n\",\n       \"\\t      return [ ρ * Math.sin(n * λ), F - ρ * Math.cos(n * λ) ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    forward.invert = function(x, y) {\\n\",\n       \"\\t      var ρ0_y = F - y, ρ = d3_sgn(n) * Math.sqrt(x * x + ρ0_y * ρ0_y);\\n\",\n       \"\\t      return [ Math.atan2(x, ρ0_y) / n, 2 * Math.atan(Math.pow(F / ρ, 1 / n)) - halfπ ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return forward;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  (d3.geo.conicConformal = function() {\\n\",\n       \"\\t    return d3_geo_conic(d3_geo_conicConformal);\\n\",\n       \"\\t  }).raw = d3_geo_conicConformal;\\n\",\n       \"\\t  function d3_geo_conicEquidistant(φ0, φ1) {\\n\",\n       \"\\t    var cosφ0 = Math.cos(φ0), n = φ0 === φ1 ? Math.sin(φ0) : (cosφ0 - Math.cos(φ1)) / (φ1 - φ0), G = cosφ0 / n + φ0;\\n\",\n       \"\\t    if (abs(n) < ε) return d3_geo_equirectangular;\\n\",\n       \"\\t    function forward(λ, φ) {\\n\",\n       \"\\t      var ρ = G - φ;\\n\",\n       \"\\t      return [ ρ * Math.sin(n * λ), G - ρ * Math.cos(n * λ) ];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    forward.invert = function(x, y) {\\n\",\n       \"\\t      var ρ0_y = G - y;\\n\",\n       \"\\t      return [ Math.atan2(x, ρ0_y) / n, G - d3_sgn(n) * Math.sqrt(x * x + ρ0_y * ρ0_y) ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return forward;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  (d3.geo.conicEquidistant = function() {\\n\",\n       \"\\t    return d3_geo_conic(d3_geo_conicEquidistant);\\n\",\n       \"\\t  }).raw = d3_geo_conicEquidistant;\\n\",\n       \"\\t  var d3_geo_gnomonic = d3_geo_azimuthal(function(cosλcosφ) {\\n\",\n       \"\\t    return 1 / cosλcosφ;\\n\",\n       \"\\t  }, Math.atan);\\n\",\n       \"\\t  (d3.geo.gnomonic = function() {\\n\",\n       \"\\t    return d3_geo_projection(d3_geo_gnomonic);\\n\",\n       \"\\t  }).raw = d3_geo_gnomonic;\\n\",\n       \"\\t  function d3_geo_mercator(λ, φ) {\\n\",\n       \"\\t    return [ λ, Math.log(Math.tan(π / 4 + φ / 2)) ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geo_mercator.invert = function(x, y) {\\n\",\n       \"\\t    return [ x, 2 * Math.atan(Math.exp(y)) - halfπ ];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geo_mercatorProjection(project) {\\n\",\n       \"\\t    var m = d3_geo_projection(project), scale = m.scale, translate = m.translate, clipExtent = m.clipExtent, clipAuto;\\n\",\n       \"\\t    m.scale = function() {\\n\",\n       \"\\t      var v = scale.apply(m, arguments);\\n\",\n       \"\\t      return v === m ? clipAuto ? m.clipExtent(null) : m : v;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    m.translate = function() {\\n\",\n       \"\\t      var v = translate.apply(m, arguments);\\n\",\n       \"\\t      return v === m ? clipAuto ? m.clipExtent(null) : m : v;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    m.clipExtent = function(_) {\\n\",\n       \"\\t      var v = clipExtent.apply(m, arguments);\\n\",\n       \"\\t      if (v === m) {\\n\",\n       \"\\t        if (clipAuto = _ == null) {\\n\",\n       \"\\t          var k = π * scale(), t = translate();\\n\",\n       \"\\t          clipExtent([ [ t[0] - k, t[1] - k ], [ t[0] + k, t[1] + k ] ]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else if (clipAuto) {\\n\",\n       \"\\t        v = null;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return v;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return m.clipExtent(null);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  (d3.geo.mercator = function() {\\n\",\n       \"\\t    return d3_geo_mercatorProjection(d3_geo_mercator);\\n\",\n       \"\\t  }).raw = d3_geo_mercator;\\n\",\n       \"\\t  var d3_geo_orthographic = d3_geo_azimuthal(function() {\\n\",\n       \"\\t    return 1;\\n\",\n       \"\\t  }, Math.asin);\\n\",\n       \"\\t  (d3.geo.orthographic = function() {\\n\",\n       \"\\t    return d3_geo_projection(d3_geo_orthographic);\\n\",\n       \"\\t  }).raw = d3_geo_orthographic;\\n\",\n       \"\\t  var d3_geo_stereographic = d3_geo_azimuthal(function(cosλcosφ) {\\n\",\n       \"\\t    return 1 / (1 + cosλcosφ);\\n\",\n       \"\\t  }, function(ρ) {\\n\",\n       \"\\t    return 2 * Math.atan(ρ);\\n\",\n       \"\\t  });\\n\",\n       \"\\t  (d3.geo.stereographic = function() {\\n\",\n       \"\\t    return d3_geo_projection(d3_geo_stereographic);\\n\",\n       \"\\t  }).raw = d3_geo_stereographic;\\n\",\n       \"\\t  function d3_geo_transverseMercator(λ, φ) {\\n\",\n       \"\\t    return [ Math.log(Math.tan(π / 4 + φ / 2)), -λ ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geo_transverseMercator.invert = function(x, y) {\\n\",\n       \"\\t    return [ -y, 2 * Math.atan(Math.exp(x)) - halfπ ];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  (d3.geo.transverseMercator = function() {\\n\",\n       \"\\t    var projection = d3_geo_mercatorProjection(d3_geo_transverseMercator), center = projection.center, rotate = projection.rotate;\\n\",\n       \"\\t    projection.center = function(_) {\\n\",\n       \"\\t      return _ ? center([ -_[1], _[0] ]) : (_ = center(), [ _[1], -_[0] ]);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    projection.rotate = function(_) {\\n\",\n       \"\\t      return _ ? rotate([ _[0], _[1], _.length > 2 ? _[2] + 90 : 90 ]) : (_ = rotate(), \\n\",\n       \"\\t      [ _[0], _[1], _[2] - 90 ]);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return rotate([ 0, 0, 90 ]);\\n\",\n       \"\\t  }).raw = d3_geo_transverseMercator;\\n\",\n       \"\\t  d3.geom = {};\\n\",\n       \"\\t  function d3_geom_pointX(d) {\\n\",\n       \"\\t    return d[0];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_pointY(d) {\\n\",\n       \"\\t    return d[1];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geom.hull = function(vertices) {\\n\",\n       \"\\t    var x = d3_geom_pointX, y = d3_geom_pointY;\\n\",\n       \"\\t    if (arguments.length) return hull(vertices);\\n\",\n       \"\\t    function hull(data) {\\n\",\n       \"\\t      if (data.length < 3) return [];\\n\",\n       \"\\t      var fx = d3_functor(x), fy = d3_functor(y), i, n = data.length, points = [], flippedPoints = [];\\n\",\n       \"\\t      for (i = 0; i < n; i++) {\\n\",\n       \"\\t        points.push([ +fx.call(this, data[i], i), +fy.call(this, data[i], i), i ]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      points.sort(d3_geom_hullOrder);\\n\",\n       \"\\t      for (i = 0; i < n; i++) flippedPoints.push([ points[i][0], -points[i][1] ]);\\n\",\n       \"\\t      var upper = d3_geom_hullUpper(points), lower = d3_geom_hullUpper(flippedPoints);\\n\",\n       \"\\t      var skipLeft = lower[0] === upper[0], skipRight = lower[lower.length - 1] === upper[upper.length - 1], polygon = [];\\n\",\n       \"\\t      for (i = upper.length - 1; i >= 0; --i) polygon.push(data[points[upper[i]][2]]);\\n\",\n       \"\\t      for (i = +skipLeft; i < lower.length - skipRight; ++i) polygon.push(data[points[lower[i]][2]]);\\n\",\n       \"\\t      return polygon;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    hull.x = function(_) {\\n\",\n       \"\\t      return arguments.length ? (x = _, hull) : x;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    hull.y = function(_) {\\n\",\n       \"\\t      return arguments.length ? (y = _, hull) : y;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return hull;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geom_hullUpper(points) {\\n\",\n       \"\\t    var n = points.length, hull = [ 0, 1 ], hs = 2;\\n\",\n       \"\\t    for (var i = 2; i < n; i++) {\\n\",\n       \"\\t      while (hs > 1 && d3_cross2d(points[hull[hs - 2]], points[hull[hs - 1]], points[i]) <= 0) --hs;\\n\",\n       \"\\t      hull[hs++] = i;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return hull.slice(0, hs);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_hullOrder(a, b) {\\n\",\n       \"\\t    return a[0] - b[0] || a[1] - b[1];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geom.polygon = function(coordinates) {\\n\",\n       \"\\t    d3_subclass(coordinates, d3_geom_polygonPrototype);\\n\",\n       \"\\t    return coordinates;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geom_polygonPrototype = d3.geom.polygon.prototype = [];\\n\",\n       \"\\t  d3_geom_polygonPrototype.area = function() {\\n\",\n       \"\\t    var i = -1, n = this.length, a, b = this[n - 1], area = 0;\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      a = b;\\n\",\n       \"\\t      b = this[i];\\n\",\n       \"\\t      area += a[1] * b[0] - a[0] * b[1];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return area * .5;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_geom_polygonPrototype.centroid = function(k) {\\n\",\n       \"\\t    var i = -1, n = this.length, x = 0, y = 0, a, b = this[n - 1], c;\\n\",\n       \"\\t    if (!arguments.length) k = -1 / (6 * this.area());\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      a = b;\\n\",\n       \"\\t      b = this[i];\\n\",\n       \"\\t      c = a[0] * b[1] - b[0] * a[1];\\n\",\n       \"\\t      x += (a[0] + b[0]) * c;\\n\",\n       \"\\t      y += (a[1] + b[1]) * c;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return [ x * k, y * k ];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_geom_polygonPrototype.clip = function(subject) {\\n\",\n       \"\\t    var input, closed = d3_geom_polygonClosed(subject), i = -1, n = this.length - d3_geom_polygonClosed(this), j, m, a = this[n - 1], b, c, d;\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      input = subject.slice();\\n\",\n       \"\\t      subject.length = 0;\\n\",\n       \"\\t      b = this[i];\\n\",\n       \"\\t      c = input[(m = input.length - closed) - 1];\\n\",\n       \"\\t      j = -1;\\n\",\n       \"\\t      while (++j < m) {\\n\",\n       \"\\t        d = input[j];\\n\",\n       \"\\t        if (d3_geom_polygonInside(d, a, b)) {\\n\",\n       \"\\t          if (!d3_geom_polygonInside(c, a, b)) {\\n\",\n       \"\\t            subject.push(d3_geom_polygonIntersect(c, d, a, b));\\n\",\n       \"\\t          }\\n\",\n       \"\\t          subject.push(d);\\n\",\n       \"\\t        } else if (d3_geom_polygonInside(c, a, b)) {\\n\",\n       \"\\t          subject.push(d3_geom_polygonIntersect(c, d, a, b));\\n\",\n       \"\\t        }\\n\",\n       \"\\t        c = d;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (closed) subject.push(subject[0]);\\n\",\n       \"\\t      a = b;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return subject;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geom_polygonInside(p, a, b) {\\n\",\n       \"\\t    return (b[0] - a[0]) * (p[1] - a[1]) < (b[1] - a[1]) * (p[0] - a[0]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_polygonIntersect(c, d, a, b) {\\n\",\n       \"\\t    var x1 = c[0], x3 = a[0], x21 = d[0] - x1, x43 = b[0] - x3, y1 = c[1], y3 = a[1], y21 = d[1] - y1, y43 = b[1] - y3, ua = (x43 * (y1 - y3) - y43 * (x1 - x3)) / (y43 * x21 - x43 * y21);\\n\",\n       \"\\t    return [ x1 + ua * x21, y1 + ua * y21 ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_polygonClosed(coordinates) {\\n\",\n       \"\\t    var a = coordinates[0], b = coordinates[coordinates.length - 1];\\n\",\n       \"\\t    return !(a[0] - b[0] || a[1] - b[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_geom_voronoiEdges, d3_geom_voronoiCells, d3_geom_voronoiBeaches, d3_geom_voronoiBeachPool = [], d3_geom_voronoiFirstCircle, d3_geom_voronoiCircles, d3_geom_voronoiCirclePool = [];\\n\",\n       \"\\t  function d3_geom_voronoiBeach() {\\n\",\n       \"\\t    d3_geom_voronoiRedBlackNode(this);\\n\",\n       \"\\t    this.edge = this.site = this.circle = null;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiCreateBeach(site) {\\n\",\n       \"\\t    var beach = d3_geom_voronoiBeachPool.pop() || new d3_geom_voronoiBeach();\\n\",\n       \"\\t    beach.site = site;\\n\",\n       \"\\t    return beach;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiDetachBeach(beach) {\\n\",\n       \"\\t    d3_geom_voronoiDetachCircle(beach);\\n\",\n       \"\\t    d3_geom_voronoiBeaches.remove(beach);\\n\",\n       \"\\t    d3_geom_voronoiBeachPool.push(beach);\\n\",\n       \"\\t    d3_geom_voronoiRedBlackNode(beach);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiRemoveBeach(beach) {\\n\",\n       \"\\t    var circle = beach.circle, x = circle.x, y = circle.cy, vertex = {\\n\",\n       \"\\t      x: x,\\n\",\n       \"\\t      y: y\\n\",\n       \"\\t    }, previous = beach.P, next = beach.N, disappearing = [ beach ];\\n\",\n       \"\\t    d3_geom_voronoiDetachBeach(beach);\\n\",\n       \"\\t    var lArc = previous;\\n\",\n       \"\\t    while (lArc.circle && abs(x - lArc.circle.x) < ε && abs(y - lArc.circle.cy) < ε) {\\n\",\n       \"\\t      previous = lArc.P;\\n\",\n       \"\\t      disappearing.unshift(lArc);\\n\",\n       \"\\t      d3_geom_voronoiDetachBeach(lArc);\\n\",\n       \"\\t      lArc = previous;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    disappearing.unshift(lArc);\\n\",\n       \"\\t    d3_geom_voronoiDetachCircle(lArc);\\n\",\n       \"\\t    var rArc = next;\\n\",\n       \"\\t    while (rArc.circle && abs(x - rArc.circle.x) < ε && abs(y - rArc.circle.cy) < ε) {\\n\",\n       \"\\t      next = rArc.N;\\n\",\n       \"\\t      disappearing.push(rArc);\\n\",\n       \"\\t      d3_geom_voronoiDetachBeach(rArc);\\n\",\n       \"\\t      rArc = next;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    disappearing.push(rArc);\\n\",\n       \"\\t    d3_geom_voronoiDetachCircle(rArc);\\n\",\n       \"\\t    var nArcs = disappearing.length, iArc;\\n\",\n       \"\\t    for (iArc = 1; iArc < nArcs; ++iArc) {\\n\",\n       \"\\t      rArc = disappearing[iArc];\\n\",\n       \"\\t      lArc = disappearing[iArc - 1];\\n\",\n       \"\\t      d3_geom_voronoiSetEdgeEnd(rArc.edge, lArc.site, rArc.site, vertex);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    lArc = disappearing[0];\\n\",\n       \"\\t    rArc = disappearing[nArcs - 1];\\n\",\n       \"\\t    rArc.edge = d3_geom_voronoiCreateEdge(lArc.site, rArc.site, null, vertex);\\n\",\n       \"\\t    d3_geom_voronoiAttachCircle(lArc);\\n\",\n       \"\\t    d3_geom_voronoiAttachCircle(rArc);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiAddBeach(site) {\\n\",\n       \"\\t    var x = site.x, directrix = site.y, lArc, rArc, dxl, dxr, node = d3_geom_voronoiBeaches._;\\n\",\n       \"\\t    while (node) {\\n\",\n       \"\\t      dxl = d3_geom_voronoiLeftBreakPoint(node, directrix) - x;\\n\",\n       \"\\t      if (dxl > ε) node = node.L; else {\\n\",\n       \"\\t        dxr = x - d3_geom_voronoiRightBreakPoint(node, directrix);\\n\",\n       \"\\t        if (dxr > ε) {\\n\",\n       \"\\t          if (!node.R) {\\n\",\n       \"\\t            lArc = node;\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          node = node.R;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (dxl > -ε) {\\n\",\n       \"\\t            lArc = node.P;\\n\",\n       \"\\t            rArc = node;\\n\",\n       \"\\t          } else if (dxr > -ε) {\\n\",\n       \"\\t            lArc = node;\\n\",\n       \"\\t            rArc = node.N;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            lArc = rArc = node;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var newArc = d3_geom_voronoiCreateBeach(site);\\n\",\n       \"\\t    d3_geom_voronoiBeaches.insert(lArc, newArc);\\n\",\n       \"\\t    if (!lArc && !rArc) return;\\n\",\n       \"\\t    if (lArc === rArc) {\\n\",\n       \"\\t      d3_geom_voronoiDetachCircle(lArc);\\n\",\n       \"\\t      rArc = d3_geom_voronoiCreateBeach(lArc.site);\\n\",\n       \"\\t      d3_geom_voronoiBeaches.insert(newArc, rArc);\\n\",\n       \"\\t      newArc.edge = rArc.edge = d3_geom_voronoiCreateEdge(lArc.site, newArc.site);\\n\",\n       \"\\t      d3_geom_voronoiAttachCircle(lArc);\\n\",\n       \"\\t      d3_geom_voronoiAttachCircle(rArc);\\n\",\n       \"\\t      return;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (!rArc) {\\n\",\n       \"\\t      newArc.edge = d3_geom_voronoiCreateEdge(lArc.site, newArc.site);\\n\",\n       \"\\t      return;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_geom_voronoiDetachCircle(lArc);\\n\",\n       \"\\t    d3_geom_voronoiDetachCircle(rArc);\\n\",\n       \"\\t    var lSite = lArc.site, ax = lSite.x, ay = lSite.y, bx = site.x - ax, by = site.y - ay, rSite = rArc.site, cx = rSite.x - ax, cy = rSite.y - ay, d = 2 * (bx * cy - by * cx), hb = bx * bx + by * by, hc = cx * cx + cy * cy, vertex = {\\n\",\n       \"\\t      x: (cy * hb - by * hc) / d + ax,\\n\",\n       \"\\t      y: (bx * hc - cx * hb) / d + ay\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3_geom_voronoiSetEdgeEnd(rArc.edge, lSite, rSite, vertex);\\n\",\n       \"\\t    newArc.edge = d3_geom_voronoiCreateEdge(lSite, site, null, vertex);\\n\",\n       \"\\t    rArc.edge = d3_geom_voronoiCreateEdge(site, rSite, null, vertex);\\n\",\n       \"\\t    d3_geom_voronoiAttachCircle(lArc);\\n\",\n       \"\\t    d3_geom_voronoiAttachCircle(rArc);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiLeftBreakPoint(arc, directrix) {\\n\",\n       \"\\t    var site = arc.site, rfocx = site.x, rfocy = site.y, pby2 = rfocy - directrix;\\n\",\n       \"\\t    if (!pby2) return rfocx;\\n\",\n       \"\\t    var lArc = arc.P;\\n\",\n       \"\\t    if (!lArc) return -Infinity;\\n\",\n       \"\\t    site = lArc.site;\\n\",\n       \"\\t    var lfocx = site.x, lfocy = site.y, plby2 = lfocy - directrix;\\n\",\n       \"\\t    if (!plby2) return lfocx;\\n\",\n       \"\\t    var hl = lfocx - rfocx, aby2 = 1 / pby2 - 1 / plby2, b = hl / plby2;\\n\",\n       \"\\t    if (aby2) return (-b + Math.sqrt(b * b - 2 * aby2 * (hl * hl / (-2 * plby2) - lfocy + plby2 / 2 + rfocy - pby2 / 2))) / aby2 + rfocx;\\n\",\n       \"\\t    return (rfocx + lfocx) / 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiRightBreakPoint(arc, directrix) {\\n\",\n       \"\\t    var rArc = arc.N;\\n\",\n       \"\\t    if (rArc) return d3_geom_voronoiLeftBreakPoint(rArc, directrix);\\n\",\n       \"\\t    var site = arc.site;\\n\",\n       \"\\t    return site.y === directrix ? site.x : Infinity;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiCell(site) {\\n\",\n       \"\\t    this.site = site;\\n\",\n       \"\\t    this.edges = [];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geom_voronoiCell.prototype.prepare = function() {\\n\",\n       \"\\t    var halfEdges = this.edges, iHalfEdge = halfEdges.length, edge;\\n\",\n       \"\\t    while (iHalfEdge--) {\\n\",\n       \"\\t      edge = halfEdges[iHalfEdge].edge;\\n\",\n       \"\\t      if (!edge.b || !edge.a) halfEdges.splice(iHalfEdge, 1);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    halfEdges.sort(d3_geom_voronoiHalfEdgeOrder);\\n\",\n       \"\\t    return halfEdges.length;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geom_voronoiCloseCells(extent) {\\n\",\n       \"\\t    var x0 = extent[0][0], x1 = extent[1][0], y0 = extent[0][1], y1 = extent[1][1], x2, y2, x3, y3, cells = d3_geom_voronoiCells, iCell = cells.length, cell, iHalfEdge, halfEdges, nHalfEdges, start, end;\\n\",\n       \"\\t    while (iCell--) {\\n\",\n       \"\\t      cell = cells[iCell];\\n\",\n       \"\\t      if (!cell || !cell.prepare()) continue;\\n\",\n       \"\\t      halfEdges = cell.edges;\\n\",\n       \"\\t      nHalfEdges = halfEdges.length;\\n\",\n       \"\\t      iHalfEdge = 0;\\n\",\n       \"\\t      while (iHalfEdge < nHalfEdges) {\\n\",\n       \"\\t        end = halfEdges[iHalfEdge].end(), x3 = end.x, y3 = end.y;\\n\",\n       \"\\t        start = halfEdges[++iHalfEdge % nHalfEdges].start(), x2 = start.x, y2 = start.y;\\n\",\n       \"\\t        if (abs(x3 - x2) > ε || abs(y3 - y2) > ε) {\\n\",\n       \"\\t          halfEdges.splice(iHalfEdge, 0, new d3_geom_voronoiHalfEdge(d3_geom_voronoiCreateBorderEdge(cell.site, end, abs(x3 - x0) < ε && y1 - y3 > ε ? {\\n\",\n       \"\\t            x: x0,\\n\",\n       \"\\t            y: abs(x2 - x0) < ε ? y2 : y1\\n\",\n       \"\\t          } : abs(y3 - y1) < ε && x1 - x3 > ε ? {\\n\",\n       \"\\t            x: abs(y2 - y1) < ε ? x2 : x1,\\n\",\n       \"\\t            y: y1\\n\",\n       \"\\t          } : abs(x3 - x1) < ε && y3 - y0 > ε ? {\\n\",\n       \"\\t            x: x1,\\n\",\n       \"\\t            y: abs(x2 - x1) < ε ? y2 : y0\\n\",\n       \"\\t          } : abs(y3 - y0) < ε && x3 - x0 > ε ? {\\n\",\n       \"\\t            x: abs(y2 - y0) < ε ? x2 : x0,\\n\",\n       \"\\t            y: y0\\n\",\n       \"\\t          } : null), cell.site, null));\\n\",\n       \"\\t          ++nHalfEdges;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiHalfEdgeOrder(a, b) {\\n\",\n       \"\\t    return b.angle - a.angle;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiCircle() {\\n\",\n       \"\\t    d3_geom_voronoiRedBlackNode(this);\\n\",\n       \"\\t    this.x = this.y = this.arc = this.site = this.cy = null;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiAttachCircle(arc) {\\n\",\n       \"\\t    var lArc = arc.P, rArc = arc.N;\\n\",\n       \"\\t    if (!lArc || !rArc) return;\\n\",\n       \"\\t    var lSite = lArc.site, cSite = arc.site, rSite = rArc.site;\\n\",\n       \"\\t    if (lSite === rSite) return;\\n\",\n       \"\\t    var bx = cSite.x, by = cSite.y, ax = lSite.x - bx, ay = lSite.y - by, cx = rSite.x - bx, cy = rSite.y - by;\\n\",\n       \"\\t    var d = 2 * (ax * cy - ay * cx);\\n\",\n       \"\\t    if (d >= -ε2) return;\\n\",\n       \"\\t    var ha = ax * ax + ay * ay, hc = cx * cx + cy * cy, x = (cy * ha - ay * hc) / d, y = (ax * hc - cx * ha) / d, cy = y + by;\\n\",\n       \"\\t    var circle = d3_geom_voronoiCirclePool.pop() || new d3_geom_voronoiCircle();\\n\",\n       \"\\t    circle.arc = arc;\\n\",\n       \"\\t    circle.site = cSite;\\n\",\n       \"\\t    circle.x = x + bx;\\n\",\n       \"\\t    circle.y = cy + Math.sqrt(x * x + y * y);\\n\",\n       \"\\t    circle.cy = cy;\\n\",\n       \"\\t    arc.circle = circle;\\n\",\n       \"\\t    var before = null, node = d3_geom_voronoiCircles._;\\n\",\n       \"\\t    while (node) {\\n\",\n       \"\\t      if (circle.y < node.y || circle.y === node.y && circle.x <= node.x) {\\n\",\n       \"\\t        if (node.L) node = node.L; else {\\n\",\n       \"\\t          before = node.P;\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        if (node.R) node = node.R; else {\\n\",\n       \"\\t          before = node;\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    d3_geom_voronoiCircles.insert(before, circle);\\n\",\n       \"\\t    if (!before) d3_geom_voronoiFirstCircle = circle;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiDetachCircle(arc) {\\n\",\n       \"\\t    var circle = arc.circle;\\n\",\n       \"\\t    if (circle) {\\n\",\n       \"\\t      if (!circle.P) d3_geom_voronoiFirstCircle = circle.N;\\n\",\n       \"\\t      d3_geom_voronoiCircles.remove(circle);\\n\",\n       \"\\t      d3_geom_voronoiCirclePool.push(circle);\\n\",\n       \"\\t      d3_geom_voronoiRedBlackNode(circle);\\n\",\n       \"\\t      arc.circle = null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiClipEdges(extent) {\\n\",\n       \"\\t    var edges = d3_geom_voronoiEdges, clip = d3_geom_clipLine(extent[0][0], extent[0][1], extent[1][0], extent[1][1]), i = edges.length, e;\\n\",\n       \"\\t    while (i--) {\\n\",\n       \"\\t      e = edges[i];\\n\",\n       \"\\t      if (!d3_geom_voronoiConnectEdge(e, extent) || !clip(e) || abs(e.a.x - e.b.x) < ε && abs(e.a.y - e.b.y) < ε) {\\n\",\n       \"\\t        e.a = e.b = null;\\n\",\n       \"\\t        edges.splice(i, 1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiConnectEdge(edge, extent) {\\n\",\n       \"\\t    var vb = edge.b;\\n\",\n       \"\\t    if (vb) return true;\\n\",\n       \"\\t    var va = edge.a, x0 = extent[0][0], x1 = extent[1][0], y0 = extent[0][1], y1 = extent[1][1], lSite = edge.l, rSite = edge.r, lx = lSite.x, ly = lSite.y, rx = rSite.x, ry = rSite.y, fx = (lx + rx) / 2, fy = (ly + ry) / 2, fm, fb;\\n\",\n       \"\\t    if (ry === ly) {\\n\",\n       \"\\t      if (fx < x0 || fx >= x1) return;\\n\",\n       \"\\t      if (lx > rx) {\\n\",\n       \"\\t        if (!va) va = {\\n\",\n       \"\\t          x: fx,\\n\",\n       \"\\t          y: y0\\n\",\n       \"\\t        }; else if (va.y >= y1) return;\\n\",\n       \"\\t        vb = {\\n\",\n       \"\\t          x: fx,\\n\",\n       \"\\t          y: y1\\n\",\n       \"\\t        };\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        if (!va) va = {\\n\",\n       \"\\t          x: fx,\\n\",\n       \"\\t          y: y1\\n\",\n       \"\\t        }; else if (va.y < y0) return;\\n\",\n       \"\\t        vb = {\\n\",\n       \"\\t          x: fx,\\n\",\n       \"\\t          y: y0\\n\",\n       \"\\t        };\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      fm = (lx - rx) / (ry - ly);\\n\",\n       \"\\t      fb = fy - fm * fx;\\n\",\n       \"\\t      if (fm < -1 || fm > 1) {\\n\",\n       \"\\t        if (lx > rx) {\\n\",\n       \"\\t          if (!va) va = {\\n\",\n       \"\\t            x: (y0 - fb) / fm,\\n\",\n       \"\\t            y: y0\\n\",\n       \"\\t          }; else if (va.y >= y1) return;\\n\",\n       \"\\t          vb = {\\n\",\n       \"\\t            x: (y1 - fb) / fm,\\n\",\n       \"\\t            y: y1\\n\",\n       \"\\t          };\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (!va) va = {\\n\",\n       \"\\t            x: (y1 - fb) / fm,\\n\",\n       \"\\t            y: y1\\n\",\n       \"\\t          }; else if (va.y < y0) return;\\n\",\n       \"\\t          vb = {\\n\",\n       \"\\t            x: (y0 - fb) / fm,\\n\",\n       \"\\t            y: y0\\n\",\n       \"\\t          };\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        if (ly < ry) {\\n\",\n       \"\\t          if (!va) va = {\\n\",\n       \"\\t            x: x0,\\n\",\n       \"\\t            y: fm * x0 + fb\\n\",\n       \"\\t          }; else if (va.x >= x1) return;\\n\",\n       \"\\t          vb = {\\n\",\n       \"\\t            x: x1,\\n\",\n       \"\\t            y: fm * x1 + fb\\n\",\n       \"\\t          };\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (!va) va = {\\n\",\n       \"\\t            x: x1,\\n\",\n       \"\\t            y: fm * x1 + fb\\n\",\n       \"\\t          }; else if (va.x < x0) return;\\n\",\n       \"\\t          vb = {\\n\",\n       \"\\t            x: x0,\\n\",\n       \"\\t            y: fm * x0 + fb\\n\",\n       \"\\t          };\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    edge.a = va;\\n\",\n       \"\\t    edge.b = vb;\\n\",\n       \"\\t    return true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiEdge(lSite, rSite) {\\n\",\n       \"\\t    this.l = lSite;\\n\",\n       \"\\t    this.r = rSite;\\n\",\n       \"\\t    this.a = this.b = null;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiCreateEdge(lSite, rSite, va, vb) {\\n\",\n       \"\\t    var edge = new d3_geom_voronoiEdge(lSite, rSite);\\n\",\n       \"\\t    d3_geom_voronoiEdges.push(edge);\\n\",\n       \"\\t    if (va) d3_geom_voronoiSetEdgeEnd(edge, lSite, rSite, va);\\n\",\n       \"\\t    if (vb) d3_geom_voronoiSetEdgeEnd(edge, rSite, lSite, vb);\\n\",\n       \"\\t    d3_geom_voronoiCells[lSite.i].edges.push(new d3_geom_voronoiHalfEdge(edge, lSite, rSite));\\n\",\n       \"\\t    d3_geom_voronoiCells[rSite.i].edges.push(new d3_geom_voronoiHalfEdge(edge, rSite, lSite));\\n\",\n       \"\\t    return edge;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiCreateBorderEdge(lSite, va, vb) {\\n\",\n       \"\\t    var edge = new d3_geom_voronoiEdge(lSite, null);\\n\",\n       \"\\t    edge.a = va;\\n\",\n       \"\\t    edge.b = vb;\\n\",\n       \"\\t    d3_geom_voronoiEdges.push(edge);\\n\",\n       \"\\t    return edge;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiSetEdgeEnd(edge, lSite, rSite, vertex) {\\n\",\n       \"\\t    if (!edge.a && !edge.b) {\\n\",\n       \"\\t      edge.a = vertex;\\n\",\n       \"\\t      edge.l = lSite;\\n\",\n       \"\\t      edge.r = rSite;\\n\",\n       \"\\t    } else if (edge.l === rSite) {\\n\",\n       \"\\t      edge.b = vertex;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      edge.a = vertex;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiHalfEdge(edge, lSite, rSite) {\\n\",\n       \"\\t    var va = edge.a, vb = edge.b;\\n\",\n       \"\\t    this.edge = edge;\\n\",\n       \"\\t    this.site = lSite;\\n\",\n       \"\\t    this.angle = rSite ? Math.atan2(rSite.y - lSite.y, rSite.x - lSite.x) : edge.l === lSite ? Math.atan2(vb.x - va.x, va.y - vb.y) : Math.atan2(va.x - vb.x, vb.y - va.y);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geom_voronoiHalfEdge.prototype = {\\n\",\n       \"\\t    start: function() {\\n\",\n       \"\\t      return this.edge.l === this.site ? this.edge.a : this.edge.b;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    end: function() {\\n\",\n       \"\\t      return this.edge.l === this.site ? this.edge.b : this.edge.a;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geom_voronoiRedBlackTree() {\\n\",\n       \"\\t    this._ = null;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiRedBlackNode(node) {\\n\",\n       \"\\t    node.U = node.C = node.L = node.R = node.P = node.N = null;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_geom_voronoiRedBlackTree.prototype = {\\n\",\n       \"\\t    insert: function(after, node) {\\n\",\n       \"\\t      var parent, grandpa, uncle;\\n\",\n       \"\\t      if (after) {\\n\",\n       \"\\t        node.P = after;\\n\",\n       \"\\t        node.N = after.N;\\n\",\n       \"\\t        if (after.N) after.N.P = node;\\n\",\n       \"\\t        after.N = node;\\n\",\n       \"\\t        if (after.R) {\\n\",\n       \"\\t          after = after.R;\\n\",\n       \"\\t          while (after.L) after = after.L;\\n\",\n       \"\\t          after.L = node;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          after.R = node;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        parent = after;\\n\",\n       \"\\t      } else if (this._) {\\n\",\n       \"\\t        after = d3_geom_voronoiRedBlackFirst(this._);\\n\",\n       \"\\t        node.P = null;\\n\",\n       \"\\t        node.N = after;\\n\",\n       \"\\t        after.P = after.L = node;\\n\",\n       \"\\t        parent = after;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        node.P = node.N = null;\\n\",\n       \"\\t        this._ = node;\\n\",\n       \"\\t        parent = null;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      node.L = node.R = null;\\n\",\n       \"\\t      node.U = parent;\\n\",\n       \"\\t      node.C = true;\\n\",\n       \"\\t      after = node;\\n\",\n       \"\\t      while (parent && parent.C) {\\n\",\n       \"\\t        grandpa = parent.U;\\n\",\n       \"\\t        if (parent === grandpa.L) {\\n\",\n       \"\\t          uncle = grandpa.R;\\n\",\n       \"\\t          if (uncle && uncle.C) {\\n\",\n       \"\\t            parent.C = uncle.C = false;\\n\",\n       \"\\t            grandpa.C = true;\\n\",\n       \"\\t            after = grandpa;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            if (after === parent.R) {\\n\",\n       \"\\t              d3_geom_voronoiRedBlackRotateLeft(this, parent);\\n\",\n       \"\\t              after = parent;\\n\",\n       \"\\t              parent = after.U;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            parent.C = false;\\n\",\n       \"\\t            grandpa.C = true;\\n\",\n       \"\\t            d3_geom_voronoiRedBlackRotateRight(this, grandpa);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          uncle = grandpa.L;\\n\",\n       \"\\t          if (uncle && uncle.C) {\\n\",\n       \"\\t            parent.C = uncle.C = false;\\n\",\n       \"\\t            grandpa.C = true;\\n\",\n       \"\\t            after = grandpa;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            if (after === parent.L) {\\n\",\n       \"\\t              d3_geom_voronoiRedBlackRotateRight(this, parent);\\n\",\n       \"\\t              after = parent;\\n\",\n       \"\\t              parent = after.U;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            parent.C = false;\\n\",\n       \"\\t            grandpa.C = true;\\n\",\n       \"\\t            d3_geom_voronoiRedBlackRotateLeft(this, grandpa);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        parent = after.U;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      this._.C = false;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    remove: function(node) {\\n\",\n       \"\\t      if (node.N) node.N.P = node.P;\\n\",\n       \"\\t      if (node.P) node.P.N = node.N;\\n\",\n       \"\\t      node.N = node.P = null;\\n\",\n       \"\\t      var parent = node.U, sibling, left = node.L, right = node.R, next, red;\\n\",\n       \"\\t      if (!left) next = right; else if (!right) next = left; else next = d3_geom_voronoiRedBlackFirst(right);\\n\",\n       \"\\t      if (parent) {\\n\",\n       \"\\t        if (parent.L === node) parent.L = next; else parent.R = next;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        this._ = next;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (left && right) {\\n\",\n       \"\\t        red = next.C;\\n\",\n       \"\\t        next.C = node.C;\\n\",\n       \"\\t        next.L = left;\\n\",\n       \"\\t        left.U = next;\\n\",\n       \"\\t        if (next !== right) {\\n\",\n       \"\\t          parent = next.U;\\n\",\n       \"\\t          next.U = node.U;\\n\",\n       \"\\t          node = next.R;\\n\",\n       \"\\t          parent.L = node;\\n\",\n       \"\\t          next.R = right;\\n\",\n       \"\\t          right.U = next;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          next.U = parent;\\n\",\n       \"\\t          parent = next;\\n\",\n       \"\\t          node = next.R;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        red = node.C;\\n\",\n       \"\\t        node = next;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (node) node.U = parent;\\n\",\n       \"\\t      if (red) return;\\n\",\n       \"\\t      if (node && node.C) {\\n\",\n       \"\\t        node.C = false;\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      do {\\n\",\n       \"\\t        if (node === this._) break;\\n\",\n       \"\\t        if (node === parent.L) {\\n\",\n       \"\\t          sibling = parent.R;\\n\",\n       \"\\t          if (sibling.C) {\\n\",\n       \"\\t            sibling.C = false;\\n\",\n       \"\\t            parent.C = true;\\n\",\n       \"\\t            d3_geom_voronoiRedBlackRotateLeft(this, parent);\\n\",\n       \"\\t            sibling = parent.R;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (sibling.L && sibling.L.C || sibling.R && sibling.R.C) {\\n\",\n       \"\\t            if (!sibling.R || !sibling.R.C) {\\n\",\n       \"\\t              sibling.L.C = false;\\n\",\n       \"\\t              sibling.C = true;\\n\",\n       \"\\t              d3_geom_voronoiRedBlackRotateRight(this, sibling);\\n\",\n       \"\\t              sibling = parent.R;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            sibling.C = parent.C;\\n\",\n       \"\\t            parent.C = sibling.R.C = false;\\n\",\n       \"\\t            d3_geom_voronoiRedBlackRotateLeft(this, parent);\\n\",\n       \"\\t            node = this._;\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          sibling = parent.L;\\n\",\n       \"\\t          if (sibling.C) {\\n\",\n       \"\\t            sibling.C = false;\\n\",\n       \"\\t            parent.C = true;\\n\",\n       \"\\t            d3_geom_voronoiRedBlackRotateRight(this, parent);\\n\",\n       \"\\t            sibling = parent.L;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (sibling.L && sibling.L.C || sibling.R && sibling.R.C) {\\n\",\n       \"\\t            if (!sibling.L || !sibling.L.C) {\\n\",\n       \"\\t              sibling.R.C = false;\\n\",\n       \"\\t              sibling.C = true;\\n\",\n       \"\\t              d3_geom_voronoiRedBlackRotateLeft(this, sibling);\\n\",\n       \"\\t              sibling = parent.L;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            sibling.C = parent.C;\\n\",\n       \"\\t            parent.C = sibling.L.C = false;\\n\",\n       \"\\t            d3_geom_voronoiRedBlackRotateRight(this, parent);\\n\",\n       \"\\t            node = this._;\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        sibling.C = true;\\n\",\n       \"\\t        node = parent;\\n\",\n       \"\\t        parent = parent.U;\\n\",\n       \"\\t      } while (!node.C);\\n\",\n       \"\\t      if (node) node.C = false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geom_voronoiRedBlackRotateLeft(tree, node) {\\n\",\n       \"\\t    var p = node, q = node.R, parent = p.U;\\n\",\n       \"\\t    if (parent) {\\n\",\n       \"\\t      if (parent.L === p) parent.L = q; else parent.R = q;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      tree._ = q;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    q.U = parent;\\n\",\n       \"\\t    p.U = q;\\n\",\n       \"\\t    p.R = q.L;\\n\",\n       \"\\t    if (p.R) p.R.U = p;\\n\",\n       \"\\t    q.L = p;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiRedBlackRotateRight(tree, node) {\\n\",\n       \"\\t    var p = node, q = node.L, parent = p.U;\\n\",\n       \"\\t    if (parent) {\\n\",\n       \"\\t      if (parent.L === p) parent.L = q; else parent.R = q;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      tree._ = q;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    q.U = parent;\\n\",\n       \"\\t    p.U = q;\\n\",\n       \"\\t    p.L = q.R;\\n\",\n       \"\\t    if (p.L) p.L.U = p;\\n\",\n       \"\\t    q.R = p;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiRedBlackFirst(node) {\\n\",\n       \"\\t    while (node.L) node = node.L;\\n\",\n       \"\\t    return node;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoi(sites, bbox) {\\n\",\n       \"\\t    var site = sites.sort(d3_geom_voronoiVertexOrder).pop(), x0, y0, circle;\\n\",\n       \"\\t    d3_geom_voronoiEdges = [];\\n\",\n       \"\\t    d3_geom_voronoiCells = new Array(sites.length);\\n\",\n       \"\\t    d3_geom_voronoiBeaches = new d3_geom_voronoiRedBlackTree();\\n\",\n       \"\\t    d3_geom_voronoiCircles = new d3_geom_voronoiRedBlackTree();\\n\",\n       \"\\t    while (true) {\\n\",\n       \"\\t      circle = d3_geom_voronoiFirstCircle;\\n\",\n       \"\\t      if (site && (!circle || site.y < circle.y || site.y === circle.y && site.x < circle.x)) {\\n\",\n       \"\\t        if (site.x !== x0 || site.y !== y0) {\\n\",\n       \"\\t          d3_geom_voronoiCells[site.i] = new d3_geom_voronoiCell(site);\\n\",\n       \"\\t          d3_geom_voronoiAddBeach(site);\\n\",\n       \"\\t          x0 = site.x, y0 = site.y;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        site = sites.pop();\\n\",\n       \"\\t      } else if (circle) {\\n\",\n       \"\\t        d3_geom_voronoiRemoveBeach(circle.arc);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (bbox) d3_geom_voronoiClipEdges(bbox), d3_geom_voronoiCloseCells(bbox);\\n\",\n       \"\\t    var diagram = {\\n\",\n       \"\\t      cells: d3_geom_voronoiCells,\\n\",\n       \"\\t      edges: d3_geom_voronoiEdges\\n\",\n       \"\\t    };\\n\",\n       \"\\t    d3_geom_voronoiBeaches = d3_geom_voronoiCircles = d3_geom_voronoiEdges = d3_geom_voronoiCells = null;\\n\",\n       \"\\t    return diagram;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_voronoiVertexOrder(a, b) {\\n\",\n       \"\\t    return b.y - a.y || b.x - a.x;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geom.voronoi = function(points) {\\n\",\n       \"\\t    var x = d3_geom_pointX, y = d3_geom_pointY, fx = x, fy = y, clipExtent = d3_geom_voronoiClipExtent;\\n\",\n       \"\\t    if (points) return voronoi(points);\\n\",\n       \"\\t    function voronoi(data) {\\n\",\n       \"\\t      var polygons = new Array(data.length), x0 = clipExtent[0][0], y0 = clipExtent[0][1], x1 = clipExtent[1][0], y1 = clipExtent[1][1];\\n\",\n       \"\\t      d3_geom_voronoi(sites(data), clipExtent).cells.forEach(function(cell, i) {\\n\",\n       \"\\t        var edges = cell.edges, site = cell.site, polygon = polygons[i] = edges.length ? edges.map(function(e) {\\n\",\n       \"\\t          var s = e.start();\\n\",\n       \"\\t          return [ s.x, s.y ];\\n\",\n       \"\\t        }) : site.x >= x0 && site.x <= x1 && site.y >= y0 && site.y <= y1 ? [ [ x0, y1 ], [ x1, y1 ], [ x1, y0 ], [ x0, y0 ] ] : [];\\n\",\n       \"\\t        polygon.point = data[i];\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return polygons;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function sites(data) {\\n\",\n       \"\\t      return data.map(function(d, i) {\\n\",\n       \"\\t        return {\\n\",\n       \"\\t          x: Math.round(fx(d, i) / ε) * ε,\\n\",\n       \"\\t          y: Math.round(fy(d, i) / ε) * ε,\\n\",\n       \"\\t          i: i\\n\",\n       \"\\t        };\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    voronoi.links = function(data) {\\n\",\n       \"\\t      return d3_geom_voronoi(sites(data)).edges.filter(function(edge) {\\n\",\n       \"\\t        return edge.l && edge.r;\\n\",\n       \"\\t      }).map(function(edge) {\\n\",\n       \"\\t        return {\\n\",\n       \"\\t          source: data[edge.l.i],\\n\",\n       \"\\t          target: data[edge.r.i]\\n\",\n       \"\\t        };\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    voronoi.triangles = function(data) {\\n\",\n       \"\\t      var triangles = [];\\n\",\n       \"\\t      d3_geom_voronoi(sites(data)).cells.forEach(function(cell, i) {\\n\",\n       \"\\t        var site = cell.site, edges = cell.edges.sort(d3_geom_voronoiHalfEdgeOrder), j = -1, m = edges.length, e0, s0, e1 = edges[m - 1].edge, s1 = e1.l === site ? e1.r : e1.l;\\n\",\n       \"\\t        while (++j < m) {\\n\",\n       \"\\t          e0 = e1;\\n\",\n       \"\\t          s0 = s1;\\n\",\n       \"\\t          e1 = edges[j].edge;\\n\",\n       \"\\t          s1 = e1.l === site ? e1.r : e1.l;\\n\",\n       \"\\t          if (i < s0.i && i < s1.i && d3_geom_voronoiTriangleArea(site, s0, s1) < 0) {\\n\",\n       \"\\t            triangles.push([ data[i], data[s0.i], data[s1.i] ]);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return triangles;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    voronoi.x = function(_) {\\n\",\n       \"\\t      return arguments.length ? (fx = d3_functor(x = _), voronoi) : x;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    voronoi.y = function(_) {\\n\",\n       \"\\t      return arguments.length ? (fy = d3_functor(y = _), voronoi) : y;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    voronoi.clipExtent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return clipExtent === d3_geom_voronoiClipExtent ? null : clipExtent;\\n\",\n       \"\\t      clipExtent = _ == null ? d3_geom_voronoiClipExtent : _;\\n\",\n       \"\\t      return voronoi;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    voronoi.size = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return clipExtent === d3_geom_voronoiClipExtent ? null : clipExtent && clipExtent[1];\\n\",\n       \"\\t      return voronoi.clipExtent(_ && [ [ 0, 0 ], _ ]);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return voronoi;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_geom_voronoiClipExtent = [ [ -1e6, -1e6 ], [ 1e6, 1e6 ] ];\\n\",\n       \"\\t  function d3_geom_voronoiTriangleArea(a, b, c) {\\n\",\n       \"\\t    return (a.x - c.x) * (b.y - a.y) - (a.x - b.x) * (c.y - a.y);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.geom.delaunay = function(vertices) {\\n\",\n       \"\\t    return d3.geom.voronoi().triangles(vertices);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.geom.quadtree = function(points, x1, y1, x2, y2) {\\n\",\n       \"\\t    var x = d3_geom_pointX, y = d3_geom_pointY, compat;\\n\",\n       \"\\t    if (compat = arguments.length) {\\n\",\n       \"\\t      x = d3_geom_quadtreeCompatX;\\n\",\n       \"\\t      y = d3_geom_quadtreeCompatY;\\n\",\n       \"\\t      if (compat === 3) {\\n\",\n       \"\\t        y2 = y1;\\n\",\n       \"\\t        x2 = x1;\\n\",\n       \"\\t        y1 = x1 = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return quadtree(points);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function quadtree(data) {\\n\",\n       \"\\t      var d, fx = d3_functor(x), fy = d3_functor(y), xs, ys, i, n, x1_, y1_, x2_, y2_;\\n\",\n       \"\\t      if (x1 != null) {\\n\",\n       \"\\t        x1_ = x1, y1_ = y1, x2_ = x2, y2_ = y2;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        x2_ = y2_ = -(x1_ = y1_ = Infinity);\\n\",\n       \"\\t        xs = [], ys = [];\\n\",\n       \"\\t        n = data.length;\\n\",\n       \"\\t        if (compat) for (i = 0; i < n; ++i) {\\n\",\n       \"\\t          d = data[i];\\n\",\n       \"\\t          if (d.x < x1_) x1_ = d.x;\\n\",\n       \"\\t          if (d.y < y1_) y1_ = d.y;\\n\",\n       \"\\t          if (d.x > x2_) x2_ = d.x;\\n\",\n       \"\\t          if (d.y > y2_) y2_ = d.y;\\n\",\n       \"\\t          xs.push(d.x);\\n\",\n       \"\\t          ys.push(d.y);\\n\",\n       \"\\t        } else for (i = 0; i < n; ++i) {\\n\",\n       \"\\t          var x_ = +fx(d = data[i], i), y_ = +fy(d, i);\\n\",\n       \"\\t          if (x_ < x1_) x1_ = x_;\\n\",\n       \"\\t          if (y_ < y1_) y1_ = y_;\\n\",\n       \"\\t          if (x_ > x2_) x2_ = x_;\\n\",\n       \"\\t          if (y_ > y2_) y2_ = y_;\\n\",\n       \"\\t          xs.push(x_);\\n\",\n       \"\\t          ys.push(y_);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var dx = x2_ - x1_, dy = y2_ - y1_;\\n\",\n       \"\\t      if (dx > dy) y2_ = y1_ + dx; else x2_ = x1_ + dy;\\n\",\n       \"\\t      function insert(n, d, x, y, x1, y1, x2, y2) {\\n\",\n       \"\\t        if (isNaN(x) || isNaN(y)) return;\\n\",\n       \"\\t        if (n.leaf) {\\n\",\n       \"\\t          var nx = n.x, ny = n.y;\\n\",\n       \"\\t          if (nx != null) {\\n\",\n       \"\\t            if (abs(nx - x) + abs(ny - y) < .01) {\\n\",\n       \"\\t              insertChild(n, d, x, y, x1, y1, x2, y2);\\n\",\n       \"\\t            } else {\\n\",\n       \"\\t              var nPoint = n.point;\\n\",\n       \"\\t              n.x = n.y = n.point = null;\\n\",\n       \"\\t              insertChild(n, nPoint, nx, ny, x1, y1, x2, y2);\\n\",\n       \"\\t              insertChild(n, d, x, y, x1, y1, x2, y2);\\n\",\n       \"\\t            }\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            n.x = x, n.y = y, n.point = d;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          insertChild(n, d, x, y, x1, y1, x2, y2);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function insertChild(n, d, x, y, x1, y1, x2, y2) {\\n\",\n       \"\\t        var xm = (x1 + x2) * .5, ym = (y1 + y2) * .5, right = x >= xm, below = y >= ym, i = below << 1 | right;\\n\",\n       \"\\t        n.leaf = false;\\n\",\n       \"\\t        n = n.nodes[i] || (n.nodes[i] = d3_geom_quadtreeNode());\\n\",\n       \"\\t        if (right) x1 = xm; else x2 = xm;\\n\",\n       \"\\t        if (below) y1 = ym; else y2 = ym;\\n\",\n       \"\\t        insert(n, d, x, y, x1, y1, x2, y2);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var root = d3_geom_quadtreeNode();\\n\",\n       \"\\t      root.add = function(d) {\\n\",\n       \"\\t        insert(root, d, +fx(d, ++i), +fy(d, i), x1_, y1_, x2_, y2_);\\n\",\n       \"\\t      };\\n\",\n       \"\\t      root.visit = function(f) {\\n\",\n       \"\\t        d3_geom_quadtreeVisit(f, root, x1_, y1_, x2_, y2_);\\n\",\n       \"\\t      };\\n\",\n       \"\\t      root.find = function(point) {\\n\",\n       \"\\t        return d3_geom_quadtreeFind(root, point[0], point[1], x1_, y1_, x2_, y2_);\\n\",\n       \"\\t      };\\n\",\n       \"\\t      i = -1;\\n\",\n       \"\\t      if (x1 == null) {\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          insert(root, data[i], xs[i], ys[i], x1_, y1_, x2_, y2_);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        --i;\\n\",\n       \"\\t      } else data.forEach(root.add);\\n\",\n       \"\\t      xs = ys = data = d = null;\\n\",\n       \"\\t      return root;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    quadtree.x = function(_) {\\n\",\n       \"\\t      return arguments.length ? (x = _, quadtree) : x;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    quadtree.y = function(_) {\\n\",\n       \"\\t      return arguments.length ? (y = _, quadtree) : y;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    quadtree.extent = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return x1 == null ? null : [ [ x1, y1 ], [ x2, y2 ] ];\\n\",\n       \"\\t      if (_ == null) x1 = y1 = x2 = y2 = null; else x1 = +_[0][0], y1 = +_[0][1], x2 = +_[1][0], \\n\",\n       \"\\t      y2 = +_[1][1];\\n\",\n       \"\\t      return quadtree;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    quadtree.size = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return x1 == null ? null : [ x2 - x1, y2 - y1 ];\\n\",\n       \"\\t      if (_ == null) x1 = y1 = x2 = y2 = null; else x1 = y1 = 0, x2 = +_[0], y2 = +_[1];\\n\",\n       \"\\t      return quadtree;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return quadtree;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_geom_quadtreeCompatX(d) {\\n\",\n       \"\\t    return d.x;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_quadtreeCompatY(d) {\\n\",\n       \"\\t    return d.y;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_quadtreeNode() {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      leaf: true,\\n\",\n       \"\\t      nodes: [],\\n\",\n       \"\\t      point: null,\\n\",\n       \"\\t      x: null,\\n\",\n       \"\\t      y: null\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_quadtreeVisit(f, node, x1, y1, x2, y2) {\\n\",\n       \"\\t    if (!f(node, x1, y1, x2, y2)) {\\n\",\n       \"\\t      var sx = (x1 + x2) * .5, sy = (y1 + y2) * .5, children = node.nodes;\\n\",\n       \"\\t      if (children[0]) d3_geom_quadtreeVisit(f, children[0], x1, y1, sx, sy);\\n\",\n       \"\\t      if (children[1]) d3_geom_quadtreeVisit(f, children[1], sx, y1, x2, sy);\\n\",\n       \"\\t      if (children[2]) d3_geom_quadtreeVisit(f, children[2], x1, sy, sx, y2);\\n\",\n       \"\\t      if (children[3]) d3_geom_quadtreeVisit(f, children[3], sx, sy, x2, y2);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_geom_quadtreeFind(root, x, y, x0, y0, x3, y3) {\\n\",\n       \"\\t    var minDistance2 = Infinity, closestPoint;\\n\",\n       \"\\t    (function find(node, x1, y1, x2, y2) {\\n\",\n       \"\\t      if (x1 > x3 || y1 > y3 || x2 < x0 || y2 < y0) return;\\n\",\n       \"\\t      if (point = node.point) {\\n\",\n       \"\\t        var point, dx = x - node.x, dy = y - node.y, distance2 = dx * dx + dy * dy;\\n\",\n       \"\\t        if (distance2 < minDistance2) {\\n\",\n       \"\\t          var distance = Math.sqrt(minDistance2 = distance2);\\n\",\n       \"\\t          x0 = x - distance, y0 = y - distance;\\n\",\n       \"\\t          x3 = x + distance, y3 = y + distance;\\n\",\n       \"\\t          closestPoint = point;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var children = node.nodes, xm = (x1 + x2) * .5, ym = (y1 + y2) * .5, right = x >= xm, below = y >= ym;\\n\",\n       \"\\t      for (var i = below << 1 | right, j = i + 4; i < j; ++i) {\\n\",\n       \"\\t        if (node = children[i & 3]) switch (i & 3) {\\n\",\n       \"\\t         case 0:\\n\",\n       \"\\t          find(node, x1, y1, xm, ym);\\n\",\n       \"\\t          break;\\n\",\n       \"\\t\\n\",\n       \"\\t         case 1:\\n\",\n       \"\\t          find(node, xm, y1, x2, ym);\\n\",\n       \"\\t          break;\\n\",\n       \"\\t\\n\",\n       \"\\t         case 2:\\n\",\n       \"\\t          find(node, x1, ym, xm, y2);\\n\",\n       \"\\t          break;\\n\",\n       \"\\t\\n\",\n       \"\\t         case 3:\\n\",\n       \"\\t          find(node, xm, ym, x2, y2);\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    })(root, x0, y0, x3, y3);\\n\",\n       \"\\t    return closestPoint;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateRgb = d3_interpolateRgb;\\n\",\n       \"\\t  function d3_interpolateRgb(a, b) {\\n\",\n       \"\\t    a = d3.rgb(a);\\n\",\n       \"\\t    b = d3.rgb(b);\\n\",\n       \"\\t    var ar = a.r, ag = a.g, ab = a.b, br = b.r - ar, bg = b.g - ag, bb = b.b - ab;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return \\\"#\\\" + d3_rgb_hex(Math.round(ar + br * t)) + d3_rgb_hex(Math.round(ag + bg * t)) + d3_rgb_hex(Math.round(ab + bb * t));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateObject = d3_interpolateObject;\\n\",\n       \"\\t  function d3_interpolateObject(a, b) {\\n\",\n       \"\\t    var i = {}, c = {}, k;\\n\",\n       \"\\t    for (k in a) {\\n\",\n       \"\\t      if (k in b) {\\n\",\n       \"\\t        i[k] = d3_interpolate(a[k], b[k]);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        c[k] = a[k];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    for (k in b) {\\n\",\n       \"\\t      if (!(k in a)) {\\n\",\n       \"\\t        c[k] = b[k];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      for (k in i) c[k] = i[k](t);\\n\",\n       \"\\t      return c;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateNumber = d3_interpolateNumber;\\n\",\n       \"\\t  function d3_interpolateNumber(a, b) {\\n\",\n       \"\\t    a = +a, b = +b;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return a * (1 - t) + b * t;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateString = d3_interpolateString;\\n\",\n       \"\\t  function d3_interpolateString(a, b) {\\n\",\n       \"\\t    var bi = d3_interpolate_numberA.lastIndex = d3_interpolate_numberB.lastIndex = 0, am, bm, bs, i = -1, s = [], q = [];\\n\",\n       \"\\t    a = a + \\\"\\\", b = b + \\\"\\\";\\n\",\n       \"\\t    while ((am = d3_interpolate_numberA.exec(a)) && (bm = d3_interpolate_numberB.exec(b))) {\\n\",\n       \"\\t      if ((bs = bm.index) > bi) {\\n\",\n       \"\\t        bs = b.slice(bi, bs);\\n\",\n       \"\\t        if (s[i]) s[i] += bs; else s[++i] = bs;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if ((am = am[0]) === (bm = bm[0])) {\\n\",\n       \"\\t        if (s[i]) s[i] += bm; else s[++i] = bm;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        s[++i] = null;\\n\",\n       \"\\t        q.push({\\n\",\n       \"\\t          i: i,\\n\",\n       \"\\t          x: d3_interpolateNumber(am, bm)\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t      bi = d3_interpolate_numberB.lastIndex;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (bi < b.length) {\\n\",\n       \"\\t      bs = b.slice(bi);\\n\",\n       \"\\t      if (s[i]) s[i] += bs; else s[++i] = bs;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return s.length < 2 ? q[0] ? (b = q[0].x, function(t) {\\n\",\n       \"\\t      return b(t) + \\\"\\\";\\n\",\n       \"\\t    }) : function() {\\n\",\n       \"\\t      return b;\\n\",\n       \"\\t    } : (b = q.length, function(t) {\\n\",\n       \"\\t      for (var i = 0, o; i < b; ++i) s[(o = q[i]).i] = o.x(t);\\n\",\n       \"\\t      return s.join(\\\"\\\");\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_interpolate_numberA = /[-+]?(?:\\\\d+\\\\.?\\\\d*|\\\\.?\\\\d+)(?:[eE][-+]?\\\\d+)?/g, d3_interpolate_numberB = new RegExp(d3_interpolate_numberA.source, \\\"g\\\");\\n\",\n       \"\\t  d3.interpolate = d3_interpolate;\\n\",\n       \"\\t  function d3_interpolate(a, b) {\\n\",\n       \"\\t    var i = d3.interpolators.length, f;\\n\",\n       \"\\t    while (--i >= 0 && !(f = d3.interpolators[i](a, b))) ;\\n\",\n       \"\\t    return f;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolators = [ function(a, b) {\\n\",\n       \"\\t    var t = typeof b;\\n\",\n       \"\\t    return (t === \\\"string\\\" ? d3_rgb_names.has(b.toLowerCase()) || /^(#|rgb\\\\(|hsl\\\\()/i.test(b) ? d3_interpolateRgb : d3_interpolateString : b instanceof d3_color ? d3_interpolateRgb : Array.isArray(b) ? d3_interpolateArray : t === \\\"object\\\" && isNaN(b) ? d3_interpolateObject : d3_interpolateNumber)(a, b);\\n\",\n       \"\\t  } ];\\n\",\n       \"\\t  d3.interpolateArray = d3_interpolateArray;\\n\",\n       \"\\t  function d3_interpolateArray(a, b) {\\n\",\n       \"\\t    var x = [], c = [], na = a.length, nb = b.length, n0 = Math.min(a.length, b.length), i;\\n\",\n       \"\\t    for (i = 0; i < n0; ++i) x.push(d3_interpolate(a[i], b[i]));\\n\",\n       \"\\t    for (;i < na; ++i) c[i] = a[i];\\n\",\n       \"\\t    for (;i < nb; ++i) c[i] = b[i];\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      for (i = 0; i < n0; ++i) c[i] = x[i](t);\\n\",\n       \"\\t      return c;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_ease_default = function() {\\n\",\n       \"\\t    return d3_identity;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_ease = d3.map({\\n\",\n       \"\\t    linear: d3_ease_default,\\n\",\n       \"\\t    poly: d3_ease_poly,\\n\",\n       \"\\t    quad: function() {\\n\",\n       \"\\t      return d3_ease_quad;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    cubic: function() {\\n\",\n       \"\\t      return d3_ease_cubic;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    sin: function() {\\n\",\n       \"\\t      return d3_ease_sin;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    exp: function() {\\n\",\n       \"\\t      return d3_ease_exp;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    circle: function() {\\n\",\n       \"\\t      return d3_ease_circle;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    elastic: d3_ease_elastic,\\n\",\n       \"\\t    back: d3_ease_back,\\n\",\n       \"\\t    bounce: function() {\\n\",\n       \"\\t      return d3_ease_bounce;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  var d3_ease_mode = d3.map({\\n\",\n       \"\\t    \\\"in\\\": d3_identity,\\n\",\n       \"\\t    out: d3_ease_reverse,\\n\",\n       \"\\t    \\\"in-out\\\": d3_ease_reflect,\\n\",\n       \"\\t    \\\"out-in\\\": function(f) {\\n\",\n       \"\\t      return d3_ease_reflect(d3_ease_reverse(f));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3.ease = function(name) {\\n\",\n       \"\\t    var i = name.indexOf(\\\"-\\\"), t = i >= 0 ? name.slice(0, i) : name, m = i >= 0 ? name.slice(i + 1) : \\\"in\\\";\\n\",\n       \"\\t    t = d3_ease.get(t) || d3_ease_default;\\n\",\n       \"\\t    m = d3_ease_mode.get(m) || d3_identity;\\n\",\n       \"\\t    return d3_ease_clamp(m(t.apply(null, d3_arraySlice.call(arguments, 1))));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_ease_clamp(f) {\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return t <= 0 ? 0 : t >= 1 ? 1 : f(t);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_reverse(f) {\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return 1 - f(1 - t);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_reflect(f) {\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return .5 * (t < .5 ? f(2 * t) : 2 - f(2 - 2 * t));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_quad(t) {\\n\",\n       \"\\t    return t * t;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_cubic(t) {\\n\",\n       \"\\t    return t * t * t;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_cubicInOut(t) {\\n\",\n       \"\\t    if (t <= 0) return 0;\\n\",\n       \"\\t    if (t >= 1) return 1;\\n\",\n       \"\\t    var t2 = t * t, t3 = t2 * t;\\n\",\n       \"\\t    return 4 * (t < .5 ? t3 : 3 * (t - t2) + t3 - .75);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_poly(e) {\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return Math.pow(t, e);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_sin(t) {\\n\",\n       \"\\t    return 1 - Math.cos(t * halfπ);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_exp(t) {\\n\",\n       \"\\t    return Math.pow(2, 10 * (t - 1));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_circle(t) {\\n\",\n       \"\\t    return 1 - Math.sqrt(1 - t * t);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_elastic(a, p) {\\n\",\n       \"\\t    var s;\\n\",\n       \"\\t    if (arguments.length < 2) p = .45;\\n\",\n       \"\\t    if (arguments.length) s = p / τ * Math.asin(1 / a); else a = 1, s = p / 4;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return 1 + a * Math.pow(2, -10 * t) * Math.sin((t - s) * τ / p);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_back(s) {\\n\",\n       \"\\t    if (!s) s = 1.70158;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return t * t * ((s + 1) * t - s);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_ease_bounce(t) {\\n\",\n       \"\\t    return t < 1 / 2.75 ? 7.5625 * t * t : t < 2 / 2.75 ? 7.5625 * (t -= 1.5 / 2.75) * t + .75 : t < 2.5 / 2.75 ? 7.5625 * (t -= 2.25 / 2.75) * t + .9375 : 7.5625 * (t -= 2.625 / 2.75) * t + .984375;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateHcl = d3_interpolateHcl;\\n\",\n       \"\\t  function d3_interpolateHcl(a, b) {\\n\",\n       \"\\t    a = d3.hcl(a);\\n\",\n       \"\\t    b = d3.hcl(b);\\n\",\n       \"\\t    var ah = a.h, ac = a.c, al = a.l, bh = b.h - ah, bc = b.c - ac, bl = b.l - al;\\n\",\n       \"\\t    if (isNaN(bc)) bc = 0, ac = isNaN(ac) ? b.c : ac;\\n\",\n       \"\\t    if (isNaN(bh)) bh = 0, ah = isNaN(ah) ? b.h : ah; else if (bh > 180) bh -= 360; else if (bh < -180) bh += 360;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return d3_hcl_lab(ah + bh * t, ac + bc * t, al + bl * t) + \\\"\\\";\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateHsl = d3_interpolateHsl;\\n\",\n       \"\\t  function d3_interpolateHsl(a, b) {\\n\",\n       \"\\t    a = d3.hsl(a);\\n\",\n       \"\\t    b = d3.hsl(b);\\n\",\n       \"\\t    var ah = a.h, as = a.s, al = a.l, bh = b.h - ah, bs = b.s - as, bl = b.l - al;\\n\",\n       \"\\t    if (isNaN(bs)) bs = 0, as = isNaN(as) ? b.s : as;\\n\",\n       \"\\t    if (isNaN(bh)) bh = 0, ah = isNaN(ah) ? b.h : ah; else if (bh > 180) bh -= 360; else if (bh < -180) bh += 360;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return d3_hsl_rgb(ah + bh * t, as + bs * t, al + bl * t) + \\\"\\\";\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateLab = d3_interpolateLab;\\n\",\n       \"\\t  function d3_interpolateLab(a, b) {\\n\",\n       \"\\t    a = d3.lab(a);\\n\",\n       \"\\t    b = d3.lab(b);\\n\",\n       \"\\t    var al = a.l, aa = a.a, ab = a.b, bl = b.l - al, ba = b.a - aa, bb = b.b - ab;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return d3_lab_rgb(al + bl * t, aa + ba * t, ab + bb * t) + \\\"\\\";\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.interpolateRound = d3_interpolateRound;\\n\",\n       \"\\t  function d3_interpolateRound(a, b) {\\n\",\n       \"\\t    b -= a;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      return Math.round(a + b * t);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.transform = function(string) {\\n\",\n       \"\\t    var g = d3_document.createElementNS(d3.ns.prefix.svg, \\\"g\\\");\\n\",\n       \"\\t    return (d3.transform = function(string) {\\n\",\n       \"\\t      if (string != null) {\\n\",\n       \"\\t        g.setAttribute(\\\"transform\\\", string);\\n\",\n       \"\\t        var t = g.transform.baseVal.consolidate();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return new d3_transform(t ? t.matrix : d3_transformIdentity);\\n\",\n       \"\\t    })(string);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_transform(m) {\\n\",\n       \"\\t    var r0 = [ m.a, m.b ], r1 = [ m.c, m.d ], kx = d3_transformNormalize(r0), kz = d3_transformDot(r0, r1), ky = d3_transformNormalize(d3_transformCombine(r1, r0, -kz)) || 0;\\n\",\n       \"\\t    if (r0[0] * r1[1] < r1[0] * r0[1]) {\\n\",\n       \"\\t      r0[0] *= -1;\\n\",\n       \"\\t      r0[1] *= -1;\\n\",\n       \"\\t      kx *= -1;\\n\",\n       \"\\t      kz *= -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    this.rotate = (kx ? Math.atan2(r0[1], r0[0]) : Math.atan2(-r1[0], r1[1])) * d3_degrees;\\n\",\n       \"\\t    this.translate = [ m.e, m.f ];\\n\",\n       \"\\t    this.scale = [ kx, ky ];\\n\",\n       \"\\t    this.skew = ky ? Math.atan2(kz, ky) * d3_degrees : 0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_transform.prototype.toString = function() {\\n\",\n       \"\\t    return \\\"translate(\\\" + this.translate + \\\")rotate(\\\" + this.rotate + \\\")skewX(\\\" + this.skew + \\\")scale(\\\" + this.scale + \\\")\\\";\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_transformDot(a, b) {\\n\",\n       \"\\t    return a[0] * b[0] + a[1] * b[1];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_transformNormalize(a) {\\n\",\n       \"\\t    var k = Math.sqrt(d3_transformDot(a, a));\\n\",\n       \"\\t    if (k) {\\n\",\n       \"\\t      a[0] /= k;\\n\",\n       \"\\t      a[1] /= k;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return k;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_transformCombine(a, b, k) {\\n\",\n       \"\\t    a[0] += k * b[0];\\n\",\n       \"\\t    a[1] += k * b[1];\\n\",\n       \"\\t    return a;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_transformIdentity = {\\n\",\n       \"\\t    a: 1,\\n\",\n       \"\\t    b: 0,\\n\",\n       \"\\t    c: 0,\\n\",\n       \"\\t    d: 1,\\n\",\n       \"\\t    e: 0,\\n\",\n       \"\\t    f: 0\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.interpolateTransform = d3_interpolateTransform;\\n\",\n       \"\\t  function d3_interpolateTransformPop(s) {\\n\",\n       \"\\t    return s.length ? s.pop() + \\\",\\\" : \\\"\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_interpolateTranslate(ta, tb, s, q) {\\n\",\n       \"\\t    if (ta[0] !== tb[0] || ta[1] !== tb[1]) {\\n\",\n       \"\\t      var i = s.push(\\\"translate(\\\", null, \\\",\\\", null, \\\")\\\");\\n\",\n       \"\\t      q.push({\\n\",\n       \"\\t        i: i - 4,\\n\",\n       \"\\t        x: d3_interpolateNumber(ta[0], tb[0])\\n\",\n       \"\\t      }, {\\n\",\n       \"\\t        i: i - 2,\\n\",\n       \"\\t        x: d3_interpolateNumber(ta[1], tb[1])\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else if (tb[0] || tb[1]) {\\n\",\n       \"\\t      s.push(\\\"translate(\\\" + tb + \\\")\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_interpolateRotate(ra, rb, s, q) {\\n\",\n       \"\\t    if (ra !== rb) {\\n\",\n       \"\\t      if (ra - rb > 180) rb += 360; else if (rb - ra > 180) ra += 360;\\n\",\n       \"\\t      q.push({\\n\",\n       \"\\t        i: s.push(d3_interpolateTransformPop(s) + \\\"rotate(\\\", null, \\\")\\\") - 2,\\n\",\n       \"\\t        x: d3_interpolateNumber(ra, rb)\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else if (rb) {\\n\",\n       \"\\t      s.push(d3_interpolateTransformPop(s) + \\\"rotate(\\\" + rb + \\\")\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_interpolateSkew(wa, wb, s, q) {\\n\",\n       \"\\t    if (wa !== wb) {\\n\",\n       \"\\t      q.push({\\n\",\n       \"\\t        i: s.push(d3_interpolateTransformPop(s) + \\\"skewX(\\\", null, \\\")\\\") - 2,\\n\",\n       \"\\t        x: d3_interpolateNumber(wa, wb)\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else if (wb) {\\n\",\n       \"\\t      s.push(d3_interpolateTransformPop(s) + \\\"skewX(\\\" + wb + \\\")\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_interpolateScale(ka, kb, s, q) {\\n\",\n       \"\\t    if (ka[0] !== kb[0] || ka[1] !== kb[1]) {\\n\",\n       \"\\t      var i = s.push(d3_interpolateTransformPop(s) + \\\"scale(\\\", null, \\\",\\\", null, \\\")\\\");\\n\",\n       \"\\t      q.push({\\n\",\n       \"\\t        i: i - 4,\\n\",\n       \"\\t        x: d3_interpolateNumber(ka[0], kb[0])\\n\",\n       \"\\t      }, {\\n\",\n       \"\\t        i: i - 2,\\n\",\n       \"\\t        x: d3_interpolateNumber(ka[1], kb[1])\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else if (kb[0] !== 1 || kb[1] !== 1) {\\n\",\n       \"\\t      s.push(d3_interpolateTransformPop(s) + \\\"scale(\\\" + kb + \\\")\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_interpolateTransform(a, b) {\\n\",\n       \"\\t    var s = [], q = [];\\n\",\n       \"\\t    a = d3.transform(a), b = d3.transform(b);\\n\",\n       \"\\t    d3_interpolateTranslate(a.translate, b.translate, s, q);\\n\",\n       \"\\t    d3_interpolateRotate(a.rotate, b.rotate, s, q);\\n\",\n       \"\\t    d3_interpolateSkew(a.skew, b.skew, s, q);\\n\",\n       \"\\t    d3_interpolateScale(a.scale, b.scale, s, q);\\n\",\n       \"\\t    a = b = null;\\n\",\n       \"\\t    return function(t) {\\n\",\n       \"\\t      var i = -1, n = q.length, o;\\n\",\n       \"\\t      while (++i < n) s[(o = q[i]).i] = o.x(t);\\n\",\n       \"\\t      return s.join(\\\"\\\");\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_uninterpolateNumber(a, b) {\\n\",\n       \"\\t    b = (b -= a = +a) || 1 / b;\\n\",\n       \"\\t    return function(x) {\\n\",\n       \"\\t      return (x - a) / b;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_uninterpolateClamp(a, b) {\\n\",\n       \"\\t    b = (b -= a = +a) || 1 / b;\\n\",\n       \"\\t    return function(x) {\\n\",\n       \"\\t      return Math.max(0, Math.min(1, (x - a) / b));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout = {};\\n\",\n       \"\\t  d3.layout.bundle = function() {\\n\",\n       \"\\t    return function(links) {\\n\",\n       \"\\t      var paths = [], i = -1, n = links.length;\\n\",\n       \"\\t      while (++i < n) paths.push(d3_layout_bundlePath(links[i]));\\n\",\n       \"\\t      return paths;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_bundlePath(link) {\\n\",\n       \"\\t    var start = link.source, end = link.target, lca = d3_layout_bundleLeastCommonAncestor(start, end), points = [ start ];\\n\",\n       \"\\t    while (start !== lca) {\\n\",\n       \"\\t      start = start.parent;\\n\",\n       \"\\t      points.push(start);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var k = points.length;\\n\",\n       \"\\t    while (end !== lca) {\\n\",\n       \"\\t      points.splice(k, 0, end);\\n\",\n       \"\\t      end = end.parent;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return points;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_bundleAncestors(node) {\\n\",\n       \"\\t    var ancestors = [], parent = node.parent;\\n\",\n       \"\\t    while (parent != null) {\\n\",\n       \"\\t      ancestors.push(node);\\n\",\n       \"\\t      node = parent;\\n\",\n       \"\\t      parent = parent.parent;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    ancestors.push(node);\\n\",\n       \"\\t    return ancestors;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_bundleLeastCommonAncestor(a, b) {\\n\",\n       \"\\t    if (a === b) return a;\\n\",\n       \"\\t    var aNodes = d3_layout_bundleAncestors(a), bNodes = d3_layout_bundleAncestors(b), aNode = aNodes.pop(), bNode = bNodes.pop(), sharedNode = null;\\n\",\n       \"\\t    while (aNode === bNode) {\\n\",\n       \"\\t      sharedNode = aNode;\\n\",\n       \"\\t      aNode = aNodes.pop();\\n\",\n       \"\\t      bNode = bNodes.pop();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return sharedNode;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.chord = function() {\\n\",\n       \"\\t    var chord = {}, chords, groups, matrix, n, padding = 0, sortGroups, sortSubgroups, sortChords;\\n\",\n       \"\\t    function relayout() {\\n\",\n       \"\\t      var subgroups = {}, groupSums = [], groupIndex = d3.range(n), subgroupIndex = [], k, x, x0, i, j;\\n\",\n       \"\\t      chords = [];\\n\",\n       \"\\t      groups = [];\\n\",\n       \"\\t      k = 0, i = -1;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        x = 0, j = -1;\\n\",\n       \"\\t        while (++j < n) {\\n\",\n       \"\\t          x += matrix[i][j];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        groupSums.push(x);\\n\",\n       \"\\t        subgroupIndex.push(d3.range(n));\\n\",\n       \"\\t        k += x;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (sortGroups) {\\n\",\n       \"\\t        groupIndex.sort(function(a, b) {\\n\",\n       \"\\t          return sortGroups(groupSums[a], groupSums[b]);\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (sortSubgroups) {\\n\",\n       \"\\t        subgroupIndex.forEach(function(d, i) {\\n\",\n       \"\\t          d.sort(function(a, b) {\\n\",\n       \"\\t            return sortSubgroups(matrix[i][a], matrix[i][b]);\\n\",\n       \"\\t          });\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t      k = (τ - padding * n) / k;\\n\",\n       \"\\t      x = 0, i = -1;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        x0 = x, j = -1;\\n\",\n       \"\\t        while (++j < n) {\\n\",\n       \"\\t          var di = groupIndex[i], dj = subgroupIndex[di][j], v = matrix[di][dj], a0 = x, a1 = x += v * k;\\n\",\n       \"\\t          subgroups[di + \\\"-\\\" + dj] = {\\n\",\n       \"\\t            index: di,\\n\",\n       \"\\t            subindex: dj,\\n\",\n       \"\\t            startAngle: a0,\\n\",\n       \"\\t            endAngle: a1,\\n\",\n       \"\\t            value: v\\n\",\n       \"\\t          };\\n\",\n       \"\\t        }\\n\",\n       \"\\t        groups[di] = {\\n\",\n       \"\\t          index: di,\\n\",\n       \"\\t          startAngle: x0,\\n\",\n       \"\\t          endAngle: x,\\n\",\n       \"\\t          value: groupSums[di]\\n\",\n       \"\\t        };\\n\",\n       \"\\t        x += padding;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      i = -1;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        j = i - 1;\\n\",\n       \"\\t        while (++j < n) {\\n\",\n       \"\\t          var source = subgroups[i + \\\"-\\\" + j], target = subgroups[j + \\\"-\\\" + i];\\n\",\n       \"\\t          if (source.value || target.value) {\\n\",\n       \"\\t            chords.push(source.value < target.value ? {\\n\",\n       \"\\t              source: target,\\n\",\n       \"\\t              target: source\\n\",\n       \"\\t            } : {\\n\",\n       \"\\t              source: source,\\n\",\n       \"\\t              target: target\\n\",\n       \"\\t            });\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (sortChords) resort();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function resort() {\\n\",\n       \"\\t      chords.sort(function(a, b) {\\n\",\n       \"\\t        return sortChords((a.source.value + a.target.value) / 2, (b.source.value + b.target.value) / 2);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    chord.matrix = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return matrix;\\n\",\n       \"\\t      n = (matrix = x) && matrix.length;\\n\",\n       \"\\t      chords = groups = null;\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.padding = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return padding;\\n\",\n       \"\\t      padding = x;\\n\",\n       \"\\t      chords = groups = null;\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.sortGroups = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return sortGroups;\\n\",\n       \"\\t      sortGroups = x;\\n\",\n       \"\\t      chords = groups = null;\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.sortSubgroups = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return sortSubgroups;\\n\",\n       \"\\t      sortSubgroups = x;\\n\",\n       \"\\t      chords = null;\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.sortChords = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return sortChords;\\n\",\n       \"\\t      sortChords = x;\\n\",\n       \"\\t      if (chords) resort();\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.chords = function() {\\n\",\n       \"\\t      if (!chords) relayout();\\n\",\n       \"\\t      return chords;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.groups = function() {\\n\",\n       \"\\t      if (!groups) relayout();\\n\",\n       \"\\t      return groups;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return chord;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.layout.force = function() {\\n\",\n       \"\\t    var force = {}, event = d3.dispatch(\\\"start\\\", \\\"tick\\\", \\\"end\\\"), timer, size = [ 1, 1 ], drag, alpha, friction = .9, linkDistance = d3_layout_forceLinkDistance, linkStrength = d3_layout_forceLinkStrength, charge = -30, chargeDistance2 = d3_layout_forceChargeDistance2, gravity = .1, theta2 = .64, nodes = [], links = [], distances, strengths, charges;\\n\",\n       \"\\t    function repulse(node) {\\n\",\n       \"\\t      return function(quad, x1, _, x2) {\\n\",\n       \"\\t        if (quad.point !== node) {\\n\",\n       \"\\t          var dx = quad.cx - node.x, dy = quad.cy - node.y, dw = x2 - x1, dn = dx * dx + dy * dy;\\n\",\n       \"\\t          if (dw * dw / theta2 < dn) {\\n\",\n       \"\\t            if (dn < chargeDistance2) {\\n\",\n       \"\\t              var k = quad.charge / dn;\\n\",\n       \"\\t              node.px -= dx * k;\\n\",\n       \"\\t              node.py -= dy * k;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            return true;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (quad.point && dn && dn < chargeDistance2) {\\n\",\n       \"\\t            var k = quad.pointCharge / dn;\\n\",\n       \"\\t            node.px -= dx * k;\\n\",\n       \"\\t            node.py -= dy * k;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return !quad.charge;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    force.tick = function() {\\n\",\n       \"\\t      if ((alpha *= .99) < .005) {\\n\",\n       \"\\t        timer = null;\\n\",\n       \"\\t        event.end({\\n\",\n       \"\\t          type: \\\"end\\\",\\n\",\n       \"\\t          alpha: alpha = 0\\n\",\n       \"\\t        });\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var n = nodes.length, m = links.length, q, i, o, s, t, l, k, x, y;\\n\",\n       \"\\t      for (i = 0; i < m; ++i) {\\n\",\n       \"\\t        o = links[i];\\n\",\n       \"\\t        s = o.source;\\n\",\n       \"\\t        t = o.target;\\n\",\n       \"\\t        x = t.x - s.x;\\n\",\n       \"\\t        y = t.y - s.y;\\n\",\n       \"\\t        if (l = x * x + y * y) {\\n\",\n       \"\\t          l = alpha * strengths[i] * ((l = Math.sqrt(l)) - distances[i]) / l;\\n\",\n       \"\\t          x *= l;\\n\",\n       \"\\t          y *= l;\\n\",\n       \"\\t          t.x -= x * (k = s.weight + t.weight ? s.weight / (s.weight + t.weight) : .5);\\n\",\n       \"\\t          t.y -= y * k;\\n\",\n       \"\\t          s.x += x * (k = 1 - k);\\n\",\n       \"\\t          s.y += y * k;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (k = alpha * gravity) {\\n\",\n       \"\\t        x = size[0] / 2;\\n\",\n       \"\\t        y = size[1] / 2;\\n\",\n       \"\\t        i = -1;\\n\",\n       \"\\t        if (k) while (++i < n) {\\n\",\n       \"\\t          o = nodes[i];\\n\",\n       \"\\t          o.x += (x - o.x) * k;\\n\",\n       \"\\t          o.y += (y - o.y) * k;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (charge) {\\n\",\n       \"\\t        d3_layout_forceAccumulate(q = d3.geom.quadtree(nodes), alpha, charges);\\n\",\n       \"\\t        i = -1;\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          if (!(o = nodes[i]).fixed) {\\n\",\n       \"\\t            q.visit(repulse(o));\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      i = -1;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        o = nodes[i];\\n\",\n       \"\\t        if (o.fixed) {\\n\",\n       \"\\t          o.x = o.px;\\n\",\n       \"\\t          o.y = o.py;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          o.x -= (o.px - (o.px = o.x)) * friction;\\n\",\n       \"\\t          o.y -= (o.py - (o.py = o.y)) * friction;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      event.tick({\\n\",\n       \"\\t        type: \\\"tick\\\",\\n\",\n       \"\\t        alpha: alpha\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.nodes = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return nodes;\\n\",\n       \"\\t      nodes = x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.links = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return links;\\n\",\n       \"\\t      links = x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.size = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return size;\\n\",\n       \"\\t      size = x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.linkDistance = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return linkDistance;\\n\",\n       \"\\t      linkDistance = typeof x === \\\"function\\\" ? x : +x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.distance = force.linkDistance;\\n\",\n       \"\\t    force.linkStrength = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return linkStrength;\\n\",\n       \"\\t      linkStrength = typeof x === \\\"function\\\" ? x : +x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.friction = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return friction;\\n\",\n       \"\\t      friction = +x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.charge = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return charge;\\n\",\n       \"\\t      charge = typeof x === \\\"function\\\" ? x : +x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.chargeDistance = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return Math.sqrt(chargeDistance2);\\n\",\n       \"\\t      chargeDistance2 = x * x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.gravity = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return gravity;\\n\",\n       \"\\t      gravity = +x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.theta = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return Math.sqrt(theta2);\\n\",\n       \"\\t      theta2 = x * x;\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.alpha = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return alpha;\\n\",\n       \"\\t      x = +x;\\n\",\n       \"\\t      if (alpha) {\\n\",\n       \"\\t        if (x > 0) {\\n\",\n       \"\\t          alpha = x;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          timer.c = null, timer.t = NaN, timer = null;\\n\",\n       \"\\t          event.end({\\n\",\n       \"\\t            type: \\\"end\\\",\\n\",\n       \"\\t            alpha: alpha = 0\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else if (x > 0) {\\n\",\n       \"\\t        event.start({\\n\",\n       \"\\t          type: \\\"start\\\",\\n\",\n       \"\\t          alpha: alpha = x\\n\",\n       \"\\t        });\\n\",\n       \"\\t        timer = d3_timer(force.tick);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return force;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.start = function() {\\n\",\n       \"\\t      var i, n = nodes.length, m = links.length, w = size[0], h = size[1], neighbors, o;\\n\",\n       \"\\t      for (i = 0; i < n; ++i) {\\n\",\n       \"\\t        (o = nodes[i]).index = i;\\n\",\n       \"\\t        o.weight = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (i = 0; i < m; ++i) {\\n\",\n       \"\\t        o = links[i];\\n\",\n       \"\\t        if (typeof o.source == \\\"number\\\") o.source = nodes[o.source];\\n\",\n       \"\\t        if (typeof o.target == \\\"number\\\") o.target = nodes[o.target];\\n\",\n       \"\\t        ++o.source.weight;\\n\",\n       \"\\t        ++o.target.weight;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (i = 0; i < n; ++i) {\\n\",\n       \"\\t        o = nodes[i];\\n\",\n       \"\\t        if (isNaN(o.x)) o.x = position(\\\"x\\\", w);\\n\",\n       \"\\t        if (isNaN(o.y)) o.y = position(\\\"y\\\", h);\\n\",\n       \"\\t        if (isNaN(o.px)) o.px = o.x;\\n\",\n       \"\\t        if (isNaN(o.py)) o.py = o.y;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      distances = [];\\n\",\n       \"\\t      if (typeof linkDistance === \\\"function\\\") for (i = 0; i < m; ++i) distances[i] = +linkDistance.call(this, links[i], i); else for (i = 0; i < m; ++i) distances[i] = linkDistance;\\n\",\n       \"\\t      strengths = [];\\n\",\n       \"\\t      if (typeof linkStrength === \\\"function\\\") for (i = 0; i < m; ++i) strengths[i] = +linkStrength.call(this, links[i], i); else for (i = 0; i < m; ++i) strengths[i] = linkStrength;\\n\",\n       \"\\t      charges = [];\\n\",\n       \"\\t      if (typeof charge === \\\"function\\\") for (i = 0; i < n; ++i) charges[i] = +charge.call(this, nodes[i], i); else for (i = 0; i < n; ++i) charges[i] = charge;\\n\",\n       \"\\t      function position(dimension, size) {\\n\",\n       \"\\t        if (!neighbors) {\\n\",\n       \"\\t          neighbors = new Array(n);\\n\",\n       \"\\t          for (j = 0; j < n; ++j) {\\n\",\n       \"\\t            neighbors[j] = [];\\n\",\n       \"\\t          }\\n\",\n       \"\\t          for (j = 0; j < m; ++j) {\\n\",\n       \"\\t            var o = links[j];\\n\",\n       \"\\t            neighbors[o.source.index].push(o.target);\\n\",\n       \"\\t            neighbors[o.target.index].push(o.source);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var candidates = neighbors[i], j = -1, l = candidates.length, x;\\n\",\n       \"\\t        while (++j < l) if (!isNaN(x = candidates[j][dimension])) return x;\\n\",\n       \"\\t        return Math.random() * size;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return force.resume();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.resume = function() {\\n\",\n       \"\\t      return force.alpha(.1);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.stop = function() {\\n\",\n       \"\\t      return force.alpha(0);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    force.drag = function() {\\n\",\n       \"\\t      if (!drag) drag = d3.behavior.drag().origin(d3_identity).on(\\\"dragstart.force\\\", d3_layout_forceDragstart).on(\\\"drag.force\\\", dragmove).on(\\\"dragend.force\\\", d3_layout_forceDragend);\\n\",\n       \"\\t      if (!arguments.length) return drag;\\n\",\n       \"\\t      this.on(\\\"mouseover.force\\\", d3_layout_forceMouseover).on(\\\"mouseout.force\\\", d3_layout_forceMouseout).call(drag);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function dragmove(d) {\\n\",\n       \"\\t      d.px = d3.event.x, d.py = d3.event.y;\\n\",\n       \"\\t      force.resume();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3.rebind(force, event, \\\"on\\\");\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_forceDragstart(d) {\\n\",\n       \"\\t    d.fixed |= 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_forceDragend(d) {\\n\",\n       \"\\t    d.fixed &= ~6;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_forceMouseover(d) {\\n\",\n       \"\\t    d.fixed |= 4;\\n\",\n       \"\\t    d.px = d.x, d.py = d.y;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_forceMouseout(d) {\\n\",\n       \"\\t    d.fixed &= ~4;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_forceAccumulate(quad, alpha, charges) {\\n\",\n       \"\\t    var cx = 0, cy = 0;\\n\",\n       \"\\t    quad.charge = 0;\\n\",\n       \"\\t    if (!quad.leaf) {\\n\",\n       \"\\t      var nodes = quad.nodes, n = nodes.length, i = -1, c;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        c = nodes[i];\\n\",\n       \"\\t        if (c == null) continue;\\n\",\n       \"\\t        d3_layout_forceAccumulate(c, alpha, charges);\\n\",\n       \"\\t        quad.charge += c.charge;\\n\",\n       \"\\t        cx += c.charge * c.cx;\\n\",\n       \"\\t        cy += c.charge * c.cy;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (quad.point) {\\n\",\n       \"\\t      if (!quad.leaf) {\\n\",\n       \"\\t        quad.point.x += Math.random() - .5;\\n\",\n       \"\\t        quad.point.y += Math.random() - .5;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var k = alpha * charges[quad.point.index];\\n\",\n       \"\\t      quad.charge += quad.pointCharge = k;\\n\",\n       \"\\t      cx += k * quad.point.x;\\n\",\n       \"\\t      cy += k * quad.point.y;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    quad.cx = cx / quad.charge;\\n\",\n       \"\\t    quad.cy = cy / quad.charge;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_layout_forceLinkDistance = 20, d3_layout_forceLinkStrength = 1, d3_layout_forceChargeDistance2 = Infinity;\\n\",\n       \"\\t  d3.layout.hierarchy = function() {\\n\",\n       \"\\t    var sort = d3_layout_hierarchySort, children = d3_layout_hierarchyChildren, value = d3_layout_hierarchyValue;\\n\",\n       \"\\t    function hierarchy(root) {\\n\",\n       \"\\t      var stack = [ root ], nodes = [], node;\\n\",\n       \"\\t      root.depth = 0;\\n\",\n       \"\\t      while ((node = stack.pop()) != null) {\\n\",\n       \"\\t        nodes.push(node);\\n\",\n       \"\\t        if ((childs = children.call(hierarchy, node, node.depth)) && (n = childs.length)) {\\n\",\n       \"\\t          var n, childs, child;\\n\",\n       \"\\t          while (--n >= 0) {\\n\",\n       \"\\t            stack.push(child = childs[n]);\\n\",\n       \"\\t            child.parent = node;\\n\",\n       \"\\t            child.depth = node.depth + 1;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (value) node.value = 0;\\n\",\n       \"\\t          node.children = childs;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (value) node.value = +value.call(hierarchy, node, node.depth) || 0;\\n\",\n       \"\\t          delete node.children;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      d3_layout_hierarchyVisitAfter(root, function(node) {\\n\",\n       \"\\t        var childs, parent;\\n\",\n       \"\\t        if (sort && (childs = node.children)) childs.sort(sort);\\n\",\n       \"\\t        if (value && (parent = node.parent)) parent.value += node.value;\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return nodes;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    hierarchy.sort = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return sort;\\n\",\n       \"\\t      sort = x;\\n\",\n       \"\\t      return hierarchy;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    hierarchy.children = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return children;\\n\",\n       \"\\t      children = x;\\n\",\n       \"\\t      return hierarchy;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    hierarchy.value = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return value;\\n\",\n       \"\\t      value = x;\\n\",\n       \"\\t      return hierarchy;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    hierarchy.revalue = function(root) {\\n\",\n       \"\\t      if (value) {\\n\",\n       \"\\t        d3_layout_hierarchyVisitBefore(root, function(node) {\\n\",\n       \"\\t          if (node.children) node.value = 0;\\n\",\n       \"\\t        });\\n\",\n       \"\\t        d3_layout_hierarchyVisitAfter(root, function(node) {\\n\",\n       \"\\t          var parent;\\n\",\n       \"\\t          if (!node.children) node.value = +value.call(hierarchy, node, node.depth) || 0;\\n\",\n       \"\\t          if (parent = node.parent) parent.value += node.value;\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return root;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return hierarchy;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_hierarchyRebind(object, hierarchy) {\\n\",\n       \"\\t    d3.rebind(object, hierarchy, \\\"sort\\\", \\\"children\\\", \\\"value\\\");\\n\",\n       \"\\t    object.nodes = object;\\n\",\n       \"\\t    object.links = d3_layout_hierarchyLinks;\\n\",\n       \"\\t    return object;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_hierarchyVisitBefore(node, callback) {\\n\",\n       \"\\t    var nodes = [ node ];\\n\",\n       \"\\t    while ((node = nodes.pop()) != null) {\\n\",\n       \"\\t      callback(node);\\n\",\n       \"\\t      if ((children = node.children) && (n = children.length)) {\\n\",\n       \"\\t        var n, children;\\n\",\n       \"\\t        while (--n >= 0) nodes.push(children[n]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_hierarchyVisitAfter(node, callback) {\\n\",\n       \"\\t    var nodes = [ node ], nodes2 = [];\\n\",\n       \"\\t    while ((node = nodes.pop()) != null) {\\n\",\n       \"\\t      nodes2.push(node);\\n\",\n       \"\\t      if ((children = node.children) && (n = children.length)) {\\n\",\n       \"\\t        var i = -1, n, children;\\n\",\n       \"\\t        while (++i < n) nodes.push(children[i]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    while ((node = nodes2.pop()) != null) {\\n\",\n       \"\\t      callback(node);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_hierarchyChildren(d) {\\n\",\n       \"\\t    return d.children;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_hierarchyValue(d) {\\n\",\n       \"\\t    return d.value;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_hierarchySort(a, b) {\\n\",\n       \"\\t    return b.value - a.value;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_hierarchyLinks(nodes) {\\n\",\n       \"\\t    return d3.merge(nodes.map(function(parent) {\\n\",\n       \"\\t      return (parent.children || []).map(function(child) {\\n\",\n       \"\\t        return {\\n\",\n       \"\\t          source: parent,\\n\",\n       \"\\t          target: child\\n\",\n       \"\\t        };\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.partition = function() {\\n\",\n       \"\\t    var hierarchy = d3.layout.hierarchy(), size = [ 1, 1 ];\\n\",\n       \"\\t    function position(node, x, dx, dy) {\\n\",\n       \"\\t      var children = node.children;\\n\",\n       \"\\t      node.x = x;\\n\",\n       \"\\t      node.y = node.depth * dy;\\n\",\n       \"\\t      node.dx = dx;\\n\",\n       \"\\t      node.dy = dy;\\n\",\n       \"\\t      if (children && (n = children.length)) {\\n\",\n       \"\\t        var i = -1, n, c, d;\\n\",\n       \"\\t        dx = node.value ? dx / node.value : 0;\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          position(c = children[i], x, d = c.value * dx, dy);\\n\",\n       \"\\t          x += d;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function depth(node) {\\n\",\n       \"\\t      var children = node.children, d = 0;\\n\",\n       \"\\t      if (children && (n = children.length)) {\\n\",\n       \"\\t        var i = -1, n;\\n\",\n       \"\\t        while (++i < n) d = Math.max(d, depth(children[i]));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return 1 + d;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function partition(d, i) {\\n\",\n       \"\\t      var nodes = hierarchy.call(this, d, i);\\n\",\n       \"\\t      position(nodes[0], 0, size[0], size[1] / depth(nodes[0]));\\n\",\n       \"\\t      return nodes;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    partition.size = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return size;\\n\",\n       \"\\t      size = x;\\n\",\n       \"\\t      return partition;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_layout_hierarchyRebind(partition, hierarchy);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.layout.pie = function() {\\n\",\n       \"\\t    var value = Number, sort = d3_layout_pieSortByValue, startAngle = 0, endAngle = τ, padAngle = 0;\\n\",\n       \"\\t    function pie(data) {\\n\",\n       \"\\t      var n = data.length, values = data.map(function(d, i) {\\n\",\n       \"\\t        return +value.call(pie, d, i);\\n\",\n       \"\\t      }), a = +(typeof startAngle === \\\"function\\\" ? startAngle.apply(this, arguments) : startAngle), da = (typeof endAngle === \\\"function\\\" ? endAngle.apply(this, arguments) : endAngle) - a, p = Math.min(Math.abs(da) / n, +(typeof padAngle === \\\"function\\\" ? padAngle.apply(this, arguments) : padAngle)), pa = p * (da < 0 ? -1 : 1), sum = d3.sum(values), k = sum ? (da - n * pa) / sum : 0, index = d3.range(n), arcs = [], v;\\n\",\n       \"\\t      if (sort != null) index.sort(sort === d3_layout_pieSortByValue ? function(i, j) {\\n\",\n       \"\\t        return values[j] - values[i];\\n\",\n       \"\\t      } : function(i, j) {\\n\",\n       \"\\t        return sort(data[i], data[j]);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      index.forEach(function(i) {\\n\",\n       \"\\t        arcs[i] = {\\n\",\n       \"\\t          data: data[i],\\n\",\n       \"\\t          value: v = values[i],\\n\",\n       \"\\t          startAngle: a,\\n\",\n       \"\\t          endAngle: a += v * k + pa,\\n\",\n       \"\\t          padAngle: p\\n\",\n       \"\\t        };\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return arcs;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    pie.value = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return value;\\n\",\n       \"\\t      value = _;\\n\",\n       \"\\t      return pie;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    pie.sort = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return sort;\\n\",\n       \"\\t      sort = _;\\n\",\n       \"\\t      return pie;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    pie.startAngle = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return startAngle;\\n\",\n       \"\\t      startAngle = _;\\n\",\n       \"\\t      return pie;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    pie.endAngle = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return endAngle;\\n\",\n       \"\\t      endAngle = _;\\n\",\n       \"\\t      return pie;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    pie.padAngle = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return padAngle;\\n\",\n       \"\\t      padAngle = _;\\n\",\n       \"\\t      return pie;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return pie;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_layout_pieSortByValue = {};\\n\",\n       \"\\t  d3.layout.stack = function() {\\n\",\n       \"\\t    var values = d3_identity, order = d3_layout_stackOrderDefault, offset = d3_layout_stackOffsetZero, out = d3_layout_stackOut, x = d3_layout_stackX, y = d3_layout_stackY;\\n\",\n       \"\\t    function stack(data, index) {\\n\",\n       \"\\t      if (!(n = data.length)) return data;\\n\",\n       \"\\t      var series = data.map(function(d, i) {\\n\",\n       \"\\t        return values.call(stack, d, i);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      var points = series.map(function(d) {\\n\",\n       \"\\t        return d.map(function(v, i) {\\n\",\n       \"\\t          return [ x.call(stack, v, i), y.call(stack, v, i) ];\\n\",\n       \"\\t        });\\n\",\n       \"\\t      });\\n\",\n       \"\\t      var orders = order.call(stack, points, index);\\n\",\n       \"\\t      series = d3.permute(series, orders);\\n\",\n       \"\\t      points = d3.permute(points, orders);\\n\",\n       \"\\t      var offsets = offset.call(stack, points, index);\\n\",\n       \"\\t      var m = series[0].length, n, i, j, o;\\n\",\n       \"\\t      for (j = 0; j < m; ++j) {\\n\",\n       \"\\t        out.call(stack, series[0][j], o = offsets[j], points[0][j][1]);\\n\",\n       \"\\t        for (i = 1; i < n; ++i) {\\n\",\n       \"\\t          out.call(stack, series[i][j], o += points[i - 1][j][1], points[i][j][1]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return data;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    stack.values = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return values;\\n\",\n       \"\\t      values = x;\\n\",\n       \"\\t      return stack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    stack.order = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return order;\\n\",\n       \"\\t      order = typeof x === \\\"function\\\" ? x : d3_layout_stackOrders.get(x) || d3_layout_stackOrderDefault;\\n\",\n       \"\\t      return stack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    stack.offset = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return offset;\\n\",\n       \"\\t      offset = typeof x === \\\"function\\\" ? x : d3_layout_stackOffsets.get(x) || d3_layout_stackOffsetZero;\\n\",\n       \"\\t      return stack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    stack.x = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return x;\\n\",\n       \"\\t      x = z;\\n\",\n       \"\\t      return stack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    stack.y = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return y;\\n\",\n       \"\\t      y = z;\\n\",\n       \"\\t      return stack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    stack.out = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return out;\\n\",\n       \"\\t      out = z;\\n\",\n       \"\\t      return stack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return stack;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_stackX(d) {\\n\",\n       \"\\t    return d.x;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_stackY(d) {\\n\",\n       \"\\t    return d.y;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_stackOut(d, y0, y) {\\n\",\n       \"\\t    d.y0 = y0;\\n\",\n       \"\\t    d.y = y;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_layout_stackOrders = d3.map({\\n\",\n       \"\\t    \\\"inside-out\\\": function(data) {\\n\",\n       \"\\t      var n = data.length, i, j, max = data.map(d3_layout_stackMaxIndex), sums = data.map(d3_layout_stackReduceSum), index = d3.range(n).sort(function(a, b) {\\n\",\n       \"\\t        return max[a] - max[b];\\n\",\n       \"\\t      }), top = 0, bottom = 0, tops = [], bottoms = [];\\n\",\n       \"\\t      for (i = 0; i < n; ++i) {\\n\",\n       \"\\t        j = index[i];\\n\",\n       \"\\t        if (top < bottom) {\\n\",\n       \"\\t          top += sums[j];\\n\",\n       \"\\t          tops.push(j);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          bottom += sums[j];\\n\",\n       \"\\t          bottoms.push(j);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return bottoms.reverse().concat(tops);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    reverse: function(data) {\\n\",\n       \"\\t      return d3.range(data.length).reverse();\\n\",\n       \"\\t    },\\n\",\n       \"\\t    \\\"default\\\": d3_layout_stackOrderDefault\\n\",\n       \"\\t  });\\n\",\n       \"\\t  var d3_layout_stackOffsets = d3.map({\\n\",\n       \"\\t    silhouette: function(data) {\\n\",\n       \"\\t      var n = data.length, m = data[0].length, sums = [], max = 0, i, j, o, y0 = [];\\n\",\n       \"\\t      for (j = 0; j < m; ++j) {\\n\",\n       \"\\t        for (i = 0, o = 0; i < n; i++) o += data[i][j][1];\\n\",\n       \"\\t        if (o > max) max = o;\\n\",\n       \"\\t        sums.push(o);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (j = 0; j < m; ++j) {\\n\",\n       \"\\t        y0[j] = (max - sums[j]) / 2;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return y0;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    wiggle: function(data) {\\n\",\n       \"\\t      var n = data.length, x = data[0], m = x.length, i, j, k, s1, s2, s3, dx, o, o0, y0 = [];\\n\",\n       \"\\t      y0[0] = o = o0 = 0;\\n\",\n       \"\\t      for (j = 1; j < m; ++j) {\\n\",\n       \"\\t        for (i = 0, s1 = 0; i < n; ++i) s1 += data[i][j][1];\\n\",\n       \"\\t        for (i = 0, s2 = 0, dx = x[j][0] - x[j - 1][0]; i < n; ++i) {\\n\",\n       \"\\t          for (k = 0, s3 = (data[i][j][1] - data[i][j - 1][1]) / (2 * dx); k < i; ++k) {\\n\",\n       \"\\t            s3 += (data[k][j][1] - data[k][j - 1][1]) / dx;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          s2 += s3 * data[i][j][1];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        y0[j] = o -= s1 ? s2 / s1 * dx : 0;\\n\",\n       \"\\t        if (o < o0) o0 = o;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (j = 0; j < m; ++j) y0[j] -= o0;\\n\",\n       \"\\t      return y0;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    expand: function(data) {\\n\",\n       \"\\t      var n = data.length, m = data[0].length, k = 1 / n, i, j, o, y0 = [];\\n\",\n       \"\\t      for (j = 0; j < m; ++j) {\\n\",\n       \"\\t        for (i = 0, o = 0; i < n; i++) o += data[i][j][1];\\n\",\n       \"\\t        if (o) for (i = 0; i < n; i++) data[i][j][1] /= o; else for (i = 0; i < n; i++) data[i][j][1] = k;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (j = 0; j < m; ++j) y0[j] = 0;\\n\",\n       \"\\t      return y0;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    zero: d3_layout_stackOffsetZero\\n\",\n       \"\\t  });\\n\",\n       \"\\t  function d3_layout_stackOrderDefault(data) {\\n\",\n       \"\\t    return d3.range(data.length);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_stackOffsetZero(data) {\\n\",\n       \"\\t    var j = -1, m = data[0].length, y0 = [];\\n\",\n       \"\\t    while (++j < m) y0[j] = 0;\\n\",\n       \"\\t    return y0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_stackMaxIndex(array) {\\n\",\n       \"\\t    var i = 1, j = 0, v = array[0][1], k, n = array.length;\\n\",\n       \"\\t    for (;i < n; ++i) {\\n\",\n       \"\\t      if ((k = array[i][1]) > v) {\\n\",\n       \"\\t        j = i;\\n\",\n       \"\\t        v = k;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return j;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_stackReduceSum(d) {\\n\",\n       \"\\t    return d.reduce(d3_layout_stackSum, 0);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_stackSum(p, d) {\\n\",\n       \"\\t    return p + d[1];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.histogram = function() {\\n\",\n       \"\\t    var frequency = true, valuer = Number, ranger = d3_layout_histogramRange, binner = d3_layout_histogramBinSturges;\\n\",\n       \"\\t    function histogram(data, i) {\\n\",\n       \"\\t      var bins = [], values = data.map(valuer, this), range = ranger.call(this, values, i), thresholds = binner.call(this, range, values, i), bin, i = -1, n = values.length, m = thresholds.length - 1, k = frequency ? 1 : 1 / n, x;\\n\",\n       \"\\t      while (++i < m) {\\n\",\n       \"\\t        bin = bins[i] = [];\\n\",\n       \"\\t        bin.dx = thresholds[i + 1] - (bin.x = thresholds[i]);\\n\",\n       \"\\t        bin.y = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (m > 0) {\\n\",\n       \"\\t        i = -1;\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          x = values[i];\\n\",\n       \"\\t          if (x >= range[0] && x <= range[1]) {\\n\",\n       \"\\t            bin = bins[d3.bisect(thresholds, x, 1, m) - 1];\\n\",\n       \"\\t            bin.y += k;\\n\",\n       \"\\t            bin.push(data[i]);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return bins;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    histogram.value = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return valuer;\\n\",\n       \"\\t      valuer = x;\\n\",\n       \"\\t      return histogram;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    histogram.range = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return ranger;\\n\",\n       \"\\t      ranger = d3_functor(x);\\n\",\n       \"\\t      return histogram;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    histogram.bins = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return binner;\\n\",\n       \"\\t      binner = typeof x === \\\"number\\\" ? function(range) {\\n\",\n       \"\\t        return d3_layout_histogramBinFixed(range, x);\\n\",\n       \"\\t      } : d3_functor(x);\\n\",\n       \"\\t      return histogram;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    histogram.frequency = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return frequency;\\n\",\n       \"\\t      frequency = !!x;\\n\",\n       \"\\t      return histogram;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return histogram;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_histogramBinSturges(range, values) {\\n\",\n       \"\\t    return d3_layout_histogramBinFixed(range, Math.ceil(Math.log(values.length) / Math.LN2 + 1));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_histogramBinFixed(range, n) {\\n\",\n       \"\\t    var x = -1, b = +range[0], m = (range[1] - b) / n, f = [];\\n\",\n       \"\\t    while (++x <= n) f[x] = m * x + b;\\n\",\n       \"\\t    return f;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_histogramRange(values) {\\n\",\n       \"\\t    return [ d3.min(values), d3.max(values) ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.pack = function() {\\n\",\n       \"\\t    var hierarchy = d3.layout.hierarchy().sort(d3_layout_packSort), padding = 0, size = [ 1, 1 ], radius;\\n\",\n       \"\\t    function pack(d, i) {\\n\",\n       \"\\t      var nodes = hierarchy.call(this, d, i), root = nodes[0], w = size[0], h = size[1], r = radius == null ? Math.sqrt : typeof radius === \\\"function\\\" ? radius : function() {\\n\",\n       \"\\t        return radius;\\n\",\n       \"\\t      };\\n\",\n       \"\\t      root.x = root.y = 0;\\n\",\n       \"\\t      d3_layout_hierarchyVisitAfter(root, function(d) {\\n\",\n       \"\\t        d.r = +r(d.value);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      d3_layout_hierarchyVisitAfter(root, d3_layout_packSiblings);\\n\",\n       \"\\t      if (padding) {\\n\",\n       \"\\t        var dr = padding * (radius ? 1 : Math.max(2 * root.r / w, 2 * root.r / h)) / 2;\\n\",\n       \"\\t        d3_layout_hierarchyVisitAfter(root, function(d) {\\n\",\n       \"\\t          d.r += dr;\\n\",\n       \"\\t        });\\n\",\n       \"\\t        d3_layout_hierarchyVisitAfter(root, d3_layout_packSiblings);\\n\",\n       \"\\t        d3_layout_hierarchyVisitAfter(root, function(d) {\\n\",\n       \"\\t          d.r -= dr;\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t      d3_layout_packTransform(root, w / 2, h / 2, radius ? 1 : 1 / Math.max(2 * root.r / w, 2 * root.r / h));\\n\",\n       \"\\t      return nodes;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    pack.size = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return size;\\n\",\n       \"\\t      size = _;\\n\",\n       \"\\t      return pack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    pack.radius = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return radius;\\n\",\n       \"\\t      radius = _ == null || typeof _ === \\\"function\\\" ? _ : +_;\\n\",\n       \"\\t      return pack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    pack.padding = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return padding;\\n\",\n       \"\\t      padding = +_;\\n\",\n       \"\\t      return pack;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_layout_hierarchyRebind(pack, hierarchy);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_packSort(a, b) {\\n\",\n       \"\\t    return a.value - b.value;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packInsert(a, b) {\\n\",\n       \"\\t    var c = a._pack_next;\\n\",\n       \"\\t    a._pack_next = b;\\n\",\n       \"\\t    b._pack_prev = a;\\n\",\n       \"\\t    b._pack_next = c;\\n\",\n       \"\\t    c._pack_prev = b;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packSplice(a, b) {\\n\",\n       \"\\t    a._pack_next = b;\\n\",\n       \"\\t    b._pack_prev = a;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packIntersects(a, b) {\\n\",\n       \"\\t    var dx = b.x - a.x, dy = b.y - a.y, dr = a.r + b.r;\\n\",\n       \"\\t    return .999 * dr * dr > dx * dx + dy * dy;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packSiblings(node) {\\n\",\n       \"\\t    if (!(nodes = node.children) || !(n = nodes.length)) return;\\n\",\n       \"\\t    var nodes, xMin = Infinity, xMax = -Infinity, yMin = Infinity, yMax = -Infinity, a, b, c, i, j, k, n;\\n\",\n       \"\\t    function bound(node) {\\n\",\n       \"\\t      xMin = Math.min(node.x - node.r, xMin);\\n\",\n       \"\\t      xMax = Math.max(node.x + node.r, xMax);\\n\",\n       \"\\t      yMin = Math.min(node.y - node.r, yMin);\\n\",\n       \"\\t      yMax = Math.max(node.y + node.r, yMax);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    nodes.forEach(d3_layout_packLink);\\n\",\n       \"\\t    a = nodes[0];\\n\",\n       \"\\t    a.x = -a.r;\\n\",\n       \"\\t    a.y = 0;\\n\",\n       \"\\t    bound(a);\\n\",\n       \"\\t    if (n > 1) {\\n\",\n       \"\\t      b = nodes[1];\\n\",\n       \"\\t      b.x = b.r;\\n\",\n       \"\\t      b.y = 0;\\n\",\n       \"\\t      bound(b);\\n\",\n       \"\\t      if (n > 2) {\\n\",\n       \"\\t        c = nodes[2];\\n\",\n       \"\\t        d3_layout_packPlace(a, b, c);\\n\",\n       \"\\t        bound(c);\\n\",\n       \"\\t        d3_layout_packInsert(a, c);\\n\",\n       \"\\t        a._pack_prev = c;\\n\",\n       \"\\t        d3_layout_packInsert(c, b);\\n\",\n       \"\\t        b = a._pack_next;\\n\",\n       \"\\t        for (i = 3; i < n; i++) {\\n\",\n       \"\\t          d3_layout_packPlace(a, b, c = nodes[i]);\\n\",\n       \"\\t          var isect = 0, s1 = 1, s2 = 1;\\n\",\n       \"\\t          for (j = b._pack_next; j !== b; j = j._pack_next, s1++) {\\n\",\n       \"\\t            if (d3_layout_packIntersects(j, c)) {\\n\",\n       \"\\t              isect = 1;\\n\",\n       \"\\t              break;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (isect == 1) {\\n\",\n       \"\\t            for (k = a._pack_prev; k !== j._pack_prev; k = k._pack_prev, s2++) {\\n\",\n       \"\\t              if (d3_layout_packIntersects(k, c)) {\\n\",\n       \"\\t                break;\\n\",\n       \"\\t              }\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (isect) {\\n\",\n       \"\\t            if (s1 < s2 || s1 == s2 && b.r < a.r) d3_layout_packSplice(a, b = j); else d3_layout_packSplice(a = k, b);\\n\",\n       \"\\t            i--;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            d3_layout_packInsert(a, c);\\n\",\n       \"\\t            b = c;\\n\",\n       \"\\t            bound(c);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var cx = (xMin + xMax) / 2, cy = (yMin + yMax) / 2, cr = 0;\\n\",\n       \"\\t    for (i = 0; i < n; i++) {\\n\",\n       \"\\t      c = nodes[i];\\n\",\n       \"\\t      c.x -= cx;\\n\",\n       \"\\t      c.y -= cy;\\n\",\n       \"\\t      cr = Math.max(cr, c.r + Math.sqrt(c.x * c.x + c.y * c.y));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    node.r = cr;\\n\",\n       \"\\t    nodes.forEach(d3_layout_packUnlink);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packLink(node) {\\n\",\n       \"\\t    node._pack_next = node._pack_prev = node;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packUnlink(node) {\\n\",\n       \"\\t    delete node._pack_next;\\n\",\n       \"\\t    delete node._pack_prev;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packTransform(node, x, y, k) {\\n\",\n       \"\\t    var children = node.children;\\n\",\n       \"\\t    node.x = x += k * node.x;\\n\",\n       \"\\t    node.y = y += k * node.y;\\n\",\n       \"\\t    node.r *= k;\\n\",\n       \"\\t    if (children) {\\n\",\n       \"\\t      var i = -1, n = children.length;\\n\",\n       \"\\t      while (++i < n) d3_layout_packTransform(children[i], x, y, k);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_packPlace(a, b, c) {\\n\",\n       \"\\t    var db = a.r + c.r, dx = b.x - a.x, dy = b.y - a.y;\\n\",\n       \"\\t    if (db && (dx || dy)) {\\n\",\n       \"\\t      var da = b.r + c.r, dc = dx * dx + dy * dy;\\n\",\n       \"\\t      da *= da;\\n\",\n       \"\\t      db *= db;\\n\",\n       \"\\t      var x = .5 + (db - da) / (2 * dc), y = Math.sqrt(Math.max(0, 2 * da * (db + dc) - (db -= dc) * db - da * da)) / (2 * dc);\\n\",\n       \"\\t      c.x = a.x + x * dx + y * dy;\\n\",\n       \"\\t      c.y = a.y + x * dy - y * dx;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      c.x = a.x + db;\\n\",\n       \"\\t      c.y = a.y;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.tree = function() {\\n\",\n       \"\\t    var hierarchy = d3.layout.hierarchy().sort(null).value(null), separation = d3_layout_treeSeparation, size = [ 1, 1 ], nodeSize = null;\\n\",\n       \"\\t    function tree(d, i) {\\n\",\n       \"\\t      var nodes = hierarchy.call(this, d, i), root0 = nodes[0], root1 = wrapTree(root0);\\n\",\n       \"\\t      d3_layout_hierarchyVisitAfter(root1, firstWalk), root1.parent.m = -root1.z;\\n\",\n       \"\\t      d3_layout_hierarchyVisitBefore(root1, secondWalk);\\n\",\n       \"\\t      if (nodeSize) d3_layout_hierarchyVisitBefore(root0, sizeNode); else {\\n\",\n       \"\\t        var left = root0, right = root0, bottom = root0;\\n\",\n       \"\\t        d3_layout_hierarchyVisitBefore(root0, function(node) {\\n\",\n       \"\\t          if (node.x < left.x) left = node;\\n\",\n       \"\\t          if (node.x > right.x) right = node;\\n\",\n       \"\\t          if (node.depth > bottom.depth) bottom = node;\\n\",\n       \"\\t        });\\n\",\n       \"\\t        var tx = separation(left, right) / 2 - left.x, kx = size[0] / (right.x + separation(right, left) / 2 + tx), ky = size[1] / (bottom.depth || 1);\\n\",\n       \"\\t        d3_layout_hierarchyVisitBefore(root0, function(node) {\\n\",\n       \"\\t          node.x = (node.x + tx) * kx;\\n\",\n       \"\\t          node.y = node.depth * ky;\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return nodes;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function wrapTree(root0) {\\n\",\n       \"\\t      var root1 = {\\n\",\n       \"\\t        A: null,\\n\",\n       \"\\t        children: [ root0 ]\\n\",\n       \"\\t      }, queue = [ root1 ], node1;\\n\",\n       \"\\t      while ((node1 = queue.pop()) != null) {\\n\",\n       \"\\t        for (var children = node1.children, child, i = 0, n = children.length; i < n; ++i) {\\n\",\n       \"\\t          queue.push((children[i] = child = {\\n\",\n       \"\\t            _: children[i],\\n\",\n       \"\\t            parent: node1,\\n\",\n       \"\\t            children: (child = children[i].children) && child.slice() || [],\\n\",\n       \"\\t            A: null,\\n\",\n       \"\\t            a: null,\\n\",\n       \"\\t            z: 0,\\n\",\n       \"\\t            m: 0,\\n\",\n       \"\\t            c: 0,\\n\",\n       \"\\t            s: 0,\\n\",\n       \"\\t            t: null,\\n\",\n       \"\\t            i: i\\n\",\n       \"\\t          }).a = child);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return root1.children[0];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function firstWalk(v) {\\n\",\n       \"\\t      var children = v.children, siblings = v.parent.children, w = v.i ? siblings[v.i - 1] : null;\\n\",\n       \"\\t      if (children.length) {\\n\",\n       \"\\t        d3_layout_treeShift(v);\\n\",\n       \"\\t        var midpoint = (children[0].z + children[children.length - 1].z) / 2;\\n\",\n       \"\\t        if (w) {\\n\",\n       \"\\t          v.z = w.z + separation(v._, w._);\\n\",\n       \"\\t          v.m = v.z - midpoint;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          v.z = midpoint;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else if (w) {\\n\",\n       \"\\t        v.z = w.z + separation(v._, w._);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function secondWalk(v) {\\n\",\n       \"\\t      v._.x = v.z + v.parent.m;\\n\",\n       \"\\t      v.m += v.parent.m;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function apportion(v, w, ancestor) {\\n\",\n       \"\\t      if (w) {\\n\",\n       \"\\t        var vip = v, vop = v, vim = w, vom = vip.parent.children[0], sip = vip.m, sop = vop.m, sim = vim.m, som = vom.m, shift;\\n\",\n       \"\\t        while (vim = d3_layout_treeRight(vim), vip = d3_layout_treeLeft(vip), vim && vip) {\\n\",\n       \"\\t          vom = d3_layout_treeLeft(vom);\\n\",\n       \"\\t          vop = d3_layout_treeRight(vop);\\n\",\n       \"\\t          vop.a = v;\\n\",\n       \"\\t          shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\\n\",\n       \"\\t          if (shift > 0) {\\n\",\n       \"\\t            d3_layout_treeMove(d3_layout_treeAncestor(vim, v, ancestor), v, shift);\\n\",\n       \"\\t            sip += shift;\\n\",\n       \"\\t            sop += shift;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          sim += vim.m;\\n\",\n       \"\\t          sip += vip.m;\\n\",\n       \"\\t          som += vom.m;\\n\",\n       \"\\t          sop += vop.m;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (vim && !d3_layout_treeRight(vop)) {\\n\",\n       \"\\t          vop.t = vim;\\n\",\n       \"\\t          vop.m += sim - sop;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (vip && !d3_layout_treeLeft(vom)) {\\n\",\n       \"\\t          vom.t = vip;\\n\",\n       \"\\t          vom.m += sip - som;\\n\",\n       \"\\t          ancestor = v;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return ancestor;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function sizeNode(node) {\\n\",\n       \"\\t      node.x *= size[0];\\n\",\n       \"\\t      node.y = node.depth * size[1];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    tree.separation = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return separation;\\n\",\n       \"\\t      separation = x;\\n\",\n       \"\\t      return tree;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    tree.size = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return nodeSize ? null : size;\\n\",\n       \"\\t      nodeSize = (size = x) == null ? sizeNode : null;\\n\",\n       \"\\t      return tree;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    tree.nodeSize = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return nodeSize ? size : null;\\n\",\n       \"\\t      nodeSize = (size = x) == null ? null : sizeNode;\\n\",\n       \"\\t      return tree;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_layout_hierarchyRebind(tree, hierarchy);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_treeSeparation(a, b) {\\n\",\n       \"\\t    return a.parent == b.parent ? 1 : 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_treeLeft(v) {\\n\",\n       \"\\t    var children = v.children;\\n\",\n       \"\\t    return children.length ? children[0] : v.t;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_treeRight(v) {\\n\",\n       \"\\t    var children = v.children, n;\\n\",\n       \"\\t    return (n = children.length) ? children[n - 1] : v.t;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_treeMove(wm, wp, shift) {\\n\",\n       \"\\t    var change = shift / (wp.i - wm.i);\\n\",\n       \"\\t    wp.c -= change;\\n\",\n       \"\\t    wp.s += shift;\\n\",\n       \"\\t    wm.c += change;\\n\",\n       \"\\t    wp.z += shift;\\n\",\n       \"\\t    wp.m += shift;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_treeShift(v) {\\n\",\n       \"\\t    var shift = 0, change = 0, children = v.children, i = children.length, w;\\n\",\n       \"\\t    while (--i >= 0) {\\n\",\n       \"\\t      w = children[i];\\n\",\n       \"\\t      w.z += shift;\\n\",\n       \"\\t      w.m += shift;\\n\",\n       \"\\t      shift += w.s + (change += w.c);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_treeAncestor(vim, v, ancestor) {\\n\",\n       \"\\t    return vim.a.parent === v.parent ? vim.a : ancestor;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.cluster = function() {\\n\",\n       \"\\t    var hierarchy = d3.layout.hierarchy().sort(null).value(null), separation = d3_layout_treeSeparation, size = [ 1, 1 ], nodeSize = false;\\n\",\n       \"\\t    function cluster(d, i) {\\n\",\n       \"\\t      var nodes = hierarchy.call(this, d, i), root = nodes[0], previousNode, x = 0;\\n\",\n       \"\\t      d3_layout_hierarchyVisitAfter(root, function(node) {\\n\",\n       \"\\t        var children = node.children;\\n\",\n       \"\\t        if (children && children.length) {\\n\",\n       \"\\t          node.x = d3_layout_clusterX(children);\\n\",\n       \"\\t          node.y = d3_layout_clusterY(children);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          node.x = previousNode ? x += separation(node, previousNode) : 0;\\n\",\n       \"\\t          node.y = 0;\\n\",\n       \"\\t          previousNode = node;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      var left = d3_layout_clusterLeft(root), right = d3_layout_clusterRight(root), x0 = left.x - separation(left, right) / 2, x1 = right.x + separation(right, left) / 2;\\n\",\n       \"\\t      d3_layout_hierarchyVisitAfter(root, nodeSize ? function(node) {\\n\",\n       \"\\t        node.x = (node.x - root.x) * size[0];\\n\",\n       \"\\t        node.y = (root.y - node.y) * size[1];\\n\",\n       \"\\t      } : function(node) {\\n\",\n       \"\\t        node.x = (node.x - x0) / (x1 - x0) * size[0];\\n\",\n       \"\\t        node.y = (1 - (root.y ? node.y / root.y : 1)) * size[1];\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return nodes;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    cluster.separation = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return separation;\\n\",\n       \"\\t      separation = x;\\n\",\n       \"\\t      return cluster;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    cluster.size = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return nodeSize ? null : size;\\n\",\n       \"\\t      nodeSize = (size = x) == null;\\n\",\n       \"\\t      return cluster;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    cluster.nodeSize = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return nodeSize ? size : null;\\n\",\n       \"\\t      nodeSize = (size = x) != null;\\n\",\n       \"\\t      return cluster;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_layout_hierarchyRebind(cluster, hierarchy);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_clusterY(children) {\\n\",\n       \"\\t    return 1 + d3.max(children, function(child) {\\n\",\n       \"\\t      return child.y;\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_clusterX(children) {\\n\",\n       \"\\t    return children.reduce(function(x, child) {\\n\",\n       \"\\t      return x + child.x;\\n\",\n       \"\\t    }, 0) / children.length;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_clusterLeft(node) {\\n\",\n       \"\\t    var children = node.children;\\n\",\n       \"\\t    return children && children.length ? d3_layout_clusterLeft(children[0]) : node;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_clusterRight(node) {\\n\",\n       \"\\t    var children = node.children, n;\\n\",\n       \"\\t    return children && (n = children.length) ? d3_layout_clusterRight(children[n - 1]) : node;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.layout.treemap = function() {\\n\",\n       \"\\t    var hierarchy = d3.layout.hierarchy(), round = Math.round, size = [ 1, 1 ], padding = null, pad = d3_layout_treemapPadNull, sticky = false, stickies, mode = \\\"squarify\\\", ratio = .5 * (1 + Math.sqrt(5));\\n\",\n       \"\\t    function scale(children, k) {\\n\",\n       \"\\t      var i = -1, n = children.length, child, area;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        area = (child = children[i]).value * (k < 0 ? 0 : k);\\n\",\n       \"\\t        child.area = isNaN(area) || area <= 0 ? 0 : area;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function squarify(node) {\\n\",\n       \"\\t      var children = node.children;\\n\",\n       \"\\t      if (children && children.length) {\\n\",\n       \"\\t        var rect = pad(node), row = [], remaining = children.slice(), child, best = Infinity, score, u = mode === \\\"slice\\\" ? rect.dx : mode === \\\"dice\\\" ? rect.dy : mode === \\\"slice-dice\\\" ? node.depth & 1 ? rect.dy : rect.dx : Math.min(rect.dx, rect.dy), n;\\n\",\n       \"\\t        scale(remaining, rect.dx * rect.dy / node.value);\\n\",\n       \"\\t        row.area = 0;\\n\",\n       \"\\t        while ((n = remaining.length) > 0) {\\n\",\n       \"\\t          row.push(child = remaining[n - 1]);\\n\",\n       \"\\t          row.area += child.area;\\n\",\n       \"\\t          if (mode !== \\\"squarify\\\" || (score = worst(row, u)) <= best) {\\n\",\n       \"\\t            remaining.pop();\\n\",\n       \"\\t            best = score;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            row.area -= row.pop().area;\\n\",\n       \"\\t            position(row, u, rect, false);\\n\",\n       \"\\t            u = Math.min(rect.dx, rect.dy);\\n\",\n       \"\\t            row.length = row.area = 0;\\n\",\n       \"\\t            best = Infinity;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (row.length) {\\n\",\n       \"\\t          position(row, u, rect, true);\\n\",\n       \"\\t          row.length = row.area = 0;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        children.forEach(squarify);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function stickify(node) {\\n\",\n       \"\\t      var children = node.children;\\n\",\n       \"\\t      if (children && children.length) {\\n\",\n       \"\\t        var rect = pad(node), remaining = children.slice(), child, row = [];\\n\",\n       \"\\t        scale(remaining, rect.dx * rect.dy / node.value);\\n\",\n       \"\\t        row.area = 0;\\n\",\n       \"\\t        while (child = remaining.pop()) {\\n\",\n       \"\\t          row.push(child);\\n\",\n       \"\\t          row.area += child.area;\\n\",\n       \"\\t          if (child.z != null) {\\n\",\n       \"\\t            position(row, child.z ? rect.dx : rect.dy, rect, !remaining.length);\\n\",\n       \"\\t            row.length = row.area = 0;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        children.forEach(stickify);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function worst(row, u) {\\n\",\n       \"\\t      var s = row.area, r, rmax = 0, rmin = Infinity, i = -1, n = row.length;\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (!(r = row[i].area)) continue;\\n\",\n       \"\\t        if (r < rmin) rmin = r;\\n\",\n       \"\\t        if (r > rmax) rmax = r;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      s *= s;\\n\",\n       \"\\t      u *= u;\\n\",\n       \"\\t      return s ? Math.max(u * rmax * ratio / s, s / (u * rmin * ratio)) : Infinity;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function position(row, u, rect, flush) {\\n\",\n       \"\\t      var i = -1, n = row.length, x = rect.x, y = rect.y, v = u ? round(row.area / u) : 0, o;\\n\",\n       \"\\t      if (u == rect.dx) {\\n\",\n       \"\\t        if (flush || v > rect.dy) v = rect.dy;\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          o = row[i];\\n\",\n       \"\\t          o.x = x;\\n\",\n       \"\\t          o.y = y;\\n\",\n       \"\\t          o.dy = v;\\n\",\n       \"\\t          x += o.dx = Math.min(rect.x + rect.dx - x, v ? round(o.area / v) : 0);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        o.z = true;\\n\",\n       \"\\t        o.dx += rect.x + rect.dx - x;\\n\",\n       \"\\t        rect.y += v;\\n\",\n       \"\\t        rect.dy -= v;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        if (flush || v > rect.dx) v = rect.dx;\\n\",\n       \"\\t        while (++i < n) {\\n\",\n       \"\\t          o = row[i];\\n\",\n       \"\\t          o.x = x;\\n\",\n       \"\\t          o.y = y;\\n\",\n       \"\\t          o.dx = v;\\n\",\n       \"\\t          y += o.dy = Math.min(rect.y + rect.dy - y, v ? round(o.area / v) : 0);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        o.z = false;\\n\",\n       \"\\t        o.dy += rect.y + rect.dy - y;\\n\",\n       \"\\t        rect.x += v;\\n\",\n       \"\\t        rect.dx -= v;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function treemap(d) {\\n\",\n       \"\\t      var nodes = stickies || hierarchy(d), root = nodes[0];\\n\",\n       \"\\t      root.x = root.y = 0;\\n\",\n       \"\\t      if (root.value) root.dx = size[0], root.dy = size[1]; else root.dx = root.dy = 0;\\n\",\n       \"\\t      if (stickies) hierarchy.revalue(root);\\n\",\n       \"\\t      scale([ root ], root.dx * root.dy / root.value);\\n\",\n       \"\\t      (stickies ? stickify : squarify)(root);\\n\",\n       \"\\t      if (sticky) stickies = nodes;\\n\",\n       \"\\t      return nodes;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    treemap.size = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return size;\\n\",\n       \"\\t      size = x;\\n\",\n       \"\\t      return treemap;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    treemap.padding = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return padding;\\n\",\n       \"\\t      function padFunction(node) {\\n\",\n       \"\\t        var p = x.call(treemap, node, node.depth);\\n\",\n       \"\\t        return p == null ? d3_layout_treemapPadNull(node) : d3_layout_treemapPad(node, typeof p === \\\"number\\\" ? [ p, p, p, p ] : p);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function padConstant(node) {\\n\",\n       \"\\t        return d3_layout_treemapPad(node, x);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var type;\\n\",\n       \"\\t      pad = (padding = x) == null ? d3_layout_treemapPadNull : (type = typeof x) === \\\"function\\\" ? padFunction : type === \\\"number\\\" ? (x = [ x, x, x, x ], \\n\",\n       \"\\t      padConstant) : padConstant;\\n\",\n       \"\\t      return treemap;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    treemap.round = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return round != Number;\\n\",\n       \"\\t      round = x ? Math.round : Number;\\n\",\n       \"\\t      return treemap;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    treemap.sticky = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return sticky;\\n\",\n       \"\\t      sticky = x;\\n\",\n       \"\\t      stickies = null;\\n\",\n       \"\\t      return treemap;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    treemap.ratio = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return ratio;\\n\",\n       \"\\t      ratio = x;\\n\",\n       \"\\t      return treemap;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    treemap.mode = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return mode;\\n\",\n       \"\\t      mode = x + \\\"\\\";\\n\",\n       \"\\t      return treemap;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_layout_hierarchyRebind(treemap, hierarchy);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_layout_treemapPadNull(node) {\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      x: node.x,\\n\",\n       \"\\t      y: node.y,\\n\",\n       \"\\t      dx: node.dx,\\n\",\n       \"\\t      dy: node.dy\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_layout_treemapPad(node, padding) {\\n\",\n       \"\\t    var x = node.x + padding[3], y = node.y + padding[0], dx = node.dx - padding[1] - padding[3], dy = node.dy - padding[0] - padding[2];\\n\",\n       \"\\t    if (dx < 0) {\\n\",\n       \"\\t      x += dx / 2;\\n\",\n       \"\\t      dx = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (dy < 0) {\\n\",\n       \"\\t      y += dy / 2;\\n\",\n       \"\\t      dy = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return {\\n\",\n       \"\\t      x: x,\\n\",\n       \"\\t      y: y,\\n\",\n       \"\\t      dx: dx,\\n\",\n       \"\\t      dy: dy\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.random = {\\n\",\n       \"\\t    normal: function(µ, σ) {\\n\",\n       \"\\t      var n = arguments.length;\\n\",\n       \"\\t      if (n < 2) σ = 1;\\n\",\n       \"\\t      if (n < 1) µ = 0;\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        var x, y, r;\\n\",\n       \"\\t        do {\\n\",\n       \"\\t          x = Math.random() * 2 - 1;\\n\",\n       \"\\t          y = Math.random() * 2 - 1;\\n\",\n       \"\\t          r = x * x + y * y;\\n\",\n       \"\\t        } while (!r || r > 1);\\n\",\n       \"\\t        return µ + σ * x * Math.sqrt(-2 * Math.log(r) / r);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    },\\n\",\n       \"\\t    logNormal: function() {\\n\",\n       \"\\t      var random = d3.random.normal.apply(d3, arguments);\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        return Math.exp(random());\\n\",\n       \"\\t      };\\n\",\n       \"\\t    },\\n\",\n       \"\\t    bates: function(m) {\\n\",\n       \"\\t      var random = d3.random.irwinHall(m);\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        return random() / m;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    },\\n\",\n       \"\\t    irwinHall: function(m) {\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        for (var s = 0, j = 0; j < m; j++) s += Math.random();\\n\",\n       \"\\t        return s;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.scale = {};\\n\",\n       \"\\t  function d3_scaleExtent(domain) {\\n\",\n       \"\\t    var start = domain[0], stop = domain[domain.length - 1];\\n\",\n       \"\\t    return start < stop ? [ start, stop ] : [ stop, start ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scaleRange(scale) {\\n\",\n       \"\\t    return scale.rangeExtent ? scale.rangeExtent() : d3_scaleExtent(scale.range());\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_bilinear(domain, range, uninterpolate, interpolate) {\\n\",\n       \"\\t    var u = uninterpolate(domain[0], domain[1]), i = interpolate(range[0], range[1]);\\n\",\n       \"\\t    return function(x) {\\n\",\n       \"\\t      return i(u(x));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_nice(domain, nice) {\\n\",\n       \"\\t    var i0 = 0, i1 = domain.length - 1, x0 = domain[i0], x1 = domain[i1], dx;\\n\",\n       \"\\t    if (x1 < x0) {\\n\",\n       \"\\t      dx = i0, i0 = i1, i1 = dx;\\n\",\n       \"\\t      dx = x0, x0 = x1, x1 = dx;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    domain[i0] = nice.floor(x0);\\n\",\n       \"\\t    domain[i1] = nice.ceil(x1);\\n\",\n       \"\\t    return domain;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_niceStep(step) {\\n\",\n       \"\\t    return step ? {\\n\",\n       \"\\t      floor: function(x) {\\n\",\n       \"\\t        return Math.floor(x / step) * step;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      ceil: function(x) {\\n\",\n       \"\\t        return Math.ceil(x / step) * step;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } : d3_scale_niceIdentity;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_scale_niceIdentity = {\\n\",\n       \"\\t    floor: d3_identity,\\n\",\n       \"\\t    ceil: d3_identity\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_polylinear(domain, range, uninterpolate, interpolate) {\\n\",\n       \"\\t    var u = [], i = [], j = 0, k = Math.min(domain.length, range.length) - 1;\\n\",\n       \"\\t    if (domain[k] < domain[0]) {\\n\",\n       \"\\t      domain = domain.slice().reverse();\\n\",\n       \"\\t      range = range.slice().reverse();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    while (++j <= k) {\\n\",\n       \"\\t      u.push(uninterpolate(domain[j - 1], domain[j]));\\n\",\n       \"\\t      i.push(interpolate(range[j - 1], range[j]));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return function(x) {\\n\",\n       \"\\t      var j = d3.bisect(domain, x, 1, k) - 1;\\n\",\n       \"\\t      return i[j](u[j](x));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.linear = function() {\\n\",\n       \"\\t    return d3_scale_linear([ 0, 1 ], [ 0, 1 ], d3_interpolate, false);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_linear(domain, range, interpolate, clamp) {\\n\",\n       \"\\t    var output, input;\\n\",\n       \"\\t    function rescale() {\\n\",\n       \"\\t      var linear = Math.min(domain.length, range.length) > 2 ? d3_scale_polylinear : d3_scale_bilinear, uninterpolate = clamp ? d3_uninterpolateClamp : d3_uninterpolateNumber;\\n\",\n       \"\\t      output = linear(domain, range, uninterpolate, interpolate);\\n\",\n       \"\\t      input = linear(range, domain, uninterpolate, d3_interpolate);\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      return output(x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.invert = function(y) {\\n\",\n       \"\\t      return input(y);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      domain = x.map(Number);\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.range = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return range;\\n\",\n       \"\\t      range = x;\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangeRound = function(x) {\\n\",\n       \"\\t      return scale.range(x).interpolate(d3_interpolateRound);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.clamp = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return clamp;\\n\",\n       \"\\t      clamp = x;\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.interpolate = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return interpolate;\\n\",\n       \"\\t      interpolate = x;\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.ticks = function(m) {\\n\",\n       \"\\t      return d3_scale_linearTicks(domain, m);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.tickFormat = function(m, format) {\\n\",\n       \"\\t      return d3_scale_linearTickFormat(domain, m, format);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.nice = function(m) {\\n\",\n       \"\\t      d3_scale_linearNice(domain, m);\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_linear(domain, range, interpolate, clamp);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return rescale();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_linearRebind(scale, linear) {\\n\",\n       \"\\t    return d3.rebind(scale, linear, \\\"range\\\", \\\"rangeRound\\\", \\\"interpolate\\\", \\\"clamp\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_linearNice(domain, m) {\\n\",\n       \"\\t    d3_scale_nice(domain, d3_scale_niceStep(d3_scale_linearTickRange(domain, m)[2]));\\n\",\n       \"\\t    d3_scale_nice(domain, d3_scale_niceStep(d3_scale_linearTickRange(domain, m)[2]));\\n\",\n       \"\\t    return domain;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_linearTickRange(domain, m) {\\n\",\n       \"\\t    if (m == null) m = 10;\\n\",\n       \"\\t    var extent = d3_scaleExtent(domain), span = extent[1] - extent[0], step = Math.pow(10, Math.floor(Math.log(span / m) / Math.LN10)), err = m / span * step;\\n\",\n       \"\\t    if (err <= .15) step *= 10; else if (err <= .35) step *= 5; else if (err <= .75) step *= 2;\\n\",\n       \"\\t    extent[0] = Math.ceil(extent[0] / step) * step;\\n\",\n       \"\\t    extent[1] = Math.floor(extent[1] / step) * step + step * .5;\\n\",\n       \"\\t    extent[2] = step;\\n\",\n       \"\\t    return extent;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_linearTicks(domain, m) {\\n\",\n       \"\\t    return d3.range.apply(d3, d3_scale_linearTickRange(domain, m));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_linearTickFormat(domain, m, format) {\\n\",\n       \"\\t    var range = d3_scale_linearTickRange(domain, m);\\n\",\n       \"\\t    if (format) {\\n\",\n       \"\\t      var match = d3_format_re.exec(format);\\n\",\n       \"\\t      match.shift();\\n\",\n       \"\\t      if (match[8] === \\\"s\\\") {\\n\",\n       \"\\t        var prefix = d3.formatPrefix(Math.max(abs(range[0]), abs(range[1])));\\n\",\n       \"\\t        if (!match[7]) match[7] = \\\".\\\" + d3_scale_linearPrecision(prefix.scale(range[2]));\\n\",\n       \"\\t        match[8] = \\\"f\\\";\\n\",\n       \"\\t        format = d3.format(match.join(\\\"\\\"));\\n\",\n       \"\\t        return function(d) {\\n\",\n       \"\\t          return format(prefix.scale(d)) + prefix.symbol;\\n\",\n       \"\\t        };\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!match[7]) match[7] = \\\".\\\" + d3_scale_linearFormatPrecision(match[8], range);\\n\",\n       \"\\t      format = match.join(\\\"\\\");\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      format = \\\",.\\\" + d3_scale_linearPrecision(range[2]) + \\\"f\\\";\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3.format(format);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_scale_linearFormatSignificant = {\\n\",\n       \"\\t    s: 1,\\n\",\n       \"\\t    g: 1,\\n\",\n       \"\\t    p: 1,\\n\",\n       \"\\t    r: 1,\\n\",\n       \"\\t    e: 1\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_linearPrecision(value) {\\n\",\n       \"\\t    return -Math.floor(Math.log(value) / Math.LN10 + .01);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_linearFormatPrecision(type, range) {\\n\",\n       \"\\t    var p = d3_scale_linearPrecision(range[2]);\\n\",\n       \"\\t    return type in d3_scale_linearFormatSignificant ? Math.abs(p - d3_scale_linearPrecision(Math.max(abs(range[0]), abs(range[1])))) + +(type !== \\\"e\\\") : p - (type === \\\"%\\\") * 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.log = function() {\\n\",\n       \"\\t    return d3_scale_log(d3.scale.linear().domain([ 0, 1 ]), 10, true, [ 1, 10 ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_log(linear, base, positive, domain) {\\n\",\n       \"\\t    function log(x) {\\n\",\n       \"\\t      return (positive ? Math.log(x < 0 ? 0 : x) : -Math.log(x > 0 ? 0 : -x)) / Math.log(base);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function pow(x) {\\n\",\n       \"\\t      return positive ? Math.pow(base, x) : -Math.pow(base, -x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      return linear(log(x));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.invert = function(x) {\\n\",\n       \"\\t      return pow(linear.invert(x));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      positive = x[0] >= 0;\\n\",\n       \"\\t      linear.domain((domain = x.map(Number)).map(log));\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.base = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return base;\\n\",\n       \"\\t      base = +_;\\n\",\n       \"\\t      linear.domain(domain.map(log));\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.nice = function() {\\n\",\n       \"\\t      var niced = d3_scale_nice(domain.map(log), positive ? Math : d3_scale_logNiceNegative);\\n\",\n       \"\\t      linear.domain(niced);\\n\",\n       \"\\t      domain = niced.map(pow);\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.ticks = function() {\\n\",\n       \"\\t      var extent = d3_scaleExtent(domain), ticks = [], u = extent[0], v = extent[1], i = Math.floor(log(u)), j = Math.ceil(log(v)), n = base % 1 ? 2 : base;\\n\",\n       \"\\t      if (isFinite(j - i)) {\\n\",\n       \"\\t        if (positive) {\\n\",\n       \"\\t          for (;i < j; i++) for (var k = 1; k < n; k++) ticks.push(pow(i) * k);\\n\",\n       \"\\t          ticks.push(pow(i));\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          ticks.push(pow(i));\\n\",\n       \"\\t          for (;i++ < j; ) for (var k = n - 1; k > 0; k--) ticks.push(pow(i) * k);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        for (i = 0; ticks[i] < u; i++) {}\\n\",\n       \"\\t        for (j = ticks.length; ticks[j - 1] > v; j--) {}\\n\",\n       \"\\t        ticks = ticks.slice(i, j);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return ticks;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.tickFormat = function(n, format) {\\n\",\n       \"\\t      if (!arguments.length) return d3_scale_logFormat;\\n\",\n       \"\\t      if (arguments.length < 2) format = d3_scale_logFormat; else if (typeof format !== \\\"function\\\") format = d3.format(format);\\n\",\n       \"\\t      var k = Math.max(1, base * n / scale.ticks().length);\\n\",\n       \"\\t      return function(d) {\\n\",\n       \"\\t        var i = d / pow(Math.round(log(d)));\\n\",\n       \"\\t        if (i * base < base - .5) i *= base;\\n\",\n       \"\\t        return i <= k ? format(d) : \\\"\\\";\\n\",\n       \"\\t      };\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_log(linear.copy(), base, positive, domain);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_scale_linearRebind(scale, linear);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_scale_logFormat = d3.format(\\\".0e\\\"), d3_scale_logNiceNegative = {\\n\",\n       \"\\t    floor: function(x) {\\n\",\n       \"\\t      return -Math.ceil(-x);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    ceil: function(x) {\\n\",\n       \"\\t      return -Math.floor(-x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.scale.pow = function() {\\n\",\n       \"\\t    return d3_scale_pow(d3.scale.linear(), 1, [ 0, 1 ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_pow(linear, exponent, domain) {\\n\",\n       \"\\t    var powp = d3_scale_powPow(exponent), powb = d3_scale_powPow(1 / exponent);\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      return linear(powp(x));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.invert = function(x) {\\n\",\n       \"\\t      return powb(linear.invert(x));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      linear.domain((domain = x.map(Number)).map(powp));\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.ticks = function(m) {\\n\",\n       \"\\t      return d3_scale_linearTicks(domain, m);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.tickFormat = function(m, format) {\\n\",\n       \"\\t      return d3_scale_linearTickFormat(domain, m, format);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.nice = function(m) {\\n\",\n       \"\\t      return scale.domain(d3_scale_linearNice(domain, m));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.exponent = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return exponent;\\n\",\n       \"\\t      powp = d3_scale_powPow(exponent = x);\\n\",\n       \"\\t      powb = d3_scale_powPow(1 / exponent);\\n\",\n       \"\\t      linear.domain(domain.map(powp));\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_pow(linear.copy(), exponent, domain);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_scale_linearRebind(scale, linear);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_scale_powPow(e) {\\n\",\n       \"\\t    return function(x) {\\n\",\n       \"\\t      return x < 0 ? -Math.pow(-x, e) : Math.pow(x, e);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.sqrt = function() {\\n\",\n       \"\\t    return d3.scale.pow().exponent(.5);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.scale.ordinal = function() {\\n\",\n       \"\\t    return d3_scale_ordinal([], {\\n\",\n       \"\\t      t: \\\"range\\\",\\n\",\n       \"\\t      a: [ [] ]\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_ordinal(domain, ranger) {\\n\",\n       \"\\t    var index, range, rangeBand;\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      return range[((index.get(x) || (ranger.t === \\\"range\\\" ? index.set(x, domain.push(x)) : NaN)) - 1) % range.length];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function steps(start, step) {\\n\",\n       \"\\t      return d3.range(domain.length).map(function(i) {\\n\",\n       \"\\t        return start + step * i;\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      domain = [];\\n\",\n       \"\\t      index = new d3_Map();\\n\",\n       \"\\t      var i = -1, n = x.length, xi;\\n\",\n       \"\\t      while (++i < n) if (!index.has(xi = x[i])) index.set(xi, domain.push(xi));\\n\",\n       \"\\t      return scale[ranger.t].apply(scale, ranger.a);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.range = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return range;\\n\",\n       \"\\t      range = x;\\n\",\n       \"\\t      rangeBand = 0;\\n\",\n       \"\\t      ranger = {\\n\",\n       \"\\t        t: \\\"range\\\",\\n\",\n       \"\\t        a: arguments\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangePoints = function(x, padding) {\\n\",\n       \"\\t      if (arguments.length < 2) padding = 0;\\n\",\n       \"\\t      var start = x[0], stop = x[1], step = domain.length < 2 ? (start = (start + stop) / 2, \\n\",\n       \"\\t      0) : (stop - start) / (domain.length - 1 + padding);\\n\",\n       \"\\t      range = steps(start + step * padding / 2, step);\\n\",\n       \"\\t      rangeBand = 0;\\n\",\n       \"\\t      ranger = {\\n\",\n       \"\\t        t: \\\"rangePoints\\\",\\n\",\n       \"\\t        a: arguments\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangeRoundPoints = function(x, padding) {\\n\",\n       \"\\t      if (arguments.length < 2) padding = 0;\\n\",\n       \"\\t      var start = x[0], stop = x[1], step = domain.length < 2 ? (start = stop = Math.round((start + stop) / 2), \\n\",\n       \"\\t      0) : (stop - start) / (domain.length - 1 + padding) | 0;\\n\",\n       \"\\t      range = steps(start + Math.round(step * padding / 2 + (stop - start - (domain.length - 1 + padding) * step) / 2), step);\\n\",\n       \"\\t      rangeBand = 0;\\n\",\n       \"\\t      ranger = {\\n\",\n       \"\\t        t: \\\"rangeRoundPoints\\\",\\n\",\n       \"\\t        a: arguments\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangeBands = function(x, padding, outerPadding) {\\n\",\n       \"\\t      if (arguments.length < 2) padding = 0;\\n\",\n       \"\\t      if (arguments.length < 3) outerPadding = padding;\\n\",\n       \"\\t      var reverse = x[1] < x[0], start = x[reverse - 0], stop = x[1 - reverse], step = (stop - start) / (domain.length - padding + 2 * outerPadding);\\n\",\n       \"\\t      range = steps(start + step * outerPadding, step);\\n\",\n       \"\\t      if (reverse) range.reverse();\\n\",\n       \"\\t      rangeBand = step * (1 - padding);\\n\",\n       \"\\t      ranger = {\\n\",\n       \"\\t        t: \\\"rangeBands\\\",\\n\",\n       \"\\t        a: arguments\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangeRoundBands = function(x, padding, outerPadding) {\\n\",\n       \"\\t      if (arguments.length < 2) padding = 0;\\n\",\n       \"\\t      if (arguments.length < 3) outerPadding = padding;\\n\",\n       \"\\t      var reverse = x[1] < x[0], start = x[reverse - 0], stop = x[1 - reverse], step = Math.floor((stop - start) / (domain.length - padding + 2 * outerPadding));\\n\",\n       \"\\t      range = steps(start + Math.round((stop - start - (domain.length - padding) * step) / 2), step);\\n\",\n       \"\\t      if (reverse) range.reverse();\\n\",\n       \"\\t      rangeBand = Math.round(step * (1 - padding));\\n\",\n       \"\\t      ranger = {\\n\",\n       \"\\t        t: \\\"rangeRoundBands\\\",\\n\",\n       \"\\t        a: arguments\\n\",\n       \"\\t      };\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangeBand = function() {\\n\",\n       \"\\t      return rangeBand;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.rangeExtent = function() {\\n\",\n       \"\\t      return d3_scaleExtent(ranger.a[0]);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_ordinal(domain, ranger);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return scale.domain(domain);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.category10 = function() {\\n\",\n       \"\\t    return d3.scale.ordinal().range(d3_category10);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.scale.category20 = function() {\\n\",\n       \"\\t    return d3.scale.ordinal().range(d3_category20);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.scale.category20b = function() {\\n\",\n       \"\\t    return d3.scale.ordinal().range(d3_category20b);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.scale.category20c = function() {\\n\",\n       \"\\t    return d3.scale.ordinal().range(d3_category20c);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_category10 = [ 2062260, 16744206, 2924588, 14034728, 9725885, 9197131, 14907330, 8355711, 12369186, 1556175 ].map(d3_rgbString);\\n\",\n       \"\\t  var d3_category20 = [ 2062260, 11454440, 16744206, 16759672, 2924588, 10018698, 14034728, 16750742, 9725885, 12955861, 9197131, 12885140, 14907330, 16234194, 8355711, 13092807, 12369186, 14408589, 1556175, 10410725 ].map(d3_rgbString);\\n\",\n       \"\\t  var d3_category20b = [ 3750777, 5395619, 7040719, 10264286, 6519097, 9216594, 11915115, 13556636, 9202993, 12426809, 15186514, 15190932, 8666169, 11356490, 14049643, 15177372, 8077683, 10834324, 13528509, 14589654 ].map(d3_rgbString);\\n\",\n       \"\\t  var d3_category20c = [ 3244733, 7057110, 10406625, 13032431, 15095053, 16616764, 16625259, 16634018, 3253076, 7652470, 10607003, 13101504, 7695281, 10394312, 12369372, 14342891, 6513507, 9868950, 12434877, 14277081 ].map(d3_rgbString);\\n\",\n       \"\\t  d3.scale.quantile = function() {\\n\",\n       \"\\t    return d3_scale_quantile([], []);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_quantile(domain, range) {\\n\",\n       \"\\t    var thresholds;\\n\",\n       \"\\t    function rescale() {\\n\",\n       \"\\t      var k = 0, q = range.length;\\n\",\n       \"\\t      thresholds = [];\\n\",\n       \"\\t      while (++k < q) thresholds[k - 1] = d3.quantile(domain, k / q);\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      if (!isNaN(x = +x)) return range[d3.bisect(thresholds, x)];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      domain = x.map(d3_number).filter(d3_numeric).sort(d3_ascending);\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.range = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return range;\\n\",\n       \"\\t      range = x;\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.quantiles = function() {\\n\",\n       \"\\t      return thresholds;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.invertExtent = function(y) {\\n\",\n       \"\\t      y = range.indexOf(y);\\n\",\n       \"\\t      return y < 0 ? [ NaN, NaN ] : [ y > 0 ? thresholds[y - 1] : domain[0], y < thresholds.length ? thresholds[y] : domain[domain.length - 1] ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_quantile(domain, range);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return rescale();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.quantize = function() {\\n\",\n       \"\\t    return d3_scale_quantize(0, 1, [ 0, 1 ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_quantize(x0, x1, range) {\\n\",\n       \"\\t    var kx, i;\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      return range[Math.max(0, Math.min(i, Math.floor(kx * (x - x0))))];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function rescale() {\\n\",\n       \"\\t      kx = range.length / (x1 - x0);\\n\",\n       \"\\t      i = range.length - 1;\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return [ x0, x1 ];\\n\",\n       \"\\t      x0 = +x[0];\\n\",\n       \"\\t      x1 = +x[x.length - 1];\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.range = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return range;\\n\",\n       \"\\t      range = x;\\n\",\n       \"\\t      return rescale();\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.invertExtent = function(y) {\\n\",\n       \"\\t      y = range.indexOf(y);\\n\",\n       \"\\t      y = y < 0 ? NaN : y / kx + x0;\\n\",\n       \"\\t      return [ y, y + 1 / kx ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_quantize(x0, x1, range);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return rescale();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.threshold = function() {\\n\",\n       \"\\t    return d3_scale_threshold([ .5 ], [ 0, 1 ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_threshold(domain, range) {\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      if (x <= x) return range[d3.bisect(domain, x)];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.domain = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      domain = _;\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.range = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return range;\\n\",\n       \"\\t      range = _;\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.invertExtent = function(y) {\\n\",\n       \"\\t      y = range.indexOf(y);\\n\",\n       \"\\t      return [ domain[y - 1], domain[y] ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_scale_threshold(domain, range);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return scale;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.scale.identity = function() {\\n\",\n       \"\\t    return d3_scale_identity([ 0, 1 ]);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_scale_identity(domain) {\\n\",\n       \"\\t    function identity(x) {\\n\",\n       \"\\t      return +x;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    identity.invert = identity;\\n\",\n       \"\\t    identity.domain = identity.range = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return domain;\\n\",\n       \"\\t      domain = x.map(identity);\\n\",\n       \"\\t      return identity;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    identity.ticks = function(m) {\\n\",\n       \"\\t      return d3_scale_linearTicks(domain, m);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    identity.tickFormat = function(m, format) {\\n\",\n       \"\\t      return d3_scale_linearTickFormat(domain, m, format);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    identity.copy = function() {\\n\",\n       \"\\t      return d3_scale_identity(domain);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return identity;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg = {};\\n\",\n       \"\\t  function d3_zero() {\\n\",\n       \"\\t    return 0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.arc = function() {\\n\",\n       \"\\t    var innerRadius = d3_svg_arcInnerRadius, outerRadius = d3_svg_arcOuterRadius, cornerRadius = d3_zero, padRadius = d3_svg_arcAuto, startAngle = d3_svg_arcStartAngle, endAngle = d3_svg_arcEndAngle, padAngle = d3_svg_arcPadAngle;\\n\",\n       \"\\t    function arc() {\\n\",\n       \"\\t      var r0 = Math.max(0, +innerRadius.apply(this, arguments)), r1 = Math.max(0, +outerRadius.apply(this, arguments)), a0 = startAngle.apply(this, arguments) - halfπ, a1 = endAngle.apply(this, arguments) - halfπ, da = Math.abs(a1 - a0), cw = a0 > a1 ? 0 : 1;\\n\",\n       \"\\t      if (r1 < r0) rc = r1, r1 = r0, r0 = rc;\\n\",\n       \"\\t      if (da >= τε) return circleSegment(r1, cw) + (r0 ? circleSegment(r0, 1 - cw) : \\\"\\\") + \\\"Z\\\";\\n\",\n       \"\\t      var rc, cr, rp, ap, p0 = 0, p1 = 0, x0, y0, x1, y1, x2, y2, x3, y3, path = [];\\n\",\n       \"\\t      if (ap = (+padAngle.apply(this, arguments) || 0) / 2) {\\n\",\n       \"\\t        rp = padRadius === d3_svg_arcAuto ? Math.sqrt(r0 * r0 + r1 * r1) : +padRadius.apply(this, arguments);\\n\",\n       \"\\t        if (!cw) p1 *= -1;\\n\",\n       \"\\t        if (r1) p1 = d3_asin(rp / r1 * Math.sin(ap));\\n\",\n       \"\\t        if (r0) p0 = d3_asin(rp / r0 * Math.sin(ap));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (r1) {\\n\",\n       \"\\t        x0 = r1 * Math.cos(a0 + p1);\\n\",\n       \"\\t        y0 = r1 * Math.sin(a0 + p1);\\n\",\n       \"\\t        x1 = r1 * Math.cos(a1 - p1);\\n\",\n       \"\\t        y1 = r1 * Math.sin(a1 - p1);\\n\",\n       \"\\t        var l1 = Math.abs(a1 - a0 - 2 * p1) <= π ? 0 : 1;\\n\",\n       \"\\t        if (p1 && d3_svg_arcSweep(x0, y0, x1, y1) === cw ^ l1) {\\n\",\n       \"\\t          var h1 = (a0 + a1) / 2;\\n\",\n       \"\\t          x0 = r1 * Math.cos(h1);\\n\",\n       \"\\t          y0 = r1 * Math.sin(h1);\\n\",\n       \"\\t          x1 = y1 = null;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        x0 = y0 = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (r0) {\\n\",\n       \"\\t        x2 = r0 * Math.cos(a1 - p0);\\n\",\n       \"\\t        y2 = r0 * Math.sin(a1 - p0);\\n\",\n       \"\\t        x3 = r0 * Math.cos(a0 + p0);\\n\",\n       \"\\t        y3 = r0 * Math.sin(a0 + p0);\\n\",\n       \"\\t        var l0 = Math.abs(a0 - a1 + 2 * p0) <= π ? 0 : 1;\\n\",\n       \"\\t        if (p0 && d3_svg_arcSweep(x2, y2, x3, y3) === 1 - cw ^ l0) {\\n\",\n       \"\\t          var h0 = (a0 + a1) / 2;\\n\",\n       \"\\t          x2 = r0 * Math.cos(h0);\\n\",\n       \"\\t          y2 = r0 * Math.sin(h0);\\n\",\n       \"\\t          x3 = y3 = null;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        x2 = y2 = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (da > ε && (rc = Math.min(Math.abs(r1 - r0) / 2, +cornerRadius.apply(this, arguments))) > .001) {\\n\",\n       \"\\t        cr = r0 < r1 ^ cw ? 0 : 1;\\n\",\n       \"\\t        var rc1 = rc, rc0 = rc;\\n\",\n       \"\\t        if (da < π) {\\n\",\n       \"\\t          var oc = x3 == null ? [ x2, y2 ] : x1 == null ? [ x0, y0 ] : d3_geom_polygonIntersect([ x0, y0 ], [ x3, y3 ], [ x1, y1 ], [ x2, y2 ]), ax = x0 - oc[0], ay = y0 - oc[1], bx = x1 - oc[0], by = y1 - oc[1], kc = 1 / Math.sin(Math.acos((ax * bx + ay * by) / (Math.sqrt(ax * ax + ay * ay) * Math.sqrt(bx * bx + by * by))) / 2), lc = Math.sqrt(oc[0] * oc[0] + oc[1] * oc[1]);\\n\",\n       \"\\t          rc0 = Math.min(rc, (r0 - lc) / (kc - 1));\\n\",\n       \"\\t          rc1 = Math.min(rc, (r1 - lc) / (kc + 1));\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (x1 != null) {\\n\",\n       \"\\t          var t30 = d3_svg_arcCornerTangents(x3 == null ? [ x2, y2 ] : [ x3, y3 ], [ x0, y0 ], r1, rc1, cw), t12 = d3_svg_arcCornerTangents([ x1, y1 ], [ x2, y2 ], r1, rc1, cw);\\n\",\n       \"\\t          if (rc === rc1) {\\n\",\n       \"\\t            path.push(\\\"M\\\", t30[0], \\\"A\\\", rc1, \\\",\\\", rc1, \\\" 0 0,\\\", cr, \\\" \\\", t30[1], \\\"A\\\", r1, \\\",\\\", r1, \\\" 0 \\\", 1 - cw ^ d3_svg_arcSweep(t30[1][0], t30[1][1], t12[1][0], t12[1][1]), \\\",\\\", cw, \\\" \\\", t12[1], \\\"A\\\", rc1, \\\",\\\", rc1, \\\" 0 0,\\\", cr, \\\" \\\", t12[0]);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            path.push(\\\"M\\\", t30[0], \\\"A\\\", rc1, \\\",\\\", rc1, \\\" 0 1,\\\", cr, \\\" \\\", t12[0]);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          path.push(\\\"M\\\", x0, \\\",\\\", y0);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (x3 != null) {\\n\",\n       \"\\t          var t03 = d3_svg_arcCornerTangents([ x0, y0 ], [ x3, y3 ], r0, -rc0, cw), t21 = d3_svg_arcCornerTangents([ x2, y2 ], x1 == null ? [ x0, y0 ] : [ x1, y1 ], r0, -rc0, cw);\\n\",\n       \"\\t          if (rc === rc0) {\\n\",\n       \"\\t            path.push(\\\"L\\\", t21[0], \\\"A\\\", rc0, \\\",\\\", rc0, \\\" 0 0,\\\", cr, \\\" \\\", t21[1], \\\"A\\\", r0, \\\",\\\", r0, \\\" 0 \\\", cw ^ d3_svg_arcSweep(t21[1][0], t21[1][1], t03[1][0], t03[1][1]), \\\",\\\", 1 - cw, \\\" \\\", t03[1], \\\"A\\\", rc0, \\\",\\\", rc0, \\\" 0 0,\\\", cr, \\\" \\\", t03[0]);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            path.push(\\\"L\\\", t21[0], \\\"A\\\", rc0, \\\",\\\", rc0, \\\" 0 0,\\\", cr, \\\" \\\", t03[0]);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          path.push(\\\"L\\\", x2, \\\",\\\", y2);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        path.push(\\\"M\\\", x0, \\\",\\\", y0);\\n\",\n       \"\\t        if (x1 != null) path.push(\\\"A\\\", r1, \\\",\\\", r1, \\\" 0 \\\", l1, \\\",\\\", cw, \\\" \\\", x1, \\\",\\\", y1);\\n\",\n       \"\\t        path.push(\\\"L\\\", x2, \\\",\\\", y2);\\n\",\n       \"\\t        if (x3 != null) path.push(\\\"A\\\", r0, \\\",\\\", r0, \\\" 0 \\\", l0, \\\",\\\", 1 - cw, \\\" \\\", x3, \\\",\\\", y3);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      path.push(\\\"Z\\\");\\n\",\n       \"\\t      return path.join(\\\"\\\");\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function circleSegment(r1, cw) {\\n\",\n       \"\\t      return \\\"M0,\\\" + r1 + \\\"A\\\" + r1 + \\\",\\\" + r1 + \\\" 0 1,\\\" + cw + \\\" 0,\\\" + -r1 + \\\"A\\\" + r1 + \\\",\\\" + r1 + \\\" 0 1,\\\" + cw + \\\" 0,\\\" + r1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    arc.innerRadius = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return innerRadius;\\n\",\n       \"\\t      innerRadius = d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.outerRadius = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return outerRadius;\\n\",\n       \"\\t      outerRadius = d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.cornerRadius = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return cornerRadius;\\n\",\n       \"\\t      cornerRadius = d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.padRadius = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return padRadius;\\n\",\n       \"\\t      padRadius = v == d3_svg_arcAuto ? d3_svg_arcAuto : d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.startAngle = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return startAngle;\\n\",\n       \"\\t      startAngle = d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.endAngle = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return endAngle;\\n\",\n       \"\\t      endAngle = d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.padAngle = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return padAngle;\\n\",\n       \"\\t      padAngle = d3_functor(v);\\n\",\n       \"\\t      return arc;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    arc.centroid = function() {\\n\",\n       \"\\t      var r = (+innerRadius.apply(this, arguments) + +outerRadius.apply(this, arguments)) / 2, a = (+startAngle.apply(this, arguments) + +endAngle.apply(this, arguments)) / 2 - halfπ;\\n\",\n       \"\\t      return [ Math.cos(a) * r, Math.sin(a) * r ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return arc;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_svg_arcAuto = \\\"auto\\\";\\n\",\n       \"\\t  function d3_svg_arcInnerRadius(d) {\\n\",\n       \"\\t    return d.innerRadius;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_arcOuterRadius(d) {\\n\",\n       \"\\t    return d.outerRadius;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_arcStartAngle(d) {\\n\",\n       \"\\t    return d.startAngle;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_arcEndAngle(d) {\\n\",\n       \"\\t    return d.endAngle;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_arcPadAngle(d) {\\n\",\n       \"\\t    return d && d.padAngle;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_arcSweep(x0, y0, x1, y1) {\\n\",\n       \"\\t    return (x0 - x1) * y0 - (y0 - y1) * x0 > 0 ? 0 : 1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_arcCornerTangents(p0, p1, r1, rc, cw) {\\n\",\n       \"\\t    var x01 = p0[0] - p1[0], y01 = p0[1] - p1[1], lo = (cw ? rc : -rc) / Math.sqrt(x01 * x01 + y01 * y01), ox = lo * y01, oy = -lo * x01, x1 = p0[0] + ox, y1 = p0[1] + oy, x2 = p1[0] + ox, y2 = p1[1] + oy, x3 = (x1 + x2) / 2, y3 = (y1 + y2) / 2, dx = x2 - x1, dy = y2 - y1, d2 = dx * dx + dy * dy, r = r1 - rc, D = x1 * y2 - x2 * y1, d = (dy < 0 ? -1 : 1) * Math.sqrt(Math.max(0, r * r * d2 - D * D)), cx0 = (D * dy - dx * d) / d2, cy0 = (-D * dx - dy * d) / d2, cx1 = (D * dy + dx * d) / d2, cy1 = (-D * dx + dy * d) / d2, dx0 = cx0 - x3, dy0 = cy0 - y3, dx1 = cx1 - x3, dy1 = cy1 - y3;\\n\",\n       \"\\t    if (dx0 * dx0 + dy0 * dy0 > dx1 * dx1 + dy1 * dy1) cx0 = cx1, cy0 = cy1;\\n\",\n       \"\\t    return [ [ cx0 - ox, cy0 - oy ], [ cx0 * r1 / r, cy0 * r1 / r ] ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_line(projection) {\\n\",\n       \"\\t    var x = d3_geom_pointX, y = d3_geom_pointY, defined = d3_true, interpolate = d3_svg_lineLinear, interpolateKey = interpolate.key, tension = .7;\\n\",\n       \"\\t    function line(data) {\\n\",\n       \"\\t      var segments = [], points = [], i = -1, n = data.length, d, fx = d3_functor(x), fy = d3_functor(y);\\n\",\n       \"\\t      function segment() {\\n\",\n       \"\\t        segments.push(\\\"M\\\", interpolate(projection(points), tension));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (defined.call(this, d = data[i], i)) {\\n\",\n       \"\\t          points.push([ +fx.call(this, d, i), +fy.call(this, d, i) ]);\\n\",\n       \"\\t        } else if (points.length) {\\n\",\n       \"\\t          segment();\\n\",\n       \"\\t          points = [];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (points.length) segment();\\n\",\n       \"\\t      return segments.length ? segments.join(\\\"\\\") : null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    line.x = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return x;\\n\",\n       \"\\t      x = _;\\n\",\n       \"\\t      return line;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    line.y = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return y;\\n\",\n       \"\\t      y = _;\\n\",\n       \"\\t      return line;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    line.defined = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return defined;\\n\",\n       \"\\t      defined = _;\\n\",\n       \"\\t      return line;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    line.interpolate = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return interpolateKey;\\n\",\n       \"\\t      if (typeof _ === \\\"function\\\") interpolateKey = interpolate = _; else interpolateKey = (interpolate = d3_svg_lineInterpolators.get(_) || d3_svg_lineLinear).key;\\n\",\n       \"\\t      return line;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    line.tension = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return tension;\\n\",\n       \"\\t      tension = _;\\n\",\n       \"\\t      return line;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return line;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.line = function() {\\n\",\n       \"\\t    return d3_svg_line(d3_identity);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_svg_lineInterpolators = d3.map({\\n\",\n       \"\\t    linear: d3_svg_lineLinear,\\n\",\n       \"\\t    \\\"linear-closed\\\": d3_svg_lineLinearClosed,\\n\",\n       \"\\t    step: d3_svg_lineStep,\\n\",\n       \"\\t    \\\"step-before\\\": d3_svg_lineStepBefore,\\n\",\n       \"\\t    \\\"step-after\\\": d3_svg_lineStepAfter,\\n\",\n       \"\\t    basis: d3_svg_lineBasis,\\n\",\n       \"\\t    \\\"basis-open\\\": d3_svg_lineBasisOpen,\\n\",\n       \"\\t    \\\"basis-closed\\\": d3_svg_lineBasisClosed,\\n\",\n       \"\\t    bundle: d3_svg_lineBundle,\\n\",\n       \"\\t    cardinal: d3_svg_lineCardinal,\\n\",\n       \"\\t    \\\"cardinal-open\\\": d3_svg_lineCardinalOpen,\\n\",\n       \"\\t    \\\"cardinal-closed\\\": d3_svg_lineCardinalClosed,\\n\",\n       \"\\t    monotone: d3_svg_lineMonotone\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_svg_lineInterpolators.forEach(function(key, value) {\\n\",\n       \"\\t    value.key = key;\\n\",\n       \"\\t    value.closed = /-closed$/.test(key);\\n\",\n       \"\\t  });\\n\",\n       \"\\t  function d3_svg_lineLinear(points) {\\n\",\n       \"\\t    return points.length > 1 ? points.join(\\\"L\\\") : points + \\\"Z\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineLinearClosed(points) {\\n\",\n       \"\\t    return points.join(\\\"L\\\") + \\\"Z\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineStep(points) {\\n\",\n       \"\\t    var i = 0, n = points.length, p = points[0], path = [ p[0], \\\",\\\", p[1] ];\\n\",\n       \"\\t    while (++i < n) path.push(\\\"H\\\", (p[0] + (p = points[i])[0]) / 2, \\\"V\\\", p[1]);\\n\",\n       \"\\t    if (n > 1) path.push(\\\"H\\\", p[0]);\\n\",\n       \"\\t    return path.join(\\\"\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineStepBefore(points) {\\n\",\n       \"\\t    var i = 0, n = points.length, p = points[0], path = [ p[0], \\\",\\\", p[1] ];\\n\",\n       \"\\t    while (++i < n) path.push(\\\"V\\\", (p = points[i])[1], \\\"H\\\", p[0]);\\n\",\n       \"\\t    return path.join(\\\"\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineStepAfter(points) {\\n\",\n       \"\\t    var i = 0, n = points.length, p = points[0], path = [ p[0], \\\",\\\", p[1] ];\\n\",\n       \"\\t    while (++i < n) path.push(\\\"H\\\", (p = points[i])[0], \\\"V\\\", p[1]);\\n\",\n       \"\\t    return path.join(\\\"\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineCardinalOpen(points, tension) {\\n\",\n       \"\\t    return points.length < 4 ? d3_svg_lineLinear(points) : points[1] + d3_svg_lineHermite(points.slice(1, -1), d3_svg_lineCardinalTangents(points, tension));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineCardinalClosed(points, tension) {\\n\",\n       \"\\t    return points.length < 3 ? d3_svg_lineLinearClosed(points) : points[0] + d3_svg_lineHermite((points.push(points[0]), \\n\",\n       \"\\t    points), d3_svg_lineCardinalTangents([ points[points.length - 2] ].concat(points, [ points[1] ]), tension));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineCardinal(points, tension) {\\n\",\n       \"\\t    return points.length < 3 ? d3_svg_lineLinear(points) : points[0] + d3_svg_lineHermite(points, d3_svg_lineCardinalTangents(points, tension));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineHermite(points, tangents) {\\n\",\n       \"\\t    if (tangents.length < 1 || points.length != tangents.length && points.length != tangents.length + 2) {\\n\",\n       \"\\t      return d3_svg_lineLinear(points);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var quad = points.length != tangents.length, path = \\\"\\\", p0 = points[0], p = points[1], t0 = tangents[0], t = t0, pi = 1;\\n\",\n       \"\\t    if (quad) {\\n\",\n       \"\\t      path += \\\"Q\\\" + (p[0] - t0[0] * 2 / 3) + \\\",\\\" + (p[1] - t0[1] * 2 / 3) + \\\",\\\" + p[0] + \\\",\\\" + p[1];\\n\",\n       \"\\t      p0 = points[1];\\n\",\n       \"\\t      pi = 2;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (tangents.length > 1) {\\n\",\n       \"\\t      t = tangents[1];\\n\",\n       \"\\t      p = points[pi];\\n\",\n       \"\\t      pi++;\\n\",\n       \"\\t      path += \\\"C\\\" + (p0[0] + t0[0]) + \\\",\\\" + (p0[1] + t0[1]) + \\\",\\\" + (p[0] - t[0]) + \\\",\\\" + (p[1] - t[1]) + \\\",\\\" + p[0] + \\\",\\\" + p[1];\\n\",\n       \"\\t      for (var i = 2; i < tangents.length; i++, pi++) {\\n\",\n       \"\\t        p = points[pi];\\n\",\n       \"\\t        t = tangents[i];\\n\",\n       \"\\t        path += \\\"S\\\" + (p[0] - t[0]) + \\\",\\\" + (p[1] - t[1]) + \\\",\\\" + p[0] + \\\",\\\" + p[1];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (quad) {\\n\",\n       \"\\t      var lp = points[pi];\\n\",\n       \"\\t      path += \\\"Q\\\" + (p[0] + t[0] * 2 / 3) + \\\",\\\" + (p[1] + t[1] * 2 / 3) + \\\",\\\" + lp[0] + \\\",\\\" + lp[1];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return path;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineCardinalTangents(points, tension) {\\n\",\n       \"\\t    var tangents = [], a = (1 - tension) / 2, p0, p1 = points[0], p2 = points[1], i = 1, n = points.length;\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      p0 = p1;\\n\",\n       \"\\t      p1 = p2;\\n\",\n       \"\\t      p2 = points[i];\\n\",\n       \"\\t      tangents.push([ a * (p2[0] - p0[0]), a * (p2[1] - p0[1]) ]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return tangents;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineBasis(points) {\\n\",\n       \"\\t    if (points.length < 3) return d3_svg_lineLinear(points);\\n\",\n       \"\\t    var i = 1, n = points.length, pi = points[0], x0 = pi[0], y0 = pi[1], px = [ x0, x0, x0, (pi = points[1])[0] ], py = [ y0, y0, y0, pi[1] ], path = [ x0, \\\",\\\", y0, \\\"L\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier3, px), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier3, py) ];\\n\",\n       \"\\t    points.push(points[n - 1]);\\n\",\n       \"\\t    while (++i <= n) {\\n\",\n       \"\\t      pi = points[i];\\n\",\n       \"\\t      px.shift();\\n\",\n       \"\\t      px.push(pi[0]);\\n\",\n       \"\\t      py.shift();\\n\",\n       \"\\t      py.push(pi[1]);\\n\",\n       \"\\t      d3_svg_lineBasisBezier(path, px, py);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    points.pop();\\n\",\n       \"\\t    path.push(\\\"L\\\", pi);\\n\",\n       \"\\t    return path.join(\\\"\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineBasisOpen(points) {\\n\",\n       \"\\t    if (points.length < 4) return d3_svg_lineLinear(points);\\n\",\n       \"\\t    var path = [], i = -1, n = points.length, pi, px = [ 0 ], py = [ 0 ];\\n\",\n       \"\\t    while (++i < 3) {\\n\",\n       \"\\t      pi = points[i];\\n\",\n       \"\\t      px.push(pi[0]);\\n\",\n       \"\\t      py.push(pi[1]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    path.push(d3_svg_lineDot4(d3_svg_lineBasisBezier3, px) + \\\",\\\" + d3_svg_lineDot4(d3_svg_lineBasisBezier3, py));\\n\",\n       \"\\t    --i;\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      pi = points[i];\\n\",\n       \"\\t      px.shift();\\n\",\n       \"\\t      px.push(pi[0]);\\n\",\n       \"\\t      py.shift();\\n\",\n       \"\\t      py.push(pi[1]);\\n\",\n       \"\\t      d3_svg_lineBasisBezier(path, px, py);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return path.join(\\\"\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineBasisClosed(points) {\\n\",\n       \"\\t    var path, i = -1, n = points.length, m = n + 4, pi, px = [], py = [];\\n\",\n       \"\\t    while (++i < 4) {\\n\",\n       \"\\t      pi = points[i % n];\\n\",\n       \"\\t      px.push(pi[0]);\\n\",\n       \"\\t      py.push(pi[1]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    path = [ d3_svg_lineDot4(d3_svg_lineBasisBezier3, px), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier3, py) ];\\n\",\n       \"\\t    --i;\\n\",\n       \"\\t    while (++i < m) {\\n\",\n       \"\\t      pi = points[i % n];\\n\",\n       \"\\t      px.shift();\\n\",\n       \"\\t      px.push(pi[0]);\\n\",\n       \"\\t      py.shift();\\n\",\n       \"\\t      py.push(pi[1]);\\n\",\n       \"\\t      d3_svg_lineBasisBezier(path, px, py);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return path.join(\\\"\\\");\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineBundle(points, tension) {\\n\",\n       \"\\t    var n = points.length - 1;\\n\",\n       \"\\t    if (n) {\\n\",\n       \"\\t      var x0 = points[0][0], y0 = points[0][1], dx = points[n][0] - x0, dy = points[n][1] - y0, i = -1, p, t;\\n\",\n       \"\\t      while (++i <= n) {\\n\",\n       \"\\t        p = points[i];\\n\",\n       \"\\t        t = i / n;\\n\",\n       \"\\t        p[0] = tension * p[0] + (1 - tension) * (x0 + t * dx);\\n\",\n       \"\\t        p[1] = tension * p[1] + (1 - tension) * (y0 + t * dy);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_svg_lineBasis(points);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineDot4(a, b) {\\n\",\n       \"\\t    return a[0] * b[0] + a[1] * b[1] + a[2] * b[2] + a[3] * b[3];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_svg_lineBasisBezier1 = [ 0, 2 / 3, 1 / 3, 0 ], d3_svg_lineBasisBezier2 = [ 0, 1 / 3, 2 / 3, 0 ], d3_svg_lineBasisBezier3 = [ 0, 1 / 6, 2 / 3, 1 / 6 ];\\n\",\n       \"\\t  function d3_svg_lineBasisBezier(path, x, y) {\\n\",\n       \"\\t    path.push(\\\"C\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier1, x), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier1, y), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier2, x), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier2, y), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier3, x), \\\",\\\", d3_svg_lineDot4(d3_svg_lineBasisBezier3, y));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineSlope(p0, p1) {\\n\",\n       \"\\t    return (p1[1] - p0[1]) / (p1[0] - p0[0]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineFiniteDifferences(points) {\\n\",\n       \"\\t    var i = 0, j = points.length - 1, m = [], p0 = points[0], p1 = points[1], d = m[0] = d3_svg_lineSlope(p0, p1);\\n\",\n       \"\\t    while (++i < j) {\\n\",\n       \"\\t      m[i] = (d + (d = d3_svg_lineSlope(p0 = p1, p1 = points[i + 1]))) / 2;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    m[i] = d;\\n\",\n       \"\\t    return m;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineMonotoneTangents(points) {\\n\",\n       \"\\t    var tangents = [], d, a, b, s, m = d3_svg_lineFiniteDifferences(points), i = -1, j = points.length - 1;\\n\",\n       \"\\t    while (++i < j) {\\n\",\n       \"\\t      d = d3_svg_lineSlope(points[i], points[i + 1]);\\n\",\n       \"\\t      if (abs(d) < ε) {\\n\",\n       \"\\t        m[i] = m[i + 1] = 0;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        a = m[i] / d;\\n\",\n       \"\\t        b = m[i + 1] / d;\\n\",\n       \"\\t        s = a * a + b * b;\\n\",\n       \"\\t        if (s > 9) {\\n\",\n       \"\\t          s = d * 3 / Math.sqrt(s);\\n\",\n       \"\\t          m[i] = s * a;\\n\",\n       \"\\t          m[i + 1] = s * b;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    i = -1;\\n\",\n       \"\\t    while (++i <= j) {\\n\",\n       \"\\t      s = (points[Math.min(j, i + 1)][0] - points[Math.max(0, i - 1)][0]) / (6 * (1 + m[i] * m[i]));\\n\",\n       \"\\t      tangents.push([ s || 0, m[i] * s || 0 ]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return tangents;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_lineMonotone(points) {\\n\",\n       \"\\t    return points.length < 3 ? d3_svg_lineLinear(points) : points[0] + d3_svg_lineHermite(points, d3_svg_lineMonotoneTangents(points));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.line.radial = function() {\\n\",\n       \"\\t    var line = d3_svg_line(d3_svg_lineRadial);\\n\",\n       \"\\t    line.radius = line.x, delete line.x;\\n\",\n       \"\\t    line.angle = line.y, delete line.y;\\n\",\n       \"\\t    return line;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_svg_lineRadial(points) {\\n\",\n       \"\\t    var point, i = -1, n = points.length, r, a;\\n\",\n       \"\\t    while (++i < n) {\\n\",\n       \"\\t      point = points[i];\\n\",\n       \"\\t      r = point[0];\\n\",\n       \"\\t      a = point[1] - halfπ;\\n\",\n       \"\\t      point[0] = r * Math.cos(a);\\n\",\n       \"\\t      point[1] = r * Math.sin(a);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return points;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_area(projection) {\\n\",\n       \"\\t    var x0 = d3_geom_pointX, x1 = d3_geom_pointX, y0 = 0, y1 = d3_geom_pointY, defined = d3_true, interpolate = d3_svg_lineLinear, interpolateKey = interpolate.key, interpolateReverse = interpolate, L = \\\"L\\\", tension = .7;\\n\",\n       \"\\t    function area(data) {\\n\",\n       \"\\t      var segments = [], points0 = [], points1 = [], i = -1, n = data.length, d, fx0 = d3_functor(x0), fy0 = d3_functor(y0), fx1 = x0 === x1 ? function() {\\n\",\n       \"\\t        return x;\\n\",\n       \"\\t      } : d3_functor(x1), fy1 = y0 === y1 ? function() {\\n\",\n       \"\\t        return y;\\n\",\n       \"\\t      } : d3_functor(y1), x, y;\\n\",\n       \"\\t      function segment() {\\n\",\n       \"\\t        segments.push(\\\"M\\\", interpolate(projection(points1), tension), L, interpolateReverse(projection(points0.reverse()), tension), \\\"Z\\\");\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++i < n) {\\n\",\n       \"\\t        if (defined.call(this, d = data[i], i)) {\\n\",\n       \"\\t          points0.push([ x = +fx0.call(this, d, i), y = +fy0.call(this, d, i) ]);\\n\",\n       \"\\t          points1.push([ +fx1.call(this, d, i), +fy1.call(this, d, i) ]);\\n\",\n       \"\\t        } else if (points0.length) {\\n\",\n       \"\\t          segment();\\n\",\n       \"\\t          points0 = [];\\n\",\n       \"\\t          points1 = [];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (points0.length) segment();\\n\",\n       \"\\t      return segments.length ? segments.join(\\\"\\\") : null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    area.x = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return x1;\\n\",\n       \"\\t      x0 = x1 = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.x0 = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return x0;\\n\",\n       \"\\t      x0 = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.x1 = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return x1;\\n\",\n       \"\\t      x1 = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.y = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return y1;\\n\",\n       \"\\t      y0 = y1 = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.y0 = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return y0;\\n\",\n       \"\\t      y0 = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.y1 = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return y1;\\n\",\n       \"\\t      y1 = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.defined = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return defined;\\n\",\n       \"\\t      defined = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.interpolate = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return interpolateKey;\\n\",\n       \"\\t      if (typeof _ === \\\"function\\\") interpolateKey = interpolate = _; else interpolateKey = (interpolate = d3_svg_lineInterpolators.get(_) || d3_svg_lineLinear).key;\\n\",\n       \"\\t      interpolateReverse = interpolate.reverse || interpolate;\\n\",\n       \"\\t      L = interpolate.closed ? \\\"M\\\" : \\\"L\\\";\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    area.tension = function(_) {\\n\",\n       \"\\t      if (!arguments.length) return tension;\\n\",\n       \"\\t      tension = _;\\n\",\n       \"\\t      return area;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return area;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_svg_lineStepBefore.reverse = d3_svg_lineStepAfter;\\n\",\n       \"\\t  d3_svg_lineStepAfter.reverse = d3_svg_lineStepBefore;\\n\",\n       \"\\t  d3.svg.area = function() {\\n\",\n       \"\\t    return d3_svg_area(d3_identity);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.svg.area.radial = function() {\\n\",\n       \"\\t    var area = d3_svg_area(d3_svg_lineRadial);\\n\",\n       \"\\t    area.radius = area.x, delete area.x;\\n\",\n       \"\\t    area.innerRadius = area.x0, delete area.x0;\\n\",\n       \"\\t    area.outerRadius = area.x1, delete area.x1;\\n\",\n       \"\\t    area.angle = area.y, delete area.y;\\n\",\n       \"\\t    area.startAngle = area.y0, delete area.y0;\\n\",\n       \"\\t    area.endAngle = area.y1, delete area.y1;\\n\",\n       \"\\t    return area;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.svg.chord = function() {\\n\",\n       \"\\t    var source = d3_source, target = d3_target, radius = d3_svg_chordRadius, startAngle = d3_svg_arcStartAngle, endAngle = d3_svg_arcEndAngle;\\n\",\n       \"\\t    function chord(d, i) {\\n\",\n       \"\\t      var s = subgroup(this, source, d, i), t = subgroup(this, target, d, i);\\n\",\n       \"\\t      return \\\"M\\\" + s.p0 + arc(s.r, s.p1, s.a1 - s.a0) + (equals(s, t) ? curve(s.r, s.p1, s.r, s.p0) : curve(s.r, s.p1, t.r, t.p0) + arc(t.r, t.p1, t.a1 - t.a0) + curve(t.r, t.p1, s.r, s.p0)) + \\\"Z\\\";\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function subgroup(self, f, d, i) {\\n\",\n       \"\\t      var subgroup = f.call(self, d, i), r = radius.call(self, subgroup, i), a0 = startAngle.call(self, subgroup, i) - halfπ, a1 = endAngle.call(self, subgroup, i) - halfπ;\\n\",\n       \"\\t      return {\\n\",\n       \"\\t        r: r,\\n\",\n       \"\\t        a0: a0,\\n\",\n       \"\\t        a1: a1,\\n\",\n       \"\\t        p0: [ r * Math.cos(a0), r * Math.sin(a0) ],\\n\",\n       \"\\t        p1: [ r * Math.cos(a1), r * Math.sin(a1) ]\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function equals(a, b) {\\n\",\n       \"\\t      return a.a0 == b.a0 && a.a1 == b.a1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function arc(r, p, a) {\\n\",\n       \"\\t      return \\\"A\\\" + r + \\\",\\\" + r + \\\" 0 \\\" + +(a > π) + \\\",1 \\\" + p;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function curve(r0, p0, r1, p1) {\\n\",\n       \"\\t      return \\\"Q 0,0 \\\" + p1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    chord.radius = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return radius;\\n\",\n       \"\\t      radius = d3_functor(v);\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.source = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return source;\\n\",\n       \"\\t      source = d3_functor(v);\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.target = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return target;\\n\",\n       \"\\t      target = d3_functor(v);\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.startAngle = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return startAngle;\\n\",\n       \"\\t      startAngle = d3_functor(v);\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    chord.endAngle = function(v) {\\n\",\n       \"\\t      if (!arguments.length) return endAngle;\\n\",\n       \"\\t      endAngle = d3_functor(v);\\n\",\n       \"\\t      return chord;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return chord;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_svg_chordRadius(d) {\\n\",\n       \"\\t    return d.radius;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.diagonal = function() {\\n\",\n       \"\\t    var source = d3_source, target = d3_target, projection = d3_svg_diagonalProjection;\\n\",\n       \"\\t    function diagonal(d, i) {\\n\",\n       \"\\t      var p0 = source.call(this, d, i), p3 = target.call(this, d, i), m = (p0.y + p3.y) / 2, p = [ p0, {\\n\",\n       \"\\t        x: p0.x,\\n\",\n       \"\\t        y: m\\n\",\n       \"\\t      }, {\\n\",\n       \"\\t        x: p3.x,\\n\",\n       \"\\t        y: m\\n\",\n       \"\\t      }, p3 ];\\n\",\n       \"\\t      p = p.map(projection);\\n\",\n       \"\\t      return \\\"M\\\" + p[0] + \\\"C\\\" + p[1] + \\\" \\\" + p[2] + \\\" \\\" + p[3];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    diagonal.source = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return source;\\n\",\n       \"\\t      source = d3_functor(x);\\n\",\n       \"\\t      return diagonal;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    diagonal.target = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return target;\\n\",\n       \"\\t      target = d3_functor(x);\\n\",\n       \"\\t      return diagonal;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    diagonal.projection = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return projection;\\n\",\n       \"\\t      projection = x;\\n\",\n       \"\\t      return diagonal;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return diagonal;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_svg_diagonalProjection(d) {\\n\",\n       \"\\t    return [ d.x, d.y ];\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.diagonal.radial = function() {\\n\",\n       \"\\t    var diagonal = d3.svg.diagonal(), projection = d3_svg_diagonalProjection, projection_ = diagonal.projection;\\n\",\n       \"\\t    diagonal.projection = function(x) {\\n\",\n       \"\\t      return arguments.length ? projection_(d3_svg_diagonalRadialProjection(projection = x)) : projection;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return diagonal;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_svg_diagonalRadialProjection(projection) {\\n\",\n       \"\\t    return function() {\\n\",\n       \"\\t      var d = projection.apply(this, arguments), r = d[0], a = d[1] - halfπ;\\n\",\n       \"\\t      return [ r * Math.cos(a), r * Math.sin(a) ];\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.symbol = function() {\\n\",\n       \"\\t    var type = d3_svg_symbolType, size = d3_svg_symbolSize;\\n\",\n       \"\\t    function symbol(d, i) {\\n\",\n       \"\\t      return (d3_svg_symbols.get(type.call(this, d, i)) || d3_svg_symbolCircle)(size.call(this, d, i));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    symbol.type = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return type;\\n\",\n       \"\\t      type = d3_functor(x);\\n\",\n       \"\\t      return symbol;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    symbol.size = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return size;\\n\",\n       \"\\t      size = d3_functor(x);\\n\",\n       \"\\t      return symbol;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return symbol;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_svg_symbolSize() {\\n\",\n       \"\\t    return 64;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_symbolType() {\\n\",\n       \"\\t    return \\\"circle\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_symbolCircle(size) {\\n\",\n       \"\\t    var r = Math.sqrt(size / π);\\n\",\n       \"\\t    return \\\"M0,\\\" + r + \\\"A\\\" + r + \\\",\\\" + r + \\\" 0 1,1 0,\\\" + -r + \\\"A\\\" + r + \\\",\\\" + r + \\\" 0 1,1 0,\\\" + r + \\\"Z\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_svg_symbols = d3.map({\\n\",\n       \"\\t    circle: d3_svg_symbolCircle,\\n\",\n       \"\\t    cross: function(size) {\\n\",\n       \"\\t      var r = Math.sqrt(size / 5) / 2;\\n\",\n       \"\\t      return \\\"M\\\" + -3 * r + \\\",\\\" + -r + \\\"H\\\" + -r + \\\"V\\\" + -3 * r + \\\"H\\\" + r + \\\"V\\\" + -r + \\\"H\\\" + 3 * r + \\\"V\\\" + r + \\\"H\\\" + r + \\\"V\\\" + 3 * r + \\\"H\\\" + -r + \\\"V\\\" + r + \\\"H\\\" + -3 * r + \\\"Z\\\";\\n\",\n       \"\\t    },\\n\",\n       \"\\t    diamond: function(size) {\\n\",\n       \"\\t      var ry = Math.sqrt(size / (2 * d3_svg_symbolTan30)), rx = ry * d3_svg_symbolTan30;\\n\",\n       \"\\t      return \\\"M0,\\\" + -ry + \\\"L\\\" + rx + \\\",0\\\" + \\\" 0,\\\" + ry + \\\" \\\" + -rx + \\\",0\\\" + \\\"Z\\\";\\n\",\n       \"\\t    },\\n\",\n       \"\\t    square: function(size) {\\n\",\n       \"\\t      var r = Math.sqrt(size) / 2;\\n\",\n       \"\\t      return \\\"M\\\" + -r + \\\",\\\" + -r + \\\"L\\\" + r + \\\",\\\" + -r + \\\" \\\" + r + \\\",\\\" + r + \\\" \\\" + -r + \\\",\\\" + r + \\\"Z\\\";\\n\",\n       \"\\t    },\\n\",\n       \"\\t    \\\"triangle-down\\\": function(size) {\\n\",\n       \"\\t      var rx = Math.sqrt(size / d3_svg_symbolSqrt3), ry = rx * d3_svg_symbolSqrt3 / 2;\\n\",\n       \"\\t      return \\\"M0,\\\" + ry + \\\"L\\\" + rx + \\\",\\\" + -ry + \\\" \\\" + -rx + \\\",\\\" + -ry + \\\"Z\\\";\\n\",\n       \"\\t    },\\n\",\n       \"\\t    \\\"triangle-up\\\": function(size) {\\n\",\n       \"\\t      var rx = Math.sqrt(size / d3_svg_symbolSqrt3), ry = rx * d3_svg_symbolSqrt3 / 2;\\n\",\n       \"\\t      return \\\"M0,\\\" + -ry + \\\"L\\\" + rx + \\\",\\\" + ry + \\\" \\\" + -rx + \\\",\\\" + ry + \\\"Z\\\";\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3.svg.symbolTypes = d3_svg_symbols.keys();\\n\",\n       \"\\t  var d3_svg_symbolSqrt3 = Math.sqrt(3), d3_svg_symbolTan30 = Math.tan(30 * d3_radians);\\n\",\n       \"\\t  d3_selectionPrototype.transition = function(name) {\\n\",\n       \"\\t    var id = d3_transitionInheritId || ++d3_transitionId, ns = d3_transitionNamespace(name), subgroups = [], subgroup, node, transition = d3_transitionInherit || {\\n\",\n       \"\\t      time: Date.now(),\\n\",\n       \"\\t      ease: d3_ease_cubicInOut,\\n\",\n       \"\\t      delay: 0,\\n\",\n       \"\\t      duration: 250\\n\",\n       \"\\t    };\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      for (var group = this[j], i = -1, n = group.length; ++i < n; ) {\\n\",\n       \"\\t        if (node = group[i]) d3_transitionNode(node, i, ns, id, transition);\\n\",\n       \"\\t        subgroup.push(node);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition(subgroups, ns, id);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_selectionPrototype.interrupt = function(name) {\\n\",\n       \"\\t    return this.each(name == null ? d3_selection_interrupt : d3_selection_interruptNS(d3_transitionNamespace(name)));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_selection_interrupt = d3_selection_interruptNS(d3_transitionNamespace());\\n\",\n       \"\\t  function d3_selection_interruptNS(ns) {\\n\",\n       \"\\t    return function() {\\n\",\n       \"\\t      var lock, activeId, active;\\n\",\n       \"\\t      if ((lock = this[ns]) && (active = lock[activeId = lock.active])) {\\n\",\n       \"\\t        active.timer.c = null;\\n\",\n       \"\\t        active.timer.t = NaN;\\n\",\n       \"\\t        if (--lock.count) delete lock[activeId]; else delete this[ns];\\n\",\n       \"\\t        lock.active += .5;\\n\",\n       \"\\t        active.event && active.event.interrupt.call(this, this.__data__, active.index);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_transition(groups, ns, id) {\\n\",\n       \"\\t    d3_subclass(groups, d3_transitionPrototype);\\n\",\n       \"\\t    groups.namespace = ns;\\n\",\n       \"\\t    groups.id = id;\\n\",\n       \"\\t    return groups;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_transitionPrototype = [], d3_transitionId = 0, d3_transitionInheritId, d3_transitionInherit;\\n\",\n       \"\\t  d3_transitionPrototype.call = d3_selectionPrototype.call;\\n\",\n       \"\\t  d3_transitionPrototype.empty = d3_selectionPrototype.empty;\\n\",\n       \"\\t  d3_transitionPrototype.node = d3_selectionPrototype.node;\\n\",\n       \"\\t  d3_transitionPrototype.size = d3_selectionPrototype.size;\\n\",\n       \"\\t  d3.transition = function(selection, name) {\\n\",\n       \"\\t    return selection && selection.transition ? d3_transitionInheritId ? selection.transition(name) : selection : d3.selection().transition(selection);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.transition.prototype = d3_transitionPrototype;\\n\",\n       \"\\t  d3_transitionPrototype.select = function(selector) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace, subgroups = [], subgroup, subnode, node;\\n\",\n       \"\\t    selector = d3_selection_selector(selector);\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      for (var group = this[j], i = -1, n = group.length; ++i < n; ) {\\n\",\n       \"\\t        if ((node = group[i]) && (subnode = selector.call(node, node.__data__, i, j))) {\\n\",\n       \"\\t          if (\\\"__data__\\\" in node) subnode.__data__ = node.__data__;\\n\",\n       \"\\t          d3_transitionNode(subnode, i, ns, id, node[ns][id]);\\n\",\n       \"\\t          subgroup.push(subnode);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          subgroup.push(null);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition(subgroups, ns, id);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.selectAll = function(selector) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace, subgroups = [], subgroup, subnodes, node, subnode, transition;\\n\",\n       \"\\t    selector = d3_selection_selectorAll(selector);\\n\",\n       \"\\t    for (var j = -1, m = this.length; ++j < m; ) {\\n\",\n       \"\\t      for (var group = this[j], i = -1, n = group.length; ++i < n; ) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          transition = node[ns][id];\\n\",\n       \"\\t          subnodes = selector.call(node, node.__data__, i, j);\\n\",\n       \"\\t          subgroups.push(subgroup = []);\\n\",\n       \"\\t          for (var k = -1, o = subnodes.length; ++k < o; ) {\\n\",\n       \"\\t            if (subnode = subnodes[k]) d3_transitionNode(subnode, k, ns, id, transition);\\n\",\n       \"\\t            subgroup.push(subnode);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition(subgroups, ns, id);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.filter = function(filter) {\\n\",\n       \"\\t    var subgroups = [], subgroup, group, node;\\n\",\n       \"\\t    if (typeof filter !== \\\"function\\\") filter = d3_selection_filter(filter);\\n\",\n       \"\\t    for (var j = 0, m = this.length; j < m; j++) {\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      for (var group = this[j], i = 0, n = group.length; i < n; i++) {\\n\",\n       \"\\t        if ((node = group[i]) && filter.call(node, node.__data__, i, j)) {\\n\",\n       \"\\t          subgroup.push(node);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition(subgroups, this.namespace, this.id);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.tween = function(name, tween) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace;\\n\",\n       \"\\t    if (arguments.length < 2) return this.node()[ns][id].tween.get(name);\\n\",\n       \"\\t    return d3_selection_each(this, tween == null ? function(node) {\\n\",\n       \"\\t      node[ns][id].tween.remove(name);\\n\",\n       \"\\t    } : function(node) {\\n\",\n       \"\\t      node[ns][id].tween.set(name, tween);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_transition_tween(groups, name, value, tween) {\\n\",\n       \"\\t    var id = groups.id, ns = groups.namespace;\\n\",\n       \"\\t    return d3_selection_each(groups, typeof value === \\\"function\\\" ? function(node, i, j) {\\n\",\n       \"\\t      node[ns][id].tween.set(name, tween(value.call(node, node.__data__, i, j)));\\n\",\n       \"\\t    } : (value = tween(value), function(node) {\\n\",\n       \"\\t      node[ns][id].tween.set(name, value);\\n\",\n       \"\\t    }));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_transitionPrototype.attr = function(nameNS, value) {\\n\",\n       \"\\t    if (arguments.length < 2) {\\n\",\n       \"\\t      for (value in nameNS) this.attr(value, nameNS[value]);\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var interpolate = nameNS == \\\"transform\\\" ? d3_interpolateTransform : d3_interpolate, name = d3.ns.qualify(nameNS);\\n\",\n       \"\\t    function attrNull() {\\n\",\n       \"\\t      this.removeAttribute(name);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrNullNS() {\\n\",\n       \"\\t      this.removeAttributeNS(name.space, name.local);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrTween(b) {\\n\",\n       \"\\t      return b == null ? attrNull : (b += \\\"\\\", function() {\\n\",\n       \"\\t        var a = this.getAttribute(name), i;\\n\",\n       \"\\t        return a !== b && (i = interpolate(a, b), function(t) {\\n\",\n       \"\\t          this.setAttribute(name, i(t));\\n\",\n       \"\\t        });\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrTweenNS(b) {\\n\",\n       \"\\t      return b == null ? attrNullNS : (b += \\\"\\\", function() {\\n\",\n       \"\\t        var a = this.getAttributeNS(name.space, name.local), i;\\n\",\n       \"\\t        return a !== b && (i = interpolate(a, b), function(t) {\\n\",\n       \"\\t          this.setAttributeNS(name.space, name.local, i(t));\\n\",\n       \"\\t        });\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition_tween(this, \\\"attr.\\\" + nameNS, value, name.local ? attrTweenNS : attrTween);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.attrTween = function(nameNS, tween) {\\n\",\n       \"\\t    var name = d3.ns.qualify(nameNS);\\n\",\n       \"\\t    function attrTween(d, i) {\\n\",\n       \"\\t      var f = tween.call(this, d, i, this.getAttribute(name));\\n\",\n       \"\\t      return f && function(t) {\\n\",\n       \"\\t        this.setAttribute(name, f(t));\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function attrTweenNS(d, i) {\\n\",\n       \"\\t      var f = tween.call(this, d, i, this.getAttributeNS(name.space, name.local));\\n\",\n       \"\\t      return f && function(t) {\\n\",\n       \"\\t        this.setAttributeNS(name.space, name.local, f(t));\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.tween(\\\"attr.\\\" + nameNS, name.local ? attrTweenNS : attrTween);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.style = function(name, value, priority) {\\n\",\n       \"\\t    var n = arguments.length;\\n\",\n       \"\\t    if (n < 3) {\\n\",\n       \"\\t      if (typeof name !== \\\"string\\\") {\\n\",\n       \"\\t        if (n < 2) value = \\\"\\\";\\n\",\n       \"\\t        for (priority in name) this.style(priority, name[priority], value);\\n\",\n       \"\\t        return this;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      priority = \\\"\\\";\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function styleNull() {\\n\",\n       \"\\t      this.style.removeProperty(name);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function styleString(b) {\\n\",\n       \"\\t      return b == null ? styleNull : (b += \\\"\\\", function() {\\n\",\n       \"\\t        var a = d3_window(this).getComputedStyle(this, null).getPropertyValue(name), i;\\n\",\n       \"\\t        return a !== b && (i = d3_interpolate(a, b), function(t) {\\n\",\n       \"\\t          this.style.setProperty(name, i(t), priority);\\n\",\n       \"\\t        });\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition_tween(this, \\\"style.\\\" + name, value, styleString);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.styleTween = function(name, tween, priority) {\\n\",\n       \"\\t    if (arguments.length < 3) priority = \\\"\\\";\\n\",\n       \"\\t    function styleTween(d, i) {\\n\",\n       \"\\t      var f = tween.call(this, d, i, d3_window(this).getComputedStyle(this, null).getPropertyValue(name));\\n\",\n       \"\\t      return f && function(t) {\\n\",\n       \"\\t        this.style.setProperty(name, f(t), priority);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this.tween(\\\"style.\\\" + name, styleTween);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.text = function(value) {\\n\",\n       \"\\t    return d3_transition_tween(this, \\\"text\\\", value, d3_transition_text);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_transition_text(b) {\\n\",\n       \"\\t    if (b == null) b = \\\"\\\";\\n\",\n       \"\\t    return function() {\\n\",\n       \"\\t      this.textContent = b;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_transitionPrototype.remove = function() {\\n\",\n       \"\\t    var ns = this.namespace;\\n\",\n       \"\\t    return this.each(\\\"end.transition\\\", function() {\\n\",\n       \"\\t      var p;\\n\",\n       \"\\t      if (this[ns].count < 2 && (p = this.parentNode)) p.removeChild(this);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.ease = function(value) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace;\\n\",\n       \"\\t    if (arguments.length < 1) return this.node()[ns][id].ease;\\n\",\n       \"\\t    if (typeof value !== \\\"function\\\") value = d3.ease.apply(d3, arguments);\\n\",\n       \"\\t    return d3_selection_each(this, function(node) {\\n\",\n       \"\\t      node[ns][id].ease = value;\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.delay = function(value) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace;\\n\",\n       \"\\t    if (arguments.length < 1) return this.node()[ns][id].delay;\\n\",\n       \"\\t    return d3_selection_each(this, typeof value === \\\"function\\\" ? function(node, i, j) {\\n\",\n       \"\\t      node[ns][id].delay = +value.call(node, node.__data__, i, j);\\n\",\n       \"\\t    } : (value = +value, function(node) {\\n\",\n       \"\\t      node[ns][id].delay = value;\\n\",\n       \"\\t    }));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.duration = function(value) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace;\\n\",\n       \"\\t    if (arguments.length < 1) return this.node()[ns][id].duration;\\n\",\n       \"\\t    return d3_selection_each(this, typeof value === \\\"function\\\" ? function(node, i, j) {\\n\",\n       \"\\t      node[ns][id].duration = Math.max(1, value.call(node, node.__data__, i, j));\\n\",\n       \"\\t    } : (value = Math.max(1, value), function(node) {\\n\",\n       \"\\t      node[ns][id].duration = value;\\n\",\n       \"\\t    }));\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.each = function(type, listener) {\\n\",\n       \"\\t    var id = this.id, ns = this.namespace;\\n\",\n       \"\\t    if (arguments.length < 2) {\\n\",\n       \"\\t      var inherit = d3_transitionInherit, inheritId = d3_transitionInheritId;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        d3_transitionInheritId = id;\\n\",\n       \"\\t        d3_selection_each(this, function(node, i, j) {\\n\",\n       \"\\t          d3_transitionInherit = node[ns][id];\\n\",\n       \"\\t          type.call(node, node.__data__, i, j);\\n\",\n       \"\\t        });\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        d3_transitionInherit = inherit;\\n\",\n       \"\\t        d3_transitionInheritId = inheritId;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      d3_selection_each(this, function(node) {\\n\",\n       \"\\t        var transition = node[ns][id];\\n\",\n       \"\\t        (transition.event || (transition.event = d3.dispatch(\\\"start\\\", \\\"end\\\", \\\"interrupt\\\"))).on(type, listener);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return this;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_transitionPrototype.transition = function() {\\n\",\n       \"\\t    var id0 = this.id, id1 = ++d3_transitionId, ns = this.namespace, subgroups = [], subgroup, group, node, transition;\\n\",\n       \"\\t    for (var j = 0, m = this.length; j < m; j++) {\\n\",\n       \"\\t      subgroups.push(subgroup = []);\\n\",\n       \"\\t      for (var group = this[j], i = 0, n = group.length; i < n; i++) {\\n\",\n       \"\\t        if (node = group[i]) {\\n\",\n       \"\\t          transition = node[ns][id0];\\n\",\n       \"\\t          d3_transitionNode(node, i, ns, id1, {\\n\",\n       \"\\t            time: transition.time,\\n\",\n       \"\\t            ease: transition.ease,\\n\",\n       \"\\t            delay: transition.delay + transition.duration,\\n\",\n       \"\\t            duration: transition.duration\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t        subgroup.push(node);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return d3_transition(subgroups, ns, id1);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_transitionNamespace(name) {\\n\",\n       \"\\t    return name == null ? \\\"__transition__\\\" : \\\"__transition_\\\" + name + \\\"__\\\";\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_transitionNode(node, i, ns, id, inherit) {\\n\",\n       \"\\t    var lock = node[ns] || (node[ns] = {\\n\",\n       \"\\t      active: 0,\\n\",\n       \"\\t      count: 0\\n\",\n       \"\\t    }), transition = lock[id], time, timer, duration, ease, tweens;\\n\",\n       \"\\t    function schedule(elapsed) {\\n\",\n       \"\\t      var delay = transition.delay;\\n\",\n       \"\\t      timer.t = delay + time;\\n\",\n       \"\\t      if (delay <= elapsed) return start(elapsed - delay);\\n\",\n       \"\\t      timer.c = start;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function start(elapsed) {\\n\",\n       \"\\t      var activeId = lock.active, active = lock[activeId];\\n\",\n       \"\\t      if (active) {\\n\",\n       \"\\t        active.timer.c = null;\\n\",\n       \"\\t        active.timer.t = NaN;\\n\",\n       \"\\t        --lock.count;\\n\",\n       \"\\t        delete lock[activeId];\\n\",\n       \"\\t        active.event && active.event.interrupt.call(node, node.__data__, active.index);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (var cancelId in lock) {\\n\",\n       \"\\t        if (+cancelId < id) {\\n\",\n       \"\\t          var cancel = lock[cancelId];\\n\",\n       \"\\t          cancel.timer.c = null;\\n\",\n       \"\\t          cancel.timer.t = NaN;\\n\",\n       \"\\t          --lock.count;\\n\",\n       \"\\t          delete lock[cancelId];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      timer.c = tick;\\n\",\n       \"\\t      d3_timer(function() {\\n\",\n       \"\\t        if (timer.c && tick(elapsed || 1)) {\\n\",\n       \"\\t          timer.c = null;\\n\",\n       \"\\t          timer.t = NaN;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return 1;\\n\",\n       \"\\t      }, 0, time);\\n\",\n       \"\\t      lock.active = id;\\n\",\n       \"\\t      transition.event && transition.event.start.call(node, node.__data__, i);\\n\",\n       \"\\t      tweens = [];\\n\",\n       \"\\t      transition.tween.forEach(function(key, value) {\\n\",\n       \"\\t        if (value = value.call(node, node.__data__, i)) {\\n\",\n       \"\\t          tweens.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      ease = transition.ease;\\n\",\n       \"\\t      duration = transition.duration;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function tick(elapsed) {\\n\",\n       \"\\t      var t = elapsed / duration, e = ease(t), n = tweens.length;\\n\",\n       \"\\t      while (n > 0) {\\n\",\n       \"\\t        tweens[--n].call(node, e);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (t >= 1) {\\n\",\n       \"\\t        transition.event && transition.event.end.call(node, node.__data__, i);\\n\",\n       \"\\t        if (--lock.count) delete lock[id]; else delete node[ns];\\n\",\n       \"\\t        return 1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (!transition) {\\n\",\n       \"\\t      time = inherit.time;\\n\",\n       \"\\t      timer = d3_timer(schedule, 0, time);\\n\",\n       \"\\t      transition = lock[id] = {\\n\",\n       \"\\t        tween: new d3_Map(),\\n\",\n       \"\\t        time: time,\\n\",\n       \"\\t        timer: timer,\\n\",\n       \"\\t        delay: inherit.delay,\\n\",\n       \"\\t        duration: inherit.duration,\\n\",\n       \"\\t        ease: inherit.ease,\\n\",\n       \"\\t        index: i\\n\",\n       \"\\t      };\\n\",\n       \"\\t      inherit = null;\\n\",\n       \"\\t      ++lock.count;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.axis = function() {\\n\",\n       \"\\t    var scale = d3.scale.linear(), orient = d3_svg_axisDefaultOrient, innerTickSize = 6, outerTickSize = 6, tickPadding = 3, tickArguments_ = [ 10 ], tickValues = null, tickFormat_;\\n\",\n       \"\\t    function axis(g) {\\n\",\n       \"\\t      g.each(function() {\\n\",\n       \"\\t        var g = d3.select(this);\\n\",\n       \"\\t        var scale0 = this.__chart__ || scale, scale1 = this.__chart__ = scale.copy();\\n\",\n       \"\\t        var ticks = tickValues == null ? scale1.ticks ? scale1.ticks.apply(scale1, tickArguments_) : scale1.domain() : tickValues, tickFormat = tickFormat_ == null ? scale1.tickFormat ? scale1.tickFormat.apply(scale1, tickArguments_) : d3_identity : tickFormat_, tick = g.selectAll(\\\".tick\\\").data(ticks, scale1), tickEnter = tick.enter().insert(\\\"g\\\", \\\".domain\\\").attr(\\\"class\\\", \\\"tick\\\").style(\\\"opacity\\\", ε), tickExit = d3.transition(tick.exit()).style(\\\"opacity\\\", ε).remove(), tickUpdate = d3.transition(tick.order()).style(\\\"opacity\\\", 1), tickSpacing = Math.max(innerTickSize, 0) + tickPadding, tickTransform;\\n\",\n       \"\\t        var range = d3_scaleRange(scale1), path = g.selectAll(\\\".domain\\\").data([ 0 ]), pathUpdate = (path.enter().append(\\\"path\\\").attr(\\\"class\\\", \\\"domain\\\"), \\n\",\n       \"\\t        d3.transition(path));\\n\",\n       \"\\t        tickEnter.append(\\\"line\\\");\\n\",\n       \"\\t        tickEnter.append(\\\"text\\\");\\n\",\n       \"\\t        var lineEnter = tickEnter.select(\\\"line\\\"), lineUpdate = tickUpdate.select(\\\"line\\\"), text = tick.select(\\\"text\\\").text(tickFormat), textEnter = tickEnter.select(\\\"text\\\"), textUpdate = tickUpdate.select(\\\"text\\\"), sign = orient === \\\"top\\\" || orient === \\\"left\\\" ? -1 : 1, x1, x2, y1, y2;\\n\",\n       \"\\t        if (orient === \\\"bottom\\\" || orient === \\\"top\\\") {\\n\",\n       \"\\t          tickTransform = d3_svg_axisX, x1 = \\\"x\\\", y1 = \\\"y\\\", x2 = \\\"x2\\\", y2 = \\\"y2\\\";\\n\",\n       \"\\t          text.attr(\\\"dy\\\", sign < 0 ? \\\"0em\\\" : \\\".71em\\\").style(\\\"text-anchor\\\", \\\"middle\\\");\\n\",\n       \"\\t          pathUpdate.attr(\\\"d\\\", \\\"M\\\" + range[0] + \\\",\\\" + sign * outerTickSize + \\\"V0H\\\" + range[1] + \\\"V\\\" + sign * outerTickSize);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          tickTransform = d3_svg_axisY, x1 = \\\"y\\\", y1 = \\\"x\\\", x2 = \\\"y2\\\", y2 = \\\"x2\\\";\\n\",\n       \"\\t          text.attr(\\\"dy\\\", \\\".32em\\\").style(\\\"text-anchor\\\", sign < 0 ? \\\"end\\\" : \\\"start\\\");\\n\",\n       \"\\t          pathUpdate.attr(\\\"d\\\", \\\"M\\\" + sign * outerTickSize + \\\",\\\" + range[0] + \\\"H0V\\\" + range[1] + \\\"H\\\" + sign * outerTickSize);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        lineEnter.attr(y2, sign * innerTickSize);\\n\",\n       \"\\t        textEnter.attr(y1, sign * tickSpacing);\\n\",\n       \"\\t        lineUpdate.attr(x2, 0).attr(y2, sign * innerTickSize);\\n\",\n       \"\\t        textUpdate.attr(x1, 0).attr(y1, sign * tickSpacing);\\n\",\n       \"\\t        if (scale1.rangeBand) {\\n\",\n       \"\\t          var x = scale1, dx = x.rangeBand() / 2;\\n\",\n       \"\\t          scale0 = scale1 = function(d) {\\n\",\n       \"\\t            return x(d) + dx;\\n\",\n       \"\\t          };\\n\",\n       \"\\t        } else if (scale0.rangeBand) {\\n\",\n       \"\\t          scale0 = scale1;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          tickExit.call(tickTransform, scale1, scale0);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        tickEnter.call(tickTransform, scale0, scale1);\\n\",\n       \"\\t        tickUpdate.call(tickTransform, scale1, scale1);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    axis.scale = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return scale;\\n\",\n       \"\\t      scale = x;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.orient = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return orient;\\n\",\n       \"\\t      orient = x in d3_svg_axisOrients ? x + \\\"\\\" : d3_svg_axisDefaultOrient;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.ticks = function() {\\n\",\n       \"\\t      if (!arguments.length) return tickArguments_;\\n\",\n       \"\\t      tickArguments_ = d3_array(arguments);\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.tickValues = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return tickValues;\\n\",\n       \"\\t      tickValues = x;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.tickFormat = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return tickFormat_;\\n\",\n       \"\\t      tickFormat_ = x;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.tickSize = function(x) {\\n\",\n       \"\\t      var n = arguments.length;\\n\",\n       \"\\t      if (!n) return innerTickSize;\\n\",\n       \"\\t      innerTickSize = +x;\\n\",\n       \"\\t      outerTickSize = +arguments[n - 1];\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.innerTickSize = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return innerTickSize;\\n\",\n       \"\\t      innerTickSize = +x;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.outerTickSize = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return outerTickSize;\\n\",\n       \"\\t      outerTickSize = +x;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.tickPadding = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return tickPadding;\\n\",\n       \"\\t      tickPadding = +x;\\n\",\n       \"\\t      return axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    axis.tickSubdivide = function() {\\n\",\n       \"\\t      return arguments.length && axis;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return axis;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_svg_axisDefaultOrient = \\\"bottom\\\", d3_svg_axisOrients = {\\n\",\n       \"\\t    top: 1,\\n\",\n       \"\\t    right: 1,\\n\",\n       \"\\t    bottom: 1,\\n\",\n       \"\\t    left: 1\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_svg_axisX(selection, x0, x1) {\\n\",\n       \"\\t    selection.attr(\\\"transform\\\", function(d) {\\n\",\n       \"\\t      var v0 = x0(d);\\n\",\n       \"\\t      return \\\"translate(\\\" + (isFinite(v0) ? v0 : x1(d)) + \\\",0)\\\";\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_svg_axisY(selection, y0, y1) {\\n\",\n       \"\\t    selection.attr(\\\"transform\\\", function(d) {\\n\",\n       \"\\t      var v0 = y0(d);\\n\",\n       \"\\t      return \\\"translate(0,\\\" + (isFinite(v0) ? v0 : y1(d)) + \\\")\\\";\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.svg.brush = function() {\\n\",\n       \"\\t    var event = d3_eventDispatch(brush, \\\"brushstart\\\", \\\"brush\\\", \\\"brushend\\\"), x = null, y = null, xExtent = [ 0, 0 ], yExtent = [ 0, 0 ], xExtentDomain, yExtentDomain, xClamp = true, yClamp = true, resizes = d3_svg_brushResizes[0];\\n\",\n       \"\\t    function brush(g) {\\n\",\n       \"\\t      g.each(function() {\\n\",\n       \"\\t        var g = d3.select(this).style(\\\"pointer-events\\\", \\\"all\\\").style(\\\"-webkit-tap-highlight-color\\\", \\\"rgba(0,0,0,0)\\\").on(\\\"mousedown.brush\\\", brushstart).on(\\\"touchstart.brush\\\", brushstart);\\n\",\n       \"\\t        var background = g.selectAll(\\\".background\\\").data([ 0 ]);\\n\",\n       \"\\t        background.enter().append(\\\"rect\\\").attr(\\\"class\\\", \\\"background\\\").style(\\\"visibility\\\", \\\"hidden\\\").style(\\\"cursor\\\", \\\"crosshair\\\");\\n\",\n       \"\\t        g.selectAll(\\\".extent\\\").data([ 0 ]).enter().append(\\\"rect\\\").attr(\\\"class\\\", \\\"extent\\\").style(\\\"cursor\\\", \\\"move\\\");\\n\",\n       \"\\t        var resize = g.selectAll(\\\".resize\\\").data(resizes, d3_identity);\\n\",\n       \"\\t        resize.exit().remove();\\n\",\n       \"\\t        resize.enter().append(\\\"g\\\").attr(\\\"class\\\", function(d) {\\n\",\n       \"\\t          return \\\"resize \\\" + d;\\n\",\n       \"\\t        }).style(\\\"cursor\\\", function(d) {\\n\",\n       \"\\t          return d3_svg_brushCursor[d];\\n\",\n       \"\\t        }).append(\\\"rect\\\").attr(\\\"x\\\", function(d) {\\n\",\n       \"\\t          return /[ew]$/.test(d) ? -3 : null;\\n\",\n       \"\\t        }).attr(\\\"y\\\", function(d) {\\n\",\n       \"\\t          return /^[ns]/.test(d) ? -3 : null;\\n\",\n       \"\\t        }).attr(\\\"width\\\", 6).attr(\\\"height\\\", 6).style(\\\"visibility\\\", \\\"hidden\\\");\\n\",\n       \"\\t        resize.style(\\\"display\\\", brush.empty() ? \\\"none\\\" : null);\\n\",\n       \"\\t        var gUpdate = d3.transition(g), backgroundUpdate = d3.transition(background), range;\\n\",\n       \"\\t        if (x) {\\n\",\n       \"\\t          range = d3_scaleRange(x);\\n\",\n       \"\\t          backgroundUpdate.attr(\\\"x\\\", range[0]).attr(\\\"width\\\", range[1] - range[0]);\\n\",\n       \"\\t          redrawX(gUpdate);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (y) {\\n\",\n       \"\\t          range = d3_scaleRange(y);\\n\",\n       \"\\t          backgroundUpdate.attr(\\\"y\\\", range[0]).attr(\\\"height\\\", range[1] - range[0]);\\n\",\n       \"\\t          redrawY(gUpdate);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        redraw(gUpdate);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    brush.event = function(g) {\\n\",\n       \"\\t      g.each(function() {\\n\",\n       \"\\t        var event_ = event.of(this, arguments), extent1 = {\\n\",\n       \"\\t          x: xExtent,\\n\",\n       \"\\t          y: yExtent,\\n\",\n       \"\\t          i: xExtentDomain,\\n\",\n       \"\\t          j: yExtentDomain\\n\",\n       \"\\t        }, extent0 = this.__chart__ || extent1;\\n\",\n       \"\\t        this.__chart__ = extent1;\\n\",\n       \"\\t        if (d3_transitionInheritId) {\\n\",\n       \"\\t          d3.select(this).transition().each(\\\"start.brush\\\", function() {\\n\",\n       \"\\t            xExtentDomain = extent0.i;\\n\",\n       \"\\t            yExtentDomain = extent0.j;\\n\",\n       \"\\t            xExtent = extent0.x;\\n\",\n       \"\\t            yExtent = extent0.y;\\n\",\n       \"\\t            event_({\\n\",\n       \"\\t              type: \\\"brushstart\\\"\\n\",\n       \"\\t            });\\n\",\n       \"\\t          }).tween(\\\"brush:brush\\\", function() {\\n\",\n       \"\\t            var xi = d3_interpolateArray(xExtent, extent1.x), yi = d3_interpolateArray(yExtent, extent1.y);\\n\",\n       \"\\t            xExtentDomain = yExtentDomain = null;\\n\",\n       \"\\t            return function(t) {\\n\",\n       \"\\t              xExtent = extent1.x = xi(t);\\n\",\n       \"\\t              yExtent = extent1.y = yi(t);\\n\",\n       \"\\t              event_({\\n\",\n       \"\\t                type: \\\"brush\\\",\\n\",\n       \"\\t                mode: \\\"resize\\\"\\n\",\n       \"\\t              });\\n\",\n       \"\\t            };\\n\",\n       \"\\t          }).each(\\\"end.brush\\\", function() {\\n\",\n       \"\\t            xExtentDomain = extent1.i;\\n\",\n       \"\\t            yExtentDomain = extent1.j;\\n\",\n       \"\\t            event_({\\n\",\n       \"\\t              type: \\\"brush\\\",\\n\",\n       \"\\t              mode: \\\"resize\\\"\\n\",\n       \"\\t            });\\n\",\n       \"\\t            event_({\\n\",\n       \"\\t              type: \\\"brushend\\\"\\n\",\n       \"\\t            });\\n\",\n       \"\\t          });\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          event_({\\n\",\n       \"\\t            type: \\\"brushstart\\\"\\n\",\n       \"\\t          });\\n\",\n       \"\\t          event_({\\n\",\n       \"\\t            type: \\\"brush\\\",\\n\",\n       \"\\t            mode: \\\"resize\\\"\\n\",\n       \"\\t          });\\n\",\n       \"\\t          event_({\\n\",\n       \"\\t            type: \\\"brushend\\\"\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function redraw(g) {\\n\",\n       \"\\t      g.selectAll(\\\".resize\\\").attr(\\\"transform\\\", function(d) {\\n\",\n       \"\\t        return \\\"translate(\\\" + xExtent[+/e$/.test(d)] + \\\",\\\" + yExtent[+/^s/.test(d)] + \\\")\\\";\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function redrawX(g) {\\n\",\n       \"\\t      g.select(\\\".extent\\\").attr(\\\"x\\\", xExtent[0]);\\n\",\n       \"\\t      g.selectAll(\\\".extent,.n>rect,.s>rect\\\").attr(\\\"width\\\", xExtent[1] - xExtent[0]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function redrawY(g) {\\n\",\n       \"\\t      g.select(\\\".extent\\\").attr(\\\"y\\\", yExtent[0]);\\n\",\n       \"\\t      g.selectAll(\\\".extent,.e>rect,.w>rect\\\").attr(\\\"height\\\", yExtent[1] - yExtent[0]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    function brushstart() {\\n\",\n       \"\\t      var target = this, eventTarget = d3.select(d3.event.target), event_ = event.of(target, arguments), g = d3.select(target), resizing = eventTarget.datum(), resizingX = !/^(n|s)$/.test(resizing) && x, resizingY = !/^(e|w)$/.test(resizing) && y, dragging = eventTarget.classed(\\\"extent\\\"), dragRestore = d3_event_dragSuppress(target), center, origin = d3.mouse(target), offset;\\n\",\n       \"\\t      var w = d3.select(d3_window(target)).on(\\\"keydown.brush\\\", keydown).on(\\\"keyup.brush\\\", keyup);\\n\",\n       \"\\t      if (d3.event.changedTouches) {\\n\",\n       \"\\t        w.on(\\\"touchmove.brush\\\", brushmove).on(\\\"touchend.brush\\\", brushend);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        w.on(\\\"mousemove.brush\\\", brushmove).on(\\\"mouseup.brush\\\", brushend);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      g.interrupt().selectAll(\\\"*\\\").interrupt();\\n\",\n       \"\\t      if (dragging) {\\n\",\n       \"\\t        origin[0] = xExtent[0] - origin[0];\\n\",\n       \"\\t        origin[1] = yExtent[0] - origin[1];\\n\",\n       \"\\t      } else if (resizing) {\\n\",\n       \"\\t        var ex = +/w$/.test(resizing), ey = +/^n/.test(resizing);\\n\",\n       \"\\t        offset = [ xExtent[1 - ex] - origin[0], yExtent[1 - ey] - origin[1] ];\\n\",\n       \"\\t        origin[0] = xExtent[ex];\\n\",\n       \"\\t        origin[1] = yExtent[ey];\\n\",\n       \"\\t      } else if (d3.event.altKey) center = origin.slice();\\n\",\n       \"\\t      g.style(\\\"pointer-events\\\", \\\"none\\\").selectAll(\\\".resize\\\").style(\\\"display\\\", null);\\n\",\n       \"\\t      d3.select(\\\"body\\\").style(\\\"cursor\\\", eventTarget.style(\\\"cursor\\\"));\\n\",\n       \"\\t      event_({\\n\",\n       \"\\t        type: \\\"brushstart\\\"\\n\",\n       \"\\t      });\\n\",\n       \"\\t      brushmove();\\n\",\n       \"\\t      function keydown() {\\n\",\n       \"\\t        if (d3.event.keyCode == 32) {\\n\",\n       \"\\t          if (!dragging) {\\n\",\n       \"\\t            center = null;\\n\",\n       \"\\t            origin[0] -= xExtent[1];\\n\",\n       \"\\t            origin[1] -= yExtent[1];\\n\",\n       \"\\t            dragging = 2;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          d3_eventPreventDefault();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function keyup() {\\n\",\n       \"\\t        if (d3.event.keyCode == 32 && dragging == 2) {\\n\",\n       \"\\t          origin[0] += xExtent[1];\\n\",\n       \"\\t          origin[1] += yExtent[1];\\n\",\n       \"\\t          dragging = 0;\\n\",\n       \"\\t          d3_eventPreventDefault();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function brushmove() {\\n\",\n       \"\\t        var point = d3.mouse(target), moved = false;\\n\",\n       \"\\t        if (offset) {\\n\",\n       \"\\t          point[0] += offset[0];\\n\",\n       \"\\t          point[1] += offset[1];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (!dragging) {\\n\",\n       \"\\t          if (d3.event.altKey) {\\n\",\n       \"\\t            if (!center) center = [ (xExtent[0] + xExtent[1]) / 2, (yExtent[0] + yExtent[1]) / 2 ];\\n\",\n       \"\\t            origin[0] = xExtent[+(point[0] < center[0])];\\n\",\n       \"\\t            origin[1] = yExtent[+(point[1] < center[1])];\\n\",\n       \"\\t          } else center = null;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (resizingX && move1(point, x, 0)) {\\n\",\n       \"\\t          redrawX(g);\\n\",\n       \"\\t          moved = true;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (resizingY && move1(point, y, 1)) {\\n\",\n       \"\\t          redrawY(g);\\n\",\n       \"\\t          moved = true;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (moved) {\\n\",\n       \"\\t          redraw(g);\\n\",\n       \"\\t          event_({\\n\",\n       \"\\t            type: \\\"brush\\\",\\n\",\n       \"\\t            mode: dragging ? \\\"move\\\" : \\\"resize\\\"\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function move1(point, scale, i) {\\n\",\n       \"\\t        var range = d3_scaleRange(scale), r0 = range[0], r1 = range[1], position = origin[i], extent = i ? yExtent : xExtent, size = extent[1] - extent[0], min, max;\\n\",\n       \"\\t        if (dragging) {\\n\",\n       \"\\t          r0 -= position;\\n\",\n       \"\\t          r1 -= size + position;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        min = (i ? yClamp : xClamp) ? Math.max(r0, Math.min(r1, point[i])) : point[i];\\n\",\n       \"\\t        if (dragging) {\\n\",\n       \"\\t          max = (min += position) + size;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (center) position = Math.max(r0, Math.min(r1, 2 * center[i] - min));\\n\",\n       \"\\t          if (position < min) {\\n\",\n       \"\\t            max = min;\\n\",\n       \"\\t            min = position;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            max = position;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (extent[0] != min || extent[1] != max) {\\n\",\n       \"\\t          if (i) yExtentDomain = null; else xExtentDomain = null;\\n\",\n       \"\\t          extent[0] = min;\\n\",\n       \"\\t          extent[1] = max;\\n\",\n       \"\\t          return true;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      function brushend() {\\n\",\n       \"\\t        brushmove();\\n\",\n       \"\\t        g.style(\\\"pointer-events\\\", \\\"all\\\").selectAll(\\\".resize\\\").style(\\\"display\\\", brush.empty() ? \\\"none\\\" : null);\\n\",\n       \"\\t        d3.select(\\\"body\\\").style(\\\"cursor\\\", null);\\n\",\n       \"\\t        w.on(\\\"mousemove.brush\\\", null).on(\\\"mouseup.brush\\\", null).on(\\\"touchmove.brush\\\", null).on(\\\"touchend.brush\\\", null).on(\\\"keydown.brush\\\", null).on(\\\"keyup.brush\\\", null);\\n\",\n       \"\\t        dragRestore();\\n\",\n       \"\\t        event_({\\n\",\n       \"\\t          type: \\\"brushend\\\"\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    brush.x = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return x;\\n\",\n       \"\\t      x = z;\\n\",\n       \"\\t      resizes = d3_svg_brushResizes[!x << 1 | !y];\\n\",\n       \"\\t      return brush;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    brush.y = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return y;\\n\",\n       \"\\t      y = z;\\n\",\n       \"\\t      resizes = d3_svg_brushResizes[!x << 1 | !y];\\n\",\n       \"\\t      return brush;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    brush.clamp = function(z) {\\n\",\n       \"\\t      if (!arguments.length) return x && y ? [ xClamp, yClamp ] : x ? xClamp : y ? yClamp : null;\\n\",\n       \"\\t      if (x && y) xClamp = !!z[0], yClamp = !!z[1]; else if (x) xClamp = !!z; else if (y) yClamp = !!z;\\n\",\n       \"\\t      return brush;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    brush.extent = function(z) {\\n\",\n       \"\\t      var x0, x1, y0, y1, t;\\n\",\n       \"\\t      if (!arguments.length) {\\n\",\n       \"\\t        if (x) {\\n\",\n       \"\\t          if (xExtentDomain) {\\n\",\n       \"\\t            x0 = xExtentDomain[0], x1 = xExtentDomain[1];\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            x0 = xExtent[0], x1 = xExtent[1];\\n\",\n       \"\\t            if (x.invert) x0 = x.invert(x0), x1 = x.invert(x1);\\n\",\n       \"\\t            if (x1 < x0) t = x0, x0 = x1, x1 = t;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (y) {\\n\",\n       \"\\t          if (yExtentDomain) {\\n\",\n       \"\\t            y0 = yExtentDomain[0], y1 = yExtentDomain[1];\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            y0 = yExtent[0], y1 = yExtent[1];\\n\",\n       \"\\t            if (y.invert) y0 = y.invert(y0), y1 = y.invert(y1);\\n\",\n       \"\\t            if (y1 < y0) t = y0, y0 = y1, y1 = t;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return x && y ? [ [ x0, y0 ], [ x1, y1 ] ] : x ? [ x0, x1 ] : y && [ y0, y1 ];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (x) {\\n\",\n       \"\\t        x0 = z[0], x1 = z[1];\\n\",\n       \"\\t        if (y) x0 = x0[0], x1 = x1[0];\\n\",\n       \"\\t        xExtentDomain = [ x0, x1 ];\\n\",\n       \"\\t        if (x.invert) x0 = x(x0), x1 = x(x1);\\n\",\n       \"\\t        if (x1 < x0) t = x0, x0 = x1, x1 = t;\\n\",\n       \"\\t        if (x0 != xExtent[0] || x1 != xExtent[1]) xExtent = [ x0, x1 ];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (y) {\\n\",\n       \"\\t        y0 = z[0], y1 = z[1];\\n\",\n       \"\\t        if (x) y0 = y0[1], y1 = y1[1];\\n\",\n       \"\\t        yExtentDomain = [ y0, y1 ];\\n\",\n       \"\\t        if (y.invert) y0 = y(y0), y1 = y(y1);\\n\",\n       \"\\t        if (y1 < y0) t = y0, y0 = y1, y1 = t;\\n\",\n       \"\\t        if (y0 != yExtent[0] || y1 != yExtent[1]) yExtent = [ y0, y1 ];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return brush;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    brush.clear = function() {\\n\",\n       \"\\t      if (!brush.empty()) {\\n\",\n       \"\\t        xExtent = [ 0, 0 ], yExtent = [ 0, 0 ];\\n\",\n       \"\\t        xExtentDomain = yExtentDomain = null;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return brush;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    brush.empty = function() {\\n\",\n       \"\\t      return !!x && xExtent[0] == xExtent[1] || !!y && yExtent[0] == yExtent[1];\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3.rebind(brush, event, \\\"on\\\");\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_svg_brushCursor = {\\n\",\n       \"\\t    n: \\\"ns-resize\\\",\\n\",\n       \"\\t    e: \\\"ew-resize\\\",\\n\",\n       \"\\t    s: \\\"ns-resize\\\",\\n\",\n       \"\\t    w: \\\"ew-resize\\\",\\n\",\n       \"\\t    nw: \\\"nwse-resize\\\",\\n\",\n       \"\\t    ne: \\\"nesw-resize\\\",\\n\",\n       \"\\t    se: \\\"nwse-resize\\\",\\n\",\n       \"\\t    sw: \\\"nesw-resize\\\"\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_svg_brushResizes = [ [ \\\"n\\\", \\\"e\\\", \\\"s\\\", \\\"w\\\", \\\"nw\\\", \\\"ne\\\", \\\"se\\\", \\\"sw\\\" ], [ \\\"e\\\", \\\"w\\\" ], [ \\\"n\\\", \\\"s\\\" ], [] ];\\n\",\n       \"\\t  var d3_time_format = d3_time.format = d3_locale_enUS.timeFormat;\\n\",\n       \"\\t  var d3_time_formatUtc = d3_time_format.utc;\\n\",\n       \"\\t  var d3_time_formatIso = d3_time_formatUtc(\\\"%Y-%m-%dT%H:%M:%S.%LZ\\\");\\n\",\n       \"\\t  d3_time_format.iso = Date.prototype.toISOString && +new Date(\\\"2000-01-01T00:00:00.000Z\\\") ? d3_time_formatIsoNative : d3_time_formatIso;\\n\",\n       \"\\t  function d3_time_formatIsoNative(date) {\\n\",\n       \"\\t    return date.toISOString();\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3_time_formatIsoNative.parse = function(string) {\\n\",\n       \"\\t    var date = new Date(string);\\n\",\n       \"\\t    return isNaN(date) ? null : date;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_time_formatIsoNative.toString = d3_time_formatIso.toString;\\n\",\n       \"\\t  d3_time.second = d3_time_interval(function(date) {\\n\",\n       \"\\t    return new d3_date(Math.floor(date / 1e3) * 1e3);\\n\",\n       \"\\t  }, function(date, offset) {\\n\",\n       \"\\t    date.setTime(date.getTime() + Math.floor(offset) * 1e3);\\n\",\n       \"\\t  }, function(date) {\\n\",\n       \"\\t    return date.getSeconds();\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.seconds = d3_time.second.range;\\n\",\n       \"\\t  d3_time.seconds.utc = d3_time.second.utc.range;\\n\",\n       \"\\t  d3_time.minute = d3_time_interval(function(date) {\\n\",\n       \"\\t    return new d3_date(Math.floor(date / 6e4) * 6e4);\\n\",\n       \"\\t  }, function(date, offset) {\\n\",\n       \"\\t    date.setTime(date.getTime() + Math.floor(offset) * 6e4);\\n\",\n       \"\\t  }, function(date) {\\n\",\n       \"\\t    return date.getMinutes();\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.minutes = d3_time.minute.range;\\n\",\n       \"\\t  d3_time.minutes.utc = d3_time.minute.utc.range;\\n\",\n       \"\\t  d3_time.hour = d3_time_interval(function(date) {\\n\",\n       \"\\t    var timezone = date.getTimezoneOffset() / 60;\\n\",\n       \"\\t    return new d3_date((Math.floor(date / 36e5 - timezone) + timezone) * 36e5);\\n\",\n       \"\\t  }, function(date, offset) {\\n\",\n       \"\\t    date.setTime(date.getTime() + Math.floor(offset) * 36e5);\\n\",\n       \"\\t  }, function(date) {\\n\",\n       \"\\t    return date.getHours();\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.hours = d3_time.hour.range;\\n\",\n       \"\\t  d3_time.hours.utc = d3_time.hour.utc.range;\\n\",\n       \"\\t  d3_time.month = d3_time_interval(function(date) {\\n\",\n       \"\\t    date = d3_time.day(date);\\n\",\n       \"\\t    date.setDate(1);\\n\",\n       \"\\t    return date;\\n\",\n       \"\\t  }, function(date, offset) {\\n\",\n       \"\\t    date.setMonth(date.getMonth() + offset);\\n\",\n       \"\\t  }, function(date) {\\n\",\n       \"\\t    return date.getMonth();\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3_time.months = d3_time.month.range;\\n\",\n       \"\\t  d3_time.months.utc = d3_time.month.utc.range;\\n\",\n       \"\\t  function d3_time_scale(linear, methods, format) {\\n\",\n       \"\\t    function scale(x) {\\n\",\n       \"\\t      return linear(x);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.invert = function(x) {\\n\",\n       \"\\t      return d3_time_scaleDate(linear.invert(x));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.domain = function(x) {\\n\",\n       \"\\t      if (!arguments.length) return linear.domain().map(d3_time_scaleDate);\\n\",\n       \"\\t      linear.domain(x);\\n\",\n       \"\\t      return scale;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    function tickMethod(extent, count) {\\n\",\n       \"\\t      var span = extent[1] - extent[0], target = span / count, i = d3.bisect(d3_time_scaleSteps, target);\\n\",\n       \"\\t      return i == d3_time_scaleSteps.length ? [ methods.year, d3_scale_linearTickRange(extent.map(function(d) {\\n\",\n       \"\\t        return d / 31536e6;\\n\",\n       \"\\t      }), count)[2] ] : !i ? [ d3_time_scaleMilliseconds, d3_scale_linearTickRange(extent, count)[2] ] : methods[target / d3_time_scaleSteps[i - 1] < d3_time_scaleSteps[i] / target ? i - 1 : i];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    scale.nice = function(interval, skip) {\\n\",\n       \"\\t      var domain = scale.domain(), extent = d3_scaleExtent(domain), method = interval == null ? tickMethod(extent, 10) : typeof interval === \\\"number\\\" && tickMethod(extent, interval);\\n\",\n       \"\\t      if (method) interval = method[0], skip = method[1];\\n\",\n       \"\\t      function skipped(date) {\\n\",\n       \"\\t        return !isNaN(date) && !interval.range(date, d3_time_scaleDate(+date + 1), skip).length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return scale.domain(d3_scale_nice(domain, skip > 1 ? {\\n\",\n       \"\\t        floor: function(date) {\\n\",\n       \"\\t          while (skipped(date = interval.floor(date))) date = d3_time_scaleDate(date - 1);\\n\",\n       \"\\t          return date;\\n\",\n       \"\\t        },\\n\",\n       \"\\t        ceil: function(date) {\\n\",\n       \"\\t          while (skipped(date = interval.ceil(date))) date = d3_time_scaleDate(+date + 1);\\n\",\n       \"\\t          return date;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } : interval));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.ticks = function(interval, skip) {\\n\",\n       \"\\t      var extent = d3_scaleExtent(scale.domain()), method = interval == null ? tickMethod(extent, 10) : typeof interval === \\\"number\\\" ? tickMethod(extent, interval) : !interval.range && [ {\\n\",\n       \"\\t        range: interval\\n\",\n       \"\\t      }, skip ];\\n\",\n       \"\\t      if (method) interval = method[0], skip = method[1];\\n\",\n       \"\\t      return interval.range(extent[0], d3_time_scaleDate(+extent[1] + 1), skip < 1 ? 1 : skip);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.tickFormat = function() {\\n\",\n       \"\\t      return format;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    scale.copy = function() {\\n\",\n       \"\\t      return d3_time_scale(linear.copy(), methods, format);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    return d3_scale_linearRebind(scale, linear);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  function d3_time_scaleDate(t) {\\n\",\n       \"\\t    return new Date(t);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var d3_time_scaleSteps = [ 1e3, 5e3, 15e3, 3e4, 6e4, 3e5, 9e5, 18e5, 36e5, 108e5, 216e5, 432e5, 864e5, 1728e5, 6048e5, 2592e6, 7776e6, 31536e6 ];\\n\",\n       \"\\t  var d3_time_scaleLocalMethods = [ [ d3_time.second, 1 ], [ d3_time.second, 5 ], [ d3_time.second, 15 ], [ d3_time.second, 30 ], [ d3_time.minute, 1 ], [ d3_time.minute, 5 ], [ d3_time.minute, 15 ], [ d3_time.minute, 30 ], [ d3_time.hour, 1 ], [ d3_time.hour, 3 ], [ d3_time.hour, 6 ], [ d3_time.hour, 12 ], [ d3_time.day, 1 ], [ d3_time.day, 2 ], [ d3_time.week, 1 ], [ d3_time.month, 1 ], [ d3_time.month, 3 ], [ d3_time.year, 1 ] ];\\n\",\n       \"\\t  var d3_time_scaleLocalFormat = d3_time_format.multi([ [ \\\".%L\\\", function(d) {\\n\",\n       \"\\t    return d.getMilliseconds();\\n\",\n       \"\\t  } ], [ \\\":%S\\\", function(d) {\\n\",\n       \"\\t    return d.getSeconds();\\n\",\n       \"\\t  } ], [ \\\"%I:%M\\\", function(d) {\\n\",\n       \"\\t    return d.getMinutes();\\n\",\n       \"\\t  } ], [ \\\"%I %p\\\", function(d) {\\n\",\n       \"\\t    return d.getHours();\\n\",\n       \"\\t  } ], [ \\\"%a %d\\\", function(d) {\\n\",\n       \"\\t    return d.getDay() && d.getDate() != 1;\\n\",\n       \"\\t  } ], [ \\\"%b %d\\\", function(d) {\\n\",\n       \"\\t    return d.getDate() != 1;\\n\",\n       \"\\t  } ], [ \\\"%B\\\", function(d) {\\n\",\n       \"\\t    return d.getMonth();\\n\",\n       \"\\t  } ], [ \\\"%Y\\\", d3_true ] ]);\\n\",\n       \"\\t  var d3_time_scaleMilliseconds = {\\n\",\n       \"\\t    range: function(start, stop, step) {\\n\",\n       \"\\t      return d3.range(Math.ceil(start / step) * step, +stop, step).map(d3_time_scaleDate);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    floor: d3_identity,\\n\",\n       \"\\t    ceil: d3_identity\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3_time_scaleLocalMethods.year = d3_time.year;\\n\",\n       \"\\t  d3_time.scale = function() {\\n\",\n       \"\\t    return d3_time_scale(d3.scale.linear(), d3_time_scaleLocalMethods, d3_time_scaleLocalFormat);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var d3_time_scaleUtcMethods = d3_time_scaleLocalMethods.map(function(m) {\\n\",\n       \"\\t    return [ m[0].utc, m[1] ];\\n\",\n       \"\\t  });\\n\",\n       \"\\t  var d3_time_scaleUtcFormat = d3_time_formatUtc.multi([ [ \\\".%L\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCMilliseconds();\\n\",\n       \"\\t  } ], [ \\\":%S\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCSeconds();\\n\",\n       \"\\t  } ], [ \\\"%I:%M\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCMinutes();\\n\",\n       \"\\t  } ], [ \\\"%I %p\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCHours();\\n\",\n       \"\\t  } ], [ \\\"%a %d\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCDay() && d.getUTCDate() != 1;\\n\",\n       \"\\t  } ], [ \\\"%b %d\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCDate() != 1;\\n\",\n       \"\\t  } ], [ \\\"%B\\\", function(d) {\\n\",\n       \"\\t    return d.getUTCMonth();\\n\",\n       \"\\t  } ], [ \\\"%Y\\\", d3_true ] ]);\\n\",\n       \"\\t  d3_time_scaleUtcMethods.year = d3_time.year.utc;\\n\",\n       \"\\t  d3_time.scale.utc = function() {\\n\",\n       \"\\t    return d3_time_scale(d3.scale.linear(), d3_time_scaleUtcMethods, d3_time_scaleUtcFormat);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  d3.text = d3_xhrType(function(request) {\\n\",\n       \"\\t    return request.responseText;\\n\",\n       \"\\t  });\\n\",\n       \"\\t  d3.json = function(url, callback) {\\n\",\n       \"\\t    return d3_xhr(url, \\\"application/json\\\", d3_json, callback);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_json(request) {\\n\",\n       \"\\t    return JSON.parse(request.responseText);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.html = function(url, callback) {\\n\",\n       \"\\t    return d3_xhr(url, \\\"text/html\\\", d3_html, callback);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  function d3_html(request) {\\n\",\n       \"\\t    var range = d3_document.createRange();\\n\",\n       \"\\t    range.selectNode(d3_document.body);\\n\",\n       \"\\t    return range.createContextualFragment(request.responseText);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  d3.xml = d3_xhrType(function(request) {\\n\",\n       \"\\t    return request.responseXML;\\n\",\n       \"\\t  });\\n\",\n       \"\\t  if (true) this.d3 = d3, !(__WEBPACK_AMD_DEFINE_FACTORY__ = (d3), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.call(exports, __webpack_require__, exports, module)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); else if (typeof module === \\\"object\\\" && module.exports) module.exports = d3; else this.d3 = d3;\\n\",\n       \"\\t}();\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 3 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tObject.defineProperty(exports, \\\"__esModule\\\", {\\n\",\n       \"\\t  value: true\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d = __webpack_require__(2);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d2 = _interopRequireDefault(_d);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\\\"Cannot call a class as a function\\\"); } }\\n\",\n       \"\\t\\n\",\n       \"\\tvar Barchart =\\n\",\n       \"\\t// svg: d3 object with the svg in question\\n\",\n       \"\\t// exp_array: list of (feature_name, weight)\\n\",\n       \"\\tfunction Barchart(svg, exp_array) {\\n\",\n       \"\\t  var two_sided = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\\n\",\n       \"\\t  var titles = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : undefined;\\n\",\n       \"\\t  var colors = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : ['red', 'green'];\\n\",\n       \"\\t  var show_numbers = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : false;\\n\",\n       \"\\t  var bar_height = arguments.length > 6 && arguments[6] !== undefined ? arguments[6] : 5;\\n\",\n       \"\\t\\n\",\n       \"\\t  _classCallCheck(this, Barchart);\\n\",\n       \"\\t\\n\",\n       \"\\t  var svg_width = Math.min(600, parseInt(svg.style('width')));\\n\",\n       \"\\t  var bar_width = two_sided ? svg_width / 2 : svg_width;\\n\",\n       \"\\t  if (titles === undefined) {\\n\",\n       \"\\t    titles = two_sided ? ['Cons', 'Pros'] : 'Pros';\\n\",\n       \"\\t  }\\n\",\n       \"\\t  if (show_numbers) {\\n\",\n       \"\\t    bar_width = bar_width - 30;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var x_offset = two_sided ? svg_width / 2 : 10;\\n\",\n       \"\\t  // 13.1 is +- the width of W, the widest letter.\\n\",\n       \"\\t  if (two_sided && titles.length == 2) {\\n\",\n       \"\\t    svg.append('text').attr('x', svg_width / 4).attr('y', 15).attr('font-size', '20').attr('text-anchor', 'middle').style('fill', colors[0]).text(titles[0]);\\n\",\n       \"\\t\\n\",\n       \"\\t    svg.append('text').attr('x', svg_width / 4 * 3).attr('y', 15).attr('font-size', '20').attr('text-anchor', 'middle').style('fill', colors[1]).text(titles[1]);\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    var pos = two_sided ? svg_width / 2 : x_offset;\\n\",\n       \"\\t    var anchor = two_sided ? 'middle' : 'begin';\\n\",\n       \"\\t    svg.append('text').attr('x', pos).attr('y', 15).attr('font-size', '20').attr('text-anchor', anchor).text(titles);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var yshift = 20;\\n\",\n       \"\\t  var space_between_bars = 0;\\n\",\n       \"\\t  var text_height = 16;\\n\",\n       \"\\t  var space_between_bar_and_text = 3;\\n\",\n       \"\\t  var total_bar_height = text_height + space_between_bar_and_text + bar_height + space_between_bars;\\n\",\n       \"\\t  var total_height = total_bar_height * exp_array.length;\\n\",\n       \"\\t  this.svg_height = total_height + yshift;\\n\",\n       \"\\t  var yscale = _d2.default.scale.linear().domain([0, exp_array.length]).range([yshift, yshift + total_height]);\\n\",\n       \"\\t  var names = exp_array.map(function (v) {\\n\",\n       \"\\t    return v[0];\\n\",\n       \"\\t  });\\n\",\n       \"\\t  var weights = exp_array.map(function (v) {\\n\",\n       \"\\t    return v[1];\\n\",\n       \"\\t  });\\n\",\n       \"\\t  var max_weight = Math.max.apply(Math, _toConsumableArray(weights.map(function (v) {\\n\",\n       \"\\t    return Math.abs(v);\\n\",\n       \"\\t  })));\\n\",\n       \"\\t  var xscale = _d2.default.scale.linear().domain([0, Math.max(1, max_weight)]).range([0, bar_width]);\\n\",\n       \"\\t\\n\",\n       \"\\t  for (var i = 0; i < exp_array.length; ++i) {\\n\",\n       \"\\t    var name = names[i];\\n\",\n       \"\\t    var weight = weights[i];\\n\",\n       \"\\t    var size = xscale(Math.abs(weight));\\n\",\n       \"\\t    var to_the_right = weight > 0 || !two_sided;\\n\",\n       \"\\t    var text = svg.append('text').attr('x', to_the_right ? x_offset + 2 : x_offset - 2).attr('y', yscale(i) + text_height).attr('text-anchor', to_the_right ? 'begin' : 'end').attr('font-size', '14').text(name);\\n\",\n       \"\\t    while (text.node().getBBox()['width'] + 1 > bar_width) {\\n\",\n       \"\\t      var cur_text = text.text().slice(0, text.text().length - 5);\\n\",\n       \"\\t      text.text(cur_text + '...');\\n\",\n       \"\\t      if (text === '...') {\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var bar = svg.append('rect').attr('height', bar_height).attr('x', to_the_right ? x_offset : x_offset - size).attr('y', text_height + yscale(i) + space_between_bar_and_text) // + bar_height)\\n\",\n       \"\\t    .attr('width', size).style('fill', weight > 0 ? colors[1] : colors[0]);\\n\",\n       \"\\t    if (show_numbers) {\\n\",\n       \"\\t      var bartext = svg.append('text').attr('x', to_the_right ? x_offset + size + 1 : x_offset - size - 1).attr('text-anchor', weight > 0 || !two_sided ? 'begin' : 'end').attr('y', bar_height + yscale(i) + text_height + space_between_bar_and_text).attr('font-size', '10').text(Math.abs(weight).toFixed(2));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var line = svg.append(\\\"line\\\").attr(\\\"x1\\\", x_offset).attr(\\\"x2\\\", x_offset).attr(\\\"y1\\\", bar_height + yshift).attr(\\\"y2\\\", Math.max(bar_height, yscale(exp_array.length))).style(\\\"stroke-width\\\", 2).style(\\\"stroke\\\", \\\"black\\\");\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\texports.default = Barchart;\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 4 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar __WEBPACK_AMD_DEFINE_RESULT__;/* WEBPACK VAR INJECTION */(function(global, module) {/**\\n\",\n       \"\\t * @license\\n\",\n       \"\\t * Lodash <https://lodash.com/>\\n\",\n       \"\\t * Copyright JS Foundation and other contributors <https://js.foundation/>\\n\",\n       \"\\t * Released under MIT license <https://lodash.com/license>\\n\",\n       \"\\t * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\\n\",\n       \"\\t * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\\n\",\n       \"\\t */\\n\",\n       \"\\t;(function() {\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\\n\",\n       \"\\t  var undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as the semantic version number. */\\n\",\n       \"\\t  var VERSION = '4.17.11';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as the size to enable large array optimizations. */\\n\",\n       \"\\t  var LARGE_ARRAY_SIZE = 200;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Error message constants. */\\n\",\n       \"\\t  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\\n\",\n       \"\\t      FUNC_ERROR_TEXT = 'Expected a function';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to stand-in for `undefined` hash values. */\\n\",\n       \"\\t  var HASH_UNDEFINED = '__lodash_hash_undefined__';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as the maximum memoize cache size. */\\n\",\n       \"\\t  var MAX_MEMOIZE_SIZE = 500;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as the internal argument placeholder. */\\n\",\n       \"\\t  var PLACEHOLDER = '__lodash_placeholder__';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to compose bitmasks for cloning. */\\n\",\n       \"\\t  var CLONE_DEEP_FLAG = 1,\\n\",\n       \"\\t      CLONE_FLAT_FLAG = 2,\\n\",\n       \"\\t      CLONE_SYMBOLS_FLAG = 4;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to compose bitmasks for value comparisons. */\\n\",\n       \"\\t  var COMPARE_PARTIAL_FLAG = 1,\\n\",\n       \"\\t      COMPARE_UNORDERED_FLAG = 2;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to compose bitmasks for function metadata. */\\n\",\n       \"\\t  var WRAP_BIND_FLAG = 1,\\n\",\n       \"\\t      WRAP_BIND_KEY_FLAG = 2,\\n\",\n       \"\\t      WRAP_CURRY_BOUND_FLAG = 4,\\n\",\n       \"\\t      WRAP_CURRY_FLAG = 8,\\n\",\n       \"\\t      WRAP_CURRY_RIGHT_FLAG = 16,\\n\",\n       \"\\t      WRAP_PARTIAL_FLAG = 32,\\n\",\n       \"\\t      WRAP_PARTIAL_RIGHT_FLAG = 64,\\n\",\n       \"\\t      WRAP_ARY_FLAG = 128,\\n\",\n       \"\\t      WRAP_REARG_FLAG = 256,\\n\",\n       \"\\t      WRAP_FLIP_FLAG = 512;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as default options for `_.truncate`. */\\n\",\n       \"\\t  var DEFAULT_TRUNC_LENGTH = 30,\\n\",\n       \"\\t      DEFAULT_TRUNC_OMISSION = '...';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect hot functions by number of calls within a span of milliseconds. */\\n\",\n       \"\\t  var HOT_COUNT = 800,\\n\",\n       \"\\t      HOT_SPAN = 16;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to indicate the type of lazy iteratees. */\\n\",\n       \"\\t  var LAZY_FILTER_FLAG = 1,\\n\",\n       \"\\t      LAZY_MAP_FLAG = 2,\\n\",\n       \"\\t      LAZY_WHILE_FLAG = 3;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as references for various `Number` constants. */\\n\",\n       \"\\t  var INFINITY = 1 / 0,\\n\",\n       \"\\t      MAX_SAFE_INTEGER = 9007199254740991,\\n\",\n       \"\\t      MAX_INTEGER = 1.7976931348623157e+308,\\n\",\n       \"\\t      NAN = 0 / 0;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as references for the maximum length and index of an array. */\\n\",\n       \"\\t  var MAX_ARRAY_LENGTH = 4294967295,\\n\",\n       \"\\t      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\\n\",\n       \"\\t      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to associate wrap methods with their bit flags. */\\n\",\n       \"\\t  var wrapFlags = [\\n\",\n       \"\\t    ['ary', WRAP_ARY_FLAG],\\n\",\n       \"\\t    ['bind', WRAP_BIND_FLAG],\\n\",\n       \"\\t    ['bindKey', WRAP_BIND_KEY_FLAG],\\n\",\n       \"\\t    ['curry', WRAP_CURRY_FLAG],\\n\",\n       \"\\t    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\\n\",\n       \"\\t    ['flip', WRAP_FLIP_FLAG],\\n\",\n       \"\\t    ['partial', WRAP_PARTIAL_FLAG],\\n\",\n       \"\\t    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\\n\",\n       \"\\t    ['rearg', WRAP_REARG_FLAG]\\n\",\n       \"\\t  ];\\n\",\n       \"\\t\\n\",\n       \"\\t  /** `Object#toString` result references. */\\n\",\n       \"\\t  var argsTag = '[object Arguments]',\\n\",\n       \"\\t      arrayTag = '[object Array]',\\n\",\n       \"\\t      asyncTag = '[object AsyncFunction]',\\n\",\n       \"\\t      boolTag = '[object Boolean]',\\n\",\n       \"\\t      dateTag = '[object Date]',\\n\",\n       \"\\t      domExcTag = '[object DOMException]',\\n\",\n       \"\\t      errorTag = '[object Error]',\\n\",\n       \"\\t      funcTag = '[object Function]',\\n\",\n       \"\\t      genTag = '[object GeneratorFunction]',\\n\",\n       \"\\t      mapTag = '[object Map]',\\n\",\n       \"\\t      numberTag = '[object Number]',\\n\",\n       \"\\t      nullTag = '[object Null]',\\n\",\n       \"\\t      objectTag = '[object Object]',\\n\",\n       \"\\t      promiseTag = '[object Promise]',\\n\",\n       \"\\t      proxyTag = '[object Proxy]',\\n\",\n       \"\\t      regexpTag = '[object RegExp]',\\n\",\n       \"\\t      setTag = '[object Set]',\\n\",\n       \"\\t      stringTag = '[object String]',\\n\",\n       \"\\t      symbolTag = '[object Symbol]',\\n\",\n       \"\\t      undefinedTag = '[object Undefined]',\\n\",\n       \"\\t      weakMapTag = '[object WeakMap]',\\n\",\n       \"\\t      weakSetTag = '[object WeakSet]';\\n\",\n       \"\\t\\n\",\n       \"\\t  var arrayBufferTag = '[object ArrayBuffer]',\\n\",\n       \"\\t      dataViewTag = '[object DataView]',\\n\",\n       \"\\t      float32Tag = '[object Float32Array]',\\n\",\n       \"\\t      float64Tag = '[object Float64Array]',\\n\",\n       \"\\t      int8Tag = '[object Int8Array]',\\n\",\n       \"\\t      int16Tag = '[object Int16Array]',\\n\",\n       \"\\t      int32Tag = '[object Int32Array]',\\n\",\n       \"\\t      uint8Tag = '[object Uint8Array]',\\n\",\n       \"\\t      uint8ClampedTag = '[object Uint8ClampedArray]',\\n\",\n       \"\\t      uint16Tag = '[object Uint16Array]',\\n\",\n       \"\\t      uint32Tag = '[object Uint32Array]';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match empty string literals in compiled template source. */\\n\",\n       \"\\t  var reEmptyStringLeading = /\\\\b__p \\\\+= '';/g,\\n\",\n       \"\\t      reEmptyStringMiddle = /\\\\b(__p \\\\+=) '' \\\\+/g,\\n\",\n       \"\\t      reEmptyStringTrailing = /(__e\\\\(.*?\\\\)|\\\\b__t\\\\)) \\\\+\\\\n'';/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match HTML entities and HTML characters. */\\n\",\n       \"\\t  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\\n\",\n       \"\\t      reUnescapedHtml = /[&<>\\\"']/g,\\n\",\n       \"\\t      reHasEscapedHtml = RegExp(reEscapedHtml.source),\\n\",\n       \"\\t      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match template delimiters. */\\n\",\n       \"\\t  var reEscape = /<%-([\\\\s\\\\S]+?)%>/g,\\n\",\n       \"\\t      reEvaluate = /<%([\\\\s\\\\S]+?)%>/g,\\n\",\n       \"\\t      reInterpolate = /<%=([\\\\s\\\\S]+?)%>/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match property names within property paths. */\\n\",\n       \"\\t  var reIsDeepProp = /\\\\.|\\\\[(?:[^[\\\\]]*|([\\\"'])(?:(?!\\\\1)[^\\\\\\\\]|\\\\\\\\.)*?\\\\1)\\\\]/,\\n\",\n       \"\\t      reIsPlainProp = /^\\\\w*$/,\\n\",\n       \"\\t      rePropName = /[^.[\\\\]]+|\\\\[(?:(-?\\\\d+(?:\\\\.\\\\d+)?)|([\\\"'])((?:(?!\\\\2)[^\\\\\\\\]|\\\\\\\\.)*?)\\\\2)\\\\]|(?=(?:\\\\.|\\\\[\\\\])(?:\\\\.|\\\\[\\\\]|$))/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used to match `RegExp`\\n\",\n       \"\\t   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var reRegExpChar = /[\\\\\\\\^$.*+?()[\\\\]{}|]/g,\\n\",\n       \"\\t      reHasRegExpChar = RegExp(reRegExpChar.source);\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match leading and trailing whitespace. */\\n\",\n       \"\\t  var reTrim = /^\\\\s+|\\\\s+$/g,\\n\",\n       \"\\t      reTrimStart = /^\\\\s+/,\\n\",\n       \"\\t      reTrimEnd = /\\\\s+$/;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match wrap detail comments. */\\n\",\n       \"\\t  var reWrapComment = /\\\\{(?:\\\\n\\\\/\\\\* \\\\[wrapped with .+\\\\] \\\\*\\\\/)?\\\\n?/,\\n\",\n       \"\\t      reWrapDetails = /\\\\{\\\\n\\\\/\\\\* \\\\[wrapped with (.+)\\\\] \\\\*/,\\n\",\n       \"\\t      reSplitDetails = /,? & /;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match words composed of alphanumeric characters. */\\n\",\n       \"\\t  var reAsciiWord = /[^\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\x7f]+/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match backslashes in property paths. */\\n\",\n       \"\\t  var reEscapeChar = /\\\\\\\\(\\\\\\\\)?/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used to match\\n\",\n       \"\\t   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var reEsTemplate = /\\\\$\\\\{([^\\\\\\\\}]*(?:\\\\\\\\.[^\\\\\\\\}]*)*)\\\\}/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match `RegExp` flags from their coerced string values. */\\n\",\n       \"\\t  var reFlags = /\\\\w*$/;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect bad signed hexadecimal string values. */\\n\",\n       \"\\t  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect binary string values. */\\n\",\n       \"\\t  var reIsBinary = /^0b[01]+$/i;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect host constructors (Safari). */\\n\",\n       \"\\t  var reIsHostCtor = /^\\\\[object .+?Constructor\\\\]$/;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect octal string values. */\\n\",\n       \"\\t  var reIsOctal = /^0o[0-7]+$/i;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect unsigned integer values. */\\n\",\n       \"\\t  var reIsUint = /^(?:0|[1-9]\\\\d*)$/;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match Latin Unicode letters (excluding mathematical operators). */\\n\",\n       \"\\t  var reLatin = /[\\\\xc0-\\\\xd6\\\\xd8-\\\\xf6\\\\xf8-\\\\xff\\\\u0100-\\\\u017f]/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to ensure capturing order of template delimiters. */\\n\",\n       \"\\t  var reNoMatch = /($^)/;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match unescaped characters in compiled string literals. */\\n\",\n       \"\\t  var reUnescapedString = /['\\\\n\\\\r\\\\u2028\\\\u2029\\\\\\\\]/g;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to compose unicode character classes. */\\n\",\n       \"\\t  var rsAstralRange = '\\\\\\\\ud800-\\\\\\\\udfff',\\n\",\n       \"\\t      rsComboMarksRange = '\\\\\\\\u0300-\\\\\\\\u036f',\\n\",\n       \"\\t      reComboHalfMarksRange = '\\\\\\\\ufe20-\\\\\\\\ufe2f',\\n\",\n       \"\\t      rsComboSymbolsRange = '\\\\\\\\u20d0-\\\\\\\\u20ff',\\n\",\n       \"\\t      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\\n\",\n       \"\\t      rsDingbatRange = '\\\\\\\\u2700-\\\\\\\\u27bf',\\n\",\n       \"\\t      rsLowerRange = 'a-z\\\\\\\\xdf-\\\\\\\\xf6\\\\\\\\xf8-\\\\\\\\xff',\\n\",\n       \"\\t      rsMathOpRange = '\\\\\\\\xac\\\\\\\\xb1\\\\\\\\xd7\\\\\\\\xf7',\\n\",\n       \"\\t      rsNonCharRange = '\\\\\\\\x00-\\\\\\\\x2f\\\\\\\\x3a-\\\\\\\\x40\\\\\\\\x5b-\\\\\\\\x60\\\\\\\\x7b-\\\\\\\\xbf',\\n\",\n       \"\\t      rsPunctuationRange = '\\\\\\\\u2000-\\\\\\\\u206f',\\n\",\n       \"\\t      rsSpaceRange = ' \\\\\\\\t\\\\\\\\x0b\\\\\\\\f\\\\\\\\xa0\\\\\\\\ufeff\\\\\\\\n\\\\\\\\r\\\\\\\\u2028\\\\\\\\u2029\\\\\\\\u1680\\\\\\\\u180e\\\\\\\\u2000\\\\\\\\u2001\\\\\\\\u2002\\\\\\\\u2003\\\\\\\\u2004\\\\\\\\u2005\\\\\\\\u2006\\\\\\\\u2007\\\\\\\\u2008\\\\\\\\u2009\\\\\\\\u200a\\\\\\\\u202f\\\\\\\\u205f\\\\\\\\u3000',\\n\",\n       \"\\t      rsUpperRange = 'A-Z\\\\\\\\xc0-\\\\\\\\xd6\\\\\\\\xd8-\\\\\\\\xde',\\n\",\n       \"\\t      rsVarRange = '\\\\\\\\ufe0e\\\\\\\\ufe0f',\\n\",\n       \"\\t      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to compose unicode capture groups. */\\n\",\n       \"\\t  var rsApos = \\\"['\\\\u2019]\\\",\\n\",\n       \"\\t      rsAstral = '[' + rsAstralRange + ']',\\n\",\n       \"\\t      rsBreak = '[' + rsBreakRange + ']',\\n\",\n       \"\\t      rsCombo = '[' + rsComboRange + ']',\\n\",\n       \"\\t      rsDigits = '\\\\\\\\d+',\\n\",\n       \"\\t      rsDingbat = '[' + rsDingbatRange + ']',\\n\",\n       \"\\t      rsLower = '[' + rsLowerRange + ']',\\n\",\n       \"\\t      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\\n\",\n       \"\\t      rsFitz = '\\\\\\\\ud83c[\\\\\\\\udffb-\\\\\\\\udfff]',\\n\",\n       \"\\t      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\\n\",\n       \"\\t      rsNonAstral = '[^' + rsAstralRange + ']',\\n\",\n       \"\\t      rsRegional = '(?:\\\\\\\\ud83c[\\\\\\\\udde6-\\\\\\\\uddff]){2}',\\n\",\n       \"\\t      rsSurrPair = '[\\\\\\\\ud800-\\\\\\\\udbff][\\\\\\\\udc00-\\\\\\\\udfff]',\\n\",\n       \"\\t      rsUpper = '[' + rsUpperRange + ']',\\n\",\n       \"\\t      rsZWJ = '\\\\\\\\u200d';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to compose unicode regexes. */\\n\",\n       \"\\t  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\\n\",\n       \"\\t      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\\n\",\n       \"\\t      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\\n\",\n       \"\\t      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\\n\",\n       \"\\t      reOptMod = rsModifier + '?',\\n\",\n       \"\\t      rsOptVar = '[' + rsVarRange + ']?',\\n\",\n       \"\\t      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\\n\",\n       \"\\t      rsOrdLower = '\\\\\\\\d*(?:1st|2nd|3rd|(?![123])\\\\\\\\dth)(?=\\\\\\\\b|[A-Z_])',\\n\",\n       \"\\t      rsOrdUpper = '\\\\\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\\\\\dTH)(?=\\\\\\\\b|[a-z_])',\\n\",\n       \"\\t      rsSeq = rsOptVar + reOptMod + rsOptJoin,\\n\",\n       \"\\t      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\\n\",\n       \"\\t      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match apostrophes. */\\n\",\n       \"\\t  var reApos = RegExp(rsApos, 'g');\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\\n\",\n       \"\\t   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var reComboMark = RegExp(rsCombo, 'g');\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\\n\",\n       \"\\t  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to match complex or compound words. */\\n\",\n       \"\\t  var reUnicodeWord = RegExp([\\n\",\n       \"\\t    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\\n\",\n       \"\\t    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\\n\",\n       \"\\t    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\\n\",\n       \"\\t    rsUpper + '+' + rsOptContrUpper,\\n\",\n       \"\\t    rsOrdUpper,\\n\",\n       \"\\t    rsOrdLower,\\n\",\n       \"\\t    rsDigits,\\n\",\n       \"\\t    rsEmoji\\n\",\n       \"\\t  ].join('|'), 'g');\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\\n\",\n       \"\\t  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to detect strings that need a more robust regexp to match words. */\\n\",\n       \"\\t  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to assign default `context` object properties. */\\n\",\n       \"\\t  var contextProps = [\\n\",\n       \"\\t    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\\n\",\n       \"\\t    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\\n\",\n       \"\\t    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\\n\",\n       \"\\t    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\\n\",\n       \"\\t    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\\n\",\n       \"\\t  ];\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to make template sourceURLs easier to identify. */\\n\",\n       \"\\t  var templateCounter = -1;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to identify `toStringTag` values of typed arrays. */\\n\",\n       \"\\t  var typedArrayTags = {};\\n\",\n       \"\\t  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\\n\",\n       \"\\t  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\\n\",\n       \"\\t  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\\n\",\n       \"\\t  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\\n\",\n       \"\\t  typedArrayTags[uint32Tag] = true;\\n\",\n       \"\\t  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\\n\",\n       \"\\t  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\\n\",\n       \"\\t  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\\n\",\n       \"\\t  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\\n\",\n       \"\\t  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\\n\",\n       \"\\t  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\\n\",\n       \"\\t  typedArrayTags[setTag] = typedArrayTags[stringTag] =\\n\",\n       \"\\t  typedArrayTags[weakMapTag] = false;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to identify `toStringTag` values supported by `_.clone`. */\\n\",\n       \"\\t  var cloneableTags = {};\\n\",\n       \"\\t  cloneableTags[argsTag] = cloneableTags[arrayTag] =\\n\",\n       \"\\t  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\\n\",\n       \"\\t  cloneableTags[boolTag] = cloneableTags[dateTag] =\\n\",\n       \"\\t  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\\n\",\n       \"\\t  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\\n\",\n       \"\\t  cloneableTags[int32Tag] = cloneableTags[mapTag] =\\n\",\n       \"\\t  cloneableTags[numberTag] = cloneableTags[objectTag] =\\n\",\n       \"\\t  cloneableTags[regexpTag] = cloneableTags[setTag] =\\n\",\n       \"\\t  cloneableTags[stringTag] = cloneableTags[symbolTag] =\\n\",\n       \"\\t  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\\n\",\n       \"\\t  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\\n\",\n       \"\\t  cloneableTags[errorTag] = cloneableTags[funcTag] =\\n\",\n       \"\\t  cloneableTags[weakMapTag] = false;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to map Latin Unicode letters to basic Latin letters. */\\n\",\n       \"\\t  var deburredLetters = {\\n\",\n       \"\\t    // Latin-1 Supplement block.\\n\",\n       \"\\t    '\\\\xc0': 'A',  '\\\\xc1': 'A', '\\\\xc2': 'A', '\\\\xc3': 'A', '\\\\xc4': 'A', '\\\\xc5': 'A',\\n\",\n       \"\\t    '\\\\xe0': 'a',  '\\\\xe1': 'a', '\\\\xe2': 'a', '\\\\xe3': 'a', '\\\\xe4': 'a', '\\\\xe5': 'a',\\n\",\n       \"\\t    '\\\\xc7': 'C',  '\\\\xe7': 'c',\\n\",\n       \"\\t    '\\\\xd0': 'D',  '\\\\xf0': 'd',\\n\",\n       \"\\t    '\\\\xc8': 'E',  '\\\\xc9': 'E', '\\\\xca': 'E', '\\\\xcb': 'E',\\n\",\n       \"\\t    '\\\\xe8': 'e',  '\\\\xe9': 'e', '\\\\xea': 'e', '\\\\xeb': 'e',\\n\",\n       \"\\t    '\\\\xcc': 'I',  '\\\\xcd': 'I', '\\\\xce': 'I', '\\\\xcf': 'I',\\n\",\n       \"\\t    '\\\\xec': 'i',  '\\\\xed': 'i', '\\\\xee': 'i', '\\\\xef': 'i',\\n\",\n       \"\\t    '\\\\xd1': 'N',  '\\\\xf1': 'n',\\n\",\n       \"\\t    '\\\\xd2': 'O',  '\\\\xd3': 'O', '\\\\xd4': 'O', '\\\\xd5': 'O', '\\\\xd6': 'O', '\\\\xd8': 'O',\\n\",\n       \"\\t    '\\\\xf2': 'o',  '\\\\xf3': 'o', '\\\\xf4': 'o', '\\\\xf5': 'o', '\\\\xf6': 'o', '\\\\xf8': 'o',\\n\",\n       \"\\t    '\\\\xd9': 'U',  '\\\\xda': 'U', '\\\\xdb': 'U', '\\\\xdc': 'U',\\n\",\n       \"\\t    '\\\\xf9': 'u',  '\\\\xfa': 'u', '\\\\xfb': 'u', '\\\\xfc': 'u',\\n\",\n       \"\\t    '\\\\xdd': 'Y',  '\\\\xfd': 'y', '\\\\xff': 'y',\\n\",\n       \"\\t    '\\\\xc6': 'Ae', '\\\\xe6': 'ae',\\n\",\n       \"\\t    '\\\\xde': 'Th', '\\\\xfe': 'th',\\n\",\n       \"\\t    '\\\\xdf': 'ss',\\n\",\n       \"\\t    // Latin Extended-A block.\\n\",\n       \"\\t    '\\\\u0100': 'A',  '\\\\u0102': 'A', '\\\\u0104': 'A',\\n\",\n       \"\\t    '\\\\u0101': 'a',  '\\\\u0103': 'a', '\\\\u0105': 'a',\\n\",\n       \"\\t    '\\\\u0106': 'C',  '\\\\u0108': 'C', '\\\\u010a': 'C', '\\\\u010c': 'C',\\n\",\n       \"\\t    '\\\\u0107': 'c',  '\\\\u0109': 'c', '\\\\u010b': 'c', '\\\\u010d': 'c',\\n\",\n       \"\\t    '\\\\u010e': 'D',  '\\\\u0110': 'D', '\\\\u010f': 'd', '\\\\u0111': 'd',\\n\",\n       \"\\t    '\\\\u0112': 'E',  '\\\\u0114': 'E', '\\\\u0116': 'E', '\\\\u0118': 'E', '\\\\u011a': 'E',\\n\",\n       \"\\t    '\\\\u0113': 'e',  '\\\\u0115': 'e', '\\\\u0117': 'e', '\\\\u0119': 'e', '\\\\u011b': 'e',\\n\",\n       \"\\t    '\\\\u011c': 'G',  '\\\\u011e': 'G', '\\\\u0120': 'G', '\\\\u0122': 'G',\\n\",\n       \"\\t    '\\\\u011d': 'g',  '\\\\u011f': 'g', '\\\\u0121': 'g', '\\\\u0123': 'g',\\n\",\n       \"\\t    '\\\\u0124': 'H',  '\\\\u0126': 'H', '\\\\u0125': 'h', '\\\\u0127': 'h',\\n\",\n       \"\\t    '\\\\u0128': 'I',  '\\\\u012a': 'I', '\\\\u012c': 'I', '\\\\u012e': 'I', '\\\\u0130': 'I',\\n\",\n       \"\\t    '\\\\u0129': 'i',  '\\\\u012b': 'i', '\\\\u012d': 'i', '\\\\u012f': 'i', '\\\\u0131': 'i',\\n\",\n       \"\\t    '\\\\u0134': 'J',  '\\\\u0135': 'j',\\n\",\n       \"\\t    '\\\\u0136': 'K',  '\\\\u0137': 'k', '\\\\u0138': 'k',\\n\",\n       \"\\t    '\\\\u0139': 'L',  '\\\\u013b': 'L', '\\\\u013d': 'L', '\\\\u013f': 'L', '\\\\u0141': 'L',\\n\",\n       \"\\t    '\\\\u013a': 'l',  '\\\\u013c': 'l', '\\\\u013e': 'l', '\\\\u0140': 'l', '\\\\u0142': 'l',\\n\",\n       \"\\t    '\\\\u0143': 'N',  '\\\\u0145': 'N', '\\\\u0147': 'N', '\\\\u014a': 'N',\\n\",\n       \"\\t    '\\\\u0144': 'n',  '\\\\u0146': 'n', '\\\\u0148': 'n', '\\\\u014b': 'n',\\n\",\n       \"\\t    '\\\\u014c': 'O',  '\\\\u014e': 'O', '\\\\u0150': 'O',\\n\",\n       \"\\t    '\\\\u014d': 'o',  '\\\\u014f': 'o', '\\\\u0151': 'o',\\n\",\n       \"\\t    '\\\\u0154': 'R',  '\\\\u0156': 'R', '\\\\u0158': 'R',\\n\",\n       \"\\t    '\\\\u0155': 'r',  '\\\\u0157': 'r', '\\\\u0159': 'r',\\n\",\n       \"\\t    '\\\\u015a': 'S',  '\\\\u015c': 'S', '\\\\u015e': 'S', '\\\\u0160': 'S',\\n\",\n       \"\\t    '\\\\u015b': 's',  '\\\\u015d': 's', '\\\\u015f': 's', '\\\\u0161': 's',\\n\",\n       \"\\t    '\\\\u0162': 'T',  '\\\\u0164': 'T', '\\\\u0166': 'T',\\n\",\n       \"\\t    '\\\\u0163': 't',  '\\\\u0165': 't', '\\\\u0167': 't',\\n\",\n       \"\\t    '\\\\u0168': 'U',  '\\\\u016a': 'U', '\\\\u016c': 'U', '\\\\u016e': 'U', '\\\\u0170': 'U', '\\\\u0172': 'U',\\n\",\n       \"\\t    '\\\\u0169': 'u',  '\\\\u016b': 'u', '\\\\u016d': 'u', '\\\\u016f': 'u', '\\\\u0171': 'u', '\\\\u0173': 'u',\\n\",\n       \"\\t    '\\\\u0174': 'W',  '\\\\u0175': 'w',\\n\",\n       \"\\t    '\\\\u0176': 'Y',  '\\\\u0177': 'y', '\\\\u0178': 'Y',\\n\",\n       \"\\t    '\\\\u0179': 'Z',  '\\\\u017b': 'Z', '\\\\u017d': 'Z',\\n\",\n       \"\\t    '\\\\u017a': 'z',  '\\\\u017c': 'z', '\\\\u017e': 'z',\\n\",\n       \"\\t    '\\\\u0132': 'IJ', '\\\\u0133': 'ij',\\n\",\n       \"\\t    '\\\\u0152': 'Oe', '\\\\u0153': 'oe',\\n\",\n       \"\\t    '\\\\u0149': \\\"'n\\\", '\\\\u017f': 's'\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to map characters to HTML entities. */\\n\",\n       \"\\t  var htmlEscapes = {\\n\",\n       \"\\t    '&': '&amp;',\\n\",\n       \"\\t    '<': '&lt;',\\n\",\n       \"\\t    '>': '&gt;',\\n\",\n       \"\\t    '\\\"': '&quot;',\\n\",\n       \"\\t    \\\"'\\\": '&#39;'\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to map HTML entities to characters. */\\n\",\n       \"\\t  var htmlUnescapes = {\\n\",\n       \"\\t    '&amp;': '&',\\n\",\n       \"\\t    '&lt;': '<',\\n\",\n       \"\\t    '&gt;': '>',\\n\",\n       \"\\t    '&quot;': '\\\"',\\n\",\n       \"\\t    '&#39;': \\\"'\\\"\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to escape characters for inclusion in compiled string literals. */\\n\",\n       \"\\t  var stringEscapes = {\\n\",\n       \"\\t    '\\\\\\\\': '\\\\\\\\',\\n\",\n       \"\\t    \\\"'\\\": \\\"'\\\",\\n\",\n       \"\\t    '\\\\n': 'n',\\n\",\n       \"\\t    '\\\\r': 'r',\\n\",\n       \"\\t    '\\\\u2028': 'u2028',\\n\",\n       \"\\t    '\\\\u2029': 'u2029'\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Built-in method references without a dependency on `root`. */\\n\",\n       \"\\t  var freeParseFloat = parseFloat,\\n\",\n       \"\\t      freeParseInt = parseInt;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Detect free variable `global` from Node.js. */\\n\",\n       \"\\t  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Detect free variable `self`. */\\n\",\n       \"\\t  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used as a reference to the global object. */\\n\",\n       \"\\t  var root = freeGlobal || freeSelf || Function('return this')();\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Detect free variable `exports`. */\\n\",\n       \"\\t  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Detect free variable `module`. */\\n\",\n       \"\\t  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Detect the popular CommonJS extension `module.exports`. */\\n\",\n       \"\\t  var moduleExports = freeModule && freeModule.exports === freeExports;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Detect free variable `process` from Node.js. */\\n\",\n       \"\\t  var freeProcess = moduleExports && freeGlobal.process;\\n\",\n       \"\\t\\n\",\n       \"\\t  /** Used to access faster Node.js helpers. */\\n\",\n       \"\\t  var nodeUtil = (function() {\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      // Use `util.types` for Node.js 10+.\\n\",\n       \"\\t      var types = freeModule && freeModule.require && freeModule.require('util').types;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (types) {\\n\",\n       \"\\t        return types;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      // Legacy `process.binding('util')` for Node.js < 10.\\n\",\n       \"\\t      return freeProcess && freeProcess.binding && freeProcess.binding('util');\\n\",\n       \"\\t    } catch (e) {}\\n\",\n       \"\\t  }());\\n\",\n       \"\\t\\n\",\n       \"\\t  /* Node.js helper references. */\\n\",\n       \"\\t  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\\n\",\n       \"\\t      nodeIsDate = nodeUtil && nodeUtil.isDate,\\n\",\n       \"\\t      nodeIsMap = nodeUtil && nodeUtil.isMap,\\n\",\n       \"\\t      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\\n\",\n       \"\\t      nodeIsSet = nodeUtil && nodeUtil.isSet,\\n\",\n       \"\\t      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\\n\",\n       \"\\t\\n\",\n       \"\\t  /*--------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A faster alternative to `Function#apply`, this function invokes `func`\\n\",\n       \"\\t   * with the `this` binding of `thisArg` and the arguments of `args`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Function} func The function to invoke.\\n\",\n       \"\\t   * @param {*} thisArg The `this` binding of `func`.\\n\",\n       \"\\t   * @param {Array} args The arguments to invoke `func` with.\\n\",\n       \"\\t   * @returns {*} Returns the result of `func`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function apply(func, thisArg, args) {\\n\",\n       \"\\t    switch (args.length) {\\n\",\n       \"\\t      case 0: return func.call(thisArg);\\n\",\n       \"\\t      case 1: return func.call(thisArg, args[0]);\\n\",\n       \"\\t      case 2: return func.call(thisArg, args[0], args[1]);\\n\",\n       \"\\t      case 3: return func.call(thisArg, args[0], args[1], args[2]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return func.apply(thisArg, args);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `baseAggregator` for arrays.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} setter The function to set `accumulator` values.\\n\",\n       \"\\t   * @param {Function} iteratee The iteratee to transform keys.\\n\",\n       \"\\t   * @param {Object} accumulator The initial aggregated object.\\n\",\n       \"\\t   * @returns {Function} Returns `accumulator`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayAggregator(array, setter, iteratee, accumulator) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      var value = array[index];\\n\",\n       \"\\t      setter(accumulator, value, iteratee(value), array);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return accumulator;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.forEach` for arrays without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @returns {Array} Returns `array`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayEach(array, iteratee) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      if (iteratee(array[index], index, array) === false) {\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return array;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.forEachRight` for arrays without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @returns {Array} Returns `array`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayEachRight(array, iteratee) {\\n\",\n       \"\\t    var length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (length--) {\\n\",\n       \"\\t      if (iteratee(array[length], length, array) === false) {\\n\",\n       \"\\t        break;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return array;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.every` for arrays without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if all elements pass the predicate check,\\n\",\n       \"\\t   *  else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayEvery(array, predicate) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      if (!predicate(array[index], index, array)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.filter` for arrays without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t   * @returns {Array} Returns the new filtered array.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayFilter(array, predicate) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length,\\n\",\n       \"\\t        resIndex = 0,\\n\",\n       \"\\t        result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      var value = array[index];\\n\",\n       \"\\t      if (predicate(value, index, array)) {\\n\",\n       \"\\t        result[resIndex++] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.includes` for arrays without support for\\n\",\n       \"\\t   * specifying an index to search from.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to inspect.\\n\",\n       \"\\t   * @param {*} target The value to search for.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if `target` is found, else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayIncludes(array, value) {\\n\",\n       \"\\t    var length = array == null ? 0 : array.length;\\n\",\n       \"\\t    return !!length && baseIndexOf(array, value, 0) > -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * This function is like `arrayIncludes` except that it accepts a comparator.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to inspect.\\n\",\n       \"\\t   * @param {*} target The value to search for.\\n\",\n       \"\\t   * @param {Function} comparator The comparator invoked per element.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if `target` is found, else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayIncludesWith(array, value, comparator) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      if (comparator(value, array[index])) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return false;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.map` for arrays without support for iteratee\\n\",\n       \"\\t   * shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @returns {Array} Returns the new mapped array.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayMap(array, iteratee) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length,\\n\",\n       \"\\t        result = Array(length);\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      result[index] = iteratee(array[index], index, array);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Appends the elements of `values` to `array`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to modify.\\n\",\n       \"\\t   * @param {Array} values The values to append.\\n\",\n       \"\\t   * @returns {Array} Returns `array`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayPush(array, values) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = values.length,\\n\",\n       \"\\t        offset = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      array[offset + index] = values[index];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return array;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.reduce` for arrays without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @param {*} [accumulator] The initial value.\\n\",\n       \"\\t   * @param {boolean} [initAccum] Specify using the first element of `array` as\\n\",\n       \"\\t   *  the initial value.\\n\",\n       \"\\t   * @returns {*} Returns the accumulated value.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayReduce(array, iteratee, accumulator, initAccum) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    if (initAccum && length) {\\n\",\n       \"\\t      accumulator = array[++index];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      accumulator = iteratee(accumulator, array[index], index, array);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return accumulator;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.reduceRight` for arrays without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @param {*} [accumulator] The initial value.\\n\",\n       \"\\t   * @param {boolean} [initAccum] Specify using the last element of `array` as\\n\",\n       \"\\t   *  the initial value.\\n\",\n       \"\\t   * @returns {*} Returns the accumulated value.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\\n\",\n       \"\\t    var length = array == null ? 0 : array.length;\\n\",\n       \"\\t    if (initAccum && length) {\\n\",\n       \"\\t      accumulator = array[--length];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    while (length--) {\\n\",\n       \"\\t      accumulator = iteratee(accumulator, array[length], length, array);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return accumulator;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.some` for arrays without support for iteratee\\n\",\n       \"\\t   * shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} [array] The array to iterate over.\\n\",\n       \"\\t   * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if any element passes the predicate check,\\n\",\n       \"\\t   *  else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function arraySome(array, predicate) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array == null ? 0 : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      if (predicate(array[index], index, array)) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return false;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Gets the size of an ASCII `string`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string inspect.\\n\",\n       \"\\t   * @returns {number} Returns the string size.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var asciiSize = baseProperty('length');\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts an ASCII `string` to an array.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the converted array.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function asciiToArray(string) {\\n\",\n       \"\\t    return string.split('');\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Splits an ASCII `string` into an array of its words.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} The string to inspect.\\n\",\n       \"\\t   * @returns {Array} Returns the words of `string`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function asciiWords(string) {\\n\",\n       \"\\t    return string.match(reAsciiWord) || [];\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\\n\",\n       \"\\t   * without support for iteratee shorthands, which iterates over `collection`\\n\",\n       \"\\t   * using `eachFunc`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array|Object} collection The collection to inspect.\\n\",\n       \"\\t   * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t   * @param {Function} eachFunc The function to iterate over `collection`.\\n\",\n       \"\\t   * @returns {*} Returns the found element or its key, else `undefined`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseFindKey(collection, predicate, eachFunc) {\\n\",\n       \"\\t    var result;\\n\",\n       \"\\t    eachFunc(collection, function(value, key, collection) {\\n\",\n       \"\\t      if (predicate(value, key, collection)) {\\n\",\n       \"\\t        result = key;\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.findIndex` and `_.findLastIndex` without\\n\",\n       \"\\t   * support for iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to inspect.\\n\",\n       \"\\t   * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t   * @param {number} fromIndex The index to search from.\\n\",\n       \"\\t   * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t   * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseFindIndex(array, predicate, fromIndex, fromRight) {\\n\",\n       \"\\t    var length = array.length,\\n\",\n       \"\\t        index = fromIndex + (fromRight ? 1 : -1);\\n\",\n       \"\\t\\n\",\n       \"\\t    while ((fromRight ? index-- : ++index < length)) {\\n\",\n       \"\\t      if (predicate(array[index], index, array)) {\\n\",\n       \"\\t        return index;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to inspect.\\n\",\n       \"\\t   * @param {*} value The value to search for.\\n\",\n       \"\\t   * @param {number} fromIndex The index to search from.\\n\",\n       \"\\t   * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseIndexOf(array, value, fromIndex) {\\n\",\n       \"\\t    return value === value\\n\",\n       \"\\t      ? strictIndexOf(array, value, fromIndex)\\n\",\n       \"\\t      : baseFindIndex(array, baseIsNaN, fromIndex);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * This function is like `baseIndexOf` except that it accepts a comparator.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to inspect.\\n\",\n       \"\\t   * @param {*} value The value to search for.\\n\",\n       \"\\t   * @param {number} fromIndex The index to search from.\\n\",\n       \"\\t   * @param {Function} comparator The comparator invoked per element.\\n\",\n       \"\\t   * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseIndexOfWith(array, value, fromIndex, comparator) {\\n\",\n       \"\\t    var index = fromIndex - 1,\\n\",\n       \"\\t        length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      if (comparator(array[index], value)) {\\n\",\n       \"\\t        return index;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.isNaN` without support for number objects.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {*} value The value to check.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseIsNaN(value) {\\n\",\n       \"\\t    return value !== value;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.mean` and `_.meanBy` without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @returns {number} Returns the mean.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseMean(array, iteratee) {\\n\",\n       \"\\t    var length = array == null ? 0 : array.length;\\n\",\n       \"\\t    return length ? (baseSum(array, iteratee) / length) : NAN;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.property` without support for deep paths.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} key The key of the property to get.\\n\",\n       \"\\t   * @returns {Function} Returns the new accessor function.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseProperty(key) {\\n\",\n       \"\\t    return function(object) {\\n\",\n       \"\\t      return object == null ? undefined : object[key];\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.propertyOf` without support for deep paths.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} object The object to query.\\n\",\n       \"\\t   * @returns {Function} Returns the new accessor function.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function basePropertyOf(object) {\\n\",\n       \"\\t    return function(key) {\\n\",\n       \"\\t      return object == null ? undefined : object[key];\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.reduce` and `_.reduceRight`, without support\\n\",\n       \"\\t   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @param {*} accumulator The initial value.\\n\",\n       \"\\t   * @param {boolean} initAccum Specify using the first or last element of\\n\",\n       \"\\t   *  `collection` as the initial value.\\n\",\n       \"\\t   * @param {Function} eachFunc The function to iterate over `collection`.\\n\",\n       \"\\t   * @returns {*} Returns the accumulated value.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\\n\",\n       \"\\t    eachFunc(collection, function(value, index, collection) {\\n\",\n       \"\\t      accumulator = initAccum\\n\",\n       \"\\t        ? (initAccum = false, value)\\n\",\n       \"\\t        : iteratee(accumulator, value, index, collection);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return accumulator;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.sortBy` which uses `comparer` to define the\\n\",\n       \"\\t   * sort order of `array` and replaces criteria objects with their corresponding\\n\",\n       \"\\t   * values.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to sort.\\n\",\n       \"\\t   * @param {Function} comparer The function to define sort order.\\n\",\n       \"\\t   * @returns {Array} Returns `array`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseSortBy(array, comparer) {\\n\",\n       \"\\t    var length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    array.sort(comparer);\\n\",\n       \"\\t    while (length--) {\\n\",\n       \"\\t      array[length] = array[length].value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return array;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.sum` and `_.sumBy` without support for\\n\",\n       \"\\t   * iteratee shorthands.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to iterate over.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @returns {number} Returns the sum.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseSum(array, iteratee) {\\n\",\n       \"\\t    var result,\\n\",\n       \"\\t        index = -1,\\n\",\n       \"\\t        length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      var current = iteratee(array[index]);\\n\",\n       \"\\t      if (current !== undefined) {\\n\",\n       \"\\t        result = result === undefined ? current : (result + current);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.times` without support for iteratee shorthands\\n\",\n       \"\\t   * or max array length checks.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {number} n The number of times to invoke `iteratee`.\\n\",\n       \"\\t   * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t   * @returns {Array} Returns the array of results.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseTimes(n, iteratee) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        result = Array(n);\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < n) {\\n\",\n       \"\\t      result[index] = iteratee(index);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\\n\",\n       \"\\t   * of key-value pairs for `object` corresponding to the property names of `props`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} object The object to query.\\n\",\n       \"\\t   * @param {Array} props The property names to get values for.\\n\",\n       \"\\t   * @returns {Object} Returns the key-value pairs.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseToPairs(object, props) {\\n\",\n       \"\\t    return arrayMap(props, function(key) {\\n\",\n       \"\\t      return [key, object[key]];\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.unary` without support for storing metadata.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Function} func The function to cap arguments for.\\n\",\n       \"\\t   * @returns {Function} Returns the new capped function.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseUnary(func) {\\n\",\n       \"\\t    return function(value) {\\n\",\n       \"\\t      return func(value);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * The base implementation of `_.values` and `_.valuesIn` which creates an\\n\",\n       \"\\t   * array of `object` property values corresponding to the property names\\n\",\n       \"\\t   * of `props`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} object The object to query.\\n\",\n       \"\\t   * @param {Array} props The property names to get values for.\\n\",\n       \"\\t   * @returns {Object} Returns the array of property values.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function baseValues(object, props) {\\n\",\n       \"\\t    return arrayMap(props, function(key) {\\n\",\n       \"\\t      return object[key];\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Checks if a `cache` value for `key` exists.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} cache The cache to query.\\n\",\n       \"\\t   * @param {string} key The key of the entry to check.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function cacheHas(cache, key) {\\n\",\n       \"\\t    return cache.has(key);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\\n\",\n       \"\\t   * that is not found in the character symbols.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} strSymbols The string symbols to inspect.\\n\",\n       \"\\t   * @param {Array} chrSymbols The character symbols to find.\\n\",\n       \"\\t   * @returns {number} Returns the index of the first unmatched string symbol.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function charsStartIndex(strSymbols, chrSymbols) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = strSymbols.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\\n\",\n       \"\\t    return index;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\\n\",\n       \"\\t   * that is not found in the character symbols.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} strSymbols The string symbols to inspect.\\n\",\n       \"\\t   * @param {Array} chrSymbols The character symbols to find.\\n\",\n       \"\\t   * @returns {number} Returns the index of the last unmatched string symbol.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function charsEndIndex(strSymbols, chrSymbols) {\\n\",\n       \"\\t    var index = strSymbols.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\\n\",\n       \"\\t    return index;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Gets the number of `placeholder` occurrences in `array`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to inspect.\\n\",\n       \"\\t   * @param {*} placeholder The placeholder to search for.\\n\",\n       \"\\t   * @returns {number} Returns the placeholder count.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function countHolders(array, placeholder) {\\n\",\n       \"\\t    var length = array.length,\\n\",\n       \"\\t        result = 0;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (length--) {\\n\",\n       \"\\t      if (array[length] === placeholder) {\\n\",\n       \"\\t        ++result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\\n\",\n       \"\\t   * letters to basic Latin letters.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} letter The matched letter to deburr.\\n\",\n       \"\\t   * @returns {string} Returns the deburred letter.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var deburrLetter = basePropertyOf(deburredLetters);\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used by `_.escape` to convert characters to HTML entities.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} chr The matched character to escape.\\n\",\n       \"\\t   * @returns {string} Returns the escaped character.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var escapeHtmlChar = basePropertyOf(htmlEscapes);\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used by `_.template` to escape characters for inclusion in compiled string literals.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} chr The matched character to escape.\\n\",\n       \"\\t   * @returns {string} Returns the escaped character.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function escapeStringChar(chr) {\\n\",\n       \"\\t    return '\\\\\\\\' + stringEscapes[chr];\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Gets the value at `key` of `object`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} [object] The object to query.\\n\",\n       \"\\t   * @param {string} key The key of the property to get.\\n\",\n       \"\\t   * @returns {*} Returns the property value.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function getValue(object, key) {\\n\",\n       \"\\t    return object == null ? undefined : object[key];\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Checks if `string` contains Unicode symbols.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string to inspect.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if a symbol is found, else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function hasUnicode(string) {\\n\",\n       \"\\t    return reHasUnicode.test(string);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Checks if `string` contains a word composed of Unicode symbols.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string to inspect.\\n\",\n       \"\\t   * @returns {boolean} Returns `true` if a word is found, else `false`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function hasUnicodeWord(string) {\\n\",\n       \"\\t    return reHasUnicodeWord.test(string);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts `iterator` to an array.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} iterator The iterator to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the converted array.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function iteratorToArray(iterator) {\\n\",\n       \"\\t    var data,\\n\",\n       \"\\t        result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t    while (!(data = iterator.next()).done) {\\n\",\n       \"\\t      result.push(data.value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts `map` to its key-value pairs.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} map The map to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the key-value pairs.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function mapToArray(map) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        result = Array(map.size);\\n\",\n       \"\\t\\n\",\n       \"\\t    map.forEach(function(value, key) {\\n\",\n       \"\\t      result[++index] = [key, value];\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Creates a unary function that invokes `func` with its argument transformed.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Function} func The function to wrap.\\n\",\n       \"\\t   * @param {Function} transform The argument transform.\\n\",\n       \"\\t   * @returns {Function} Returns the new function.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function overArg(func, transform) {\\n\",\n       \"\\t    return function(arg) {\\n\",\n       \"\\t      return func(transform(arg));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Replaces all `placeholder` elements in `array` with an internal placeholder\\n\",\n       \"\\t   * and returns an array of their indexes.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to modify.\\n\",\n       \"\\t   * @param {*} placeholder The placeholder to replace.\\n\",\n       \"\\t   * @returns {Array} Returns the new array of placeholder indexes.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function replaceHolders(array, placeholder) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        length = array.length,\\n\",\n       \"\\t        resIndex = 0,\\n\",\n       \"\\t        result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      var value = array[index];\\n\",\n       \"\\t      if (value === placeholder || value === PLACEHOLDER) {\\n\",\n       \"\\t        array[index] = PLACEHOLDER;\\n\",\n       \"\\t        result[resIndex++] = index;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts `set` to an array of its values.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} set The set to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the values.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function setToArray(set) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        result = Array(set.size);\\n\",\n       \"\\t\\n\",\n       \"\\t    set.forEach(function(value) {\\n\",\n       \"\\t      result[++index] = value;\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts `set` to its value-value pairs.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Object} set The set to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the value-value pairs.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function setToPairs(set) {\\n\",\n       \"\\t    var index = -1,\\n\",\n       \"\\t        result = Array(set.size);\\n\",\n       \"\\t\\n\",\n       \"\\t    set.forEach(function(value) {\\n\",\n       \"\\t      result[++index] = [value, value];\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.indexOf` which performs strict equality\\n\",\n       \"\\t   * comparisons of values, i.e. `===`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to inspect.\\n\",\n       \"\\t   * @param {*} value The value to search for.\\n\",\n       \"\\t   * @param {number} fromIndex The index to search from.\\n\",\n       \"\\t   * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function strictIndexOf(array, value, fromIndex) {\\n\",\n       \"\\t    var index = fromIndex - 1,\\n\",\n       \"\\t        length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t    while (++index < length) {\\n\",\n       \"\\t      if (array[index] === value) {\\n\",\n       \"\\t        return index;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * A specialized version of `_.lastIndexOf` which performs strict equality\\n\",\n       \"\\t   * comparisons of values, i.e. `===`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {Array} array The array to inspect.\\n\",\n       \"\\t   * @param {*} value The value to search for.\\n\",\n       \"\\t   * @param {number} fromIndex The index to search from.\\n\",\n       \"\\t   * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function strictLastIndexOf(array, value, fromIndex) {\\n\",\n       \"\\t    var index = fromIndex + 1;\\n\",\n       \"\\t    while (index--) {\\n\",\n       \"\\t      if (array[index] === value) {\\n\",\n       \"\\t        return index;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return index;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Gets the number of symbols in `string`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string to inspect.\\n\",\n       \"\\t   * @returns {number} Returns the string size.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function stringSize(string) {\\n\",\n       \"\\t    return hasUnicode(string)\\n\",\n       \"\\t      ? unicodeSize(string)\\n\",\n       \"\\t      : asciiSize(string);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts `string` to an array.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the converted array.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function stringToArray(string) {\\n\",\n       \"\\t    return hasUnicode(string)\\n\",\n       \"\\t      ? unicodeToArray(string)\\n\",\n       \"\\t      : asciiToArray(string);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Used by `_.unescape` to convert HTML entities to characters.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} chr The matched character to unescape.\\n\",\n       \"\\t   * @returns {string} Returns the unescaped character.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Gets the size of a Unicode `string`.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string inspect.\\n\",\n       \"\\t   * @returns {number} Returns the string size.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function unicodeSize(string) {\\n\",\n       \"\\t    var result = reUnicode.lastIndex = 0;\\n\",\n       \"\\t    while (reUnicode.test(string)) {\\n\",\n       \"\\t      ++result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Converts a Unicode `string` to an array.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} string The string to convert.\\n\",\n       \"\\t   * @returns {Array} Returns the converted array.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function unicodeToArray(string) {\\n\",\n       \"\\t    return string.match(reUnicode) || [];\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Splits a Unicode `string` into an array of its words.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @private\\n\",\n       \"\\t   * @param {string} The string to inspect.\\n\",\n       \"\\t   * @returns {Array} Returns the words of `string`.\\n\",\n       \"\\t   */\\n\",\n       \"\\t  function unicodeWords(string) {\\n\",\n       \"\\t    return string.match(reUnicodeWord) || [];\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  /*--------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t  /**\\n\",\n       \"\\t   * Create a new pristine `lodash` function using the `context` object.\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * @static\\n\",\n       \"\\t   * @memberOf _\\n\",\n       \"\\t   * @since 1.1.0\\n\",\n       \"\\t   * @category Util\\n\",\n       \"\\t   * @param {Object} [context=root] The context object.\\n\",\n       \"\\t   * @returns {Function} Returns a new `lodash` function.\\n\",\n       \"\\t   * @example\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * _.mixin({ 'foo': _.constant('foo') });\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * var lodash = _.runInContext();\\n\",\n       \"\\t   * lodash.mixin({ 'bar': lodash.constant('bar') });\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * _.isFunction(_.foo);\\n\",\n       \"\\t   * // => true\\n\",\n       \"\\t   * _.isFunction(_.bar);\\n\",\n       \"\\t   * // => false\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * lodash.isFunction(lodash.foo);\\n\",\n       \"\\t   * // => false\\n\",\n       \"\\t   * lodash.isFunction(lodash.bar);\\n\",\n       \"\\t   * // => true\\n\",\n       \"\\t   *\\n\",\n       \"\\t   * // Create a suped-up `defer` in Node.js.\\n\",\n       \"\\t   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\\n\",\n       \"\\t   */\\n\",\n       \"\\t  var runInContext = (function runInContext(context) {\\n\",\n       \"\\t    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Built-in constructor references. */\\n\",\n       \"\\t    var Array = context.Array,\\n\",\n       \"\\t        Date = context.Date,\\n\",\n       \"\\t        Error = context.Error,\\n\",\n       \"\\t        Function = context.Function,\\n\",\n       \"\\t        Math = context.Math,\\n\",\n       \"\\t        Object = context.Object,\\n\",\n       \"\\t        RegExp = context.RegExp,\\n\",\n       \"\\t        String = context.String,\\n\",\n       \"\\t        TypeError = context.TypeError;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used for built-in method references. */\\n\",\n       \"\\t    var arrayProto = Array.prototype,\\n\",\n       \"\\t        funcProto = Function.prototype,\\n\",\n       \"\\t        objectProto = Object.prototype;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to detect overreaching core-js shims. */\\n\",\n       \"\\t    var coreJsData = context['__core-js_shared__'];\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to resolve the decompiled source of functions. */\\n\",\n       \"\\t    var funcToString = funcProto.toString;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to check objects for own properties. */\\n\",\n       \"\\t    var hasOwnProperty = objectProto.hasOwnProperty;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to generate unique IDs. */\\n\",\n       \"\\t    var idCounter = 0;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to detect methods masquerading as native. */\\n\",\n       \"\\t    var maskSrcKey = (function() {\\n\",\n       \"\\t      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\\n\",\n       \"\\t      return uid ? ('Symbol(src)_1.' + uid) : '';\\n\",\n       \"\\t    }());\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Used to resolve the\\n\",\n       \"\\t     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\\n\",\n       \"\\t     * of values.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var nativeObjectToString = objectProto.toString;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to infer the `Object` constructor. */\\n\",\n       \"\\t    var objectCtorString = funcToString.call(Object);\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to restore the original `_` reference in `_.noConflict`. */\\n\",\n       \"\\t    var oldDash = root._;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to detect if a method is native. */\\n\",\n       \"\\t    var reIsNative = RegExp('^' +\\n\",\n       \"\\t      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\\\\\$&')\\n\",\n       \"\\t      .replace(/hasOwnProperty|(function).*?(?=\\\\\\\\\\\\()| for .+?(?=\\\\\\\\\\\\])/g, '$1.*?') + '$'\\n\",\n       \"\\t    );\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Built-in value references. */\\n\",\n       \"\\t    var Buffer = moduleExports ? context.Buffer : undefined,\\n\",\n       \"\\t        Symbol = context.Symbol,\\n\",\n       \"\\t        Uint8Array = context.Uint8Array,\\n\",\n       \"\\t        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\\n\",\n       \"\\t        getPrototype = overArg(Object.getPrototypeOf, Object),\\n\",\n       \"\\t        objectCreate = Object.create,\\n\",\n       \"\\t        propertyIsEnumerable = objectProto.propertyIsEnumerable,\\n\",\n       \"\\t        splice = arrayProto.splice,\\n\",\n       \"\\t        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\\n\",\n       \"\\t        symIterator = Symbol ? Symbol.iterator : undefined,\\n\",\n       \"\\t        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    var defineProperty = (function() {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        var func = getNative(Object, 'defineProperty');\\n\",\n       \"\\t        func({}, '', {});\\n\",\n       \"\\t        return func;\\n\",\n       \"\\t      } catch (e) {}\\n\",\n       \"\\t    }());\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Mocked built-ins. */\\n\",\n       \"\\t    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\\n\",\n       \"\\t        ctxNow = Date && Date.now !== root.Date.now && Date.now,\\n\",\n       \"\\t        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\\n\",\n       \"\\t\\n\",\n       \"\\t    /* Built-in method references for those with the same name as other `lodash` methods. */\\n\",\n       \"\\t    var nativeCeil = Math.ceil,\\n\",\n       \"\\t        nativeFloor = Math.floor,\\n\",\n       \"\\t        nativeGetSymbols = Object.getOwnPropertySymbols,\\n\",\n       \"\\t        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\\n\",\n       \"\\t        nativeIsFinite = context.isFinite,\\n\",\n       \"\\t        nativeJoin = arrayProto.join,\\n\",\n       \"\\t        nativeKeys = overArg(Object.keys, Object),\\n\",\n       \"\\t        nativeMax = Math.max,\\n\",\n       \"\\t        nativeMin = Math.min,\\n\",\n       \"\\t        nativeNow = Date.now,\\n\",\n       \"\\t        nativeParseInt = context.parseInt,\\n\",\n       \"\\t        nativeRandom = Math.random,\\n\",\n       \"\\t        nativeReverse = arrayProto.reverse;\\n\",\n       \"\\t\\n\",\n       \"\\t    /* Built-in method references that are verified to be native. */\\n\",\n       \"\\t    var DataView = getNative(context, 'DataView'),\\n\",\n       \"\\t        Map = getNative(context, 'Map'),\\n\",\n       \"\\t        Promise = getNative(context, 'Promise'),\\n\",\n       \"\\t        Set = getNative(context, 'Set'),\\n\",\n       \"\\t        WeakMap = getNative(context, 'WeakMap'),\\n\",\n       \"\\t        nativeCreate = getNative(Object, 'create');\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to store function metadata. */\\n\",\n       \"\\t    var metaMap = WeakMap && new WeakMap;\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to lookup unminified function names. */\\n\",\n       \"\\t    var realNames = {};\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to detect maps, sets, and weakmaps. */\\n\",\n       \"\\t    var dataViewCtorString = toSource(DataView),\\n\",\n       \"\\t        mapCtorString = toSource(Map),\\n\",\n       \"\\t        promiseCtorString = toSource(Promise),\\n\",\n       \"\\t        setCtorString = toSource(Set),\\n\",\n       \"\\t        weakMapCtorString = toSource(WeakMap);\\n\",\n       \"\\t\\n\",\n       \"\\t    /** Used to convert symbols to primitives and strings. */\\n\",\n       \"\\t    var symbolProto = Symbol ? Symbol.prototype : undefined,\\n\",\n       \"\\t        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\\n\",\n       \"\\t        symbolToString = symbolProto ? symbolProto.toString : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `lodash` object which wraps `value` to enable implicit method\\n\",\n       \"\\t     * chain sequences. Methods that operate on and return arrays, collections,\\n\",\n       \"\\t     * and functions can be chained together. Methods that retrieve a single value\\n\",\n       \"\\t     * or may return a primitive value will automatically end the chain sequence\\n\",\n       \"\\t     * and return the unwrapped value. Otherwise, the value must be unwrapped\\n\",\n       \"\\t     * with `_#value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\\n\",\n       \"\\t     * enabled using `_.chain`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The execution of chained methods is lazy, that is, it's deferred until\\n\",\n       \"\\t     * `_#value` is implicitly or explicitly called.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Lazy evaluation allows several methods to support shortcut fusion.\\n\",\n       \"\\t     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\\n\",\n       \"\\t     * the creation of intermediate arrays and can greatly reduce the number of\\n\",\n       \"\\t     * iteratee executions. Sections of a chain sequence qualify for shortcut\\n\",\n       \"\\t     * fusion if the section is applied to an array and iteratees accept only\\n\",\n       \"\\t     * one argument. The heuristic for whether a section qualifies for shortcut\\n\",\n       \"\\t     * fusion is subject to change.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Chaining is supported in custom builds as long as the `_#value` method is\\n\",\n       \"\\t     * directly or indirectly included in the build.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * In addition to lodash methods, wrappers have `Array` and `String` methods.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The wrapper `Array` methods are:\\n\",\n       \"\\t     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The wrapper `String` methods are:\\n\",\n       \"\\t     * `replace` and `split`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The wrapper methods that support shortcut fusion are:\\n\",\n       \"\\t     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\\n\",\n       \"\\t     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\\n\",\n       \"\\t     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The chainable wrapper methods are:\\n\",\n       \"\\t     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\\n\",\n       \"\\t     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\\n\",\n       \"\\t     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\\n\",\n       \"\\t     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\\n\",\n       \"\\t     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\\n\",\n       \"\\t     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\\n\",\n       \"\\t     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\\n\",\n       \"\\t     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\\n\",\n       \"\\t     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\\n\",\n       \"\\t     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\\n\",\n       \"\\t     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\\n\",\n       \"\\t     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\\n\",\n       \"\\t     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\\n\",\n       \"\\t     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\\n\",\n       \"\\t     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\\n\",\n       \"\\t     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\\n\",\n       \"\\t     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\\n\",\n       \"\\t     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\\n\",\n       \"\\t     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\\n\",\n       \"\\t     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\\n\",\n       \"\\t     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\\n\",\n       \"\\t     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\\n\",\n       \"\\t     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\\n\",\n       \"\\t     * `zipObject`, `zipObjectDeep`, and `zipWith`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The wrapper methods that are **not** chainable by default are:\\n\",\n       \"\\t     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\\n\",\n       \"\\t     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\\n\",\n       \"\\t     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\\n\",\n       \"\\t     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\\n\",\n       \"\\t     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\\n\",\n       \"\\t     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\\n\",\n       \"\\t     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\\n\",\n       \"\\t     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\\n\",\n       \"\\t     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\\n\",\n       \"\\t     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\\n\",\n       \"\\t     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\\n\",\n       \"\\t     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\\n\",\n       \"\\t     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\\n\",\n       \"\\t     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\\n\",\n       \"\\t     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\\n\",\n       \"\\t     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\\n\",\n       \"\\t     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\\n\",\n       \"\\t     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\\n\",\n       \"\\t     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\\n\",\n       \"\\t     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\\n\",\n       \"\\t     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\\n\",\n       \"\\t     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\\n\",\n       \"\\t     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\\n\",\n       \"\\t     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\\n\",\n       \"\\t     * `upperFirst`, `value`, and `words`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name _\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @param {*} value The value to wrap in a `lodash` instance.\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function square(n) {\\n\",\n       \"\\t     *   return n * n;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var wrapped = _([1, 2, 3]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Returns an unwrapped value.\\n\",\n       \"\\t     * wrapped.reduce(_.add);\\n\",\n       \"\\t     * // => 6\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Returns a wrapped value.\\n\",\n       \"\\t     * var squares = wrapped.map(square);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArray(squares);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArray(squares.value());\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function lodash(value) {\\n\",\n       \"\\t      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\\n\",\n       \"\\t        if (value instanceof LodashWrapper) {\\n\",\n       \"\\t          return value;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (hasOwnProperty.call(value, '__wrapped__')) {\\n\",\n       \"\\t          return wrapperClone(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return new LodashWrapper(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.create` without support for assigning\\n\",\n       \"\\t     * properties to the created object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} proto The object to inherit from.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseCreate = (function() {\\n\",\n       \"\\t      function object() {}\\n\",\n       \"\\t      return function(proto) {\\n\",\n       \"\\t        if (!isObject(proto)) {\\n\",\n       \"\\t          return {};\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (objectCreate) {\\n\",\n       \"\\t          return objectCreate(proto);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        object.prototype = proto;\\n\",\n       \"\\t        var result = new object;\\n\",\n       \"\\t        object.prototype = undefined;\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }());\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The function whose prototype chain sequence wrappers inherit from.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseLodash() {\\n\",\n       \"\\t      // No operation performed.\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base constructor for creating `lodash` wrapper objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to wrap.\\n\",\n       \"\\t     * @param {boolean} [chainAll] Enable explicit method chain sequences.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function LodashWrapper(value, chainAll) {\\n\",\n       \"\\t      this.__wrapped__ = value;\\n\",\n       \"\\t      this.__actions__ = [];\\n\",\n       \"\\t      this.__chain__ = !!chainAll;\\n\",\n       \"\\t      this.__index__ = 0;\\n\",\n       \"\\t      this.__values__ = undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * By default, the template delimiters used by lodash are like those in\\n\",\n       \"\\t     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\\n\",\n       \"\\t     * following template settings to use alternative delimiters.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @type {Object}\\n\",\n       \"\\t     */\\n\",\n       \"\\t    lodash.templateSettings = {\\n\",\n       \"\\t\\n\",\n       \"\\t      /**\\n\",\n       \"\\t       * Used to detect `data` property values to be HTML-escaped.\\n\",\n       \"\\t       *\\n\",\n       \"\\t       * @memberOf _.templateSettings\\n\",\n       \"\\t       * @type {RegExp}\\n\",\n       \"\\t       */\\n\",\n       \"\\t      'escape': reEscape,\\n\",\n       \"\\t\\n\",\n       \"\\t      /**\\n\",\n       \"\\t       * Used to detect code to be evaluated.\\n\",\n       \"\\t       *\\n\",\n       \"\\t       * @memberOf _.templateSettings\\n\",\n       \"\\t       * @type {RegExp}\\n\",\n       \"\\t       */\\n\",\n       \"\\t      'evaluate': reEvaluate,\\n\",\n       \"\\t\\n\",\n       \"\\t      /**\\n\",\n       \"\\t       * Used to detect `data` property values to inject.\\n\",\n       \"\\t       *\\n\",\n       \"\\t       * @memberOf _.templateSettings\\n\",\n       \"\\t       * @type {RegExp}\\n\",\n       \"\\t       */\\n\",\n       \"\\t      'interpolate': reInterpolate,\\n\",\n       \"\\t\\n\",\n       \"\\t      /**\\n\",\n       \"\\t       * Used to reference the data object in the template text.\\n\",\n       \"\\t       *\\n\",\n       \"\\t       * @memberOf _.templateSettings\\n\",\n       \"\\t       * @type {string}\\n\",\n       \"\\t       */\\n\",\n       \"\\t      'variable': '',\\n\",\n       \"\\t\\n\",\n       \"\\t      /**\\n\",\n       \"\\t       * Used to import variables into the compiled template.\\n\",\n       \"\\t       *\\n\",\n       \"\\t       * @memberOf _.templateSettings\\n\",\n       \"\\t       * @type {Object}\\n\",\n       \"\\t       */\\n\",\n       \"\\t      'imports': {\\n\",\n       \"\\t\\n\",\n       \"\\t        /**\\n\",\n       \"\\t         * A reference to the `lodash` function.\\n\",\n       \"\\t         *\\n\",\n       \"\\t         * @memberOf _.templateSettings.imports\\n\",\n       \"\\t         * @type {Function}\\n\",\n       \"\\t         */\\n\",\n       \"\\t        '_': lodash\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    // Ensure wrappers are instances of `baseLodash`.\\n\",\n       \"\\t    lodash.prototype = baseLodash.prototype;\\n\",\n       \"\\t    lodash.prototype.constructor = lodash;\\n\",\n       \"\\t\\n\",\n       \"\\t    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\\n\",\n       \"\\t    LodashWrapper.prototype.constructor = LodashWrapper;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @param {*} value The value to wrap.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function LazyWrapper(value) {\\n\",\n       \"\\t      this.__wrapped__ = value;\\n\",\n       \"\\t      this.__actions__ = [];\\n\",\n       \"\\t      this.__dir__ = 1;\\n\",\n       \"\\t      this.__filtered__ = false;\\n\",\n       \"\\t      this.__iteratees__ = [];\\n\",\n       \"\\t      this.__takeCount__ = MAX_ARRAY_LENGTH;\\n\",\n       \"\\t      this.__views__ = [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of the lazy wrapper object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name clone\\n\",\n       \"\\t     * @memberOf LazyWrapper\\n\",\n       \"\\t     * @returns {Object} Returns the cloned `LazyWrapper` object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function lazyClone() {\\n\",\n       \"\\t      var result = new LazyWrapper(this.__wrapped__);\\n\",\n       \"\\t      result.__actions__ = copyArray(this.__actions__);\\n\",\n       \"\\t      result.__dir__ = this.__dir__;\\n\",\n       \"\\t      result.__filtered__ = this.__filtered__;\\n\",\n       \"\\t      result.__iteratees__ = copyArray(this.__iteratees__);\\n\",\n       \"\\t      result.__takeCount__ = this.__takeCount__;\\n\",\n       \"\\t      result.__views__ = copyArray(this.__views__);\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Reverses the direction of lazy iteration.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name reverse\\n\",\n       \"\\t     * @memberOf LazyWrapper\\n\",\n       \"\\t     * @returns {Object} Returns the new reversed `LazyWrapper` object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function lazyReverse() {\\n\",\n       \"\\t      if (this.__filtered__) {\\n\",\n       \"\\t        var result = new LazyWrapper(this);\\n\",\n       \"\\t        result.__dir__ = -1;\\n\",\n       \"\\t        result.__filtered__ = true;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        result = this.clone();\\n\",\n       \"\\t        result.__dir__ *= -1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Extracts the unwrapped value from its lazy wrapper.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name value\\n\",\n       \"\\t     * @memberOf LazyWrapper\\n\",\n       \"\\t     * @returns {*} Returns the unwrapped value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function lazyValue() {\\n\",\n       \"\\t      var array = this.__wrapped__.value(),\\n\",\n       \"\\t          dir = this.__dir__,\\n\",\n       \"\\t          isArr = isArray(array),\\n\",\n       \"\\t          isRight = dir < 0,\\n\",\n       \"\\t          arrLength = isArr ? array.length : 0,\\n\",\n       \"\\t          view = getView(0, arrLength, this.__views__),\\n\",\n       \"\\t          start = view.start,\\n\",\n       \"\\t          end = view.end,\\n\",\n       \"\\t          length = end - start,\\n\",\n       \"\\t          index = isRight ? end : (start - 1),\\n\",\n       \"\\t          iteratees = this.__iteratees__,\\n\",\n       \"\\t          iterLength = iteratees.length,\\n\",\n       \"\\t          resIndex = 0,\\n\",\n       \"\\t          takeCount = nativeMin(length, this.__takeCount__);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\\n\",\n       \"\\t        return baseWrapperValue(array, this.__actions__);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t      outer:\\n\",\n       \"\\t      while (length-- && resIndex < takeCount) {\\n\",\n       \"\\t        index += dir;\\n\",\n       \"\\t\\n\",\n       \"\\t        var iterIndex = -1,\\n\",\n       \"\\t            value = array[index];\\n\",\n       \"\\t\\n\",\n       \"\\t        while (++iterIndex < iterLength) {\\n\",\n       \"\\t          var data = iteratees[iterIndex],\\n\",\n       \"\\t              iteratee = data.iteratee,\\n\",\n       \"\\t              type = data.type,\\n\",\n       \"\\t              computed = iteratee(value);\\n\",\n       \"\\t\\n\",\n       \"\\t          if (type == LAZY_MAP_FLAG) {\\n\",\n       \"\\t            value = computed;\\n\",\n       \"\\t          } else if (!computed) {\\n\",\n       \"\\t            if (type == LAZY_FILTER_FLAG) {\\n\",\n       \"\\t              continue outer;\\n\",\n       \"\\t            } else {\\n\",\n       \"\\t              break outer;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        result[resIndex++] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Ensure `LazyWrapper` is an instance of `baseLodash`.\\n\",\n       \"\\t    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\\n\",\n       \"\\t    LazyWrapper.prototype.constructor = LazyWrapper;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a hash object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @param {Array} [entries] The key-value pairs to cache.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function Hash(entries) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = entries == null ? 0 : entries.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      this.clear();\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var entry = entries[index];\\n\",\n       \"\\t        this.set(entry[0], entry[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes all key-value entries from the hash.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name clear\\n\",\n       \"\\t     * @memberOf Hash\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hashClear() {\\n\",\n       \"\\t      this.__data__ = nativeCreate ? nativeCreate(null) : {};\\n\",\n       \"\\t      this.size = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes `key` and its value from the hash.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name delete\\n\",\n       \"\\t     * @memberOf Hash\\n\",\n       \"\\t     * @param {Object} hash The hash to modify.\\n\",\n       \"\\t     * @param {string} key The key of the value to remove.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hashDelete(key) {\\n\",\n       \"\\t      var result = this.has(key) && delete this.__data__[key];\\n\",\n       \"\\t      this.size -= result ? 1 : 0;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the hash value for `key`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name get\\n\",\n       \"\\t     * @memberOf Hash\\n\",\n       \"\\t     * @param {string} key The key of the value to get.\\n\",\n       \"\\t     * @returns {*} Returns the entry value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hashGet(key) {\\n\",\n       \"\\t      var data = this.__data__;\\n\",\n       \"\\t      if (nativeCreate) {\\n\",\n       \"\\t        var result = data[key];\\n\",\n       \"\\t        return result === HASH_UNDEFINED ? undefined : result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return hasOwnProperty.call(data, key) ? data[key] : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if a hash value for `key` exists.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name has\\n\",\n       \"\\t     * @memberOf Hash\\n\",\n       \"\\t     * @param {string} key The key of the entry to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hashHas(key) {\\n\",\n       \"\\t      var data = this.__data__;\\n\",\n       \"\\t      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the hash `key` to `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name set\\n\",\n       \"\\t     * @memberOf Hash\\n\",\n       \"\\t     * @param {string} key The key of the value to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @returns {Object} Returns the hash instance.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hashSet(key, value) {\\n\",\n       \"\\t      var data = this.__data__;\\n\",\n       \"\\t      this.size += this.has(key) ? 0 : 1;\\n\",\n       \"\\t      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `Hash`.\\n\",\n       \"\\t    Hash.prototype.clear = hashClear;\\n\",\n       \"\\t    Hash.prototype['delete'] = hashDelete;\\n\",\n       \"\\t    Hash.prototype.get = hashGet;\\n\",\n       \"\\t    Hash.prototype.has = hashHas;\\n\",\n       \"\\t    Hash.prototype.set = hashSet;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an list cache object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @param {Array} [entries] The key-value pairs to cache.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function ListCache(entries) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = entries == null ? 0 : entries.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      this.clear();\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var entry = entries[index];\\n\",\n       \"\\t        this.set(entry[0], entry[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes all key-value entries from the list cache.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name clear\\n\",\n       \"\\t     * @memberOf ListCache\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function listCacheClear() {\\n\",\n       \"\\t      this.__data__ = [];\\n\",\n       \"\\t      this.size = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes `key` and its value from the list cache.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name delete\\n\",\n       \"\\t     * @memberOf ListCache\\n\",\n       \"\\t     * @param {string} key The key of the value to remove.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function listCacheDelete(key) {\\n\",\n       \"\\t      var data = this.__data__,\\n\",\n       \"\\t          index = assocIndexOf(data, key);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (index < 0) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var lastIndex = data.length - 1;\\n\",\n       \"\\t      if (index == lastIndex) {\\n\",\n       \"\\t        data.pop();\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        splice.call(data, index, 1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      --this.size;\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the list cache value for `key`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name get\\n\",\n       \"\\t     * @memberOf ListCache\\n\",\n       \"\\t     * @param {string} key The key of the value to get.\\n\",\n       \"\\t     * @returns {*} Returns the entry value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function listCacheGet(key) {\\n\",\n       \"\\t      var data = this.__data__,\\n\",\n       \"\\t          index = assocIndexOf(data, key);\\n\",\n       \"\\t\\n\",\n       \"\\t      return index < 0 ? undefined : data[index][1];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if a list cache value for `key` exists.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name has\\n\",\n       \"\\t     * @memberOf ListCache\\n\",\n       \"\\t     * @param {string} key The key of the entry to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function listCacheHas(key) {\\n\",\n       \"\\t      return assocIndexOf(this.__data__, key) > -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the list cache `key` to `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name set\\n\",\n       \"\\t     * @memberOf ListCache\\n\",\n       \"\\t     * @param {string} key The key of the value to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @returns {Object} Returns the list cache instance.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function listCacheSet(key, value) {\\n\",\n       \"\\t      var data = this.__data__,\\n\",\n       \"\\t          index = assocIndexOf(data, key);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (index < 0) {\\n\",\n       \"\\t        ++this.size;\\n\",\n       \"\\t        data.push([key, value]);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        data[index][1] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `ListCache`.\\n\",\n       \"\\t    ListCache.prototype.clear = listCacheClear;\\n\",\n       \"\\t    ListCache.prototype['delete'] = listCacheDelete;\\n\",\n       \"\\t    ListCache.prototype.get = listCacheGet;\\n\",\n       \"\\t    ListCache.prototype.has = listCacheHas;\\n\",\n       \"\\t    ListCache.prototype.set = listCacheSet;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a map cache object to store key-value pairs.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @param {Array} [entries] The key-value pairs to cache.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function MapCache(entries) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = entries == null ? 0 : entries.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      this.clear();\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var entry = entries[index];\\n\",\n       \"\\t        this.set(entry[0], entry[1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes all key-value entries from the map.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name clear\\n\",\n       \"\\t     * @memberOf MapCache\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapCacheClear() {\\n\",\n       \"\\t      this.size = 0;\\n\",\n       \"\\t      this.__data__ = {\\n\",\n       \"\\t        'hash': new Hash,\\n\",\n       \"\\t        'map': new (Map || ListCache),\\n\",\n       \"\\t        'string': new Hash\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes `key` and its value from the map.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name delete\\n\",\n       \"\\t     * @memberOf MapCache\\n\",\n       \"\\t     * @param {string} key The key of the value to remove.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapCacheDelete(key) {\\n\",\n       \"\\t      var result = getMapData(this, key)['delete'](key);\\n\",\n       \"\\t      this.size -= result ? 1 : 0;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the map value for `key`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name get\\n\",\n       \"\\t     * @memberOf MapCache\\n\",\n       \"\\t     * @param {string} key The key of the value to get.\\n\",\n       \"\\t     * @returns {*} Returns the entry value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapCacheGet(key) {\\n\",\n       \"\\t      return getMapData(this, key).get(key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if a map value for `key` exists.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name has\\n\",\n       \"\\t     * @memberOf MapCache\\n\",\n       \"\\t     * @param {string} key The key of the entry to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapCacheHas(key) {\\n\",\n       \"\\t      return getMapData(this, key).has(key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the map `key` to `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name set\\n\",\n       \"\\t     * @memberOf MapCache\\n\",\n       \"\\t     * @param {string} key The key of the value to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @returns {Object} Returns the map cache instance.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapCacheSet(key, value) {\\n\",\n       \"\\t      var data = getMapData(this, key),\\n\",\n       \"\\t          size = data.size;\\n\",\n       \"\\t\\n\",\n       \"\\t      data.set(key, value);\\n\",\n       \"\\t      this.size += data.size == size ? 0 : 1;\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `MapCache`.\\n\",\n       \"\\t    MapCache.prototype.clear = mapCacheClear;\\n\",\n       \"\\t    MapCache.prototype['delete'] = mapCacheDelete;\\n\",\n       \"\\t    MapCache.prototype.get = mapCacheGet;\\n\",\n       \"\\t    MapCache.prototype.has = mapCacheHas;\\n\",\n       \"\\t    MapCache.prototype.set = mapCacheSet;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Creates an array cache object to store unique values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @param {Array} [values] The values to cache.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function SetCache(values) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = values == null ? 0 : values.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      this.__data__ = new MapCache;\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        this.add(values[index]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Adds `value` to the array cache.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name add\\n\",\n       \"\\t     * @memberOf SetCache\\n\",\n       \"\\t     * @alias push\\n\",\n       \"\\t     * @param {*} value The value to cache.\\n\",\n       \"\\t     * @returns {Object} Returns the cache instance.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function setCacheAdd(value) {\\n\",\n       \"\\t      this.__data__.set(value, HASH_UNDEFINED);\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is in the array cache.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name has\\n\",\n       \"\\t     * @memberOf SetCache\\n\",\n       \"\\t     * @param {*} value The value to search for.\\n\",\n       \"\\t     * @returns {number} Returns `true` if `value` is found, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function setCacheHas(value) {\\n\",\n       \"\\t      return this.__data__.has(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `SetCache`.\\n\",\n       \"\\t    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\\n\",\n       \"\\t    SetCache.prototype.has = setCacheHas;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a stack cache object to store key-value pairs.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @constructor\\n\",\n       \"\\t     * @param {Array} [entries] The key-value pairs to cache.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function Stack(entries) {\\n\",\n       \"\\t      var data = this.__data__ = new ListCache(entries);\\n\",\n       \"\\t      this.size = data.size;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes all key-value entries from the stack.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name clear\\n\",\n       \"\\t     * @memberOf Stack\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stackClear() {\\n\",\n       \"\\t      this.__data__ = new ListCache;\\n\",\n       \"\\t      this.size = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes `key` and its value from the stack.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name delete\\n\",\n       \"\\t     * @memberOf Stack\\n\",\n       \"\\t     * @param {string} key The key of the value to remove.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stackDelete(key) {\\n\",\n       \"\\t      var data = this.__data__,\\n\",\n       \"\\t          result = data['delete'](key);\\n\",\n       \"\\t\\n\",\n       \"\\t      this.size = data.size;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the stack value for `key`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name get\\n\",\n       \"\\t     * @memberOf Stack\\n\",\n       \"\\t     * @param {string} key The key of the value to get.\\n\",\n       \"\\t     * @returns {*} Returns the entry value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stackGet(key) {\\n\",\n       \"\\t      return this.__data__.get(key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if a stack value for `key` exists.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name has\\n\",\n       \"\\t     * @memberOf Stack\\n\",\n       \"\\t     * @param {string} key The key of the entry to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stackHas(key) {\\n\",\n       \"\\t      return this.__data__.has(key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the stack `key` to `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @name set\\n\",\n       \"\\t     * @memberOf Stack\\n\",\n       \"\\t     * @param {string} key The key of the value to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @returns {Object} Returns the stack cache instance.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stackSet(key, value) {\\n\",\n       \"\\t      var data = this.__data__;\\n\",\n       \"\\t      if (data instanceof ListCache) {\\n\",\n       \"\\t        var pairs = data.__data__;\\n\",\n       \"\\t        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\\n\",\n       \"\\t          pairs.push([key, value]);\\n\",\n       \"\\t          this.size = ++data.size;\\n\",\n       \"\\t          return this;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        data = this.__data__ = new MapCache(pairs);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      data.set(key, value);\\n\",\n       \"\\t      this.size = data.size;\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `Stack`.\\n\",\n       \"\\t    Stack.prototype.clear = stackClear;\\n\",\n       \"\\t    Stack.prototype['delete'] = stackDelete;\\n\",\n       \"\\t    Stack.prototype.get = stackGet;\\n\",\n       \"\\t    Stack.prototype.has = stackHas;\\n\",\n       \"\\t    Stack.prototype.set = stackSet;\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the enumerable property names of the array-like `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to query.\\n\",\n       \"\\t     * @param {boolean} inherited Specify returning inherited property names.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function arrayLikeKeys(value, inherited) {\\n\",\n       \"\\t      var isArr = isArray(value),\\n\",\n       \"\\t          isArg = !isArr && isArguments(value),\\n\",\n       \"\\t          isBuff = !isArr && !isArg && isBuffer(value),\\n\",\n       \"\\t          isType = !isArr && !isArg && !isBuff && isTypedArray(value),\\n\",\n       \"\\t          skipIndexes = isArr || isArg || isBuff || isType,\\n\",\n       \"\\t          result = skipIndexes ? baseTimes(value.length, String) : [],\\n\",\n       \"\\t          length = result.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      for (var key in value) {\\n\",\n       \"\\t        if ((inherited || hasOwnProperty.call(value, key)) &&\\n\",\n       \"\\t            !(skipIndexes && (\\n\",\n       \"\\t               // Safari 9 has enumerable `arguments.length` in strict mode.\\n\",\n       \"\\t               key == 'length' ||\\n\",\n       \"\\t               // Node.js 0.10 has enumerable non-index properties on buffers.\\n\",\n       \"\\t               (isBuff && (key == 'offset' || key == 'parent')) ||\\n\",\n       \"\\t               // PhantomJS 2 has enumerable non-index properties on typed arrays.\\n\",\n       \"\\t               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\\n\",\n       \"\\t               // Skip index properties.\\n\",\n       \"\\t               isIndex(key, length)\\n\",\n       \"\\t            ))) {\\n\",\n       \"\\t          result.push(key);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `_.sample` for arrays.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to sample.\\n\",\n       \"\\t     * @returns {*} Returns the random element.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function arraySample(array) {\\n\",\n       \"\\t      var length = array.length;\\n\",\n       \"\\t      return length ? array[baseRandom(0, length - 1)] : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `_.sampleSize` for arrays.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to sample.\\n\",\n       \"\\t     * @param {number} n The number of elements to sample.\\n\",\n       \"\\t     * @returns {Array} Returns the random elements.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function arraySampleSize(array, n) {\\n\",\n       \"\\t      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `_.shuffle` for arrays.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to shuffle.\\n\",\n       \"\\t     * @returns {Array} Returns the new shuffled array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function arrayShuffle(array) {\\n\",\n       \"\\t      return shuffleSelf(copyArray(array));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This function is like `assignValue` except that it doesn't assign\\n\",\n       \"\\t     * `undefined` values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {string} key The key of the property to assign.\\n\",\n       \"\\t     * @param {*} value The value to assign.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function assignMergeValue(object, key, value) {\\n\",\n       \"\\t      if ((value !== undefined && !eq(object[key], value)) ||\\n\",\n       \"\\t          (value === undefined && !(key in object))) {\\n\",\n       \"\\t        baseAssignValue(object, key, value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Assigns `value` to `key` of `object` if the existing value is not equivalent\\n\",\n       \"\\t     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {string} key The key of the property to assign.\\n\",\n       \"\\t     * @param {*} value The value to assign.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function assignValue(object, key, value) {\\n\",\n       \"\\t      var objValue = object[key];\\n\",\n       \"\\t      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\\n\",\n       \"\\t          (value === undefined && !(key in object))) {\\n\",\n       \"\\t        baseAssignValue(object, key, value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the index at which the `key` is found in `array` of key-value pairs.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {*} key The key to search for.\\n\",\n       \"\\t     * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function assocIndexOf(array, key) {\\n\",\n       \"\\t      var length = array.length;\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        if (eq(array[length][0], key)) {\\n\",\n       \"\\t          return length;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Aggregates elements of `collection` on `accumulator` with keys transformed\\n\",\n       \"\\t     * by `iteratee` and values set by `setter`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} setter The function to set `accumulator` values.\\n\",\n       \"\\t     * @param {Function} iteratee The iteratee to transform keys.\\n\",\n       \"\\t     * @param {Object} accumulator The initial aggregated object.\\n\",\n       \"\\t     * @returns {Function} Returns `accumulator`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseAggregator(collection, setter, iteratee, accumulator) {\\n\",\n       \"\\t      baseEach(collection, function(value, key, collection) {\\n\",\n       \"\\t        setter(accumulator, value, iteratee(value), collection);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return accumulator;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.assign` without support for multiple sources\\n\",\n       \"\\t     * or `customizer` functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {Object} source The source object.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseAssign(object, source) {\\n\",\n       \"\\t      return object && copyObject(source, keys(source), object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.assignIn` without support for multiple sources\\n\",\n       \"\\t     * or `customizer` functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {Object} source The source object.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseAssignIn(object, source) {\\n\",\n       \"\\t      return object && copyObject(source, keysIn(source), object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `assignValue` and `assignMergeValue` without\\n\",\n       \"\\t     * value checks.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {string} key The key of the property to assign.\\n\",\n       \"\\t     * @param {*} value The value to assign.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseAssignValue(object, key, value) {\\n\",\n       \"\\t      if (key == '__proto__' && defineProperty) {\\n\",\n       \"\\t        defineProperty(object, key, {\\n\",\n       \"\\t          'configurable': true,\\n\",\n       \"\\t          'enumerable': true,\\n\",\n       \"\\t          'value': value,\\n\",\n       \"\\t          'writable': true\\n\",\n       \"\\t        });\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        object[key] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.at` without support for individual paths.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {string[]} paths The property paths to pick.\\n\",\n       \"\\t     * @returns {Array} Returns the picked elements.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseAt(object, paths) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = paths.length,\\n\",\n       \"\\t          result = Array(length),\\n\",\n       \"\\t          skip = object == null;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        result[index] = skip ? undefined : get(object, paths[index]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.clamp` which doesn't coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number} number The number to clamp.\\n\",\n       \"\\t     * @param {number} [lower] The lower bound.\\n\",\n       \"\\t     * @param {number} upper The upper bound.\\n\",\n       \"\\t     * @returns {number} Returns the clamped number.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseClamp(number, lower, upper) {\\n\",\n       \"\\t      if (number === number) {\\n\",\n       \"\\t        if (upper !== undefined) {\\n\",\n       \"\\t          number = number <= upper ? number : upper;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (lower !== undefined) {\\n\",\n       \"\\t          number = number >= lower ? number : lower;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return number;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.clone` and `_.cloneDeep` which tracks\\n\",\n       \"\\t     * traversed objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to clone.\\n\",\n       \"\\t     * @param {boolean} bitmask The bitmask flags.\\n\",\n       \"\\t     *  1 - Deep clone\\n\",\n       \"\\t     *  2 - Flatten inherited properties\\n\",\n       \"\\t     *  4 - Clone symbols\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize cloning.\\n\",\n       \"\\t     * @param {string} [key] The key of `value`.\\n\",\n       \"\\t     * @param {Object} [object] The parent object of `value`.\\n\",\n       \"\\t     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\\n\",\n       \"\\t     * @returns {*} Returns the cloned value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseClone(value, bitmask, customizer, key, object, stack) {\\n\",\n       \"\\t      var result,\\n\",\n       \"\\t          isDeep = bitmask & CLONE_DEEP_FLAG,\\n\",\n       \"\\t          isFlat = bitmask & CLONE_FLAT_FLAG,\\n\",\n       \"\\t          isFull = bitmask & CLONE_SYMBOLS_FLAG;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (customizer) {\\n\",\n       \"\\t        result = object ? customizer(value, key, object, stack) : customizer(value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (result !== undefined) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!isObject(value)) {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var isArr = isArray(value);\\n\",\n       \"\\t      if (isArr) {\\n\",\n       \"\\t        result = initCloneArray(value);\\n\",\n       \"\\t        if (!isDeep) {\\n\",\n       \"\\t          return copyArray(value, result);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        var tag = getTag(value),\\n\",\n       \"\\t            isFunc = tag == funcTag || tag == genTag;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (isBuffer(value)) {\\n\",\n       \"\\t          return cloneBuffer(value, isDeep);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\\n\",\n       \"\\t          result = (isFlat || isFunc) ? {} : initCloneObject(value);\\n\",\n       \"\\t          if (!isDeep) {\\n\",\n       \"\\t            return isFlat\\n\",\n       \"\\t              ? copySymbolsIn(value, baseAssignIn(result, value))\\n\",\n       \"\\t              : copySymbols(value, baseAssign(result, value));\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          if (!cloneableTags[tag]) {\\n\",\n       \"\\t            return object ? value : {};\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result = initCloneByTag(value, tag, isDeep);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Check for circular references and return its corresponding clone.\\n\",\n       \"\\t      stack || (stack = new Stack);\\n\",\n       \"\\t      var stacked = stack.get(value);\\n\",\n       \"\\t      if (stacked) {\\n\",\n       \"\\t        return stacked;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      stack.set(value, result);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (isSet(value)) {\\n\",\n       \"\\t        value.forEach(function(subValue) {\\n\",\n       \"\\t          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\\n\",\n       \"\\t        });\\n\",\n       \"\\t\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (isMap(value)) {\\n\",\n       \"\\t        value.forEach(function(subValue, key) {\\n\",\n       \"\\t          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\\n\",\n       \"\\t        });\\n\",\n       \"\\t\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      var keysFunc = isFull\\n\",\n       \"\\t        ? (isFlat ? getAllKeysIn : getAllKeys)\\n\",\n       \"\\t        : (isFlat ? keysIn : keys);\\n\",\n       \"\\t\\n\",\n       \"\\t      var props = isArr ? undefined : keysFunc(value);\\n\",\n       \"\\t      arrayEach(props || value, function(subValue, key) {\\n\",\n       \"\\t        if (props) {\\n\",\n       \"\\t          key = subValue;\\n\",\n       \"\\t          subValue = value[key];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        // Recursively populate clone (susceptible to call stack limits).\\n\",\n       \"\\t        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.conforms` which doesn't clone `source`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} source The object of property predicates to conform to.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseConforms(source) {\\n\",\n       \"\\t      var props = keys(source);\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        return baseConformsTo(object, source, props);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.conformsTo` which accepts `props` to check.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Object} source The object of property predicates to conform to.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseConformsTo(object, source, props) {\\n\",\n       \"\\t      var length = props.length;\\n\",\n       \"\\t      if (object == null) {\\n\",\n       \"\\t        return !length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      object = Object(object);\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        var key = props[length],\\n\",\n       \"\\t            predicate = source[key],\\n\",\n       \"\\t            value = object[key];\\n\",\n       \"\\t\\n\",\n       \"\\t        if ((value === undefined && !(key in object)) || !predicate(value)) {\\n\",\n       \"\\t          return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.delay` and `_.defer` which accepts `args`\\n\",\n       \"\\t     * to provide to `func`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to delay.\\n\",\n       \"\\t     * @param {number} wait The number of milliseconds to delay invocation.\\n\",\n       \"\\t     * @param {Array} args The arguments to provide to `func`.\\n\",\n       \"\\t     * @returns {number|Object} Returns the timer id or timeout object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseDelay(func, wait, args) {\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return setTimeout(function() { func.apply(undefined, args); }, wait);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of methods like `_.difference` without support\\n\",\n       \"\\t     * for excluding multiple arrays or iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Array} values The values to exclude.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseDifference(array, values, iteratee, comparator) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          includes = arrayIncludes,\\n\",\n       \"\\t          isCommon = true,\\n\",\n       \"\\t          length = array.length,\\n\",\n       \"\\t          result = [],\\n\",\n       \"\\t          valuesLength = values.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (iteratee) {\\n\",\n       \"\\t        values = arrayMap(values, baseUnary(iteratee));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (comparator) {\\n\",\n       \"\\t        includes = arrayIncludesWith;\\n\",\n       \"\\t        isCommon = false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      else if (values.length >= LARGE_ARRAY_SIZE) {\\n\",\n       \"\\t        includes = cacheHas;\\n\",\n       \"\\t        isCommon = false;\\n\",\n       \"\\t        values = new SetCache(values);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      outer:\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index],\\n\",\n       \"\\t            computed = iteratee == null ? value : iteratee(value);\\n\",\n       \"\\t\\n\",\n       \"\\t        value = (comparator || value !== 0) ? value : 0;\\n\",\n       \"\\t        if (isCommon && computed === computed) {\\n\",\n       \"\\t          var valuesIndex = valuesLength;\\n\",\n       \"\\t          while (valuesIndex--) {\\n\",\n       \"\\t            if (values[valuesIndex] === computed) {\\n\",\n       \"\\t              continue outer;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else if (!includes(values, computed, comparator)) {\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.forEach` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array|Object} Returns `collection`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseEach = createBaseEach(baseForOwn);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array|Object} Returns `collection`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseEachRight = createBaseEach(baseForOwnRight, true);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.every` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if all elements pass the predicate check,\\n\",\n       \"\\t     *  else `false`\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseEvery(collection, predicate) {\\n\",\n       \"\\t      var result = true;\\n\",\n       \"\\t      baseEach(collection, function(value, index, collection) {\\n\",\n       \"\\t        result = !!predicate(value, index, collection);\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of methods like `_.max` and `_.min` which accepts a\\n\",\n       \"\\t     * `comparator` to determine the extremum value.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The iteratee invoked per iteration.\\n\",\n       \"\\t     * @param {Function} comparator The comparator used to compare values.\\n\",\n       \"\\t     * @returns {*} Returns the extremum value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseExtremum(array, iteratee, comparator) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index],\\n\",\n       \"\\t            current = iteratee(value);\\n\",\n       \"\\t\\n\",\n       \"\\t        if (current != null && (computed === undefined\\n\",\n       \"\\t              ? (current === current && !isSymbol(current))\\n\",\n       \"\\t              : comparator(current, computed)\\n\",\n       \"\\t            )) {\\n\",\n       \"\\t          var computed = current,\\n\",\n       \"\\t              result = value;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.fill` without an iteratee call guard.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to fill.\\n\",\n       \"\\t     * @param {*} value The value to fill `array` with.\\n\",\n       \"\\t     * @param {number} [start=0] The start position.\\n\",\n       \"\\t     * @param {number} [end=array.length] The end position.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseFill(array, value, start, end) {\\n\",\n       \"\\t      var length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      start = toInteger(start);\\n\",\n       \"\\t      if (start < 0) {\\n\",\n       \"\\t        start = -start > length ? 0 : (length + start);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      end = (end === undefined || end > length) ? length : toInteger(end);\\n\",\n       \"\\t      if (end < 0) {\\n\",\n       \"\\t        end += length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      end = start > end ? 0 : toLength(end);\\n\",\n       \"\\t      while (start < end) {\\n\",\n       \"\\t        array[start++] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.filter` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new filtered array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseFilter(collection, predicate) {\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t      baseEach(collection, function(value, index, collection) {\\n\",\n       \"\\t        if (predicate(value, index, collection)) {\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.flatten` with support for restricting flattening.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to flatten.\\n\",\n       \"\\t     * @param {number} depth The maximum recursion depth.\\n\",\n       \"\\t     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\\n\",\n       \"\\t     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\\n\",\n       \"\\t     * @param {Array} [result=[]] The initial result value.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseFlatten(array, depth, predicate, isStrict, result) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      predicate || (predicate = isFlattenable);\\n\",\n       \"\\t      result || (result = []);\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index];\\n\",\n       \"\\t        if (depth > 0 && predicate(value)) {\\n\",\n       \"\\t          if (depth > 1) {\\n\",\n       \"\\t            // Recursively flatten arrays (susceptible to call stack limits).\\n\",\n       \"\\t            baseFlatten(value, depth - 1, predicate, isStrict, result);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            arrayPush(result, value);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else if (!isStrict) {\\n\",\n       \"\\t          result[result.length] = value;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `baseForOwn` which iterates over `object`\\n\",\n       \"\\t     * properties returned by `keysFunc` and invokes `iteratee` for each property.\\n\",\n       \"\\t     * Iteratee functions may exit iteration early by explicitly returning `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @param {Function} keysFunc The function to get the keys of `object`.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseFor = createBaseFor();\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This function is like `baseFor` except that it iterates over properties\\n\",\n       \"\\t     * in the opposite order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @param {Function} keysFunc The function to get the keys of `object`.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseForRight = createBaseFor(true);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.forOwn` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseForOwn(object, iteratee) {\\n\",\n       \"\\t      return object && baseFor(object, iteratee, keys);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseForOwnRight(object, iteratee) {\\n\",\n       \"\\t      return object && baseForRight(object, iteratee, keys);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.functions` which creates an array of\\n\",\n       \"\\t     * `object` function property names filtered from `props`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Array} props The property names to filter.\\n\",\n       \"\\t     * @returns {Array} Returns the function names.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseFunctions(object, props) {\\n\",\n       \"\\t      return arrayFilter(props, function(key) {\\n\",\n       \"\\t        return isFunction(object[key]);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.get` without support for default values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to get.\\n\",\n       \"\\t     * @returns {*} Returns the resolved value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseGet(object, path) {\\n\",\n       \"\\t      path = castPath(path, object);\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = 0,\\n\",\n       \"\\t          length = path.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (object != null && index < length) {\\n\",\n       \"\\t        object = object[toKey(path[index++])];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return (index && index == length) ? object : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\\n\",\n       \"\\t     * `keysFunc` and `symbolsFunc` to get the enumerable property names and\\n\",\n       \"\\t     * symbols of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Function} keysFunc The function to get the keys of `object`.\\n\",\n       \"\\t     * @param {Function} symbolsFunc The function to get the symbols of `object`.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names and symbols.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\\n\",\n       \"\\t      var result = keysFunc(object);\\n\",\n       \"\\t      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `getTag` without fallbacks for buggy environments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to query.\\n\",\n       \"\\t     * @returns {string} Returns the `toStringTag`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseGetTag(value) {\\n\",\n       \"\\t      if (value == null) {\\n\",\n       \"\\t        return value === undefined ? undefinedTag : nullTag;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return (symToStringTag && symToStringTag in Object(value))\\n\",\n       \"\\t        ? getRawTag(value)\\n\",\n       \"\\t        : objectToString(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.gt` which doesn't coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is greater than `other`,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseGt(value, other) {\\n\",\n       \"\\t      return value > other;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.has` without support for deep paths.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} [object] The object to query.\\n\",\n       \"\\t     * @param {Array|string} key The key to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `key` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseHas(object, key) {\\n\",\n       \"\\t      return object != null && hasOwnProperty.call(object, key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.hasIn` without support for deep paths.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} [object] The object to query.\\n\",\n       \"\\t     * @param {Array|string} key The key to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `key` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseHasIn(object, key) {\\n\",\n       \"\\t      return object != null && key in Object(object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.inRange` which doesn't coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number} number The number to check.\\n\",\n       \"\\t     * @param {number} start The start of the range.\\n\",\n       \"\\t     * @param {number} end The end of the range.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseInRange(number, start, end) {\\n\",\n       \"\\t      return number >= nativeMin(start, end) && number < nativeMax(start, end);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of methods like `_.intersection`, without support\\n\",\n       \"\\t     * for iteratee shorthands, that accepts an array of arrays to inspect.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} arrays The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of shared values.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIntersection(arrays, iteratee, comparator) {\\n\",\n       \"\\t      var includes = comparator ? arrayIncludesWith : arrayIncludes,\\n\",\n       \"\\t          length = arrays[0].length,\\n\",\n       \"\\t          othLength = arrays.length,\\n\",\n       \"\\t          othIndex = othLength,\\n\",\n       \"\\t          caches = Array(othLength),\\n\",\n       \"\\t          maxLength = Infinity,\\n\",\n       \"\\t          result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t      while (othIndex--) {\\n\",\n       \"\\t        var array = arrays[othIndex];\\n\",\n       \"\\t        if (othIndex && iteratee) {\\n\",\n       \"\\t          array = arrayMap(array, baseUnary(iteratee));\\n\",\n       \"\\t        }\\n\",\n       \"\\t        maxLength = nativeMin(array.length, maxLength);\\n\",\n       \"\\t        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\\n\",\n       \"\\t          ? new SetCache(othIndex && array)\\n\",\n       \"\\t          : undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      array = arrays[0];\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          seen = caches[0];\\n\",\n       \"\\t\\n\",\n       \"\\t      outer:\\n\",\n       \"\\t      while (++index < length && result.length < maxLength) {\\n\",\n       \"\\t        var value = array[index],\\n\",\n       \"\\t            computed = iteratee ? iteratee(value) : value;\\n\",\n       \"\\t\\n\",\n       \"\\t        value = (comparator || value !== 0) ? value : 0;\\n\",\n       \"\\t        if (!(seen\\n\",\n       \"\\t              ? cacheHas(seen, computed)\\n\",\n       \"\\t              : includes(result, computed, comparator)\\n\",\n       \"\\t            )) {\\n\",\n       \"\\t          othIndex = othLength;\\n\",\n       \"\\t          while (--othIndex) {\\n\",\n       \"\\t            var cache = caches[othIndex];\\n\",\n       \"\\t            if (!(cache\\n\",\n       \"\\t                  ? cacheHas(cache, computed)\\n\",\n       \"\\t                  : includes(arrays[othIndex], computed, comparator))\\n\",\n       \"\\t                ) {\\n\",\n       \"\\t              continue outer;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (seen) {\\n\",\n       \"\\t            seen.push(computed);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.invert` and `_.invertBy` which inverts\\n\",\n       \"\\t     * `object` with values transformed by `iteratee` and set by `setter`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} setter The function to set `accumulator` values.\\n\",\n       \"\\t     * @param {Function} iteratee The iteratee to transform values.\\n\",\n       \"\\t     * @param {Object} accumulator The initial inverted object.\\n\",\n       \"\\t     * @returns {Function} Returns `accumulator`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseInverter(object, setter, iteratee, accumulator) {\\n\",\n       \"\\t      baseForOwn(object, function(value, key, object) {\\n\",\n       \"\\t        setter(accumulator, iteratee(value), key, object);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return accumulator;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.invoke` without support for individual\\n\",\n       \"\\t     * method arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path of the method to invoke.\\n\",\n       \"\\t     * @param {Array} args The arguments to invoke the method with.\\n\",\n       \"\\t     * @returns {*} Returns the result of the invoked method.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseInvoke(object, path, args) {\\n\",\n       \"\\t      path = castPath(path, object);\\n\",\n       \"\\t      object = parent(object, path);\\n\",\n       \"\\t      var func = object == null ? object : object[toKey(last(path))];\\n\",\n       \"\\t      return func == null ? undefined : apply(func, object, args);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isArguments`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsArguments(value) {\\n\",\n       \"\\t      return isObjectLike(value) && baseGetTag(value) == argsTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsArrayBuffer(value) {\\n\",\n       \"\\t      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isDate` without Node.js optimizations.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsDate(value) {\\n\",\n       \"\\t      return isObjectLike(value) && baseGetTag(value) == dateTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isEqual` which supports partial comparisons\\n\",\n       \"\\t     * and tracks traversed objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @param {boolean} bitmask The bitmask flags.\\n\",\n       \"\\t     *  1 - Unordered comparison\\n\",\n       \"\\t     *  2 - Partial comparison\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize comparisons.\\n\",\n       \"\\t     * @param {Object} [stack] Tracks traversed `value` and `other` objects.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsEqual(value, other, bitmask, customizer, stack) {\\n\",\n       \"\\t      if (value === other) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\\n\",\n       \"\\t        return value !== value && other !== other;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseIsEqual` for arrays and objects which performs\\n\",\n       \"\\t     * deep comparisons and tracks traversed objects enabling objects with circular\\n\",\n       \"\\t     * references to be compared.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to compare.\\n\",\n       \"\\t     * @param {Object} other The other object to compare.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\\n\",\n       \"\\t     * @param {Function} customizer The function to customize comparisons.\\n\",\n       \"\\t     * @param {Function} equalFunc The function to determine equivalents of values.\\n\",\n       \"\\t     * @param {Object} [stack] Tracks traversed `object` and `other` objects.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\\n\",\n       \"\\t      var objIsArr = isArray(object),\\n\",\n       \"\\t          othIsArr = isArray(other),\\n\",\n       \"\\t          objTag = objIsArr ? arrayTag : getTag(object),\\n\",\n       \"\\t          othTag = othIsArr ? arrayTag : getTag(other);\\n\",\n       \"\\t\\n\",\n       \"\\t      objTag = objTag == argsTag ? objectTag : objTag;\\n\",\n       \"\\t      othTag = othTag == argsTag ? objectTag : othTag;\\n\",\n       \"\\t\\n\",\n       \"\\t      var objIsObj = objTag == objectTag,\\n\",\n       \"\\t          othIsObj = othTag == objectTag,\\n\",\n       \"\\t          isSameTag = objTag == othTag;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (isSameTag && isBuffer(object)) {\\n\",\n       \"\\t        if (!isBuffer(other)) {\\n\",\n       \"\\t          return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        objIsArr = true;\\n\",\n       \"\\t        objIsObj = false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isSameTag && !objIsObj) {\\n\",\n       \"\\t        stack || (stack = new Stack);\\n\",\n       \"\\t        return (objIsArr || isTypedArray(object))\\n\",\n       \"\\t          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\\n\",\n       \"\\t          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\\n\",\n       \"\\t        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\\n\",\n       \"\\t            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\\n\",\n       \"\\t\\n\",\n       \"\\t        if (objIsWrapped || othIsWrapped) {\\n\",\n       \"\\t          var objUnwrapped = objIsWrapped ? object.value() : object,\\n\",\n       \"\\t              othUnwrapped = othIsWrapped ? other.value() : other;\\n\",\n       \"\\t\\n\",\n       \"\\t          stack || (stack = new Stack);\\n\",\n       \"\\t          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!isSameTag) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      stack || (stack = new Stack);\\n\",\n       \"\\t      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isMap` without Node.js optimizations.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsMap(value) {\\n\",\n       \"\\t      return isObjectLike(value) && getTag(value) == mapTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isMatch` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Object} source The object of property values to match.\\n\",\n       \"\\t     * @param {Array} matchData The property names, values, and compare flags to match.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize comparisons.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsMatch(object, source, matchData, customizer) {\\n\",\n       \"\\t      var index = matchData.length,\\n\",\n       \"\\t          length = index,\\n\",\n       \"\\t          noCustomizer = !customizer;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (object == null) {\\n\",\n       \"\\t        return !length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      object = Object(object);\\n\",\n       \"\\t      while (index--) {\\n\",\n       \"\\t        var data = matchData[index];\\n\",\n       \"\\t        if ((noCustomizer && data[2])\\n\",\n       \"\\t              ? data[1] !== object[data[0]]\\n\",\n       \"\\t              : !(data[0] in object)\\n\",\n       \"\\t            ) {\\n\",\n       \"\\t          return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        data = matchData[index];\\n\",\n       \"\\t        var key = data[0],\\n\",\n       \"\\t            objValue = object[key],\\n\",\n       \"\\t            srcValue = data[1];\\n\",\n       \"\\t\\n\",\n       \"\\t        if (noCustomizer && data[2]) {\\n\",\n       \"\\t          if (objValue === undefined && !(key in object)) {\\n\",\n       \"\\t            return false;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          var stack = new Stack;\\n\",\n       \"\\t          if (customizer) {\\n\",\n       \"\\t            var result = customizer(objValue, srcValue, key, object, source, stack);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (!(result === undefined\\n\",\n       \"\\t                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\\n\",\n       \"\\t                : result\\n\",\n       \"\\t              )) {\\n\",\n       \"\\t            return false;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isNative` without bad shim checks.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a native function,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsNative(value) {\\n\",\n       \"\\t      if (!isObject(value) || isMasked(value)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\\n\",\n       \"\\t      return pattern.test(toSource(value));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isRegExp` without Node.js optimizations.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsRegExp(value) {\\n\",\n       \"\\t      return isObjectLike(value) && baseGetTag(value) == regexpTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isSet` without Node.js optimizations.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsSet(value) {\\n\",\n       \"\\t      return isObjectLike(value) && getTag(value) == setTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.isTypedArray` without Node.js optimizations.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIsTypedArray(value) {\\n\",\n       \"\\t      return isObjectLike(value) &&\\n\",\n       \"\\t        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.iteratee`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} [value=_.identity] The value to convert to an iteratee.\\n\",\n       \"\\t     * @returns {Function} Returns the iteratee.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseIteratee(value) {\\n\",\n       \"\\t      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\\n\",\n       \"\\t      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\\n\",\n       \"\\t      if (typeof value == 'function') {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (value == null) {\\n\",\n       \"\\t        return identity;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (typeof value == 'object') {\\n\",\n       \"\\t        return isArray(value)\\n\",\n       \"\\t          ? baseMatchesProperty(value[0], value[1])\\n\",\n       \"\\t          : baseMatches(value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return property(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseKeys(object) {\\n\",\n       \"\\t      if (!isPrototype(object)) {\\n\",\n       \"\\t        return nativeKeys(object);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t      for (var key in Object(object)) {\\n\",\n       \"\\t        if (hasOwnProperty.call(object, key) && key != 'constructor') {\\n\",\n       \"\\t          result.push(key);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseKeysIn(object) {\\n\",\n       \"\\t      if (!isObject(object)) {\\n\",\n       \"\\t        return nativeKeysIn(object);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var isProto = isPrototype(object),\\n\",\n       \"\\t          result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t      for (var key in object) {\\n\",\n       \"\\t        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\\n\",\n       \"\\t          result.push(key);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.lt` which doesn't coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is less than `other`,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseLt(value, other) {\\n\",\n       \"\\t      return value < other;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.map` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} iteratee The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new mapped array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseMap(collection, iteratee) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          result = isArrayLike(collection) ? Array(collection.length) : [];\\n\",\n       \"\\t\\n\",\n       \"\\t      baseEach(collection, function(value, key, collection) {\\n\",\n       \"\\t        result[++index] = iteratee(value, key, collection);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.matches` which doesn't clone `source`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} source The object of property values to match.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseMatches(source) {\\n\",\n       \"\\t      var matchData = getMatchData(source);\\n\",\n       \"\\t      if (matchData.length == 1 && matchData[0][2]) {\\n\",\n       \"\\t        return matchesStrictComparable(matchData[0][0], matchData[0][1]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        return object === source || baseIsMatch(object, source, matchData);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} path The path of the property to get.\\n\",\n       \"\\t     * @param {*} srcValue The value to match.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseMatchesProperty(path, srcValue) {\\n\",\n       \"\\t      if (isKey(path) && isStrictComparable(srcValue)) {\\n\",\n       \"\\t        return matchesStrictComparable(toKey(path), srcValue);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        var objValue = get(object, path);\\n\",\n       \"\\t        return (objValue === undefined && objValue === srcValue)\\n\",\n       \"\\t          ? hasIn(object, path)\\n\",\n       \"\\t          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.merge` without support for multiple sources.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {Object} source The source object.\\n\",\n       \"\\t     * @param {number} srcIndex The index of `source`.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize merged values.\\n\",\n       \"\\t     * @param {Object} [stack] Tracks traversed source values and their merged\\n\",\n       \"\\t     *  counterparts.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseMerge(object, source, srcIndex, customizer, stack) {\\n\",\n       \"\\t      if (object === source) {\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      baseFor(source, function(srcValue, key) {\\n\",\n       \"\\t        if (isObject(srcValue)) {\\n\",\n       \"\\t          stack || (stack = new Stack);\\n\",\n       \"\\t          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else {\\n\",\n       \"\\t          var newValue = customizer\\n\",\n       \"\\t            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\\n\",\n       \"\\t            : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t          if (newValue === undefined) {\\n\",\n       \"\\t            newValue = srcValue;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          assignMergeValue(object, key, newValue);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }, keysIn);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseMerge` for arrays and objects which performs\\n\",\n       \"\\t     * deep merges and tracks traversed objects enabling objects with circular\\n\",\n       \"\\t     * references to be merged.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {Object} source The source object.\\n\",\n       \"\\t     * @param {string} key The key of the value to merge.\\n\",\n       \"\\t     * @param {number} srcIndex The index of `source`.\\n\",\n       \"\\t     * @param {Function} mergeFunc The function to merge values.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize assigned values.\\n\",\n       \"\\t     * @param {Object} [stack] Tracks traversed source values and their merged\\n\",\n       \"\\t     *  counterparts.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\\n\",\n       \"\\t      var objValue = safeGet(object, key),\\n\",\n       \"\\t          srcValue = safeGet(source, key),\\n\",\n       \"\\t          stacked = stack.get(srcValue);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (stacked) {\\n\",\n       \"\\t        assignMergeValue(object, key, stacked);\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var newValue = customizer\\n\",\n       \"\\t        ? customizer(objValue, srcValue, (key + ''), object, source, stack)\\n\",\n       \"\\t        : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      var isCommon = newValue === undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (isCommon) {\\n\",\n       \"\\t        var isArr = isArray(srcValue),\\n\",\n       \"\\t            isBuff = !isArr && isBuffer(srcValue),\\n\",\n       \"\\t            isTyped = !isArr && !isBuff && isTypedArray(srcValue);\\n\",\n       \"\\t\\n\",\n       \"\\t        newValue = srcValue;\\n\",\n       \"\\t        if (isArr || isBuff || isTyped) {\\n\",\n       \"\\t          if (isArray(objValue)) {\\n\",\n       \"\\t            newValue = objValue;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          else if (isArrayLikeObject(objValue)) {\\n\",\n       \"\\t            newValue = copyArray(objValue);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          else if (isBuff) {\\n\",\n       \"\\t            isCommon = false;\\n\",\n       \"\\t            newValue = cloneBuffer(srcValue, true);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          else if (isTyped) {\\n\",\n       \"\\t            isCommon = false;\\n\",\n       \"\\t            newValue = cloneTypedArray(srcValue, true);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          else {\\n\",\n       \"\\t            newValue = [];\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else if (isPlainObject(srcValue) || isArguments(srcValue)) {\\n\",\n       \"\\t          newValue = objValue;\\n\",\n       \"\\t          if (isArguments(objValue)) {\\n\",\n       \"\\t            newValue = toPlainObject(objValue);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          else if (!isObject(objValue) || isFunction(objValue)) {\\n\",\n       \"\\t            newValue = initCloneObject(srcValue);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else {\\n\",\n       \"\\t          isCommon = false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isCommon) {\\n\",\n       \"\\t        // Recursively merge objects and arrays (susceptible to call stack limits).\\n\",\n       \"\\t        stack.set(srcValue, newValue);\\n\",\n       \"\\t        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\\n\",\n       \"\\t        stack['delete'](srcValue);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      assignMergeValue(object, key, newValue);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.nth` which doesn't coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {number} n The index of the element to return.\\n\",\n       \"\\t     * @returns {*} Returns the nth element of `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseNth(array, n) {\\n\",\n       \"\\t      var length = array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n += n < 0 ? length : 0;\\n\",\n       \"\\t      return isIndex(n, length) ? array[n] : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.orderBy` without param guards.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\\n\",\n       \"\\t     * @param {string[]} orders The sort orders of `iteratees`.\\n\",\n       \"\\t     * @returns {Array} Returns the new sorted array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseOrderBy(collection, iteratees, orders) {\\n\",\n       \"\\t      var index = -1;\\n\",\n       \"\\t      iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee()));\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = baseMap(collection, function(value, key, collection) {\\n\",\n       \"\\t        var criteria = arrayMap(iteratees, function(iteratee) {\\n\",\n       \"\\t          return iteratee(value);\\n\",\n       \"\\t        });\\n\",\n       \"\\t        return { 'criteria': criteria, 'index': ++index, 'value': value };\\n\",\n       \"\\t      });\\n\",\n       \"\\t\\n\",\n       \"\\t      return baseSortBy(result, function(object, other) {\\n\",\n       \"\\t        return compareMultiple(object, other, orders);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.pick` without support for individual\\n\",\n       \"\\t     * property identifiers.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The source object.\\n\",\n       \"\\t     * @param {string[]} paths The property paths to pick.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function basePick(object, paths) {\\n\",\n       \"\\t      return basePickBy(object, paths, function(value, path) {\\n\",\n       \"\\t        return hasIn(object, path);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of  `_.pickBy` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The source object.\\n\",\n       \"\\t     * @param {string[]} paths The property paths to pick.\\n\",\n       \"\\t     * @param {Function} predicate The function invoked per property.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function basePickBy(object, paths, predicate) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = paths.length,\\n\",\n       \"\\t          result = {};\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var path = paths[index],\\n\",\n       \"\\t            value = baseGet(object, path);\\n\",\n       \"\\t\\n\",\n       \"\\t        if (predicate(value, path)) {\\n\",\n       \"\\t          baseSet(result, castPath(path, object), value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseProperty` which supports deep paths.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to get.\\n\",\n       \"\\t     * @returns {Function} Returns the new accessor function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function basePropertyDeep(path) {\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        return baseGet(object, path);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.pullAllBy` without support for iteratee\\n\",\n       \"\\t     * shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {Array} values The values to remove.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function basePullAll(array, values, iteratee, comparator) {\\n\",\n       \"\\t      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\\n\",\n       \"\\t          index = -1,\\n\",\n       \"\\t          length = values.length,\\n\",\n       \"\\t          seen = array;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (array === values) {\\n\",\n       \"\\t        values = copyArray(values);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (iteratee) {\\n\",\n       \"\\t        seen = arrayMap(array, baseUnary(iteratee));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var fromIndex = 0,\\n\",\n       \"\\t            value = values[index],\\n\",\n       \"\\t            computed = iteratee ? iteratee(value) : value;\\n\",\n       \"\\t\\n\",\n       \"\\t        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\\n\",\n       \"\\t          if (seen !== array) {\\n\",\n       \"\\t            splice.call(seen, fromIndex, 1);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          splice.call(array, fromIndex, 1);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.pullAt` without support for individual\\n\",\n       \"\\t     * indexes or capturing the removed elements.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {number[]} indexes The indexes of elements to remove.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function basePullAt(array, indexes) {\\n\",\n       \"\\t      var length = array ? indexes.length : 0,\\n\",\n       \"\\t          lastIndex = length - 1;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        var index = indexes[length];\\n\",\n       \"\\t        if (length == lastIndex || index !== previous) {\\n\",\n       \"\\t          var previous = index;\\n\",\n       \"\\t          if (isIndex(index)) {\\n\",\n       \"\\t            splice.call(array, index, 1);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            baseUnset(array, index);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.random` without support for returning\\n\",\n       \"\\t     * floating-point numbers.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number} lower The lower bound.\\n\",\n       \"\\t     * @param {number} upper The upper bound.\\n\",\n       \"\\t     * @returns {number} Returns the random number.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseRandom(lower, upper) {\\n\",\n       \"\\t      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.range` and `_.rangeRight` which doesn't\\n\",\n       \"\\t     * coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number} start The start of the range.\\n\",\n       \"\\t     * @param {number} end The end of the range.\\n\",\n       \"\\t     * @param {number} step The value to increment or decrement by.\\n\",\n       \"\\t     * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t     * @returns {Array} Returns the range of numbers.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseRange(start, end, step, fromRight) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\\n\",\n       \"\\t          result = Array(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        result[fromRight ? length : ++index] = start;\\n\",\n       \"\\t        start += step;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.repeat` which doesn't coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} string The string to repeat.\\n\",\n       \"\\t     * @param {number} n The number of times to repeat the string.\\n\",\n       \"\\t     * @returns {string} Returns the repeated string.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseRepeat(string, n) {\\n\",\n       \"\\t      var result = '';\\n\",\n       \"\\t      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Leverage the exponentiation by squaring algorithm for a faster repeat.\\n\",\n       \"\\t      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\\n\",\n       \"\\t      do {\\n\",\n       \"\\t        if (n % 2) {\\n\",\n       \"\\t          result += string;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        n = nativeFloor(n / 2);\\n\",\n       \"\\t        if (n) {\\n\",\n       \"\\t          string += string;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } while (n);\\n\",\n       \"\\t\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.rest` which doesn't validate or coerce arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to apply a rest parameter to.\\n\",\n       \"\\t     * @param {number} [start=func.length-1] The start position of the rest parameter.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseRest(func, start) {\\n\",\n       \"\\t      return setToString(overRest(func, start, identity), func + '');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.sample`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to sample.\\n\",\n       \"\\t     * @returns {*} Returns the random element.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSample(collection) {\\n\",\n       \"\\t      return arraySample(values(collection));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.sampleSize` without param guards.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to sample.\\n\",\n       \"\\t     * @param {number} n The number of elements to sample.\\n\",\n       \"\\t     * @returns {Array} Returns the random elements.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSampleSize(collection, n) {\\n\",\n       \"\\t      var array = values(collection);\\n\",\n       \"\\t      return shuffleSelf(array, baseClamp(n, 0, array.length));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.set`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize path creation.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSet(object, path, value, customizer) {\\n\",\n       \"\\t      if (!isObject(object)) {\\n\",\n       \"\\t        return object;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      path = castPath(path, object);\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = path.length,\\n\",\n       \"\\t          lastIndex = length - 1,\\n\",\n       \"\\t          nested = object;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (nested != null && ++index < length) {\\n\",\n       \"\\t        var key = toKey(path[index]),\\n\",\n       \"\\t            newValue = value;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (index != lastIndex) {\\n\",\n       \"\\t          var objValue = nested[key];\\n\",\n       \"\\t          newValue = customizer ? customizer(objValue, key, nested) : undefined;\\n\",\n       \"\\t          if (newValue === undefined) {\\n\",\n       \"\\t            newValue = isObject(objValue)\\n\",\n       \"\\t              ? objValue\\n\",\n       \"\\t              : (isIndex(path[index + 1]) ? [] : {});\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        assignValue(nested, key, newValue);\\n\",\n       \"\\t        nested = nested[key];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `setData` without support for hot loop shorting.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to associate metadata with.\\n\",\n       \"\\t     * @param {*} data The metadata.\\n\",\n       \"\\t     * @returns {Function} Returns `func`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseSetData = !metaMap ? identity : function(func, data) {\\n\",\n       \"\\t      metaMap.set(func, data);\\n\",\n       \"\\t      return func;\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `setToString` without support for hot loop shorting.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to modify.\\n\",\n       \"\\t     * @param {Function} string The `toString` result.\\n\",\n       \"\\t     * @returns {Function} Returns `func`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var baseSetToString = !defineProperty ? identity : function(func, string) {\\n\",\n       \"\\t      return defineProperty(func, 'toString', {\\n\",\n       \"\\t        'configurable': true,\\n\",\n       \"\\t        'enumerable': false,\\n\",\n       \"\\t        'value': constant(string),\\n\",\n       \"\\t        'writable': true\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.shuffle`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to shuffle.\\n\",\n       \"\\t     * @returns {Array} Returns the new shuffled array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseShuffle(collection) {\\n\",\n       \"\\t      return shuffleSelf(values(collection));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.slice` without an iteratee call guard.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to slice.\\n\",\n       \"\\t     * @param {number} [start=0] The start position.\\n\",\n       \"\\t     * @param {number} [end=array.length] The end position.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSlice(array, start, end) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (start < 0) {\\n\",\n       \"\\t        start = -start > length ? 0 : (length + start);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      end = end > length ? length : end;\\n\",\n       \"\\t      if (end < 0) {\\n\",\n       \"\\t        end += length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      length = start > end ? 0 : ((end - start) >>> 0);\\n\",\n       \"\\t      start >>>= 0;\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = Array(length);\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        result[index] = array[index + start];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.some` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if any element passes the predicate check,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSome(collection, predicate) {\\n\",\n       \"\\t      var result;\\n\",\n       \"\\t\\n\",\n       \"\\t      baseEach(collection, function(value, index, collection) {\\n\",\n       \"\\t        result = predicate(value, index, collection);\\n\",\n       \"\\t        return !result;\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return !!result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\\n\",\n       \"\\t     * performs a binary search of `array` to determine the index at which `value`\\n\",\n       \"\\t     * should be inserted into `array` in order to maintain its sort order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The sorted array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to evaluate.\\n\",\n       \"\\t     * @param {boolean} [retHighest] Specify returning the highest qualified index.\\n\",\n       \"\\t     * @returns {number} Returns the index at which `value` should be inserted\\n\",\n       \"\\t     *  into `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSortedIndex(array, value, retHighest) {\\n\",\n       \"\\t      var low = 0,\\n\",\n       \"\\t          high = array == null ? low : array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\\n\",\n       \"\\t        while (low < high) {\\n\",\n       \"\\t          var mid = (low + high) >>> 1,\\n\",\n       \"\\t              computed = array[mid];\\n\",\n       \"\\t\\n\",\n       \"\\t          if (computed !== null && !isSymbol(computed) &&\\n\",\n       \"\\t              (retHighest ? (computed <= value) : (computed < value))) {\\n\",\n       \"\\t            low = mid + 1;\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            high = mid;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return high;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseSortedIndexBy(array, value, identity, retHighest);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\\n\",\n       \"\\t     * which invokes `iteratee` for `value` and each element of `array` to compute\\n\",\n       \"\\t     * their sort ranking. The iteratee is invoked with one argument; (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The sorted array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to evaluate.\\n\",\n       \"\\t     * @param {Function} iteratee The iteratee invoked per element.\\n\",\n       \"\\t     * @param {boolean} [retHighest] Specify returning the highest qualified index.\\n\",\n       \"\\t     * @returns {number} Returns the index at which `value` should be inserted\\n\",\n       \"\\t     *  into `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSortedIndexBy(array, value, iteratee, retHighest) {\\n\",\n       \"\\t      value = iteratee(value);\\n\",\n       \"\\t\\n\",\n       \"\\t      var low = 0,\\n\",\n       \"\\t          high = array == null ? 0 : array.length,\\n\",\n       \"\\t          valIsNaN = value !== value,\\n\",\n       \"\\t          valIsNull = value === null,\\n\",\n       \"\\t          valIsSymbol = isSymbol(value),\\n\",\n       \"\\t          valIsUndefined = value === undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (low < high) {\\n\",\n       \"\\t        var mid = nativeFloor((low + high) / 2),\\n\",\n       \"\\t            computed = iteratee(array[mid]),\\n\",\n       \"\\t            othIsDefined = computed !== undefined,\\n\",\n       \"\\t            othIsNull = computed === null,\\n\",\n       \"\\t            othIsReflexive = computed === computed,\\n\",\n       \"\\t            othIsSymbol = isSymbol(computed);\\n\",\n       \"\\t\\n\",\n       \"\\t        if (valIsNaN) {\\n\",\n       \"\\t          var setLow = retHighest || othIsReflexive;\\n\",\n       \"\\t        } else if (valIsUndefined) {\\n\",\n       \"\\t          setLow = othIsReflexive && (retHighest || othIsDefined);\\n\",\n       \"\\t        } else if (valIsNull) {\\n\",\n       \"\\t          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\\n\",\n       \"\\t        } else if (valIsSymbol) {\\n\",\n       \"\\t          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\\n\",\n       \"\\t        } else if (othIsNull || othIsSymbol) {\\n\",\n       \"\\t          setLow = false;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          setLow = retHighest ? (computed <= value) : (computed < value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (setLow) {\\n\",\n       \"\\t          low = mid + 1;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          high = mid;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return nativeMin(high, MAX_ARRAY_INDEX);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\\n\",\n       \"\\t     * support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseSortedUniq(array, iteratee) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = array.length,\\n\",\n       \"\\t          resIndex = 0,\\n\",\n       \"\\t          result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index],\\n\",\n       \"\\t            computed = iteratee ? iteratee(value) : value;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (!index || !eq(computed, seen)) {\\n\",\n       \"\\t          var seen = computed;\\n\",\n       \"\\t          result[resIndex++] = value === 0 ? 0 : value;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.toNumber` which doesn't ensure correct\\n\",\n       \"\\t     * conversions of binary, hexadecimal, or octal string values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to process.\\n\",\n       \"\\t     * @returns {number} Returns the number.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseToNumber(value) {\\n\",\n       \"\\t      if (typeof value == 'number') {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isSymbol(value)) {\\n\",\n       \"\\t        return NAN;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return +value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.toString` which doesn't convert nullish\\n\",\n       \"\\t     * values to empty strings.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to process.\\n\",\n       \"\\t     * @returns {string} Returns the string.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseToString(value) {\\n\",\n       \"\\t      // Exit early for strings to avoid a performance hit in some environments.\\n\",\n       \"\\t      if (typeof value == 'string') {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isArray(value)) {\\n\",\n       \"\\t        // Recursively convert values (susceptible to call stack limits).\\n\",\n       \"\\t        return arrayMap(value, baseToString) + '';\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isSymbol(value)) {\\n\",\n       \"\\t        return symbolToString ? symbolToString.call(value) : '';\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = (value + '');\\n\",\n       \"\\t      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.uniqBy` without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseUniq(array, iteratee, comparator) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          includes = arrayIncludes,\\n\",\n       \"\\t          length = array.length,\\n\",\n       \"\\t          isCommon = true,\\n\",\n       \"\\t          result = [],\\n\",\n       \"\\t          seen = result;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (comparator) {\\n\",\n       \"\\t        isCommon = false;\\n\",\n       \"\\t        includes = arrayIncludesWith;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      else if (length >= LARGE_ARRAY_SIZE) {\\n\",\n       \"\\t        var set = iteratee ? null : createSet(array);\\n\",\n       \"\\t        if (set) {\\n\",\n       \"\\t          return setToArray(set);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        isCommon = false;\\n\",\n       \"\\t        includes = cacheHas;\\n\",\n       \"\\t        seen = new SetCache;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      else {\\n\",\n       \"\\t        seen = iteratee ? [] : result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      outer:\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index],\\n\",\n       \"\\t            computed = iteratee ? iteratee(value) : value;\\n\",\n       \"\\t\\n\",\n       \"\\t        value = (comparator || value !== 0) ? value : 0;\\n\",\n       \"\\t        if (isCommon && computed === computed) {\\n\",\n       \"\\t          var seenIndex = seen.length;\\n\",\n       \"\\t          while (seenIndex--) {\\n\",\n       \"\\t            if (seen[seenIndex] === computed) {\\n\",\n       \"\\t              continue outer;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (iteratee) {\\n\",\n       \"\\t            seen.push(computed);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else if (!includes(seen, computed, comparator)) {\\n\",\n       \"\\t          if (seen !== result) {\\n\",\n       \"\\t            seen.push(computed);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.unset`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The property path to unset.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseUnset(object, path) {\\n\",\n       \"\\t      path = castPath(path, object);\\n\",\n       \"\\t      object = parent(object, path);\\n\",\n       \"\\t      return object == null || delete object[toKey(last(path))];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `_.update`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to update.\\n\",\n       \"\\t     * @param {Function} updater The function to produce the updated value.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize path creation.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseUpdate(object, path, updater, customizer) {\\n\",\n       \"\\t      return baseSet(object, path, updater(baseGet(object, path)), customizer);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\\n\",\n       \"\\t     * without support for iteratee shorthands.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {Function} predicate The function invoked per iteration.\\n\",\n       \"\\t     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\\n\",\n       \"\\t     * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseWhile(array, predicate, isDrop, fromRight) {\\n\",\n       \"\\t      var length = array.length,\\n\",\n       \"\\t          index = fromRight ? length : -1;\\n\",\n       \"\\t\\n\",\n       \"\\t      while ((fromRight ? index-- : ++index < length) &&\\n\",\n       \"\\t        predicate(array[index], index, array)) {}\\n\",\n       \"\\t\\n\",\n       \"\\t      return isDrop\\n\",\n       \"\\t        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\\n\",\n       \"\\t        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of `wrapperValue` which returns the result of\\n\",\n       \"\\t     * performing a sequence of actions on the unwrapped `value`, where each\\n\",\n       \"\\t     * successive action is supplied the return value of the previous.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The unwrapped value.\\n\",\n       \"\\t     * @param {Array} actions Actions to perform to resolve the unwrapped value.\\n\",\n       \"\\t     * @returns {*} Returns the resolved value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseWrapperValue(value, actions) {\\n\",\n       \"\\t      var result = value;\\n\",\n       \"\\t      if (result instanceof LazyWrapper) {\\n\",\n       \"\\t        result = result.value();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return arrayReduce(actions, function(result, action) {\\n\",\n       \"\\t        return action.func.apply(action.thisArg, arrayPush([result], action.args));\\n\",\n       \"\\t      }, result);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The base implementation of methods like `_.xor`, without support for\\n\",\n       \"\\t     * iteratee shorthands, that accepts an array of arrays to inspect.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} arrays The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of values.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseXor(arrays, iteratee, comparator) {\\n\",\n       \"\\t      var length = arrays.length;\\n\",\n       \"\\t      if (length < 2) {\\n\",\n       \"\\t        return length ? baseUniq(arrays[0]) : [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          result = Array(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var array = arrays[index],\\n\",\n       \"\\t            othIndex = -1;\\n\",\n       \"\\t\\n\",\n       \"\\t        while (++othIndex < length) {\\n\",\n       \"\\t          if (othIndex != index) {\\n\",\n       \"\\t            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseUniq(baseFlatten(result, 1), iteratee, comparator);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} props The property identifiers.\\n\",\n       \"\\t     * @param {Array} values The property values.\\n\",\n       \"\\t     * @param {Function} assignFunc The function to assign values.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function baseZipObject(props, values, assignFunc) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = props.length,\\n\",\n       \"\\t          valsLength = values.length,\\n\",\n       \"\\t          result = {};\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = index < valsLength ? values[index] : undefined;\\n\",\n       \"\\t        assignFunc(result, props[index], value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Casts `value` to an empty array if it's not an array like object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to inspect.\\n\",\n       \"\\t     * @returns {Array|Object} Returns the cast array-like object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function castArrayLikeObject(value) {\\n\",\n       \"\\t      return isArrayLikeObject(value) ? value : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Casts `value` to `identity` if it's not a function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to inspect.\\n\",\n       \"\\t     * @returns {Function} Returns cast function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function castFunction(value) {\\n\",\n       \"\\t      return typeof value == 'function' ? value : identity;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Casts `value` to a path array if it's not one.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to inspect.\\n\",\n       \"\\t     * @param {Object} [object] The object to query keys on.\\n\",\n       \"\\t     * @returns {Array} Returns the cast property path array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function castPath(value, object) {\\n\",\n       \"\\t      if (isArray(value)) {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return isKey(value, object) ? [value] : stringToPath(toString(value));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A `baseRest` alias which can be replaced with `identity` by module\\n\",\n       \"\\t     * replacement plugins.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @type {Function}\\n\",\n       \"\\t     * @param {Function} func The function to apply a rest parameter to.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var castRest = baseRest;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Casts `array` to a slice if it's needed.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {number} start The start position.\\n\",\n       \"\\t     * @param {number} [end=array.length] The end position.\\n\",\n       \"\\t     * @returns {Array} Returns the cast slice.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function castSlice(array, start, end) {\\n\",\n       \"\\t      var length = array.length;\\n\",\n       \"\\t      end = end === undefined ? length : end;\\n\",\n       \"\\t      return (!start && end >= length) ? array : baseSlice(array, start, end);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number|Object} id The timer id or timeout object of the timer to clear.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var clearTimeout = ctxClearTimeout || function(id) {\\n\",\n       \"\\t      return root.clearTimeout(id);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of  `buffer`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Buffer} buffer The buffer to clone.\\n\",\n       \"\\t     * @param {boolean} [isDeep] Specify a deep clone.\\n\",\n       \"\\t     * @returns {Buffer} Returns the cloned buffer.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneBuffer(buffer, isDeep) {\\n\",\n       \"\\t      if (isDeep) {\\n\",\n       \"\\t        return buffer.slice();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var length = buffer.length,\\n\",\n       \"\\t          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      buffer.copy(result);\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of `arrayBuffer`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\\n\",\n       \"\\t     * @returns {ArrayBuffer} Returns the cloned array buffer.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneArrayBuffer(arrayBuffer) {\\n\",\n       \"\\t      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\\n\",\n       \"\\t      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of `dataView`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} dataView The data view to clone.\\n\",\n       \"\\t     * @param {boolean} [isDeep] Specify a deep clone.\\n\",\n       \"\\t     * @returns {Object} Returns the cloned data view.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneDataView(dataView, isDeep) {\\n\",\n       \"\\t      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\\n\",\n       \"\\t      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of `regexp`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} regexp The regexp to clone.\\n\",\n       \"\\t     * @returns {Object} Returns the cloned regexp.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneRegExp(regexp) {\\n\",\n       \"\\t      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\\n\",\n       \"\\t      result.lastIndex = regexp.lastIndex;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of the `symbol` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} symbol The symbol object to clone.\\n\",\n       \"\\t     * @returns {Object} Returns the cloned symbol object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneSymbol(symbol) {\\n\",\n       \"\\t      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of `typedArray`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} typedArray The typed array to clone.\\n\",\n       \"\\t     * @param {boolean} [isDeep] Specify a deep clone.\\n\",\n       \"\\t     * @returns {Object} Returns the cloned typed array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneTypedArray(typedArray, isDeep) {\\n\",\n       \"\\t      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\\n\",\n       \"\\t      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Compares values to sort them in ascending order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {number} Returns the sort order indicator for `value`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function compareAscending(value, other) {\\n\",\n       \"\\t      if (value !== other) {\\n\",\n       \"\\t        var valIsDefined = value !== undefined,\\n\",\n       \"\\t            valIsNull = value === null,\\n\",\n       \"\\t            valIsReflexive = value === value,\\n\",\n       \"\\t            valIsSymbol = isSymbol(value);\\n\",\n       \"\\t\\n\",\n       \"\\t        var othIsDefined = other !== undefined,\\n\",\n       \"\\t            othIsNull = other === null,\\n\",\n       \"\\t            othIsReflexive = other === other,\\n\",\n       \"\\t            othIsSymbol = isSymbol(other);\\n\",\n       \"\\t\\n\",\n       \"\\t        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\\n\",\n       \"\\t            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\\n\",\n       \"\\t            (valIsNull && othIsDefined && othIsReflexive) ||\\n\",\n       \"\\t            (!valIsDefined && othIsReflexive) ||\\n\",\n       \"\\t            !valIsReflexive) {\\n\",\n       \"\\t          return 1;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\\n\",\n       \"\\t            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\\n\",\n       \"\\t            (othIsNull && valIsDefined && valIsReflexive) ||\\n\",\n       \"\\t            (!othIsDefined && valIsReflexive) ||\\n\",\n       \"\\t            !othIsReflexive) {\\n\",\n       \"\\t          return -1;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Used by `_.orderBy` to compare multiple properties of a value to another\\n\",\n       \"\\t     * and stable sort them.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\\n\",\n       \"\\t     * specify an order of \\\"desc\\\" for descending or \\\"asc\\\" for ascending sort order\\n\",\n       \"\\t     * of corresponding values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to compare.\\n\",\n       \"\\t     * @param {Object} other The other object to compare.\\n\",\n       \"\\t     * @param {boolean[]|string[]} orders The order to sort by for each property.\\n\",\n       \"\\t     * @returns {number} Returns the sort order indicator for `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function compareMultiple(object, other, orders) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          objCriteria = object.criteria,\\n\",\n       \"\\t          othCriteria = other.criteria,\\n\",\n       \"\\t          length = objCriteria.length,\\n\",\n       \"\\t          ordersLength = orders.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var result = compareAscending(objCriteria[index], othCriteria[index]);\\n\",\n       \"\\t        if (result) {\\n\",\n       \"\\t          if (index >= ordersLength) {\\n\",\n       \"\\t            return result;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          var order = orders[index];\\n\",\n       \"\\t          return result * (order == 'desc' ? -1 : 1);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\\n\",\n       \"\\t      // that causes it, under certain circumstances, to provide the same value for\\n\",\n       \"\\t      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\\n\",\n       \"\\t      // for more details.\\n\",\n       \"\\t      //\\n\",\n       \"\\t      // This also ensures a stable sort in V8 and other engines.\\n\",\n       \"\\t      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\\n\",\n       \"\\t      return object.index - other.index;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array that is the composition of partially applied arguments,\\n\",\n       \"\\t     * placeholders, and provided arguments into a single array of arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} args The provided arguments.\\n\",\n       \"\\t     * @param {Array} partials The arguments to prepend to those provided.\\n\",\n       \"\\t     * @param {Array} holders The `partials` placeholder indexes.\\n\",\n       \"\\t     * @params {boolean} [isCurried] Specify composing for a curried function.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of composed arguments.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function composeArgs(args, partials, holders, isCurried) {\\n\",\n       \"\\t      var argsIndex = -1,\\n\",\n       \"\\t          argsLength = args.length,\\n\",\n       \"\\t          holdersLength = holders.length,\\n\",\n       \"\\t          leftIndex = -1,\\n\",\n       \"\\t          leftLength = partials.length,\\n\",\n       \"\\t          rangeLength = nativeMax(argsLength - holdersLength, 0),\\n\",\n       \"\\t          result = Array(leftLength + rangeLength),\\n\",\n       \"\\t          isUncurried = !isCurried;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++leftIndex < leftLength) {\\n\",\n       \"\\t        result[leftIndex] = partials[leftIndex];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++argsIndex < holdersLength) {\\n\",\n       \"\\t        if (isUncurried || argsIndex < argsLength) {\\n\",\n       \"\\t          result[holders[argsIndex]] = args[argsIndex];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (rangeLength--) {\\n\",\n       \"\\t        result[leftIndex++] = args[argsIndex++];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This function is like `composeArgs` except that the arguments composition\\n\",\n       \"\\t     * is tailored for `_.partialRight`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} args The provided arguments.\\n\",\n       \"\\t     * @param {Array} partials The arguments to append to those provided.\\n\",\n       \"\\t     * @param {Array} holders The `partials` placeholder indexes.\\n\",\n       \"\\t     * @params {boolean} [isCurried] Specify composing for a curried function.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of composed arguments.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function composeArgsRight(args, partials, holders, isCurried) {\\n\",\n       \"\\t      var argsIndex = -1,\\n\",\n       \"\\t          argsLength = args.length,\\n\",\n       \"\\t          holdersIndex = -1,\\n\",\n       \"\\t          holdersLength = holders.length,\\n\",\n       \"\\t          rightIndex = -1,\\n\",\n       \"\\t          rightLength = partials.length,\\n\",\n       \"\\t          rangeLength = nativeMax(argsLength - holdersLength, 0),\\n\",\n       \"\\t          result = Array(rangeLength + rightLength),\\n\",\n       \"\\t          isUncurried = !isCurried;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++argsIndex < rangeLength) {\\n\",\n       \"\\t        result[argsIndex] = args[argsIndex];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var offset = argsIndex;\\n\",\n       \"\\t      while (++rightIndex < rightLength) {\\n\",\n       \"\\t        result[offset + rightIndex] = partials[rightIndex];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++holdersIndex < holdersLength) {\\n\",\n       \"\\t        if (isUncurried || argsIndex < argsLength) {\\n\",\n       \"\\t          result[offset + holders[holdersIndex]] = args[argsIndex++];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Copies the values of `source` to `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} source The array to copy values from.\\n\",\n       \"\\t     * @param {Array} [array=[]] The array to copy values to.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function copyArray(source, array) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = source.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      array || (array = Array(length));\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        array[index] = source[index];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Copies properties of `source` to `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} source The object to copy properties from.\\n\",\n       \"\\t     * @param {Array} props The property identifiers to copy.\\n\",\n       \"\\t     * @param {Object} [object={}] The object to copy properties to.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize copied values.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function copyObject(source, props, object, customizer) {\\n\",\n       \"\\t      var isNew = !object;\\n\",\n       \"\\t      object || (object = {});\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = props.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var key = props[index];\\n\",\n       \"\\t\\n\",\n       \"\\t        var newValue = customizer\\n\",\n       \"\\t          ? customizer(object[key], source[key], key, object, source)\\n\",\n       \"\\t          : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (newValue === undefined) {\\n\",\n       \"\\t          newValue = source[key];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (isNew) {\\n\",\n       \"\\t          baseAssignValue(object, key, newValue);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          assignValue(object, key, newValue);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Copies own symbols of `source` to `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} source The object to copy symbols from.\\n\",\n       \"\\t     * @param {Object} [object={}] The object to copy symbols to.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function copySymbols(source, object) {\\n\",\n       \"\\t      return copyObject(source, getSymbols(source), object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Copies own and inherited symbols of `source` to `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} source The object to copy symbols from.\\n\",\n       \"\\t     * @param {Object} [object={}] The object to copy symbols to.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function copySymbolsIn(source, object) {\\n\",\n       \"\\t      return copyObject(source, getSymbolsIn(source), object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.groupBy`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} setter The function to set accumulator values.\\n\",\n       \"\\t     * @param {Function} [initializer] The accumulator object initializer.\\n\",\n       \"\\t     * @returns {Function} Returns the new aggregator function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createAggregator(setter, initializer) {\\n\",\n       \"\\t      return function(collection, iteratee) {\\n\",\n       \"\\t        var func = isArray(collection) ? arrayAggregator : baseAggregator,\\n\",\n       \"\\t            accumulator = initializer ? initializer() : {};\\n\",\n       \"\\t\\n\",\n       \"\\t        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.assign`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} assigner The function to assign values.\\n\",\n       \"\\t     * @returns {Function} Returns the new assigner function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createAssigner(assigner) {\\n\",\n       \"\\t      return baseRest(function(object, sources) {\\n\",\n       \"\\t        var index = -1,\\n\",\n       \"\\t            length = sources.length,\\n\",\n       \"\\t            customizer = length > 1 ? sources[length - 1] : undefined,\\n\",\n       \"\\t            guard = length > 2 ? sources[2] : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t        customizer = (assigner.length > 3 && typeof customizer == 'function')\\n\",\n       \"\\t          ? (length--, customizer)\\n\",\n       \"\\t          : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (guard && isIterateeCall(sources[0], sources[1], guard)) {\\n\",\n       \"\\t          customizer = length < 3 ? undefined : customizer;\\n\",\n       \"\\t          length = 1;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        object = Object(object);\\n\",\n       \"\\t        while (++index < length) {\\n\",\n       \"\\t          var source = sources[index];\\n\",\n       \"\\t          if (source) {\\n\",\n       \"\\t            assigner(object, source, index, customizer);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return object;\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `baseEach` or `baseEachRight` function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} eachFunc The function to iterate over a collection.\\n\",\n       \"\\t     * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t     * @returns {Function} Returns the new base function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createBaseEach(eachFunc, fromRight) {\\n\",\n       \"\\t      return function(collection, iteratee) {\\n\",\n       \"\\t        if (collection == null) {\\n\",\n       \"\\t          return collection;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (!isArrayLike(collection)) {\\n\",\n       \"\\t          return eachFunc(collection, iteratee);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var length = collection.length,\\n\",\n       \"\\t            index = fromRight ? length : -1,\\n\",\n       \"\\t            iterable = Object(collection);\\n\",\n       \"\\t\\n\",\n       \"\\t        while ((fromRight ? index-- : ++index < length)) {\\n\",\n       \"\\t          if (iteratee(iterable[index], index, iterable) === false) {\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return collection;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t     * @returns {Function} Returns the new base function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createBaseFor(fromRight) {\\n\",\n       \"\\t      return function(object, iteratee, keysFunc) {\\n\",\n       \"\\t        var index = -1,\\n\",\n       \"\\t            iterable = Object(object),\\n\",\n       \"\\t            props = keysFunc(object),\\n\",\n       \"\\t            length = props.length;\\n\",\n       \"\\t\\n\",\n       \"\\t        while (length--) {\\n\",\n       \"\\t          var key = props[fromRight ? length : ++index];\\n\",\n       \"\\t          if (iteratee(iterable[key], key, iterable) === false) {\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return object;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that wraps `func` to invoke it with the optional `this`\\n\",\n       \"\\t     * binding of `thisArg`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to wrap.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @param {*} [thisArg] The `this` binding of `func`.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createBind(func, bitmask, thisArg) {\\n\",\n       \"\\t      var isBind = bitmask & WRAP_BIND_FLAG,\\n\",\n       \"\\t          Ctor = createCtor(func);\\n\",\n       \"\\t\\n\",\n       \"\\t      function wrapper() {\\n\",\n       \"\\t        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\\n\",\n       \"\\t        return fn.apply(isBind ? thisArg : this, arguments);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return wrapper;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.lowerFirst`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} methodName The name of the `String` case method to use.\\n\",\n       \"\\t     * @returns {Function} Returns the new case function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createCaseFirst(methodName) {\\n\",\n       \"\\t      return function(string) {\\n\",\n       \"\\t        string = toString(string);\\n\",\n       \"\\t\\n\",\n       \"\\t        var strSymbols = hasUnicode(string)\\n\",\n       \"\\t          ? stringToArray(string)\\n\",\n       \"\\t          : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t        var chr = strSymbols\\n\",\n       \"\\t          ? strSymbols[0]\\n\",\n       \"\\t          : string.charAt(0);\\n\",\n       \"\\t\\n\",\n       \"\\t        var trailing = strSymbols\\n\",\n       \"\\t          ? castSlice(strSymbols, 1).join('')\\n\",\n       \"\\t          : string.slice(1);\\n\",\n       \"\\t\\n\",\n       \"\\t        return chr[methodName]() + trailing;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.camelCase`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} callback The function to combine each word.\\n\",\n       \"\\t     * @returns {Function} Returns the new compounder function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createCompounder(callback) {\\n\",\n       \"\\t      return function(string) {\\n\",\n       \"\\t        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that produces an instance of `Ctor` regardless of\\n\",\n       \"\\t     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} Ctor The constructor to wrap.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createCtor(Ctor) {\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        // Use a `switch` statement to work with class constructors. See\\n\",\n       \"\\t        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\\n\",\n       \"\\t        // for more details.\\n\",\n       \"\\t        var args = arguments;\\n\",\n       \"\\t        switch (args.length) {\\n\",\n       \"\\t          case 0: return new Ctor;\\n\",\n       \"\\t          case 1: return new Ctor(args[0]);\\n\",\n       \"\\t          case 2: return new Ctor(args[0], args[1]);\\n\",\n       \"\\t          case 3: return new Ctor(args[0], args[1], args[2]);\\n\",\n       \"\\t          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\\n\",\n       \"\\t          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\\n\",\n       \"\\t          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\\n\",\n       \"\\t          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var thisBinding = baseCreate(Ctor.prototype),\\n\",\n       \"\\t            result = Ctor.apply(thisBinding, args);\\n\",\n       \"\\t\\n\",\n       \"\\t        // Mimic the constructor's `return` behavior.\\n\",\n       \"\\t        // See https://es5.github.io/#x13.2.2 for more details.\\n\",\n       \"\\t        return isObject(result) ? result : thisBinding;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that wraps `func` to enable currying.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to wrap.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @param {number} arity The arity of `func`.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createCurry(func, bitmask, arity) {\\n\",\n       \"\\t      var Ctor = createCtor(func);\\n\",\n       \"\\t\\n\",\n       \"\\t      function wrapper() {\\n\",\n       \"\\t        var length = arguments.length,\\n\",\n       \"\\t            args = Array(length),\\n\",\n       \"\\t            index = length,\\n\",\n       \"\\t            placeholder = getHolder(wrapper);\\n\",\n       \"\\t\\n\",\n       \"\\t        while (index--) {\\n\",\n       \"\\t          args[index] = arguments[index];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\\n\",\n       \"\\t          ? []\\n\",\n       \"\\t          : replaceHolders(args, placeholder);\\n\",\n       \"\\t\\n\",\n       \"\\t        length -= holders.length;\\n\",\n       \"\\t        if (length < arity) {\\n\",\n       \"\\t          return createRecurry(\\n\",\n       \"\\t            func, bitmask, createHybrid, wrapper.placeholder, undefined,\\n\",\n       \"\\t            args, holders, undefined, undefined, arity - length);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\\n\",\n       \"\\t        return apply(fn, this, args);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return wrapper;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `_.find` or `_.findLast` function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} findIndexFunc The function to find the collection index.\\n\",\n       \"\\t     * @returns {Function} Returns the new find function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createFind(findIndexFunc) {\\n\",\n       \"\\t      return function(collection, predicate, fromIndex) {\\n\",\n       \"\\t        var iterable = Object(collection);\\n\",\n       \"\\t        if (!isArrayLike(collection)) {\\n\",\n       \"\\t          var iteratee = getIteratee(predicate, 3);\\n\",\n       \"\\t          collection = keys(collection);\\n\",\n       \"\\t          predicate = function(key) { return iteratee(iterable[key], key, iterable); };\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var index = findIndexFunc(collection, predicate, fromIndex);\\n\",\n       \"\\t        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `_.flow` or `_.flowRight` function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t     * @returns {Function} Returns the new flow function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createFlow(fromRight) {\\n\",\n       \"\\t      return flatRest(function(funcs) {\\n\",\n       \"\\t        var length = funcs.length,\\n\",\n       \"\\t            index = length,\\n\",\n       \"\\t            prereq = LodashWrapper.prototype.thru;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (fromRight) {\\n\",\n       \"\\t          funcs.reverse();\\n\",\n       \"\\t        }\\n\",\n       \"\\t        while (index--) {\\n\",\n       \"\\t          var func = funcs[index];\\n\",\n       \"\\t          if (typeof func != 'function') {\\n\",\n       \"\\t            throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\\n\",\n       \"\\t            var wrapper = new LodashWrapper([], true);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        index = wrapper ? index : length;\\n\",\n       \"\\t        while (++index < length) {\\n\",\n       \"\\t          func = funcs[index];\\n\",\n       \"\\t\\n\",\n       \"\\t          var funcName = getFuncName(func),\\n\",\n       \"\\t              data = funcName == 'wrapper' ? getData(func) : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t          if (data && isLaziable(data[0]) &&\\n\",\n       \"\\t                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\\n\",\n       \"\\t                !data[4].length && data[9] == 1\\n\",\n       \"\\t              ) {\\n\",\n       \"\\t            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            wrapper = (func.length == 1 && isLaziable(func))\\n\",\n       \"\\t              ? wrapper[funcName]()\\n\",\n       \"\\t              : wrapper.thru(func);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return function() {\\n\",\n       \"\\t          var args = arguments,\\n\",\n       \"\\t              value = args[0];\\n\",\n       \"\\t\\n\",\n       \"\\t          if (wrapper && args.length == 1 && isArray(value)) {\\n\",\n       \"\\t            return wrapper.plant(value).value();\\n\",\n       \"\\t          }\\n\",\n       \"\\t          var index = 0,\\n\",\n       \"\\t              result = length ? funcs[index].apply(this, args) : value;\\n\",\n       \"\\t\\n\",\n       \"\\t          while (++index < length) {\\n\",\n       \"\\t            result = funcs[index].call(this, result);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          return result;\\n\",\n       \"\\t        };\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that wraps `func` to invoke it with optional `this`\\n\",\n       \"\\t     * binding of `thisArg`, partial application, and currying.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function|string} func The function or method name to wrap.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @param {*} [thisArg] The `this` binding of `func`.\\n\",\n       \"\\t     * @param {Array} [partials] The arguments to prepend to those provided to\\n\",\n       \"\\t     *  the new function.\\n\",\n       \"\\t     * @param {Array} [holders] The `partials` placeholder indexes.\\n\",\n       \"\\t     * @param {Array} [partialsRight] The arguments to append to those provided\\n\",\n       \"\\t     *  to the new function.\\n\",\n       \"\\t     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\\n\",\n       \"\\t     * @param {Array} [argPos] The argument positions of the new function.\\n\",\n       \"\\t     * @param {number} [ary] The arity cap of `func`.\\n\",\n       \"\\t     * @param {number} [arity] The arity of `func`.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\\n\",\n       \"\\t      var isAry = bitmask & WRAP_ARY_FLAG,\\n\",\n       \"\\t          isBind = bitmask & WRAP_BIND_FLAG,\\n\",\n       \"\\t          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\\n\",\n       \"\\t          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\\n\",\n       \"\\t          isFlip = bitmask & WRAP_FLIP_FLAG,\\n\",\n       \"\\t          Ctor = isBindKey ? undefined : createCtor(func);\\n\",\n       \"\\t\\n\",\n       \"\\t      function wrapper() {\\n\",\n       \"\\t        var length = arguments.length,\\n\",\n       \"\\t            args = Array(length),\\n\",\n       \"\\t            index = length;\\n\",\n       \"\\t\\n\",\n       \"\\t        while (index--) {\\n\",\n       \"\\t          args[index] = arguments[index];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (isCurried) {\\n\",\n       \"\\t          var placeholder = getHolder(wrapper),\\n\",\n       \"\\t              holdersCount = countHolders(args, placeholder);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (partials) {\\n\",\n       \"\\t          args = composeArgs(args, partials, holders, isCurried);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (partialsRight) {\\n\",\n       \"\\t          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        length -= holdersCount;\\n\",\n       \"\\t        if (isCurried && length < arity) {\\n\",\n       \"\\t          var newHolders = replaceHolders(args, placeholder);\\n\",\n       \"\\t          return createRecurry(\\n\",\n       \"\\t            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\\n\",\n       \"\\t            args, newHolders, argPos, ary, arity - length\\n\",\n       \"\\t          );\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var thisBinding = isBind ? thisArg : this,\\n\",\n       \"\\t            fn = isBindKey ? thisBinding[func] : func;\\n\",\n       \"\\t\\n\",\n       \"\\t        length = args.length;\\n\",\n       \"\\t        if (argPos) {\\n\",\n       \"\\t          args = reorder(args, argPos);\\n\",\n       \"\\t        } else if (isFlip && length > 1) {\\n\",\n       \"\\t          args.reverse();\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (isAry && ary < length) {\\n\",\n       \"\\t          args.length = ary;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (this && this !== root && this instanceof wrapper) {\\n\",\n       \"\\t          fn = Ctor || createCtor(fn);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return fn.apply(thisBinding, args);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return wrapper;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.invertBy`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} setter The function to set accumulator values.\\n\",\n       \"\\t     * @param {Function} toIteratee The function to resolve iteratees.\\n\",\n       \"\\t     * @returns {Function} Returns the new inverter function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createInverter(setter, toIteratee) {\\n\",\n       \"\\t      return function(object, iteratee) {\\n\",\n       \"\\t        return baseInverter(object, setter, toIteratee(iteratee), {});\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that performs a mathematical operation on two values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} operator The function to perform the operation.\\n\",\n       \"\\t     * @param {number} [defaultValue] The value used for `undefined` arguments.\\n\",\n       \"\\t     * @returns {Function} Returns the new mathematical operation function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createMathOperation(operator, defaultValue) {\\n\",\n       \"\\t      return function(value, other) {\\n\",\n       \"\\t        var result;\\n\",\n       \"\\t        if (value === undefined && other === undefined) {\\n\",\n       \"\\t          return defaultValue;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (value !== undefined) {\\n\",\n       \"\\t          result = value;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (other !== undefined) {\\n\",\n       \"\\t          if (result === undefined) {\\n\",\n       \"\\t            return other;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (typeof value == 'string' || typeof other == 'string') {\\n\",\n       \"\\t            value = baseToString(value);\\n\",\n       \"\\t            other = baseToString(other);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            value = baseToNumber(value);\\n\",\n       \"\\t            other = baseToNumber(other);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result = operator(value, other);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.over`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} arrayFunc The function to iterate over iteratees.\\n\",\n       \"\\t     * @returns {Function} Returns the new over function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createOver(arrayFunc) {\\n\",\n       \"\\t      return flatRest(function(iteratees) {\\n\",\n       \"\\t        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\\n\",\n       \"\\t        return baseRest(function(args) {\\n\",\n       \"\\t          var thisArg = this;\\n\",\n       \"\\t          return arrayFunc(iteratees, function(iteratee) {\\n\",\n       \"\\t            return apply(iteratee, thisArg, args);\\n\",\n       \"\\t          });\\n\",\n       \"\\t        });\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates the padding for `string` based on `length`. The `chars` string\\n\",\n       \"\\t     * is truncated if the number of characters exceeds `length`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number} length The padding length.\\n\",\n       \"\\t     * @param {string} [chars=' '] The string used as padding.\\n\",\n       \"\\t     * @returns {string} Returns the padding for `string`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createPadding(length, chars) {\\n\",\n       \"\\t      chars = chars === undefined ? ' ' : baseToString(chars);\\n\",\n       \"\\t\\n\",\n       \"\\t      var charsLength = chars.length;\\n\",\n       \"\\t      if (charsLength < 2) {\\n\",\n       \"\\t        return charsLength ? baseRepeat(chars, length) : chars;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\\n\",\n       \"\\t      return hasUnicode(chars)\\n\",\n       \"\\t        ? castSlice(stringToArray(result), 0, length).join('')\\n\",\n       \"\\t        : result.slice(0, length);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that wraps `func` to invoke it with the `this` binding\\n\",\n       \"\\t     * of `thisArg` and `partials` prepended to the arguments it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to wrap.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @param {*} thisArg The `this` binding of `func`.\\n\",\n       \"\\t     * @param {Array} partials The arguments to prepend to those provided to\\n\",\n       \"\\t     *  the new function.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createPartial(func, bitmask, thisArg, partials) {\\n\",\n       \"\\t      var isBind = bitmask & WRAP_BIND_FLAG,\\n\",\n       \"\\t          Ctor = createCtor(func);\\n\",\n       \"\\t\\n\",\n       \"\\t      function wrapper() {\\n\",\n       \"\\t        var argsIndex = -1,\\n\",\n       \"\\t            argsLength = arguments.length,\\n\",\n       \"\\t            leftIndex = -1,\\n\",\n       \"\\t            leftLength = partials.length,\\n\",\n       \"\\t            args = Array(leftLength + argsLength),\\n\",\n       \"\\t            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\\n\",\n       \"\\t\\n\",\n       \"\\t        while (++leftIndex < leftLength) {\\n\",\n       \"\\t          args[leftIndex] = partials[leftIndex];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        while (argsLength--) {\\n\",\n       \"\\t          args[leftIndex++] = arguments[++argsIndex];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return apply(fn, isBind ? thisArg : this, args);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return wrapper;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `_.range` or `_.rangeRight` function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {boolean} [fromRight] Specify iterating from right to left.\\n\",\n       \"\\t     * @returns {Function} Returns the new range function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createRange(fromRight) {\\n\",\n       \"\\t      return function(start, end, step) {\\n\",\n       \"\\t        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\\n\",\n       \"\\t          end = step = undefined;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        // Ensure the sign of `-0` is preserved.\\n\",\n       \"\\t        start = toFinite(start);\\n\",\n       \"\\t        if (end === undefined) {\\n\",\n       \"\\t          end = start;\\n\",\n       \"\\t          start = 0;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          end = toFinite(end);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\\n\",\n       \"\\t        return baseRange(start, end, step, fromRight);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that performs a relational operation on two values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} operator The function to perform the operation.\\n\",\n       \"\\t     * @returns {Function} Returns the new relational operation function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createRelationalOperation(operator) {\\n\",\n       \"\\t      return function(value, other) {\\n\",\n       \"\\t        if (!(typeof value == 'string' && typeof other == 'string')) {\\n\",\n       \"\\t          value = toNumber(value);\\n\",\n       \"\\t          other = toNumber(other);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return operator(value, other);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that wraps `func` to continue currying.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to wrap.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @param {Function} wrapFunc The function to create the `func` wrapper.\\n\",\n       \"\\t     * @param {*} placeholder The placeholder value.\\n\",\n       \"\\t     * @param {*} [thisArg] The `this` binding of `func`.\\n\",\n       \"\\t     * @param {Array} [partials] The arguments to prepend to those provided to\\n\",\n       \"\\t     *  the new function.\\n\",\n       \"\\t     * @param {Array} [holders] The `partials` placeholder indexes.\\n\",\n       \"\\t     * @param {Array} [argPos] The argument positions of the new function.\\n\",\n       \"\\t     * @param {number} [ary] The arity cap of `func`.\\n\",\n       \"\\t     * @param {number} [arity] The arity of `func`.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\\n\",\n       \"\\t      var isCurry = bitmask & WRAP_CURRY_FLAG,\\n\",\n       \"\\t          newHolders = isCurry ? holders : undefined,\\n\",\n       \"\\t          newHoldersRight = isCurry ? undefined : holders,\\n\",\n       \"\\t          newPartials = isCurry ? partials : undefined,\\n\",\n       \"\\t          newPartialsRight = isCurry ? undefined : partials;\\n\",\n       \"\\t\\n\",\n       \"\\t      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\\n\",\n       \"\\t      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\\n\",\n       \"\\t        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var newData = [\\n\",\n       \"\\t        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\\n\",\n       \"\\t        newHoldersRight, argPos, ary, arity\\n\",\n       \"\\t      ];\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = wrapFunc.apply(undefined, newData);\\n\",\n       \"\\t      if (isLaziable(func)) {\\n\",\n       \"\\t        setData(result, newData);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      result.placeholder = placeholder;\\n\",\n       \"\\t      return setWrapToString(result, func, bitmask);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function like `_.round`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} methodName The name of the `Math` method to use when rounding.\\n\",\n       \"\\t     * @returns {Function} Returns the new round function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createRound(methodName) {\\n\",\n       \"\\t      var func = Math[methodName];\\n\",\n       \"\\t      return function(number, precision) {\\n\",\n       \"\\t        number = toNumber(number);\\n\",\n       \"\\t        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\\n\",\n       \"\\t        if (precision) {\\n\",\n       \"\\t          // Shift with exponential notation to avoid floating-point issues.\\n\",\n       \"\\t          // See [MDN](https://mdn.io/round#Examples) for more details.\\n\",\n       \"\\t          var pair = (toString(number) + 'e').split('e'),\\n\",\n       \"\\t              value = func(pair[0] + 'e' + (+pair[1] + precision));\\n\",\n       \"\\t\\n\",\n       \"\\t          pair = (toString(value) + 'e').split('e');\\n\",\n       \"\\t          return +(pair[0] + 'e' + (+pair[1] - precision));\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return func(number);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a set object of `values`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} values The values to add to the set.\\n\",\n       \"\\t     * @returns {Object} Returns the new set.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\\n\",\n       \"\\t      return new Set(values);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `_.toPairs` or `_.toPairsIn` function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} keysFunc The function to get the keys of a given object.\\n\",\n       \"\\t     * @returns {Function} Returns the new pairs function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createToPairs(keysFunc) {\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        var tag = getTag(object);\\n\",\n       \"\\t        if (tag == mapTag) {\\n\",\n       \"\\t          return mapToArray(object);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (tag == setTag) {\\n\",\n       \"\\t          return setToPairs(object);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return baseToPairs(object, keysFunc(object));\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that either curries or invokes `func` with optional\\n\",\n       \"\\t     * `this` binding and partially applied arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function|string} func The function or method name to wrap.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags.\\n\",\n       \"\\t     *    1 - `_.bind`\\n\",\n       \"\\t     *    2 - `_.bindKey`\\n\",\n       \"\\t     *    4 - `_.curry` or `_.curryRight` of a bound function\\n\",\n       \"\\t     *    8 - `_.curry`\\n\",\n       \"\\t     *   16 - `_.curryRight`\\n\",\n       \"\\t     *   32 - `_.partial`\\n\",\n       \"\\t     *   64 - `_.partialRight`\\n\",\n       \"\\t     *  128 - `_.rearg`\\n\",\n       \"\\t     *  256 - `_.ary`\\n\",\n       \"\\t     *  512 - `_.flip`\\n\",\n       \"\\t     * @param {*} [thisArg] The `this` binding of `func`.\\n\",\n       \"\\t     * @param {Array} [partials] The arguments to be partially applied.\\n\",\n       \"\\t     * @param {Array} [holders] The `partials` placeholder indexes.\\n\",\n       \"\\t     * @param {Array} [argPos] The argument positions of the new function.\\n\",\n       \"\\t     * @param {number} [ary] The arity cap of `func`.\\n\",\n       \"\\t     * @param {number} [arity] The arity of `func`.\\n\",\n       \"\\t     * @returns {Function} Returns the new wrapped function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\\n\",\n       \"\\t      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\\n\",\n       \"\\t      if (!isBindKey && typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var length = partials ? partials.length : 0;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\\n\",\n       \"\\t        partials = holders = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\\n\",\n       \"\\t      arity = arity === undefined ? arity : toInteger(arity);\\n\",\n       \"\\t      length -= holders ? holders.length : 0;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\\n\",\n       \"\\t        var partialsRight = partials,\\n\",\n       \"\\t            holdersRight = holders;\\n\",\n       \"\\t\\n\",\n       \"\\t        partials = holders = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var data = isBindKey ? undefined : getData(func);\\n\",\n       \"\\t\\n\",\n       \"\\t      var newData = [\\n\",\n       \"\\t        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\\n\",\n       \"\\t        argPos, ary, arity\\n\",\n       \"\\t      ];\\n\",\n       \"\\t\\n\",\n       \"\\t      if (data) {\\n\",\n       \"\\t        mergeData(newData, data);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      func = newData[0];\\n\",\n       \"\\t      bitmask = newData[1];\\n\",\n       \"\\t      thisArg = newData[2];\\n\",\n       \"\\t      partials = newData[3];\\n\",\n       \"\\t      holders = newData[4];\\n\",\n       \"\\t      arity = newData[9] = newData[9] === undefined\\n\",\n       \"\\t        ? (isBindKey ? 0 : func.length)\\n\",\n       \"\\t        : nativeMax(newData[9] - length, 0);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\\n\",\n       \"\\t        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\\n\",\n       \"\\t        var result = createBind(func, bitmask, thisArg);\\n\",\n       \"\\t      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\\n\",\n       \"\\t        result = createCurry(func, bitmask, arity);\\n\",\n       \"\\t      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\\n\",\n       \"\\t        result = createPartial(func, bitmask, thisArg, partials);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        result = createHybrid.apply(undefined, newData);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var setter = data ? baseSetData : setData;\\n\",\n       \"\\t      return setWrapToString(setter(result, newData), func, bitmask);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\\n\",\n       \"\\t     * of source objects to the destination object for all destination properties\\n\",\n       \"\\t     * that resolve to `undefined`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} objValue The destination value.\\n\",\n       \"\\t     * @param {*} srcValue The source value.\\n\",\n       \"\\t     * @param {string} key The key of the property to assign.\\n\",\n       \"\\t     * @param {Object} object The parent object of `objValue`.\\n\",\n       \"\\t     * @returns {*} Returns the value to assign.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function customDefaultsAssignIn(objValue, srcValue, key, object) {\\n\",\n       \"\\t      if (objValue === undefined ||\\n\",\n       \"\\t          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\\n\",\n       \"\\t        return srcValue;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return objValue;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\\n\",\n       \"\\t     * objects into destination objects that are passed thru.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} objValue The destination value.\\n\",\n       \"\\t     * @param {*} srcValue The source value.\\n\",\n       \"\\t     * @param {string} key The key of the property to merge.\\n\",\n       \"\\t     * @param {Object} object The parent object of `objValue`.\\n\",\n       \"\\t     * @param {Object} source The parent object of `srcValue`.\\n\",\n       \"\\t     * @param {Object} [stack] Tracks traversed source values and their merged\\n\",\n       \"\\t     *  counterparts.\\n\",\n       \"\\t     * @returns {*} Returns the value to assign.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\\n\",\n       \"\\t      if (isObject(objValue) && isObject(srcValue)) {\\n\",\n       \"\\t        // Recursively merge objects and arrays (susceptible to call stack limits).\\n\",\n       \"\\t        stack.set(srcValue, objValue);\\n\",\n       \"\\t        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\\n\",\n       \"\\t        stack['delete'](srcValue);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return objValue;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\\n\",\n       \"\\t     * objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to inspect.\\n\",\n       \"\\t     * @param {string} key The key of the property to inspect.\\n\",\n       \"\\t     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function customOmitClone(value) {\\n\",\n       \"\\t      return isPlainObject(value) ? undefined : value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseIsEqualDeep` for arrays with support for\\n\",\n       \"\\t     * partial deep comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to compare.\\n\",\n       \"\\t     * @param {Array} other The other array to compare.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\\n\",\n       \"\\t     * @param {Function} customizer The function to customize comparisons.\\n\",\n       \"\\t     * @param {Function} equalFunc The function to determine equivalents of values.\\n\",\n       \"\\t     * @param {Object} stack Tracks traversed `array` and `other` objects.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\\n\",\n       \"\\t      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\\n\",\n       \"\\t          arrLength = array.length,\\n\",\n       \"\\t          othLength = other.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Assume cyclic values are equal.\\n\",\n       \"\\t      var stacked = stack.get(array);\\n\",\n       \"\\t      if (stacked && stack.get(other)) {\\n\",\n       \"\\t        return stacked == other;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          result = true,\\n\",\n       \"\\t          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      stack.set(array, other);\\n\",\n       \"\\t      stack.set(other, array);\\n\",\n       \"\\t\\n\",\n       \"\\t      // Ignore non-index properties.\\n\",\n       \"\\t      while (++index < arrLength) {\\n\",\n       \"\\t        var arrValue = array[index],\\n\",\n       \"\\t            othValue = other[index];\\n\",\n       \"\\t\\n\",\n       \"\\t        if (customizer) {\\n\",\n       \"\\t          var compared = isPartial\\n\",\n       \"\\t            ? customizer(othValue, arrValue, index, other, array, stack)\\n\",\n       \"\\t            : customizer(arrValue, othValue, index, array, other, stack);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (compared !== undefined) {\\n\",\n       \"\\t          if (compared) {\\n\",\n       \"\\t            continue;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result = false;\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        // Recursively compare arrays (susceptible to call stack limits).\\n\",\n       \"\\t        if (seen) {\\n\",\n       \"\\t          if (!arraySome(other, function(othValue, othIndex) {\\n\",\n       \"\\t                if (!cacheHas(seen, othIndex) &&\\n\",\n       \"\\t                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\\n\",\n       \"\\t                  return seen.push(othIndex);\\n\",\n       \"\\t                }\\n\",\n       \"\\t              })) {\\n\",\n       \"\\t            result = false;\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else if (!(\\n\",\n       \"\\t              arrValue === othValue ||\\n\",\n       \"\\t                equalFunc(arrValue, othValue, bitmask, customizer, stack)\\n\",\n       \"\\t            )) {\\n\",\n       \"\\t          result = false;\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      stack['delete'](array);\\n\",\n       \"\\t      stack['delete'](other);\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseIsEqualDeep` for comparing objects of\\n\",\n       \"\\t     * the same `toStringTag`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This function only supports comparing values with tags of\\n\",\n       \"\\t     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to compare.\\n\",\n       \"\\t     * @param {Object} other The other object to compare.\\n\",\n       \"\\t     * @param {string} tag The `toStringTag` of the objects to compare.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\\n\",\n       \"\\t     * @param {Function} customizer The function to customize comparisons.\\n\",\n       \"\\t     * @param {Function} equalFunc The function to determine equivalents of values.\\n\",\n       \"\\t     * @param {Object} stack Tracks traversed `object` and `other` objects.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\\n\",\n       \"\\t      switch (tag) {\\n\",\n       \"\\t        case dataViewTag:\\n\",\n       \"\\t          if ((object.byteLength != other.byteLength) ||\\n\",\n       \"\\t              (object.byteOffset != other.byteOffset)) {\\n\",\n       \"\\t            return false;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          object = object.buffer;\\n\",\n       \"\\t          other = other.buffer;\\n\",\n       \"\\t\\n\",\n       \"\\t        case arrayBufferTag:\\n\",\n       \"\\t          if ((object.byteLength != other.byteLength) ||\\n\",\n       \"\\t              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\\n\",\n       \"\\t            return false;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          return true;\\n\",\n       \"\\t\\n\",\n       \"\\t        case boolTag:\\n\",\n       \"\\t        case dateTag:\\n\",\n       \"\\t        case numberTag:\\n\",\n       \"\\t          // Coerce booleans to `1` or `0` and dates to milliseconds.\\n\",\n       \"\\t          // Invalid dates are coerced to `NaN`.\\n\",\n       \"\\t          return eq(+object, +other);\\n\",\n       \"\\t\\n\",\n       \"\\t        case errorTag:\\n\",\n       \"\\t          return object.name == other.name && object.message == other.message;\\n\",\n       \"\\t\\n\",\n       \"\\t        case regexpTag:\\n\",\n       \"\\t        case stringTag:\\n\",\n       \"\\t          // Coerce regexes to strings and treat strings, primitives and objects,\\n\",\n       \"\\t          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\\n\",\n       \"\\t          // for more details.\\n\",\n       \"\\t          return object == (other + '');\\n\",\n       \"\\t\\n\",\n       \"\\t        case mapTag:\\n\",\n       \"\\t          var convert = mapToArray;\\n\",\n       \"\\t\\n\",\n       \"\\t        case setTag:\\n\",\n       \"\\t          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\\n\",\n       \"\\t          convert || (convert = setToArray);\\n\",\n       \"\\t\\n\",\n       \"\\t          if (object.size != other.size && !isPartial) {\\n\",\n       \"\\t            return false;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          // Assume cyclic values are equal.\\n\",\n       \"\\t          var stacked = stack.get(object);\\n\",\n       \"\\t          if (stacked) {\\n\",\n       \"\\t            return stacked == other;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          bitmask |= COMPARE_UNORDERED_FLAG;\\n\",\n       \"\\t\\n\",\n       \"\\t          // Recursively compare objects (susceptible to call stack limits).\\n\",\n       \"\\t          stack.set(object, other);\\n\",\n       \"\\t          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\\n\",\n       \"\\t          stack['delete'](object);\\n\",\n       \"\\t          return result;\\n\",\n       \"\\t\\n\",\n       \"\\t        case symbolTag:\\n\",\n       \"\\t          if (symbolValueOf) {\\n\",\n       \"\\t            return symbolValueOf.call(object) == symbolValueOf.call(other);\\n\",\n       \"\\t          }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseIsEqualDeep` for objects with support for\\n\",\n       \"\\t     * partial deep comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to compare.\\n\",\n       \"\\t     * @param {Object} other The other object to compare.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\\n\",\n       \"\\t     * @param {Function} customizer The function to customize comparisons.\\n\",\n       \"\\t     * @param {Function} equalFunc The function to determine equivalents of values.\\n\",\n       \"\\t     * @param {Object} stack Tracks traversed `object` and `other` objects.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\\n\",\n       \"\\t      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\\n\",\n       \"\\t          objProps = getAllKeys(object),\\n\",\n       \"\\t          objLength = objProps.length,\\n\",\n       \"\\t          othProps = getAllKeys(other),\\n\",\n       \"\\t          othLength = othProps.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (objLength != othLength && !isPartial) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = objLength;\\n\",\n       \"\\t      while (index--) {\\n\",\n       \"\\t        var key = objProps[index];\\n\",\n       \"\\t        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\\n\",\n       \"\\t          return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Assume cyclic values are equal.\\n\",\n       \"\\t      var stacked = stack.get(object);\\n\",\n       \"\\t      if (stacked && stack.get(other)) {\\n\",\n       \"\\t        return stacked == other;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = true;\\n\",\n       \"\\t      stack.set(object, other);\\n\",\n       \"\\t      stack.set(other, object);\\n\",\n       \"\\t\\n\",\n       \"\\t      var skipCtor = isPartial;\\n\",\n       \"\\t      while (++index < objLength) {\\n\",\n       \"\\t        key = objProps[index];\\n\",\n       \"\\t        var objValue = object[key],\\n\",\n       \"\\t            othValue = other[key];\\n\",\n       \"\\t\\n\",\n       \"\\t        if (customizer) {\\n\",\n       \"\\t          var compared = isPartial\\n\",\n       \"\\t            ? customizer(othValue, objValue, key, other, object, stack)\\n\",\n       \"\\t            : customizer(objValue, othValue, key, object, other, stack);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        // Recursively compare objects (susceptible to call stack limits).\\n\",\n       \"\\t        if (!(compared === undefined\\n\",\n       \"\\t              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\\n\",\n       \"\\t              : compared\\n\",\n       \"\\t            )) {\\n\",\n       \"\\t          result = false;\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        skipCtor || (skipCtor = key == 'constructor');\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (result && !skipCtor) {\\n\",\n       \"\\t        var objCtor = object.constructor,\\n\",\n       \"\\t            othCtor = other.constructor;\\n\",\n       \"\\t\\n\",\n       \"\\t        // Non `Object` object instances with different constructors are not equal.\\n\",\n       \"\\t        if (objCtor != othCtor &&\\n\",\n       \"\\t            ('constructor' in object && 'constructor' in other) &&\\n\",\n       \"\\t            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\\n\",\n       \"\\t              typeof othCtor == 'function' && othCtor instanceof othCtor)) {\\n\",\n       \"\\t          result = false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      stack['delete'](object);\\n\",\n       \"\\t      stack['delete'](other);\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseRest` which flattens the rest array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to apply a rest parameter to.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flatRest(func) {\\n\",\n       \"\\t      return setToString(overRest(func, undefined, flatten), func + '');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of own enumerable property names and symbols of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names and symbols.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getAllKeys(object) {\\n\",\n       \"\\t      return baseGetAllKeys(object, keys, getSymbols);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of own and inherited enumerable property names and\\n\",\n       \"\\t     * symbols of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names and symbols.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getAllKeysIn(object) {\\n\",\n       \"\\t      return baseGetAllKeys(object, keysIn, getSymbolsIn);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets metadata for `func`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to query.\\n\",\n       \"\\t     * @returns {*} Returns the metadata for `func`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var getData = !metaMap ? noop : function(func) {\\n\",\n       \"\\t      return metaMap.get(func);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the name of `func`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to query.\\n\",\n       \"\\t     * @returns {string} Returns the function name.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getFuncName(func) {\\n\",\n       \"\\t      var result = (func.name + ''),\\n\",\n       \"\\t          array = realNames[result],\\n\",\n       \"\\t          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        var data = array[length],\\n\",\n       \"\\t            otherFunc = data.func;\\n\",\n       \"\\t        if (otherFunc == null || otherFunc == func) {\\n\",\n       \"\\t          return data.name;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the argument placeholder value for `func`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to inspect.\\n\",\n       \"\\t     * @returns {*} Returns the placeholder value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getHolder(func) {\\n\",\n       \"\\t      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\\n\",\n       \"\\t      return object.placeholder;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the appropriate \\\"iteratee\\\" function. If `_.iteratee` is customized,\\n\",\n       \"\\t     * this function returns the custom method, otherwise it returns `baseIteratee`.\\n\",\n       \"\\t     * If arguments are provided, the chosen function is invoked with them and\\n\",\n       \"\\t     * its result is returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} [value] The value to convert to an iteratee.\\n\",\n       \"\\t     * @param {number} [arity] The arity of the created iteratee.\\n\",\n       \"\\t     * @returns {Function} Returns the chosen function or its result.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getIteratee() {\\n\",\n       \"\\t      var result = lodash.iteratee || iteratee;\\n\",\n       \"\\t      result = result === iteratee ? baseIteratee : result;\\n\",\n       \"\\t      return arguments.length ? result(arguments[0], arguments[1]) : result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the data for `map`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} map The map to query.\\n\",\n       \"\\t     * @param {string} key The reference key.\\n\",\n       \"\\t     * @returns {*} Returns the map data.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getMapData(map, key) {\\n\",\n       \"\\t      var data = map.__data__;\\n\",\n       \"\\t      return isKeyable(key)\\n\",\n       \"\\t        ? data[typeof key == 'string' ? 'string' : 'hash']\\n\",\n       \"\\t        : data.map;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the property names, values, and compare flags of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the match data of `object`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getMatchData(object) {\\n\",\n       \"\\t      var result = keys(object),\\n\",\n       \"\\t          length = result.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        var key = result[length],\\n\",\n       \"\\t            value = object[key];\\n\",\n       \"\\t\\n\",\n       \"\\t        result[length] = [key, value, isStrictComparable(value)];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the native function at `key` of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {string} key The key of the method to get.\\n\",\n       \"\\t     * @returns {*} Returns the function if it's native, else `undefined`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getNative(object, key) {\\n\",\n       \"\\t      var value = getValue(object, key);\\n\",\n       \"\\t      return baseIsNative(value) ? value : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to query.\\n\",\n       \"\\t     * @returns {string} Returns the raw `toStringTag`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getRawTag(value) {\\n\",\n       \"\\t      var isOwn = hasOwnProperty.call(value, symToStringTag),\\n\",\n       \"\\t          tag = value[symToStringTag];\\n\",\n       \"\\t\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        value[symToStringTag] = undefined;\\n\",\n       \"\\t        var unmasked = true;\\n\",\n       \"\\t      } catch (e) {}\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = nativeObjectToString.call(value);\\n\",\n       \"\\t      if (unmasked) {\\n\",\n       \"\\t        if (isOwn) {\\n\",\n       \"\\t          value[symToStringTag] = tag;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          delete value[symToStringTag];\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the own enumerable symbols of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of symbols.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\\n\",\n       \"\\t      if (object == null) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      object = Object(object);\\n\",\n       \"\\t      return arrayFilter(nativeGetSymbols(object), function(symbol) {\\n\",\n       \"\\t        return propertyIsEnumerable.call(object, symbol);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the own and inherited enumerable symbols of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of symbols.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t      while (object) {\\n\",\n       \"\\t        arrayPush(result, getSymbols(object));\\n\",\n       \"\\t        object = getPrototype(object);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the `toStringTag` of `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to query.\\n\",\n       \"\\t     * @returns {string} Returns the `toStringTag`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var getTag = baseGetTag;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\\n\",\n       \"\\t    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\\n\",\n       \"\\t        (Map && getTag(new Map) != mapTag) ||\\n\",\n       \"\\t        (Promise && getTag(Promise.resolve()) != promiseTag) ||\\n\",\n       \"\\t        (Set && getTag(new Set) != setTag) ||\\n\",\n       \"\\t        (WeakMap && getTag(new WeakMap) != weakMapTag)) {\\n\",\n       \"\\t      getTag = function(value) {\\n\",\n       \"\\t        var result = baseGetTag(value),\\n\",\n       \"\\t            Ctor = result == objectTag ? value.constructor : undefined,\\n\",\n       \"\\t            ctorString = Ctor ? toSource(Ctor) : '';\\n\",\n       \"\\t\\n\",\n       \"\\t        if (ctorString) {\\n\",\n       \"\\t          switch (ctorString) {\\n\",\n       \"\\t            case dataViewCtorString: return dataViewTag;\\n\",\n       \"\\t            case mapCtorString: return mapTag;\\n\",\n       \"\\t            case promiseCtorString: return promiseTag;\\n\",\n       \"\\t            case setCtorString: return setTag;\\n\",\n       \"\\t            case weakMapCtorString: return weakMapTag;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the view, applying any `transforms` to the `start` and `end` positions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {number} start The start of the view.\\n\",\n       \"\\t     * @param {number} end The end of the view.\\n\",\n       \"\\t     * @param {Array} transforms The transformations to apply to the view.\\n\",\n       \"\\t     * @returns {Object} Returns an object containing the `start` and `end`\\n\",\n       \"\\t     *  positions of the view.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getView(start, end, transforms) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = transforms.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var data = transforms[index],\\n\",\n       \"\\t            size = data.size;\\n\",\n       \"\\t\\n\",\n       \"\\t        switch (data.type) {\\n\",\n       \"\\t          case 'drop':      start += size; break;\\n\",\n       \"\\t          case 'dropRight': end -= size; break;\\n\",\n       \"\\t          case 'take':      end = nativeMin(end, start + size); break;\\n\",\n       \"\\t          case 'takeRight': start = nativeMax(start, end - size); break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return { 'start': start, 'end': end };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Extracts wrapper details from the `source` body comment.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} source The source to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the wrapper details.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function getWrapDetails(source) {\\n\",\n       \"\\t      var match = source.match(reWrapDetails);\\n\",\n       \"\\t      return match ? match[1].split(reSplitDetails) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `path` exists on `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path to check.\\n\",\n       \"\\t     * @param {Function} hasFunc The function to check properties.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `path` exists, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hasPath(object, path, hasFunc) {\\n\",\n       \"\\t      path = castPath(path, object);\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = path.length,\\n\",\n       \"\\t          result = false;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var key = toKey(path[index]);\\n\",\n       \"\\t        if (!(result = object != null && hasFunc(object, key))) {\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        object = object[key];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (result || ++index != length) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      length = object == null ? 0 : object.length;\\n\",\n       \"\\t      return !!length && isLength(length) && isIndex(key, length) &&\\n\",\n       \"\\t        (isArray(object) || isArguments(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Initializes an array clone.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to clone.\\n\",\n       \"\\t     * @returns {Array} Returns the initialized clone.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function initCloneArray(array) {\\n\",\n       \"\\t      var length = array.length,\\n\",\n       \"\\t          result = new array.constructor(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      // Add properties assigned by `RegExp#exec`.\\n\",\n       \"\\t      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\\n\",\n       \"\\t        result.index = array.index;\\n\",\n       \"\\t        result.input = array.input;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Initializes an object clone.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to clone.\\n\",\n       \"\\t     * @returns {Object} Returns the initialized clone.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function initCloneObject(object) {\\n\",\n       \"\\t      return (typeof object.constructor == 'function' && !isPrototype(object))\\n\",\n       \"\\t        ? baseCreate(getPrototype(object))\\n\",\n       \"\\t        : {};\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Initializes an object clone based on its `toStringTag`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This function only supports cloning values with tags of\\n\",\n       \"\\t     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to clone.\\n\",\n       \"\\t     * @param {string} tag The `toStringTag` of the object to clone.\\n\",\n       \"\\t     * @param {boolean} [isDeep] Specify a deep clone.\\n\",\n       \"\\t     * @returns {Object} Returns the initialized clone.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function initCloneByTag(object, tag, isDeep) {\\n\",\n       \"\\t      var Ctor = object.constructor;\\n\",\n       \"\\t      switch (tag) {\\n\",\n       \"\\t        case arrayBufferTag:\\n\",\n       \"\\t          return cloneArrayBuffer(object);\\n\",\n       \"\\t\\n\",\n       \"\\t        case boolTag:\\n\",\n       \"\\t        case dateTag:\\n\",\n       \"\\t          return new Ctor(+object);\\n\",\n       \"\\t\\n\",\n       \"\\t        case dataViewTag:\\n\",\n       \"\\t          return cloneDataView(object, isDeep);\\n\",\n       \"\\t\\n\",\n       \"\\t        case float32Tag: case float64Tag:\\n\",\n       \"\\t        case int8Tag: case int16Tag: case int32Tag:\\n\",\n       \"\\t        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\\n\",\n       \"\\t          return cloneTypedArray(object, isDeep);\\n\",\n       \"\\t\\n\",\n       \"\\t        case mapTag:\\n\",\n       \"\\t          return new Ctor;\\n\",\n       \"\\t\\n\",\n       \"\\t        case numberTag:\\n\",\n       \"\\t        case stringTag:\\n\",\n       \"\\t          return new Ctor(object);\\n\",\n       \"\\t\\n\",\n       \"\\t        case regexpTag:\\n\",\n       \"\\t          return cloneRegExp(object);\\n\",\n       \"\\t\\n\",\n       \"\\t        case setTag:\\n\",\n       \"\\t          return new Ctor;\\n\",\n       \"\\t\\n\",\n       \"\\t        case symbolTag:\\n\",\n       \"\\t          return cloneSymbol(object);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Inserts wrapper `details` in a comment at the top of the `source` body.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} source The source to modify.\\n\",\n       \"\\t     * @returns {Array} details The details to insert.\\n\",\n       \"\\t     * @returns {string} Returns the modified source.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function insertWrapDetails(source, details) {\\n\",\n       \"\\t      var length = details.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return source;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var lastIndex = length - 1;\\n\",\n       \"\\t      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\\n\",\n       \"\\t      details = details.join(length > 2 ? ', ' : ' ');\\n\",\n       \"\\t      return source.replace(reWrapComment, '{\\\\n/* [wrapped with ' + details + '] */\\\\n');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a flattenable `arguments` object or array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isFlattenable(value) {\\n\",\n       \"\\t      return isArray(value) || isArguments(value) ||\\n\",\n       \"\\t        !!(spreadableSymbol && value && value[spreadableSymbol]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a valid array-like index.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isIndex(value, length) {\\n\",\n       \"\\t      var type = typeof value;\\n\",\n       \"\\t      length = length == null ? MAX_SAFE_INTEGER : length;\\n\",\n       \"\\t\\n\",\n       \"\\t      return !!length &&\\n\",\n       \"\\t        (type == 'number' ||\\n\",\n       \"\\t          (type != 'symbol' && reIsUint.test(value))) &&\\n\",\n       \"\\t            (value > -1 && value % 1 == 0 && value < length);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if the given arguments are from an iteratee call.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The potential iteratee value argument.\\n\",\n       \"\\t     * @param {*} index The potential iteratee index or key argument.\\n\",\n       \"\\t     * @param {*} object The potential iteratee object argument.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isIterateeCall(value, index, object) {\\n\",\n       \"\\t      if (!isObject(object)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var type = typeof index;\\n\",\n       \"\\t      if (type == 'number'\\n\",\n       \"\\t            ? (isArrayLike(object) && isIndex(index, object.length))\\n\",\n       \"\\t            : (type == 'string' && index in object)\\n\",\n       \"\\t          ) {\\n\",\n       \"\\t        return eq(object[index], value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a property name and not a property path.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @param {Object} [object] The object to query keys on.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isKey(value, object) {\\n\",\n       \"\\t      if (isArray(value)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var type = typeof value;\\n\",\n       \"\\t      if (type == 'number' || type == 'symbol' || type == 'boolean' ||\\n\",\n       \"\\t          value == null || isSymbol(value)) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\\n\",\n       \"\\t        (object != null && value in Object(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is suitable for use as unique object key.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isKeyable(value) {\\n\",\n       \"\\t      var type = typeof value;\\n\",\n       \"\\t      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\\n\",\n       \"\\t        ? (value !== '__proto__')\\n\",\n       \"\\t        : (value === null);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `func` has a lazy counterpart.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isLaziable(func) {\\n\",\n       \"\\t      var funcName = getFuncName(func),\\n\",\n       \"\\t          other = lodash[funcName];\\n\",\n       \"\\t\\n\",\n       \"\\t      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (func === other) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var data = getData(other);\\n\",\n       \"\\t      return !!data && func === data[0];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `func` has its source masked.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `func` is masked, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isMasked(func) {\\n\",\n       \"\\t      return !!maskSrcKey && (maskSrcKey in func);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `func` is capable of being masked.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isMaskable = coreJsData ? isFunction : stubFalse;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is likely a prototype object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isPrototype(value) {\\n\",\n       \"\\t      var Ctor = value && value.constructor,\\n\",\n       \"\\t          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\\n\",\n       \"\\t\\n\",\n       \"\\t      return value === proto;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` if suitable for strict\\n\",\n       \"\\t     *  equality comparisons, else `false`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isStrictComparable(value) {\\n\",\n       \"\\t      return value === value && !isObject(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `matchesProperty` for source values suitable\\n\",\n       \"\\t     * for strict equality comparisons, i.e. `===`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} key The key of the property to get.\\n\",\n       \"\\t     * @param {*} srcValue The value to match.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function matchesStrictComparable(key, srcValue) {\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        if (object == null) {\\n\",\n       \"\\t          return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return object[key] === srcValue &&\\n\",\n       \"\\t          (srcValue !== undefined || (key in Object(object)));\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `_.memoize` which clears the memoized function's\\n\",\n       \"\\t     * cache when it exceeds `MAX_MEMOIZE_SIZE`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to have its output memoized.\\n\",\n       \"\\t     * @returns {Function} Returns the new memoized function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function memoizeCapped(func) {\\n\",\n       \"\\t      var result = memoize(func, function(key) {\\n\",\n       \"\\t        if (cache.size === MAX_MEMOIZE_SIZE) {\\n\",\n       \"\\t          cache.clear();\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return key;\\n\",\n       \"\\t      });\\n\",\n       \"\\t\\n\",\n       \"\\t      var cache = result.cache;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Merges the function metadata of `source` into `data`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Merging metadata reduces the number of wrappers used to invoke a function.\\n\",\n       \"\\t     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\\n\",\n       \"\\t     * may be applied regardless of execution order. Methods like `_.ary` and\\n\",\n       \"\\t     * `_.rearg` modify function arguments, making the order in which they are\\n\",\n       \"\\t     * executed important, preventing the merging of metadata. However, we make\\n\",\n       \"\\t     * an exception for a safe combined case where curried functions have `_.ary`\\n\",\n       \"\\t     * and or `_.rearg` applied.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} data The destination metadata.\\n\",\n       \"\\t     * @param {Array} source The source metadata.\\n\",\n       \"\\t     * @returns {Array} Returns `data`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mergeData(data, source) {\\n\",\n       \"\\t      var bitmask = data[1],\\n\",\n       \"\\t          srcBitmask = source[1],\\n\",\n       \"\\t          newBitmask = bitmask | srcBitmask,\\n\",\n       \"\\t          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\\n\",\n       \"\\t\\n\",\n       \"\\t      var isCombo =\\n\",\n       \"\\t        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\\n\",\n       \"\\t        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\\n\",\n       \"\\t        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\\n\",\n       \"\\t\\n\",\n       \"\\t      // Exit early if metadata can't be merged.\\n\",\n       \"\\t      if (!(isCommon || isCombo)) {\\n\",\n       \"\\t        return data;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Use source `thisArg` if available.\\n\",\n       \"\\t      if (srcBitmask & WRAP_BIND_FLAG) {\\n\",\n       \"\\t        data[2] = source[2];\\n\",\n       \"\\t        // Set when currying a bound function.\\n\",\n       \"\\t        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Compose partial arguments.\\n\",\n       \"\\t      var value = source[3];\\n\",\n       \"\\t      if (value) {\\n\",\n       \"\\t        var partials = data[3];\\n\",\n       \"\\t        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\\n\",\n       \"\\t        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Compose partial right arguments.\\n\",\n       \"\\t      value = source[5];\\n\",\n       \"\\t      if (value) {\\n\",\n       \"\\t        partials = data[5];\\n\",\n       \"\\t        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\\n\",\n       \"\\t        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Use source `argPos` if available.\\n\",\n       \"\\t      value = source[7];\\n\",\n       \"\\t      if (value) {\\n\",\n       \"\\t        data[7] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Use source `ary` if it's smaller.\\n\",\n       \"\\t      if (srcBitmask & WRAP_ARY_FLAG) {\\n\",\n       \"\\t        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Use source `arity` if one is not provided.\\n\",\n       \"\\t      if (data[9] == null) {\\n\",\n       \"\\t        data[9] = source[9];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Use source `func` and merge bitmasks.\\n\",\n       \"\\t      data[0] = source[0];\\n\",\n       \"\\t      data[1] = newBitmask;\\n\",\n       \"\\t\\n\",\n       \"\\t      return data;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This function is like\\n\",\n       \"\\t     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\\n\",\n       \"\\t     * except that it includes inherited enumerable properties.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function nativeKeysIn(object) {\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t      if (object != null) {\\n\",\n       \"\\t        for (var key in Object(object)) {\\n\",\n       \"\\t          result.push(key);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a string using `Object.prototype.toString`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {string} Returns the converted string.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function objectToString(value) {\\n\",\n       \"\\t      return nativeObjectToString.call(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `baseRest` which transforms the rest array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to apply a rest parameter to.\\n\",\n       \"\\t     * @param {number} [start=func.length-1] The start position of the rest parameter.\\n\",\n       \"\\t     * @param {Function} transform The rest array transform.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function overRest(func, start, transform) {\\n\",\n       \"\\t      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        var args = arguments,\\n\",\n       \"\\t            index = -1,\\n\",\n       \"\\t            length = nativeMax(args.length - start, 0),\\n\",\n       \"\\t            array = Array(length);\\n\",\n       \"\\t\\n\",\n       \"\\t        while (++index < length) {\\n\",\n       \"\\t          array[index] = args[start + index];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        index = -1;\\n\",\n       \"\\t        var otherArgs = Array(start + 1);\\n\",\n       \"\\t        while (++index < start) {\\n\",\n       \"\\t          otherArgs[index] = args[index];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        otherArgs[start] = transform(array);\\n\",\n       \"\\t        return apply(func, this, otherArgs);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the parent value at `path` of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array} path The path to get the parent value of.\\n\",\n       \"\\t     * @returns {*} Returns the parent value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function parent(object, path) {\\n\",\n       \"\\t      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Reorder `array` according to the specified indexes where the element at\\n\",\n       \"\\t     * the first index is assigned as the first element, the element at\\n\",\n       \"\\t     * the second index is assigned as the second element, and so on.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to reorder.\\n\",\n       \"\\t     * @param {Array} indexes The arranged array indexes.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function reorder(array, indexes) {\\n\",\n       \"\\t      var arrLength = array.length,\\n\",\n       \"\\t          length = nativeMin(indexes.length, arrLength),\\n\",\n       \"\\t          oldArray = copyArray(array);\\n\",\n       \"\\t\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        var index = indexes[length];\\n\",\n       \"\\t        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the value at `key`, unless `key` is \\\"__proto__\\\".\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {string} key The key of the property to get.\\n\",\n       \"\\t     * @returns {*} Returns the property value.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function safeGet(object, key) {\\n\",\n       \"\\t      if (key == '__proto__') {\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return object[key];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets metadata for `func`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\\n\",\n       \"\\t     * period of time, it will trip its breaker and transition to an identity\\n\",\n       \"\\t     * function to avoid garbage collection pauses in V8. See\\n\",\n       \"\\t     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\\n\",\n       \"\\t     * for more details.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to associate metadata with.\\n\",\n       \"\\t     * @param {*} data The metadata.\\n\",\n       \"\\t     * @returns {Function} Returns `func`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var setData = shortOut(baseSetData);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to delay.\\n\",\n       \"\\t     * @param {number} wait The number of milliseconds to delay invocation.\\n\",\n       \"\\t     * @returns {number|Object} Returns the timer id or timeout object.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var setTimeout = ctxSetTimeout || function(func, wait) {\\n\",\n       \"\\t      return root.setTimeout(func, wait);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the `toString` method of `func` to return `string`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to modify.\\n\",\n       \"\\t     * @param {Function} string The `toString` result.\\n\",\n       \"\\t     * @returns {Function} Returns `func`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var setToString = shortOut(baseSetToString);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\\n\",\n       \"\\t     * with wrapper details in a comment at the top of the source body.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} wrapper The function to modify.\\n\",\n       \"\\t     * @param {Function} reference The reference function.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @returns {Function} Returns `wrapper`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function setWrapToString(wrapper, reference, bitmask) {\\n\",\n       \"\\t      var source = (reference + '');\\n\",\n       \"\\t      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that'll short out and invoke `identity` instead\\n\",\n       \"\\t     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\\n\",\n       \"\\t     * milliseconds.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to restrict.\\n\",\n       \"\\t     * @returns {Function} Returns the new shortable function.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function shortOut(func) {\\n\",\n       \"\\t      var count = 0,\\n\",\n       \"\\t          lastCalled = 0;\\n\",\n       \"\\t\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        var stamp = nativeNow(),\\n\",\n       \"\\t            remaining = HOT_SPAN - (stamp - lastCalled);\\n\",\n       \"\\t\\n\",\n       \"\\t        lastCalled = stamp;\\n\",\n       \"\\t        if (remaining > 0) {\\n\",\n       \"\\t          if (++count >= HOT_COUNT) {\\n\",\n       \"\\t            return arguments[0];\\n\",\n       \"\\t          }\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          count = 0;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return func.apply(undefined, arguments);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Array} array The array to shuffle.\\n\",\n       \"\\t     * @param {number} [size=array.length] The size of `array`.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function shuffleSelf(array, size) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = array.length,\\n\",\n       \"\\t          lastIndex = length - 1;\\n\",\n       \"\\t\\n\",\n       \"\\t      size = size === undefined ? length : size;\\n\",\n       \"\\t      while (++index < size) {\\n\",\n       \"\\t        var rand = baseRandom(index, lastIndex),\\n\",\n       \"\\t            value = array[rand];\\n\",\n       \"\\t\\n\",\n       \"\\t        array[rand] = array[index];\\n\",\n       \"\\t        array[index] = value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      array.length = size;\\n\",\n       \"\\t      return array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string` to a property path array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {string} string The string to convert.\\n\",\n       \"\\t     * @returns {Array} Returns the property path array.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var stringToPath = memoizeCapped(function(string) {\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t      if (string.charCodeAt(0) === 46 /* . */) {\\n\",\n       \"\\t        result.push('');\\n\",\n       \"\\t      }\\n\",\n       \"\\t      string.replace(rePropName, function(match, number, quote, subString) {\\n\",\n       \"\\t        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a string key if it's not a string or symbol.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {*} value The value to inspect.\\n\",\n       \"\\t     * @returns {string|symbol} Returns the key.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toKey(value) {\\n\",\n       \"\\t      if (typeof value == 'string' || isSymbol(value)) {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = (value + '');\\n\",\n       \"\\t      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `func` to its source code.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Function} func The function to convert.\\n\",\n       \"\\t     * @returns {string} Returns the source code.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toSource(func) {\\n\",\n       \"\\t      if (func != null) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          return funcToString.call(func);\\n\",\n       \"\\t        } catch (e) {}\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          return (func + '');\\n\",\n       \"\\t        } catch (e) {}\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return '';\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Updates wrapper `details` based on `bitmask` flags.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @returns {Array} details The details to modify.\\n\",\n       \"\\t     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\\n\",\n       \"\\t     * @returns {Array} Returns `details`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function updateWrapDetails(details, bitmask) {\\n\",\n       \"\\t      arrayEach(wrapFlags, function(pair) {\\n\",\n       \"\\t        var value = '_.' + pair[0];\\n\",\n       \"\\t        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\\n\",\n       \"\\t          details.push(value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return details.sort();\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of `wrapper`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @private\\n\",\n       \"\\t     * @param {Object} wrapper The wrapper to clone.\\n\",\n       \"\\t     * @returns {Object} Returns the cloned wrapper.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperClone(wrapper) {\\n\",\n       \"\\t      if (wrapper instanceof LazyWrapper) {\\n\",\n       \"\\t        return wrapper.clone();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\\n\",\n       \"\\t      result.__actions__ = copyArray(wrapper.__actions__);\\n\",\n       \"\\t      result.__index__  = wrapper.__index__;\\n\",\n       \"\\t      result.__values__ = wrapper.__values__;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of elements split into groups the length of `size`.\\n\",\n       \"\\t     * If `array` can't be split evenly, the final chunk will be the remaining\\n\",\n       \"\\t     * elements.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to process.\\n\",\n       \"\\t     * @param {number} [size=1] The length of each chunk\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of chunks.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.chunk(['a', 'b', 'c', 'd'], 2);\\n\",\n       \"\\t     * // => [['a', 'b'], ['c', 'd']]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.chunk(['a', 'b', 'c', 'd'], 3);\\n\",\n       \"\\t     * // => [['a', 'b', 'c'], ['d']]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function chunk(array, size, guard) {\\n\",\n       \"\\t      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\\n\",\n       \"\\t        size = 1;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        size = nativeMax(toInteger(size), 0);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length || size < 1) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = 0,\\n\",\n       \"\\t          resIndex = 0,\\n\",\n       \"\\t          result = Array(nativeCeil(length / size));\\n\",\n       \"\\t\\n\",\n       \"\\t      while (index < length) {\\n\",\n       \"\\t        result[resIndex++] = baseSlice(array, index, (index += size));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array with all falsey values removed. The values `false`, `null`,\\n\",\n       \"\\t     * `0`, `\\\"\\\"`, `undefined`, and `NaN` are falsey.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to compact.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.compact([0, 1, false, 2, '', 3]);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function compact(array) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = array == null ? 0 : array.length,\\n\",\n       \"\\t          resIndex = 0,\\n\",\n       \"\\t          result = [];\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index];\\n\",\n       \"\\t        if (value) {\\n\",\n       \"\\t          result[resIndex++] = value;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a new array concatenating `array` with any additional arrays\\n\",\n       \"\\t     * and/or values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to concatenate.\\n\",\n       \"\\t     * @param {...*} [values] The values to concatenate.\\n\",\n       \"\\t     * @returns {Array} Returns the new concatenated array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1];\\n\",\n       \"\\t     * var other = _.concat(array, 2, [3], [[4]]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(other);\\n\",\n       \"\\t     * // => [1, 2, 3, [4]]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function concat() {\\n\",\n       \"\\t      var length = arguments.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var args = Array(length - 1),\\n\",\n       \"\\t          array = arguments[0],\\n\",\n       \"\\t          index = length;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (index--) {\\n\",\n       \"\\t        args[index - 1] = arguments[index];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of `array` values not included in the other given arrays\\n\",\n       \"\\t     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons. The order and references of result values are\\n\",\n       \"\\t     * determined by the first array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.pullAll`, this method returns a new array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {...Array} [values] The values to exclude.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @see _.without, _.xor\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.difference([2, 1], [2, 3]);\\n\",\n       \"\\t     * // => [1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var difference = baseRest(function(array, values) {\\n\",\n       \"\\t      return isArrayLikeObject(array)\\n\",\n       \"\\t        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.difference` except that it accepts `iteratee` which\\n\",\n       \"\\t     * is invoked for each element of `array` and `values` to generate the criterion\\n\",\n       \"\\t     * by which they're compared. The order and references of result values are\\n\",\n       \"\\t     * determined by the first array. The iteratee is invoked with one argument:\\n\",\n       \"\\t     * (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {...Array} [values] The values to exclude.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\\n\",\n       \"\\t     * // => [1.2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\\n\",\n       \"\\t     * // => [{ 'x': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var differenceBy = baseRest(function(array, values) {\\n\",\n       \"\\t      var iteratee = last(values);\\n\",\n       \"\\t      if (isArrayLikeObject(iteratee)) {\\n\",\n       \"\\t        iteratee = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return isArrayLikeObject(array)\\n\",\n       \"\\t        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.difference` except that it accepts `comparator`\\n\",\n       \"\\t     * which is invoked to compare elements of `array` to `values`. The order and\\n\",\n       \"\\t     * references of result values are determined by the first array. The comparator\\n\",\n       \"\\t     * is invoked with two arguments: (arrVal, othVal).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {...Array} [values] The values to exclude.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\\n\",\n       \"\\t     * // => [{ 'x': 2, 'y': 1 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var differenceWith = baseRest(function(array, values) {\\n\",\n       \"\\t      var comparator = last(values);\\n\",\n       \"\\t      if (isArrayLikeObject(comparator)) {\\n\",\n       \"\\t        comparator = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return isArrayLikeObject(array)\\n\",\n       \"\\t        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` with `n` elements dropped from the beginning.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.5.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {number} [n=1] The number of elements to drop.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.drop([1, 2, 3]);\\n\",\n       \"\\t     * // => [2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.drop([1, 2, 3], 2);\\n\",\n       \"\\t     * // => [3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.drop([1, 2, 3], 5);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.drop([1, 2, 3], 0);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function drop(array, n, guard) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n = (guard || n === undefined) ? 1 : toInteger(n);\\n\",\n       \"\\t      return baseSlice(array, n < 0 ? 0 : n, length);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` with `n` elements dropped from the end.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {number} [n=1] The number of elements to drop.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.dropRight([1, 2, 3]);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.dropRight([1, 2, 3], 2);\\n\",\n       \"\\t     * // => [1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.dropRight([1, 2, 3], 5);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.dropRight([1, 2, 3], 0);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function dropRight(array, n, guard) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n = (guard || n === undefined) ? 1 : toInteger(n);\\n\",\n       \"\\t      n = length - n;\\n\",\n       \"\\t      return baseSlice(array, 0, n < 0 ? 0 : n);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` excluding elements dropped from the end.\\n\",\n       \"\\t     * Elements are dropped until `predicate` returns falsey. The predicate is\\n\",\n       \"\\t     * invoked with three arguments: (value, index, array).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',    'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.dropRightWhile(users, function(o) { return !o.active; });\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\\n\",\n       \"\\t     * // => objects for ['barney', 'fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.dropRightWhile(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.dropRightWhile(users, 'active');\\n\",\n       \"\\t     * // => objects for ['barney', 'fred', 'pebbles']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function dropRightWhile(array, predicate) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseWhile(array, getIteratee(predicate, 3), true, true)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` excluding elements dropped from the beginning.\\n\",\n       \"\\t     * Elements are dropped until `predicate` returns falsey. The predicate is\\n\",\n       \"\\t     * invoked with three arguments: (value, index, array).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'active': false },\\n\",\n       \"\\t     *   { 'user': 'fred',    'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'active': true }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.dropWhile(users, function(o) { return !o.active; });\\n\",\n       \"\\t     * // => objects for ['pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.dropWhile(users, { 'user': 'barney', 'active': false });\\n\",\n       \"\\t     * // => objects for ['fred', 'pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.dropWhile(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for ['pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.dropWhile(users, 'active');\\n\",\n       \"\\t     * // => objects for ['barney', 'fred', 'pebbles']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function dropWhile(array, predicate) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseWhile(array, getIteratee(predicate, 3), true)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Fills elements of `array` with `value` from `start` up to, but not\\n\",\n       \"\\t     * including, `end`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.2.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to fill.\\n\",\n       \"\\t     * @param {*} value The value to fill `array` with.\\n\",\n       \"\\t     * @param {number} [start=0] The start position.\\n\",\n       \"\\t     * @param {number} [end=array.length] The end position.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, 2, 3];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.fill(array, 'a');\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => ['a', 'a', 'a']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.fill(Array(3), 2);\\n\",\n       \"\\t     * // => [2, 2, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.fill([4, 6, 8, 10], '*', 1, 3);\\n\",\n       \"\\t     * // => [4, '*', '*', 10]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function fill(array, value, start, end) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\\n\",\n       \"\\t        start = 0;\\n\",\n       \"\\t        end = length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseFill(array, value, start, end);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.find` except that it returns the index of the first\\n\",\n       \"\\t     * element `predicate` returns truthy for instead of the element itself.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {number} [fromIndex=0] The index to search from.\\n\",\n       \"\\t     * @returns {number} Returns the index of the found element, else `-1`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'active': false },\\n\",\n       \"\\t     *   { 'user': 'fred',    'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'active': true }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.findIndex(users, function(o) { return o.user == 'barney'; });\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.findIndex(users, { 'user': 'fred', 'active': false });\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.findIndex(users, ['active', false]);\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.findIndex(users, 'active');\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function findIndex(array, predicate, fromIndex) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return -1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = fromIndex == null ? 0 : toInteger(fromIndex);\\n\",\n       \"\\t      if (index < 0) {\\n\",\n       \"\\t        index = nativeMax(length + index, 0);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseFindIndex(array, getIteratee(predicate, 3), index);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.findIndex` except that it iterates over elements\\n\",\n       \"\\t     * of `collection` from right to left.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {number} [fromIndex=array.length-1] The index to search from.\\n\",\n       \"\\t     * @returns {number} Returns the index of the found element, else `-1`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',    'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.findLastIndex(users, { 'user': 'barney', 'active': true });\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.findLastIndex(users, ['active', false]);\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.findLastIndex(users, 'active');\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function findLastIndex(array, predicate, fromIndex) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return -1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = length - 1;\\n\",\n       \"\\t      if (fromIndex !== undefined) {\\n\",\n       \"\\t        index = toInteger(fromIndex);\\n\",\n       \"\\t        index = fromIndex < 0\\n\",\n       \"\\t          ? nativeMax(length + index, 0)\\n\",\n       \"\\t          : nativeMin(index, length - 1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseFindIndex(array, getIteratee(predicate, 3), index, true);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Flattens `array` a single level deep.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to flatten.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flatten([1, [2, [3, [4]], 5]]);\\n\",\n       \"\\t     * // => [1, 2, [3, [4]], 5]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flatten(array) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      return length ? baseFlatten(array, 1) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Recursively flattens `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to flatten.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flattenDeep([1, [2, [3, [4]], 5]]);\\n\",\n       \"\\t     * // => [1, 2, 3, 4, 5]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flattenDeep(array) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      return length ? baseFlatten(array, INFINITY) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Recursively flatten `array` up to `depth` times.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.4.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to flatten.\\n\",\n       \"\\t     * @param {number} [depth=1] The maximum recursion depth.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, [2, [3, [4]], 5]];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flattenDepth(array, 1);\\n\",\n       \"\\t     * // => [1, 2, [3, [4]], 5]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flattenDepth(array, 2);\\n\",\n       \"\\t     * // => [1, 2, 3, [4], 5]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flattenDepth(array, depth) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      depth = depth === undefined ? 1 : toInteger(depth);\\n\",\n       \"\\t      return baseFlatten(array, depth);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The inverse of `_.toPairs`; this method returns an object composed\\n\",\n       \"\\t     * from key-value `pairs`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} pairs The key-value pairs.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.fromPairs([['a', 1], ['b', 2]]);\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function fromPairs(pairs) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = pairs == null ? 0 : pairs.length,\\n\",\n       \"\\t          result = {};\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var pair = pairs[index];\\n\",\n       \"\\t        result[pair[0]] = pair[1];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the first element of `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @alias first\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @returns {*} Returns the first element of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.head([1, 2, 3]);\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.head([]);\\n\",\n       \"\\t     * // => undefined\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function head(array) {\\n\",\n       \"\\t      return (array && array.length) ? array[0] : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the index at which the first occurrence of `value` is found in `array`\\n\",\n       \"\\t     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons. If `fromIndex` is negative, it's used as the\\n\",\n       \"\\t     * offset from the end of `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to search for.\\n\",\n       \"\\t     * @param {number} [fromIndex=0] The index to search from.\\n\",\n       \"\\t     * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.indexOf([1, 2, 1, 2], 2);\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Search from the `fromIndex`.\\n\",\n       \"\\t     * _.indexOf([1, 2, 1, 2], 2, 2);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function indexOf(array, value, fromIndex) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return -1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = fromIndex == null ? 0 : toInteger(fromIndex);\\n\",\n       \"\\t      if (index < 0) {\\n\",\n       \"\\t        index = nativeMax(length + index, 0);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseIndexOf(array, value, index);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets all but the last element of `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.initial([1, 2, 3]);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function initial(array) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      return length ? baseSlice(array, 0, -1) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of unique values that are included in all given arrays\\n\",\n       \"\\t     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons. The order and references of result values are\\n\",\n       \"\\t     * determined by the first array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of intersecting values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.intersection([2, 1], [2, 3]);\\n\",\n       \"\\t     * // => [2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var intersection = baseRest(function(arrays) {\\n\",\n       \"\\t      var mapped = arrayMap(arrays, castArrayLikeObject);\\n\",\n       \"\\t      return (mapped.length && mapped[0] === arrays[0])\\n\",\n       \"\\t        ? baseIntersection(mapped)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.intersection` except that it accepts `iteratee`\\n\",\n       \"\\t     * which is invoked for each element of each `arrays` to generate the criterion\\n\",\n       \"\\t     * by which they're compared. The order and references of result values are\\n\",\n       \"\\t     * determined by the first array. The iteratee is invoked with one argument:\\n\",\n       \"\\t     * (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of intersecting values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\\n\",\n       \"\\t     * // => [2.1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\\n\",\n       \"\\t     * // => [{ 'x': 1 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var intersectionBy = baseRest(function(arrays) {\\n\",\n       \"\\t      var iteratee = last(arrays),\\n\",\n       \"\\t          mapped = arrayMap(arrays, castArrayLikeObject);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (iteratee === last(mapped)) {\\n\",\n       \"\\t        iteratee = undefined;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        mapped.pop();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return (mapped.length && mapped[0] === arrays[0])\\n\",\n       \"\\t        ? baseIntersection(mapped, getIteratee(iteratee, 2))\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.intersection` except that it accepts `comparator`\\n\",\n       \"\\t     * which is invoked to compare elements of `arrays`. The order and references\\n\",\n       \"\\t     * of result values are determined by the first array. The comparator is\\n\",\n       \"\\t     * invoked with two arguments: (arrVal, othVal).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of intersecting values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\\n\",\n       \"\\t     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.intersectionWith(objects, others, _.isEqual);\\n\",\n       \"\\t     * // => [{ 'x': 1, 'y': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var intersectionWith = baseRest(function(arrays) {\\n\",\n       \"\\t      var comparator = last(arrays),\\n\",\n       \"\\t          mapped = arrayMap(arrays, castArrayLikeObject);\\n\",\n       \"\\t\\n\",\n       \"\\t      comparator = typeof comparator == 'function' ? comparator : undefined;\\n\",\n       \"\\t      if (comparator) {\\n\",\n       \"\\t        mapped.pop();\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return (mapped.length && mapped[0] === arrays[0])\\n\",\n       \"\\t        ? baseIntersection(mapped, undefined, comparator)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts all elements in `array` into a string separated by `separator`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to convert.\\n\",\n       \"\\t     * @param {string} [separator=','] The element separator.\\n\",\n       \"\\t     * @returns {string} Returns the joined string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.join(['a', 'b', 'c'], '~');\\n\",\n       \"\\t     * // => 'a~b~c'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function join(array, separator) {\\n\",\n       \"\\t      return array == null ? '' : nativeJoin.call(array, separator);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the last element of `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @returns {*} Returns the last element of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.last([1, 2, 3]);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function last(array) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      return length ? array[length - 1] : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.indexOf` except that it iterates over elements of\\n\",\n       \"\\t     * `array` from right to left.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to search for.\\n\",\n       \"\\t     * @param {number} [fromIndex=array.length-1] The index to search from.\\n\",\n       \"\\t     * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lastIndexOf([1, 2, 1, 2], 2);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Search from the `fromIndex`.\\n\",\n       \"\\t     * _.lastIndexOf([1, 2, 1, 2], 2, 2);\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function lastIndexOf(array, value, fromIndex) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return -1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = length;\\n\",\n       \"\\t      if (fromIndex !== undefined) {\\n\",\n       \"\\t        index = toInteger(fromIndex);\\n\",\n       \"\\t        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return value === value\\n\",\n       \"\\t        ? strictLastIndexOf(array, value, index)\\n\",\n       \"\\t        : baseFindIndex(array, baseIsNaN, index, true);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the element at index `n` of `array`. If `n` is negative, the nth\\n\",\n       \"\\t     * element from the end is returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.11.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {number} [n=0] The index of the element to return.\\n\",\n       \"\\t     * @returns {*} Returns the nth element of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = ['a', 'b', 'c', 'd'];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.nth(array, 1);\\n\",\n       \"\\t     * // => 'b'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.nth(array, -2);\\n\",\n       \"\\t     * // => 'c';\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function nth(array, n) {\\n\",\n       \"\\t      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes all given values from `array` using\\n\",\n       \"\\t     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\\n\",\n       \"\\t     * to remove elements from an array by predicate.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {...*} [values] The values to remove.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pull(array, 'a', 'c');\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => ['b', 'b']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var pull = baseRest(pullAll);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.pull` except that it accepts an array of values to remove.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.difference`, this method mutates `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {Array} values The values to remove.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pullAll(array, ['a', 'c']);\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => ['b', 'b']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function pullAll(array, values) {\\n\",\n       \"\\t      return (array && array.length && values && values.length)\\n\",\n       \"\\t        ? basePullAll(array, values)\\n\",\n       \"\\t        : array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.pullAll` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element of `array` and `values` to generate the criterion\\n\",\n       \"\\t     * by which they're compared. The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {Array} values The values to remove.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [{ 'x': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function pullAllBy(array, values, iteratee) {\\n\",\n       \"\\t      return (array && array.length && values && values.length)\\n\",\n       \"\\t        ? basePullAll(array, values, getIteratee(iteratee, 2))\\n\",\n       \"\\t        : array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.pullAll` except that it accepts `comparator` which\\n\",\n       \"\\t     * is invoked to compare elements of `array` to `values`. The comparator is\\n\",\n       \"\\t     * invoked with two arguments: (arrVal, othVal).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.6.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {Array} values The values to remove.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function pullAllWith(array, values, comparator) {\\n\",\n       \"\\t      return (array && array.length && values && values.length)\\n\",\n       \"\\t        ? basePullAll(array, values, undefined, comparator)\\n\",\n       \"\\t        : array;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes elements from `array` corresponding to `indexes` and returns an\\n\",\n       \"\\t     * array of removed elements.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.at`, this method mutates `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {...(number|number[])} [indexes] The indexes of elements to remove.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of removed elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = ['a', 'b', 'c', 'd'];\\n\",\n       \"\\t     * var pulled = _.pullAt(array, [1, 3]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => ['a', 'c']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(pulled);\\n\",\n       \"\\t     * // => ['b', 'd']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var pullAt = flatRest(function(array, indexes) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length,\\n\",\n       \"\\t          result = baseAt(array, indexes);\\n\",\n       \"\\t\\n\",\n       \"\\t      basePullAt(array, arrayMap(indexes, function(index) {\\n\",\n       \"\\t        return isIndex(index, length) ? +index : index;\\n\",\n       \"\\t      }).sort(compareAscending));\\n\",\n       \"\\t\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes all elements from `array` that `predicate` returns truthy for\\n\",\n       \"\\t     * and returns an array of the removed elements. The predicate is invoked\\n\",\n       \"\\t     * with three arguments: (value, index, array).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\\n\",\n       \"\\t     * to pull elements from an array by value.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of removed elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, 2, 3, 4];\\n\",\n       \"\\t     * var evens = _.remove(array, function(n) {\\n\",\n       \"\\t     *   return n % 2 == 0;\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [1, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(evens);\\n\",\n       \"\\t     * // => [2, 4]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function remove(array, predicate) {\\n\",\n       \"\\t      var result = [];\\n\",\n       \"\\t      if (!(array && array.length)) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          indexes = [],\\n\",\n       \"\\t          length = array.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      predicate = getIteratee(predicate, 3);\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = array[index];\\n\",\n       \"\\t        if (predicate(value, index, array)) {\\n\",\n       \"\\t          result.push(value);\\n\",\n       \"\\t          indexes.push(index);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      basePullAt(array, indexes);\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Reverses `array` so that the first element becomes the last, the second\\n\",\n       \"\\t     * element becomes the second to last, and so on.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `array` and is based on\\n\",\n       \"\\t     * [`Array#reverse`](https://mdn.io/Array/reverse).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to modify.\\n\",\n       \"\\t     * @returns {Array} Returns `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, 2, 3];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.reverse(array);\\n\",\n       \"\\t     * // => [3, 2, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [3, 2, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function reverse(array) {\\n\",\n       \"\\t      return array == null ? array : nativeReverse.call(array);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` from `start` up to, but not including, `end`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is used instead of\\n\",\n       \"\\t     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\\n\",\n       \"\\t     * returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to slice.\\n\",\n       \"\\t     * @param {number} [start=0] The start position.\\n\",\n       \"\\t     * @param {number} [end=array.length] The end position.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function slice(array, start, end) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\\n\",\n       \"\\t        start = 0;\\n\",\n       \"\\t        end = length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      else {\\n\",\n       \"\\t        start = start == null ? 0 : toInteger(start);\\n\",\n       \"\\t        end = end === undefined ? length : toInteger(end);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseSlice(array, start, end);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Uses a binary search to determine the lowest index at which `value`\\n\",\n       \"\\t     * should be inserted into `array` in order to maintain its sort order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The sorted array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to evaluate.\\n\",\n       \"\\t     * @returns {number} Returns the index at which `value` should be inserted\\n\",\n       \"\\t     *  into `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedIndex([30, 50], 40);\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedIndex(array, value) {\\n\",\n       \"\\t      return baseSortedIndex(array, value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.sortedIndex` except that it accepts `iteratee`\\n\",\n       \"\\t     * which is invoked for `value` and each element of `array` to compute their\\n\",\n       \"\\t     * sort ranking. The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The sorted array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to evaluate.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {number} Returns the index at which `value` should be inserted\\n\",\n       \"\\t     *  into `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 4 }, { 'x': 5 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedIndexBy(array, value, iteratee) {\\n\",\n       \"\\t      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.indexOf` except that it performs a binary\\n\",\n       \"\\t     * search on a sorted `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to search for.\\n\",\n       \"\\t     * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedIndexOf(array, value) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (length) {\\n\",\n       \"\\t        var index = baseSortedIndex(array, value);\\n\",\n       \"\\t        if (index < length && eq(array[index], value)) {\\n\",\n       \"\\t          return index;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.sortedIndex` except that it returns the highest\\n\",\n       \"\\t     * index at which `value` should be inserted into `array` in order to\\n\",\n       \"\\t     * maintain its sort order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The sorted array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to evaluate.\\n\",\n       \"\\t     * @returns {number} Returns the index at which `value` should be inserted\\n\",\n       \"\\t     *  into `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\\n\",\n       \"\\t     * // => 4\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedLastIndex(array, value) {\\n\",\n       \"\\t      return baseSortedIndex(array, value, true);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\\n\",\n       \"\\t     * which is invoked for `value` and each element of `array` to compute their\\n\",\n       \"\\t     * sort ranking. The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The sorted array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to evaluate.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {number} Returns the index at which `value` should be inserted\\n\",\n       \"\\t     *  into `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 4 }, { 'x': 5 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedLastIndexBy(array, value, iteratee) {\\n\",\n       \"\\t      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.lastIndexOf` except that it performs a binary\\n\",\n       \"\\t     * search on a sorted `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {*} value The value to search for.\\n\",\n       \"\\t     * @returns {number} Returns the index of the matched value, else `-1`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedLastIndexOf(array, value) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (length) {\\n\",\n       \"\\t        var index = baseSortedIndex(array, value, true) - 1;\\n\",\n       \"\\t        if (eq(array[index], value)) {\\n\",\n       \"\\t          return index;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return -1;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.uniq` except that it's designed and optimized\\n\",\n       \"\\t     * for sorted arrays.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedUniq([1, 1, 2]);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedUniq(array) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseSortedUniq(array)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.uniqBy` except that it's designed and optimized\\n\",\n       \"\\t     * for sorted arrays.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\\n\",\n       \"\\t     * // => [1.1, 2.3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sortedUniqBy(array, iteratee) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseSortedUniq(array, getIteratee(iteratee, 2))\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets all but the first element of `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.tail([1, 2, 3]);\\n\",\n       \"\\t     * // => [2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function tail(array) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      return length ? baseSlice(array, 1, length) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` with `n` elements taken from the beginning.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {number} [n=1] The number of elements to take.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.take([1, 2, 3]);\\n\",\n       \"\\t     * // => [1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.take([1, 2, 3], 2);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.take([1, 2, 3], 5);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.take([1, 2, 3], 0);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function take(array, n, guard) {\\n\",\n       \"\\t      if (!(array && array.length)) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n = (guard || n === undefined) ? 1 : toInteger(n);\\n\",\n       \"\\t      return baseSlice(array, 0, n < 0 ? 0 : n);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` with `n` elements taken from the end.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {number} [n=1] The number of elements to take.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.takeRight([1, 2, 3]);\\n\",\n       \"\\t     * // => [3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.takeRight([1, 2, 3], 2);\\n\",\n       \"\\t     * // => [2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.takeRight([1, 2, 3], 5);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.takeRight([1, 2, 3], 0);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function takeRight(array, n, guard) {\\n\",\n       \"\\t      var length = array == null ? 0 : array.length;\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n = (guard || n === undefined) ? 1 : toInteger(n);\\n\",\n       \"\\t      n = length - n;\\n\",\n       \"\\t      return baseSlice(array, n < 0 ? 0 : n, length);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` with elements taken from the end. Elements are\\n\",\n       \"\\t     * taken until `predicate` returns falsey. The predicate is invoked with\\n\",\n       \"\\t     * three arguments: (value, index, array).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',    'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.takeRightWhile(users, function(o) { return !o.active; });\\n\",\n       \"\\t     * // => objects for ['fred', 'pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\\n\",\n       \"\\t     * // => objects for ['pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.takeRightWhile(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for ['fred', 'pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.takeRightWhile(users, 'active');\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function takeRightWhile(array, predicate) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseWhile(array, getIteratee(predicate, 3), false, true)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a slice of `array` with elements taken from the beginning. Elements\\n\",\n       \"\\t     * are taken until `predicate` returns falsey. The predicate is invoked with\\n\",\n       \"\\t     * three arguments: (value, index, array).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to query.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the slice of `array`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'active': false },\\n\",\n       \"\\t     *   { 'user': 'fred',    'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'active': true }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.takeWhile(users, function(o) { return !o.active; });\\n\",\n       \"\\t     * // => objects for ['barney', 'fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.takeWhile(users, { 'user': 'barney', 'active': false });\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.takeWhile(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for ['barney', 'fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.takeWhile(users, 'active');\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function takeWhile(array, predicate) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseWhile(array, getIteratee(predicate, 3))\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of unique values, in order, from all given arrays using\\n\",\n       \"\\t     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of combined values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.union([2], [1, 2]);\\n\",\n       \"\\t     * // => [2, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var union = baseRest(function(arrays) {\\n\",\n       \"\\t      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.union` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element of each `arrays` to generate the criterion by\\n\",\n       \"\\t     * which uniqueness is computed. Result values are chosen from the first\\n\",\n       \"\\t     * array in which the value occurs. The iteratee is invoked with one argument:\\n\",\n       \"\\t     * (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of combined values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.unionBy([2.1], [1.2, 2.3], Math.floor);\\n\",\n       \"\\t     * // => [2.1, 1.2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\\n\",\n       \"\\t     * // => [{ 'x': 1 }, { 'x': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var unionBy = baseRest(function(arrays) {\\n\",\n       \"\\t      var iteratee = last(arrays);\\n\",\n       \"\\t      if (isArrayLikeObject(iteratee)) {\\n\",\n       \"\\t        iteratee = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.union` except that it accepts `comparator` which\\n\",\n       \"\\t     * is invoked to compare elements of `arrays`. Result values are chosen from\\n\",\n       \"\\t     * the first array in which the value occurs. The comparator is invoked\\n\",\n       \"\\t     * with two arguments: (arrVal, othVal).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of combined values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\\n\",\n       \"\\t     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.unionWith(objects, others, _.isEqual);\\n\",\n       \"\\t     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var unionWith = baseRest(function(arrays) {\\n\",\n       \"\\t      var comparator = last(arrays);\\n\",\n       \"\\t      comparator = typeof comparator == 'function' ? comparator : undefined;\\n\",\n       \"\\t      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a duplicate-free version of an array, using\\n\",\n       \"\\t     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons, in which only the first occurrence of each element\\n\",\n       \"\\t     * is kept. The order of result values is determined by the order they occur\\n\",\n       \"\\t     * in the array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.uniq([2, 1, 2]);\\n\",\n       \"\\t     * // => [2, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function uniq(array) {\\n\",\n       \"\\t      return (array && array.length) ? baseUniq(array) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.uniq` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element in `array` to generate the criterion by which\\n\",\n       \"\\t     * uniqueness is computed. The order of result values is determined by the\\n\",\n       \"\\t     * order they occur in the array. The iteratee is invoked with one argument:\\n\",\n       \"\\t     * (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\\n\",\n       \"\\t     * // => [2.1, 1.2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\\n\",\n       \"\\t     * // => [{ 'x': 1 }, { 'x': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function uniqBy(array, iteratee) {\\n\",\n       \"\\t      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.uniq` except that it accepts `comparator` which\\n\",\n       \"\\t     * is invoked to compare elements of `array`. The order of result values is\\n\",\n       \"\\t     * determined by the order they occur in the array.The comparator is invoked\\n\",\n       \"\\t     * with two arguments: (arrVal, othVal).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new duplicate free array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.uniqWith(objects, _.isEqual);\\n\",\n       \"\\t     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function uniqWith(array, comparator) {\\n\",\n       \"\\t      comparator = typeof comparator == 'function' ? comparator : undefined;\\n\",\n       \"\\t      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.zip` except that it accepts an array of grouped\\n\",\n       \"\\t     * elements and creates an array regrouping the elements to their pre-zip\\n\",\n       \"\\t     * configuration.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.2.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array of grouped elements to process.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of regrouped elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\\n\",\n       \"\\t     * // => [['a', 1, true], ['b', 2, false]]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.unzip(zipped);\\n\",\n       \"\\t     * // => [['a', 'b'], [1, 2], [true, false]]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function unzip(array) {\\n\",\n       \"\\t      if (!(array && array.length)) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var length = 0;\\n\",\n       \"\\t      array = arrayFilter(array, function(group) {\\n\",\n       \"\\t        if (isArrayLikeObject(group)) {\\n\",\n       \"\\t          length = nativeMax(group.length, length);\\n\",\n       \"\\t          return true;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return baseTimes(length, function(index) {\\n\",\n       \"\\t        return arrayMap(array, baseProperty(index));\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.unzip` except that it accepts `iteratee` to specify\\n\",\n       \"\\t     * how regrouped values should be combined. The iteratee is invoked with the\\n\",\n       \"\\t     * elements of each group: (...group).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.8.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array of grouped elements to process.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function to combine\\n\",\n       \"\\t     *  regrouped values.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of regrouped elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\\n\",\n       \"\\t     * // => [[1, 10, 100], [2, 20, 200]]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.unzipWith(zipped, _.add);\\n\",\n       \"\\t     * // => [3, 30, 300]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function unzipWith(array, iteratee) {\\n\",\n       \"\\t      if (!(array && array.length)) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = unzip(array);\\n\",\n       \"\\t      if (iteratee == null) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return arrayMap(result, function(group) {\\n\",\n       \"\\t        return apply(iteratee, undefined, group);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array excluding all given values using\\n\",\n       \"\\t     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * for equality comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.pull`, this method returns a new array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} array The array to inspect.\\n\",\n       \"\\t     * @param {...*} [values] The values to exclude.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @see _.difference, _.xor\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.without([2, 1, 2, 3], 1, 2);\\n\",\n       \"\\t     * // => [3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var without = baseRest(function(array, values) {\\n\",\n       \"\\t      return isArrayLikeObject(array)\\n\",\n       \"\\t        ? baseDifference(array, values)\\n\",\n       \"\\t        : [];\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of unique values that is the\\n\",\n       \"\\t     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\\n\",\n       \"\\t     * of the given arrays. The order of result values is determined by the order\\n\",\n       \"\\t     * they occur in the arrays.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.4.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @see _.difference, _.without\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.xor([2, 1], [2, 3]);\\n\",\n       \"\\t     * // => [1, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var xor = baseRest(function(arrays) {\\n\",\n       \"\\t      return baseXor(arrayFilter(arrays, isArrayLikeObject));\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.xor` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element of each `arrays` to generate the criterion by\\n\",\n       \"\\t     * which by which they're compared. The order of result values is determined\\n\",\n       \"\\t     * by the order they occur in the arrays. The iteratee is invoked with one\\n\",\n       \"\\t     * argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\\n\",\n       \"\\t     * // => [1.2, 3.4]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\\n\",\n       \"\\t     * // => [{ 'x': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var xorBy = baseRest(function(arrays) {\\n\",\n       \"\\t      var iteratee = last(arrays);\\n\",\n       \"\\t      if (isArrayLikeObject(iteratee)) {\\n\",\n       \"\\t        iteratee = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.xor` except that it accepts `comparator` which is\\n\",\n       \"\\t     * invoked to compare elements of `arrays`. The order of result values is\\n\",\n       \"\\t     * determined by the order they occur in the arrays. The comparator is invoked\\n\",\n       \"\\t     * with two arguments: (arrVal, othVal).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to inspect.\\n\",\n       \"\\t     * @param {Function} [comparator] The comparator invoked per element.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of filtered values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\\n\",\n       \"\\t     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.xorWith(objects, others, _.isEqual);\\n\",\n       \"\\t     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var xorWith = baseRest(function(arrays) {\\n\",\n       \"\\t      var comparator = last(arrays);\\n\",\n       \"\\t      comparator = typeof comparator == 'function' ? comparator : undefined;\\n\",\n       \"\\t      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of grouped elements, the first of which contains the\\n\",\n       \"\\t     * first elements of the given arrays, the second of which contains the\\n\",\n       \"\\t     * second elements of the given arrays, and so on.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to process.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of grouped elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.zip(['a', 'b'], [1, 2], [true, false]);\\n\",\n       \"\\t     * // => [['a', 1, true], ['b', 2, false]]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var zip = baseRest(unzip);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.fromPairs` except that it accepts two arrays,\\n\",\n       \"\\t     * one of property identifiers and one of corresponding values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.4.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} [props=[]] The property identifiers.\\n\",\n       \"\\t     * @param {Array} [values=[]] The property values.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.zipObject(['a', 'b'], [1, 2]);\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function zipObject(props, values) {\\n\",\n       \"\\t      return baseZipObject(props || [], values || [], assignValue);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.zipObject` except that it supports property paths.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.1.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {Array} [props=[]] The property identifiers.\\n\",\n       \"\\t     * @param {Array} [values=[]] The property values.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\\n\",\n       \"\\t     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function zipObjectDeep(props, values) {\\n\",\n       \"\\t      return baseZipObject(props || [], values || [], baseSet);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.zip` except that it accepts `iteratee` to specify\\n\",\n       \"\\t     * how grouped values should be combined. The iteratee is invoked with the\\n\",\n       \"\\t     * elements of each group: (...group).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.8.0\\n\",\n       \"\\t     * @category Array\\n\",\n       \"\\t     * @param {...Array} [arrays] The arrays to process.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function to combine\\n\",\n       \"\\t     *  grouped values.\\n\",\n       \"\\t     * @returns {Array} Returns the new array of grouped elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\\n\",\n       \"\\t     *   return a + b + c;\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => [111, 222]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var zipWith = baseRest(function(arrays) {\\n\",\n       \"\\t      var length = arrays.length,\\n\",\n       \"\\t          iteratee = length > 1 ? arrays[length - 1] : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\\n\",\n       \"\\t      return unzipWith(arrays, iteratee);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\\n\",\n       \"\\t     * chain sequences enabled. The result of such sequences must be unwrapped\\n\",\n       \"\\t     * with `_#value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.3.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @param {*} value The value to wrap.\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'age': 36 },\\n\",\n       \"\\t     *   { 'user': 'fred',    'age': 40 },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'age': 1 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var youngest = _\\n\",\n       \"\\t     *   .chain(users)\\n\",\n       \"\\t     *   .sortBy('age')\\n\",\n       \"\\t     *   .map(function(o) {\\n\",\n       \"\\t     *     return o.user + ' is ' + o.age;\\n\",\n       \"\\t     *   })\\n\",\n       \"\\t     *   .head()\\n\",\n       \"\\t     *   .value();\\n\",\n       \"\\t     * // => 'pebbles is 1'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function chain(value) {\\n\",\n       \"\\t      var result = lodash(value);\\n\",\n       \"\\t      result.__chain__ = true;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method invokes `interceptor` and returns `value`. The interceptor\\n\",\n       \"\\t     * is invoked with one argument; (value). The purpose of this method is to\\n\",\n       \"\\t     * \\\"tap into\\\" a method chain sequence in order to modify intermediate results.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @param {*} value The value to provide to `interceptor`.\\n\",\n       \"\\t     * @param {Function} interceptor The function to invoke.\\n\",\n       \"\\t     * @returns {*} Returns `value`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _([1, 2, 3])\\n\",\n       \"\\t     *  .tap(function(array) {\\n\",\n       \"\\t     *    // Mutate input array.\\n\",\n       \"\\t     *    array.pop();\\n\",\n       \"\\t     *  })\\n\",\n       \"\\t     *  .reverse()\\n\",\n       \"\\t     *  .value();\\n\",\n       \"\\t     * // => [2, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function tap(value, interceptor) {\\n\",\n       \"\\t      interceptor(value);\\n\",\n       \"\\t      return value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.tap` except that it returns the result of `interceptor`.\\n\",\n       \"\\t     * The purpose of this method is to \\\"pass thru\\\" values replacing intermediate\\n\",\n       \"\\t     * results in a method chain sequence.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @param {*} value The value to provide to `interceptor`.\\n\",\n       \"\\t     * @param {Function} interceptor The function to invoke.\\n\",\n       \"\\t     * @returns {*} Returns the result of `interceptor`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _('  abc  ')\\n\",\n       \"\\t     *  .chain()\\n\",\n       \"\\t     *  .trim()\\n\",\n       \"\\t     *  .thru(function(value) {\\n\",\n       \"\\t     *    return [value];\\n\",\n       \"\\t     *  })\\n\",\n       \"\\t     *  .value();\\n\",\n       \"\\t     * // => ['abc']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function thru(value, interceptor) {\\n\",\n       \"\\t      return interceptor(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is the wrapper version of `_.at`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name at\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.0.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @param {...(string|string[])} [paths] The property paths to pick.\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _(object).at(['a[0].b.c', 'a[1]']).value();\\n\",\n       \"\\t     * // => [3, 4]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var wrapperAt = flatRest(function(paths) {\\n\",\n       \"\\t      var length = paths.length,\\n\",\n       \"\\t          start = length ? paths[0] : 0,\\n\",\n       \"\\t          value = this.__wrapped__,\\n\",\n       \"\\t          interceptor = function(object) { return baseAt(object, paths); };\\n\",\n       \"\\t\\n\",\n       \"\\t      if (length > 1 || this.__actions__.length ||\\n\",\n       \"\\t          !(value instanceof LazyWrapper) || !isIndex(start)) {\\n\",\n       \"\\t        return this.thru(interceptor);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      value = value.slice(start, +start + (length ? 1 : 0));\\n\",\n       \"\\t      value.__actions__.push({\\n\",\n       \"\\t        'func': thru,\\n\",\n       \"\\t        'args': [interceptor],\\n\",\n       \"\\t        'thisArg': undefined\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return new LodashWrapper(value, this.__chain__).thru(function(array) {\\n\",\n       \"\\t        if (length && !array.length) {\\n\",\n       \"\\t          array.push(undefined);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return array;\\n\",\n       \"\\t      });\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name chain\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36 },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // A sequence without explicit chaining.\\n\",\n       \"\\t     * _(users).head();\\n\",\n       \"\\t     * // => { 'user': 'barney', 'age': 36 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // A sequence with explicit chaining.\\n\",\n       \"\\t     * _(users)\\n\",\n       \"\\t     *   .chain()\\n\",\n       \"\\t     *   .head()\\n\",\n       \"\\t     *   .pick('user')\\n\",\n       \"\\t     *   .value();\\n\",\n       \"\\t     * // => { 'user': 'barney' }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperChain() {\\n\",\n       \"\\t      return chain(this);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Executes the chain sequence and returns the wrapped result.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name commit\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.2.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, 2];\\n\",\n       \"\\t     * var wrapped = _(array).push(3);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped = wrapped.commit();\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped.last();\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperCommit() {\\n\",\n       \"\\t      return new LodashWrapper(this.value(), this.__chain__);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the next value on a wrapped object following the\\n\",\n       \"\\t     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name next\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @returns {Object} Returns the next iterator value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var wrapped = _([1, 2]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped.next();\\n\",\n       \"\\t     * // => { 'done': false, 'value': 1 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped.next();\\n\",\n       \"\\t     * // => { 'done': false, 'value': 2 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped.next();\\n\",\n       \"\\t     * // => { 'done': true, 'value': undefined }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperNext() {\\n\",\n       \"\\t      if (this.__values__ === undefined) {\\n\",\n       \"\\t        this.__values__ = toArray(this.value());\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var done = this.__index__ >= this.__values__.length,\\n\",\n       \"\\t          value = done ? undefined : this.__values__[this.__index__++];\\n\",\n       \"\\t\\n\",\n       \"\\t      return { 'done': done, 'value': value };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Enables the wrapper to be iterable.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name Symbol.iterator\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @returns {Object} Returns the wrapper object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var wrapped = _([1, 2]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped[Symbol.iterator]() === wrapped;\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Array.from(wrapped);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperToIterator() {\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a clone of the chain sequence planting `value` as the wrapped value.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name plant\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.2.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @param {*} value The value to plant.\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function square(n) {\\n\",\n       \"\\t     *   return n * n;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var wrapped = _([1, 2]).map(square);\\n\",\n       \"\\t     * var other = wrapped.plant([3, 4]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * other.value();\\n\",\n       \"\\t     * // => [9, 16]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * wrapped.value();\\n\",\n       \"\\t     * // => [1, 4]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperPlant(value) {\\n\",\n       \"\\t      var result,\\n\",\n       \"\\t          parent = this;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (parent instanceof baseLodash) {\\n\",\n       \"\\t        var clone = wrapperClone(parent);\\n\",\n       \"\\t        clone.__index__ = 0;\\n\",\n       \"\\t        clone.__values__ = undefined;\\n\",\n       \"\\t        if (result) {\\n\",\n       \"\\t          previous.__wrapped__ = clone;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          result = clone;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var previous = clone;\\n\",\n       \"\\t        parent = parent.__wrapped__;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      previous.__wrapped__ = value;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is the wrapper version of `_.reverse`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates the wrapped array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name reverse\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @returns {Object} Returns the new `lodash` wrapper instance.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, 2, 3];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _(array).reverse().value()\\n\",\n       \"\\t     * // => [3, 2, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(array);\\n\",\n       \"\\t     * // => [3, 2, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperReverse() {\\n\",\n       \"\\t      var value = this.__wrapped__;\\n\",\n       \"\\t      if (value instanceof LazyWrapper) {\\n\",\n       \"\\t        var wrapped = value;\\n\",\n       \"\\t        if (this.__actions__.length) {\\n\",\n       \"\\t          wrapped = new LazyWrapper(this);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        wrapped = wrapped.reverse();\\n\",\n       \"\\t        wrapped.__actions__.push({\\n\",\n       \"\\t          'func': thru,\\n\",\n       \"\\t          'args': [reverse],\\n\",\n       \"\\t          'thisArg': undefined\\n\",\n       \"\\t        });\\n\",\n       \"\\t        return new LodashWrapper(wrapped, this.__chain__);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return this.thru(reverse);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Executes the chain sequence to resolve the unwrapped value.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @name value\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @alias toJSON, valueOf\\n\",\n       \"\\t     * @category Seq\\n\",\n       \"\\t     * @returns {*} Returns the resolved unwrapped value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _([1, 2, 3]).value();\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrapperValue() {\\n\",\n       \"\\t      return baseWrapperValue(this.__wrapped__, this.__actions__);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object composed of keys generated from the results of running\\n\",\n       \"\\t     * each element of `collection` thru `iteratee`. The corresponding value of\\n\",\n       \"\\t     * each key is the number of times the key was returned by `iteratee`. The\\n\",\n       \"\\t     * iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.5.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\\n\",\n       \"\\t     * @returns {Object} Returns the composed aggregate object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.countBy([6.1, 4.2, 6.3], Math.floor);\\n\",\n       \"\\t     * // => { '4': 1, '6': 2 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.countBy(['one', 'two', 'three'], 'length');\\n\",\n       \"\\t     * // => { '3': 2, '5': 1 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var countBy = createAggregator(function(result, value, key) {\\n\",\n       \"\\t      if (hasOwnProperty.call(result, key)) {\\n\",\n       \"\\t        ++result[key];\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        baseAssignValue(result, key, 1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `predicate` returns truthy for **all** elements of `collection`.\\n\",\n       \"\\t     * Iteration is stopped once `predicate` returns falsey. The predicate is\\n\",\n       \"\\t     * invoked with three arguments: (value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method returns `true` for\\n\",\n       \"\\t     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\\n\",\n       \"\\t     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\\n\",\n       \"\\t     * elements of empty collections.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if all elements pass the predicate check,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.every([true, 1, null, 'yes'], Boolean);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36, 'active': false },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40, 'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.every(users, { 'user': 'barney', 'active': false });\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.every(users, ['active', false]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.every(users, 'active');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function every(collection, predicate, guard) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayEvery : baseEvery;\\n\",\n       \"\\t      if (guard && isIterateeCall(collection, predicate, guard)) {\\n\",\n       \"\\t        predicate = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return func(collection, getIteratee(predicate, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Iterates over elements of `collection`, returning an array of all elements\\n\",\n       \"\\t     * `predicate` returns truthy for. The predicate is invoked with three\\n\",\n       \"\\t     * arguments: (value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike `_.remove`, this method returns a new array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new filtered array.\\n\",\n       \"\\t     * @see _.reject\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36, 'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40, 'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.filter(users, function(o) { return !o.active; });\\n\",\n       \"\\t     * // => objects for ['fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.filter(users, { 'age': 36, 'active': true });\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.filter(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for ['fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.filter(users, 'active');\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function filter(collection, predicate) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayFilter : baseFilter;\\n\",\n       \"\\t      return func(collection, getIteratee(predicate, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Iterates over elements of `collection`, returning the first element\\n\",\n       \"\\t     * `predicate` returns truthy for. The predicate is invoked with three\\n\",\n       \"\\t     * arguments: (value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to inspect.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {number} [fromIndex=0] The index to search from.\\n\",\n       \"\\t     * @returns {*} Returns the matched element, else `undefined`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'age': 36, 'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',    'age': 40, 'active': false },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'age': 1,  'active': true }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.find(users, function(o) { return o.age < 40; });\\n\",\n       \"\\t     * // => object for 'barney'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.find(users, { 'age': 1, 'active': true });\\n\",\n       \"\\t     * // => object for 'pebbles'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.find(users, ['active', false]);\\n\",\n       \"\\t     * // => object for 'fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.find(users, 'active');\\n\",\n       \"\\t     * // => object for 'barney'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var find = createFind(findIndex);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.find` except that it iterates over elements of\\n\",\n       \"\\t     * `collection` from right to left.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to inspect.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {number} [fromIndex=collection.length-1] The index to search from.\\n\",\n       \"\\t     * @returns {*} Returns the matched element, else `undefined`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.findLast([1, 2, 3, 4], function(n) {\\n\",\n       \"\\t     *   return n % 2 == 1;\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var findLast = createFind(findLastIndex);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a flattened array of values by running each element in `collection`\\n\",\n       \"\\t     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\\n\",\n       \"\\t     * with three arguments: (value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function duplicate(n) {\\n\",\n       \"\\t     *   return [n, n];\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flatMap([1, 2], duplicate);\\n\",\n       \"\\t     * // => [1, 1, 2, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flatMap(collection, iteratee) {\\n\",\n       \"\\t      return baseFlatten(map(collection, iteratee), 1);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.flatMap` except that it recursively flattens the\\n\",\n       \"\\t     * mapped results.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.7.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function duplicate(n) {\\n\",\n       \"\\t     *   return [[[n, n]]];\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flatMapDeep([1, 2], duplicate);\\n\",\n       \"\\t     * // => [1, 1, 2, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flatMapDeep(collection, iteratee) {\\n\",\n       \"\\t      return baseFlatten(map(collection, iteratee), INFINITY);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.flatMap` except that it recursively flattens the\\n\",\n       \"\\t     * mapped results up to `depth` times.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.7.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {number} [depth=1] The maximum recursion depth.\\n\",\n       \"\\t     * @returns {Array} Returns the new flattened array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function duplicate(n) {\\n\",\n       \"\\t     *   return [[[n, n]]];\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.flatMapDepth([1, 2], duplicate, 2);\\n\",\n       \"\\t     * // => [[1, 1], [2, 2]]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flatMapDepth(collection, iteratee, depth) {\\n\",\n       \"\\t      depth = depth === undefined ? 1 : toInteger(depth);\\n\",\n       \"\\t      return baseFlatten(map(collection, iteratee), depth);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Iterates over elements of `collection` and invokes `iteratee` for each element.\\n\",\n       \"\\t     * The iteratee is invoked with three arguments: (value, index|key, collection).\\n\",\n       \"\\t     * Iteratee functions may exit iteration early by explicitly returning `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** As with other \\\"Collections\\\" methods, objects with a \\\"length\\\"\\n\",\n       \"\\t     * property are iterated like arrays. To avoid this behavior use `_.forIn`\\n\",\n       \"\\t     * or `_.forOwn` for object iteration.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @alias each\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array|Object} Returns `collection`.\\n\",\n       \"\\t     * @see _.forEachRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forEach([1, 2], function(value) {\\n\",\n       \"\\t     *   console.log(value);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs `1` then `2`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\\n\",\n       \"\\t     *   console.log(key);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function forEach(collection, iteratee) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayEach : baseEach;\\n\",\n       \"\\t      return func(collection, getIteratee(iteratee, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.forEach` except that it iterates over elements of\\n\",\n       \"\\t     * `collection` from right to left.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @alias eachRight\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array|Object} Returns `collection`.\\n\",\n       \"\\t     * @see _.forEach\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forEachRight([1, 2], function(value) {\\n\",\n       \"\\t     *   console.log(value);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs `2` then `1`.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function forEachRight(collection, iteratee) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayEachRight : baseEachRight;\\n\",\n       \"\\t      return func(collection, getIteratee(iteratee, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object composed of keys generated from the results of running\\n\",\n       \"\\t     * each element of `collection` thru `iteratee`. The order of grouped values\\n\",\n       \"\\t     * is determined by the order they occur in `collection`. The corresponding\\n\",\n       \"\\t     * value of each key is an array of elements responsible for generating the\\n\",\n       \"\\t     * key. The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\\n\",\n       \"\\t     * @returns {Object} Returns the composed aggregate object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\\n\",\n       \"\\t     * // => { '4': [4.2], '6': [6.1, 6.3] }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.groupBy(['one', 'two', 'three'], 'length');\\n\",\n       \"\\t     * // => { '3': ['one', 'two'], '5': ['three'] }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var groupBy = createAggregator(function(result, value, key) {\\n\",\n       \"\\t      if (hasOwnProperty.call(result, key)) {\\n\",\n       \"\\t        result[key].push(value);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        baseAssignValue(result, key, [value]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is in `collection`. If `collection` is a string, it's\\n\",\n       \"\\t     * checked for a substring of `value`, otherwise\\n\",\n       \"\\t     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * is used for equality comparisons. If `fromIndex` is negative, it's used as\\n\",\n       \"\\t     * the offset from the end of `collection`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object|string} collection The collection to inspect.\\n\",\n       \"\\t     * @param {*} value The value to search for.\\n\",\n       \"\\t     * @param {number} [fromIndex=0] The index to search from.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is found, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.includes([1, 2, 3], 1);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.includes([1, 2, 3], 1, 2);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.includes({ 'a': 1, 'b': 2 }, 1);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.includes('abcd', 'bc');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function includes(collection, value, fromIndex, guard) {\\n\",\n       \"\\t      collection = isArrayLike(collection) ? collection : values(collection);\\n\",\n       \"\\t      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\\n\",\n       \"\\t\\n\",\n       \"\\t      var length = collection.length;\\n\",\n       \"\\t      if (fromIndex < 0) {\\n\",\n       \"\\t        fromIndex = nativeMax(length + fromIndex, 0);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return isString(collection)\\n\",\n       \"\\t        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\\n\",\n       \"\\t        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Invokes the method at `path` of each element in `collection`, returning\\n\",\n       \"\\t     * an array of the results of each invoked method. Any additional arguments\\n\",\n       \"\\t     * are provided to each invoked method. If `path` is a function, it's invoked\\n\",\n       \"\\t     * for, and `this` bound to, each element in `collection`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Array|Function|string} path The path of the method to invoke or\\n\",\n       \"\\t     *  the function invoked per iteration.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke each method with.\\n\",\n       \"\\t     * @returns {Array} Returns the array of results.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\\n\",\n       \"\\t     * // => [[1, 5, 7], [1, 2, 3]]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.invokeMap([123, 456], String.prototype.split, '');\\n\",\n       \"\\t     * // => [['1', '2', '3'], ['4', '5', '6']]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var invokeMap = baseRest(function(collection, path, args) {\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          isFunc = typeof path == 'function',\\n\",\n       \"\\t          result = isArrayLike(collection) ? Array(collection.length) : [];\\n\",\n       \"\\t\\n\",\n       \"\\t      baseEach(collection, function(value) {\\n\",\n       \"\\t        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object composed of keys generated from the results of running\\n\",\n       \"\\t     * each element of `collection` thru `iteratee`. The corresponding value of\\n\",\n       \"\\t     * each key is the last element responsible for generating the key. The\\n\",\n       \"\\t     * iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\\n\",\n       \"\\t     * @returns {Object} Returns the composed aggregate object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [\\n\",\n       \"\\t     *   { 'dir': 'left', 'code': 97 },\\n\",\n       \"\\t     *   { 'dir': 'right', 'code': 100 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.keyBy(array, function(o) {\\n\",\n       \"\\t     *   return String.fromCharCode(o.code);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.keyBy(array, 'dir');\\n\",\n       \"\\t     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var keyBy = createAggregator(function(result, value, key) {\\n\",\n       \"\\t      baseAssignValue(result, key, value);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of values by running each element in `collection` thru\\n\",\n       \"\\t     * `iteratee`. The iteratee is invoked with three arguments:\\n\",\n       \"\\t     * (value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Many lodash methods are guarded to work as iteratees for methods like\\n\",\n       \"\\t     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The guarded methods are:\\n\",\n       \"\\t     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\\n\",\n       \"\\t     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\\n\",\n       \"\\t     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\\n\",\n       \"\\t     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new mapped array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function square(n) {\\n\",\n       \"\\t     *   return n * n;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map([4, 8], square);\\n\",\n       \"\\t     * // => [16, 64]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map({ 'a': 4, 'b': 8 }, square);\\n\",\n       \"\\t     * // => [16, 64] (iteration order is not guaranteed)\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney' },\\n\",\n       \"\\t     *   { 'user': 'fred' }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.map(users, 'user');\\n\",\n       \"\\t     * // => ['barney', 'fred']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function map(collection, iteratee) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayMap : baseMap;\\n\",\n       \"\\t      return func(collection, getIteratee(iteratee, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.sortBy` except that it allows specifying the sort\\n\",\n       \"\\t     * orders of the iteratees to sort by. If `orders` is unspecified, all values\\n\",\n       \"\\t     * are sorted in ascending order. Otherwise, specify an order of \\\"desc\\\" for\\n\",\n       \"\\t     * descending or \\\"asc\\\" for ascending sort order of corresponding values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\\n\",\n       \"\\t     *  The iteratees to sort by.\\n\",\n       \"\\t     * @param {string[]} [orders] The sort orders of `iteratees`.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\\n\",\n       \"\\t     * @returns {Array} Returns the new sorted array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 48 },\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 34 },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40 },\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Sort by `user` in ascending order and by `age` in descending order.\\n\",\n       \"\\t     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\\n\",\n       \"\\t     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function orderBy(collection, iteratees, orders, guard) {\\n\",\n       \"\\t      if (collection == null) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!isArray(iteratees)) {\\n\",\n       \"\\t        iteratees = iteratees == null ? [] : [iteratees];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      orders = guard ? undefined : orders;\\n\",\n       \"\\t      if (!isArray(orders)) {\\n\",\n       \"\\t        orders = orders == null ? [] : [orders];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseOrderBy(collection, iteratees, orders);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of elements split into two groups, the first of which\\n\",\n       \"\\t     * contains elements `predicate` returns truthy for, the second of which\\n\",\n       \"\\t     * contains elements `predicate` returns falsey for. The predicate is\\n\",\n       \"\\t     * invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the array of grouped elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney',  'age': 36, 'active': false },\\n\",\n       \"\\t     *   { 'user': 'fred',    'age': 40, 'active': true },\\n\",\n       \"\\t     *   { 'user': 'pebbles', 'age': 1,  'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.partition(users, function(o) { return o.active; });\\n\",\n       \"\\t     * // => objects for [['fred'], ['barney', 'pebbles']]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.partition(users, { 'age': 1, 'active': false });\\n\",\n       \"\\t     * // => objects for [['pebbles'], ['barney', 'fred']]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.partition(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for [['barney', 'pebbles'], ['fred']]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.partition(users, 'active');\\n\",\n       \"\\t     * // => objects for [['fred'], ['barney', 'pebbles']]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var partition = createAggregator(function(result, value, key) {\\n\",\n       \"\\t      result[key ? 0 : 1].push(value);\\n\",\n       \"\\t    }, function() { return [[], []]; });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Reduces `collection` to a value which is the accumulated result of running\\n\",\n       \"\\t     * each element in `collection` thru `iteratee`, where each successive\\n\",\n       \"\\t     * invocation is supplied the return value of the previous. If `accumulator`\\n\",\n       \"\\t     * is not given, the first element of `collection` is used as the initial\\n\",\n       \"\\t     * value. The iteratee is invoked with four arguments:\\n\",\n       \"\\t     * (accumulator, value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Many lodash methods are guarded to work as iteratees for methods like\\n\",\n       \"\\t     * `_.reduce`, `_.reduceRight`, and `_.transform`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The guarded methods are:\\n\",\n       \"\\t     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\\n\",\n       \"\\t     * and `sortBy`\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {*} [accumulator] The initial value.\\n\",\n       \"\\t     * @returns {*} Returns the accumulated value.\\n\",\n       \"\\t     * @see _.reduceRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.reduce([1, 2], function(sum, n) {\\n\",\n       \"\\t     *   return sum + n;\\n\",\n       \"\\t     * }, 0);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\\n\",\n       \"\\t     *   (result[value] || (result[value] = [])).push(key);\\n\",\n       \"\\t     *   return result;\\n\",\n       \"\\t     * }, {});\\n\",\n       \"\\t     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function reduce(collection, iteratee, accumulator) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayReduce : baseReduce,\\n\",\n       \"\\t          initAccum = arguments.length < 3;\\n\",\n       \"\\t\\n\",\n       \"\\t      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.reduce` except that it iterates over elements of\\n\",\n       \"\\t     * `collection` from right to left.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {*} [accumulator] The initial value.\\n\",\n       \"\\t     * @returns {*} Returns the accumulated value.\\n\",\n       \"\\t     * @see _.reduce\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [[0, 1], [2, 3], [4, 5]];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.reduceRight(array, function(flattened, other) {\\n\",\n       \"\\t     *   return flattened.concat(other);\\n\",\n       \"\\t     * }, []);\\n\",\n       \"\\t     * // => [4, 5, 2, 3, 0, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function reduceRight(collection, iteratee, accumulator) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayReduceRight : baseReduce,\\n\",\n       \"\\t          initAccum = arguments.length < 3;\\n\",\n       \"\\t\\n\",\n       \"\\t      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.filter`; this method returns the elements of `collection`\\n\",\n       \"\\t     * that `predicate` does **not** return truthy for.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the new filtered array.\\n\",\n       \"\\t     * @see _.filter\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36, 'active': false },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40, 'active': true }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.reject(users, function(o) { return !o.active; });\\n\",\n       \"\\t     * // => objects for ['fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.reject(users, { 'age': 40, 'active': true });\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.reject(users, ['active', false]);\\n\",\n       \"\\t     * // => objects for ['fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.reject(users, 'active');\\n\",\n       \"\\t     * // => objects for ['barney']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function reject(collection, predicate) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayFilter : baseFilter;\\n\",\n       \"\\t      return func(collection, negate(getIteratee(predicate, 3)));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets a random element from `collection`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to sample.\\n\",\n       \"\\t     * @returns {*} Returns the random element.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sample([1, 2, 3, 4]);\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sample(collection) {\\n\",\n       \"\\t      var func = isArray(collection) ? arraySample : baseSample;\\n\",\n       \"\\t      return func(collection);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets `n` random elements at unique keys from `collection` up to the\\n\",\n       \"\\t     * size of `collection`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to sample.\\n\",\n       \"\\t     * @param {number} [n=1] The number of elements to sample.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the random elements.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sampleSize([1, 2, 3], 2);\\n\",\n       \"\\t     * // => [3, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sampleSize([1, 2, 3], 4);\\n\",\n       \"\\t     * // => [2, 3, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sampleSize(collection, n, guard) {\\n\",\n       \"\\t      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\\n\",\n       \"\\t        n = 1;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        n = toInteger(n);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\\n\",\n       \"\\t      return func(collection, n);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of shuffled values, using a version of the\\n\",\n       \"\\t     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to shuffle.\\n\",\n       \"\\t     * @returns {Array} Returns the new shuffled array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.shuffle([1, 2, 3, 4]);\\n\",\n       \"\\t     * // => [4, 1, 3, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function shuffle(collection) {\\n\",\n       \"\\t      var func = isArray(collection) ? arrayShuffle : baseShuffle;\\n\",\n       \"\\t      return func(collection);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the size of `collection` by returning its length for array-like\\n\",\n       \"\\t     * values or the number of own enumerable string keyed properties for objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object|string} collection The collection to inspect.\\n\",\n       \"\\t     * @returns {number} Returns the collection size.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.size([1, 2, 3]);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.size({ 'a': 1, 'b': 2 });\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.size('pebbles');\\n\",\n       \"\\t     * // => 7\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function size(collection) {\\n\",\n       \"\\t      if (collection == null) {\\n\",\n       \"\\t        return 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isArrayLike(collection)) {\\n\",\n       \"\\t        return isString(collection) ? stringSize(collection) : collection.length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var tag = getTag(collection);\\n\",\n       \"\\t      if (tag == mapTag || tag == setTag) {\\n\",\n       \"\\t        return collection.size;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseKeys(collection).length;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `predicate` returns truthy for **any** element of `collection`.\\n\",\n       \"\\t     * Iteration is stopped once `predicate` returns truthy. The predicate is\\n\",\n       \"\\t     * invoked with three arguments: (value, index|key, collection).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if any element passes the predicate check,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.some([null, 0, 'yes', false], Boolean);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney', 'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',   'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.some(users, { 'user': 'barney', 'active': false });\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.some(users, ['active', false]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.some(users, 'active');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function some(collection, predicate, guard) {\\n\",\n       \"\\t      var func = isArray(collection) ? arraySome : baseSome;\\n\",\n       \"\\t      if (guard && isIterateeCall(collection, predicate, guard)) {\\n\",\n       \"\\t        predicate = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return func(collection, getIteratee(predicate, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of elements, sorted in ascending order by the results of\\n\",\n       \"\\t     * running each element in a collection thru each iteratee. This method\\n\",\n       \"\\t     * performs a stable sort, that is, it preserves the original sort order of\\n\",\n       \"\\t     * equal elements. The iteratees are invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Collection\\n\",\n       \"\\t     * @param {Array|Object} collection The collection to iterate over.\\n\",\n       \"\\t     * @param {...(Function|Function[])} [iteratees=[_.identity]]\\n\",\n       \"\\t     *  The iteratees to sort by.\\n\",\n       \"\\t     * @returns {Array} Returns the new sorted array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 48 },\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36 },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40 },\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 34 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortBy(users, [function(o) { return o.user; }]);\\n\",\n       \"\\t     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sortBy(users, ['user', 'age']);\\n\",\n       \"\\t     * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var sortBy = baseRest(function(collection, iteratees) {\\n\",\n       \"\\t      if (collection == null) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var length = iteratees.length;\\n\",\n       \"\\t      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\\n\",\n       \"\\t        iteratees = [];\\n\",\n       \"\\t      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\\n\",\n       \"\\t        iteratees = [iteratees[0]];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the timestamp of the number of milliseconds that have elapsed since\\n\",\n       \"\\t     * the Unix epoch (1 January 1970 00:00:00 UTC).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.4.0\\n\",\n       \"\\t     * @category Date\\n\",\n       \"\\t     * @returns {number} Returns the timestamp.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.defer(function(stamp) {\\n\",\n       \"\\t     *   console.log(_.now() - stamp);\\n\",\n       \"\\t     * }, _.now());\\n\",\n       \"\\t     * // => Logs the number of milliseconds it took for the deferred invocation.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var now = ctxNow || function() {\\n\",\n       \"\\t      return root.Date.now();\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.before`; this method creates a function that invokes\\n\",\n       \"\\t     * `func` once it's called `n` or more times.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {number} n The number of calls before `func` is invoked.\\n\",\n       \"\\t     * @param {Function} func The function to restrict.\\n\",\n       \"\\t     * @returns {Function} Returns the new restricted function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var saves = ['profile', 'settings'];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var done = _.after(saves.length, function() {\\n\",\n       \"\\t     *   console.log('done saving!');\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forEach(saves, function(type) {\\n\",\n       \"\\t     *   asyncSave({ 'type': type, 'complete': done });\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs 'done saving!' after the two async saves have completed.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function after(n, func) {\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n = toInteger(n);\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        if (--n < 1) {\\n\",\n       \"\\t          return func.apply(this, arguments);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func`, with up to `n` arguments,\\n\",\n       \"\\t     * ignoring any additional arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to cap arguments for.\\n\",\n       \"\\t     * @param {number} [n=func.length] The arity cap.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Function} Returns the new capped function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\\n\",\n       \"\\t     * // => [6, 8, 10]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function ary(func, n, guard) {\\n\",\n       \"\\t      n = guard ? undefined : n;\\n\",\n       \"\\t      n = (func && n == null) ? func.length : n;\\n\",\n       \"\\t      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func`, with the `this` binding and arguments\\n\",\n       \"\\t     * of the created function, while it's called less than `n` times. Subsequent\\n\",\n       \"\\t     * calls to the created function return the result of the last `func` invocation.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {number} n The number of calls at which `func` is no longer invoked.\\n\",\n       \"\\t     * @param {Function} func The function to restrict.\\n\",\n       \"\\t     * @returns {Function} Returns the new restricted function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * jQuery(element).on('click', _.before(5, addContactToList));\\n\",\n       \"\\t     * // => Allows adding up to 4 contacts to the list.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function before(n, func) {\\n\",\n       \"\\t      var result;\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      n = toInteger(n);\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        if (--n > 0) {\\n\",\n       \"\\t          result = func.apply(this, arguments);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (n <= 1) {\\n\",\n       \"\\t          func = undefined;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with the `this` binding of `thisArg`\\n\",\n       \"\\t     * and `partials` prepended to the arguments it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\\n\",\n       \"\\t     * may be used as a placeholder for partially applied arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Unlike native `Function#bind`, this method doesn't set the \\\"length\\\"\\n\",\n       \"\\t     * property of bound functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to bind.\\n\",\n       \"\\t     * @param {*} thisArg The `this` binding of `func`.\\n\",\n       \"\\t     * @param {...*} [partials] The arguments to be partially applied.\\n\",\n       \"\\t     * @returns {Function} Returns the new bound function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function greet(greeting, punctuation) {\\n\",\n       \"\\t     *   return greeting + ' ' + this.user + punctuation;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'user': 'fred' };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var bound = _.bind(greet, object, 'hi');\\n\",\n       \"\\t     * bound('!');\\n\",\n       \"\\t     * // => 'hi fred!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Bound with placeholders.\\n\",\n       \"\\t     * var bound = _.bind(greet, object, _, '!');\\n\",\n       \"\\t     * bound('hi');\\n\",\n       \"\\t     * // => 'hi fred!'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var bind = baseRest(function(func, thisArg, partials) {\\n\",\n       \"\\t      var bitmask = WRAP_BIND_FLAG;\\n\",\n       \"\\t      if (partials.length) {\\n\",\n       \"\\t        var holders = replaceHolders(partials, getHolder(bind));\\n\",\n       \"\\t        bitmask |= WRAP_PARTIAL_FLAG;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return createWrap(func, bitmask, thisArg, partials, holders);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes the method at `object[key]` with `partials`\\n\",\n       \"\\t     * prepended to the arguments it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * This method differs from `_.bind` by allowing bound functions to reference\\n\",\n       \"\\t     * methods that may be redefined or don't yet exist. See\\n\",\n       \"\\t     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\\n\",\n       \"\\t     * for more details.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\\n\",\n       \"\\t     * builds, may be used as a placeholder for partially applied arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.10.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Object} object The object to invoke the method on.\\n\",\n       \"\\t     * @param {string} key The key of the method.\\n\",\n       \"\\t     * @param {...*} [partials] The arguments to be partially applied.\\n\",\n       \"\\t     * @returns {Function} Returns the new bound function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = {\\n\",\n       \"\\t     *   'user': 'fred',\\n\",\n       \"\\t     *   'greet': function(greeting, punctuation) {\\n\",\n       \"\\t     *     return greeting + ' ' + this.user + punctuation;\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var bound = _.bindKey(object, 'greet', 'hi');\\n\",\n       \"\\t     * bound('!');\\n\",\n       \"\\t     * // => 'hi fred!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * object.greet = function(greeting, punctuation) {\\n\",\n       \"\\t     *   return greeting + 'ya ' + this.user + punctuation;\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * bound('!');\\n\",\n       \"\\t     * // => 'hiya fred!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Bound with placeholders.\\n\",\n       \"\\t     * var bound = _.bindKey(object, 'greet', _, '!');\\n\",\n       \"\\t     * bound('hi');\\n\",\n       \"\\t     * // => 'hiya fred!'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var bindKey = baseRest(function(object, key, partials) {\\n\",\n       \"\\t      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\\n\",\n       \"\\t      if (partials.length) {\\n\",\n       \"\\t        var holders = replaceHolders(partials, getHolder(bindKey));\\n\",\n       \"\\t        bitmask |= WRAP_PARTIAL_FLAG;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return createWrap(key, bitmask, object, partials, holders);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that accepts arguments of `func` and either invokes\\n\",\n       \"\\t     * `func` returning its result, if at least `arity` number of arguments have\\n\",\n       \"\\t     * been provided, or returns a function that accepts the remaining `func`\\n\",\n       \"\\t     * arguments, and so on. The arity of `func` may be specified if `func.length`\\n\",\n       \"\\t     * is not sufficient.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\\n\",\n       \"\\t     * may be used as a placeholder for provided arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method doesn't set the \\\"length\\\" property of curried functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to curry.\\n\",\n       \"\\t     * @param {number} [arity=func.length] The arity of `func`.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Function} Returns the new curried function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var abc = function(a, b, c) {\\n\",\n       \"\\t     *   return [a, b, c];\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var curried = _.curry(abc);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * curried(1)(2)(3);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * curried(1, 2)(3);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * curried(1, 2, 3);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Curried with placeholders.\\n\",\n       \"\\t     * curried(1)(_, 3)(2);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function curry(func, arity, guard) {\\n\",\n       \"\\t      arity = guard ? undefined : arity;\\n\",\n       \"\\t      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\\n\",\n       \"\\t      result.placeholder = curry.placeholder;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.curry` except that arguments are applied to `func`\\n\",\n       \"\\t     * in the manner of `_.partialRight` instead of `_.partial`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\\n\",\n       \"\\t     * builds, may be used as a placeholder for provided arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method doesn't set the \\\"length\\\" property of curried functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to curry.\\n\",\n       \"\\t     * @param {number} [arity=func.length] The arity of `func`.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Function} Returns the new curried function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var abc = function(a, b, c) {\\n\",\n       \"\\t     *   return [a, b, c];\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var curried = _.curryRight(abc);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * curried(3)(2)(1);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * curried(2, 3)(1);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * curried(1, 2, 3);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Curried with placeholders.\\n\",\n       \"\\t     * curried(3)(1, _)(2);\\n\",\n       \"\\t     * // => [1, 2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function curryRight(func, arity, guard) {\\n\",\n       \"\\t      arity = guard ? undefined : arity;\\n\",\n       \"\\t      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\\n\",\n       \"\\t      result.placeholder = curryRight.placeholder;\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a debounced function that delays invoking `func` until after `wait`\\n\",\n       \"\\t     * milliseconds have elapsed since the last time the debounced function was\\n\",\n       \"\\t     * invoked. The debounced function comes with a `cancel` method to cancel\\n\",\n       \"\\t     * delayed `func` invocations and a `flush` method to immediately invoke them.\\n\",\n       \"\\t     * Provide `options` to indicate whether `func` should be invoked on the\\n\",\n       \"\\t     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\\n\",\n       \"\\t     * with the last arguments provided to the debounced function. Subsequent\\n\",\n       \"\\t     * calls to the debounced function return the result of the last `func`\\n\",\n       \"\\t     * invocation.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** If `leading` and `trailing` options are `true`, `func` is\\n\",\n       \"\\t     * invoked on the trailing edge of the timeout only if the debounced function\\n\",\n       \"\\t     * is invoked more than once during the `wait` timeout.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\\n\",\n       \"\\t     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\\n\",\n       \"\\t     * for details over the differences between `_.debounce` and `_.throttle`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to debounce.\\n\",\n       \"\\t     * @param {number} [wait=0] The number of milliseconds to delay.\\n\",\n       \"\\t     * @param {Object} [options={}] The options object.\\n\",\n       \"\\t     * @param {boolean} [options.leading=false]\\n\",\n       \"\\t     *  Specify invoking on the leading edge of the timeout.\\n\",\n       \"\\t     * @param {number} [options.maxWait]\\n\",\n       \"\\t     *  The maximum time `func` is allowed to be delayed before it's invoked.\\n\",\n       \"\\t     * @param {boolean} [options.trailing=true]\\n\",\n       \"\\t     *  Specify invoking on the trailing edge of the timeout.\\n\",\n       \"\\t     * @returns {Function} Returns the new debounced function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Avoid costly calculations while the window size is in flux.\\n\",\n       \"\\t     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\\n\",\n       \"\\t     * jQuery(element).on('click', _.debounce(sendMail, 300, {\\n\",\n       \"\\t     *   'leading': true,\\n\",\n       \"\\t     *   'trailing': false\\n\",\n       \"\\t     * }));\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\\n\",\n       \"\\t     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\\n\",\n       \"\\t     * var source = new EventSource('/stream');\\n\",\n       \"\\t     * jQuery(source).on('message', debounced);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Cancel the trailing debounced invocation.\\n\",\n       \"\\t     * jQuery(window).on('popstate', debounced.cancel);\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function debounce(func, wait, options) {\\n\",\n       \"\\t      var lastArgs,\\n\",\n       \"\\t          lastThis,\\n\",\n       \"\\t          maxWait,\\n\",\n       \"\\t          result,\\n\",\n       \"\\t          timerId,\\n\",\n       \"\\t          lastCallTime,\\n\",\n       \"\\t          lastInvokeTime = 0,\\n\",\n       \"\\t          leading = false,\\n\",\n       \"\\t          maxing = false,\\n\",\n       \"\\t          trailing = true;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      wait = toNumber(wait) || 0;\\n\",\n       \"\\t      if (isObject(options)) {\\n\",\n       \"\\t        leading = !!options.leading;\\n\",\n       \"\\t        maxing = 'maxWait' in options;\\n\",\n       \"\\t        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\\n\",\n       \"\\t        trailing = 'trailing' in options ? !!options.trailing : trailing;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function invokeFunc(time) {\\n\",\n       \"\\t        var args = lastArgs,\\n\",\n       \"\\t            thisArg = lastThis;\\n\",\n       \"\\t\\n\",\n       \"\\t        lastArgs = lastThis = undefined;\\n\",\n       \"\\t        lastInvokeTime = time;\\n\",\n       \"\\t        result = func.apply(thisArg, args);\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function leadingEdge(time) {\\n\",\n       \"\\t        // Reset any `maxWait` timer.\\n\",\n       \"\\t        lastInvokeTime = time;\\n\",\n       \"\\t        // Start the timer for the trailing edge.\\n\",\n       \"\\t        timerId = setTimeout(timerExpired, wait);\\n\",\n       \"\\t        // Invoke the leading edge.\\n\",\n       \"\\t        return leading ? invokeFunc(time) : result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function remainingWait(time) {\\n\",\n       \"\\t        var timeSinceLastCall = time - lastCallTime,\\n\",\n       \"\\t            timeSinceLastInvoke = time - lastInvokeTime,\\n\",\n       \"\\t            timeWaiting = wait - timeSinceLastCall;\\n\",\n       \"\\t\\n\",\n       \"\\t        return maxing\\n\",\n       \"\\t          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\\n\",\n       \"\\t          : timeWaiting;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function shouldInvoke(time) {\\n\",\n       \"\\t        var timeSinceLastCall = time - lastCallTime,\\n\",\n       \"\\t            timeSinceLastInvoke = time - lastInvokeTime;\\n\",\n       \"\\t\\n\",\n       \"\\t        // Either this is the first call, activity has stopped and we're at the\\n\",\n       \"\\t        // trailing edge, the system time has gone backwards and we're treating\\n\",\n       \"\\t        // it as the trailing edge, or we've hit the `maxWait` limit.\\n\",\n       \"\\t        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\\n\",\n       \"\\t          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function timerExpired() {\\n\",\n       \"\\t        var time = now();\\n\",\n       \"\\t        if (shouldInvoke(time)) {\\n\",\n       \"\\t          return trailingEdge(time);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        // Restart the timer.\\n\",\n       \"\\t        timerId = setTimeout(timerExpired, remainingWait(time));\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function trailingEdge(time) {\\n\",\n       \"\\t        timerId = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t        // Only invoke if we have `lastArgs` which means `func` has been\\n\",\n       \"\\t        // debounced at least once.\\n\",\n       \"\\t        if (trailing && lastArgs) {\\n\",\n       \"\\t          return invokeFunc(time);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        lastArgs = lastThis = undefined;\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function cancel() {\\n\",\n       \"\\t        if (timerId !== undefined) {\\n\",\n       \"\\t          clearTimeout(timerId);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        lastInvokeTime = 0;\\n\",\n       \"\\t        lastArgs = lastCallTime = lastThis = timerId = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function flush() {\\n\",\n       \"\\t        return timerId === undefined ? result : trailingEdge(now());\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      function debounced() {\\n\",\n       \"\\t        var time = now(),\\n\",\n       \"\\t            isInvoking = shouldInvoke(time);\\n\",\n       \"\\t\\n\",\n       \"\\t        lastArgs = arguments;\\n\",\n       \"\\t        lastThis = this;\\n\",\n       \"\\t        lastCallTime = time;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (isInvoking) {\\n\",\n       \"\\t          if (timerId === undefined) {\\n\",\n       \"\\t            return leadingEdge(lastCallTime);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (maxing) {\\n\",\n       \"\\t            // Handle invocations in a tight loop.\\n\",\n       \"\\t            timerId = setTimeout(timerExpired, wait);\\n\",\n       \"\\t            return invokeFunc(lastCallTime);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (timerId === undefined) {\\n\",\n       \"\\t          timerId = setTimeout(timerExpired, wait);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      debounced.cancel = cancel;\\n\",\n       \"\\t      debounced.flush = flush;\\n\",\n       \"\\t      return debounced;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Defers invoking the `func` until the current call stack has cleared. Any\\n\",\n       \"\\t     * additional arguments are provided to `func` when it's invoked.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to defer.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke `func` with.\\n\",\n       \"\\t     * @returns {number} Returns the timer id.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.defer(function(text) {\\n\",\n       \"\\t     *   console.log(text);\\n\",\n       \"\\t     * }, 'deferred');\\n\",\n       \"\\t     * // => Logs 'deferred' after one millisecond.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var defer = baseRest(function(func, args) {\\n\",\n       \"\\t      return baseDelay(func, 1, args);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Invokes `func` after `wait` milliseconds. Any additional arguments are\\n\",\n       \"\\t     * provided to `func` when it's invoked.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to delay.\\n\",\n       \"\\t     * @param {number} wait The number of milliseconds to delay invocation.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke `func` with.\\n\",\n       \"\\t     * @returns {number} Returns the timer id.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.delay(function(text) {\\n\",\n       \"\\t     *   console.log(text);\\n\",\n       \"\\t     * }, 1000, 'later');\\n\",\n       \"\\t     * // => Logs 'later' after one second.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var delay = baseRest(function(func, wait, args) {\\n\",\n       \"\\t      return baseDelay(func, toNumber(wait) || 0, args);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with arguments reversed.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to flip arguments for.\\n\",\n       \"\\t     * @returns {Function} Returns the new flipped function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var flipped = _.flip(function() {\\n\",\n       \"\\t     *   return _.toArray(arguments);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * flipped('a', 'b', 'c', 'd');\\n\",\n       \"\\t     * // => ['d', 'c', 'b', 'a']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function flip(func) {\\n\",\n       \"\\t      return createWrap(func, WRAP_FLIP_FLAG);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that memoizes the result of `func`. If `resolver` is\\n\",\n       \"\\t     * provided, it determines the cache key for storing the result based on the\\n\",\n       \"\\t     * arguments provided to the memoized function. By default, the first argument\\n\",\n       \"\\t     * provided to the memoized function is used as the map cache key. The `func`\\n\",\n       \"\\t     * is invoked with the `this` binding of the memoized function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** The cache is exposed as the `cache` property on the memoized\\n\",\n       \"\\t     * function. Its creation may be customized by replacing the `_.memoize.Cache`\\n\",\n       \"\\t     * constructor with one whose instances implement the\\n\",\n       \"\\t     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\\n\",\n       \"\\t     * method interface of `clear`, `delete`, `get`, `has`, and `set`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to have its output memoized.\\n\",\n       \"\\t     * @param {Function} [resolver] The function to resolve the cache key.\\n\",\n       \"\\t     * @returns {Function} Returns the new memoized function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': 2 };\\n\",\n       \"\\t     * var other = { 'c': 3, 'd': 4 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var values = _.memoize(_.values);\\n\",\n       \"\\t     * values(object);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * values(other);\\n\",\n       \"\\t     * // => [3, 4]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * object.a = 2;\\n\",\n       \"\\t     * values(object);\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Modify the result cache.\\n\",\n       \"\\t     * values.cache.set(object, ['a', 'b']);\\n\",\n       \"\\t     * values(object);\\n\",\n       \"\\t     * // => ['a', 'b']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Replace `_.memoize.Cache`.\\n\",\n       \"\\t     * _.memoize.Cache = WeakMap;\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function memoize(func, resolver) {\\n\",\n       \"\\t      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var memoized = function() {\\n\",\n       \"\\t        var args = arguments,\\n\",\n       \"\\t            key = resolver ? resolver.apply(this, args) : args[0],\\n\",\n       \"\\t            cache = memoized.cache;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (cache.has(key)) {\\n\",\n       \"\\t          return cache.get(key);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var result = func.apply(this, args);\\n\",\n       \"\\t        memoized.cache = cache.set(key, result) || cache;\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t      memoized.cache = new (memoize.Cache || MapCache);\\n\",\n       \"\\t      return memoized;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Expose `MapCache`.\\n\",\n       \"\\t    memoize.Cache = MapCache;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that negates the result of the predicate `func`. The\\n\",\n       \"\\t     * `func` predicate is invoked with the `this` binding and arguments of the\\n\",\n       \"\\t     * created function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} predicate The predicate to negate.\\n\",\n       \"\\t     * @returns {Function} Returns the new negated function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function isEven(n) {\\n\",\n       \"\\t     *   return n % 2 == 0;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\\n\",\n       \"\\t     * // => [1, 3, 5]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function negate(predicate) {\\n\",\n       \"\\t      if (typeof predicate != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        var args = arguments;\\n\",\n       \"\\t        switch (args.length) {\\n\",\n       \"\\t          case 0: return !predicate.call(this);\\n\",\n       \"\\t          case 1: return !predicate.call(this, args[0]);\\n\",\n       \"\\t          case 2: return !predicate.call(this, args[0], args[1]);\\n\",\n       \"\\t          case 3: return !predicate.call(this, args[0], args[1], args[2]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return !predicate.apply(this, args);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that is restricted to invoking `func` once. Repeat calls\\n\",\n       \"\\t     * to the function return the value of the first invocation. The `func` is\\n\",\n       \"\\t     * invoked with the `this` binding and arguments of the created function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to restrict.\\n\",\n       \"\\t     * @returns {Function} Returns the new restricted function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var initialize = _.once(createApplication);\\n\",\n       \"\\t     * initialize();\\n\",\n       \"\\t     * initialize();\\n\",\n       \"\\t     * // => `createApplication` is invoked once\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function once(func) {\\n\",\n       \"\\t      return before(2, func);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with its arguments transformed.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to wrap.\\n\",\n       \"\\t     * @param {...(Function|Function[])} [transforms=[_.identity]]\\n\",\n       \"\\t     *  The argument transforms.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function doubled(n) {\\n\",\n       \"\\t     *   return n * 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function square(n) {\\n\",\n       \"\\t     *   return n * n;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.overArgs(function(x, y) {\\n\",\n       \"\\t     *   return [x, y];\\n\",\n       \"\\t     * }, [square, doubled]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(9, 3);\\n\",\n       \"\\t     * // => [81, 6]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(10, 5);\\n\",\n       \"\\t     * // => [100, 10]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var overArgs = castRest(function(func, transforms) {\\n\",\n       \"\\t      transforms = (transforms.length == 1 && isArray(transforms[0]))\\n\",\n       \"\\t        ? arrayMap(transforms[0], baseUnary(getIteratee()))\\n\",\n       \"\\t        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\\n\",\n       \"\\t\\n\",\n       \"\\t      var funcsLength = transforms.length;\\n\",\n       \"\\t      return baseRest(function(args) {\\n\",\n       \"\\t        var index = -1,\\n\",\n       \"\\t            length = nativeMin(args.length, funcsLength);\\n\",\n       \"\\t\\n\",\n       \"\\t        while (++index < length) {\\n\",\n       \"\\t          args[index] = transforms[index].call(this, args[index]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return apply(func, this, args);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with `partials` prepended to the\\n\",\n       \"\\t     * arguments it receives. This method is like `_.bind` except it does **not**\\n\",\n       \"\\t     * alter the `this` binding.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\\n\",\n       \"\\t     * builds, may be used as a placeholder for partially applied arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method doesn't set the \\\"length\\\" property of partially\\n\",\n       \"\\t     * applied functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.2.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to partially apply arguments to.\\n\",\n       \"\\t     * @param {...*} [partials] The arguments to be partially applied.\\n\",\n       \"\\t     * @returns {Function} Returns the new partially applied function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function greet(greeting, name) {\\n\",\n       \"\\t     *   return greeting + ' ' + name;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var sayHelloTo = _.partial(greet, 'hello');\\n\",\n       \"\\t     * sayHelloTo('fred');\\n\",\n       \"\\t     * // => 'hello fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Partially applied with placeholders.\\n\",\n       \"\\t     * var greetFred = _.partial(greet, _, 'fred');\\n\",\n       \"\\t     * greetFred('hi');\\n\",\n       \"\\t     * // => 'hi fred'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var partial = baseRest(function(func, partials) {\\n\",\n       \"\\t      var holders = replaceHolders(partials, getHolder(partial));\\n\",\n       \"\\t      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.partial` except that partially applied arguments\\n\",\n       \"\\t     * are appended to the arguments it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\\n\",\n       \"\\t     * builds, may be used as a placeholder for partially applied arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method doesn't set the \\\"length\\\" property of partially\\n\",\n       \"\\t     * applied functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to partially apply arguments to.\\n\",\n       \"\\t     * @param {...*} [partials] The arguments to be partially applied.\\n\",\n       \"\\t     * @returns {Function} Returns the new partially applied function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function greet(greeting, name) {\\n\",\n       \"\\t     *   return greeting + ' ' + name;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var greetFred = _.partialRight(greet, 'fred');\\n\",\n       \"\\t     * greetFred('hi');\\n\",\n       \"\\t     * // => 'hi fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Partially applied with placeholders.\\n\",\n       \"\\t     * var sayHelloTo = _.partialRight(greet, 'hello', _);\\n\",\n       \"\\t     * sayHelloTo('fred');\\n\",\n       \"\\t     * // => 'hello fred'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var partialRight = baseRest(function(func, partials) {\\n\",\n       \"\\t      var holders = replaceHolders(partials, getHolder(partialRight));\\n\",\n       \"\\t      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with arguments arranged according\\n\",\n       \"\\t     * to the specified `indexes` where the argument value at the first index is\\n\",\n       \"\\t     * provided as the first argument, the argument value at the second index is\\n\",\n       \"\\t     * provided as the second argument, and so on.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to rearrange arguments for.\\n\",\n       \"\\t     * @param {...(number|number[])} indexes The arranged argument indexes.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var rearged = _.rearg(function(a, b, c) {\\n\",\n       \"\\t     *   return [a, b, c];\\n\",\n       \"\\t     * }, [2, 0, 1]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * rearged('b', 'c', 'a')\\n\",\n       \"\\t     * // => ['a', 'b', 'c']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var rearg = flatRest(function(func, indexes) {\\n\",\n       \"\\t      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with the `this` binding of the\\n\",\n       \"\\t     * created function and arguments from `start` and beyond provided as\\n\",\n       \"\\t     * an array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on the\\n\",\n       \"\\t     * [rest parameter](https://mdn.io/rest_parameters).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to apply a rest parameter to.\\n\",\n       \"\\t     * @param {number} [start=func.length-1] The start position of the rest parameter.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var say = _.rest(function(what, names) {\\n\",\n       \"\\t     *   return what + ' ' + _.initial(names).join(', ') +\\n\",\n       \"\\t     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * say('hello', 'fred', 'barney', 'pebbles');\\n\",\n       \"\\t     * // => 'hello fred, barney, & pebbles'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function rest(func, start) {\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      start = start === undefined ? start : toInteger(start);\\n\",\n       \"\\t      return baseRest(func, start);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with the `this` binding of the\\n\",\n       \"\\t     * create function and an array of arguments much like\\n\",\n       \"\\t     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on the\\n\",\n       \"\\t     * [spread operator](https://mdn.io/spread_operator).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.2.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to spread arguments over.\\n\",\n       \"\\t     * @param {number} [start=0] The start position of the spread.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var say = _.spread(function(who, what) {\\n\",\n       \"\\t     *   return who + ' says ' + what;\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * say(['fred', 'hello']);\\n\",\n       \"\\t     * // => 'fred says hello'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var numbers = Promise.all([\\n\",\n       \"\\t     *   Promise.resolve(40),\\n\",\n       \"\\t     *   Promise.resolve(36)\\n\",\n       \"\\t     * ]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * numbers.then(_.spread(function(x, y) {\\n\",\n       \"\\t     *   return x + y;\\n\",\n       \"\\t     * }));\\n\",\n       \"\\t     * // => a Promise of 76\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function spread(func, start) {\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      start = start == null ? 0 : nativeMax(toInteger(start), 0);\\n\",\n       \"\\t      return baseRest(function(args) {\\n\",\n       \"\\t        var array = args[start],\\n\",\n       \"\\t            otherArgs = castSlice(args, 0, start);\\n\",\n       \"\\t\\n\",\n       \"\\t        if (array) {\\n\",\n       \"\\t          arrayPush(otherArgs, array);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return apply(func, this, otherArgs);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a throttled function that only invokes `func` at most once per\\n\",\n       \"\\t     * every `wait` milliseconds. The throttled function comes with a `cancel`\\n\",\n       \"\\t     * method to cancel delayed `func` invocations and a `flush` method to\\n\",\n       \"\\t     * immediately invoke them. Provide `options` to indicate whether `func`\\n\",\n       \"\\t     * should be invoked on the leading and/or trailing edge of the `wait`\\n\",\n       \"\\t     * timeout. The `func` is invoked with the last arguments provided to the\\n\",\n       \"\\t     * throttled function. Subsequent calls to the throttled function return the\\n\",\n       \"\\t     * result of the last `func` invocation.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** If `leading` and `trailing` options are `true`, `func` is\\n\",\n       \"\\t     * invoked on the trailing edge of the timeout only if the throttled function\\n\",\n       \"\\t     * is invoked more than once during the `wait` timeout.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\\n\",\n       \"\\t     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\\n\",\n       \"\\t     * for details over the differences between `_.throttle` and `_.debounce`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to throttle.\\n\",\n       \"\\t     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\\n\",\n       \"\\t     * @param {Object} [options={}] The options object.\\n\",\n       \"\\t     * @param {boolean} [options.leading=true]\\n\",\n       \"\\t     *  Specify invoking on the leading edge of the timeout.\\n\",\n       \"\\t     * @param {boolean} [options.trailing=true]\\n\",\n       \"\\t     *  Specify invoking on the trailing edge of the timeout.\\n\",\n       \"\\t     * @returns {Function} Returns the new throttled function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Avoid excessively updating the position while scrolling.\\n\",\n       \"\\t     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\\n\",\n       \"\\t     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\\n\",\n       \"\\t     * jQuery(element).on('click', throttled);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Cancel the trailing throttled invocation.\\n\",\n       \"\\t     * jQuery(window).on('popstate', throttled.cancel);\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function throttle(func, wait, options) {\\n\",\n       \"\\t      var leading = true,\\n\",\n       \"\\t          trailing = true;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (typeof func != 'function') {\\n\",\n       \"\\t        throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isObject(options)) {\\n\",\n       \"\\t        leading = 'leading' in options ? !!options.leading : leading;\\n\",\n       \"\\t        trailing = 'trailing' in options ? !!options.trailing : trailing;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return debounce(func, wait, {\\n\",\n       \"\\t        'leading': leading,\\n\",\n       \"\\t        'maxWait': wait,\\n\",\n       \"\\t        'trailing': trailing\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that accepts up to one argument, ignoring any\\n\",\n       \"\\t     * additional arguments.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {Function} func The function to cap arguments for.\\n\",\n       \"\\t     * @returns {Function} Returns the new capped function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(['6', '8', '10'], _.unary(parseInt));\\n\",\n       \"\\t     * // => [6, 8, 10]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function unary(func) {\\n\",\n       \"\\t      return ary(func, 1);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that provides `value` to `wrapper` as its first\\n\",\n       \"\\t     * argument. Any additional arguments provided to the function are appended\\n\",\n       \"\\t     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\\n\",\n       \"\\t     * binding of the created function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Function\\n\",\n       \"\\t     * @param {*} value The value to wrap.\\n\",\n       \"\\t     * @param {Function} [wrapper=identity] The wrapper function.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var p = _.wrap(_.escape, function(func, text) {\\n\",\n       \"\\t     *   return '<p>' + func(text) + '</p>';\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * p('fred, barney, & pebbles');\\n\",\n       \"\\t     * // => '<p>fred, barney, &amp; pebbles</p>'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function wrap(value, wrapper) {\\n\",\n       \"\\t      return partial(castFunction(wrapper), value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Casts `value` as an array if it's not one.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.4.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the cast array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.castArray(1);\\n\",\n       \"\\t     * // => [1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.castArray({ 'a': 1 });\\n\",\n       \"\\t     * // => [{ 'a': 1 }]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.castArray('abc');\\n\",\n       \"\\t     * // => ['abc']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.castArray(null);\\n\",\n       \"\\t     * // => [null]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.castArray(undefined);\\n\",\n       \"\\t     * // => [undefined]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.castArray();\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [1, 2, 3];\\n\",\n       \"\\t     * console.log(_.castArray(array) === array);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function castArray() {\\n\",\n       \"\\t      if (!arguments.length) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var value = arguments[0];\\n\",\n       \"\\t      return isArray(value) ? value : [value];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a shallow clone of `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is loosely based on the\\n\",\n       \"\\t     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\\n\",\n       \"\\t     * and supports cloning arrays, array buffers, booleans, date objects, maps,\\n\",\n       \"\\t     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\\n\",\n       \"\\t     * arrays. The own enumerable properties of `arguments` objects are cloned\\n\",\n       \"\\t     * as plain objects. An empty object is returned for uncloneable values such\\n\",\n       \"\\t     * as error objects, functions, DOM nodes, and WeakMaps.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to clone.\\n\",\n       \"\\t     * @returns {*} Returns the cloned value.\\n\",\n       \"\\t     * @see _.cloneDeep\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'a': 1 }, { 'b': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var shallow = _.clone(objects);\\n\",\n       \"\\t     * console.log(shallow[0] === objects[0]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function clone(value) {\\n\",\n       \"\\t      return baseClone(value, CLONE_SYMBOLS_FLAG);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.clone` except that it accepts `customizer` which\\n\",\n       \"\\t     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\\n\",\n       \"\\t     * cloning is handled by the method instead. The `customizer` is invoked with\\n\",\n       \"\\t     * up to four arguments; (value [, index|key, object, stack]).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to clone.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize cloning.\\n\",\n       \"\\t     * @returns {*} Returns the cloned value.\\n\",\n       \"\\t     * @see _.cloneDeepWith\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(value) {\\n\",\n       \"\\t     *   if (_.isElement(value)) {\\n\",\n       \"\\t     *     return value.cloneNode(false);\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var el = _.cloneWith(document.body, customizer);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(el === document.body);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     * console.log(el.nodeName);\\n\",\n       \"\\t     * // => 'BODY'\\n\",\n       \"\\t     * console.log(el.childNodes.length);\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneWith(value, customizer) {\\n\",\n       \"\\t      customizer = typeof customizer == 'function' ? customizer : undefined;\\n\",\n       \"\\t      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.clone` except that it recursively clones `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to recursively clone.\\n\",\n       \"\\t     * @returns {*} Returns the deep cloned value.\\n\",\n       \"\\t     * @see _.clone\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'a': 1 }, { 'b': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var deep = _.cloneDeep(objects);\\n\",\n       \"\\t     * console.log(deep[0] === objects[0]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneDeep(value) {\\n\",\n       \"\\t      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.cloneWith` except that it recursively clones `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to recursively clone.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize cloning.\\n\",\n       \"\\t     * @returns {*} Returns the deep cloned value.\\n\",\n       \"\\t     * @see _.cloneWith\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(value) {\\n\",\n       \"\\t     *   if (_.isElement(value)) {\\n\",\n       \"\\t     *     return value.cloneNode(true);\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var el = _.cloneDeepWith(document.body, customizer);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(el === document.body);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     * console.log(el.nodeName);\\n\",\n       \"\\t     * // => 'BODY'\\n\",\n       \"\\t     * console.log(el.childNodes.length);\\n\",\n       \"\\t     * // => 20\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cloneDeepWith(value, customizer) {\\n\",\n       \"\\t      customizer = typeof customizer == 'function' ? customizer : undefined;\\n\",\n       \"\\t      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `object` conforms to `source` by invoking the predicate\\n\",\n       \"\\t     * properties of `source` with the corresponding property values of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is equivalent to `_.conforms` when `source` is\\n\",\n       \"\\t     * partially applied.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.14.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Object} source The object of property predicates to conform to.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': 2 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function conformsTo(object, source) {\\n\",\n       \"\\t      return source == null || baseConformsTo(object, source, keys(source));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Performs a\\n\",\n       \"\\t     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\\n\",\n       \"\\t     * comparison between two values to determine if they are equivalent.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1 };\\n\",\n       \"\\t     * var other = { 'a': 1 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.eq(object, object);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.eq(object, other);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.eq('a', 'a');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.eq('a', Object('a'));\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.eq(NaN, NaN);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function eq(value, other) {\\n\",\n       \"\\t      return value === other || (value !== value && other !== other);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is greater than `other`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.9.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is greater than `other`,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @see _.lt\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.gt(3, 1);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.gt(3, 3);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.gt(1, 3);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var gt = createRelationalOperation(baseGt);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is greater than or equal to `other`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.9.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is greater than or equal to\\n\",\n       \"\\t     *  `other`, else `false`.\\n\",\n       \"\\t     * @see _.lte\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.gte(3, 1);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.gte(3, 3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.gte(1, 3);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var gte = createRelationalOperation(function(value, other) {\\n\",\n       \"\\t      return value >= other;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is likely an `arguments` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArguments(function() { return arguments; }());\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArguments([1, 2, 3]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\\n\",\n       \"\\t      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\\n\",\n       \"\\t        !propertyIsEnumerable.call(value, 'callee');\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as an `Array` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an array, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArray([1, 2, 3]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArray(document.body.children);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArray('abc');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArray(_.noop);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isArray = Array.isArray;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as an `ArrayBuffer` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.3.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayBuffer(new ArrayBuffer(2));\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayBuffer(new Array(2));\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is array-like. A value is considered array-like if it's\\n\",\n       \"\\t     * not a function and has a `value.length` that's an integer greater than or\\n\",\n       \"\\t     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLike([1, 2, 3]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLike(document.body.children);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLike('abc');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLike(_.noop);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isArrayLike(value) {\\n\",\n       \"\\t      return value != null && isLength(value.length) && !isFunction(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.isArrayLike` except that it also checks if `value`\\n\",\n       \"\\t     * is an object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an array-like object,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLikeObject([1, 2, 3]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLikeObject(document.body.children);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLikeObject('abc');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isArrayLikeObject(_.noop);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isArrayLikeObject(value) {\\n\",\n       \"\\t      return isObjectLike(value) && isArrayLike(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a boolean primitive or object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isBoolean(false);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isBoolean(null);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isBoolean(value) {\\n\",\n       \"\\t      return value === true || value === false ||\\n\",\n       \"\\t        (isObjectLike(value) && baseGetTag(value) == boolTag);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a buffer.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.3.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isBuffer(new Buffer(2));\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isBuffer(new Uint8Array(2));\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isBuffer = nativeIsBuffer || stubFalse;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `Date` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isDate(new Date);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isDate('Mon April 23 2012');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is likely a DOM element.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isElement(document.body);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isElement('<body>');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isElement(value) {\\n\",\n       \"\\t      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is an empty object, collection, map, or set.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Objects are considered empty if they have no own enumerable string keyed\\n\",\n       \"\\t     * properties.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\\n\",\n       \"\\t     * jQuery-like collections are considered empty if they have a `length` of `0`.\\n\",\n       \"\\t     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is empty, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEmpty(null);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEmpty(true);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEmpty(1);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEmpty([1, 2, 3]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEmpty({ 'a': 1 });\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isEmpty(value) {\\n\",\n       \"\\t      if (value == null) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isArrayLike(value) &&\\n\",\n       \"\\t          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\\n\",\n       \"\\t            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\\n\",\n       \"\\t        return !value.length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var tag = getTag(value);\\n\",\n       \"\\t      if (tag == mapTag || tag == setTag) {\\n\",\n       \"\\t        return !value.size;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isPrototype(value)) {\\n\",\n       \"\\t        return !baseKeys(value).length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (var key in value) {\\n\",\n       \"\\t        if (hasOwnProperty.call(value, key)) {\\n\",\n       \"\\t          return false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Performs a deep comparison between two values to determine if they are\\n\",\n       \"\\t     * equivalent.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method supports comparing arrays, array buffers, booleans,\\n\",\n       \"\\t     * date objects, error objects, maps, numbers, `Object` objects, regexes,\\n\",\n       \"\\t     * sets, strings, symbols, and typed arrays. `Object` objects are compared\\n\",\n       \"\\t     * by their own, not inherited, enumerable properties. Functions and DOM\\n\",\n       \"\\t     * nodes are compared by strict equality, i.e. `===`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1 };\\n\",\n       \"\\t     * var other = { 'a': 1 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEqual(object, other);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * object === other;\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isEqual(value, other) {\\n\",\n       \"\\t      return baseIsEqual(value, other);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.isEqual` except that it accepts `customizer` which\\n\",\n       \"\\t     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\\n\",\n       \"\\t     * are handled by the method instead. The `customizer` is invoked with up to\\n\",\n       \"\\t     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize comparisons.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function isGreeting(value) {\\n\",\n       \"\\t     *   return /^h(?:i|ello)$/.test(value);\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(objValue, othValue) {\\n\",\n       \"\\t     *   if (isGreeting(objValue) && isGreeting(othValue)) {\\n\",\n       \"\\t     *     return true;\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = ['hello', 'goodbye'];\\n\",\n       \"\\t     * var other = ['hi', 'goodbye'];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isEqualWith(array, other, customizer);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isEqualWith(value, other, customizer) {\\n\",\n       \"\\t      customizer = typeof customizer == 'function' ? customizer : undefined;\\n\",\n       \"\\t      var result = customizer ? customizer(value, other) : undefined;\\n\",\n       \"\\t      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\\n\",\n       \"\\t     * `SyntaxError`, `TypeError`, or `URIError` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isError(new Error);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isError(Error);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isError(value) {\\n\",\n       \"\\t      if (!isObjectLike(value)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var tag = baseGetTag(value);\\n\",\n       \"\\t      return tag == errorTag || tag == domExcTag ||\\n\",\n       \"\\t        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a finite primitive number.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isFinite(3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isFinite(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isFinite(Infinity);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isFinite('3');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isFinite(value) {\\n\",\n       \"\\t      return typeof value == 'number' && nativeIsFinite(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `Function` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a function, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isFunction(_);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isFunction(/abc/);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isFunction(value) {\\n\",\n       \"\\t      if (!isObject(value)) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // The use of `Object#toString` avoids issues with the `typeof` operator\\n\",\n       \"\\t      // in Safari 9 which returns 'object' for typed arrays and other constructors.\\n\",\n       \"\\t      var tag = baseGetTag(value);\\n\",\n       \"\\t      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is an integer.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isInteger(3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isInteger(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isInteger(Infinity);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isInteger('3');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isInteger(value) {\\n\",\n       \"\\t      return typeof value == 'number' && value == toInteger(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a valid array-like length.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is loosely based on\\n\",\n       \"\\t     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isLength(3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isLength(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isLength(Infinity);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isLength('3');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isLength(value) {\\n\",\n       \"\\t      return typeof value == 'number' &&\\n\",\n       \"\\t        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is the\\n\",\n       \"\\t     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\\n\",\n       \"\\t     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is an object, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObject({});\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObject([1, 2, 3]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObject(_.noop);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObject(null);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isObject(value) {\\n\",\n       \"\\t      var type = typeof value;\\n\",\n       \"\\t      return value != null && (type == 'object' || type == 'function');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is object-like. A value is object-like if it's not `null`\\n\",\n       \"\\t     * and has a `typeof` result of \\\"object\\\".\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObjectLike({});\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObjectLike([1, 2, 3]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObjectLike(_.noop);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isObjectLike(null);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isObjectLike(value) {\\n\",\n       \"\\t      return value != null && typeof value == 'object';\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `Map` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.3.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isMap(new Map);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isMap(new WeakMap);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Performs a partial deep comparison between `object` and `source` to\\n\",\n       \"\\t     * determine if `object` contains equivalent property values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is equivalent to `_.matches` when `source` is\\n\",\n       \"\\t     * partially applied.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Partial comparisons will match empty array and empty object `source`\\n\",\n       \"\\t     * values against any array or object value, respectively. See `_.isEqual`\\n\",\n       \"\\t     * for a list of supported value comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Object} source The object of property values to match.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': 2 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isMatch(object, { 'b': 2 });\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isMatch(object, { 'b': 1 });\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isMatch(object, source) {\\n\",\n       \"\\t      return object === source || baseIsMatch(object, source, getMatchData(source));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.isMatch` except that it accepts `customizer` which\\n\",\n       \"\\t     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\\n\",\n       \"\\t     * are handled by the method instead. The `customizer` is invoked with five\\n\",\n       \"\\t     * arguments: (objValue, srcValue, index|key, object, source).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Object} source The object of property values to match.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize comparisons.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function isGreeting(value) {\\n\",\n       \"\\t     *   return /^h(?:i|ello)$/.test(value);\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(objValue, srcValue) {\\n\",\n       \"\\t     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\\n\",\n       \"\\t     *     return true;\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'greeting': 'hello' };\\n\",\n       \"\\t     * var source = { 'greeting': 'hi' };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isMatchWith(object, source, customizer);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isMatchWith(object, source, customizer) {\\n\",\n       \"\\t      customizer = typeof customizer == 'function' ? customizer : undefined;\\n\",\n       \"\\t      return baseIsMatch(object, source, getMatchData(source), customizer);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is `NaN`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\\n\",\n       \"\\t     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\\n\",\n       \"\\t     * `undefined` and other non-number values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNaN(NaN);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNaN(new Number(NaN));\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * isNaN(undefined);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNaN(undefined);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isNaN(value) {\\n\",\n       \"\\t      // An `NaN` primitive is the only value that is not equal to itself.\\n\",\n       \"\\t      // Perform the `toStringTag` check first to avoid errors with some\\n\",\n       \"\\t      // ActiveX objects in IE.\\n\",\n       \"\\t      return isNumber(value) && value != +value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a pristine native function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method can't reliably detect native functions in the presence\\n\",\n       \"\\t     * of the core-js package because core-js circumvents this kind of detection.\\n\",\n       \"\\t     * Despite multiple requests, the core-js maintainer has made it clear: any\\n\",\n       \"\\t     * attempt to fix the detection will be obstructed. As a result, we're left\\n\",\n       \"\\t     * with little choice but to throw an error. Unfortunately, this also affects\\n\",\n       \"\\t     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\\n\",\n       \"\\t     * which rely on core-js.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a native function,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNative(Array.prototype.push);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNative(_);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isNative(value) {\\n\",\n       \"\\t      if (isMaskable(value)) {\\n\",\n       \"\\t        throw new Error(CORE_ERROR_TEXT);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseIsNative(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is `null`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNull(null);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNull(void 0);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isNull(value) {\\n\",\n       \"\\t      return value === null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is `null` or `undefined`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNil(null);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNil(void 0);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNil(NaN);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isNil(value) {\\n\",\n       \"\\t      return value == null;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `Number` primitive or object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\\n\",\n       \"\\t     * classified as numbers, use the `_.isFinite` method.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a number, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNumber(3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNumber(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNumber(Infinity);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isNumber('3');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isNumber(value) {\\n\",\n       \"\\t      return typeof value == 'number' ||\\n\",\n       \"\\t        (isObjectLike(value) && baseGetTag(value) == numberTag);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a plain object, that is, an object created by the\\n\",\n       \"\\t     * `Object` constructor or one with a `[[Prototype]]` of `null`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.8.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isPlainObject(new Foo);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isPlainObject([1, 2, 3]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isPlainObject({ 'x': 0, 'y': 0 });\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isPlainObject(Object.create(null));\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isPlainObject(value) {\\n\",\n       \"\\t      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\\n\",\n       \"\\t        return false;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var proto = getPrototype(value);\\n\",\n       \"\\t      if (proto === null) {\\n\",\n       \"\\t        return true;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\\n\",\n       \"\\t      return typeof Ctor == 'function' && Ctor instanceof Ctor &&\\n\",\n       \"\\t        funcToString.call(Ctor) == objectCtorString;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `RegExp` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isRegExp(/abc/);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isRegExp('/abc/');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\\n\",\n       \"\\t     * double precision number which isn't the result of a rounded unsafe integer.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSafeInteger(3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSafeInteger(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSafeInteger(Infinity);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSafeInteger('3');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isSafeInteger(value) {\\n\",\n       \"\\t      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `Set` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.3.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSet(new Set);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSet(new WeakSet);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `String` primitive or object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a string, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isString('abc');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isString(1);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isString(value) {\\n\",\n       \"\\t      return typeof value == 'string' ||\\n\",\n       \"\\t        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `Symbol` primitive or object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSymbol(Symbol.iterator);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isSymbol('abc');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isSymbol(value) {\\n\",\n       \"\\t      return typeof value == 'symbol' ||\\n\",\n       \"\\t        (isObjectLike(value) && baseGetTag(value) == symbolTag);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a typed array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isTypedArray(new Uint8Array);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isTypedArray([]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is `undefined`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isUndefined(void 0);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isUndefined(null);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isUndefined(value) {\\n\",\n       \"\\t      return value === undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `WeakMap` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.3.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isWeakMap(new WeakMap);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isWeakMap(new Map);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isWeakMap(value) {\\n\",\n       \"\\t      return isObjectLike(value) && getTag(value) == weakMapTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is classified as a `WeakSet` object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.3.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isWeakSet(new WeakSet);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.isWeakSet(new Set);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function isWeakSet(value) {\\n\",\n       \"\\t      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is less than `other`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.9.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is less than `other`,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @see _.gt\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lt(1, 3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lt(3, 3);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lt(3, 1);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var lt = createRelationalOperation(baseLt);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `value` is less than or equal to `other`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.9.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to compare.\\n\",\n       \"\\t     * @param {*} other The other value to compare.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `value` is less than or equal to\\n\",\n       \"\\t     *  `other`, else `false`.\\n\",\n       \"\\t     * @see _.gte\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lte(1, 3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lte(3, 3);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lte(3, 1);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var lte = createRelationalOperation(function(value, other) {\\n\",\n       \"\\t      return value <= other;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to an array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {Array} Returns the converted array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toArray({ 'a': 1, 'b': 2 });\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toArray('abc');\\n\",\n       \"\\t     * // => ['a', 'b', 'c']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toArray(1);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toArray(null);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toArray(value) {\\n\",\n       \"\\t      if (!value) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isArrayLike(value)) {\\n\",\n       \"\\t        return isString(value) ? stringToArray(value) : copyArray(value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (symIterator && value[symIterator]) {\\n\",\n       \"\\t        return iteratorToArray(value[symIterator]());\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var tag = getTag(value),\\n\",\n       \"\\t          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\\n\",\n       \"\\t\\n\",\n       \"\\t      return func(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a finite number.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.12.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {number} Returns the converted number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toFinite(3.2);\\n\",\n       \"\\t     * // => 3.2\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toFinite(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => 5e-324\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toFinite(Infinity);\\n\",\n       \"\\t     * // => 1.7976931348623157e+308\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toFinite('3.2');\\n\",\n       \"\\t     * // => 3.2\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toFinite(value) {\\n\",\n       \"\\t      if (!value) {\\n\",\n       \"\\t        return value === 0 ? value : 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      value = toNumber(value);\\n\",\n       \"\\t      if (value === INFINITY || value === -INFINITY) {\\n\",\n       \"\\t        var sign = (value < 0 ? -1 : 1);\\n\",\n       \"\\t        return sign * MAX_INTEGER;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return value === value ? value : 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to an integer.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is loosely based on\\n\",\n       \"\\t     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {number} Returns the converted integer.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toInteger(3.2);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toInteger(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toInteger(Infinity);\\n\",\n       \"\\t     * // => 1.7976931348623157e+308\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toInteger('3.2');\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toInteger(value) {\\n\",\n       \"\\t      var result = toFinite(value),\\n\",\n       \"\\t          remainder = result % 1;\\n\",\n       \"\\t\\n\",\n       \"\\t      return result === result ? (remainder ? result - remainder : result) : 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to an integer suitable for use as the length of an\\n\",\n       \"\\t     * array-like object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {number} Returns the converted integer.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLength(3.2);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLength(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLength(Infinity);\\n\",\n       \"\\t     * // => 4294967295\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLength('3.2');\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toLength(value) {\\n\",\n       \"\\t      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a number.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to process.\\n\",\n       \"\\t     * @returns {number} Returns the number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toNumber(3.2);\\n\",\n       \"\\t     * // => 3.2\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toNumber(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => 5e-324\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toNumber(Infinity);\\n\",\n       \"\\t     * // => Infinity\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toNumber('3.2');\\n\",\n       \"\\t     * // => 3.2\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toNumber(value) {\\n\",\n       \"\\t      if (typeof value == 'number') {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isSymbol(value)) {\\n\",\n       \"\\t        return NAN;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isObject(value)) {\\n\",\n       \"\\t        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\\n\",\n       \"\\t        value = isObject(other) ? (other + '') : other;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (typeof value != 'string') {\\n\",\n       \"\\t        return value === 0 ? value : +value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      value = value.replace(reTrim, '');\\n\",\n       \"\\t      var isBinary = reIsBinary.test(value);\\n\",\n       \"\\t      return (isBinary || reIsOctal.test(value))\\n\",\n       \"\\t        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\\n\",\n       \"\\t        : (reIsBadHex.test(value) ? NAN : +value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a plain object flattening inherited enumerable string\\n\",\n       \"\\t     * keyed properties of `value` to own properties of the plain object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {Object} Returns the converted plain object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.assign({ 'a': 1 }, new Foo);\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2, 'c': 3 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toPlainObject(value) {\\n\",\n       \"\\t      return copyObject(value, keysIn(value));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a safe integer. A safe integer can be compared and\\n\",\n       \"\\t     * represented correctly.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {number} Returns the converted integer.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toSafeInteger(3.2);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toSafeInteger(Number.MIN_VALUE);\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toSafeInteger(Infinity);\\n\",\n       \"\\t     * // => 9007199254740991\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toSafeInteger('3.2');\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toSafeInteger(value) {\\n\",\n       \"\\t      return value\\n\",\n       \"\\t        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\\n\",\n       \"\\t        : (value === 0 ? value : 0);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a string. An empty string is returned for `null`\\n\",\n       \"\\t     * and `undefined` values. The sign of `-0` is preserved.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Lang\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {string} Returns the converted string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toString(null);\\n\",\n       \"\\t     * // => ''\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toString(-0);\\n\",\n       \"\\t     * // => '-0'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toString([1, 2, 3]);\\n\",\n       \"\\t     * // => '1,2,3'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toString(value) {\\n\",\n       \"\\t      return value == null ? '' : baseToString(value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Assigns own enumerable string keyed properties of source objects to the\\n\",\n       \"\\t     * destination object. Source objects are applied from left to right.\\n\",\n       \"\\t     * Subsequent sources overwrite property assignments of previous sources.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object` and is loosely based on\\n\",\n       \"\\t     * [`Object.assign`](https://mdn.io/Object/assign).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.10.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} [sources] The source objects.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.assignIn\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Bar() {\\n\",\n       \"\\t     *   this.c = 3;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.b = 2;\\n\",\n       \"\\t     * Bar.prototype.d = 4;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.assign({ 'a': 0 }, new Foo, new Bar);\\n\",\n       \"\\t     * // => { 'a': 1, 'c': 3 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var assign = createAssigner(function(object, source) {\\n\",\n       \"\\t      if (isPrototype(source) || isArrayLike(source)) {\\n\",\n       \"\\t        copyObject(source, keys(source), object);\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (var key in source) {\\n\",\n       \"\\t        if (hasOwnProperty.call(source, key)) {\\n\",\n       \"\\t          assignValue(object, key, source[key]);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.assign` except that it iterates over own and\\n\",\n       \"\\t     * inherited source properties.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @alias extend\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} [sources] The source objects.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.assign\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Bar() {\\n\",\n       \"\\t     *   this.c = 3;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.b = 2;\\n\",\n       \"\\t     * Bar.prototype.d = 4;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var assignIn = createAssigner(function(object, source) {\\n\",\n       \"\\t      copyObject(source, keysIn(source), object);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.assignIn` except that it accepts `customizer`\\n\",\n       \"\\t     * which is invoked to produce the assigned values. If `customizer` returns\\n\",\n       \"\\t     * `undefined`, assignment is handled by the method instead. The `customizer`\\n\",\n       \"\\t     * is invoked with five arguments: (objValue, srcValue, key, object, source).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @alias extendWith\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} sources The source objects.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize assigned values.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.assignWith\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(objValue, srcValue) {\\n\",\n       \"\\t     *   return _.isUndefined(objValue) ? srcValue : objValue;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var defaults = _.partialRight(_.assignInWith, customizer);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\\n\",\n       \"\\t      copyObject(source, keysIn(source), object, customizer);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.assign` except that it accepts `customizer`\\n\",\n       \"\\t     * which is invoked to produce the assigned values. If `customizer` returns\\n\",\n       \"\\t     * `undefined`, assignment is handled by the method instead. The `customizer`\\n\",\n       \"\\t     * is invoked with five arguments: (objValue, srcValue, key, object, source).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} sources The source objects.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize assigned values.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.assignInWith\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(objValue, srcValue) {\\n\",\n       \"\\t     *   return _.isUndefined(objValue) ? srcValue : objValue;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var defaults = _.partialRight(_.assignWith, customizer);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\\n\",\n       \"\\t      copyObject(source, keys(source), object, customizer);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of values corresponding to `paths` of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {...(string|string[])} [paths] The property paths to pick.\\n\",\n       \"\\t     * @returns {Array} Returns the picked values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.at(object, ['a[0].b.c', 'a[1]']);\\n\",\n       \"\\t     * // => [3, 4]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var at = flatRest(baseAt);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object that inherits from the `prototype` object. If a\\n\",\n       \"\\t     * `properties` object is given, its own enumerable string keyed properties\\n\",\n       \"\\t     * are assigned to the created object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.3.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} prototype The object to inherit from.\\n\",\n       \"\\t     * @param {Object} [properties] The properties to assign to the object.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Shape() {\\n\",\n       \"\\t     *   this.x = 0;\\n\",\n       \"\\t     *   this.y = 0;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Circle() {\\n\",\n       \"\\t     *   Shape.call(this);\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Circle.prototype = _.create(Shape.prototype, {\\n\",\n       \"\\t     *   'constructor': Circle\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var circle = new Circle;\\n\",\n       \"\\t     * circle instanceof Circle;\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * circle instanceof Shape;\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function create(prototype, properties) {\\n\",\n       \"\\t      var result = baseCreate(prototype);\\n\",\n       \"\\t      return properties == null ? result : baseAssign(result, properties);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Assigns own and inherited enumerable string keyed properties of source\\n\",\n       \"\\t     * objects to the destination object for all destination properties that\\n\",\n       \"\\t     * resolve to `undefined`. Source objects are applied from left to right.\\n\",\n       \"\\t     * Once a property is set, additional values of the same property are ignored.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} [sources] The source objects.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.defaultsDeep\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\\n\",\n       \"\\t     * // => { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var defaults = baseRest(function(object, sources) {\\n\",\n       \"\\t      object = Object(object);\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = -1;\\n\",\n       \"\\t      var length = sources.length;\\n\",\n       \"\\t      var guard = length > 2 ? sources[2] : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\\n\",\n       \"\\t        length = 1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var source = sources[index];\\n\",\n       \"\\t        var props = keysIn(source);\\n\",\n       \"\\t        var propsIndex = -1;\\n\",\n       \"\\t        var propsLength = props.length;\\n\",\n       \"\\t\\n\",\n       \"\\t        while (++propsIndex < propsLength) {\\n\",\n       \"\\t          var key = props[propsIndex];\\n\",\n       \"\\t          var value = object[key];\\n\",\n       \"\\t\\n\",\n       \"\\t          if (value === undefined ||\\n\",\n       \"\\t              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\\n\",\n       \"\\t            object[key] = source[key];\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.defaults` except that it recursively assigns\\n\",\n       \"\\t     * default properties.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.10.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} [sources] The source objects.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.defaults\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\\n\",\n       \"\\t     * // => { 'a': { 'b': 2, 'c': 3 } }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var defaultsDeep = baseRest(function(args) {\\n\",\n       \"\\t      args.push(undefined, customDefaultsMerge);\\n\",\n       \"\\t      return apply(mergeWith, undefined, args);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.find` except that it returns the key of the first\\n\",\n       \"\\t     * element `predicate` returns truthy for instead of the element itself.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.1.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {string|undefined} Returns the key of the matched element,\\n\",\n       \"\\t     *  else `undefined`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = {\\n\",\n       \"\\t     *   'barney':  { 'age': 36, 'active': true },\\n\",\n       \"\\t     *   'fred':    { 'age': 40, 'active': false },\\n\",\n       \"\\t     *   'pebbles': { 'age': 1,  'active': true }\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.findKey(users, function(o) { return o.age < 40; });\\n\",\n       \"\\t     * // => 'barney' (iteration order is not guaranteed)\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.findKey(users, { 'age': 1, 'active': true });\\n\",\n       \"\\t     * // => 'pebbles'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.findKey(users, ['active', false]);\\n\",\n       \"\\t     * // => 'fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.findKey(users, 'active');\\n\",\n       \"\\t     * // => 'barney'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function findKey(object, predicate) {\\n\",\n       \"\\t      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.findKey` except that it iterates over elements of\\n\",\n       \"\\t     * a collection in the opposite order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {string|undefined} Returns the key of the matched element,\\n\",\n       \"\\t     *  else `undefined`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = {\\n\",\n       \"\\t     *   'barney':  { 'age': 36, 'active': true },\\n\",\n       \"\\t     *   'fred':    { 'age': 40, 'active': false },\\n\",\n       \"\\t     *   'pebbles': { 'age': 1,  'active': true }\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.findLastKey(users, function(o) { return o.age < 40; });\\n\",\n       \"\\t     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.findLastKey(users, { 'age': 36, 'active': true });\\n\",\n       \"\\t     * // => 'barney'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.findLastKey(users, ['active', false]);\\n\",\n       \"\\t     * // => 'fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.findLastKey(users, 'active');\\n\",\n       \"\\t     * // => 'pebbles'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function findLastKey(object, predicate) {\\n\",\n       \"\\t      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Iterates over own and inherited enumerable string keyed properties of an\\n\",\n       \"\\t     * object and invokes `iteratee` for each property. The iteratee is invoked\\n\",\n       \"\\t     * with three arguments: (value, key, object). Iteratee functions may exit\\n\",\n       \"\\t     * iteration early by explicitly returning `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.3.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.forInRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forIn(new Foo, function(value, key) {\\n\",\n       \"\\t     *   console.log(key);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function forIn(object, iteratee) {\\n\",\n       \"\\t      return object == null\\n\",\n       \"\\t        ? object\\n\",\n       \"\\t        : baseFor(object, getIteratee(iteratee, 3), keysIn);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.forIn` except that it iterates over properties of\\n\",\n       \"\\t     * `object` in the opposite order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.forIn\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forInRight(new Foo, function(value, key) {\\n\",\n       \"\\t     *   console.log(key);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function forInRight(object, iteratee) {\\n\",\n       \"\\t      return object == null\\n\",\n       \"\\t        ? object\\n\",\n       \"\\t        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Iterates over own enumerable string keyed properties of an object and\\n\",\n       \"\\t     * invokes `iteratee` for each property. The iteratee is invoked with three\\n\",\n       \"\\t     * arguments: (value, key, object). Iteratee functions may exit iteration\\n\",\n       \"\\t     * early by explicitly returning `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.3.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.forOwnRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forOwn(new Foo, function(value, key) {\\n\",\n       \"\\t     *   console.log(key);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function forOwn(object, iteratee) {\\n\",\n       \"\\t      return object && baseForOwn(object, getIteratee(iteratee, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.forOwn` except that it iterates over properties of\\n\",\n       \"\\t     * `object` in the opposite order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @see _.forOwn\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.forOwnRight(new Foo, function(value, key) {\\n\",\n       \"\\t     *   console.log(key);\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function forOwnRight(object, iteratee) {\\n\",\n       \"\\t      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of function property names from own enumerable properties\\n\",\n       \"\\t     * of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the function names.\\n\",\n       \"\\t     * @see _.functionsIn\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = _.constant('a');\\n\",\n       \"\\t     *   this.b = _.constant('b');\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = _.constant('c');\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.functions(new Foo);\\n\",\n       \"\\t     * // => ['a', 'b']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function functions(object) {\\n\",\n       \"\\t      return object == null ? [] : baseFunctions(object, keys(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of function property names from own and inherited\\n\",\n       \"\\t     * enumerable properties of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to inspect.\\n\",\n       \"\\t     * @returns {Array} Returns the function names.\\n\",\n       \"\\t     * @see _.functions\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = _.constant('a');\\n\",\n       \"\\t     *   this.b = _.constant('b');\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = _.constant('c');\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.functionsIn(new Foo);\\n\",\n       \"\\t     * // => ['a', 'b', 'c']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function functionsIn(object) {\\n\",\n       \"\\t      return object == null ? [] : baseFunctions(object, keysIn(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Gets the value at `path` of `object`. If the resolved value is\\n\",\n       \"\\t     * `undefined`, the `defaultValue` is returned in its place.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.7.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to get.\\n\",\n       \"\\t     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\\n\",\n       \"\\t     * @returns {*} Returns the resolved value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.get(object, 'a[0].b.c');\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.get(object, ['a', '0', 'b', 'c']);\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.get(object, 'a.b.c', 'default');\\n\",\n       \"\\t     * // => 'default'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function get(object, path, defaultValue) {\\n\",\n       \"\\t      var result = object == null ? undefined : baseGet(object, path);\\n\",\n       \"\\t      return result === undefined ? defaultValue : result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `path` is a direct property of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `path` exists, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': { 'b': 2 } };\\n\",\n       \"\\t     * var other = _.create({ 'a': _.create({ 'b': 2 }) });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.has(object, 'a');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.has(object, 'a.b');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.has(object, ['a', 'b']);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.has(other, 'a');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function has(object, path) {\\n\",\n       \"\\t      return object != null && hasPath(object, path, baseHas);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `path` is a direct or inherited property of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path to check.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `path` exists, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = _.create({ 'a': _.create({ 'b': 2 }) });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.hasIn(object, 'a');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.hasIn(object, 'a.b');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.hasIn(object, ['a', 'b']);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.hasIn(object, 'b');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function hasIn(object, path) {\\n\",\n       \"\\t      return object != null && hasPath(object, path, baseHasIn);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object composed of the inverted keys and values of `object`.\\n\",\n       \"\\t     * If `object` contains duplicate values, subsequent values overwrite\\n\",\n       \"\\t     * property assignments of previous values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.7.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to invert.\\n\",\n       \"\\t     * @returns {Object} Returns the new inverted object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': 2, 'c': 1 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.invert(object);\\n\",\n       \"\\t     * // => { '1': 'c', '2': 'b' }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var invert = createInverter(function(result, value, key) {\\n\",\n       \"\\t      if (value != null &&\\n\",\n       \"\\t          typeof value.toString != 'function') {\\n\",\n       \"\\t        value = nativeObjectToString.call(value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      result[value] = key;\\n\",\n       \"\\t    }, constant(identity));\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.invert` except that the inverted object is generated\\n\",\n       \"\\t     * from the results of running each element of `object` thru `iteratee`. The\\n\",\n       \"\\t     * corresponding inverted value of each inverted key is an array of keys\\n\",\n       \"\\t     * responsible for generating the inverted value. The iteratee is invoked\\n\",\n       \"\\t     * with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.1.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to invert.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {Object} Returns the new inverted object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': 2, 'c': 1 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.invertBy(object);\\n\",\n       \"\\t     * // => { '1': ['a', 'c'], '2': ['b'] }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.invertBy(object, function(value) {\\n\",\n       \"\\t     *   return 'group' + value;\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var invertBy = createInverter(function(result, value, key) {\\n\",\n       \"\\t      if (value != null &&\\n\",\n       \"\\t          typeof value.toString != 'function') {\\n\",\n       \"\\t        value = nativeObjectToString.call(value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (hasOwnProperty.call(result, value)) {\\n\",\n       \"\\t        result[value].push(key);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        result[value] = [key];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }, getIteratee);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Invokes the method at `path` of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path of the method to invoke.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke the method with.\\n\",\n       \"\\t     * @returns {*} Returns the result of the invoked method.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\\n\",\n       \"\\t     * // => [2, 3]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var invoke = baseRest(baseInvoke);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the own enumerable property names of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Non-object values are coerced to objects. See the\\n\",\n       \"\\t     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\\n\",\n       \"\\t     * for more details.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.keys(new Foo);\\n\",\n       \"\\t     * // => ['a', 'b'] (iteration order is not guaranteed)\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.keys('hi');\\n\",\n       \"\\t     * // => ['0', '1']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function keys(object) {\\n\",\n       \"\\t      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the own and inherited enumerable property names of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Non-object values are coerced to objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property names.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.keysIn(new Foo);\\n\",\n       \"\\t     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function keysIn(object) {\\n\",\n       \"\\t      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.mapValues`; this method creates an object with the\\n\",\n       \"\\t     * same values as `object` and keys generated by running each own enumerable\\n\",\n       \"\\t     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\\n\",\n       \"\\t     * with three arguments: (value, key, object).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.8.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns the new mapped object.\\n\",\n       \"\\t     * @see _.mapValues\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\\n\",\n       \"\\t     *   return key + value;\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => { 'a1': 1, 'b2': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapKeys(object, iteratee) {\\n\",\n       \"\\t      var result = {};\\n\",\n       \"\\t      iteratee = getIteratee(iteratee, 3);\\n\",\n       \"\\t\\n\",\n       \"\\t      baseForOwn(object, function(value, key, object) {\\n\",\n       \"\\t        baseAssignValue(result, iteratee(value, key, object), value);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object with the same keys as `object` and values generated\\n\",\n       \"\\t     * by running each own enumerable string keyed property of `object` thru\\n\",\n       \"\\t     * `iteratee`. The iteratee is invoked with three arguments:\\n\",\n       \"\\t     * (value, key, object).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.4.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Object} Returns the new mapped object.\\n\",\n       \"\\t     * @see _.mapKeys\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = {\\n\",\n       \"\\t     *   'fred':    { 'user': 'fred',    'age': 40 },\\n\",\n       \"\\t     *   'pebbles': { 'user': 'pebbles', 'age': 1 }\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.mapValues(users, function(o) { return o.age; });\\n\",\n       \"\\t     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.mapValues(users, 'age');\\n\",\n       \"\\t     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mapValues(object, iteratee) {\\n\",\n       \"\\t      var result = {};\\n\",\n       \"\\t      iteratee = getIteratee(iteratee, 3);\\n\",\n       \"\\t\\n\",\n       \"\\t      baseForOwn(object, function(value, key, object) {\\n\",\n       \"\\t        baseAssignValue(result, key, iteratee(value, key, object));\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.assign` except that it recursively merges own and\\n\",\n       \"\\t     * inherited enumerable string keyed properties of source objects into the\\n\",\n       \"\\t     * destination object. Source properties that resolve to `undefined` are\\n\",\n       \"\\t     * skipped if a destination value exists. Array and plain object properties\\n\",\n       \"\\t     * are merged recursively. Other objects and value types are overridden by\\n\",\n       \"\\t     * assignment. Source objects are applied from left to right. Subsequent\\n\",\n       \"\\t     * sources overwrite property assignments of previous sources.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.5.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} [sources] The source objects.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = {\\n\",\n       \"\\t     *   'a': [{ 'b': 2 }, { 'd': 4 }]\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var other = {\\n\",\n       \"\\t     *   'a': [{ 'c': 3 }, { 'e': 5 }]\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.merge(object, other);\\n\",\n       \"\\t     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var merge = createAssigner(function(object, source, srcIndex) {\\n\",\n       \"\\t      baseMerge(object, source, srcIndex);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.merge` except that it accepts `customizer` which\\n\",\n       \"\\t     * is invoked to produce the merged values of the destination and source\\n\",\n       \"\\t     * properties. If `customizer` returns `undefined`, merging is handled by the\\n\",\n       \"\\t     * method instead. The `customizer` is invoked with six arguments:\\n\",\n       \"\\t     * (objValue, srcValue, key, object, source, stack).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The destination object.\\n\",\n       \"\\t     * @param {...Object} sources The source objects.\\n\",\n       \"\\t     * @param {Function} customizer The function to customize assigned values.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function customizer(objValue, srcValue) {\\n\",\n       \"\\t     *   if (_.isArray(objValue)) {\\n\",\n       \"\\t     *     return objValue.concat(srcValue);\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [1], 'b': [2] };\\n\",\n       \"\\t     * var other = { 'a': [3], 'b': [4] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.mergeWith(object, other, customizer);\\n\",\n       \"\\t     * // => { 'a': [1, 3], 'b': [2, 4] }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\\n\",\n       \"\\t      baseMerge(object, source, srcIndex, customizer);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.pick`; this method creates an object composed of the\\n\",\n       \"\\t     * own and inherited enumerable property paths of `object` that are not omitted.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is considerably slower than `_.pick`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The source object.\\n\",\n       \"\\t     * @param {...(string|string[])} [paths] The property paths to omit.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': '2', 'c': 3 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.omit(object, ['a', 'c']);\\n\",\n       \"\\t     * // => { 'b': '2' }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var omit = flatRest(function(object, paths) {\\n\",\n       \"\\t      var result = {};\\n\",\n       \"\\t      if (object == null) {\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var isDeep = false;\\n\",\n       \"\\t      paths = arrayMap(paths, function(path) {\\n\",\n       \"\\t        path = castPath(path, object);\\n\",\n       \"\\t        isDeep || (isDeep = path.length > 1);\\n\",\n       \"\\t        return path;\\n\",\n       \"\\t      });\\n\",\n       \"\\t      copyObject(object, getAllKeysIn(object), result);\\n\",\n       \"\\t      if (isDeep) {\\n\",\n       \"\\t        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var length = paths.length;\\n\",\n       \"\\t      while (length--) {\\n\",\n       \"\\t        baseUnset(result, paths[length]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.pickBy`; this method creates an object composed of\\n\",\n       \"\\t     * the own and inherited enumerable string keyed properties of `object` that\\n\",\n       \"\\t     * `predicate` doesn't return truthy for. The predicate is invoked with two\\n\",\n       \"\\t     * arguments: (value, key).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The source object.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per property.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': '2', 'c': 3 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.omitBy(object, _.isNumber);\\n\",\n       \"\\t     * // => { 'b': '2' }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function omitBy(object, predicate) {\\n\",\n       \"\\t      return pickBy(object, negate(getIteratee(predicate)));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object composed of the picked `object` properties.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The source object.\\n\",\n       \"\\t     * @param {...(string|string[])} [paths] The property paths to pick.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': '2', 'c': 3 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pick(object, ['a', 'c']);\\n\",\n       \"\\t     * // => { 'a': 1, 'c': 3 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var pick = flatRest(function(object, paths) {\\n\",\n       \"\\t      return object == null ? {} : basePick(object, paths);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an object composed of the `object` properties `predicate` returns\\n\",\n       \"\\t     * truthy for. The predicate is invoked with two arguments: (value, key).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The source object.\\n\",\n       \"\\t     * @param {Function} [predicate=_.identity] The function invoked per property.\\n\",\n       \"\\t     * @returns {Object} Returns the new object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1, 'b': '2', 'c': 3 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pickBy(object, _.isNumber);\\n\",\n       \"\\t     * // => { 'a': 1, 'c': 3 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function pickBy(object, predicate) {\\n\",\n       \"\\t      if (object == null) {\\n\",\n       \"\\t        return {};\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var props = arrayMap(getAllKeysIn(object), function(prop) {\\n\",\n       \"\\t        return [prop];\\n\",\n       \"\\t      });\\n\",\n       \"\\t      predicate = getIteratee(predicate);\\n\",\n       \"\\t      return basePickBy(object, props, function(value, path) {\\n\",\n       \"\\t        return predicate(value, path[0]);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.get` except that if the resolved value is a\\n\",\n       \"\\t     * function it's invoked with the `this` binding of its parent object and\\n\",\n       \"\\t     * its result is returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to resolve.\\n\",\n       \"\\t     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\\n\",\n       \"\\t     * @returns {*} Returns the resolved value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.result(object, 'a[0].b.c1');\\n\",\n       \"\\t     * // => 3\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.result(object, 'a[0].b.c2');\\n\",\n       \"\\t     * // => 4\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.result(object, 'a[0].b.c3', 'default');\\n\",\n       \"\\t     * // => 'default'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.result(object, 'a[0].b.c3', _.constant('default'));\\n\",\n       \"\\t     * // => 'default'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function result(object, path, defaultValue) {\\n\",\n       \"\\t      path = castPath(path, object);\\n\",\n       \"\\t\\n\",\n       \"\\t      var index = -1,\\n\",\n       \"\\t          length = path.length;\\n\",\n       \"\\t\\n\",\n       \"\\t      // Ensure the loop is entered when path is empty.\\n\",\n       \"\\t      if (!length) {\\n\",\n       \"\\t        length = 1;\\n\",\n       \"\\t        object = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      while (++index < length) {\\n\",\n       \"\\t        var value = object == null ? undefined : object[toKey(path[index])];\\n\",\n       \"\\t        if (value === undefined) {\\n\",\n       \"\\t          index = length;\\n\",\n       \"\\t          value = defaultValue;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        object = isFunction(value) ? value.call(object) : value;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\\n\",\n       \"\\t     * it's created. Arrays are created for missing index properties while objects\\n\",\n       \"\\t     * are created for all other missing properties. Use `_.setWith` to customize\\n\",\n       \"\\t     * `path` creation.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.7.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.set(object, 'a[0].b.c', 4);\\n\",\n       \"\\t     * console.log(object.a[0].b.c);\\n\",\n       \"\\t     * // => 4\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.set(object, ['x', '0', 'y', 'z'], 5);\\n\",\n       \"\\t     * console.log(object.x[0].y.z);\\n\",\n       \"\\t     * // => 5\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function set(object, path, value) {\\n\",\n       \"\\t      return object == null ? object : baseSet(object, path, value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.set` except that it accepts `customizer` which is\\n\",\n       \"\\t     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\\n\",\n       \"\\t     * path creation is handled by the method instead. The `customizer` is invoked\\n\",\n       \"\\t     * with three arguments: (nsValue, key, nsObject).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to set.\\n\",\n       \"\\t     * @param {*} value The value to set.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize assigned values.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = {};\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.setWith(object, '[0][1]', 'a', Object);\\n\",\n       \"\\t     * // => { '0': { '1': 'a' } }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function setWith(object, path, value, customizer) {\\n\",\n       \"\\t      customizer = typeof customizer == 'function' ? customizer : undefined;\\n\",\n       \"\\t      return object == null ? object : baseSet(object, path, value, customizer);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of own enumerable string keyed-value pairs for `object`\\n\",\n       \"\\t     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\\n\",\n       \"\\t     * entries are returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @alias entries\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the key-value pairs.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toPairs(new Foo);\\n\",\n       \"\\t     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var toPairs = createToPairs(keys);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of own and inherited enumerable string keyed-value pairs\\n\",\n       \"\\t     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\\n\",\n       \"\\t     * or set, its entries are returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @alias entriesIn\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the key-value pairs.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toPairsIn(new Foo);\\n\",\n       \"\\t     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var toPairsIn = createToPairs(keysIn);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * An alternative to `_.reduce`; this method transforms `object` to a new\\n\",\n       \"\\t     * `accumulator` object which is the result of running each of its own\\n\",\n       \"\\t     * enumerable string keyed properties thru `iteratee`, with each invocation\\n\",\n       \"\\t     * potentially mutating the `accumulator` object. If `accumulator` is not\\n\",\n       \"\\t     * provided, a new object with the same `[[Prototype]]` will be used. The\\n\",\n       \"\\t     * iteratee is invoked with four arguments: (accumulator, value, key, object).\\n\",\n       \"\\t     * Iteratee functions may exit iteration early by explicitly returning `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.3.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @param {*} [accumulator] The custom accumulator value.\\n\",\n       \"\\t     * @returns {*} Returns the accumulated value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.transform([2, 3, 4], function(result, n) {\\n\",\n       \"\\t     *   result.push(n *= n);\\n\",\n       \"\\t     *   return n % 2 == 0;\\n\",\n       \"\\t     * }, []);\\n\",\n       \"\\t     * // => [4, 9]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\\n\",\n       \"\\t     *   (result[value] || (result[value] = [])).push(key);\\n\",\n       \"\\t     * }, {});\\n\",\n       \"\\t     * // => { '1': ['a', 'c'], '2': ['b'] }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function transform(object, iteratee, accumulator) {\\n\",\n       \"\\t      var isArr = isArray(object),\\n\",\n       \"\\t          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\\n\",\n       \"\\t\\n\",\n       \"\\t      iteratee = getIteratee(iteratee, 4);\\n\",\n       \"\\t      if (accumulator == null) {\\n\",\n       \"\\t        var Ctor = object && object.constructor;\\n\",\n       \"\\t        if (isArrLike) {\\n\",\n       \"\\t          accumulator = isArr ? new Ctor : [];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else if (isObject(object)) {\\n\",\n       \"\\t          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else {\\n\",\n       \"\\t          accumulator = {};\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\\n\",\n       \"\\t        return iteratee(accumulator, value, index, object);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return accumulator;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes the property at `path` of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to unset.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\\n\",\n       \"\\t     * _.unset(object, 'a[0].b.c');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(object);\\n\",\n       \"\\t     * // => { 'a': [{ 'b': {} }] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.unset(object, ['a', '0', 'b', 'c']);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(object);\\n\",\n       \"\\t     * // => { 'a': [{ 'b': {} }] };\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function unset(object, path) {\\n\",\n       \"\\t      return object == null ? true : baseUnset(object, path);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.set` except that accepts `updater` to produce the\\n\",\n       \"\\t     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\\n\",\n       \"\\t     * is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.6.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to set.\\n\",\n       \"\\t     * @param {Function} updater The function to produce the updated value.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\\n\",\n       \"\\t     * console.log(object.a[0].b.c);\\n\",\n       \"\\t     * // => 9\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\\n\",\n       \"\\t     * console.log(object.x[0].y.z);\\n\",\n       \"\\t     * // => 0\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function update(object, path, updater) {\\n\",\n       \"\\t      return object == null ? object : baseUpdate(object, path, castFunction(updater));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.update` except that it accepts `customizer` which is\\n\",\n       \"\\t     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\\n\",\n       \"\\t     * path creation is handled by the method instead. The `customizer` is invoked\\n\",\n       \"\\t     * with three arguments: (nsValue, key, nsObject).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method mutates `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.6.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to modify.\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to set.\\n\",\n       \"\\t     * @param {Function} updater The function to produce the updated value.\\n\",\n       \"\\t     * @param {Function} [customizer] The function to customize assigned values.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = {};\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\\n\",\n       \"\\t     * // => { '0': { '1': 'a' } }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function updateWith(object, path, updater, customizer) {\\n\",\n       \"\\t      customizer = typeof customizer == 'function' ? customizer : undefined;\\n\",\n       \"\\t      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the own enumerable string keyed property values of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Non-object values are coerced to objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.values(new Foo);\\n\",\n       \"\\t     * // => [1, 2] (iteration order is not guaranteed)\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.values('hi');\\n\",\n       \"\\t     * // => ['h', 'i']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function values(object) {\\n\",\n       \"\\t      return object == null ? [] : baseValues(object, keys(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of the own and inherited enumerable string keyed property\\n\",\n       \"\\t     * values of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Non-object values are coerced to objects.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Object\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Array} Returns the array of property values.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function Foo() {\\n\",\n       \"\\t     *   this.a = 1;\\n\",\n       \"\\t     *   this.b = 2;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Foo.prototype.c = 3;\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.valuesIn(new Foo);\\n\",\n       \"\\t     * // => [1, 2, 3] (iteration order is not guaranteed)\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function valuesIn(object) {\\n\",\n       \"\\t      return object == null ? [] : baseValues(object, keysIn(object));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Clamps `number` within the inclusive `lower` and `upper` bounds.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Number\\n\",\n       \"\\t     * @param {number} number The number to clamp.\\n\",\n       \"\\t     * @param {number} [lower] The lower bound.\\n\",\n       \"\\t     * @param {number} upper The upper bound.\\n\",\n       \"\\t     * @returns {number} Returns the clamped number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.clamp(-10, -5, 5);\\n\",\n       \"\\t     * // => -5\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.clamp(10, -5, 5);\\n\",\n       \"\\t     * // => 5\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function clamp(number, lower, upper) {\\n\",\n       \"\\t      if (upper === undefined) {\\n\",\n       \"\\t        upper = lower;\\n\",\n       \"\\t        lower = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (upper !== undefined) {\\n\",\n       \"\\t        upper = toNumber(upper);\\n\",\n       \"\\t        upper = upper === upper ? upper : 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (lower !== undefined) {\\n\",\n       \"\\t        lower = toNumber(lower);\\n\",\n       \"\\t        lower = lower === lower ? lower : 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseClamp(toNumber(number), lower, upper);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `n` is between `start` and up to, but not including, `end`. If\\n\",\n       \"\\t     * `end` is not specified, it's set to `start` with `start` then set to `0`.\\n\",\n       \"\\t     * If `start` is greater than `end` the params are swapped to support\\n\",\n       \"\\t     * negative ranges.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.3.0\\n\",\n       \"\\t     * @category Number\\n\",\n       \"\\t     * @param {number} number The number to check.\\n\",\n       \"\\t     * @param {number} [start=0] The start of the range.\\n\",\n       \"\\t     * @param {number} end The end of the range.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\\n\",\n       \"\\t     * @see _.range, _.rangeRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(3, 2, 4);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(4, 8);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(4, 2);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(2, 2);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(1.2, 2);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(5.2, 4);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.inRange(-3, -2, -6);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function inRange(number, start, end) {\\n\",\n       \"\\t      start = toFinite(start);\\n\",\n       \"\\t      if (end === undefined) {\\n\",\n       \"\\t        end = start;\\n\",\n       \"\\t        start = 0;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        end = toFinite(end);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      number = toNumber(number);\\n\",\n       \"\\t      return baseInRange(number, start, end);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Produces a random number between the inclusive `lower` and `upper` bounds.\\n\",\n       \"\\t     * If only one argument is provided a number between `0` and the given number\\n\",\n       \"\\t     * is returned. If `floating` is `true`, or either `lower` or `upper` are\\n\",\n       \"\\t     * floats, a floating-point number is returned instead of an integer.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** JavaScript follows the IEEE-754 standard for resolving\\n\",\n       \"\\t     * floating-point values which can produce unexpected results.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.7.0\\n\",\n       \"\\t     * @category Number\\n\",\n       \"\\t     * @param {number} [lower=0] The lower bound.\\n\",\n       \"\\t     * @param {number} [upper=1] The upper bound.\\n\",\n       \"\\t     * @param {boolean} [floating] Specify returning a floating-point number.\\n\",\n       \"\\t     * @returns {number} Returns the random number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.random(0, 5);\\n\",\n       \"\\t     * // => an integer between 0 and 5\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.random(5);\\n\",\n       \"\\t     * // => also an integer between 0 and 5\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.random(5, true);\\n\",\n       \"\\t     * // => a floating-point number between 0 and 5\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.random(1.2, 5.2);\\n\",\n       \"\\t     * // => a floating-point number between 1.2 and 5.2\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function random(lower, upper, floating) {\\n\",\n       \"\\t      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\\n\",\n       \"\\t        upper = floating = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (floating === undefined) {\\n\",\n       \"\\t        if (typeof upper == 'boolean') {\\n\",\n       \"\\t          floating = upper;\\n\",\n       \"\\t          upper = undefined;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        else if (typeof lower == 'boolean') {\\n\",\n       \"\\t          floating = lower;\\n\",\n       \"\\t          lower = undefined;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (lower === undefined && upper === undefined) {\\n\",\n       \"\\t        lower = 0;\\n\",\n       \"\\t        upper = 1;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      else {\\n\",\n       \"\\t        lower = toFinite(lower);\\n\",\n       \"\\t        if (upper === undefined) {\\n\",\n       \"\\t          upper = lower;\\n\",\n       \"\\t          lower = 0;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          upper = toFinite(upper);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (lower > upper) {\\n\",\n       \"\\t        var temp = lower;\\n\",\n       \"\\t        lower = upper;\\n\",\n       \"\\t        upper = temp;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (floating || lower % 1 || upper % 1) {\\n\",\n       \"\\t        var rand = nativeRandom();\\n\",\n       \"\\t        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseRandom(lower, upper);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the camel cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.camelCase('Foo Bar');\\n\",\n       \"\\t     * // => 'fooBar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.camelCase('--foo-bar--');\\n\",\n       \"\\t     * // => 'fooBar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.camelCase('__FOO_BAR__');\\n\",\n       \"\\t     * // => 'fooBar'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var camelCase = createCompounder(function(result, word, index) {\\n\",\n       \"\\t      word = word.toLowerCase();\\n\",\n       \"\\t      return result + (index ? capitalize(word) : word);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts the first character of `string` to upper case and the remaining\\n\",\n       \"\\t     * to lower case.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to capitalize.\\n\",\n       \"\\t     * @returns {string} Returns the capitalized string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.capitalize('FRED');\\n\",\n       \"\\t     * // => 'Fred'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function capitalize(string) {\\n\",\n       \"\\t      return upperFirst(toString(string).toLowerCase());\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Deburrs `string` by converting\\n\",\n       \"\\t     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\\n\",\n       \"\\t     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\\n\",\n       \"\\t     * letters to basic Latin letters and removing\\n\",\n       \"\\t     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to deburr.\\n\",\n       \"\\t     * @returns {string} Returns the deburred string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.deburr('déjà vu');\\n\",\n       \"\\t     * // => 'deja vu'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function deburr(string) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `string` ends with the given target string.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to inspect.\\n\",\n       \"\\t     * @param {string} [target] The string to search for.\\n\",\n       \"\\t     * @param {number} [position=string.length] The position to search up to.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `string` ends with `target`,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.endsWith('abc', 'c');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.endsWith('abc', 'b');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.endsWith('abc', 'b', 2);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function endsWith(string, target, position) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      target = baseToString(target);\\n\",\n       \"\\t\\n\",\n       \"\\t      var length = string.length;\\n\",\n       \"\\t      position = position === undefined\\n\",\n       \"\\t        ? length\\n\",\n       \"\\t        : baseClamp(toInteger(position), 0, length);\\n\",\n       \"\\t\\n\",\n       \"\\t      var end = position;\\n\",\n       \"\\t      position -= target.length;\\n\",\n       \"\\t      return position >= 0 && string.slice(position, end) == target;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts the characters \\\"&\\\", \\\"<\\\", \\\">\\\", '\\\"', and \\\"'\\\" in `string` to their\\n\",\n       \"\\t     * corresponding HTML entities.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** No other characters are escaped. To escape additional\\n\",\n       \"\\t     * characters use a third-party library like [_he_](https://mths.be/he).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Though the \\\">\\\" character is escaped for symmetry, characters like\\n\",\n       \"\\t     * \\\">\\\" and \\\"/\\\" don't need escaping in HTML and have no special meaning\\n\",\n       \"\\t     * unless they're part of a tag or unquoted attribute value. See\\n\",\n       \"\\t     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\\n\",\n       \"\\t     * (under \\\"semi-related fun fact\\\") for more details.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * When working with HTML you should always\\n\",\n       \"\\t     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\\n\",\n       \"\\t     * XSS vectors.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to escape.\\n\",\n       \"\\t     * @returns {string} Returns the escaped string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.escape('fred, barney, & pebbles');\\n\",\n       \"\\t     * // => 'fred, barney, &amp; pebbles'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function escape(string) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      return (string && reHasUnescapedHtml.test(string))\\n\",\n       \"\\t        ? string.replace(reUnescapedHtml, escapeHtmlChar)\\n\",\n       \"\\t        : string;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Escapes the `RegExp` special characters \\\"^\\\", \\\"$\\\", \\\"\\\\\\\", \\\".\\\", \\\"*\\\", \\\"+\\\",\\n\",\n       \"\\t     * \\\"?\\\", \\\"(\\\", \\\")\\\", \\\"[\\\", \\\"]\\\", \\\"{\\\", \\\"}\\\", and \\\"|\\\" in `string`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to escape.\\n\",\n       \"\\t     * @returns {string} Returns the escaped string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.escapeRegExp('[lodash](https://lodash.com/)');\\n\",\n       \"\\t     * // => '\\\\[lodash\\\\]\\\\(https://lodash\\\\.com/\\\\)'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function escapeRegExp(string) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      return (string && reHasRegExpChar.test(string))\\n\",\n       \"\\t        ? string.replace(reRegExpChar, '\\\\\\\\$&')\\n\",\n       \"\\t        : string;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string` to\\n\",\n       \"\\t     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the kebab cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.kebabCase('Foo Bar');\\n\",\n       \"\\t     * // => 'foo-bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.kebabCase('fooBar');\\n\",\n       \"\\t     * // => 'foo-bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.kebabCase('__FOO_BAR__');\\n\",\n       \"\\t     * // => 'foo-bar'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var kebabCase = createCompounder(function(result, word, index) {\\n\",\n       \"\\t      return result + (index ? '-' : '') + word.toLowerCase();\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string`, as space separated words, to lower case.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the lower cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lowerCase('--Foo-Bar--');\\n\",\n       \"\\t     * // => 'foo bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lowerCase('fooBar');\\n\",\n       \"\\t     * // => 'foo bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lowerCase('__FOO_BAR__');\\n\",\n       \"\\t     * // => 'foo bar'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var lowerCase = createCompounder(function(result, word, index) {\\n\",\n       \"\\t      return result + (index ? ' ' : '') + word.toLowerCase();\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts the first character of `string` to lower case.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the converted string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lowerFirst('Fred');\\n\",\n       \"\\t     * // => 'fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.lowerFirst('FRED');\\n\",\n       \"\\t     * // => 'fRED'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var lowerFirst = createCaseFirst('toLowerCase');\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Pads `string` on the left and right sides if it's shorter than `length`.\\n\",\n       \"\\t     * Padding characters are truncated if they can't be evenly divided by `length`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to pad.\\n\",\n       \"\\t     * @param {number} [length=0] The padding length.\\n\",\n       \"\\t     * @param {string} [chars=' '] The string used as padding.\\n\",\n       \"\\t     * @returns {string} Returns the padded string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pad('abc', 8);\\n\",\n       \"\\t     * // => '  abc   '\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pad('abc', 8, '_-');\\n\",\n       \"\\t     * // => '_-abc_-_'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.pad('abc', 3);\\n\",\n       \"\\t     * // => 'abc'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function pad(string, length, chars) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      length = toInteger(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      var strLength = length ? stringSize(string) : 0;\\n\",\n       \"\\t      if (!length || strLength >= length) {\\n\",\n       \"\\t        return string;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var mid = (length - strLength) / 2;\\n\",\n       \"\\t      return (\\n\",\n       \"\\t        createPadding(nativeFloor(mid), chars) +\\n\",\n       \"\\t        string +\\n\",\n       \"\\t        createPadding(nativeCeil(mid), chars)\\n\",\n       \"\\t      );\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Pads `string` on the right side if it's shorter than `length`. Padding\\n\",\n       \"\\t     * characters are truncated if they exceed `length`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to pad.\\n\",\n       \"\\t     * @param {number} [length=0] The padding length.\\n\",\n       \"\\t     * @param {string} [chars=' '] The string used as padding.\\n\",\n       \"\\t     * @returns {string} Returns the padded string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.padEnd('abc', 6);\\n\",\n       \"\\t     * // => 'abc   '\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.padEnd('abc', 6, '_-');\\n\",\n       \"\\t     * // => 'abc_-_'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.padEnd('abc', 3);\\n\",\n       \"\\t     * // => 'abc'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function padEnd(string, length, chars) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      length = toInteger(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      var strLength = length ? stringSize(string) : 0;\\n\",\n       \"\\t      return (length && strLength < length)\\n\",\n       \"\\t        ? (string + createPadding(length - strLength, chars))\\n\",\n       \"\\t        : string;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Pads `string` on the left side if it's shorter than `length`. Padding\\n\",\n       \"\\t     * characters are truncated if they exceed `length`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to pad.\\n\",\n       \"\\t     * @param {number} [length=0] The padding length.\\n\",\n       \"\\t     * @param {string} [chars=' '] The string used as padding.\\n\",\n       \"\\t     * @returns {string} Returns the padded string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.padStart('abc', 6);\\n\",\n       \"\\t     * // => '   abc'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.padStart('abc', 6, '_-');\\n\",\n       \"\\t     * // => '_-_abc'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.padStart('abc', 3);\\n\",\n       \"\\t     * // => 'abc'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function padStart(string, length, chars) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      length = toInteger(length);\\n\",\n       \"\\t\\n\",\n       \"\\t      var strLength = length ? stringSize(string) : 0;\\n\",\n       \"\\t      return (length && strLength < length)\\n\",\n       \"\\t        ? (createPadding(length - strLength, chars) + string)\\n\",\n       \"\\t        : string;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string` to an integer of the specified radix. If `radix` is\\n\",\n       \"\\t     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\\n\",\n       \"\\t     * hexadecimal, in which case a `radix` of `16` is used.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method aligns with the\\n\",\n       \"\\t     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 1.1.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} string The string to convert.\\n\",\n       \"\\t     * @param {number} [radix=10] The radix to interpret `value` by.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {number} Returns the converted integer.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.parseInt('08');\\n\",\n       \"\\t     * // => 8\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(['6', '08', '10'], _.parseInt);\\n\",\n       \"\\t     * // => [6, 8, 10]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function parseInt(string, radix, guard) {\\n\",\n       \"\\t      if (guard || radix == null) {\\n\",\n       \"\\t        radix = 0;\\n\",\n       \"\\t      } else if (radix) {\\n\",\n       \"\\t        radix = +radix;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Repeats the given string `n` times.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to repeat.\\n\",\n       \"\\t     * @param {number} [n=1] The number of times to repeat the string.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {string} Returns the repeated string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.repeat('*', 3);\\n\",\n       \"\\t     * // => '***'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.repeat('abc', 2);\\n\",\n       \"\\t     * // => 'abcabc'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.repeat('abc', 0);\\n\",\n       \"\\t     * // => ''\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function repeat(string, n, guard) {\\n\",\n       \"\\t      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\\n\",\n       \"\\t        n = 1;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        n = toInteger(n);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return baseRepeat(toString(string), n);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Replaces matches for `pattern` in `string` with `replacement`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`String#replace`](https://mdn.io/String/replace).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to modify.\\n\",\n       \"\\t     * @param {RegExp|string} pattern The pattern to replace.\\n\",\n       \"\\t     * @param {Function|string} replacement The match replacement.\\n\",\n       \"\\t     * @returns {string} Returns the modified string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.replace('Hi Fred', 'Fred', 'Barney');\\n\",\n       \"\\t     * // => 'Hi Barney'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function replace() {\\n\",\n       \"\\t      var args = arguments,\\n\",\n       \"\\t          string = toString(args[0]);\\n\",\n       \"\\t\\n\",\n       \"\\t      return args.length < 3 ? string : string.replace(args[1], args[2]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string` to\\n\",\n       \"\\t     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the snake cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.snakeCase('Foo Bar');\\n\",\n       \"\\t     * // => 'foo_bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.snakeCase('fooBar');\\n\",\n       \"\\t     * // => 'foo_bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.snakeCase('--FOO-BAR--');\\n\",\n       \"\\t     * // => 'foo_bar'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var snakeCase = createCompounder(function(result, word, index) {\\n\",\n       \"\\t      return result + (index ? '_' : '') + word.toLowerCase();\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Splits `string` by `separator`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method is based on\\n\",\n       \"\\t     * [`String#split`](https://mdn.io/String/split).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to split.\\n\",\n       \"\\t     * @param {RegExp|string} separator The separator pattern to split by.\\n\",\n       \"\\t     * @param {number} [limit] The length to truncate results to.\\n\",\n       \"\\t     * @returns {Array} Returns the string segments.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.split('a-b-c', '-', 2);\\n\",\n       \"\\t     * // => ['a', 'b']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function split(string, separator, limit) {\\n\",\n       \"\\t      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\\n\",\n       \"\\t        separator = limit = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\\n\",\n       \"\\t      if (!limit) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      if (string && (\\n\",\n       \"\\t            typeof separator == 'string' ||\\n\",\n       \"\\t            (separator != null && !isRegExp(separator))\\n\",\n       \"\\t          )) {\\n\",\n       \"\\t        separator = baseToString(separator);\\n\",\n       \"\\t        if (!separator && hasUnicode(string)) {\\n\",\n       \"\\t          return castSlice(stringToArray(string), 0, limit);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return string.split(separator, limit);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string` to\\n\",\n       \"\\t     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.1.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the start cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.startCase('--foo-bar--');\\n\",\n       \"\\t     * // => 'Foo Bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.startCase('fooBar');\\n\",\n       \"\\t     * // => 'Foo Bar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.startCase('__FOO_BAR__');\\n\",\n       \"\\t     * // => 'FOO BAR'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var startCase = createCompounder(function(result, word, index) {\\n\",\n       \"\\t      return result + (index ? ' ' : '') + upperFirst(word);\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks if `string` starts with the given target string.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to inspect.\\n\",\n       \"\\t     * @param {string} [target] The string to search for.\\n\",\n       \"\\t     * @param {number} [position=0] The position to search from.\\n\",\n       \"\\t     * @returns {boolean} Returns `true` if `string` starts with `target`,\\n\",\n       \"\\t     *  else `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.startsWith('abc', 'a');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.startsWith('abc', 'b');\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.startsWith('abc', 'b', 1);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function startsWith(string, target, position) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      position = position == null\\n\",\n       \"\\t        ? 0\\n\",\n       \"\\t        : baseClamp(toInteger(position), 0, string.length);\\n\",\n       \"\\t\\n\",\n       \"\\t      target = baseToString(target);\\n\",\n       \"\\t      return string.slice(position, position + target.length) == target;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a compiled template function that can interpolate data properties\\n\",\n       \"\\t     * in \\\"interpolate\\\" delimiters, HTML-escape interpolated data properties in\\n\",\n       \"\\t     * \\\"escape\\\" delimiters, and execute JavaScript in \\\"evaluate\\\" delimiters. Data\\n\",\n       \"\\t     * properties may be accessed as free variables in the template. If a setting\\n\",\n       \"\\t     * object is given, it takes precedence over `_.templateSettings` values.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** In the development build `_.template` utilizes\\n\",\n       \"\\t     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\\n\",\n       \"\\t     * for easier debugging.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * For more information on precompiling templates see\\n\",\n       \"\\t     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * For more information on Chrome extension sandboxes see\\n\",\n       \"\\t     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The template string.\\n\",\n       \"\\t     * @param {Object} [options={}] The options object.\\n\",\n       \"\\t     * @param {RegExp} [options.escape=_.templateSettings.escape]\\n\",\n       \"\\t     *  The HTML \\\"escape\\\" delimiter.\\n\",\n       \"\\t     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\\n\",\n       \"\\t     *  The \\\"evaluate\\\" delimiter.\\n\",\n       \"\\t     * @param {Object} [options.imports=_.templateSettings.imports]\\n\",\n       \"\\t     *  An object to import into the template as free variables.\\n\",\n       \"\\t     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\\n\",\n       \"\\t     *  The \\\"interpolate\\\" delimiter.\\n\",\n       \"\\t     * @param {string} [options.sourceURL='lodash.templateSources[n]']\\n\",\n       \"\\t     *  The sourceURL of the compiled template.\\n\",\n       \"\\t     * @param {string} [options.variable='obj']\\n\",\n       \"\\t     *  The data object variable name.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Function} Returns the compiled template function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the \\\"interpolate\\\" delimiter to create a compiled template.\\n\",\n       \"\\t     * var compiled = _.template('hello <%= user %>!');\\n\",\n       \"\\t     * compiled({ 'user': 'fred' });\\n\",\n       \"\\t     * // => 'hello fred!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the HTML \\\"escape\\\" delimiter to escape data property values.\\n\",\n       \"\\t     * var compiled = _.template('<b><%- value %></b>');\\n\",\n       \"\\t     * compiled({ 'value': '<script>' });\\n\",\n       \"\\t     * // => '<b>&lt;script&gt;</b>'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the \\\"evaluate\\\" delimiter to execute JavaScript and generate HTML.\\n\",\n       \"\\t     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\\n\",\n       \"\\t     * compiled({ 'users': ['fred', 'barney'] });\\n\",\n       \"\\t     * // => '<li>fred</li><li>barney</li>'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the internal `print` function in \\\"evaluate\\\" delimiters.\\n\",\n       \"\\t     * var compiled = _.template('<% print(\\\"hello \\\" + user); %>!');\\n\",\n       \"\\t     * compiled({ 'user': 'barney' });\\n\",\n       \"\\t     * // => 'hello barney!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the ES template literal delimiter as an \\\"interpolate\\\" delimiter.\\n\",\n       \"\\t     * // Disable support by replacing the \\\"interpolate\\\" delimiter.\\n\",\n       \"\\t     * var compiled = _.template('hello ${ user }!');\\n\",\n       \"\\t     * compiled({ 'user': 'pebbles' });\\n\",\n       \"\\t     * // => 'hello pebbles!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use backslashes to treat delimiters as plain text.\\n\",\n       \"\\t     * var compiled = _.template('<%= \\\"\\\\\\\\<%- value %\\\\\\\\>\\\" %>');\\n\",\n       \"\\t     * compiled({ 'value': 'ignored' });\\n\",\n       \"\\t     * // => '<%- value %>'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the `imports` option to import `jQuery` as `jq`.\\n\",\n       \"\\t     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\\n\",\n       \"\\t     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\\n\",\n       \"\\t     * compiled({ 'users': ['fred', 'barney'] });\\n\",\n       \"\\t     * // => '<li>fred</li><li>barney</li>'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\\n\",\n       \"\\t     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\\n\",\n       \"\\t     * compiled(data);\\n\",\n       \"\\t     * // => Find the source of \\\"greeting.jst\\\" under the Sources tab or Resources panel of the web inspector.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\\n\",\n       \"\\t     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\\n\",\n       \"\\t     * compiled.source;\\n\",\n       \"\\t     * // => function(data) {\\n\",\n       \"\\t     * //   var __t, __p = '';\\n\",\n       \"\\t     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\\n\",\n       \"\\t     * //   return __p;\\n\",\n       \"\\t     * // }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use custom template delimiters.\\n\",\n       \"\\t     * _.templateSettings.interpolate = /{{([\\\\s\\\\S]+?)}}/g;\\n\",\n       \"\\t     * var compiled = _.template('hello {{ user }}!');\\n\",\n       \"\\t     * compiled({ 'user': 'mustache' });\\n\",\n       \"\\t     * // => 'hello mustache!'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Use the `source` property to inline compiled templates for meaningful\\n\",\n       \"\\t     * // line numbers in error messages and stack traces.\\n\",\n       \"\\t     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\\\\n\",\n       \"\\t     *   var JST = {\\\\\\n\",\n       \"\\t     *     \\\"main\\\": ' + _.template(mainText).source + '\\\\\\n\",\n       \"\\t     *   };\\\\\\n\",\n       \"\\t     * ');\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function template(string, options, guard) {\\n\",\n       \"\\t      // Based on John Resig's `tmpl` implementation\\n\",\n       \"\\t      // (http://ejohn.org/blog/javascript-micro-templating/)\\n\",\n       \"\\t      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\\n\",\n       \"\\t      var settings = lodash.templateSettings;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (guard && isIterateeCall(string, options, guard)) {\\n\",\n       \"\\t        options = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      options = assignInWith({}, options, settings, customDefaultsAssignIn);\\n\",\n       \"\\t\\n\",\n       \"\\t      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\\n\",\n       \"\\t          importsKeys = keys(imports),\\n\",\n       \"\\t          importsValues = baseValues(imports, importsKeys);\\n\",\n       \"\\t\\n\",\n       \"\\t      var isEscaping,\\n\",\n       \"\\t          isEvaluating,\\n\",\n       \"\\t          index = 0,\\n\",\n       \"\\t          interpolate = options.interpolate || reNoMatch,\\n\",\n       \"\\t          source = \\\"__p += '\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t      // Compile the regexp to match each delimiter.\\n\",\n       \"\\t      var reDelimiters = RegExp(\\n\",\n       \"\\t        (options.escape || reNoMatch).source + '|' +\\n\",\n       \"\\t        interpolate.source + '|' +\\n\",\n       \"\\t        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\\n\",\n       \"\\t        (options.evaluate || reNoMatch).source + '|$'\\n\",\n       \"\\t      , 'g');\\n\",\n       \"\\t\\n\",\n       \"\\t      // Use a sourceURL for easier debugging.\\n\",\n       \"\\t      var sourceURL = '//# sourceURL=' +\\n\",\n       \"\\t        ('sourceURL' in options\\n\",\n       \"\\t          ? options.sourceURL\\n\",\n       \"\\t          : ('lodash.templateSources[' + (++templateCounter) + ']')\\n\",\n       \"\\t        ) + '\\\\n';\\n\",\n       \"\\t\\n\",\n       \"\\t      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\\n\",\n       \"\\t        interpolateValue || (interpolateValue = esTemplateValue);\\n\",\n       \"\\t\\n\",\n       \"\\t        // Escape characters that can't be included in string literals.\\n\",\n       \"\\t        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\\n\",\n       \"\\t\\n\",\n       \"\\t        // Replace delimiters with snippets.\\n\",\n       \"\\t        if (escapeValue) {\\n\",\n       \"\\t          isEscaping = true;\\n\",\n       \"\\t          source += \\\"' +\\\\n__e(\\\" + escapeValue + \\\") +\\\\n'\\\";\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (evaluateValue) {\\n\",\n       \"\\t          isEvaluating = true;\\n\",\n       \"\\t          source += \\\"';\\\\n\\\" + evaluateValue + \\\";\\\\n__p += '\\\";\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (interpolateValue) {\\n\",\n       \"\\t          source += \\\"' +\\\\n((__t = (\\\" + interpolateValue + \\\")) == null ? '' : __t) +\\\\n'\\\";\\n\",\n       \"\\t        }\\n\",\n       \"\\t        index = offset + match.length;\\n\",\n       \"\\t\\n\",\n       \"\\t        // The JS engine embedded in Adobe products needs `match` returned in\\n\",\n       \"\\t        // order to produce the correct `offset` value.\\n\",\n       \"\\t        return match;\\n\",\n       \"\\t      });\\n\",\n       \"\\t\\n\",\n       \"\\t      source += \\\"';\\\\n\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t      // If `variable` is not specified wrap a with-statement around the generated\\n\",\n       \"\\t      // code to add the data object to the top of the scope chain.\\n\",\n       \"\\t      var variable = options.variable;\\n\",\n       \"\\t      if (!variable) {\\n\",\n       \"\\t        source = 'with (obj) {\\\\n' + source + '\\\\n}\\\\n';\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // Cleanup code by stripping empty strings.\\n\",\n       \"\\t      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\\n\",\n       \"\\t        .replace(reEmptyStringMiddle, '$1')\\n\",\n       \"\\t        .replace(reEmptyStringTrailing, '$1;');\\n\",\n       \"\\t\\n\",\n       \"\\t      // Frame code as the function body.\\n\",\n       \"\\t      source = 'function(' + (variable || 'obj') + ') {\\\\n' +\\n\",\n       \"\\t        (variable\\n\",\n       \"\\t          ? ''\\n\",\n       \"\\t          : 'obj || (obj = {});\\\\n'\\n\",\n       \"\\t        ) +\\n\",\n       \"\\t        \\\"var __t, __p = ''\\\" +\\n\",\n       \"\\t        (isEscaping\\n\",\n       \"\\t           ? ', __e = _.escape'\\n\",\n       \"\\t           : ''\\n\",\n       \"\\t        ) +\\n\",\n       \"\\t        (isEvaluating\\n\",\n       \"\\t          ? ', __j = Array.prototype.join;\\\\n' +\\n\",\n       \"\\t            \\\"function print() { __p += __j.call(arguments, '') }\\\\n\\\"\\n\",\n       \"\\t          : ';\\\\n'\\n\",\n       \"\\t        ) +\\n\",\n       \"\\t        source +\\n\",\n       \"\\t        'return __p\\\\n}';\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = attempt(function() {\\n\",\n       \"\\t        return Function(importsKeys, sourceURL + 'return ' + source)\\n\",\n       \"\\t          .apply(undefined, importsValues);\\n\",\n       \"\\t      });\\n\",\n       \"\\t\\n\",\n       \"\\t      // Provide the compiled function's source by its `toString` method or\\n\",\n       \"\\t      // the `source` property as a convenience for inlining compiled templates.\\n\",\n       \"\\t      result.source = source;\\n\",\n       \"\\t      if (isError(result)) {\\n\",\n       \"\\t        throw result;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string`, as a whole, to lower case just like\\n\",\n       \"\\t     * [String#toLowerCase](https://mdn.io/toLowerCase).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the lower cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLower('--Foo-Bar--');\\n\",\n       \"\\t     * // => '--foo-bar--'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLower('fooBar');\\n\",\n       \"\\t     * // => 'foobar'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toLower('__FOO_BAR__');\\n\",\n       \"\\t     * // => '__foo_bar__'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toLower(value) {\\n\",\n       \"\\t      return toString(value).toLowerCase();\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string`, as a whole, to upper case just like\\n\",\n       \"\\t     * [String#toUpperCase](https://mdn.io/toUpperCase).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the upper cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toUpper('--foo-bar--');\\n\",\n       \"\\t     * // => '--FOO-BAR--'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toUpper('fooBar');\\n\",\n       \"\\t     * // => 'FOOBAR'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toUpper('__foo_bar__');\\n\",\n       \"\\t     * // => '__FOO_BAR__'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toUpper(value) {\\n\",\n       \"\\t      return toString(value).toUpperCase();\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes leading and trailing whitespace or specified characters from `string`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to trim.\\n\",\n       \"\\t     * @param {string} [chars=whitespace] The characters to trim.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {string} Returns the trimmed string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.trim('  abc  ');\\n\",\n       \"\\t     * // => 'abc'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.trim('-_-abc-_-', '_-');\\n\",\n       \"\\t     * // => 'abc'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(['  foo  ', '  bar  '], _.trim);\\n\",\n       \"\\t     * // => ['foo', 'bar']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function trim(string, chars, guard) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      if (string && (guard || chars === undefined)) {\\n\",\n       \"\\t        return string.replace(reTrim, '');\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!string || !(chars = baseToString(chars))) {\\n\",\n       \"\\t        return string;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var strSymbols = stringToArray(string),\\n\",\n       \"\\t          chrSymbols = stringToArray(chars),\\n\",\n       \"\\t          start = charsStartIndex(strSymbols, chrSymbols),\\n\",\n       \"\\t          end = charsEndIndex(strSymbols, chrSymbols) + 1;\\n\",\n       \"\\t\\n\",\n       \"\\t      return castSlice(strSymbols, start, end).join('');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes trailing whitespace or specified characters from `string`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to trim.\\n\",\n       \"\\t     * @param {string} [chars=whitespace] The characters to trim.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {string} Returns the trimmed string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.trimEnd('  abc  ');\\n\",\n       \"\\t     * // => '  abc'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.trimEnd('-_-abc-_-', '_-');\\n\",\n       \"\\t     * // => '-_-abc'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function trimEnd(string, chars, guard) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      if (string && (guard || chars === undefined)) {\\n\",\n       \"\\t        return string.replace(reTrimEnd, '');\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!string || !(chars = baseToString(chars))) {\\n\",\n       \"\\t        return string;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var strSymbols = stringToArray(string),\\n\",\n       \"\\t          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\\n\",\n       \"\\t\\n\",\n       \"\\t      return castSlice(strSymbols, 0, end).join('');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Removes leading whitespace or specified characters from `string`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to trim.\\n\",\n       \"\\t     * @param {string} [chars=whitespace] The characters to trim.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {string} Returns the trimmed string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.trimStart('  abc  ');\\n\",\n       \"\\t     * // => 'abc  '\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.trimStart('-_-abc-_-', '_-');\\n\",\n       \"\\t     * // => 'abc-_-'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function trimStart(string, chars, guard) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      if (string && (guard || chars === undefined)) {\\n\",\n       \"\\t        return string.replace(reTrimStart, '');\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (!string || !(chars = baseToString(chars))) {\\n\",\n       \"\\t        return string;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var strSymbols = stringToArray(string),\\n\",\n       \"\\t          start = charsStartIndex(strSymbols, stringToArray(chars));\\n\",\n       \"\\t\\n\",\n       \"\\t      return castSlice(strSymbols, start).join('');\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Truncates `string` if it's longer than the given maximum string length.\\n\",\n       \"\\t     * The last characters of the truncated string are replaced with the omission\\n\",\n       \"\\t     * string which defaults to \\\"...\\\".\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to truncate.\\n\",\n       \"\\t     * @param {Object} [options={}] The options object.\\n\",\n       \"\\t     * @param {number} [options.length=30] The maximum string length.\\n\",\n       \"\\t     * @param {string} [options.omission='...'] The string to indicate text is omitted.\\n\",\n       \"\\t     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\\n\",\n       \"\\t     * @returns {string} Returns the truncated string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.truncate('hi-diddly-ho there, neighborino');\\n\",\n       \"\\t     * // => 'hi-diddly-ho there, neighbo...'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.truncate('hi-diddly-ho there, neighborino', {\\n\",\n       \"\\t     *   'length': 24,\\n\",\n       \"\\t     *   'separator': ' '\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => 'hi-diddly-ho there,...'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.truncate('hi-diddly-ho there, neighborino', {\\n\",\n       \"\\t     *   'length': 24,\\n\",\n       \"\\t     *   'separator': /,? +/\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => 'hi-diddly-ho there...'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.truncate('hi-diddly-ho there, neighborino', {\\n\",\n       \"\\t     *   'omission': ' [...]'\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     * // => 'hi-diddly-ho there, neig [...]'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function truncate(string, options) {\\n\",\n       \"\\t      var length = DEFAULT_TRUNC_LENGTH,\\n\",\n       \"\\t          omission = DEFAULT_TRUNC_OMISSION;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (isObject(options)) {\\n\",\n       \"\\t        var separator = 'separator' in options ? options.separator : separator;\\n\",\n       \"\\t        length = 'length' in options ? toInteger(options.length) : length;\\n\",\n       \"\\t        omission = 'omission' in options ? baseToString(options.omission) : omission;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t\\n\",\n       \"\\t      var strLength = string.length;\\n\",\n       \"\\t      if (hasUnicode(string)) {\\n\",\n       \"\\t        var strSymbols = stringToArray(string);\\n\",\n       \"\\t        strLength = strSymbols.length;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (length >= strLength) {\\n\",\n       \"\\t        return string;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var end = length - stringSize(omission);\\n\",\n       \"\\t      if (end < 1) {\\n\",\n       \"\\t        return omission;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var result = strSymbols\\n\",\n       \"\\t        ? castSlice(strSymbols, 0, end).join('')\\n\",\n       \"\\t        : string.slice(0, end);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (separator === undefined) {\\n\",\n       \"\\t        return result + omission;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (strSymbols) {\\n\",\n       \"\\t        end += (result.length - end);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (isRegExp(separator)) {\\n\",\n       \"\\t        if (string.slice(end).search(separator)) {\\n\",\n       \"\\t          var match,\\n\",\n       \"\\t              substring = result;\\n\",\n       \"\\t\\n\",\n       \"\\t          if (!separator.global) {\\n\",\n       \"\\t            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\\n\",\n       \"\\t          }\\n\",\n       \"\\t          separator.lastIndex = 0;\\n\",\n       \"\\t          while ((match = separator.exec(substring))) {\\n\",\n       \"\\t            var newEnd = match.index;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          result = result.slice(0, newEnd === undefined ? end : newEnd);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } else if (string.indexOf(baseToString(separator), end) != end) {\\n\",\n       \"\\t        var index = result.lastIndexOf(separator);\\n\",\n       \"\\t        if (index > -1) {\\n\",\n       \"\\t          result = result.slice(0, index);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result + omission;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The inverse of `_.escape`; this method converts the HTML entities\\n\",\n       \"\\t     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\\n\",\n       \"\\t     * their corresponding characters.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** No other HTML entities are unescaped. To unescape additional\\n\",\n       \"\\t     * HTML entities use a third-party library like [_he_](https://mths.be/he).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 0.6.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to unescape.\\n\",\n       \"\\t     * @returns {string} Returns the unescaped string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.unescape('fred, barney, &amp; pebbles');\\n\",\n       \"\\t     * // => 'fred, barney, & pebbles'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function unescape(string) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      return (string && reHasEscapedHtml.test(string))\\n\",\n       \"\\t        ? string.replace(reEscapedHtml, unescapeHtmlChar)\\n\",\n       \"\\t        : string;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `string`, as space separated words, to upper case.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the upper cased string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.upperCase('--foo-bar');\\n\",\n       \"\\t     * // => 'FOO BAR'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.upperCase('fooBar');\\n\",\n       \"\\t     * // => 'FOO BAR'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.upperCase('__foo_bar__');\\n\",\n       \"\\t     * // => 'FOO BAR'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var upperCase = createCompounder(function(result, word, index) {\\n\",\n       \"\\t      return result + (index ? ' ' : '') + word.toUpperCase();\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts the first character of `string` to upper case.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to convert.\\n\",\n       \"\\t     * @returns {string} Returns the converted string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.upperFirst('fred');\\n\",\n       \"\\t     * // => 'Fred'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.upperFirst('FRED');\\n\",\n       \"\\t     * // => 'FRED'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var upperFirst = createCaseFirst('toUpperCase');\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Splits `string` into an array of its words.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category String\\n\",\n       \"\\t     * @param {string} [string=''] The string to inspect.\\n\",\n       \"\\t     * @param {RegExp|string} [pattern] The pattern to match words.\\n\",\n       \"\\t     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\\n\",\n       \"\\t     * @returns {Array} Returns the words of `string`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.words('fred, barney, & pebbles');\\n\",\n       \"\\t     * // => ['fred', 'barney', 'pebbles']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.words('fred, barney, & pebbles', /[^, ]+/g);\\n\",\n       \"\\t     * // => ['fred', 'barney', '&', 'pebbles']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function words(string, pattern, guard) {\\n\",\n       \"\\t      string = toString(string);\\n\",\n       \"\\t      pattern = guard ? undefined : pattern;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (pattern === undefined) {\\n\",\n       \"\\t        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return string.match(pattern) || [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Attempts to invoke `func`, returning either the result or the caught error\\n\",\n       \"\\t     * object. Any additional arguments are provided to `func` when it's invoked.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Function} func The function to attempt.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke `func` with.\\n\",\n       \"\\t     * @returns {*} Returns the `func` result or error object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Avoid throwing errors for invalid selectors.\\n\",\n       \"\\t     * var elements = _.attempt(function(selector) {\\n\",\n       \"\\t     *   return document.querySelectorAll(selector);\\n\",\n       \"\\t     * }, '>_>');\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * if (_.isError(elements)) {\\n\",\n       \"\\t     *   elements = [];\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var attempt = baseRest(function(func, args) {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        return apply(func, undefined, args);\\n\",\n       \"\\t      } catch (e) {\\n\",\n       \"\\t        return isError(e) ? e : new Error(e);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Binds methods of an object to the object itself, overwriting the existing\\n\",\n       \"\\t     * method.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** This method doesn't set the \\\"length\\\" property of bound functions.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Object} object The object to bind and assign the bound methods to.\\n\",\n       \"\\t     * @param {...(string|string[])} methodNames The object method names to bind.\\n\",\n       \"\\t     * @returns {Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var view = {\\n\",\n       \"\\t     *   'label': 'docs',\\n\",\n       \"\\t     *   'click': function() {\\n\",\n       \"\\t     *     console.log('clicked ' + this.label);\\n\",\n       \"\\t     *   }\\n\",\n       \"\\t     * };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.bindAll(view, ['click']);\\n\",\n       \"\\t     * jQuery(element).on('click', view.click);\\n\",\n       \"\\t     * // => Logs 'clicked docs' when clicked.\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var bindAll = flatRest(function(object, methodNames) {\\n\",\n       \"\\t      arrayEach(methodNames, function(key) {\\n\",\n       \"\\t        key = toKey(key);\\n\",\n       \"\\t        baseAssignValue(object, key, bind(object[key], object));\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that iterates over `pairs` and invokes the corresponding\\n\",\n       \"\\t     * function of the first predicate to return truthy. The predicate-function\\n\",\n       \"\\t     * pairs are invoked with the `this` binding and arguments of the created\\n\",\n       \"\\t     * function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Array} pairs The predicate-function pairs.\\n\",\n       \"\\t     * @returns {Function} Returns the new composite function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.cond([\\n\",\n       \"\\t     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\\n\",\n       \"\\t     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\\n\",\n       \"\\t     *   [_.stubTrue,                      _.constant('no match')]\\n\",\n       \"\\t     * ]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func({ 'a': 1, 'b': 2 });\\n\",\n       \"\\t     * // => 'matches A'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func({ 'a': 0, 'b': 1 });\\n\",\n       \"\\t     * // => 'matches B'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func({ 'a': '1', 'b': '2' });\\n\",\n       \"\\t     * // => 'no match'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function cond(pairs) {\\n\",\n       \"\\t      var length = pairs == null ? 0 : pairs.length,\\n\",\n       \"\\t          toIteratee = getIteratee();\\n\",\n       \"\\t\\n\",\n       \"\\t      pairs = !length ? [] : arrayMap(pairs, function(pair) {\\n\",\n       \"\\t        if (typeof pair[1] != 'function') {\\n\",\n       \"\\t          throw new TypeError(FUNC_ERROR_TEXT);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return [toIteratee(pair[0]), pair[1]];\\n\",\n       \"\\t      });\\n\",\n       \"\\t\\n\",\n       \"\\t      return baseRest(function(args) {\\n\",\n       \"\\t        var index = -1;\\n\",\n       \"\\t        while (++index < length) {\\n\",\n       \"\\t          var pair = pairs[index];\\n\",\n       \"\\t          if (apply(pair[0], this, args)) {\\n\",\n       \"\\t            return apply(pair[1], this, args);\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes the predicate properties of `source` with\\n\",\n       \"\\t     * the corresponding property values of a given object, returning `true` if\\n\",\n       \"\\t     * all predicates return truthy, else `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** The created function is equivalent to `_.conformsTo` with\\n\",\n       \"\\t     * `source` partially applied.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Object} source The object of property predicates to conform to.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [\\n\",\n       \"\\t     *   { 'a': 2, 'b': 1 },\\n\",\n       \"\\t     *   { 'a': 1, 'b': 2 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\\n\",\n       \"\\t     * // => [{ 'a': 1, 'b': 2 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function conforms(source) {\\n\",\n       \"\\t      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that returns `value`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.4.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {*} value The value to return from the new function.\\n\",\n       \"\\t     * @returns {Function} Returns the new constant function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = _.times(2, _.constant({ 'a': 1 }));\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(objects);\\n\",\n       \"\\t     * // => [{ 'a': 1 }, { 'a': 1 }]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(objects[0] === objects[1]);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function constant(value) {\\n\",\n       \"\\t      return function() {\\n\",\n       \"\\t        return value;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Checks `value` to determine whether a default value should be returned in\\n\",\n       \"\\t     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\\n\",\n       \"\\t     * or `undefined`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.14.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {*} value The value to check.\\n\",\n       \"\\t     * @param {*} defaultValue The default value.\\n\",\n       \"\\t     * @returns {*} Returns the resolved value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.defaultTo(1, 10);\\n\",\n       \"\\t     * // => 1\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.defaultTo(undefined, 10);\\n\",\n       \"\\t     * // => 10\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function defaultTo(value, defaultValue) {\\n\",\n       \"\\t      return (value == null || value !== value) ? defaultValue : value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that returns the result of invoking the given functions\\n\",\n       \"\\t     * with the `this` binding of the created function, where each successive\\n\",\n       \"\\t     * invocation is supplied the return value of the previous.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {...(Function|Function[])} [funcs] The functions to invoke.\\n\",\n       \"\\t     * @returns {Function} Returns the new composite function.\\n\",\n       \"\\t     * @see _.flowRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function square(n) {\\n\",\n       \"\\t     *   return n * n;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var addSquare = _.flow([_.add, square]);\\n\",\n       \"\\t     * addSquare(1, 2);\\n\",\n       \"\\t     * // => 9\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var flow = createFlow();\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.flow` except that it creates a function that\\n\",\n       \"\\t     * invokes the given functions from right to left.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {...(Function|Function[])} [funcs] The functions to invoke.\\n\",\n       \"\\t     * @returns {Function} Returns the new composite function.\\n\",\n       \"\\t     * @see _.flow\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function square(n) {\\n\",\n       \"\\t     *   return n * n;\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var addSquare = _.flowRight([square, _.add]);\\n\",\n       \"\\t     * addSquare(1, 2);\\n\",\n       \"\\t     * // => 9\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var flowRight = createFlow(true);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns the first argument it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {*} value Any value.\\n\",\n       \"\\t     * @returns {*} Returns `value`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var object = { 'a': 1 };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(_.identity(object) === object);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function identity(value) {\\n\",\n       \"\\t      return value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `func` with the arguments of the created\\n\",\n       \"\\t     * function. If `func` is a property name, the created function returns the\\n\",\n       \"\\t     * property value for a given element. If `func` is an array or object, the\\n\",\n       \"\\t     * created function returns `true` for elements that contain the equivalent\\n\",\n       \"\\t     * source properties, otherwise it returns `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {*} [func=_.identity] The value to convert to a callback.\\n\",\n       \"\\t     * @returns {Function} Returns the callback.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var users = [\\n\",\n       \"\\t     *   { 'user': 'barney', 'age': 36, 'active': true },\\n\",\n       \"\\t     *   { 'user': 'fred',   'age': 40, 'active': false }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matches` iteratee shorthand.\\n\",\n       \"\\t     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\\n\",\n       \"\\t     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.matchesProperty` iteratee shorthand.\\n\",\n       \"\\t     * _.filter(users, _.iteratee(['user', 'fred']));\\n\",\n       \"\\t     * // => [{ 'user': 'fred', 'age': 40 }]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.map(users, _.iteratee('user'));\\n\",\n       \"\\t     * // => ['barney', 'fred']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // Create custom iteratee shorthands.\\n\",\n       \"\\t     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\\n\",\n       \"\\t     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\\n\",\n       \"\\t     *     return func.test(string);\\n\",\n       \"\\t     *   };\\n\",\n       \"\\t     * });\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.filter(['abc', 'def'], /ef/);\\n\",\n       \"\\t     * // => ['def']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function iteratee(func) {\\n\",\n       \"\\t      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that performs a partial deep comparison between a given\\n\",\n       \"\\t     * object and `source`, returning `true` if the given object has equivalent\\n\",\n       \"\\t     * property values, else `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** The created function is equivalent to `_.isMatch` with `source`\\n\",\n       \"\\t     * partially applied.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * Partial comparisons will match empty array and empty object `source`\\n\",\n       \"\\t     * values against any array or object value, respectively. See `_.isEqual`\\n\",\n       \"\\t     * for a list of supported value comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Object} source The object of property values to match.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [\\n\",\n       \"\\t     *   { 'a': 1, 'b': 2, 'c': 3 },\\n\",\n       \"\\t     *   { 'a': 4, 'b': 5, 'c': 6 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\\n\",\n       \"\\t     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function matches(source) {\\n\",\n       \"\\t      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that performs a partial deep comparison between the\\n\",\n       \"\\t     * value at `path` of a given object to `srcValue`, returning `true` if the\\n\",\n       \"\\t     * object value is equivalent, else `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Partial comparisons will match empty array and empty object\\n\",\n       \"\\t     * `srcValue` values against any array or object value, respectively. See\\n\",\n       \"\\t     * `_.isEqual` for a list of supported value comparisons.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.2.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to get.\\n\",\n       \"\\t     * @param {*} srcValue The value to match.\\n\",\n       \"\\t     * @returns {Function} Returns the new spec function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [\\n\",\n       \"\\t     *   { 'a': 1, 'b': 2, 'c': 3 },\\n\",\n       \"\\t     *   { 'a': 4, 'b': 5, 'c': 6 }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.find(objects, _.matchesProperty('a', 4));\\n\",\n       \"\\t     * // => { 'a': 4, 'b': 5, 'c': 6 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function matchesProperty(path, srcValue) {\\n\",\n       \"\\t      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes the method at `path` of a given object.\\n\",\n       \"\\t     * Any additional arguments are provided to the invoked method.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.7.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Array|string} path The path of the method to invoke.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke the method with.\\n\",\n       \"\\t     * @returns {Function} Returns the new invoker function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [\\n\",\n       \"\\t     *   { 'a': { 'b': _.constant(2) } },\\n\",\n       \"\\t     *   { 'a': { 'b': _.constant(1) } }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(objects, _.method('a.b'));\\n\",\n       \"\\t     * // => [2, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(objects, _.method(['a', 'b']));\\n\",\n       \"\\t     * // => [2, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var method = baseRest(function(path, args) {\\n\",\n       \"\\t      return function(object) {\\n\",\n       \"\\t        return baseInvoke(object, path, args);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.method`; this method creates a function that invokes\\n\",\n       \"\\t     * the method at a given path of `object`. Any additional arguments are\\n\",\n       \"\\t     * provided to the invoked method.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.7.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @param {...*} [args] The arguments to invoke the method with.\\n\",\n       \"\\t     * @returns {Function} Returns the new invoker function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = _.times(3, _.constant),\\n\",\n       \"\\t     *     object = { 'a': array, 'b': array, 'c': array };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\\n\",\n       \"\\t     * // => [2, 0]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\\n\",\n       \"\\t     * // => [2, 0]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var methodOf = baseRest(function(object, args) {\\n\",\n       \"\\t      return function(path) {\\n\",\n       \"\\t        return baseInvoke(object, path, args);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Adds all own enumerable string keyed function properties of a source\\n\",\n       \"\\t     * object to the destination object. If `object` is a function, then methods\\n\",\n       \"\\t     * are added to its prototype as well.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\\n\",\n       \"\\t     * avoid conflicts caused by modifying the original.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Function|Object} [object=lodash] The destination object.\\n\",\n       \"\\t     * @param {Object} source The object of functions to add.\\n\",\n       \"\\t     * @param {Object} [options={}] The options object.\\n\",\n       \"\\t     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\\n\",\n       \"\\t     * @returns {Function|Object} Returns `object`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * function vowels(string) {\\n\",\n       \"\\t     *   return _.filter(string, function(v) {\\n\",\n       \"\\t     *     return /[aeiou]/i.test(v);\\n\",\n       \"\\t     *   });\\n\",\n       \"\\t     * }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.mixin({ 'vowels': vowels });\\n\",\n       \"\\t     * _.vowels('fred');\\n\",\n       \"\\t     * // => ['e']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _('fred').vowels().value();\\n\",\n       \"\\t     * // => ['e']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.mixin({ 'vowels': vowels }, { 'chain': false });\\n\",\n       \"\\t     * _('fred').vowels();\\n\",\n       \"\\t     * // => ['e']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mixin(object, source, options) {\\n\",\n       \"\\t      var props = keys(source),\\n\",\n       \"\\t          methodNames = baseFunctions(source, props);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (options == null &&\\n\",\n       \"\\t          !(isObject(source) && (methodNames.length || !props.length))) {\\n\",\n       \"\\t        options = source;\\n\",\n       \"\\t        source = object;\\n\",\n       \"\\t        object = this;\\n\",\n       \"\\t        methodNames = baseFunctions(source, keys(source));\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\\n\",\n       \"\\t          isFunc = isFunction(object);\\n\",\n       \"\\t\\n\",\n       \"\\t      arrayEach(methodNames, function(methodName) {\\n\",\n       \"\\t        var func = source[methodName];\\n\",\n       \"\\t        object[methodName] = func;\\n\",\n       \"\\t        if (isFunc) {\\n\",\n       \"\\t          object.prototype[methodName] = function() {\\n\",\n       \"\\t            var chainAll = this.__chain__;\\n\",\n       \"\\t            if (chain || chainAll) {\\n\",\n       \"\\t              var result = object(this.__wrapped__),\\n\",\n       \"\\t                  actions = result.__actions__ = copyArray(this.__actions__);\\n\",\n       \"\\t\\n\",\n       \"\\t              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\\n\",\n       \"\\t              result.__chain__ = chainAll;\\n\",\n       \"\\t              return result;\\n\",\n       \"\\t            }\\n\",\n       \"\\t            return func.apply(object, arrayPush([this.value()], arguments));\\n\",\n       \"\\t          };\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t\\n\",\n       \"\\t      return object;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Reverts the `_` variable to its previous value and returns a reference to\\n\",\n       \"\\t     * the `lodash` function.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @returns {Function} Returns the `lodash` function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var lodash = _.noConflict();\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function noConflict() {\\n\",\n       \"\\t      if (root._ === this) {\\n\",\n       \"\\t        root._ = oldDash;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return this;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns `undefined`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.3.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.times(2, _.noop);\\n\",\n       \"\\t     * // => [undefined, undefined]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function noop() {\\n\",\n       \"\\t      // No operation performed.\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that gets the argument at index `n`. If `n` is negative,\\n\",\n       \"\\t     * the nth argument from the end is returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {number} [n=0] The index of the argument to return.\\n\",\n       \"\\t     * @returns {Function} Returns the new pass-thru function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.nthArg(1);\\n\",\n       \"\\t     * func('a', 'b', 'c', 'd');\\n\",\n       \"\\t     * // => 'b'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.nthArg(-2);\\n\",\n       \"\\t     * func('a', 'b', 'c', 'd');\\n\",\n       \"\\t     * // => 'c'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function nthArg(n) {\\n\",\n       \"\\t      n = toInteger(n);\\n\",\n       \"\\t      return baseRest(function(args) {\\n\",\n       \"\\t        return baseNth(args, n);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that invokes `iteratees` with the arguments it receives\\n\",\n       \"\\t     * and returns their results.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {...(Function|Function[])} [iteratees=[_.identity]]\\n\",\n       \"\\t     *  The iteratees to invoke.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.over([Math.max, Math.min]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(1, 2, 3, 4);\\n\",\n       \"\\t     * // => [4, 1]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var over = createOver(arrayMap);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that checks if **all** of the `predicates` return\\n\",\n       \"\\t     * truthy when invoked with the arguments it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {...(Function|Function[])} [predicates=[_.identity]]\\n\",\n       \"\\t     *  The predicates to check.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.overEvery([Boolean, isFinite]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func('1');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(null);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(NaN);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var overEvery = createOver(arrayEvery);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that checks if **any** of the `predicates` return\\n\",\n       \"\\t     * truthy when invoked with the arguments it receives.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {...(Function|Function[])} [predicates=[_.identity]]\\n\",\n       \"\\t     *  The predicates to check.\\n\",\n       \"\\t     * @returns {Function} Returns the new function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var func = _.overSome([Boolean, isFinite]);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func('1');\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(null);\\n\",\n       \"\\t     * // => true\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * func(NaN);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var overSome = createOver(arraySome);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates a function that returns the value at `path` of a given object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 2.4.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Array|string} path The path of the property to get.\\n\",\n       \"\\t     * @returns {Function} Returns the new accessor function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [\\n\",\n       \"\\t     *   { 'a': { 'b': 2 } },\\n\",\n       \"\\t     *   { 'a': { 'b': 1 } }\\n\",\n       \"\\t     * ];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(objects, _.property('a.b'));\\n\",\n       \"\\t     * // => [2, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\\n\",\n       \"\\t     * // => [1, 2]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function property(path) {\\n\",\n       \"\\t      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The opposite of `_.property`; this method creates a function that returns\\n\",\n       \"\\t     * the value at a given path of `object`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {Object} object The object to query.\\n\",\n       \"\\t     * @returns {Function} Returns the new accessor function.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var array = [0, 1, 2],\\n\",\n       \"\\t     *     object = { 'a': array, 'b': array, 'c': array };\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\\n\",\n       \"\\t     * // => [2, 0]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\\n\",\n       \"\\t     * // => [2, 0]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function propertyOf(object) {\\n\",\n       \"\\t      return function(path) {\\n\",\n       \"\\t        return object == null ? undefined : baseGet(object, path);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Creates an array of numbers (positive and/or negative) progressing from\\n\",\n       \"\\t     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\\n\",\n       \"\\t     * `start` is specified without an `end` or `step`. If `end` is not specified,\\n\",\n       \"\\t     * it's set to `start` with `start` then set to `0`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * **Note:** JavaScript follows the IEEE-754 standard for resolving\\n\",\n       \"\\t     * floating-point values which can produce unexpected results.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {number} [start=0] The start of the range.\\n\",\n       \"\\t     * @param {number} end The end of the range.\\n\",\n       \"\\t     * @param {number} [step=1] The value to increment or decrement by.\\n\",\n       \"\\t     * @returns {Array} Returns the range of numbers.\\n\",\n       \"\\t     * @see _.inRange, _.rangeRight\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(4);\\n\",\n       \"\\t     * // => [0, 1, 2, 3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(-4);\\n\",\n       \"\\t     * // => [0, -1, -2, -3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(1, 5);\\n\",\n       \"\\t     * // => [1, 2, 3, 4]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(0, 20, 5);\\n\",\n       \"\\t     * // => [0, 5, 10, 15]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(0, -4, -1);\\n\",\n       \"\\t     * // => [0, -1, -2, -3]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(1, 4, 0);\\n\",\n       \"\\t     * // => [1, 1, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.range(0);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var range = createRange();\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.range` except that it populates values in\\n\",\n       \"\\t     * descending order.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {number} [start=0] The start of the range.\\n\",\n       \"\\t     * @param {number} end The end of the range.\\n\",\n       \"\\t     * @param {number} [step=1] The value to increment or decrement by.\\n\",\n       \"\\t     * @returns {Array} Returns the range of numbers.\\n\",\n       \"\\t     * @see _.inRange, _.range\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(4);\\n\",\n       \"\\t     * // => [3, 2, 1, 0]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(-4);\\n\",\n       \"\\t     * // => [-3, -2, -1, 0]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(1, 5);\\n\",\n       \"\\t     * // => [4, 3, 2, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(0, 20, 5);\\n\",\n       \"\\t     * // => [15, 10, 5, 0]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(0, -4, -1);\\n\",\n       \"\\t     * // => [-3, -2, -1, 0]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(1, 4, 0);\\n\",\n       \"\\t     * // => [1, 1, 1]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.rangeRight(0);\\n\",\n       \"\\t     * // => []\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var rangeRight = createRange(true);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns a new empty array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.13.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @returns {Array} Returns the new empty array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var arrays = _.times(2, _.stubArray);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(arrays);\\n\",\n       \"\\t     * // => [[], []]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(arrays[0] === arrays[1]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stubArray() {\\n\",\n       \"\\t      return [];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns `false`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.13.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @returns {boolean} Returns `false`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.times(2, _.stubFalse);\\n\",\n       \"\\t     * // => [false, false]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stubFalse() {\\n\",\n       \"\\t      return false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns a new empty object.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.13.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @returns {Object} Returns the new empty object.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = _.times(2, _.stubObject);\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(objects);\\n\",\n       \"\\t     * // => [{}, {}]\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * console.log(objects[0] === objects[1]);\\n\",\n       \"\\t     * // => false\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stubObject() {\\n\",\n       \"\\t      return {};\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns an empty string.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.13.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @returns {string} Returns the empty string.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.times(2, _.stubString);\\n\",\n       \"\\t     * // => ['', '']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stubString() {\\n\",\n       \"\\t      return '';\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method returns `true`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.13.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @returns {boolean} Returns `true`.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.times(2, _.stubTrue);\\n\",\n       \"\\t     * // => [true, true]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function stubTrue() {\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Invokes the iteratee `n` times, returning an array of the results of\\n\",\n       \"\\t     * each invocation. The iteratee is invoked with one argument; (index).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {number} n The number of times to invoke `iteratee`.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\\n\",\n       \"\\t     * @returns {Array} Returns the array of results.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.times(3, String);\\n\",\n       \"\\t     * // => ['0', '1', '2']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     *  _.times(4, _.constant(0));\\n\",\n       \"\\t     * // => [0, 0, 0, 0]\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function times(n, iteratee) {\\n\",\n       \"\\t      n = toInteger(n);\\n\",\n       \"\\t      if (n < 1 || n > MAX_SAFE_INTEGER) {\\n\",\n       \"\\t        return [];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var index = MAX_ARRAY_LENGTH,\\n\",\n       \"\\t          length = nativeMin(n, MAX_ARRAY_LENGTH);\\n\",\n       \"\\t\\n\",\n       \"\\t      iteratee = getIteratee(iteratee);\\n\",\n       \"\\t      n -= MAX_ARRAY_LENGTH;\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = baseTimes(length, iteratee);\\n\",\n       \"\\t      while (++index < n) {\\n\",\n       \"\\t        iteratee(index);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Converts `value` to a property path array.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {*} value The value to convert.\\n\",\n       \"\\t     * @returns {Array} Returns the new property path array.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toPath('a.b.c');\\n\",\n       \"\\t     * // => ['a', 'b', 'c']\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.toPath('a[0].b.c');\\n\",\n       \"\\t     * // => ['a', '0', 'b', 'c']\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function toPath(value) {\\n\",\n       \"\\t      if (isArray(value)) {\\n\",\n       \"\\t        return arrayMap(value, toKey);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Util\\n\",\n       \"\\t     * @param {string} [prefix=''] The value to prefix the ID with.\\n\",\n       \"\\t     * @returns {string} Returns the unique ID.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.uniqueId('contact_');\\n\",\n       \"\\t     * // => 'contact_104'\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.uniqueId();\\n\",\n       \"\\t     * // => '105'\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function uniqueId(prefix) {\\n\",\n       \"\\t      var id = ++idCounter;\\n\",\n       \"\\t      return toString(prefix) + id;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Adds two numbers.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.4.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} augend The first number in an addition.\\n\",\n       \"\\t     * @param {number} addend The second number in an addition.\\n\",\n       \"\\t     * @returns {number} Returns the total.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.add(6, 4);\\n\",\n       \"\\t     * // => 10\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var add = createMathOperation(function(augend, addend) {\\n\",\n       \"\\t      return augend + addend;\\n\",\n       \"\\t    }, 0);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes `number` rounded up to `precision`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.10.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} number The number to round up.\\n\",\n       \"\\t     * @param {number} [precision=0] The precision to round up to.\\n\",\n       \"\\t     * @returns {number} Returns the rounded up number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.ceil(4.006);\\n\",\n       \"\\t     * // => 5\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.ceil(6.004, 2);\\n\",\n       \"\\t     * // => 6.01\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.ceil(6040, -2);\\n\",\n       \"\\t     * // => 6100\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var ceil = createRound('ceil');\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Divide two numbers.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.7.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} dividend The first number in a division.\\n\",\n       \"\\t     * @param {number} divisor The second number in a division.\\n\",\n       \"\\t     * @returns {number} Returns the quotient.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.divide(6, 4);\\n\",\n       \"\\t     * // => 1.5\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var divide = createMathOperation(function(dividend, divisor) {\\n\",\n       \"\\t      return dividend / divisor;\\n\",\n       \"\\t    }, 1);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes `number` rounded down to `precision`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.10.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} number The number to round down.\\n\",\n       \"\\t     * @param {number} [precision=0] The precision to round down to.\\n\",\n       \"\\t     * @returns {number} Returns the rounded down number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.floor(4.006);\\n\",\n       \"\\t     * // => 4\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.floor(0.046, 2);\\n\",\n       \"\\t     * // => 0.04\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.floor(4060, -2);\\n\",\n       \"\\t     * // => 4000\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var floor = createRound('floor');\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes the maximum value of `array`. If `array` is empty or falsey,\\n\",\n       \"\\t     * `undefined` is returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @returns {*} Returns the maximum value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.max([4, 2, 8, 6]);\\n\",\n       \"\\t     * // => 8\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.max([]);\\n\",\n       \"\\t     * // => undefined\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function max(array) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseExtremum(array, identity, baseGt)\\n\",\n       \"\\t        : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.max` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element in `array` to generate the criterion by which\\n\",\n       \"\\t     * the value is ranked. The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {*} Returns the maximum value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'n': 1 }, { 'n': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.maxBy(objects, function(o) { return o.n; });\\n\",\n       \"\\t     * // => { 'n': 2 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.maxBy(objects, 'n');\\n\",\n       \"\\t     * // => { 'n': 2 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function maxBy(array, iteratee) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\\n\",\n       \"\\t        : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes the mean of the values in `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @returns {number} Returns the mean.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.mean([4, 2, 8, 6]);\\n\",\n       \"\\t     * // => 5\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function mean(array) {\\n\",\n       \"\\t      return baseMean(array, identity);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.mean` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element in `array` to generate the value to be averaged.\\n\",\n       \"\\t     * The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.7.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {number} Returns the mean.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.meanBy(objects, function(o) { return o.n; });\\n\",\n       \"\\t     * // => 5\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.meanBy(objects, 'n');\\n\",\n       \"\\t     * // => 5\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function meanBy(array, iteratee) {\\n\",\n       \"\\t      return baseMean(array, getIteratee(iteratee, 2));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes the minimum value of `array`. If `array` is empty or falsey,\\n\",\n       \"\\t     * `undefined` is returned.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @since 0.1.0\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @returns {*} Returns the minimum value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.min([4, 2, 8, 6]);\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.min([]);\\n\",\n       \"\\t     * // => undefined\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function min(array) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseExtremum(array, identity, baseLt)\\n\",\n       \"\\t        : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.min` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element in `array` to generate the criterion by which\\n\",\n       \"\\t     * the value is ranked. The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {*} Returns the minimum value.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'n': 1 }, { 'n': 2 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.minBy(objects, function(o) { return o.n; });\\n\",\n       \"\\t     * // => { 'n': 1 }\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.minBy(objects, 'n');\\n\",\n       \"\\t     * // => { 'n': 1 }\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function minBy(array, iteratee) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\\n\",\n       \"\\t        : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Multiply two numbers.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.7.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} multiplier The first number in a multiplication.\\n\",\n       \"\\t     * @param {number} multiplicand The second number in a multiplication.\\n\",\n       \"\\t     * @returns {number} Returns the product.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.multiply(6, 4);\\n\",\n       \"\\t     * // => 24\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var multiply = createMathOperation(function(multiplier, multiplicand) {\\n\",\n       \"\\t      return multiplier * multiplicand;\\n\",\n       \"\\t    }, 1);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes `number` rounded to `precision`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.10.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} number The number to round.\\n\",\n       \"\\t     * @param {number} [precision=0] The precision to round to.\\n\",\n       \"\\t     * @returns {number} Returns the rounded number.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.round(4.006);\\n\",\n       \"\\t     * // => 4\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.round(4.006, 2);\\n\",\n       \"\\t     * // => 4.01\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.round(4060, -2);\\n\",\n       \"\\t     * // => 4100\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var round = createRound('round');\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Subtract two numbers.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {number} minuend The first number in a subtraction.\\n\",\n       \"\\t     * @param {number} subtrahend The second number in a subtraction.\\n\",\n       \"\\t     * @returns {number} Returns the difference.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.subtract(6, 4);\\n\",\n       \"\\t     * // => 2\\n\",\n       \"\\t     */\\n\",\n       \"\\t    var subtract = createMathOperation(function(minuend, subtrahend) {\\n\",\n       \"\\t      return minuend - subtrahend;\\n\",\n       \"\\t    }, 0);\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * Computes the sum of the values in `array`.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 3.4.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @returns {number} Returns the sum.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sum([4, 2, 8, 6]);\\n\",\n       \"\\t     * // => 20\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sum(array) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseSum(array, identity)\\n\",\n       \"\\t        : 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * This method is like `_.sum` except that it accepts `iteratee` which is\\n\",\n       \"\\t     * invoked for each element in `array` to generate the value to be summed.\\n\",\n       \"\\t     * The iteratee is invoked with one argument: (value).\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @since 4.0.0\\n\",\n       \"\\t     * @category Math\\n\",\n       \"\\t     * @param {Array} array The array to iterate over.\\n\",\n       \"\\t     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\\n\",\n       \"\\t     * @returns {number} Returns the sum.\\n\",\n       \"\\t     * @example\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * _.sumBy(objects, function(o) { return o.n; });\\n\",\n       \"\\t     * // => 20\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * // The `_.property` iteratee shorthand.\\n\",\n       \"\\t     * _.sumBy(objects, 'n');\\n\",\n       \"\\t     * // => 20\\n\",\n       \"\\t     */\\n\",\n       \"\\t    function sumBy(array, iteratee) {\\n\",\n       \"\\t      return (array && array.length)\\n\",\n       \"\\t        ? baseSum(array, getIteratee(iteratee, 2))\\n\",\n       \"\\t        : 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods that return wrapped values in chain sequences.\\n\",\n       \"\\t    lodash.after = after;\\n\",\n       \"\\t    lodash.ary = ary;\\n\",\n       \"\\t    lodash.assign = assign;\\n\",\n       \"\\t    lodash.assignIn = assignIn;\\n\",\n       \"\\t    lodash.assignInWith = assignInWith;\\n\",\n       \"\\t    lodash.assignWith = assignWith;\\n\",\n       \"\\t    lodash.at = at;\\n\",\n       \"\\t    lodash.before = before;\\n\",\n       \"\\t    lodash.bind = bind;\\n\",\n       \"\\t    lodash.bindAll = bindAll;\\n\",\n       \"\\t    lodash.bindKey = bindKey;\\n\",\n       \"\\t    lodash.castArray = castArray;\\n\",\n       \"\\t    lodash.chain = chain;\\n\",\n       \"\\t    lodash.chunk = chunk;\\n\",\n       \"\\t    lodash.compact = compact;\\n\",\n       \"\\t    lodash.concat = concat;\\n\",\n       \"\\t    lodash.cond = cond;\\n\",\n       \"\\t    lodash.conforms = conforms;\\n\",\n       \"\\t    lodash.constant = constant;\\n\",\n       \"\\t    lodash.countBy = countBy;\\n\",\n       \"\\t    lodash.create = create;\\n\",\n       \"\\t    lodash.curry = curry;\\n\",\n       \"\\t    lodash.curryRight = curryRight;\\n\",\n       \"\\t    lodash.debounce = debounce;\\n\",\n       \"\\t    lodash.defaults = defaults;\\n\",\n       \"\\t    lodash.defaultsDeep = defaultsDeep;\\n\",\n       \"\\t    lodash.defer = defer;\\n\",\n       \"\\t    lodash.delay = delay;\\n\",\n       \"\\t    lodash.difference = difference;\\n\",\n       \"\\t    lodash.differenceBy = differenceBy;\\n\",\n       \"\\t    lodash.differenceWith = differenceWith;\\n\",\n       \"\\t    lodash.drop = drop;\\n\",\n       \"\\t    lodash.dropRight = dropRight;\\n\",\n       \"\\t    lodash.dropRightWhile = dropRightWhile;\\n\",\n       \"\\t    lodash.dropWhile = dropWhile;\\n\",\n       \"\\t    lodash.fill = fill;\\n\",\n       \"\\t    lodash.filter = filter;\\n\",\n       \"\\t    lodash.flatMap = flatMap;\\n\",\n       \"\\t    lodash.flatMapDeep = flatMapDeep;\\n\",\n       \"\\t    lodash.flatMapDepth = flatMapDepth;\\n\",\n       \"\\t    lodash.flatten = flatten;\\n\",\n       \"\\t    lodash.flattenDeep = flattenDeep;\\n\",\n       \"\\t    lodash.flattenDepth = flattenDepth;\\n\",\n       \"\\t    lodash.flip = flip;\\n\",\n       \"\\t    lodash.flow = flow;\\n\",\n       \"\\t    lodash.flowRight = flowRight;\\n\",\n       \"\\t    lodash.fromPairs = fromPairs;\\n\",\n       \"\\t    lodash.functions = functions;\\n\",\n       \"\\t    lodash.functionsIn = functionsIn;\\n\",\n       \"\\t    lodash.groupBy = groupBy;\\n\",\n       \"\\t    lodash.initial = initial;\\n\",\n       \"\\t    lodash.intersection = intersection;\\n\",\n       \"\\t    lodash.intersectionBy = intersectionBy;\\n\",\n       \"\\t    lodash.intersectionWith = intersectionWith;\\n\",\n       \"\\t    lodash.invert = invert;\\n\",\n       \"\\t    lodash.invertBy = invertBy;\\n\",\n       \"\\t    lodash.invokeMap = invokeMap;\\n\",\n       \"\\t    lodash.iteratee = iteratee;\\n\",\n       \"\\t    lodash.keyBy = keyBy;\\n\",\n       \"\\t    lodash.keys = keys;\\n\",\n       \"\\t    lodash.keysIn = keysIn;\\n\",\n       \"\\t    lodash.map = map;\\n\",\n       \"\\t    lodash.mapKeys = mapKeys;\\n\",\n       \"\\t    lodash.mapValues = mapValues;\\n\",\n       \"\\t    lodash.matches = matches;\\n\",\n       \"\\t    lodash.matchesProperty = matchesProperty;\\n\",\n       \"\\t    lodash.memoize = memoize;\\n\",\n       \"\\t    lodash.merge = merge;\\n\",\n       \"\\t    lodash.mergeWith = mergeWith;\\n\",\n       \"\\t    lodash.method = method;\\n\",\n       \"\\t    lodash.methodOf = methodOf;\\n\",\n       \"\\t    lodash.mixin = mixin;\\n\",\n       \"\\t    lodash.negate = negate;\\n\",\n       \"\\t    lodash.nthArg = nthArg;\\n\",\n       \"\\t    lodash.omit = omit;\\n\",\n       \"\\t    lodash.omitBy = omitBy;\\n\",\n       \"\\t    lodash.once = once;\\n\",\n       \"\\t    lodash.orderBy = orderBy;\\n\",\n       \"\\t    lodash.over = over;\\n\",\n       \"\\t    lodash.overArgs = overArgs;\\n\",\n       \"\\t    lodash.overEvery = overEvery;\\n\",\n       \"\\t    lodash.overSome = overSome;\\n\",\n       \"\\t    lodash.partial = partial;\\n\",\n       \"\\t    lodash.partialRight = partialRight;\\n\",\n       \"\\t    lodash.partition = partition;\\n\",\n       \"\\t    lodash.pick = pick;\\n\",\n       \"\\t    lodash.pickBy = pickBy;\\n\",\n       \"\\t    lodash.property = property;\\n\",\n       \"\\t    lodash.propertyOf = propertyOf;\\n\",\n       \"\\t    lodash.pull = pull;\\n\",\n       \"\\t    lodash.pullAll = pullAll;\\n\",\n       \"\\t    lodash.pullAllBy = pullAllBy;\\n\",\n       \"\\t    lodash.pullAllWith = pullAllWith;\\n\",\n       \"\\t    lodash.pullAt = pullAt;\\n\",\n       \"\\t    lodash.range = range;\\n\",\n       \"\\t    lodash.rangeRight = rangeRight;\\n\",\n       \"\\t    lodash.rearg = rearg;\\n\",\n       \"\\t    lodash.reject = reject;\\n\",\n       \"\\t    lodash.remove = remove;\\n\",\n       \"\\t    lodash.rest = rest;\\n\",\n       \"\\t    lodash.reverse = reverse;\\n\",\n       \"\\t    lodash.sampleSize = sampleSize;\\n\",\n       \"\\t    lodash.set = set;\\n\",\n       \"\\t    lodash.setWith = setWith;\\n\",\n       \"\\t    lodash.shuffle = shuffle;\\n\",\n       \"\\t    lodash.slice = slice;\\n\",\n       \"\\t    lodash.sortBy = sortBy;\\n\",\n       \"\\t    lodash.sortedUniq = sortedUniq;\\n\",\n       \"\\t    lodash.sortedUniqBy = sortedUniqBy;\\n\",\n       \"\\t    lodash.split = split;\\n\",\n       \"\\t    lodash.spread = spread;\\n\",\n       \"\\t    lodash.tail = tail;\\n\",\n       \"\\t    lodash.take = take;\\n\",\n       \"\\t    lodash.takeRight = takeRight;\\n\",\n       \"\\t    lodash.takeRightWhile = takeRightWhile;\\n\",\n       \"\\t    lodash.takeWhile = takeWhile;\\n\",\n       \"\\t    lodash.tap = tap;\\n\",\n       \"\\t    lodash.throttle = throttle;\\n\",\n       \"\\t    lodash.thru = thru;\\n\",\n       \"\\t    lodash.toArray = toArray;\\n\",\n       \"\\t    lodash.toPairs = toPairs;\\n\",\n       \"\\t    lodash.toPairsIn = toPairsIn;\\n\",\n       \"\\t    lodash.toPath = toPath;\\n\",\n       \"\\t    lodash.toPlainObject = toPlainObject;\\n\",\n       \"\\t    lodash.transform = transform;\\n\",\n       \"\\t    lodash.unary = unary;\\n\",\n       \"\\t    lodash.union = union;\\n\",\n       \"\\t    lodash.unionBy = unionBy;\\n\",\n       \"\\t    lodash.unionWith = unionWith;\\n\",\n       \"\\t    lodash.uniq = uniq;\\n\",\n       \"\\t    lodash.uniqBy = uniqBy;\\n\",\n       \"\\t    lodash.uniqWith = uniqWith;\\n\",\n       \"\\t    lodash.unset = unset;\\n\",\n       \"\\t    lodash.unzip = unzip;\\n\",\n       \"\\t    lodash.unzipWith = unzipWith;\\n\",\n       \"\\t    lodash.update = update;\\n\",\n       \"\\t    lodash.updateWith = updateWith;\\n\",\n       \"\\t    lodash.values = values;\\n\",\n       \"\\t    lodash.valuesIn = valuesIn;\\n\",\n       \"\\t    lodash.without = without;\\n\",\n       \"\\t    lodash.words = words;\\n\",\n       \"\\t    lodash.wrap = wrap;\\n\",\n       \"\\t    lodash.xor = xor;\\n\",\n       \"\\t    lodash.xorBy = xorBy;\\n\",\n       \"\\t    lodash.xorWith = xorWith;\\n\",\n       \"\\t    lodash.zip = zip;\\n\",\n       \"\\t    lodash.zipObject = zipObject;\\n\",\n       \"\\t    lodash.zipObjectDeep = zipObjectDeep;\\n\",\n       \"\\t    lodash.zipWith = zipWith;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add aliases.\\n\",\n       \"\\t    lodash.entries = toPairs;\\n\",\n       \"\\t    lodash.entriesIn = toPairsIn;\\n\",\n       \"\\t    lodash.extend = assignIn;\\n\",\n       \"\\t    lodash.extendWith = assignInWith;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `lodash.prototype`.\\n\",\n       \"\\t    mixin(lodash, lodash);\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods that return unwrapped values in chain sequences.\\n\",\n       \"\\t    lodash.add = add;\\n\",\n       \"\\t    lodash.attempt = attempt;\\n\",\n       \"\\t    lodash.camelCase = camelCase;\\n\",\n       \"\\t    lodash.capitalize = capitalize;\\n\",\n       \"\\t    lodash.ceil = ceil;\\n\",\n       \"\\t    lodash.clamp = clamp;\\n\",\n       \"\\t    lodash.clone = clone;\\n\",\n       \"\\t    lodash.cloneDeep = cloneDeep;\\n\",\n       \"\\t    lodash.cloneDeepWith = cloneDeepWith;\\n\",\n       \"\\t    lodash.cloneWith = cloneWith;\\n\",\n       \"\\t    lodash.conformsTo = conformsTo;\\n\",\n       \"\\t    lodash.deburr = deburr;\\n\",\n       \"\\t    lodash.defaultTo = defaultTo;\\n\",\n       \"\\t    lodash.divide = divide;\\n\",\n       \"\\t    lodash.endsWith = endsWith;\\n\",\n       \"\\t    lodash.eq = eq;\\n\",\n       \"\\t    lodash.escape = escape;\\n\",\n       \"\\t    lodash.escapeRegExp = escapeRegExp;\\n\",\n       \"\\t    lodash.every = every;\\n\",\n       \"\\t    lodash.find = find;\\n\",\n       \"\\t    lodash.findIndex = findIndex;\\n\",\n       \"\\t    lodash.findKey = findKey;\\n\",\n       \"\\t    lodash.findLast = findLast;\\n\",\n       \"\\t    lodash.findLastIndex = findLastIndex;\\n\",\n       \"\\t    lodash.findLastKey = findLastKey;\\n\",\n       \"\\t    lodash.floor = floor;\\n\",\n       \"\\t    lodash.forEach = forEach;\\n\",\n       \"\\t    lodash.forEachRight = forEachRight;\\n\",\n       \"\\t    lodash.forIn = forIn;\\n\",\n       \"\\t    lodash.forInRight = forInRight;\\n\",\n       \"\\t    lodash.forOwn = forOwn;\\n\",\n       \"\\t    lodash.forOwnRight = forOwnRight;\\n\",\n       \"\\t    lodash.get = get;\\n\",\n       \"\\t    lodash.gt = gt;\\n\",\n       \"\\t    lodash.gte = gte;\\n\",\n       \"\\t    lodash.has = has;\\n\",\n       \"\\t    lodash.hasIn = hasIn;\\n\",\n       \"\\t    lodash.head = head;\\n\",\n       \"\\t    lodash.identity = identity;\\n\",\n       \"\\t    lodash.includes = includes;\\n\",\n       \"\\t    lodash.indexOf = indexOf;\\n\",\n       \"\\t    lodash.inRange = inRange;\\n\",\n       \"\\t    lodash.invoke = invoke;\\n\",\n       \"\\t    lodash.isArguments = isArguments;\\n\",\n       \"\\t    lodash.isArray = isArray;\\n\",\n       \"\\t    lodash.isArrayBuffer = isArrayBuffer;\\n\",\n       \"\\t    lodash.isArrayLike = isArrayLike;\\n\",\n       \"\\t    lodash.isArrayLikeObject = isArrayLikeObject;\\n\",\n       \"\\t    lodash.isBoolean = isBoolean;\\n\",\n       \"\\t    lodash.isBuffer = isBuffer;\\n\",\n       \"\\t    lodash.isDate = isDate;\\n\",\n       \"\\t    lodash.isElement = isElement;\\n\",\n       \"\\t    lodash.isEmpty = isEmpty;\\n\",\n       \"\\t    lodash.isEqual = isEqual;\\n\",\n       \"\\t    lodash.isEqualWith = isEqualWith;\\n\",\n       \"\\t    lodash.isError = isError;\\n\",\n       \"\\t    lodash.isFinite = isFinite;\\n\",\n       \"\\t    lodash.isFunction = isFunction;\\n\",\n       \"\\t    lodash.isInteger = isInteger;\\n\",\n       \"\\t    lodash.isLength = isLength;\\n\",\n       \"\\t    lodash.isMap = isMap;\\n\",\n       \"\\t    lodash.isMatch = isMatch;\\n\",\n       \"\\t    lodash.isMatchWith = isMatchWith;\\n\",\n       \"\\t    lodash.isNaN = isNaN;\\n\",\n       \"\\t    lodash.isNative = isNative;\\n\",\n       \"\\t    lodash.isNil = isNil;\\n\",\n       \"\\t    lodash.isNull = isNull;\\n\",\n       \"\\t    lodash.isNumber = isNumber;\\n\",\n       \"\\t    lodash.isObject = isObject;\\n\",\n       \"\\t    lodash.isObjectLike = isObjectLike;\\n\",\n       \"\\t    lodash.isPlainObject = isPlainObject;\\n\",\n       \"\\t    lodash.isRegExp = isRegExp;\\n\",\n       \"\\t    lodash.isSafeInteger = isSafeInteger;\\n\",\n       \"\\t    lodash.isSet = isSet;\\n\",\n       \"\\t    lodash.isString = isString;\\n\",\n       \"\\t    lodash.isSymbol = isSymbol;\\n\",\n       \"\\t    lodash.isTypedArray = isTypedArray;\\n\",\n       \"\\t    lodash.isUndefined = isUndefined;\\n\",\n       \"\\t    lodash.isWeakMap = isWeakMap;\\n\",\n       \"\\t    lodash.isWeakSet = isWeakSet;\\n\",\n       \"\\t    lodash.join = join;\\n\",\n       \"\\t    lodash.kebabCase = kebabCase;\\n\",\n       \"\\t    lodash.last = last;\\n\",\n       \"\\t    lodash.lastIndexOf = lastIndexOf;\\n\",\n       \"\\t    lodash.lowerCase = lowerCase;\\n\",\n       \"\\t    lodash.lowerFirst = lowerFirst;\\n\",\n       \"\\t    lodash.lt = lt;\\n\",\n       \"\\t    lodash.lte = lte;\\n\",\n       \"\\t    lodash.max = max;\\n\",\n       \"\\t    lodash.maxBy = maxBy;\\n\",\n       \"\\t    lodash.mean = mean;\\n\",\n       \"\\t    lodash.meanBy = meanBy;\\n\",\n       \"\\t    lodash.min = min;\\n\",\n       \"\\t    lodash.minBy = minBy;\\n\",\n       \"\\t    lodash.stubArray = stubArray;\\n\",\n       \"\\t    lodash.stubFalse = stubFalse;\\n\",\n       \"\\t    lodash.stubObject = stubObject;\\n\",\n       \"\\t    lodash.stubString = stubString;\\n\",\n       \"\\t    lodash.stubTrue = stubTrue;\\n\",\n       \"\\t    lodash.multiply = multiply;\\n\",\n       \"\\t    lodash.nth = nth;\\n\",\n       \"\\t    lodash.noConflict = noConflict;\\n\",\n       \"\\t    lodash.noop = noop;\\n\",\n       \"\\t    lodash.now = now;\\n\",\n       \"\\t    lodash.pad = pad;\\n\",\n       \"\\t    lodash.padEnd = padEnd;\\n\",\n       \"\\t    lodash.padStart = padStart;\\n\",\n       \"\\t    lodash.parseInt = parseInt;\\n\",\n       \"\\t    lodash.random = random;\\n\",\n       \"\\t    lodash.reduce = reduce;\\n\",\n       \"\\t    lodash.reduceRight = reduceRight;\\n\",\n       \"\\t    lodash.repeat = repeat;\\n\",\n       \"\\t    lodash.replace = replace;\\n\",\n       \"\\t    lodash.result = result;\\n\",\n       \"\\t    lodash.round = round;\\n\",\n       \"\\t    lodash.runInContext = runInContext;\\n\",\n       \"\\t    lodash.sample = sample;\\n\",\n       \"\\t    lodash.size = size;\\n\",\n       \"\\t    lodash.snakeCase = snakeCase;\\n\",\n       \"\\t    lodash.some = some;\\n\",\n       \"\\t    lodash.sortedIndex = sortedIndex;\\n\",\n       \"\\t    lodash.sortedIndexBy = sortedIndexBy;\\n\",\n       \"\\t    lodash.sortedIndexOf = sortedIndexOf;\\n\",\n       \"\\t    lodash.sortedLastIndex = sortedLastIndex;\\n\",\n       \"\\t    lodash.sortedLastIndexBy = sortedLastIndexBy;\\n\",\n       \"\\t    lodash.sortedLastIndexOf = sortedLastIndexOf;\\n\",\n       \"\\t    lodash.startCase = startCase;\\n\",\n       \"\\t    lodash.startsWith = startsWith;\\n\",\n       \"\\t    lodash.subtract = subtract;\\n\",\n       \"\\t    lodash.sum = sum;\\n\",\n       \"\\t    lodash.sumBy = sumBy;\\n\",\n       \"\\t    lodash.template = template;\\n\",\n       \"\\t    lodash.times = times;\\n\",\n       \"\\t    lodash.toFinite = toFinite;\\n\",\n       \"\\t    lodash.toInteger = toInteger;\\n\",\n       \"\\t    lodash.toLength = toLength;\\n\",\n       \"\\t    lodash.toLower = toLower;\\n\",\n       \"\\t    lodash.toNumber = toNumber;\\n\",\n       \"\\t    lodash.toSafeInteger = toSafeInteger;\\n\",\n       \"\\t    lodash.toString = toString;\\n\",\n       \"\\t    lodash.toUpper = toUpper;\\n\",\n       \"\\t    lodash.trim = trim;\\n\",\n       \"\\t    lodash.trimEnd = trimEnd;\\n\",\n       \"\\t    lodash.trimStart = trimStart;\\n\",\n       \"\\t    lodash.truncate = truncate;\\n\",\n       \"\\t    lodash.unescape = unescape;\\n\",\n       \"\\t    lodash.uniqueId = uniqueId;\\n\",\n       \"\\t    lodash.upperCase = upperCase;\\n\",\n       \"\\t    lodash.upperFirst = upperFirst;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add aliases.\\n\",\n       \"\\t    lodash.each = forEach;\\n\",\n       \"\\t    lodash.eachRight = forEachRight;\\n\",\n       \"\\t    lodash.first = head;\\n\",\n       \"\\t\\n\",\n       \"\\t    mixin(lodash, (function() {\\n\",\n       \"\\t      var source = {};\\n\",\n       \"\\t      baseForOwn(lodash, function(func, methodName) {\\n\",\n       \"\\t        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\\n\",\n       \"\\t          source[methodName] = func;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return source;\\n\",\n       \"\\t    }()), { 'chain': false });\\n\",\n       \"\\t\\n\",\n       \"\\t    /*------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t    /**\\n\",\n       \"\\t     * The semantic version number.\\n\",\n       \"\\t     *\\n\",\n       \"\\t     * @static\\n\",\n       \"\\t     * @memberOf _\\n\",\n       \"\\t     * @type {string}\\n\",\n       \"\\t     */\\n\",\n       \"\\t    lodash.VERSION = VERSION;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Assign default placeholders.\\n\",\n       \"\\t    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\\n\",\n       \"\\t      lodash[methodName].placeholder = lodash;\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\\n\",\n       \"\\t    arrayEach(['drop', 'take'], function(methodName, index) {\\n\",\n       \"\\t      LazyWrapper.prototype[methodName] = function(n) {\\n\",\n       \"\\t        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\\n\",\n       \"\\t\\n\",\n       \"\\t        var result = (this.__filtered__ && !index)\\n\",\n       \"\\t          ? new LazyWrapper(this)\\n\",\n       \"\\t          : this.clone();\\n\",\n       \"\\t\\n\",\n       \"\\t        if (result.__filtered__) {\\n\",\n       \"\\t          result.__takeCount__ = nativeMin(n, result.__takeCount__);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          result.__views__.push({\\n\",\n       \"\\t            'size': nativeMin(n, MAX_ARRAY_LENGTH),\\n\",\n       \"\\t            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t\\n\",\n       \"\\t      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\\n\",\n       \"\\t        return this.reverse()[methodName](n).reverse();\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add `LazyWrapper` methods that accept an `iteratee` value.\\n\",\n       \"\\t    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\\n\",\n       \"\\t      var type = index + 1,\\n\",\n       \"\\t          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\\n\",\n       \"\\t\\n\",\n       \"\\t      LazyWrapper.prototype[methodName] = function(iteratee) {\\n\",\n       \"\\t        var result = this.clone();\\n\",\n       \"\\t        result.__iteratees__.push({\\n\",\n       \"\\t          'iteratee': getIteratee(iteratee, 3),\\n\",\n       \"\\t          'type': type\\n\",\n       \"\\t        });\\n\",\n       \"\\t        result.__filtered__ = result.__filtered__ || isFilter;\\n\",\n       \"\\t        return result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add `LazyWrapper` methods for `_.head` and `_.last`.\\n\",\n       \"\\t    arrayEach(['head', 'last'], function(methodName, index) {\\n\",\n       \"\\t      var takeName = 'take' + (index ? 'Right' : '');\\n\",\n       \"\\t\\n\",\n       \"\\t      LazyWrapper.prototype[methodName] = function() {\\n\",\n       \"\\t        return this[takeName](1).value()[0];\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\\n\",\n       \"\\t    arrayEach(['initial', 'tail'], function(methodName, index) {\\n\",\n       \"\\t      var dropName = 'drop' + (index ? '' : 'Right');\\n\",\n       \"\\t\\n\",\n       \"\\t      LazyWrapper.prototype[methodName] = function() {\\n\",\n       \"\\t        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.compact = function() {\\n\",\n       \"\\t      return this.filter(identity);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.find = function(predicate) {\\n\",\n       \"\\t      return this.filter(predicate).head();\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.findLast = function(predicate) {\\n\",\n       \"\\t      return this.reverse().find(predicate);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\\n\",\n       \"\\t      if (typeof path == 'function') {\\n\",\n       \"\\t        return new LazyWrapper(this);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return this.map(function(value) {\\n\",\n       \"\\t        return baseInvoke(value, path, args);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.reject = function(predicate) {\\n\",\n       \"\\t      return this.filter(negate(getIteratee(predicate)));\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.slice = function(start, end) {\\n\",\n       \"\\t      start = toInteger(start);\\n\",\n       \"\\t\\n\",\n       \"\\t      var result = this;\\n\",\n       \"\\t      if (result.__filtered__ && (start > 0 || end < 0)) {\\n\",\n       \"\\t        return new LazyWrapper(result);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (start < 0) {\\n\",\n       \"\\t        result = result.takeRight(-start);\\n\",\n       \"\\t      } else if (start) {\\n\",\n       \"\\t        result = result.drop(start);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (end !== undefined) {\\n\",\n       \"\\t        end = toInteger(end);\\n\",\n       \"\\t        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return result;\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.takeRightWhile = function(predicate) {\\n\",\n       \"\\t      return this.reverse().takeWhile(predicate).reverse();\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    LazyWrapper.prototype.toArray = function() {\\n\",\n       \"\\t      return this.take(MAX_ARRAY_LENGTH);\\n\",\n       \"\\t    };\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add `LazyWrapper` methods to `lodash.prototype`.\\n\",\n       \"\\t    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\\n\",\n       \"\\t      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\\n\",\n       \"\\t          isTaker = /^(?:head|last)$/.test(methodName),\\n\",\n       \"\\t          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\\n\",\n       \"\\t          retUnwrapped = isTaker || /^find/.test(methodName);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!lodashFunc) {\\n\",\n       \"\\t        return;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      lodash.prototype[methodName] = function() {\\n\",\n       \"\\t        var value = this.__wrapped__,\\n\",\n       \"\\t            args = isTaker ? [1] : arguments,\\n\",\n       \"\\t            isLazy = value instanceof LazyWrapper,\\n\",\n       \"\\t            iteratee = args[0],\\n\",\n       \"\\t            useLazy = isLazy || isArray(value);\\n\",\n       \"\\t\\n\",\n       \"\\t        var interceptor = function(value) {\\n\",\n       \"\\t          var result = lodashFunc.apply(lodash, arrayPush([value], args));\\n\",\n       \"\\t          return (isTaker && chainAll) ? result[0] : result;\\n\",\n       \"\\t        };\\n\",\n       \"\\t\\n\",\n       \"\\t        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\\n\",\n       \"\\t          // Avoid lazy use if the iteratee has a \\\"length\\\" value other than `1`.\\n\",\n       \"\\t          isLazy = useLazy = false;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var chainAll = this.__chain__,\\n\",\n       \"\\t            isHybrid = !!this.__actions__.length,\\n\",\n       \"\\t            isUnwrapped = retUnwrapped && !chainAll,\\n\",\n       \"\\t            onlyLazy = isLazy && !isHybrid;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (!retUnwrapped && useLazy) {\\n\",\n       \"\\t          value = onlyLazy ? value : new LazyWrapper(this);\\n\",\n       \"\\t          var result = func.apply(value, args);\\n\",\n       \"\\t          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\\n\",\n       \"\\t          return new LodashWrapper(result, chainAll);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (isUnwrapped && onlyLazy) {\\n\",\n       \"\\t          return func.apply(this, args);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        result = this.thru(interceptor);\\n\",\n       \"\\t        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add `Array` methods to `lodash.prototype`.\\n\",\n       \"\\t    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\\n\",\n       \"\\t      var func = arrayProto[methodName],\\n\",\n       \"\\t          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\\n\",\n       \"\\t          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\\n\",\n       \"\\t\\n\",\n       \"\\t      lodash.prototype[methodName] = function() {\\n\",\n       \"\\t        var args = arguments;\\n\",\n       \"\\t        if (retUnwrapped && !this.__chain__) {\\n\",\n       \"\\t          var value = this.value();\\n\",\n       \"\\t          return func.apply(isArray(value) ? value : [], args);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return this[chainName](function(value) {\\n\",\n       \"\\t          return func.apply(isArray(value) ? value : [], args);\\n\",\n       \"\\t        });\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    // Map minified method names to their real names.\\n\",\n       \"\\t    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\\n\",\n       \"\\t      var lodashFunc = lodash[methodName];\\n\",\n       \"\\t      if (lodashFunc) {\\n\",\n       \"\\t        var key = (lodashFunc.name + ''),\\n\",\n       \"\\t            names = realNames[key] || (realNames[key] = []);\\n\",\n       \"\\t\\n\",\n       \"\\t        names.push({ 'name': methodName, 'func': lodashFunc });\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\\n\",\n       \"\\t      'name': 'wrapper',\\n\",\n       \"\\t      'func': undefined\\n\",\n       \"\\t    }];\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add methods to `LazyWrapper`.\\n\",\n       \"\\t    LazyWrapper.prototype.clone = lazyClone;\\n\",\n       \"\\t    LazyWrapper.prototype.reverse = lazyReverse;\\n\",\n       \"\\t    LazyWrapper.prototype.value = lazyValue;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add chain sequence methods to the `lodash` wrapper.\\n\",\n       \"\\t    lodash.prototype.at = wrapperAt;\\n\",\n       \"\\t    lodash.prototype.chain = wrapperChain;\\n\",\n       \"\\t    lodash.prototype.commit = wrapperCommit;\\n\",\n       \"\\t    lodash.prototype.next = wrapperNext;\\n\",\n       \"\\t    lodash.prototype.plant = wrapperPlant;\\n\",\n       \"\\t    lodash.prototype.reverse = wrapperReverse;\\n\",\n       \"\\t    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Add lazy aliases.\\n\",\n       \"\\t    lodash.prototype.first = lodash.prototype.head;\\n\",\n       \"\\t\\n\",\n       \"\\t    if (symIterator) {\\n\",\n       \"\\t      lodash.prototype[symIterator] = wrapperToIterator;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return lodash;\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  /*--------------------------------------------------------------------------*/\\n\",\n       \"\\t\\n\",\n       \"\\t  // Export lodash.\\n\",\n       \"\\t  var _ = runInContext();\\n\",\n       \"\\t\\n\",\n       \"\\t  // Some AMD build optimizers, like r.js, check for condition patterns like:\\n\",\n       \"\\t  if (true) {\\n\",\n       \"\\t    // Expose Lodash on the global object to prevent errors when Lodash is\\n\",\n       \"\\t    // loaded by a script tag in the presence of an AMD loader.\\n\",\n       \"\\t    // See http://requirejs.org/docs/errors.html#mismatch for more details.\\n\",\n       \"\\t    // Use `_.noConflict` to remove Lodash from the global object.\\n\",\n       \"\\t    root._ = _;\\n\",\n       \"\\t\\n\",\n       \"\\t    // Define as an anonymous module so, through path mapping, it can be\\n\",\n       \"\\t    // referenced as the \\\"underscore\\\" module.\\n\",\n       \"\\t    !(__WEBPACK_AMD_DEFINE_RESULT__ = function() {\\n\",\n       \"\\t      return _;\\n\",\n       \"\\t    }.call(exports, __webpack_require__, exports, module), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\\n\",\n       \"\\t  }\\n\",\n       \"\\t  // Check for `exports` after `define` in case a build optimizer adds it.\\n\",\n       \"\\t  else if (freeModule) {\\n\",\n       \"\\t    // Export for Node.js.\\n\",\n       \"\\t    (freeModule.exports = _)._ = _;\\n\",\n       \"\\t    // Export for CommonJS support.\\n\",\n       \"\\t    freeExports._ = _;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  else {\\n\",\n       \"\\t    // Export to the global object.\\n\",\n       \"\\t    root._ = _;\\n\",\n       \"\\t  }\\n\",\n       \"\\t}.call(this));\\n\",\n       \"\\t\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }()), __webpack_require__(5)(module)))\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 5 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function(module) {\\n\",\n       \"\\t\\tif(!module.webpackPolyfill) {\\n\",\n       \"\\t\\t\\tmodule.deprecate = function() {};\\n\",\n       \"\\t\\t\\tmodule.paths = [];\\n\",\n       \"\\t\\t\\t// module.parent = undefined by default\\n\",\n       \"\\t\\t\\tmodule.children = [];\\n\",\n       \"\\t\\t\\tmodule.webpackPolyfill = 1;\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\treturn module;\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 6 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tObject.defineProperty(exports, \\\"__esModule\\\", {\\n\",\n       \"\\t  value: true\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar _slicedToArray = function () { function sliceIterator(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\\\"return\\\"]) _i[\\\"return\\\"](); } finally { if (_d) throw _e; } } return _arr; } return function (arr, i) { if (Array.isArray(arr)) { return arr; } else if (Symbol.iterator in Object(arr)) { return sliceIterator(arr, i); } else { throw new TypeError(\\\"Invalid attempt to destructure non-iterable instance\\\"); } }; }();\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d2 = __webpack_require__(2);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d3 = _interopRequireDefault(_d2);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _lodash = __webpack_require__(4);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\\\"Cannot call a class as a function\\\"); } }\\n\",\n       \"\\t\\n\",\n       \"\\tvar PredictProba = function () {\\n\",\n       \"\\t  // svg: d3 object with the svg in question\\n\",\n       \"\\t  // class_names: array of class names\\n\",\n       \"\\t  // predict_probas: array of prediction probabilities\\n\",\n       \"\\t  function PredictProba(svg, class_names, predict_probas) {\\n\",\n       \"\\t    var title = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'Prediction probabilities';\\n\",\n       \"\\t\\n\",\n       \"\\t    _classCallCheck(this, PredictProba);\\n\",\n       \"\\t\\n\",\n       \"\\t    var width = parseInt(svg.style('width'));\\n\",\n       \"\\t    this.names = class_names;\\n\",\n       \"\\t    this.names.push('Other');\\n\",\n       \"\\t    if (class_names.length < 10) {\\n\",\n       \"\\t      this.colors = _d3.default.scale.category10().domain(this.names);\\n\",\n       \"\\t      this.colors_i = _d3.default.scale.category10().domain((0, _lodash.range)(this.names.length));\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      this.colors = _d3.default.scale.category20().domain(this.names);\\n\",\n       \"\\t      this.colors_i = _d3.default.scale.category20().domain((0, _lodash.range)(this.names.length));\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    var _map_classes = this.map_classes(this.names, predict_probas),\\n\",\n       \"\\t        _map_classes2 = _slicedToArray(_map_classes, 2),\\n\",\n       \"\\t        names = _map_classes2[0],\\n\",\n       \"\\t        data = _map_classes2[1];\\n\",\n       \"\\t\\n\",\n       \"\\t    var bar_x = width - 125;\\n\",\n       \"\\t    var class_names_width = bar_x;\\n\",\n       \"\\t    var bar_width = width - bar_x - 32;\\n\",\n       \"\\t    var x_scale = _d3.default.scale.linear().range([0, bar_width]);\\n\",\n       \"\\t    var bar_height = 17;\\n\",\n       \"\\t    var space_between_bars = 5;\\n\",\n       \"\\t    var bar_yshift = title === '' ? 0 : 35;\\n\",\n       \"\\t    var n_bars = Math.min(5, data.length);\\n\",\n       \"\\t    this.svg_height = n_bars * (bar_height + space_between_bars) + bar_yshift;\\n\",\n       \"\\t    svg.style('height', this.svg_height + 'px');\\n\",\n       \"\\t    var this_object = this;\\n\",\n       \"\\t    if (title !== '') {\\n\",\n       \"\\t      svg.append('text').text(title).attr('x', 20).attr('y', 20);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var bar_y = function bar_y(i) {\\n\",\n       \"\\t      return (bar_height + space_between_bars) * i + bar_yshift;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    var bar = svg.append(\\\"g\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    var _iteratorNormalCompletion = true;\\n\",\n       \"\\t    var _didIteratorError = false;\\n\",\n       \"\\t    var _iteratorError = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      for (var _iterator = (0, _lodash.range)(data.length)[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n\",\n       \"\\t        var i = _step.value;\\n\",\n       \"\\t\\n\",\n       \"\\t        var color = this.colors(names[i]);\\n\",\n       \"\\t        if (names[i] == 'Other' && this.names.length > 20) {\\n\",\n       \"\\t          color = '#5F9EA0';\\n\",\n       \"\\t        }\\n\",\n       \"\\t        var rect = bar.append(\\\"rect\\\");\\n\",\n       \"\\t        rect.attr(\\\"x\\\", bar_x).attr(\\\"y\\\", bar_y(i)).attr(\\\"height\\\", bar_height).attr(\\\"width\\\", x_scale(data[i])).style(\\\"fill\\\", color);\\n\",\n       \"\\t        bar.append(\\\"rect\\\").attr(\\\"x\\\", bar_x).attr(\\\"y\\\", bar_y(i)).attr(\\\"height\\\", bar_height).attr(\\\"width\\\", bar_width - 1).attr(\\\"fill-opacity\\\", 0).attr(\\\"stroke\\\", \\\"black\\\");\\n\",\n       \"\\t        var text = bar.append(\\\"text\\\");\\n\",\n       \"\\t        text.classed(\\\"prob_text\\\", true);\\n\",\n       \"\\t        text.attr(\\\"y\\\", bar_y(i) + bar_height - 3).attr(\\\"fill\\\", \\\"black\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\");\\n\",\n       \"\\t        text = bar.append(\\\"text\\\");\\n\",\n       \"\\t        text.attr(\\\"x\\\", bar_x + x_scale(data[i]) + 5).attr(\\\"y\\\", bar_y(i) + bar_height - 3).attr(\\\"fill\\\", \\\"black\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\").text(data[i].toFixed(2));\\n\",\n       \"\\t        text = bar.append(\\\"text\\\");\\n\",\n       \"\\t        text.attr(\\\"x\\\", bar_x - 10).attr(\\\"y\\\", bar_y(i) + bar_height - 3).attr(\\\"fill\\\", \\\"black\\\").attr(\\\"text-anchor\\\", \\\"end\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\").text(names[i]);\\n\",\n       \"\\t        while (text.node().getBBox()['width'] + 1 > class_names_width - 10) {\\n\",\n       \"\\t          // TODO: ta mostrando só dois, e talvez quando hover mostrar o texto\\n\",\n       \"\\t          // todo\\n\",\n       \"\\t          var cur_text = text.text().slice(0, text.text().length - 5);\\n\",\n       \"\\t          text.text(cur_text + '...');\\n\",\n       \"\\t          if (cur_text === '') {\\n\",\n       \"\\t            break;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError = true;\\n\",\n       \"\\t      _iteratorError = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion && _iterator.return) {\\n\",\n       \"\\t          _iterator.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError) {\\n\",\n       \"\\t          throw _iteratorError;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  PredictProba.prototype.map_classes = function map_classes(class_names, predict_proba) {\\n\",\n       \"\\t    if (class_names.length <= 6) {\\n\",\n       \"\\t      return [class_names, predict_proba];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var class_dict = (0, _lodash.range)(predict_proba.length).map(function (i) {\\n\",\n       \"\\t      return { 'name': class_names[i], 'prob': predict_proba[i], 'i': i };\\n\",\n       \"\\t    });\\n\",\n       \"\\t    var sorted = (0, _lodash.sortBy)(class_dict, function (d) {\\n\",\n       \"\\t      return -d.prob;\\n\",\n       \"\\t    });\\n\",\n       \"\\t    var other = new Set();\\n\",\n       \"\\t    (0, _lodash.range)(4, sorted.length).map(function (d) {\\n\",\n       \"\\t      return other.add(sorted[d].name);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    var other_prob = 0;\\n\",\n       \"\\t    var ret_probs = [];\\n\",\n       \"\\t    var ret_names = [];\\n\",\n       \"\\t    var _iteratorNormalCompletion2 = true;\\n\",\n       \"\\t    var _didIteratorError2 = false;\\n\",\n       \"\\t    var _iteratorError2 = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      for (var _iterator2 = (0, _lodash.range)(sorted.length)[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n\",\n       \"\\t        var d = _step2.value;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (other.has(sorted[d].name)) {\\n\",\n       \"\\t          other_prob += sorted[d].prob;\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          ret_probs.push(sorted[d].prob);\\n\",\n       \"\\t          ret_names.push(sorted[d].name);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      _didIteratorError2 = true;\\n\",\n       \"\\t      _iteratorError2 = err;\\n\",\n       \"\\t    } finally {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (!_iteratorNormalCompletion2 && _iterator2.return) {\\n\",\n       \"\\t          _iterator2.return();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        if (_didIteratorError2) {\\n\",\n       \"\\t          throw _iteratorError2;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    ;\\n\",\n       \"\\t    ret_names.push(\\\"Other\\\");\\n\",\n       \"\\t    ret_probs.push(other_prob);\\n\",\n       \"\\t    return [ret_names, ret_probs];\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  return PredictProba;\\n\",\n       \"\\t}();\\n\",\n       \"\\t\\n\",\n       \"\\texports.default = PredictProba;\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 7 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tObject.defineProperty(exports, \\\"__esModule\\\", {\\n\",\n       \"\\t    value: true\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d = __webpack_require__(2);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _d2 = _interopRequireDefault(_d);\\n\",\n       \"\\t\\n\",\n       \"\\tvar _lodash = __webpack_require__(4);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\\n\",\n       \"\\t\\n\",\n       \"\\tfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\\\"Cannot call a class as a function\\\"); } }\\n\",\n       \"\\t\\n\",\n       \"\\tvar PredictedValue =\\n\",\n       \"\\t// svg: d3 object with the svg in question\\n\",\n       \"\\t// class_names: array of class names\\n\",\n       \"\\t// predict_probas: array of prediction probabilities\\n\",\n       \"\\tfunction PredictedValue(svg, predicted_value, min_value, max_value) {\\n\",\n       \"\\t    var title = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 'Predicted value';\\n\",\n       \"\\t    var log_coords = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : false;\\n\",\n       \"\\t\\n\",\n       \"\\t    _classCallCheck(this, PredictedValue);\\n\",\n       \"\\t\\n\",\n       \"\\t    if (min_value == max_value) {\\n\",\n       \"\\t        var width_proportion = 1.0;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t        var width_proportion = (predicted_value - min_value) / (max_value - min_value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    var width = parseInt(svg.style('width'));\\n\",\n       \"\\t\\n\",\n       \"\\t    this.color = _d2.default.scale.category10();\\n\",\n       \"\\t    this.color('predicted_value');\\n\",\n       \"\\t    // + 2 is due to it being a float\\n\",\n       \"\\t    console.log('CREATING THIS');\\n\",\n       \"\\t    var num_digits = Math.floor(Math.max(Math.log10(Math.abs(min_value)), Math.log10(Math.abs(max_value)))) + 2;\\n\",\n       \"\\t    num_digits = Math.max(num_digits, 3);\\n\",\n       \"\\t\\n\",\n       \"\\t    var corner_width = 12 * num_digits;\\n\",\n       \"\\t    var corner_padding = 5.5 * num_digits;\\n\",\n       \"\\t    var bar_x = corner_width + corner_padding;\\n\",\n       \"\\t    var bar_width = width - corner_width * 2 - corner_padding * 2;\\n\",\n       \"\\t    var x_scale = _d2.default.scale.linear().range([0, bar_width]);\\n\",\n       \"\\t    var bar_height = 17;\\n\",\n       \"\\t    var bar_yshift = title === '' ? 0 : 35;\\n\",\n       \"\\t    var n_bars = 1;\\n\",\n       \"\\t    var this_object = this;\\n\",\n       \"\\t    if (title !== '') {\\n\",\n       \"\\t        svg.append('text').text(title).attr('x', 20).attr('y', 20);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var bar_y = bar_yshift;\\n\",\n       \"\\t    var bar = svg.append(\\\"g\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    //filled in bar representing predicted value in range\\n\",\n       \"\\t    var rect = bar.append(\\\"rect\\\");\\n\",\n       \"\\t    rect.attr(\\\"x\\\", bar_x).attr(\\\"y\\\", bar_y).attr(\\\"height\\\", bar_height).attr(\\\"width\\\", x_scale(width_proportion)).style(\\\"fill\\\", this.color);\\n\",\n       \"\\t\\n\",\n       \"\\t    //empty box representing range\\n\",\n       \"\\t    bar.append(\\\"rect\\\").attr(\\\"x\\\", bar_x).attr(\\\"y\\\", bar_y).attr(\\\"height\\\", bar_height).attr(\\\"width\\\", x_scale(1)).attr(\\\"fill-opacity\\\", 0).attr(\\\"stroke\\\", \\\"black\\\");\\n\",\n       \"\\t    var text = bar.append(\\\"text\\\");\\n\",\n       \"\\t    text.classed(\\\"prob_text\\\", true);\\n\",\n       \"\\t    text.attr(\\\"y\\\", bar_y + bar_height - 3).attr(\\\"fill\\\", \\\"black\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    //text for min value\\n\",\n       \"\\t    text = bar.append(\\\"text\\\");\\n\",\n       \"\\t    text.attr(\\\"x\\\", bar_x - corner_padding).attr(\\\"y\\\", bar_y + bar_height - 3).attr(\\\"fill\\\", \\\"black\\\").attr(\\\"text-anchor\\\", \\\"end\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\").text(min_value.toFixed(2));\\n\",\n       \"\\t\\n\",\n       \"\\t    //text for range min annotation\\n\",\n       \"\\t    var v_adjust_min_value_annotation = text.node().getBBox().height;\\n\",\n       \"\\t    text = bar.append(\\\"text\\\");\\n\",\n       \"\\t    text.attr(\\\"x\\\", bar_x - corner_padding).attr(\\\"y\\\", bar_y + bar_height - 3 + v_adjust_min_value_annotation).attr(\\\"fill\\\", \\\"black\\\").attr(\\\"text-anchor\\\", \\\"end\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\").text(\\\"(min)\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    //text for predicted value\\n\",\n       \"\\t    // console.log('bar height: ' + bar_height)\\n\",\n       \"\\t    text = bar.append(\\\"text\\\");\\n\",\n       \"\\t    text.text(predicted_value.toFixed(2));\\n\",\n       \"\\t    // let h_adjust_predicted_value_text = text.node().getBBox().width / 2;\\n\",\n       \"\\t    var v_adjust_predicted_value_text = text.node().getBBox().height;\\n\",\n       \"\\t    text.attr(\\\"x\\\", bar_x + x_scale(width_proportion)).attr(\\\"y\\\", bar_y + bar_height + v_adjust_predicted_value_text).attr(\\\"fill\\\", \\\"black\\\").attr(\\\"text-anchor\\\", \\\"middle\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    //text for max value\\n\",\n       \"\\t    text = bar.append(\\\"text\\\");\\n\",\n       \"\\t    text.text(max_value.toFixed(2));\\n\",\n       \"\\t    // let h_adjust = text.node().getBBox().width;\\n\",\n       \"\\t    text.attr(\\\"x\\\", bar_x + bar_width + corner_padding).attr(\\\"y\\\", bar_y + bar_height - 3).attr(\\\"fill\\\", \\\"black\\\").attr(\\\"text-anchor\\\", \\\"begin\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    //text for range max annotation\\n\",\n       \"\\t    var v_adjust_max_value_annotation = text.node().getBBox().height;\\n\",\n       \"\\t    text = bar.append(\\\"text\\\");\\n\",\n       \"\\t    text.attr(\\\"x\\\", bar_x + bar_width + corner_padding).attr(\\\"y\\\", bar_y + bar_height - 3 + v_adjust_min_value_annotation).attr(\\\"fill\\\", \\\"black\\\").attr(\\\"text-anchor\\\", \\\"begin\\\").style(\\\"font\\\", \\\"14px tahoma, sans-serif\\\").text(\\\"(max)\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t    //readjust svg size\\n\",\n       \"\\t    // let svg_width = width + 1 * h_adjust;\\n\",\n       \"\\t    // svg.style('width', svg_width + 'px');\\n\",\n       \"\\t\\n\",\n       \"\\t    this.svg_height = n_bars * bar_height + bar_yshift + 2 * text.node().getBBox().height + 10;\\n\",\n       \"\\t    svg.style('height', this.svg_height + 'px');\\n\",\n       \"\\t    if (log_coords) {\\n\",\n       \"\\t        console.log(\\\"svg width: \\\" + svg_width);\\n\",\n       \"\\t        console.log(\\\"svg height: \\\" + this.svg_height);\\n\",\n       \"\\t        console.log(\\\"bar_y: \\\" + bar_y);\\n\",\n       \"\\t        console.log(\\\"bar_x: \\\" + bar_x);\\n\",\n       \"\\t        console.log(\\\"Min value: \\\" + min_value);\\n\",\n       \"\\t        console.log(\\\"Max value: \\\" + max_value);\\n\",\n       \"\\t        console.log(\\\"Pred value: \\\" + predicted_value);\\n\",\n       \"\\t    }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\texports.default = PredictedValue;\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 8 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */(function(global) {\\\"use strict\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(9);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(335);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(336);\\n\",\n       \"\\t\\n\",\n       \"\\tif (global._babelPolyfill) {\\n\",\n       \"\\t  throw new Error(\\\"only one instance of babel-polyfill is allowed\\\");\\n\",\n       \"\\t}\\n\",\n       \"\\tglobal._babelPolyfill = true;\\n\",\n       \"\\t\\n\",\n       \"\\tvar DEFINE_PROPERTY = \\\"defineProperty\\\";\\n\",\n       \"\\tfunction define(O, key, value) {\\n\",\n       \"\\t  O[key] || Object[DEFINE_PROPERTY](O, key, {\\n\",\n       \"\\t    writable: true,\\n\",\n       \"\\t    configurable: true,\\n\",\n       \"\\t    value: value\\n\",\n       \"\\t  });\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tdefine(String.prototype, \\\"padLeft\\\", \\\"\\\".padStart);\\n\",\n       \"\\tdefine(String.prototype, \\\"padRight\\\", \\\"\\\".padEnd);\\n\",\n       \"\\t\\n\",\n       \"\\t\\\"pop,reverse,shift,keys,values,entries,indexOf,every,some,forEach,map,filter,find,findIndex,includes,join,slice,concat,push,splice,unshift,sort,lastIndexOf,reduce,reduceRight,copyWithin,fill\\\".split(\\\",\\\").forEach(function (key) {\\n\",\n       \"\\t  [][key] && define(Array, key, Function.call.bind([][key]));\\n\",\n       \"\\t});\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }())))\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 9 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(10);\\n\",\n       \"\\t__webpack_require__(59);\\n\",\n       \"\\t__webpack_require__(60);\\n\",\n       \"\\t__webpack_require__(61);\\n\",\n       \"\\t__webpack_require__(62);\\n\",\n       \"\\t__webpack_require__(64);\\n\",\n       \"\\t__webpack_require__(67);\\n\",\n       \"\\t__webpack_require__(68);\\n\",\n       \"\\t__webpack_require__(69);\\n\",\n       \"\\t__webpack_require__(70);\\n\",\n       \"\\t__webpack_require__(71);\\n\",\n       \"\\t__webpack_require__(72);\\n\",\n       \"\\t__webpack_require__(73);\\n\",\n       \"\\t__webpack_require__(74);\\n\",\n       \"\\t__webpack_require__(75);\\n\",\n       \"\\t__webpack_require__(77);\\n\",\n       \"\\t__webpack_require__(79);\\n\",\n       \"\\t__webpack_require__(81);\\n\",\n       \"\\t__webpack_require__(83);\\n\",\n       \"\\t__webpack_require__(86);\\n\",\n       \"\\t__webpack_require__(87);\\n\",\n       \"\\t__webpack_require__(88);\\n\",\n       \"\\t__webpack_require__(92);\\n\",\n       \"\\t__webpack_require__(94);\\n\",\n       \"\\t__webpack_require__(96);\\n\",\n       \"\\t__webpack_require__(99);\\n\",\n       \"\\t__webpack_require__(100);\\n\",\n       \"\\t__webpack_require__(101);\\n\",\n       \"\\t__webpack_require__(102);\\n\",\n       \"\\t__webpack_require__(104);\\n\",\n       \"\\t__webpack_require__(105);\\n\",\n       \"\\t__webpack_require__(106);\\n\",\n       \"\\t__webpack_require__(107);\\n\",\n       \"\\t__webpack_require__(108);\\n\",\n       \"\\t__webpack_require__(109);\\n\",\n       \"\\t__webpack_require__(110);\\n\",\n       \"\\t__webpack_require__(112);\\n\",\n       \"\\t__webpack_require__(113);\\n\",\n       \"\\t__webpack_require__(114);\\n\",\n       \"\\t__webpack_require__(116);\\n\",\n       \"\\t__webpack_require__(117);\\n\",\n       \"\\t__webpack_require__(118);\\n\",\n       \"\\t__webpack_require__(120);\\n\",\n       \"\\t__webpack_require__(122);\\n\",\n       \"\\t__webpack_require__(123);\\n\",\n       \"\\t__webpack_require__(124);\\n\",\n       \"\\t__webpack_require__(125);\\n\",\n       \"\\t__webpack_require__(126);\\n\",\n       \"\\t__webpack_require__(127);\\n\",\n       \"\\t__webpack_require__(128);\\n\",\n       \"\\t__webpack_require__(129);\\n\",\n       \"\\t__webpack_require__(130);\\n\",\n       \"\\t__webpack_require__(131);\\n\",\n       \"\\t__webpack_require__(132);\\n\",\n       \"\\t__webpack_require__(133);\\n\",\n       \"\\t__webpack_require__(134);\\n\",\n       \"\\t__webpack_require__(139);\\n\",\n       \"\\t__webpack_require__(140);\\n\",\n       \"\\t__webpack_require__(144);\\n\",\n       \"\\t__webpack_require__(145);\\n\",\n       \"\\t__webpack_require__(146);\\n\",\n       \"\\t__webpack_require__(147);\\n\",\n       \"\\t__webpack_require__(149);\\n\",\n       \"\\t__webpack_require__(150);\\n\",\n       \"\\t__webpack_require__(151);\\n\",\n       \"\\t__webpack_require__(152);\\n\",\n       \"\\t__webpack_require__(153);\\n\",\n       \"\\t__webpack_require__(154);\\n\",\n       \"\\t__webpack_require__(155);\\n\",\n       \"\\t__webpack_require__(156);\\n\",\n       \"\\t__webpack_require__(157);\\n\",\n       \"\\t__webpack_require__(158);\\n\",\n       \"\\t__webpack_require__(159);\\n\",\n       \"\\t__webpack_require__(160);\\n\",\n       \"\\t__webpack_require__(161);\\n\",\n       \"\\t__webpack_require__(162);\\n\",\n       \"\\t__webpack_require__(163);\\n\",\n       \"\\t__webpack_require__(165);\\n\",\n       \"\\t__webpack_require__(166);\\n\",\n       \"\\t__webpack_require__(168);\\n\",\n       \"\\t__webpack_require__(169);\\n\",\n       \"\\t__webpack_require__(175);\\n\",\n       \"\\t__webpack_require__(176);\\n\",\n       \"\\t__webpack_require__(178);\\n\",\n       \"\\t__webpack_require__(179);\\n\",\n       \"\\t__webpack_require__(180);\\n\",\n       \"\\t__webpack_require__(184);\\n\",\n       \"\\t__webpack_require__(185);\\n\",\n       \"\\t__webpack_require__(186);\\n\",\n       \"\\t__webpack_require__(187);\\n\",\n       \"\\t__webpack_require__(188);\\n\",\n       \"\\t__webpack_require__(190);\\n\",\n       \"\\t__webpack_require__(191);\\n\",\n       \"\\t__webpack_require__(192);\\n\",\n       \"\\t__webpack_require__(193);\\n\",\n       \"\\t__webpack_require__(196);\\n\",\n       \"\\t__webpack_require__(198);\\n\",\n       \"\\t__webpack_require__(199);\\n\",\n       \"\\t__webpack_require__(200);\\n\",\n       \"\\t__webpack_require__(202);\\n\",\n       \"\\t__webpack_require__(204);\\n\",\n       \"\\t__webpack_require__(206);\\n\",\n       \"\\t__webpack_require__(208);\\n\",\n       \"\\t__webpack_require__(209);\\n\",\n       \"\\t__webpack_require__(210);\\n\",\n       \"\\t__webpack_require__(214);\\n\",\n       \"\\t__webpack_require__(215);\\n\",\n       \"\\t__webpack_require__(216);\\n\",\n       \"\\t__webpack_require__(218);\\n\",\n       \"\\t__webpack_require__(228);\\n\",\n       \"\\t__webpack_require__(232);\\n\",\n       \"\\t__webpack_require__(233);\\n\",\n       \"\\t__webpack_require__(235);\\n\",\n       \"\\t__webpack_require__(236);\\n\",\n       \"\\t__webpack_require__(240);\\n\",\n       \"\\t__webpack_require__(241);\\n\",\n       \"\\t__webpack_require__(243);\\n\",\n       \"\\t__webpack_require__(244);\\n\",\n       \"\\t__webpack_require__(245);\\n\",\n       \"\\t__webpack_require__(246);\\n\",\n       \"\\t__webpack_require__(247);\\n\",\n       \"\\t__webpack_require__(248);\\n\",\n       \"\\t__webpack_require__(249);\\n\",\n       \"\\t__webpack_require__(250);\\n\",\n       \"\\t__webpack_require__(251);\\n\",\n       \"\\t__webpack_require__(252);\\n\",\n       \"\\t__webpack_require__(253);\\n\",\n       \"\\t__webpack_require__(254);\\n\",\n       \"\\t__webpack_require__(255);\\n\",\n       \"\\t__webpack_require__(256);\\n\",\n       \"\\t__webpack_require__(257);\\n\",\n       \"\\t__webpack_require__(258);\\n\",\n       \"\\t__webpack_require__(259);\\n\",\n       \"\\t__webpack_require__(260);\\n\",\n       \"\\t__webpack_require__(261);\\n\",\n       \"\\t__webpack_require__(263);\\n\",\n       \"\\t__webpack_require__(264);\\n\",\n       \"\\t__webpack_require__(265);\\n\",\n       \"\\t__webpack_require__(266);\\n\",\n       \"\\t__webpack_require__(267);\\n\",\n       \"\\t__webpack_require__(269);\\n\",\n       \"\\t__webpack_require__(270);\\n\",\n       \"\\t__webpack_require__(271);\\n\",\n       \"\\t__webpack_require__(273);\\n\",\n       \"\\t__webpack_require__(274);\\n\",\n       \"\\t__webpack_require__(275);\\n\",\n       \"\\t__webpack_require__(276);\\n\",\n       \"\\t__webpack_require__(277);\\n\",\n       \"\\t__webpack_require__(278);\\n\",\n       \"\\t__webpack_require__(279);\\n\",\n       \"\\t__webpack_require__(280);\\n\",\n       \"\\t__webpack_require__(282);\\n\",\n       \"\\t__webpack_require__(283);\\n\",\n       \"\\t__webpack_require__(285);\\n\",\n       \"\\t__webpack_require__(286);\\n\",\n       \"\\t__webpack_require__(287);\\n\",\n       \"\\t__webpack_require__(288);\\n\",\n       \"\\t__webpack_require__(291);\\n\",\n       \"\\t__webpack_require__(292);\\n\",\n       \"\\t__webpack_require__(294);\\n\",\n       \"\\t__webpack_require__(295);\\n\",\n       \"\\t__webpack_require__(296);\\n\",\n       \"\\t__webpack_require__(297);\\n\",\n       \"\\t__webpack_require__(299);\\n\",\n       \"\\t__webpack_require__(300);\\n\",\n       \"\\t__webpack_require__(301);\\n\",\n       \"\\t__webpack_require__(302);\\n\",\n       \"\\t__webpack_require__(303);\\n\",\n       \"\\t__webpack_require__(304);\\n\",\n       \"\\t__webpack_require__(305);\\n\",\n       \"\\t__webpack_require__(306);\\n\",\n       \"\\t__webpack_require__(307);\\n\",\n       \"\\t__webpack_require__(308);\\n\",\n       \"\\t__webpack_require__(310);\\n\",\n       \"\\t__webpack_require__(311);\\n\",\n       \"\\t__webpack_require__(312);\\n\",\n       \"\\t__webpack_require__(313);\\n\",\n       \"\\t__webpack_require__(314);\\n\",\n       \"\\t__webpack_require__(315);\\n\",\n       \"\\t__webpack_require__(316);\\n\",\n       \"\\t__webpack_require__(317);\\n\",\n       \"\\t__webpack_require__(318);\\n\",\n       \"\\t__webpack_require__(319);\\n\",\n       \"\\t__webpack_require__(320);\\n\",\n       \"\\t__webpack_require__(322);\\n\",\n       \"\\t__webpack_require__(323);\\n\",\n       \"\\t__webpack_require__(324);\\n\",\n       \"\\t__webpack_require__(325);\\n\",\n       \"\\t__webpack_require__(326);\\n\",\n       \"\\t__webpack_require__(327);\\n\",\n       \"\\t__webpack_require__(328);\\n\",\n       \"\\t__webpack_require__(329);\\n\",\n       \"\\t__webpack_require__(330);\\n\",\n       \"\\t__webpack_require__(331);\\n\",\n       \"\\t__webpack_require__(332);\\n\",\n       \"\\t__webpack_require__(333);\\n\",\n       \"\\t__webpack_require__(334);\\n\",\n       \"\\tmodule.exports = __webpack_require__(16);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 10 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// ECMAScript 6 symbols shim\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar DESCRIPTORS = __webpack_require__(13);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar META = __webpack_require__(32).KEY;\\n\",\n       \"\\tvar $fails = __webpack_require__(14);\\n\",\n       \"\\tvar shared = __webpack_require__(28);\\n\",\n       \"\\tvar setToStringTag = __webpack_require__(33);\\n\",\n       \"\\tvar uid = __webpack_require__(26);\\n\",\n       \"\\tvar wks = __webpack_require__(34);\\n\",\n       \"\\tvar wksExt = __webpack_require__(35);\\n\",\n       \"\\tvar wksDefine = __webpack_require__(36);\\n\",\n       \"\\tvar enumKeys = __webpack_require__(37);\\n\",\n       \"\\tvar isArray = __webpack_require__(52);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar createDesc = __webpack_require__(24);\\n\",\n       \"\\tvar _create = __webpack_require__(53);\\n\",\n       \"\\tvar gOPNExt = __webpack_require__(56);\\n\",\n       \"\\tvar $GOPD = __webpack_require__(58);\\n\",\n       \"\\tvar $DP = __webpack_require__(18);\\n\",\n       \"\\tvar $keys = __webpack_require__(38);\\n\",\n       \"\\tvar gOPD = $GOPD.f;\\n\",\n       \"\\tvar dP = $DP.f;\\n\",\n       \"\\tvar gOPN = gOPNExt.f;\\n\",\n       \"\\tvar $Symbol = global.Symbol;\\n\",\n       \"\\tvar $JSON = global.JSON;\\n\",\n       \"\\tvar _stringify = $JSON && $JSON.stringify;\\n\",\n       \"\\tvar PROTOTYPE = 'prototype';\\n\",\n       \"\\tvar HIDDEN = wks('_hidden');\\n\",\n       \"\\tvar TO_PRIMITIVE = wks('toPrimitive');\\n\",\n       \"\\tvar isEnum = {}.propertyIsEnumerable;\\n\",\n       \"\\tvar SymbolRegistry = shared('symbol-registry');\\n\",\n       \"\\tvar AllSymbols = shared('symbols');\\n\",\n       \"\\tvar OPSymbols = shared('op-symbols');\\n\",\n       \"\\tvar ObjectProto = Object[PROTOTYPE];\\n\",\n       \"\\tvar USE_NATIVE = typeof $Symbol == 'function';\\n\",\n       \"\\tvar QObject = global.QObject;\\n\",\n       \"\\t// Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173\\n\",\n       \"\\tvar setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild;\\n\",\n       \"\\t\\n\",\n       \"\\t// fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687\\n\",\n       \"\\tvar setSymbolDesc = DESCRIPTORS && $fails(function () {\\n\",\n       \"\\t  return _create(dP({}, 'a', {\\n\",\n       \"\\t    get: function () { return dP(this, 'a', { value: 7 }).a; }\\n\",\n       \"\\t  })).a != 7;\\n\",\n       \"\\t}) ? function (it, key, D) {\\n\",\n       \"\\t  var protoDesc = gOPD(ObjectProto, key);\\n\",\n       \"\\t  if (protoDesc) delete ObjectProto[key];\\n\",\n       \"\\t  dP(it, key, D);\\n\",\n       \"\\t  if (protoDesc && it !== ObjectProto) dP(ObjectProto, key, protoDesc);\\n\",\n       \"\\t} : dP;\\n\",\n       \"\\t\\n\",\n       \"\\tvar wrap = function (tag) {\\n\",\n       \"\\t  var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]);\\n\",\n       \"\\t  sym._k = tag;\\n\",\n       \"\\t  return sym;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function (it) {\\n\",\n       \"\\t  return typeof it == 'symbol';\\n\",\n       \"\\t} : function (it) {\\n\",\n       \"\\t  return it instanceof $Symbol;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar $defineProperty = function defineProperty(it, key, D) {\\n\",\n       \"\\t  if (it === ObjectProto) $defineProperty(OPSymbols, key, D);\\n\",\n       \"\\t  anObject(it);\\n\",\n       \"\\t  key = toPrimitive(key, true);\\n\",\n       \"\\t  anObject(D);\\n\",\n       \"\\t  if (has(AllSymbols, key)) {\\n\",\n       \"\\t    if (!D.enumerable) {\\n\",\n       \"\\t      if (!has(it, HIDDEN)) dP(it, HIDDEN, createDesc(1, {}));\\n\",\n       \"\\t      it[HIDDEN][key] = true;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      if (has(it, HIDDEN) && it[HIDDEN][key]) it[HIDDEN][key] = false;\\n\",\n       \"\\t      D = _create(D, { enumerable: createDesc(0, false) });\\n\",\n       \"\\t    } return setSymbolDesc(it, key, D);\\n\",\n       \"\\t  } return dP(it, key, D);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $defineProperties = function defineProperties(it, P) {\\n\",\n       \"\\t  anObject(it);\\n\",\n       \"\\t  var keys = enumKeys(P = toIObject(P));\\n\",\n       \"\\t  var i = 0;\\n\",\n       \"\\t  var l = keys.length;\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  while (l > i) $defineProperty(it, key = keys[i++], P[key]);\\n\",\n       \"\\t  return it;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $create = function create(it, P) {\\n\",\n       \"\\t  return P === undefined ? _create(it) : $defineProperties(_create(it), P);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $propertyIsEnumerable = function propertyIsEnumerable(key) {\\n\",\n       \"\\t  var E = isEnum.call(this, key = toPrimitive(key, true));\\n\",\n       \"\\t  if (this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return false;\\n\",\n       \"\\t  return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key) {\\n\",\n       \"\\t  it = toIObject(it);\\n\",\n       \"\\t  key = toPrimitive(key, true);\\n\",\n       \"\\t  if (it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key)) return;\\n\",\n       \"\\t  var D = gOPD(it, key);\\n\",\n       \"\\t  if (D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key])) D.enumerable = true;\\n\",\n       \"\\t  return D;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $getOwnPropertyNames = function getOwnPropertyNames(it) {\\n\",\n       \"\\t  var names = gOPN(toIObject(it));\\n\",\n       \"\\t  var result = [];\\n\",\n       \"\\t  var i = 0;\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  while (names.length > i) {\\n\",\n       \"\\t    if (!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META) result.push(key);\\n\",\n       \"\\t  } return result;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $getOwnPropertySymbols = function getOwnPropertySymbols(it) {\\n\",\n       \"\\t  var IS_OP = it === ObjectProto;\\n\",\n       \"\\t  var names = gOPN(IS_OP ? OPSymbols : toIObject(it));\\n\",\n       \"\\t  var result = [];\\n\",\n       \"\\t  var i = 0;\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  while (names.length > i) {\\n\",\n       \"\\t    if (has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true)) result.push(AllSymbols[key]);\\n\",\n       \"\\t  } return result;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// 19.4.1.1 Symbol([description])\\n\",\n       \"\\tif (!USE_NATIVE) {\\n\",\n       \"\\t  $Symbol = function Symbol() {\\n\",\n       \"\\t    if (this instanceof $Symbol) throw TypeError('Symbol is not a constructor!');\\n\",\n       \"\\t    var tag = uid(arguments.length > 0 ? arguments[0] : undefined);\\n\",\n       \"\\t    var $set = function (value) {\\n\",\n       \"\\t      if (this === ObjectProto) $set.call(OPSymbols, value);\\n\",\n       \"\\t      if (has(this, HIDDEN) && has(this[HIDDEN], tag)) this[HIDDEN][tag] = false;\\n\",\n       \"\\t      setSymbolDesc(this, tag, createDesc(1, value));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    if (DESCRIPTORS && setter) setSymbolDesc(ObjectProto, tag, { configurable: true, set: $set });\\n\",\n       \"\\t    return wrap(tag);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  redefine($Symbol[PROTOTYPE], 'toString', function toString() {\\n\",\n       \"\\t    return this._k;\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  $GOPD.f = $getOwnPropertyDescriptor;\\n\",\n       \"\\t  $DP.f = $defineProperty;\\n\",\n       \"\\t  __webpack_require__(57).f = gOPNExt.f = $getOwnPropertyNames;\\n\",\n       \"\\t  __webpack_require__(51).f = $propertyIsEnumerable;\\n\",\n       \"\\t  __webpack_require__(50).f = $getOwnPropertySymbols;\\n\",\n       \"\\t\\n\",\n       \"\\t  if (DESCRIPTORS && !__webpack_require__(29)) {\\n\",\n       \"\\t    redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  wksExt.f = function (name) {\\n\",\n       \"\\t    return wrap(wks(name));\\n\",\n       \"\\t  };\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.G + $export.W + $export.F * !USE_NATIVE, { Symbol: $Symbol });\\n\",\n       \"\\t\\n\",\n       \"\\tfor (var es6Symbols = (\\n\",\n       \"\\t  // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14\\n\",\n       \"\\t  'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables'\\n\",\n       \"\\t).split(','), j = 0; es6Symbols.length > j;)wks(es6Symbols[j++]);\\n\",\n       \"\\t\\n\",\n       \"\\tfor (var wellKnownSymbols = $keys(wks.store), k = 0; wellKnownSymbols.length > k;) wksDefine(wellKnownSymbols[k++]);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * !USE_NATIVE, 'Symbol', {\\n\",\n       \"\\t  // 19.4.2.1 Symbol.for(key)\\n\",\n       \"\\t  'for': function (key) {\\n\",\n       \"\\t    return has(SymbolRegistry, key += '')\\n\",\n       \"\\t      ? SymbolRegistry[key]\\n\",\n       \"\\t      : SymbolRegistry[key] = $Symbol(key);\\n\",\n       \"\\t  },\\n\",\n       \"\\t  // 19.4.2.5 Symbol.keyFor(sym)\\n\",\n       \"\\t  keyFor: function keyFor(sym) {\\n\",\n       \"\\t    if (!isSymbol(sym)) throw TypeError(sym + ' is not a symbol!');\\n\",\n       \"\\t    for (var key in SymbolRegistry) if (SymbolRegistry[key] === sym) return key;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  useSetter: function () { setter = true; },\\n\",\n       \"\\t  useSimple: function () { setter = false; }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * !USE_NATIVE, 'Object', {\\n\",\n       \"\\t  // 19.1.2.2 Object.create(O [, Properties])\\n\",\n       \"\\t  create: $create,\\n\",\n       \"\\t  // 19.1.2.4 Object.defineProperty(O, P, Attributes)\\n\",\n       \"\\t  defineProperty: $defineProperty,\\n\",\n       \"\\t  // 19.1.2.3 Object.defineProperties(O, Properties)\\n\",\n       \"\\t  defineProperties: $defineProperties,\\n\",\n       \"\\t  // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\\n\",\n       \"\\t  getOwnPropertyDescriptor: $getOwnPropertyDescriptor,\\n\",\n       \"\\t  // 19.1.2.7 Object.getOwnPropertyNames(O)\\n\",\n       \"\\t  getOwnPropertyNames: $getOwnPropertyNames,\\n\",\n       \"\\t  // 19.1.2.8 Object.getOwnPropertySymbols(O)\\n\",\n       \"\\t  getOwnPropertySymbols: $getOwnPropertySymbols\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t// 24.3.2 JSON.stringify(value [, replacer [, space]])\\n\",\n       \"\\t$JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function () {\\n\",\n       \"\\t  var S = $Symbol();\\n\",\n       \"\\t  // MS Edge converts symbol values to JSON as {}\\n\",\n       \"\\t  // WebKit converts symbol values to JSON as null\\n\",\n       \"\\t  // V8 throws on boxed symbols\\n\",\n       \"\\t  return _stringify([S]) != '[null]' || _stringify({ a: S }) != '{}' || _stringify(Object(S)) != '{}';\\n\",\n       \"\\t})), 'JSON', {\\n\",\n       \"\\t  stringify: function stringify(it) {\\n\",\n       \"\\t    var args = [it];\\n\",\n       \"\\t    var i = 1;\\n\",\n       \"\\t    var replacer, $replacer;\\n\",\n       \"\\t    while (arguments.length > i) args.push(arguments[i++]);\\n\",\n       \"\\t    $replacer = replacer = args[1];\\n\",\n       \"\\t    if (!isObject(replacer) && it === undefined || isSymbol(it)) return; // IE8 returns string on undefined\\n\",\n       \"\\t    if (!isArray(replacer)) replacer = function (key, value) {\\n\",\n       \"\\t      if (typeof $replacer == 'function') value = $replacer.call(this, key, value);\\n\",\n       \"\\t      if (!isSymbol(value)) return value;\\n\",\n       \"\\t    };\\n\",\n       \"\\t    args[1] = replacer;\\n\",\n       \"\\t    return _stringify.apply($JSON, args);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t// 19.4.3.4 Symbol.prototype[@@toPrimitive](hint)\\n\",\n       \"\\t$Symbol[PROTOTYPE][TO_PRIMITIVE] || __webpack_require__(17)($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf);\\n\",\n       \"\\t// 19.4.3.5 Symbol.prototype[@@toStringTag]\\n\",\n       \"\\tsetToStringTag($Symbol, 'Symbol');\\n\",\n       \"\\t// 20.2.1.9 Math[@@toStringTag]\\n\",\n       \"\\tsetToStringTag(Math, 'Math', true);\\n\",\n       \"\\t// 24.3.3 JSON[@@toStringTag]\\n\",\n       \"\\tsetToStringTag(global.JSON, 'JSON', true);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 11 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\\n\",\n       \"\\tvar global = module.exports = typeof window != 'undefined' && window.Math == Math\\n\",\n       \"\\t  ? window : typeof self != 'undefined' && self.Math == Math ? self\\n\",\n       \"\\t  // eslint-disable-next-line no-new-func\\n\",\n       \"\\t  : Function('return this')();\\n\",\n       \"\\tif (typeof __g == 'number') __g = global; // eslint-disable-line no-undef\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 12 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tvar hasOwnProperty = {}.hasOwnProperty;\\n\",\n       \"\\tmodule.exports = function (it, key) {\\n\",\n       \"\\t  return hasOwnProperty.call(it, key);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 13 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// Thank's IE8 for his funny defineProperty\\n\",\n       \"\\tmodule.exports = !__webpack_require__(14)(function () {\\n\",\n       \"\\t  return Object.defineProperty({}, 'a', { get: function () { return 7; } }).a != 7;\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 14 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (exec) {\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    return !!exec();\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    return true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 15 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar core = __webpack_require__(16);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar PROTOTYPE = 'prototype';\\n\",\n       \"\\t\\n\",\n       \"\\tvar $export = function (type, name, source) {\\n\",\n       \"\\t  var IS_FORCED = type & $export.F;\\n\",\n       \"\\t  var IS_GLOBAL = type & $export.G;\\n\",\n       \"\\t  var IS_STATIC = type & $export.S;\\n\",\n       \"\\t  var IS_PROTO = type & $export.P;\\n\",\n       \"\\t  var IS_BIND = type & $export.B;\\n\",\n       \"\\t  var target = IS_GLOBAL ? global : IS_STATIC ? global[name] || (global[name] = {}) : (global[name] || {})[PROTOTYPE];\\n\",\n       \"\\t  var exports = IS_GLOBAL ? core : core[name] || (core[name] = {});\\n\",\n       \"\\t  var expProto = exports[PROTOTYPE] || (exports[PROTOTYPE] = {});\\n\",\n       \"\\t  var key, own, out, exp;\\n\",\n       \"\\t  if (IS_GLOBAL) source = name;\\n\",\n       \"\\t  for (key in source) {\\n\",\n       \"\\t    // contains in native\\n\",\n       \"\\t    own = !IS_FORCED && target && target[key] !== undefined;\\n\",\n       \"\\t    // export native or passed\\n\",\n       \"\\t    out = (own ? target : source)[key];\\n\",\n       \"\\t    // bind timers to global for call from export context\\n\",\n       \"\\t    exp = IS_BIND && own ? ctx(out, global) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;\\n\",\n       \"\\t    // extend global\\n\",\n       \"\\t    if (target) redefine(target, key, out, type & $export.U);\\n\",\n       \"\\t    // export\\n\",\n       \"\\t    if (exports[key] != out) hide(exports, key, exp);\\n\",\n       \"\\t    if (IS_PROTO && expProto[key] != out) expProto[key] = out;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\tglobal.core = core;\\n\",\n       \"\\t// type bitmap\\n\",\n       \"\\t$export.F = 1;   // forced\\n\",\n       \"\\t$export.G = 2;   // global\\n\",\n       \"\\t$export.S = 4;   // static\\n\",\n       \"\\t$export.P = 8;   // proto\\n\",\n       \"\\t$export.B = 16;  // bind\\n\",\n       \"\\t$export.W = 32;  // wrap\\n\",\n       \"\\t$export.U = 64;  // safe\\n\",\n       \"\\t$export.R = 128; // real proto method for `library`\\n\",\n       \"\\tmodule.exports = $export;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 16 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tvar core = module.exports = { version: '2.6.5' };\\n\",\n       \"\\tif (typeof __e == 'number') __e = core; // eslint-disable-line no-undef\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 17 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar dP = __webpack_require__(18);\\n\",\n       \"\\tvar createDesc = __webpack_require__(24);\\n\",\n       \"\\tmodule.exports = __webpack_require__(13) ? function (object, key, value) {\\n\",\n       \"\\t  return dP.f(object, key, createDesc(1, value));\\n\",\n       \"\\t} : function (object, key, value) {\\n\",\n       \"\\t  object[key] = value;\\n\",\n       \"\\t  return object;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 18 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar IE8_DOM_DEFINE = __webpack_require__(21);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar dP = Object.defineProperty;\\n\",\n       \"\\t\\n\",\n       \"\\texports.f = __webpack_require__(13) ? Object.defineProperty : function defineProperty(O, P, Attributes) {\\n\",\n       \"\\t  anObject(O);\\n\",\n       \"\\t  P = toPrimitive(P, true);\\n\",\n       \"\\t  anObject(Attributes);\\n\",\n       \"\\t  if (IE8_DOM_DEFINE) try {\\n\",\n       \"\\t    return dP(O, P, Attributes);\\n\",\n       \"\\t  } catch (e) { /* empty */ }\\n\",\n       \"\\t  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported!');\\n\",\n       \"\\t  if ('value' in Attributes) O[P] = Attributes.value;\\n\",\n       \"\\t  return O;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 19 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  if (!isObject(it)) throw TypeError(it + ' is not an object!');\\n\",\n       \"\\t  return it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 20 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return typeof it === 'object' ? it !== null : typeof it === 'function';\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 21 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = !__webpack_require__(13) && !__webpack_require__(14)(function () {\\n\",\n       \"\\t  return Object.defineProperty(__webpack_require__(22)('div'), 'a', { get: function () { return 7; } }).a != 7;\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 22 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar document = __webpack_require__(11).document;\\n\",\n       \"\\t// typeof document.createElement is 'object' in old IE\\n\",\n       \"\\tvar is = isObject(document) && isObject(document.createElement);\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return is ? document.createElement(it) : {};\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 23 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 7.1.1 ToPrimitive(input [, PreferredType])\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\t// instead of the ES6 spec version, we didn't implement @@toPrimitive case\\n\",\n       \"\\t// and the second argument - flag - preferred type is a string\\n\",\n       \"\\tmodule.exports = function (it, S) {\\n\",\n       \"\\t  if (!isObject(it)) return it;\\n\",\n       \"\\t  var fn, val;\\n\",\n       \"\\t  if (S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\\n\",\n       \"\\t  if (typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it))) return val;\\n\",\n       \"\\t  if (!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it))) return val;\\n\",\n       \"\\t  throw TypeError(\\\"Can't convert object to primitive value\\\");\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 24 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (bitmap, value) {\\n\",\n       \"\\t  return {\\n\",\n       \"\\t    enumerable: !(bitmap & 1),\\n\",\n       \"\\t    configurable: !(bitmap & 2),\\n\",\n       \"\\t    writable: !(bitmap & 4),\\n\",\n       \"\\t    value: value\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 25 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar SRC = __webpack_require__(26)('src');\\n\",\n       \"\\tvar $toString = __webpack_require__(27);\\n\",\n       \"\\tvar TO_STRING = 'toString';\\n\",\n       \"\\tvar TPL = ('' + $toString).split(TO_STRING);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(16).inspectSource = function (it) {\\n\",\n       \"\\t  return $toString.call(it);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t(module.exports = function (O, key, val, safe) {\\n\",\n       \"\\t  var isFunction = typeof val == 'function';\\n\",\n       \"\\t  if (isFunction) has(val, 'name') || hide(val, 'name', key);\\n\",\n       \"\\t  if (O[key] === val) return;\\n\",\n       \"\\t  if (isFunction) has(val, SRC) || hide(val, SRC, O[key] ? '' + O[key] : TPL.join(String(key)));\\n\",\n       \"\\t  if (O === global) {\\n\",\n       \"\\t    O[key] = val;\\n\",\n       \"\\t  } else if (!safe) {\\n\",\n       \"\\t    delete O[key];\\n\",\n       \"\\t    hide(O, key, val);\\n\",\n       \"\\t  } else if (O[key]) {\\n\",\n       \"\\t    O[key] = val;\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    hide(O, key, val);\\n\",\n       \"\\t  }\\n\",\n       \"\\t// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\\n\",\n       \"\\t})(Function.prototype, TO_STRING, function toString() {\\n\",\n       \"\\t  return typeof this == 'function' && this[SRC] || $toString.call(this);\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 26 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tvar id = 0;\\n\",\n       \"\\tvar px = Math.random();\\n\",\n       \"\\tmodule.exports = function (key) {\\n\",\n       \"\\t  return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36));\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 27 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = __webpack_require__(28)('native-function-to-string', Function.toString);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 28 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar core = __webpack_require__(16);\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar SHARED = '__core-js_shared__';\\n\",\n       \"\\tvar store = global[SHARED] || (global[SHARED] = {});\\n\",\n       \"\\t\\n\",\n       \"\\t(module.exports = function (key, value) {\\n\",\n       \"\\t  return store[key] || (store[key] = value !== undefined ? value : {});\\n\",\n       \"\\t})('versions', []).push({\\n\",\n       \"\\t  version: core.version,\\n\",\n       \"\\t  mode: __webpack_require__(29) ? 'pure' : 'global',\\n\",\n       \"\\t  copyright: '© 2019 Denis Pushkarev (zloirock.ru)'\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 29 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = false;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 30 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// optional / simple context binding\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tmodule.exports = function (fn, that, length) {\\n\",\n       \"\\t  aFunction(fn);\\n\",\n       \"\\t  if (that === undefined) return fn;\\n\",\n       \"\\t  switch (length) {\\n\",\n       \"\\t    case 1: return function (a) {\\n\",\n       \"\\t      return fn.call(that, a);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    case 2: return function (a, b) {\\n\",\n       \"\\t      return fn.call(that, a, b);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    case 3: return function (a, b, c) {\\n\",\n       \"\\t      return fn.call(that, a, b, c);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return function (/* ...args */) {\\n\",\n       \"\\t    return fn.apply(that, arguments);\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 31 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  if (typeof it != 'function') throw TypeError(it + ' is not a function!');\\n\",\n       \"\\t  return it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 32 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar META = __webpack_require__(26)('meta');\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar setDesc = __webpack_require__(18).f;\\n\",\n       \"\\tvar id = 0;\\n\",\n       \"\\tvar isExtensible = Object.isExtensible || function () {\\n\",\n       \"\\t  return true;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar FREEZE = !__webpack_require__(14)(function () {\\n\",\n       \"\\t  return isExtensible(Object.preventExtensions({}));\\n\",\n       \"\\t});\\n\",\n       \"\\tvar setMeta = function (it) {\\n\",\n       \"\\t  setDesc(it, META, { value: {\\n\",\n       \"\\t    i: 'O' + ++id, // object ID\\n\",\n       \"\\t    w: {}          // weak collections IDs\\n\",\n       \"\\t  } });\\n\",\n       \"\\t};\\n\",\n       \"\\tvar fastKey = function (it, create) {\\n\",\n       \"\\t  // return primitive with prefix\\n\",\n       \"\\t  if (!isObject(it)) return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\\n\",\n       \"\\t  if (!has(it, META)) {\\n\",\n       \"\\t    // can't set metadata to uncaught frozen object\\n\",\n       \"\\t    if (!isExtensible(it)) return 'F';\\n\",\n       \"\\t    // not necessary to add metadata\\n\",\n       \"\\t    if (!create) return 'E';\\n\",\n       \"\\t    // add missing metadata\\n\",\n       \"\\t    setMeta(it);\\n\",\n       \"\\t  // return object ID\\n\",\n       \"\\t  } return it[META].i;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar getWeak = function (it, create) {\\n\",\n       \"\\t  if (!has(it, META)) {\\n\",\n       \"\\t    // can't set metadata to uncaught frozen object\\n\",\n       \"\\t    if (!isExtensible(it)) return true;\\n\",\n       \"\\t    // not necessary to add metadata\\n\",\n       \"\\t    if (!create) return false;\\n\",\n       \"\\t    // add missing metadata\\n\",\n       \"\\t    setMeta(it);\\n\",\n       \"\\t  // return hash weak collections IDs\\n\",\n       \"\\t  } return it[META].w;\\n\",\n       \"\\t};\\n\",\n       \"\\t// add metadata on freeze-family methods calling\\n\",\n       \"\\tvar onFreeze = function (it) {\\n\",\n       \"\\t  if (FREEZE && meta.NEED && isExtensible(it) && !has(it, META)) setMeta(it);\\n\",\n       \"\\t  return it;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar meta = module.exports = {\\n\",\n       \"\\t  KEY: META,\\n\",\n       \"\\t  NEED: false,\\n\",\n       \"\\t  fastKey: fastKey,\\n\",\n       \"\\t  getWeak: getWeak,\\n\",\n       \"\\t  onFreeze: onFreeze\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 33 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar def = __webpack_require__(18).f;\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar TAG = __webpack_require__(34)('toStringTag');\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (it, tag, stat) {\\n\",\n       \"\\t  if (it && !has(it = stat ? it : it.prototype, TAG)) def(it, TAG, { configurable: true, value: tag });\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 34 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar store = __webpack_require__(28)('wks');\\n\",\n       \"\\tvar uid = __webpack_require__(26);\\n\",\n       \"\\tvar Symbol = __webpack_require__(11).Symbol;\\n\",\n       \"\\tvar USE_SYMBOL = typeof Symbol == 'function';\\n\",\n       \"\\t\\n\",\n       \"\\tvar $exports = module.exports = function (name) {\\n\",\n       \"\\t  return store[name] || (store[name] =\\n\",\n       \"\\t    USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t$exports.store = store;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 35 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\texports.f = __webpack_require__(34);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 36 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar core = __webpack_require__(16);\\n\",\n       \"\\tvar LIBRARY = __webpack_require__(29);\\n\",\n       \"\\tvar wksExt = __webpack_require__(35);\\n\",\n       \"\\tvar defineProperty = __webpack_require__(18).f;\\n\",\n       \"\\tmodule.exports = function (name) {\\n\",\n       \"\\t  var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {});\\n\",\n       \"\\t  if (name.charAt(0) != '_' && !(name in $Symbol)) defineProperty($Symbol, name, { value: wksExt.f(name) });\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 37 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// all enumerable object keys, includes symbols\\n\",\n       \"\\tvar getKeys = __webpack_require__(38);\\n\",\n       \"\\tvar gOPS = __webpack_require__(50);\\n\",\n       \"\\tvar pIE = __webpack_require__(51);\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  var result = getKeys(it);\\n\",\n       \"\\t  var getSymbols = gOPS.f;\\n\",\n       \"\\t  if (getSymbols) {\\n\",\n       \"\\t    var symbols = getSymbols(it);\\n\",\n       \"\\t    var isEnum = pIE.f;\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    var key;\\n\",\n       \"\\t    while (symbols.length > i) if (isEnum.call(it, key = symbols[i++])) result.push(key);\\n\",\n       \"\\t  } return result;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 38 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.14 / 15.2.3.14 Object.keys(O)\\n\",\n       \"\\tvar $keys = __webpack_require__(39);\\n\",\n       \"\\tvar enumBugKeys = __webpack_require__(49);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = Object.keys || function keys(O) {\\n\",\n       \"\\t  return $keys(O, enumBugKeys);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 39 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar arrayIndexOf = __webpack_require__(44)(false);\\n\",\n       \"\\tvar IE_PROTO = __webpack_require__(48)('IE_PROTO');\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (object, names) {\\n\",\n       \"\\t  var O = toIObject(object);\\n\",\n       \"\\t  var i = 0;\\n\",\n       \"\\t  var result = [];\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  for (key in O) if (key != IE_PROTO) has(O, key) && result.push(key);\\n\",\n       \"\\t  // Don't enum bug & hidden keys\\n\",\n       \"\\t  while (names.length > i) if (has(O, key = names[i++])) {\\n\",\n       \"\\t    ~arrayIndexOf(result, key) || result.push(key);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return result;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 40 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// to indexed object, toObject with fallback for non-array-like ES3 strings\\n\",\n       \"\\tvar IObject = __webpack_require__(41);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return IObject(defined(it));\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 41 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// fallback for non-array-like ES3 and non-enumerable old V8 strings\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\t// eslint-disable-next-line no-prototype-builtins\\n\",\n       \"\\tmodule.exports = Object('z').propertyIsEnumerable(0) ? Object : function (it) {\\n\",\n       \"\\t  return cof(it) == 'String' ? it.split('') : Object(it);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 42 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tvar toString = {}.toString;\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return toString.call(it).slice(8, -1);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 43 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// 7.2.1 RequireObjectCoercible(argument)\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  if (it == undefined) throw TypeError(\\\"Can't call method on  \\\" + it);\\n\",\n       \"\\t  return it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 44 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// false -> Array#indexOf\\n\",\n       \"\\t// true  -> Array#includes\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\tmodule.exports = function (IS_INCLUDES) {\\n\",\n       \"\\t  return function ($this, el, fromIndex) {\\n\",\n       \"\\t    var O = toIObject($this);\\n\",\n       \"\\t    var length = toLength(O.length);\\n\",\n       \"\\t    var index = toAbsoluteIndex(fromIndex, length);\\n\",\n       \"\\t    var value;\\n\",\n       \"\\t    // Array#includes uses SameValueZero equality algorithm\\n\",\n       \"\\t    // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t    if (IS_INCLUDES && el != el) while (length > index) {\\n\",\n       \"\\t      value = O[index++];\\n\",\n       \"\\t      // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t      if (value != value) return true;\\n\",\n       \"\\t    // Array#indexOf ignores holes, Array#includes - not\\n\",\n       \"\\t    } else for (;length > index; index++) if (IS_INCLUDES || index in O) {\\n\",\n       \"\\t      if (O[index] === el) return IS_INCLUDES || index || 0;\\n\",\n       \"\\t    } return !IS_INCLUDES && -1;\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 45 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 7.1.15 ToLength\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar min = Math.min;\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 46 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// 7.1.4 ToInteger\\n\",\n       \"\\tvar ceil = Math.ceil;\\n\",\n       \"\\tvar floor = Math.floor;\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 47 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar max = Math.max;\\n\",\n       \"\\tvar min = Math.min;\\n\",\n       \"\\tmodule.exports = function (index, length) {\\n\",\n       \"\\t  index = toInteger(index);\\n\",\n       \"\\t  return index < 0 ? max(index + length, 0) : min(index, length);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 48 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar shared = __webpack_require__(28)('keys');\\n\",\n       \"\\tvar uid = __webpack_require__(26);\\n\",\n       \"\\tmodule.exports = function (key) {\\n\",\n       \"\\t  return shared[key] || (shared[key] = uid(key));\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 49 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// IE 8- don't enum bug keys\\n\",\n       \"\\tmodule.exports = (\\n\",\n       \"\\t  'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf'\\n\",\n       \"\\t).split(',');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 50 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\texports.f = Object.getOwnPropertySymbols;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 51 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\texports.f = {}.propertyIsEnumerable;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 52 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 7.2.2 IsArray(argument)\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\tmodule.exports = Array.isArray || function isArray(arg) {\\n\",\n       \"\\t  return cof(arg) == 'Array';\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 53 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar dPs = __webpack_require__(54);\\n\",\n       \"\\tvar enumBugKeys = __webpack_require__(49);\\n\",\n       \"\\tvar IE_PROTO = __webpack_require__(48)('IE_PROTO');\\n\",\n       \"\\tvar Empty = function () { /* empty */ };\\n\",\n       \"\\tvar PROTOTYPE = 'prototype';\\n\",\n       \"\\t\\n\",\n       \"\\t// Create object with fake `null` prototype: use iframe Object with cleared prototype\\n\",\n       \"\\tvar createDict = function () {\\n\",\n       \"\\t  // Thrash, waste and sodomy: IE GC bug\\n\",\n       \"\\t  var iframe = __webpack_require__(22)('iframe');\\n\",\n       \"\\t  var i = enumBugKeys.length;\\n\",\n       \"\\t  var lt = '<';\\n\",\n       \"\\t  var gt = '>';\\n\",\n       \"\\t  var iframeDocument;\\n\",\n       \"\\t  iframe.style.display = 'none';\\n\",\n       \"\\t  __webpack_require__(55).appendChild(iframe);\\n\",\n       \"\\t  iframe.src = 'javascript:'; // eslint-disable-line no-script-url\\n\",\n       \"\\t  // createDict = iframe.contentWindow.Object;\\n\",\n       \"\\t  // html.removeChild(iframe);\\n\",\n       \"\\t  iframeDocument = iframe.contentWindow.document;\\n\",\n       \"\\t  iframeDocument.open();\\n\",\n       \"\\t  iframeDocument.write(lt + 'script' + gt + 'document.F=Object' + lt + '/script' + gt);\\n\",\n       \"\\t  iframeDocument.close();\\n\",\n       \"\\t  createDict = iframeDocument.F;\\n\",\n       \"\\t  while (i--) delete createDict[PROTOTYPE][enumBugKeys[i]];\\n\",\n       \"\\t  return createDict();\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = Object.create || function create(O, Properties) {\\n\",\n       \"\\t  var result;\\n\",\n       \"\\t  if (O !== null) {\\n\",\n       \"\\t    Empty[PROTOTYPE] = anObject(O);\\n\",\n       \"\\t    result = new Empty();\\n\",\n       \"\\t    Empty[PROTOTYPE] = null;\\n\",\n       \"\\t    // add \\\"__proto__\\\" for Object.getPrototypeOf polyfill\\n\",\n       \"\\t    result[IE_PROTO] = O;\\n\",\n       \"\\t  } else result = createDict();\\n\",\n       \"\\t  return Properties === undefined ? result : dPs(result, Properties);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 54 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar dP = __webpack_require__(18);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar getKeys = __webpack_require__(38);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = __webpack_require__(13) ? Object.defineProperties : function defineProperties(O, Properties) {\\n\",\n       \"\\t  anObject(O);\\n\",\n       \"\\t  var keys = getKeys(Properties);\\n\",\n       \"\\t  var length = keys.length;\\n\",\n       \"\\t  var i = 0;\\n\",\n       \"\\t  var P;\\n\",\n       \"\\t  while (length > i) dP.f(O, P = keys[i++], Properties[P]);\\n\",\n       \"\\t  return O;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 55 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar document = __webpack_require__(11).document;\\n\",\n       \"\\tmodule.exports = document && document.documentElement;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 56 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar gOPN = __webpack_require__(57).f;\\n\",\n       \"\\tvar toString = {}.toString;\\n\",\n       \"\\t\\n\",\n       \"\\tvar windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames\\n\",\n       \"\\t  ? Object.getOwnPropertyNames(window) : [];\\n\",\n       \"\\t\\n\",\n       \"\\tvar getWindowNames = function (it) {\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    return gOPN(it);\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    return windowNames.slice();\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports.f = function getOwnPropertyNames(it) {\\n\",\n       \"\\t  return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it));\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 57 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O)\\n\",\n       \"\\tvar $keys = __webpack_require__(39);\\n\",\n       \"\\tvar hiddenKeys = __webpack_require__(49).concat('length', 'prototype');\\n\",\n       \"\\t\\n\",\n       \"\\texports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\\n\",\n       \"\\t  return $keys(O, hiddenKeys);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 58 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar pIE = __webpack_require__(51);\\n\",\n       \"\\tvar createDesc = __webpack_require__(24);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar IE8_DOM_DEFINE = __webpack_require__(21);\\n\",\n       \"\\tvar gOPD = Object.getOwnPropertyDescriptor;\\n\",\n       \"\\t\\n\",\n       \"\\texports.f = __webpack_require__(13) ? gOPD : function getOwnPropertyDescriptor(O, P) {\\n\",\n       \"\\t  O = toIObject(O);\\n\",\n       \"\\t  P = toPrimitive(P, true);\\n\",\n       \"\\t  if (IE8_DOM_DEFINE) try {\\n\",\n       \"\\t    return gOPD(O, P);\\n\",\n       \"\\t  } catch (e) { /* empty */ }\\n\",\n       \"\\t  if (has(O, P)) return createDesc(!pIE.f.call(O, P), O[P]);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 59 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\\n\",\n       \"\\t$export($export.S, 'Object', { create: __webpack_require__(53) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 60 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t// 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes)\\n\",\n       \"\\t$export($export.S + $export.F * !__webpack_require__(13), 'Object', { defineProperty: __webpack_require__(18).f });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 61 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t// 19.1.2.3 / 15.2.3.7 Object.defineProperties(O, Properties)\\n\",\n       \"\\t$export($export.S + $export.F * !__webpack_require__(13), 'Object', { defineProperties: __webpack_require__(54) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 62 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.6 Object.getOwnPropertyDescriptor(O, P)\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar $getOwnPropertyDescriptor = __webpack_require__(58).f;\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('getOwnPropertyDescriptor', function () {\\n\",\n       \"\\t  return function getOwnPropertyDescriptor(it, key) {\\n\",\n       \"\\t    return $getOwnPropertyDescriptor(toIObject(it), key);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 63 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// most Object methods by ES6 should accept primitives\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar core = __webpack_require__(16);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tmodule.exports = function (KEY, exec) {\\n\",\n       \"\\t  var fn = (core.Object || {})[KEY] || Object[KEY];\\n\",\n       \"\\t  var exp = {};\\n\",\n       \"\\t  exp[KEY] = exec(fn);\\n\",\n       \"\\t  $export($export.S + $export.F * fails(function () { fn(1); }), 'Object', exp);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 64 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.9 Object.getPrototypeOf(O)\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar $getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('getPrototypeOf', function () {\\n\",\n       \"\\t  return function getPrototypeOf(it) {\\n\",\n       \"\\t    return $getPrototypeOf(toObject(it));\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 65 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 7.1.13 ToObject(argument)\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return Object(defined(it));\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 66 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar IE_PROTO = __webpack_require__(48)('IE_PROTO');\\n\",\n       \"\\tvar ObjectProto = Object.prototype;\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = Object.getPrototypeOf || function (O) {\\n\",\n       \"\\t  O = toObject(O);\\n\",\n       \"\\t  if (has(O, IE_PROTO)) return O[IE_PROTO];\\n\",\n       \"\\t  if (typeof O.constructor == 'function' && O instanceof O.constructor) {\\n\",\n       \"\\t    return O.constructor.prototype;\\n\",\n       \"\\t  } return O instanceof Object ? ObjectProto : null;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 67 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.14 Object.keys(O)\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar $keys = __webpack_require__(38);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('keys', function () {\\n\",\n       \"\\t  return function keys(it) {\\n\",\n       \"\\t    return $keys(toObject(it));\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 68 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.7 Object.getOwnPropertyNames(O)\\n\",\n       \"\\t__webpack_require__(63)('getOwnPropertyNames', function () {\\n\",\n       \"\\t  return __webpack_require__(56).f;\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 69 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.5 Object.freeze(O)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar meta = __webpack_require__(32).onFreeze;\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('freeze', function ($freeze) {\\n\",\n       \"\\t  return function freeze(it) {\\n\",\n       \"\\t    return $freeze && isObject(it) ? $freeze(meta(it)) : it;\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 70 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.17 Object.seal(O)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar meta = __webpack_require__(32).onFreeze;\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('seal', function ($seal) {\\n\",\n       \"\\t  return function seal(it) {\\n\",\n       \"\\t    return $seal && isObject(it) ? $seal(meta(it)) : it;\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 71 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.15 Object.preventExtensions(O)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar meta = __webpack_require__(32).onFreeze;\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('preventExtensions', function ($preventExtensions) {\\n\",\n       \"\\t  return function preventExtensions(it) {\\n\",\n       \"\\t    return $preventExtensions && isObject(it) ? $preventExtensions(meta(it)) : it;\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 72 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.12 Object.isFrozen(O)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('isFrozen', function ($isFrozen) {\\n\",\n       \"\\t  return function isFrozen(it) {\\n\",\n       \"\\t    return isObject(it) ? $isFrozen ? $isFrozen(it) : false : true;\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 73 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.13 Object.isSealed(O)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('isSealed', function ($isSealed) {\\n\",\n       \"\\t  return function isSealed(it) {\\n\",\n       \"\\t    return isObject(it) ? $isSealed ? $isSealed(it) : false : true;\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 74 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.2.11 Object.isExtensible(O)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(63)('isExtensible', function ($isExtensible) {\\n\",\n       \"\\t  return function isExtensible(it) {\\n\",\n       \"\\t    return isObject(it) ? $isExtensible ? $isExtensible(it) : true : false;\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 75 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.3.1 Object.assign(target, source)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F, 'Object', { assign: __webpack_require__(76) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 76 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 19.1.2.1 Object.assign(target, source, ...)\\n\",\n       \"\\tvar getKeys = __webpack_require__(38);\\n\",\n       \"\\tvar gOPS = __webpack_require__(50);\\n\",\n       \"\\tvar pIE = __webpack_require__(51);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar IObject = __webpack_require__(41);\\n\",\n       \"\\tvar $assign = Object.assign;\\n\",\n       \"\\t\\n\",\n       \"\\t// should work with symbols and should have deterministic property order (V8 bug)\\n\",\n       \"\\tmodule.exports = !$assign || __webpack_require__(14)(function () {\\n\",\n       \"\\t  var A = {};\\n\",\n       \"\\t  var B = {};\\n\",\n       \"\\t  // eslint-disable-next-line no-undef\\n\",\n       \"\\t  var S = Symbol();\\n\",\n       \"\\t  var K = 'abcdefghijklmnopqrst';\\n\",\n       \"\\t  A[S] = 7;\\n\",\n       \"\\t  K.split('').forEach(function (k) { B[k] = k; });\\n\",\n       \"\\t  return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K;\\n\",\n       \"\\t}) ? function assign(target, source) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t  var T = toObject(target);\\n\",\n       \"\\t  var aLen = arguments.length;\\n\",\n       \"\\t  var index = 1;\\n\",\n       \"\\t  var getSymbols = gOPS.f;\\n\",\n       \"\\t  var isEnum = pIE.f;\\n\",\n       \"\\t  while (aLen > index) {\\n\",\n       \"\\t    var S = IObject(arguments[index++]);\\n\",\n       \"\\t    var keys = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S);\\n\",\n       \"\\t    var length = keys.length;\\n\",\n       \"\\t    var j = 0;\\n\",\n       \"\\t    var key;\\n\",\n       \"\\t    while (length > j) if (isEnum.call(S, key = keys[j++])) T[key] = S[key];\\n\",\n       \"\\t  } return T;\\n\",\n       \"\\t} : $assign;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 77 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.3.10 Object.is(value1, value2)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t$export($export.S, 'Object', { is: __webpack_require__(78) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 78 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// 7.2.9 SameValue(x, y)\\n\",\n       \"\\tmodule.exports = Object.is || function is(x, y) {\\n\",\n       \"\\t  // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t  return x === y ? x !== 0 || 1 / x === 1 / y : x != x && y != y;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 79 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.1.3.19 Object.setPrototypeOf(O, proto)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t$export($export.S, 'Object', { setPrototypeOf: __webpack_require__(80).set });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 80 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// Works with __proto__ only. Old v8 can't work with null proto objects.\\n\",\n       \"\\t/* eslint-disable no-proto */\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar check = function (O, proto) {\\n\",\n       \"\\t  anObject(O);\\n\",\n       \"\\t  if (!isObject(proto) && proto !== null) throw TypeError(proto + \\\": can't set as prototype!\\\");\\n\",\n       \"\\t};\\n\",\n       \"\\tmodule.exports = {\\n\",\n       \"\\t  set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line\\n\",\n       \"\\t    function (test, buggy, set) {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        set = __webpack_require__(30)(Function.call, __webpack_require__(58).f(Object.prototype, '__proto__').set, 2);\\n\",\n       \"\\t        set(test, []);\\n\",\n       \"\\t        buggy = !(test instanceof Array);\\n\",\n       \"\\t      } catch (e) { buggy = true; }\\n\",\n       \"\\t      return function setPrototypeOf(O, proto) {\\n\",\n       \"\\t        check(O, proto);\\n\",\n       \"\\t        if (buggy) O.__proto__ = proto;\\n\",\n       \"\\t        else set(O, proto);\\n\",\n       \"\\t        return O;\\n\",\n       \"\\t      };\\n\",\n       \"\\t    }({}, false) : undefined),\\n\",\n       \"\\t  check: check\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 81 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 19.1.3.6 Object.prototype.toString()\\n\",\n       \"\\tvar classof = __webpack_require__(82);\\n\",\n       \"\\tvar test = {};\\n\",\n       \"\\ttest[__webpack_require__(34)('toStringTag')] = 'z';\\n\",\n       \"\\tif (test + '' != '[object z]') {\\n\",\n       \"\\t  __webpack_require__(25)(Object.prototype, 'toString', function toString() {\\n\",\n       \"\\t    return '[object ' + classof(this) + ']';\\n\",\n       \"\\t  }, true);\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 82 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// getting tag from 19.1.3.6 Object.prototype.toString()\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\tvar TAG = __webpack_require__(34)('toStringTag');\\n\",\n       \"\\t// ES3 wrong here\\n\",\n       \"\\tvar ARG = cof(function () { return arguments; }()) == 'Arguments';\\n\",\n       \"\\t\\n\",\n       \"\\t// fallback for IE11 Script Access Denied error\\n\",\n       \"\\tvar tryGet = function (it, key) {\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    return it[key];\\n\",\n       \"\\t  } catch (e) { /* empty */ }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  var O, T, B;\\n\",\n       \"\\t  return it === undefined ? 'Undefined' : it === null ? 'Null'\\n\",\n       \"\\t    // @@toStringTag case\\n\",\n       \"\\t    : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T\\n\",\n       \"\\t    // builtinTag case\\n\",\n       \"\\t    : ARG ? cof(O)\\n\",\n       \"\\t    // ES3 arguments fallback\\n\",\n       \"\\t    : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 83 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 19.2.3.2 / 15.3.4.5 Function.prototype.bind(thisArg, args...)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'Function', { bind: __webpack_require__(84) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 84 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar invoke = __webpack_require__(85);\\n\",\n       \"\\tvar arraySlice = [].slice;\\n\",\n       \"\\tvar factories = {};\\n\",\n       \"\\t\\n\",\n       \"\\tvar construct = function (F, len, args) {\\n\",\n       \"\\t  if (!(len in factories)) {\\n\",\n       \"\\t    for (var n = [], i = 0; i < len; i++) n[i] = 'a[' + i + ']';\\n\",\n       \"\\t    // eslint-disable-next-line no-new-func\\n\",\n       \"\\t    factories[len] = Function('F,a', 'return new F(' + n.join(',') + ')');\\n\",\n       \"\\t  } return factories[len](F, args);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = Function.bind || function bind(that /* , ...args */) {\\n\",\n       \"\\t  var fn = aFunction(this);\\n\",\n       \"\\t  var partArgs = arraySlice.call(arguments, 1);\\n\",\n       \"\\t  var bound = function (/* args... */) {\\n\",\n       \"\\t    var args = partArgs.concat(arraySlice.call(arguments));\\n\",\n       \"\\t    return this instanceof bound ? construct(fn, args.length, args) : invoke(fn, args, that);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  if (isObject(fn.prototype)) bound.prototype = fn.prototype;\\n\",\n       \"\\t  return bound;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 85 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// fast apply, http://jsperf.lnkit.com/fast-apply/5\\n\",\n       \"\\tmodule.exports = function (fn, args, that) {\\n\",\n       \"\\t  var un = that === undefined;\\n\",\n       \"\\t  switch (args.length) {\\n\",\n       \"\\t    case 0: return un ? fn()\\n\",\n       \"\\t                      : fn.call(that);\\n\",\n       \"\\t    case 1: return un ? fn(args[0])\\n\",\n       \"\\t                      : fn.call(that, args[0]);\\n\",\n       \"\\t    case 2: return un ? fn(args[0], args[1])\\n\",\n       \"\\t                      : fn.call(that, args[0], args[1]);\\n\",\n       \"\\t    case 3: return un ? fn(args[0], args[1], args[2])\\n\",\n       \"\\t                      : fn.call(that, args[0], args[1], args[2]);\\n\",\n       \"\\t    case 4: return un ? fn(args[0], args[1], args[2], args[3])\\n\",\n       \"\\t                      : fn.call(that, args[0], args[1], args[2], args[3]);\\n\",\n       \"\\t  } return fn.apply(that, args);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 86 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar dP = __webpack_require__(18).f;\\n\",\n       \"\\tvar FProto = Function.prototype;\\n\",\n       \"\\tvar nameRE = /^\\\\s*function ([^ (]*)/;\\n\",\n       \"\\tvar NAME = 'name';\\n\",\n       \"\\t\\n\",\n       \"\\t// 19.2.4.2 name\\n\",\n       \"\\tNAME in FProto || __webpack_require__(13) && dP(FProto, NAME, {\\n\",\n       \"\\t  configurable: true,\\n\",\n       \"\\t  get: function () {\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      return ('' + this).match(nameRE)[1];\\n\",\n       \"\\t    } catch (e) {\\n\",\n       \"\\t      return '';\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 87 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar HAS_INSTANCE = __webpack_require__(34)('hasInstance');\\n\",\n       \"\\tvar FunctionProto = Function.prototype;\\n\",\n       \"\\t// 19.2.3.6 Function.prototype[@@hasInstance](V)\\n\",\n       \"\\tif (!(HAS_INSTANCE in FunctionProto)) __webpack_require__(18).f(FunctionProto, HAS_INSTANCE, { value: function (O) {\\n\",\n       \"\\t  if (typeof this != 'function' || !isObject(O)) return false;\\n\",\n       \"\\t  if (!isObject(this.prototype)) return O instanceof this;\\n\",\n       \"\\t  // for environment w/o native `@@hasInstance` logic enough `instanceof`, but add this:\\n\",\n       \"\\t  while (O = getPrototypeOf(O)) if (this.prototype === O) return true;\\n\",\n       \"\\t  return false;\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 88 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $parseInt = __webpack_require__(89);\\n\",\n       \"\\t// 18.2.5 parseInt(string, radix)\\n\",\n       \"\\t$export($export.G + $export.F * (parseInt != $parseInt), { parseInt: $parseInt });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 89 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $parseInt = __webpack_require__(11).parseInt;\\n\",\n       \"\\tvar $trim = __webpack_require__(90).trim;\\n\",\n       \"\\tvar ws = __webpack_require__(91);\\n\",\n       \"\\tvar hex = /^[-+]?0[xX]/;\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = $parseInt(ws + '08') !== 8 || $parseInt(ws + '0x16') !== 22 ? function parseInt(str, radix) {\\n\",\n       \"\\t  var string = $trim(String(str), 3);\\n\",\n       \"\\t  return $parseInt(string, (radix >>> 0) || (hex.test(string) ? 16 : 10));\\n\",\n       \"\\t} : $parseInt;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 90 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar spaces = __webpack_require__(91);\\n\",\n       \"\\tvar space = '[' + spaces + ']';\\n\",\n       \"\\tvar non = '\\\\u200b\\\\u0085';\\n\",\n       \"\\tvar ltrim = RegExp('^' + space + space + '*');\\n\",\n       \"\\tvar rtrim = RegExp(space + space + '*$');\\n\",\n       \"\\t\\n\",\n       \"\\tvar exporter = function (KEY, exec, ALIAS) {\\n\",\n       \"\\t  var exp = {};\\n\",\n       \"\\t  var FORCE = fails(function () {\\n\",\n       \"\\t    return !!spaces[KEY]() || non[KEY]() != non;\\n\",\n       \"\\t  });\\n\",\n       \"\\t  var fn = exp[KEY] = FORCE ? exec(trim) : spaces[KEY];\\n\",\n       \"\\t  if (ALIAS) exp[ALIAS] = fn;\\n\",\n       \"\\t  $export($export.P + $export.F * FORCE, 'String', exp);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// 1 -> String#trimLeft\\n\",\n       \"\\t// 2 -> String#trimRight\\n\",\n       \"\\t// 3 -> String#trim\\n\",\n       \"\\tvar trim = exporter.trim = function (string, TYPE) {\\n\",\n       \"\\t  string = String(defined(string));\\n\",\n       \"\\t  if (TYPE & 1) string = string.replace(ltrim, '');\\n\",\n       \"\\t  if (TYPE & 2) string = string.replace(rtrim, '');\\n\",\n       \"\\t  return string;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = exporter;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 91 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = '\\\\x09\\\\x0A\\\\x0B\\\\x0C\\\\x0D\\\\x20\\\\xA0\\\\u1680\\\\u180E\\\\u2000\\\\u2001\\\\u2002\\\\u2003' +\\n\",\n       \"\\t  '\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200A\\\\u202F\\\\u205F\\\\u3000\\\\u2028\\\\u2029\\\\uFEFF';\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 92 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $parseFloat = __webpack_require__(93);\\n\",\n       \"\\t// 18.2.4 parseFloat(string)\\n\",\n       \"\\t$export($export.G + $export.F * (parseFloat != $parseFloat), { parseFloat: $parseFloat });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 93 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $parseFloat = __webpack_require__(11).parseFloat;\\n\",\n       \"\\tvar $trim = __webpack_require__(90).trim;\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = 1 / $parseFloat(__webpack_require__(91) + '-0') !== -Infinity ? function parseFloat(str) {\\n\",\n       \"\\t  var string = $trim(String(str), 3);\\n\",\n       \"\\t  var result = $parseFloat(string);\\n\",\n       \"\\t  return result === 0 && string.charAt(0) == '-' ? -0 : result;\\n\",\n       \"\\t} : $parseFloat;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 94 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\tvar inheritIfRequired = __webpack_require__(95);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar gOPN = __webpack_require__(57).f;\\n\",\n       \"\\tvar gOPD = __webpack_require__(58).f;\\n\",\n       \"\\tvar dP = __webpack_require__(18).f;\\n\",\n       \"\\tvar $trim = __webpack_require__(90).trim;\\n\",\n       \"\\tvar NUMBER = 'Number';\\n\",\n       \"\\tvar $Number = global[NUMBER];\\n\",\n       \"\\tvar Base = $Number;\\n\",\n       \"\\tvar proto = $Number.prototype;\\n\",\n       \"\\t// Opera ~12 has broken Object#toString\\n\",\n       \"\\tvar BROKEN_COF = cof(__webpack_require__(53)(proto)) == NUMBER;\\n\",\n       \"\\tvar TRIM = 'trim' in String.prototype;\\n\",\n       \"\\t\\n\",\n       \"\\t// 7.1.3 ToNumber(argument)\\n\",\n       \"\\tvar toNumber = function (argument) {\\n\",\n       \"\\t  var it = toPrimitive(argument, false);\\n\",\n       \"\\t  if (typeof it == 'string' && it.length > 2) {\\n\",\n       \"\\t    it = TRIM ? it.trim() : $trim(it, 3);\\n\",\n       \"\\t    var first = it.charCodeAt(0);\\n\",\n       \"\\t    var third, radix, maxCode;\\n\",\n       \"\\t    if (first === 43 || first === 45) {\\n\",\n       \"\\t      third = it.charCodeAt(2);\\n\",\n       \"\\t      if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\\n\",\n       \"\\t    } else if (first === 48) {\\n\",\n       \"\\t      switch (it.charCodeAt(1)) {\\n\",\n       \"\\t        case 66: case 98: radix = 2; maxCode = 49; break; // fast equal /^0b[01]+$/i\\n\",\n       \"\\t        case 79: case 111: radix = 8; maxCode = 55; break; // fast equal /^0o[0-7]+$/i\\n\",\n       \"\\t        default: return +it;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      for (var digits = it.slice(2), i = 0, l = digits.length, code; i < l; i++) {\\n\",\n       \"\\t        code = digits.charCodeAt(i);\\n\",\n       \"\\t        // parseInt parses a string to a first unavailable symbol\\n\",\n       \"\\t        // but ToNumber should return NaN if a string contains unavailable symbols\\n\",\n       \"\\t        if (code < 48 || code > maxCode) return NaN;\\n\",\n       \"\\t      } return parseInt(digits, radix);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  } return +it;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tif (!$Number(' 0o1') || !$Number('0b1') || $Number('+0x1')) {\\n\",\n       \"\\t  $Number = function Number(value) {\\n\",\n       \"\\t    var it = arguments.length < 1 ? 0 : value;\\n\",\n       \"\\t    var that = this;\\n\",\n       \"\\t    return that instanceof $Number\\n\",\n       \"\\t      // check on 1..constructor(foo) case\\n\",\n       \"\\t      && (BROKEN_COF ? fails(function () { proto.valueOf.call(that); }) : cof(that) != NUMBER)\\n\",\n       \"\\t        ? inheritIfRequired(new Base(toNumber(it)), that, $Number) : toNumber(it);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  for (var keys = __webpack_require__(13) ? gOPN(Base) : (\\n\",\n       \"\\t    // ES3:\\n\",\n       \"\\t    'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\\n\",\n       \"\\t    // ES6 (in case, if modules with ES6 Number statics required before):\\n\",\n       \"\\t    'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' +\\n\",\n       \"\\t    'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger'\\n\",\n       \"\\t  ).split(','), j = 0, key; keys.length > j; j++) {\\n\",\n       \"\\t    if (has(Base, key = keys[j]) && !has($Number, key)) {\\n\",\n       \"\\t      dP($Number, key, gOPD(Base, key));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  $Number.prototype = proto;\\n\",\n       \"\\t  proto.constructor = $Number;\\n\",\n       \"\\t  __webpack_require__(25)(global, NUMBER, $Number);\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 95 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar setPrototypeOf = __webpack_require__(80).set;\\n\",\n       \"\\tmodule.exports = function (that, target, C) {\\n\",\n       \"\\t  var S = target.constructor;\\n\",\n       \"\\t  var P;\\n\",\n       \"\\t  if (S !== C && typeof S == 'function' && (P = S.prototype) !== C.prototype && isObject(P) && setPrototypeOf) {\\n\",\n       \"\\t    setPrototypeOf(that, P);\\n\",\n       \"\\t  } return that;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 96 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar aNumberValue = __webpack_require__(97);\\n\",\n       \"\\tvar repeat = __webpack_require__(98);\\n\",\n       \"\\tvar $toFixed = 1.0.toFixed;\\n\",\n       \"\\tvar floor = Math.floor;\\n\",\n       \"\\tvar data = [0, 0, 0, 0, 0, 0];\\n\",\n       \"\\tvar ERROR = 'Number.toFixed: incorrect invocation!';\\n\",\n       \"\\tvar ZERO = '0';\\n\",\n       \"\\t\\n\",\n       \"\\tvar multiply = function (n, c) {\\n\",\n       \"\\t  var i = -1;\\n\",\n       \"\\t  var c2 = c;\\n\",\n       \"\\t  while (++i < 6) {\\n\",\n       \"\\t    c2 += n * data[i];\\n\",\n       \"\\t    data[i] = c2 % 1e7;\\n\",\n       \"\\t    c2 = floor(c2 / 1e7);\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\tvar divide = function (n) {\\n\",\n       \"\\t  var i = 6;\\n\",\n       \"\\t  var c = 0;\\n\",\n       \"\\t  while (--i >= 0) {\\n\",\n       \"\\t    c += data[i];\\n\",\n       \"\\t    data[i] = floor(c / n);\\n\",\n       \"\\t    c = (c % n) * 1e7;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\tvar numToString = function () {\\n\",\n       \"\\t  var i = 6;\\n\",\n       \"\\t  var s = '';\\n\",\n       \"\\t  while (--i >= 0) {\\n\",\n       \"\\t    if (s !== '' || i === 0 || data[i] !== 0) {\\n\",\n       \"\\t      var t = String(data[i]);\\n\",\n       \"\\t      s = s === '' ? t : s + repeat.call(ZERO, 7 - t.length) + t;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  } return s;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar pow = function (x, n, acc) {\\n\",\n       \"\\t  return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar log = function (x) {\\n\",\n       \"\\t  var n = 0;\\n\",\n       \"\\t  var x2 = x;\\n\",\n       \"\\t  while (x2 >= 4096) {\\n\",\n       \"\\t    n += 12;\\n\",\n       \"\\t    x2 /= 4096;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  while (x2 >= 2) {\\n\",\n       \"\\t    n += 1;\\n\",\n       \"\\t    x2 /= 2;\\n\",\n       \"\\t  } return n;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * (!!$toFixed && (\\n\",\n       \"\\t  0.00008.toFixed(3) !== '0.000' ||\\n\",\n       \"\\t  0.9.toFixed(0) !== '1' ||\\n\",\n       \"\\t  1.255.toFixed(2) !== '1.25' ||\\n\",\n       \"\\t  1000000000000000128.0.toFixed(0) !== '1000000000000000128'\\n\",\n       \"\\t) || !__webpack_require__(14)(function () {\\n\",\n       \"\\t  // V8 ~ Android 4.3-\\n\",\n       \"\\t  $toFixed.call({});\\n\",\n       \"\\t})), 'Number', {\\n\",\n       \"\\t  toFixed: function toFixed(fractionDigits) {\\n\",\n       \"\\t    var x = aNumberValue(this, ERROR);\\n\",\n       \"\\t    var f = toInteger(fractionDigits);\\n\",\n       \"\\t    var s = '';\\n\",\n       \"\\t    var m = ZERO;\\n\",\n       \"\\t    var e, z, j, k;\\n\",\n       \"\\t    if (f < 0 || f > 20) throw RangeError(ERROR);\\n\",\n       \"\\t    // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t    if (x != x) return 'NaN';\\n\",\n       \"\\t    if (x <= -1e21 || x >= 1e21) return String(x);\\n\",\n       \"\\t    if (x < 0) {\\n\",\n       \"\\t      s = '-';\\n\",\n       \"\\t      x = -x;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (x > 1e-21) {\\n\",\n       \"\\t      e = log(x * pow(2, 69, 1)) - 69;\\n\",\n       \"\\t      z = e < 0 ? x * pow(2, -e, 1) : x / pow(2, e, 1);\\n\",\n       \"\\t      z *= 0x10000000000000;\\n\",\n       \"\\t      e = 52 - e;\\n\",\n       \"\\t      if (e > 0) {\\n\",\n       \"\\t        multiply(0, z);\\n\",\n       \"\\t        j = f;\\n\",\n       \"\\t        while (j >= 7) {\\n\",\n       \"\\t          multiply(1e7, 0);\\n\",\n       \"\\t          j -= 7;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        multiply(pow(10, j, 1), 0);\\n\",\n       \"\\t        j = e - 1;\\n\",\n       \"\\t        while (j >= 23) {\\n\",\n       \"\\t          divide(1 << 23);\\n\",\n       \"\\t          j -= 23;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        divide(1 << j);\\n\",\n       \"\\t        multiply(1, 1);\\n\",\n       \"\\t        divide(2);\\n\",\n       \"\\t        m = numToString();\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        multiply(0, z);\\n\",\n       \"\\t        multiply(1 << -e, 0);\\n\",\n       \"\\t        m = numToString() + repeat.call(ZERO, f);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (f > 0) {\\n\",\n       \"\\t      k = m.length;\\n\",\n       \"\\t      m = s + (k <= f ? '0.' + repeat.call(ZERO, f - k) + m : m.slice(0, k - f) + '.' + m.slice(k - f));\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      m = s + m;\\n\",\n       \"\\t    } return m;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 97 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\tmodule.exports = function (it, msg) {\\n\",\n       \"\\t  if (typeof it != 'number' && cof(it) != 'Number') throw TypeError(msg);\\n\",\n       \"\\t  return +it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 98 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function repeat(count) {\\n\",\n       \"\\t  var str = String(defined(this));\\n\",\n       \"\\t  var res = '';\\n\",\n       \"\\t  var n = toInteger(count);\\n\",\n       \"\\t  if (n < 0 || n == Infinity) throw RangeError(\\\"Count can't be negative\\\");\\n\",\n       \"\\t  for (;n > 0; (n >>>= 1) && (str += str)) if (n & 1) res += str;\\n\",\n       \"\\t  return res;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 99 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $fails = __webpack_require__(14);\\n\",\n       \"\\tvar aNumberValue = __webpack_require__(97);\\n\",\n       \"\\tvar $toPrecision = 1.0.toPrecision;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * ($fails(function () {\\n\",\n       \"\\t  // IE7-\\n\",\n       \"\\t  return $toPrecision.call(1, undefined) !== '1';\\n\",\n       \"\\t}) || !$fails(function () {\\n\",\n       \"\\t  // V8 ~ Android 4.3-\\n\",\n       \"\\t  $toPrecision.call({});\\n\",\n       \"\\t})), 'Number', {\\n\",\n       \"\\t  toPrecision: function toPrecision(precision) {\\n\",\n       \"\\t    var that = aNumberValue(this, 'Number#toPrecision: incorrect invocation!');\\n\",\n       \"\\t    return precision === undefined ? $toPrecision.call(that) : $toPrecision.call(that, precision);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 100 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.1 Number.EPSILON\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', { EPSILON: Math.pow(2, -52) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 101 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.2 Number.isFinite(number)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar _isFinite = __webpack_require__(11).isFinite;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', {\\n\",\n       \"\\t  isFinite: function isFinite(it) {\\n\",\n       \"\\t    return typeof it == 'number' && _isFinite(it);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 102 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.3 Number.isInteger(number)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', { isInteger: __webpack_require__(103) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 103 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.3 Number.isInteger(number)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar floor = Math.floor;\\n\",\n       \"\\tmodule.exports = function isInteger(it) {\\n\",\n       \"\\t  return !isObject(it) && isFinite(it) && floor(it) === it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 104 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.4 Number.isNaN(number)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', {\\n\",\n       \"\\t  isNaN: function isNaN(number) {\\n\",\n       \"\\t    // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t    return number != number;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 105 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.5 Number.isSafeInteger(number)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar isInteger = __webpack_require__(103);\\n\",\n       \"\\tvar abs = Math.abs;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', {\\n\",\n       \"\\t  isSafeInteger: function isSafeInteger(number) {\\n\",\n       \"\\t    return isInteger(number) && abs(number) <= 0x1fffffffffffff;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 106 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.6 Number.MAX_SAFE_INTEGER\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', { MAX_SAFE_INTEGER: 0x1fffffffffffff });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 107 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.1.2.10 Number.MIN_SAFE_INTEGER\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Number', { MIN_SAFE_INTEGER: -0x1fffffffffffff });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 108 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $parseFloat = __webpack_require__(93);\\n\",\n       \"\\t// 20.1.2.12 Number.parseFloat(string)\\n\",\n       \"\\t$export($export.S + $export.F * (Number.parseFloat != $parseFloat), 'Number', { parseFloat: $parseFloat });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 109 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $parseInt = __webpack_require__(89);\\n\",\n       \"\\t// 20.1.2.13 Number.parseInt(string, radix)\\n\",\n       \"\\t$export($export.S + $export.F * (Number.parseInt != $parseInt), 'Number', { parseInt: $parseInt });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 110 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.3 Math.acosh(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar log1p = __webpack_require__(111);\\n\",\n       \"\\tvar sqrt = Math.sqrt;\\n\",\n       \"\\tvar $acosh = Math.acosh;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * !($acosh\\n\",\n       \"\\t  // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509\\n\",\n       \"\\t  && Math.floor($acosh(Number.MAX_VALUE)) == 710\\n\",\n       \"\\t  // Tor Browser bug: Math.acosh(Infinity) -> NaN\\n\",\n       \"\\t  && $acosh(Infinity) == Infinity\\n\",\n       \"\\t), 'Math', {\\n\",\n       \"\\t  acosh: function acosh(x) {\\n\",\n       \"\\t    return (x = +x) < 1 ? NaN : x > 94906265.62425156\\n\",\n       \"\\t      ? Math.log(x) + Math.LN2\\n\",\n       \"\\t      : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 111 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.20 Math.log1p(x)\\n\",\n       \"\\tmodule.exports = Math.log1p || function log1p(x) {\\n\",\n       \"\\t  return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : Math.log(1 + x);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 112 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.5 Math.asinh(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $asinh = Math.asinh;\\n\",\n       \"\\t\\n\",\n       \"\\tfunction asinh(x) {\\n\",\n       \"\\t  return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : Math.log(x + Math.sqrt(x * x + 1));\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t// Tor Browser bug: Math.asinh(0) -> -0\\n\",\n       \"\\t$export($export.S + $export.F * !($asinh && 1 / $asinh(0) > 0), 'Math', { asinh: asinh });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 113 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.7 Math.atanh(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $atanh = Math.atanh;\\n\",\n       \"\\t\\n\",\n       \"\\t// Tor Browser bug: Math.atanh(-0) -> 0\\n\",\n       \"\\t$export($export.S + $export.F * !($atanh && 1 / $atanh(-0) < 0), 'Math', {\\n\",\n       \"\\t  atanh: function atanh(x) {\\n\",\n       \"\\t    return (x = +x) == 0 ? x : Math.log((1 + x) / (1 - x)) / 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 114 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.9 Math.cbrt(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar sign = __webpack_require__(115);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  cbrt: function cbrt(x) {\\n\",\n       \"\\t    return sign(x = +x) * Math.pow(Math.abs(x), 1 / 3);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 115 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.28 Math.sign(x)\\n\",\n       \"\\tmodule.exports = Math.sign || function sign(x) {\\n\",\n       \"\\t  // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t  return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 116 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.11 Math.clz32(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  clz32: function clz32(x) {\\n\",\n       \"\\t    return (x >>>= 0) ? 31 - Math.floor(Math.log(x + 0.5) * Math.LOG2E) : 32;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 117 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.12 Math.cosh(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar exp = Math.exp;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  cosh: function cosh(x) {\\n\",\n       \"\\t    return (exp(x = +x) + exp(-x)) / 2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 118 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.14 Math.expm1(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $expm1 = __webpack_require__(119);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * ($expm1 != Math.expm1), 'Math', { expm1: $expm1 });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 119 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.14 Math.expm1(x)\\n\",\n       \"\\tvar $expm1 = Math.expm1;\\n\",\n       \"\\tmodule.exports = (!$expm1\\n\",\n       \"\\t  // Old FF bug\\n\",\n       \"\\t  || $expm1(10) > 22025.465794806719 || $expm1(10) < 22025.4657948067165168\\n\",\n       \"\\t  // Tor Browser bug\\n\",\n       \"\\t  || $expm1(-2e-17) != -2e-17\\n\",\n       \"\\t) ? function expm1(x) {\\n\",\n       \"\\t  return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : Math.exp(x) - 1;\\n\",\n       \"\\t} : $expm1;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 120 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.16 Math.fround(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { fround: __webpack_require__(121) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 121 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.16 Math.fround(x)\\n\",\n       \"\\tvar sign = __webpack_require__(115);\\n\",\n       \"\\tvar pow = Math.pow;\\n\",\n       \"\\tvar EPSILON = pow(2, -52);\\n\",\n       \"\\tvar EPSILON32 = pow(2, -23);\\n\",\n       \"\\tvar MAX32 = pow(2, 127) * (2 - EPSILON32);\\n\",\n       \"\\tvar MIN32 = pow(2, -126);\\n\",\n       \"\\t\\n\",\n       \"\\tvar roundTiesToEven = function (n) {\\n\",\n       \"\\t  return n + 1 / EPSILON - 1 / EPSILON;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = Math.fround || function fround(x) {\\n\",\n       \"\\t  var $abs = Math.abs(x);\\n\",\n       \"\\t  var $sign = sign(x);\\n\",\n       \"\\t  var a, result;\\n\",\n       \"\\t  if ($abs < MIN32) return $sign * roundTiesToEven($abs / MIN32 / EPSILON32) * MIN32 * EPSILON32;\\n\",\n       \"\\t  a = (1 + EPSILON32 / EPSILON) * $abs;\\n\",\n       \"\\t  result = a - (a - $abs);\\n\",\n       \"\\t  // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t  if (result > MAX32 || result != result) return $sign * Infinity;\\n\",\n       \"\\t  return $sign * result;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 122 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.17 Math.hypot([value1[, value2[, … ]]])\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar abs = Math.abs;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  hypot: function hypot(value1, value2) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t    var sum = 0;\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    var aLen = arguments.length;\\n\",\n       \"\\t    var larg = 0;\\n\",\n       \"\\t    var arg, div;\\n\",\n       \"\\t    while (i < aLen) {\\n\",\n       \"\\t      arg = abs(arguments[i++]);\\n\",\n       \"\\t      if (larg < arg) {\\n\",\n       \"\\t        div = larg / arg;\\n\",\n       \"\\t        sum = sum * div * div + 1;\\n\",\n       \"\\t        larg = arg;\\n\",\n       \"\\t      } else if (arg > 0) {\\n\",\n       \"\\t        div = arg / larg;\\n\",\n       \"\\t        sum += div * div;\\n\",\n       \"\\t      } else sum += arg;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return larg === Infinity ? Infinity : larg * Math.sqrt(sum);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 123 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.18 Math.imul(x, y)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $imul = Math.imul;\\n\",\n       \"\\t\\n\",\n       \"\\t// some WebKit versions fails with big numbers, some has wrong arity\\n\",\n       \"\\t$export($export.S + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  return $imul(0xffffffff, 5) != -5 || $imul.length != 2;\\n\",\n       \"\\t}), 'Math', {\\n\",\n       \"\\t  imul: function imul(x, y) {\\n\",\n       \"\\t    var UINT16 = 0xffff;\\n\",\n       \"\\t    var xn = +x;\\n\",\n       \"\\t    var yn = +y;\\n\",\n       \"\\t    var xl = UINT16 & xn;\\n\",\n       \"\\t    var yl = UINT16 & yn;\\n\",\n       \"\\t    return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 124 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.21 Math.log10(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  log10: function log10(x) {\\n\",\n       \"\\t    return Math.log(x) * Math.LOG10E;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 125 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.20 Math.log1p(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { log1p: __webpack_require__(111) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 126 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.22 Math.log2(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  log2: function log2(x) {\\n\",\n       \"\\t    return Math.log(x) / Math.LN2;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 127 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.28 Math.sign(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { sign: __webpack_require__(115) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 128 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.30 Math.sinh(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar expm1 = __webpack_require__(119);\\n\",\n       \"\\tvar exp = Math.exp;\\n\",\n       \"\\t\\n\",\n       \"\\t// V8 near Chromium 38 has a problem with very small numbers\\n\",\n       \"\\t$export($export.S + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  return !Math.sinh(-2e-17) != -2e-17;\\n\",\n       \"\\t}), 'Math', {\\n\",\n       \"\\t  sinh: function sinh(x) {\\n\",\n       \"\\t    return Math.abs(x = +x) < 1\\n\",\n       \"\\t      ? (expm1(x) - expm1(-x)) / 2\\n\",\n       \"\\t      : (exp(x - 1) - exp(-x - 1)) * (Math.E / 2);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 129 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.33 Math.tanh(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar expm1 = __webpack_require__(119);\\n\",\n       \"\\tvar exp = Math.exp;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  tanh: function tanh(x) {\\n\",\n       \"\\t    var a = expm1(x = +x);\\n\",\n       \"\\t    var b = expm1(-x);\\n\",\n       \"\\t    return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 130 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.2.2.34 Math.trunc(x)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  trunc: function trunc(it) {\\n\",\n       \"\\t    return (it > 0 ? Math.floor : Math.ceil)(it);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 131 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\tvar fromCharCode = String.fromCharCode;\\n\",\n       \"\\tvar $fromCodePoint = String.fromCodePoint;\\n\",\n       \"\\t\\n\",\n       \"\\t// length should be 1, old FF problem\\n\",\n       \"\\t$export($export.S + $export.F * (!!$fromCodePoint && $fromCodePoint.length != 1), 'String', {\\n\",\n       \"\\t  // 21.1.2.2 String.fromCodePoint(...codePoints)\\n\",\n       \"\\t  fromCodePoint: function fromCodePoint(x) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t    var res = [];\\n\",\n       \"\\t    var aLen = arguments.length;\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    var code;\\n\",\n       \"\\t    while (aLen > i) {\\n\",\n       \"\\t      code = +arguments[i++];\\n\",\n       \"\\t      if (toAbsoluteIndex(code, 0x10ffff) !== code) throw RangeError(code + ' is not a valid code point');\\n\",\n       \"\\t      res.push(code < 0x10000\\n\",\n       \"\\t        ? fromCharCode(code)\\n\",\n       \"\\t        : fromCharCode(((code -= 0x10000) >> 10) + 0xd800, code % 0x400 + 0xdc00)\\n\",\n       \"\\t      );\\n\",\n       \"\\t    } return res.join('');\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 132 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'String', {\\n\",\n       \"\\t  // 21.1.2.4 String.raw(callSite, ...substitutions)\\n\",\n       \"\\t  raw: function raw(callSite) {\\n\",\n       \"\\t    var tpl = toIObject(callSite.raw);\\n\",\n       \"\\t    var len = toLength(tpl.length);\\n\",\n       \"\\t    var aLen = arguments.length;\\n\",\n       \"\\t    var res = [];\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    while (len > i) {\\n\",\n       \"\\t      res.push(String(tpl[i++]));\\n\",\n       \"\\t      if (i < aLen) res.push(String(arguments[i]));\\n\",\n       \"\\t    } return res.join('');\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 133 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 21.1.3.25 String.prototype.trim()\\n\",\n       \"\\t__webpack_require__(90)('trim', function ($trim) {\\n\",\n       \"\\t  return function trim() {\\n\",\n       \"\\t    return $trim(this, 3);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 134 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $at = __webpack_require__(135)(true);\\n\",\n       \"\\t\\n\",\n       \"\\t// 21.1.3.27 String.prototype[@@iterator]()\\n\",\n       \"\\t__webpack_require__(136)(String, 'String', function (iterated) {\\n\",\n       \"\\t  this._t = String(iterated); // target\\n\",\n       \"\\t  this._i = 0;                // next index\\n\",\n       \"\\t// 21.1.5.2.1 %StringIteratorPrototype%.next()\\n\",\n       \"\\t}, function () {\\n\",\n       \"\\t  var O = this._t;\\n\",\n       \"\\t  var index = this._i;\\n\",\n       \"\\t  var point;\\n\",\n       \"\\t  if (index >= O.length) return { value: undefined, done: true };\\n\",\n       \"\\t  point = $at(O, index);\\n\",\n       \"\\t  this._i += point.length;\\n\",\n       \"\\t  return { value: point, done: false };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 135 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\t// true  -> String#at\\n\",\n       \"\\t// false -> String#codePointAt\\n\",\n       \"\\tmodule.exports = function (TO_STRING) {\\n\",\n       \"\\t  return function (that, pos) {\\n\",\n       \"\\t    var s = String(defined(that));\\n\",\n       \"\\t    var i = toInteger(pos);\\n\",\n       \"\\t    var l = s.length;\\n\",\n       \"\\t    var a, b;\\n\",\n       \"\\t    if (i < 0 || i >= l) return TO_STRING ? '' : undefined;\\n\",\n       \"\\t    a = s.charCodeAt(i);\\n\",\n       \"\\t    return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff\\n\",\n       \"\\t      ? TO_STRING ? s.charAt(i) : a\\n\",\n       \"\\t      : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000;\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 136 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar LIBRARY = __webpack_require__(29);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar Iterators = __webpack_require__(137);\\n\",\n       \"\\tvar $iterCreate = __webpack_require__(138);\\n\",\n       \"\\tvar setToStringTag = __webpack_require__(33);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar ITERATOR = __webpack_require__(34)('iterator');\\n\",\n       \"\\tvar BUGGY = !([].keys && 'next' in [].keys()); // Safari has buggy iterators w/o `next`\\n\",\n       \"\\tvar FF_ITERATOR = '@@iterator';\\n\",\n       \"\\tvar KEYS = 'keys';\\n\",\n       \"\\tvar VALUES = 'values';\\n\",\n       \"\\t\\n\",\n       \"\\tvar returnThis = function () { return this; };\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED) {\\n\",\n       \"\\t  $iterCreate(Constructor, NAME, next);\\n\",\n       \"\\t  var getMethod = function (kind) {\\n\",\n       \"\\t    if (!BUGGY && kind in proto) return proto[kind];\\n\",\n       \"\\t    switch (kind) {\\n\",\n       \"\\t      case KEYS: return function keys() { return new Constructor(this, kind); };\\n\",\n       \"\\t      case VALUES: return function values() { return new Constructor(this, kind); };\\n\",\n       \"\\t    } return function entries() { return new Constructor(this, kind); };\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var TAG = NAME + ' Iterator';\\n\",\n       \"\\t  var DEF_VALUES = DEFAULT == VALUES;\\n\",\n       \"\\t  var VALUES_BUG = false;\\n\",\n       \"\\t  var proto = Base.prototype;\\n\",\n       \"\\t  var $native = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT];\\n\",\n       \"\\t  var $default = $native || getMethod(DEFAULT);\\n\",\n       \"\\t  var $entries = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined;\\n\",\n       \"\\t  var $anyNative = NAME == 'Array' ? proto.entries || $native : $native;\\n\",\n       \"\\t  var methods, key, IteratorPrototype;\\n\",\n       \"\\t  // Fix native\\n\",\n       \"\\t  if ($anyNative) {\\n\",\n       \"\\t    IteratorPrototype = getPrototypeOf($anyNative.call(new Base()));\\n\",\n       \"\\t    if (IteratorPrototype !== Object.prototype && IteratorPrototype.next) {\\n\",\n       \"\\t      // Set @@toStringTag to native iterators\\n\",\n       \"\\t      setToStringTag(IteratorPrototype, TAG, true);\\n\",\n       \"\\t      // fix for some old engines\\n\",\n       \"\\t      if (!LIBRARY && typeof IteratorPrototype[ITERATOR] != 'function') hide(IteratorPrototype, ITERATOR, returnThis);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  // fix Array#{values, @@iterator}.name in V8 / FF\\n\",\n       \"\\t  if (DEF_VALUES && $native && $native.name !== VALUES) {\\n\",\n       \"\\t    VALUES_BUG = true;\\n\",\n       \"\\t    $default = function values() { return $native.call(this); };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  // Define iterator\\n\",\n       \"\\t  if ((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])) {\\n\",\n       \"\\t    hide(proto, ITERATOR, $default);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  // Plug for library\\n\",\n       \"\\t  Iterators[NAME] = $default;\\n\",\n       \"\\t  Iterators[TAG] = returnThis;\\n\",\n       \"\\t  if (DEFAULT) {\\n\",\n       \"\\t    methods = {\\n\",\n       \"\\t      values: DEF_VALUES ? $default : getMethod(VALUES),\\n\",\n       \"\\t      keys: IS_SET ? $default : getMethod(KEYS),\\n\",\n       \"\\t      entries: $entries\\n\",\n       \"\\t    };\\n\",\n       \"\\t    if (FORCED) for (key in methods) {\\n\",\n       \"\\t      if (!(key in proto)) redefine(proto, key, methods[key]);\\n\",\n       \"\\t    } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return methods;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 137 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = {};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 138 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar create = __webpack_require__(53);\\n\",\n       \"\\tvar descriptor = __webpack_require__(24);\\n\",\n       \"\\tvar setToStringTag = __webpack_require__(33);\\n\",\n       \"\\tvar IteratorPrototype = {};\\n\",\n       \"\\t\\n\",\n       \"\\t// 25.1.2.1.1 %IteratorPrototype%[@@iterator]()\\n\",\n       \"\\t__webpack_require__(17)(IteratorPrototype, __webpack_require__(34)('iterator'), function () { return this; });\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (Constructor, NAME, next) {\\n\",\n       \"\\t  Constructor.prototype = create(IteratorPrototype, { next: descriptor(1, next) });\\n\",\n       \"\\t  setToStringTag(Constructor, NAME + ' Iterator');\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 139 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $at = __webpack_require__(135)(false);\\n\",\n       \"\\t$export($export.P, 'String', {\\n\",\n       \"\\t  // 21.1.3.3 String.prototype.codePointAt(pos)\\n\",\n       \"\\t  codePointAt: function codePointAt(pos) {\\n\",\n       \"\\t    return $at(this, pos);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 140 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 21.1.3.6 String.prototype.endsWith(searchString [, endPosition])\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar context = __webpack_require__(141);\\n\",\n       \"\\tvar ENDS_WITH = 'endsWith';\\n\",\n       \"\\tvar $endsWith = ''[ENDS_WITH];\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * __webpack_require__(143)(ENDS_WITH), 'String', {\\n\",\n       \"\\t  endsWith: function endsWith(searchString /* , endPosition = @length */) {\\n\",\n       \"\\t    var that = context(this, searchString, ENDS_WITH);\\n\",\n       \"\\t    var endPosition = arguments.length > 1 ? arguments[1] : undefined;\\n\",\n       \"\\t    var len = toLength(that.length);\\n\",\n       \"\\t    var end = endPosition === undefined ? len : Math.min(toLength(endPosition), len);\\n\",\n       \"\\t    var search = String(searchString);\\n\",\n       \"\\t    return $endsWith\\n\",\n       \"\\t      ? $endsWith.call(that, search, end)\\n\",\n       \"\\t      : that.slice(end - search.length, end) === search;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 141 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// helper for String#{startsWith, endsWith, includes}\\n\",\n       \"\\tvar isRegExp = __webpack_require__(142);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (that, searchString, NAME) {\\n\",\n       \"\\t  if (isRegExp(searchString)) throw TypeError('String#' + NAME + \\\" doesn't accept regex!\\\");\\n\",\n       \"\\t  return String(defined(that));\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 142 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 7.2.8 IsRegExp(argument)\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\tvar MATCH = __webpack_require__(34)('match');\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  var isRegExp;\\n\",\n       \"\\t  return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : cof(it) == 'RegExp');\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 143 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar MATCH = __webpack_require__(34)('match');\\n\",\n       \"\\tmodule.exports = function (KEY) {\\n\",\n       \"\\t  var re = /./;\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    '/./'[KEY](re);\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      re[MATCH] = false;\\n\",\n       \"\\t      return !'/./'[KEY](re);\\n\",\n       \"\\t    } catch (f) { /* empty */ }\\n\",\n       \"\\t  } return true;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 144 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 21.1.3.7 String.prototype.includes(searchString, position = 0)\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar context = __webpack_require__(141);\\n\",\n       \"\\tvar INCLUDES = 'includes';\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * __webpack_require__(143)(INCLUDES), 'String', {\\n\",\n       \"\\t  includes: function includes(searchString /* , position = 0 */) {\\n\",\n       \"\\t    return !!~context(this, searchString, INCLUDES)\\n\",\n       \"\\t      .indexOf(searchString, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 145 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'String', {\\n\",\n       \"\\t  // 21.1.3.13 String.prototype.repeat(count)\\n\",\n       \"\\t  repeat: __webpack_require__(98)\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 146 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 21.1.3.18 String.prototype.startsWith(searchString [, position ])\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar context = __webpack_require__(141);\\n\",\n       \"\\tvar STARTS_WITH = 'startsWith';\\n\",\n       \"\\tvar $startsWith = ''[STARTS_WITH];\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * __webpack_require__(143)(STARTS_WITH), 'String', {\\n\",\n       \"\\t  startsWith: function startsWith(searchString /* , position = 0 */) {\\n\",\n       \"\\t    var that = context(this, searchString, STARTS_WITH);\\n\",\n       \"\\t    var index = toLength(Math.min(arguments.length > 1 ? arguments[1] : undefined, that.length));\\n\",\n       \"\\t    var search = String(searchString);\\n\",\n       \"\\t    return $startsWith\\n\",\n       \"\\t      ? $startsWith.call(that, search, index)\\n\",\n       \"\\t      : that.slice(index, index + search.length) === search;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 147 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.2 String.prototype.anchor(name)\\n\",\n       \"\\t__webpack_require__(148)('anchor', function (createHTML) {\\n\",\n       \"\\t  return function anchor(name) {\\n\",\n       \"\\t    return createHTML(this, 'a', 'name', name);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 148 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\tvar quot = /\\\"/g;\\n\",\n       \"\\t// B.2.3.2.1 CreateHTML(string, tag, attribute, value)\\n\",\n       \"\\tvar createHTML = function (string, tag, attribute, value) {\\n\",\n       \"\\t  var S = String(defined(string));\\n\",\n       \"\\t  var p1 = '<' + tag;\\n\",\n       \"\\t  if (attribute !== '') p1 += ' ' + attribute + '=\\\"' + String(value).replace(quot, '&quot;') + '\\\"';\\n\",\n       \"\\t  return p1 + '>' + S + '</' + tag + '>';\\n\",\n       \"\\t};\\n\",\n       \"\\tmodule.exports = function (NAME, exec) {\\n\",\n       \"\\t  var O = {};\\n\",\n       \"\\t  O[NAME] = exec(createHTML);\\n\",\n       \"\\t  $export($export.P + $export.F * fails(function () {\\n\",\n       \"\\t    var test = ''[NAME]('\\\"');\\n\",\n       \"\\t    return test !== test.toLowerCase() || test.split('\\\"').length > 3;\\n\",\n       \"\\t  }), 'String', O);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 149 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.3 String.prototype.big()\\n\",\n       \"\\t__webpack_require__(148)('big', function (createHTML) {\\n\",\n       \"\\t  return function big() {\\n\",\n       \"\\t    return createHTML(this, 'big', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 150 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.4 String.prototype.blink()\\n\",\n       \"\\t__webpack_require__(148)('blink', function (createHTML) {\\n\",\n       \"\\t  return function blink() {\\n\",\n       \"\\t    return createHTML(this, 'blink', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 151 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.5 String.prototype.bold()\\n\",\n       \"\\t__webpack_require__(148)('bold', function (createHTML) {\\n\",\n       \"\\t  return function bold() {\\n\",\n       \"\\t    return createHTML(this, 'b', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 152 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.6 String.prototype.fixed()\\n\",\n       \"\\t__webpack_require__(148)('fixed', function (createHTML) {\\n\",\n       \"\\t  return function fixed() {\\n\",\n       \"\\t    return createHTML(this, 'tt', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 153 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.7 String.prototype.fontcolor(color)\\n\",\n       \"\\t__webpack_require__(148)('fontcolor', function (createHTML) {\\n\",\n       \"\\t  return function fontcolor(color) {\\n\",\n       \"\\t    return createHTML(this, 'font', 'color', color);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 154 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.8 String.prototype.fontsize(size)\\n\",\n       \"\\t__webpack_require__(148)('fontsize', function (createHTML) {\\n\",\n       \"\\t  return function fontsize(size) {\\n\",\n       \"\\t    return createHTML(this, 'font', 'size', size);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 155 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.9 String.prototype.italics()\\n\",\n       \"\\t__webpack_require__(148)('italics', function (createHTML) {\\n\",\n       \"\\t  return function italics() {\\n\",\n       \"\\t    return createHTML(this, 'i', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 156 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.10 String.prototype.link(url)\\n\",\n       \"\\t__webpack_require__(148)('link', function (createHTML) {\\n\",\n       \"\\t  return function link(url) {\\n\",\n       \"\\t    return createHTML(this, 'a', 'href', url);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 157 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.11 String.prototype.small()\\n\",\n       \"\\t__webpack_require__(148)('small', function (createHTML) {\\n\",\n       \"\\t  return function small() {\\n\",\n       \"\\t    return createHTML(this, 'small', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 158 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.12 String.prototype.strike()\\n\",\n       \"\\t__webpack_require__(148)('strike', function (createHTML) {\\n\",\n       \"\\t  return function strike() {\\n\",\n       \"\\t    return createHTML(this, 'strike', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 159 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.13 String.prototype.sub()\\n\",\n       \"\\t__webpack_require__(148)('sub', function (createHTML) {\\n\",\n       \"\\t  return function sub() {\\n\",\n       \"\\t    return createHTML(this, 'sub', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 160 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// B.2.3.14 String.prototype.sup()\\n\",\n       \"\\t__webpack_require__(148)('sup', function (createHTML) {\\n\",\n       \"\\t  return function sup() {\\n\",\n       \"\\t    return createHTML(this, 'sup', '', '');\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 161 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.3.3.1 / 15.9.4.4 Date.now()\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Date', { now: function () { return new Date().getTime(); } });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 162 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  return new Date(NaN).toJSON() !== null\\n\",\n       \"\\t    || Date.prototype.toJSON.call({ toISOString: function () { return 1; } }) !== 1;\\n\",\n       \"\\t}), 'Date', {\\n\",\n       \"\\t  // eslint-disable-next-line no-unused-vars\\n\",\n       \"\\t  toJSON: function toJSON(key) {\\n\",\n       \"\\t    var O = toObject(this);\\n\",\n       \"\\t    var pv = toPrimitive(O);\\n\",\n       \"\\t    return typeof pv == 'number' && !isFinite(pv) ? null : O.toISOString();\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 163 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toISOString = __webpack_require__(164);\\n\",\n       \"\\t\\n\",\n       \"\\t// PhantomJS / old WebKit has a broken implementations\\n\",\n       \"\\t$export($export.P + $export.F * (Date.prototype.toISOString !== toISOString), 'Date', {\\n\",\n       \"\\t  toISOString: toISOString\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 164 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString()\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar getTime = Date.prototype.getTime;\\n\",\n       \"\\tvar $toISOString = Date.prototype.toISOString;\\n\",\n       \"\\t\\n\",\n       \"\\tvar lz = function (num) {\\n\",\n       \"\\t  return num > 9 ? num : '0' + num;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// PhantomJS / old WebKit has a broken implementations\\n\",\n       \"\\tmodule.exports = (fails(function () {\\n\",\n       \"\\t  return $toISOString.call(new Date(-5e13 - 1)) != '0385-07-25T07:06:39.999Z';\\n\",\n       \"\\t}) || !fails(function () {\\n\",\n       \"\\t  $toISOString.call(new Date(NaN));\\n\",\n       \"\\t})) ? function toISOString() {\\n\",\n       \"\\t  if (!isFinite(getTime.call(this))) throw RangeError('Invalid time value');\\n\",\n       \"\\t  var d = this;\\n\",\n       \"\\t  var y = d.getUTCFullYear();\\n\",\n       \"\\t  var m = d.getUTCMilliseconds();\\n\",\n       \"\\t  var s = y < 0 ? '-' : y > 9999 ? '+' : '';\\n\",\n       \"\\t  return s + ('00000' + Math.abs(y)).slice(s ? -6 : -4) +\\n\",\n       \"\\t    '-' + lz(d.getUTCMonth() + 1) + '-' + lz(d.getUTCDate()) +\\n\",\n       \"\\t    'T' + lz(d.getUTCHours()) + ':' + lz(d.getUTCMinutes()) +\\n\",\n       \"\\t    ':' + lz(d.getUTCSeconds()) + '.' + (m > 99 ? m : '0' + lz(m)) + 'Z';\\n\",\n       \"\\t} : $toISOString;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 165 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar DateProto = Date.prototype;\\n\",\n       \"\\tvar INVALID_DATE = 'Invalid Date';\\n\",\n       \"\\tvar TO_STRING = 'toString';\\n\",\n       \"\\tvar $toString = DateProto[TO_STRING];\\n\",\n       \"\\tvar getTime = DateProto.getTime;\\n\",\n       \"\\tif (new Date(NaN) + '' != INVALID_DATE) {\\n\",\n       \"\\t  __webpack_require__(25)(DateProto, TO_STRING, function toString() {\\n\",\n       \"\\t    var value = getTime.call(this);\\n\",\n       \"\\t    // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t    return value === value ? $toString.call(this) : INVALID_DATE;\\n\",\n       \"\\t  });\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 166 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar TO_PRIMITIVE = __webpack_require__(34)('toPrimitive');\\n\",\n       \"\\tvar proto = Date.prototype;\\n\",\n       \"\\t\\n\",\n       \"\\tif (!(TO_PRIMITIVE in proto)) __webpack_require__(17)(proto, TO_PRIMITIVE, __webpack_require__(167));\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 167 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar NUMBER = 'number';\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (hint) {\\n\",\n       \"\\t  if (hint !== 'string' && hint !== NUMBER && hint !== 'default') throw TypeError('Incorrect hint');\\n\",\n       \"\\t  return toPrimitive(anObject(this), hint != NUMBER);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 168 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 22.1.2.2 / 15.4.3.2 Array.isArray(arg)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Array', { isArray: __webpack_require__(52) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 169 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar call = __webpack_require__(170);\\n\",\n       \"\\tvar isArrayIter = __webpack_require__(171);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar createProperty = __webpack_require__(172);\\n\",\n       \"\\tvar getIterFn = __webpack_require__(173);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * !__webpack_require__(174)(function (iter) { Array.from(iter); }), 'Array', {\\n\",\n       \"\\t  // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)\\n\",\n       \"\\t  from: function from(arrayLike /* , mapfn = undefined, thisArg = undefined */) {\\n\",\n       \"\\t    var O = toObject(arrayLike);\\n\",\n       \"\\t    var C = typeof this == 'function' ? this : Array;\\n\",\n       \"\\t    var aLen = arguments.length;\\n\",\n       \"\\t    var mapfn = aLen > 1 ? arguments[1] : undefined;\\n\",\n       \"\\t    var mapping = mapfn !== undefined;\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    var iterFn = getIterFn(O);\\n\",\n       \"\\t    var length, result, step, iterator;\\n\",\n       \"\\t    if (mapping) mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2);\\n\",\n       \"\\t    // if object isn't iterable or it's array with default iterator - use simple case\\n\",\n       \"\\t    if (iterFn != undefined && !(C == Array && isArrayIter(iterFn))) {\\n\",\n       \"\\t      for (iterator = iterFn.call(O), result = new C(); !(step = iterator.next()).done; index++) {\\n\",\n       \"\\t        createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      length = toLength(O.length);\\n\",\n       \"\\t      for (result = new C(length); length > index; index++) {\\n\",\n       \"\\t        createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    result.length = index;\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 170 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// call something on iterator step with safe closing on error\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tmodule.exports = function (iterator, fn, value, entries) {\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    return entries ? fn(anObject(value)[0], value[1]) : fn(value);\\n\",\n       \"\\t  // 7.4.6 IteratorClose(iterator, completion)\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    var ret = iterator['return'];\\n\",\n       \"\\t    if (ret !== undefined) anObject(ret.call(iterator));\\n\",\n       \"\\t    throw e;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 171 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// check on default Array iterator\\n\",\n       \"\\tvar Iterators = __webpack_require__(137);\\n\",\n       \"\\tvar ITERATOR = __webpack_require__(34)('iterator');\\n\",\n       \"\\tvar ArrayProto = Array.prototype;\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 172 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $defineProperty = __webpack_require__(18);\\n\",\n       \"\\tvar createDesc = __webpack_require__(24);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (object, index, value) {\\n\",\n       \"\\t  if (index in object) $defineProperty.f(object, index, createDesc(0, value));\\n\",\n       \"\\t  else object[index] = value;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 173 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar classof = __webpack_require__(82);\\n\",\n       \"\\tvar ITERATOR = __webpack_require__(34)('iterator');\\n\",\n       \"\\tvar Iterators = __webpack_require__(137);\\n\",\n       \"\\tmodule.exports = __webpack_require__(16).getIteratorMethod = function (it) {\\n\",\n       \"\\t  if (it != undefined) return it[ITERATOR]\\n\",\n       \"\\t    || it['@@iterator']\\n\",\n       \"\\t    || Iterators[classof(it)];\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 174 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar ITERATOR = __webpack_require__(34)('iterator');\\n\",\n       \"\\tvar SAFE_CLOSING = false;\\n\",\n       \"\\t\\n\",\n       \"\\ttry {\\n\",\n       \"\\t  var riter = [7][ITERATOR]();\\n\",\n       \"\\t  riter['return'] = function () { SAFE_CLOSING = true; };\\n\",\n       \"\\t  // eslint-disable-next-line no-throw-literal\\n\",\n       \"\\t  Array.from(riter, function () { throw 2; });\\n\",\n       \"\\t} catch (e) { /* empty */ }\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (exec, skipClosing) {\\n\",\n       \"\\t  if (!skipClosing && !SAFE_CLOSING) return false;\\n\",\n       \"\\t  var safe = false;\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    var arr = [7];\\n\",\n       \"\\t    var iter = arr[ITERATOR]();\\n\",\n       \"\\t    iter.next = function () { return { done: safe = true }; };\\n\",\n       \"\\t    arr[ITERATOR] = function () { return iter; };\\n\",\n       \"\\t    exec(arr);\\n\",\n       \"\\t  } catch (e) { /* empty */ }\\n\",\n       \"\\t  return safe;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 175 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar createProperty = __webpack_require__(172);\\n\",\n       \"\\t\\n\",\n       \"\\t// WebKit Array.of isn't generic\\n\",\n       \"\\t$export($export.S + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  function F() { /* empty */ }\\n\",\n       \"\\t  return !(Array.of.call(F) instanceof F);\\n\",\n       \"\\t}), 'Array', {\\n\",\n       \"\\t  // 22.1.2.3 Array.of( ...items)\\n\",\n       \"\\t  of: function of(/* ...args */) {\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    var aLen = arguments.length;\\n\",\n       \"\\t    var result = new (typeof this == 'function' ? this : Array)(aLen);\\n\",\n       \"\\t    while (aLen > index) createProperty(result, index, arguments[index++]);\\n\",\n       \"\\t    result.length = aLen;\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 176 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 22.1.3.13 Array.prototype.join(separator)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar arrayJoin = [].join;\\n\",\n       \"\\t\\n\",\n       \"\\t// fallback for not array-like strings\\n\",\n       \"\\t$export($export.P + $export.F * (__webpack_require__(41) != Object || !__webpack_require__(177)(arrayJoin)), 'Array', {\\n\",\n       \"\\t  join: function join(separator) {\\n\",\n       \"\\t    return arrayJoin.call(toIObject(this), separator === undefined ? ',' : separator);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 177 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (method, arg) {\\n\",\n       \"\\t  return !!method && fails(function () {\\n\",\n       \"\\t    // eslint-disable-next-line no-useless-call\\n\",\n       \"\\t    arg ? method.call(null, function () { /* empty */ }, 1) : method.call(null);\\n\",\n       \"\\t  });\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 178 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar html = __webpack_require__(55);\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\tvar toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar arraySlice = [].slice;\\n\",\n       \"\\t\\n\",\n       \"\\t// fallback for not array-like ES3 strings and DOM objects\\n\",\n       \"\\t$export($export.P + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  if (html) arraySlice.call(html);\\n\",\n       \"\\t}), 'Array', {\\n\",\n       \"\\t  slice: function slice(begin, end) {\\n\",\n       \"\\t    var len = toLength(this.length);\\n\",\n       \"\\t    var klass = cof(this);\\n\",\n       \"\\t    end = end === undefined ? len : end;\\n\",\n       \"\\t    if (klass == 'Array') return arraySlice.call(this, begin, end);\\n\",\n       \"\\t    var start = toAbsoluteIndex(begin, len);\\n\",\n       \"\\t    var upTo = toAbsoluteIndex(end, len);\\n\",\n       \"\\t    var size = toLength(upTo - start);\\n\",\n       \"\\t    var cloned = new Array(size);\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    for (; i < size; i++) cloned[i] = klass == 'String'\\n\",\n       \"\\t      ? this.charAt(start + i)\\n\",\n       \"\\t      : this[start + i];\\n\",\n       \"\\t    return cloned;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 179 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar $sort = [].sort;\\n\",\n       \"\\tvar test = [1, 2, 3];\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * (fails(function () {\\n\",\n       \"\\t  // IE8-\\n\",\n       \"\\t  test.sort(undefined);\\n\",\n       \"\\t}) || !fails(function () {\\n\",\n       \"\\t  // V8 bug\\n\",\n       \"\\t  test.sort(null);\\n\",\n       \"\\t  // Old WebKit\\n\",\n       \"\\t}) || !__webpack_require__(177)($sort)), 'Array', {\\n\",\n       \"\\t  // 22.1.3.25 Array.prototype.sort(comparefn)\\n\",\n       \"\\t  sort: function sort(comparefn) {\\n\",\n       \"\\t    return comparefn === undefined\\n\",\n       \"\\t      ? $sort.call(toObject(this))\\n\",\n       \"\\t      : $sort.call(toObject(this), aFunction(comparefn));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 180 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $forEach = __webpack_require__(181)(0);\\n\",\n       \"\\tvar STRICT = __webpack_require__(177)([].forEach, true);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !STRICT, 'Array', {\\n\",\n       \"\\t  // 22.1.3.10 / 15.4.4.18 Array.prototype.forEach(callbackfn [, thisArg])\\n\",\n       \"\\t  forEach: function forEach(callbackfn /* , thisArg */) {\\n\",\n       \"\\t    return $forEach(this, callbackfn, arguments[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 181 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 0 -> Array#forEach\\n\",\n       \"\\t// 1 -> Array#map\\n\",\n       \"\\t// 2 -> Array#filter\\n\",\n       \"\\t// 3 -> Array#some\\n\",\n       \"\\t// 4 -> Array#every\\n\",\n       \"\\t// 5 -> Array#find\\n\",\n       \"\\t// 6 -> Array#findIndex\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar IObject = __webpack_require__(41);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar asc = __webpack_require__(182);\\n\",\n       \"\\tmodule.exports = function (TYPE, $create) {\\n\",\n       \"\\t  var IS_MAP = TYPE == 1;\\n\",\n       \"\\t  var IS_FILTER = TYPE == 2;\\n\",\n       \"\\t  var IS_SOME = TYPE == 3;\\n\",\n       \"\\t  var IS_EVERY = TYPE == 4;\\n\",\n       \"\\t  var IS_FIND_INDEX = TYPE == 6;\\n\",\n       \"\\t  var NO_HOLES = TYPE == 5 || IS_FIND_INDEX;\\n\",\n       \"\\t  var create = $create || asc;\\n\",\n       \"\\t  return function ($this, callbackfn, that) {\\n\",\n       \"\\t    var O = toObject($this);\\n\",\n       \"\\t    var self = IObject(O);\\n\",\n       \"\\t    var f = ctx(callbackfn, that, 3);\\n\",\n       \"\\t    var length = toLength(self.length);\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    var result = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined;\\n\",\n       \"\\t    var val, res;\\n\",\n       \"\\t    for (;length > index; index++) if (NO_HOLES || index in self) {\\n\",\n       \"\\t      val = self[index];\\n\",\n       \"\\t      res = f(val, index, O);\\n\",\n       \"\\t      if (TYPE) {\\n\",\n       \"\\t        if (IS_MAP) result[index] = res;   // map\\n\",\n       \"\\t        else if (res) switch (TYPE) {\\n\",\n       \"\\t          case 3: return true;             // some\\n\",\n       \"\\t          case 5: return val;              // find\\n\",\n       \"\\t          case 6: return index;            // findIndex\\n\",\n       \"\\t          case 2: result.push(val);        // filter\\n\",\n       \"\\t        } else if (IS_EVERY) return false; // every\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : result;\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 182 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 9.4.2.3 ArraySpeciesCreate(originalArray, length)\\n\",\n       \"\\tvar speciesConstructor = __webpack_require__(183);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (original, length) {\\n\",\n       \"\\t  return new (speciesConstructor(original))(length);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 183 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar isArray = __webpack_require__(52);\\n\",\n       \"\\tvar SPECIES = __webpack_require__(34)('species');\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (original) {\\n\",\n       \"\\t  var C;\\n\",\n       \"\\t  if (isArray(original)) {\\n\",\n       \"\\t    C = original.constructor;\\n\",\n       \"\\t    // cross-realm fallback\\n\",\n       \"\\t    if (typeof C == 'function' && (C === Array || isArray(C.prototype))) C = undefined;\\n\",\n       \"\\t    if (isObject(C)) {\\n\",\n       \"\\t      C = C[SPECIES];\\n\",\n       \"\\t      if (C === null) C = undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  } return C === undefined ? Array : C;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 184 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $map = __webpack_require__(181)(1);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !__webpack_require__(177)([].map, true), 'Array', {\\n\",\n       \"\\t  // 22.1.3.15 / 15.4.4.19 Array.prototype.map(callbackfn [, thisArg])\\n\",\n       \"\\t  map: function map(callbackfn /* , thisArg */) {\\n\",\n       \"\\t    return $map(this, callbackfn, arguments[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 185 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $filter = __webpack_require__(181)(2);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !__webpack_require__(177)([].filter, true), 'Array', {\\n\",\n       \"\\t  // 22.1.3.7 / 15.4.4.20 Array.prototype.filter(callbackfn [, thisArg])\\n\",\n       \"\\t  filter: function filter(callbackfn /* , thisArg */) {\\n\",\n       \"\\t    return $filter(this, callbackfn, arguments[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 186 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $some = __webpack_require__(181)(3);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !__webpack_require__(177)([].some, true), 'Array', {\\n\",\n       \"\\t  // 22.1.3.23 / 15.4.4.17 Array.prototype.some(callbackfn [, thisArg])\\n\",\n       \"\\t  some: function some(callbackfn /* , thisArg */) {\\n\",\n       \"\\t    return $some(this, callbackfn, arguments[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 187 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $every = __webpack_require__(181)(4);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !__webpack_require__(177)([].every, true), 'Array', {\\n\",\n       \"\\t  // 22.1.3.5 / 15.4.4.16 Array.prototype.every(callbackfn [, thisArg])\\n\",\n       \"\\t  every: function every(callbackfn /* , thisArg */) {\\n\",\n       \"\\t    return $every(this, callbackfn, arguments[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 188 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $reduce = __webpack_require__(189);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !__webpack_require__(177)([].reduce, true), 'Array', {\\n\",\n       \"\\t  // 22.1.3.18 / 15.4.4.21 Array.prototype.reduce(callbackfn [, initialValue])\\n\",\n       \"\\t  reduce: function reduce(callbackfn /* , initialValue */) {\\n\",\n       \"\\t    return $reduce(this, callbackfn, arguments.length, arguments[1], false);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 189 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar IObject = __webpack_require__(41);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (that, callbackfn, aLen, memo, isRight) {\\n\",\n       \"\\t  aFunction(callbackfn);\\n\",\n       \"\\t  var O = toObject(that);\\n\",\n       \"\\t  var self = IObject(O);\\n\",\n       \"\\t  var length = toLength(O.length);\\n\",\n       \"\\t  var index = isRight ? length - 1 : 0;\\n\",\n       \"\\t  var i = isRight ? -1 : 1;\\n\",\n       \"\\t  if (aLen < 2) for (;;) {\\n\",\n       \"\\t    if (index in self) {\\n\",\n       \"\\t      memo = self[index];\\n\",\n       \"\\t      index += i;\\n\",\n       \"\\t      break;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    index += i;\\n\",\n       \"\\t    if (isRight ? index < 0 : length <= index) {\\n\",\n       \"\\t      throw TypeError('Reduce of empty array with no initial value');\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  for (;isRight ? index >= 0 : length > index; index += i) if (index in self) {\\n\",\n       \"\\t    memo = callbackfn(memo, self[index], index, O);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return memo;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 190 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $reduce = __webpack_require__(189);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * !__webpack_require__(177)([].reduceRight, true), 'Array', {\\n\",\n       \"\\t  // 22.1.3.19 / 15.4.4.22 Array.prototype.reduceRight(callbackfn [, initialValue])\\n\",\n       \"\\t  reduceRight: function reduceRight(callbackfn /* , initialValue */) {\\n\",\n       \"\\t    return $reduce(this, callbackfn, arguments.length, arguments[1], true);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 191 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $indexOf = __webpack_require__(44)(false);\\n\",\n       \"\\tvar $native = [].indexOf;\\n\",\n       \"\\tvar NEGATIVE_ZERO = !!$native && 1 / [1].indexOf(1, -0) < 0;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * (NEGATIVE_ZERO || !__webpack_require__(177)($native)), 'Array', {\\n\",\n       \"\\t  // 22.1.3.11 / 15.4.4.14 Array.prototype.indexOf(searchElement [, fromIndex])\\n\",\n       \"\\t  indexOf: function indexOf(searchElement /* , fromIndex = 0 */) {\\n\",\n       \"\\t    return NEGATIVE_ZERO\\n\",\n       \"\\t      // convert -0 to +0\\n\",\n       \"\\t      ? $native.apply(this, arguments) || 0\\n\",\n       \"\\t      : $indexOf(this, searchElement, arguments[1]);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 192 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar $native = [].lastIndexOf;\\n\",\n       \"\\tvar NEGATIVE_ZERO = !!$native && 1 / [1].lastIndexOf(1, -0) < 0;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * (NEGATIVE_ZERO || !__webpack_require__(177)($native)), 'Array', {\\n\",\n       \"\\t  // 22.1.3.14 / 15.4.4.15 Array.prototype.lastIndexOf(searchElement [, fromIndex])\\n\",\n       \"\\t  lastIndexOf: function lastIndexOf(searchElement /* , fromIndex = @[*-1] */) {\\n\",\n       \"\\t    // convert -0 to +0\\n\",\n       \"\\t    if (NEGATIVE_ZERO) return $native.apply(this, arguments) || 0;\\n\",\n       \"\\t    var O = toIObject(this);\\n\",\n       \"\\t    var length = toLength(O.length);\\n\",\n       \"\\t    var index = length - 1;\\n\",\n       \"\\t    if (arguments.length > 1) index = Math.min(index, toInteger(arguments[1]));\\n\",\n       \"\\t    if (index < 0) index = length + index;\\n\",\n       \"\\t    for (;index >= 0; index--) if (index in O) if (O[index] === searchElement) return index || 0;\\n\",\n       \"\\t    return -1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 193 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'Array', { copyWithin: __webpack_require__(194) });\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(195)('copyWithin');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 194 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length)\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = [].copyWithin || function copyWithin(target /* = 0 */, start /* = 0, end = @length */) {\\n\",\n       \"\\t  var O = toObject(this);\\n\",\n       \"\\t  var len = toLength(O.length);\\n\",\n       \"\\t  var to = toAbsoluteIndex(target, len);\\n\",\n       \"\\t  var from = toAbsoluteIndex(start, len);\\n\",\n       \"\\t  var end = arguments.length > 2 ? arguments[2] : undefined;\\n\",\n       \"\\t  var count = Math.min((end === undefined ? len : toAbsoluteIndex(end, len)) - from, len - to);\\n\",\n       \"\\t  var inc = 1;\\n\",\n       \"\\t  if (from < to && to < from + count) {\\n\",\n       \"\\t    inc = -1;\\n\",\n       \"\\t    from += count - 1;\\n\",\n       \"\\t    to += count - 1;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  while (count-- > 0) {\\n\",\n       \"\\t    if (from in O) O[to] = O[from];\\n\",\n       \"\\t    else delete O[to];\\n\",\n       \"\\t    to += inc;\\n\",\n       \"\\t    from += inc;\\n\",\n       \"\\t  } return O;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 195 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 22.1.3.31 Array.prototype[@@unscopables]\\n\",\n       \"\\tvar UNSCOPABLES = __webpack_require__(34)('unscopables');\\n\",\n       \"\\tvar ArrayProto = Array.prototype;\\n\",\n       \"\\tif (ArrayProto[UNSCOPABLES] == undefined) __webpack_require__(17)(ArrayProto, UNSCOPABLES, {});\\n\",\n       \"\\tmodule.exports = function (key) {\\n\",\n       \"\\t  ArrayProto[UNSCOPABLES][key] = true;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 196 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'Array', { fill: __webpack_require__(197) });\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(195)('fill');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 197 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length)\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tmodule.exports = function fill(value /* , start = 0, end = @length */) {\\n\",\n       \"\\t  var O = toObject(this);\\n\",\n       \"\\t  var length = toLength(O.length);\\n\",\n       \"\\t  var aLen = arguments.length;\\n\",\n       \"\\t  var index = toAbsoluteIndex(aLen > 1 ? arguments[1] : undefined, length);\\n\",\n       \"\\t  var end = aLen > 2 ? arguments[2] : undefined;\\n\",\n       \"\\t  var endPos = end === undefined ? length : toAbsoluteIndex(end, length);\\n\",\n       \"\\t  while (endPos > index) O[index++] = value;\\n\",\n       \"\\t  return O;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 198 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 22.1.3.8 Array.prototype.find(predicate, thisArg = undefined)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $find = __webpack_require__(181)(5);\\n\",\n       \"\\tvar KEY = 'find';\\n\",\n       \"\\tvar forced = true;\\n\",\n       \"\\t// Shouldn't skip holes\\n\",\n       \"\\tif (KEY in []) Array(1)[KEY](function () { forced = false; });\\n\",\n       \"\\t$export($export.P + $export.F * forced, 'Array', {\\n\",\n       \"\\t  find: function find(callbackfn /* , that = undefined */) {\\n\",\n       \"\\t    return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t__webpack_require__(195)(KEY);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 199 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 22.1.3.9 Array.prototype.findIndex(predicate, thisArg = undefined)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $find = __webpack_require__(181)(6);\\n\",\n       \"\\tvar KEY = 'findIndex';\\n\",\n       \"\\tvar forced = true;\\n\",\n       \"\\t// Shouldn't skip holes\\n\",\n       \"\\tif (KEY in []) Array(1)[KEY](function () { forced = false; });\\n\",\n       \"\\t$export($export.P + $export.F * forced, 'Array', {\\n\",\n       \"\\t  findIndex: function findIndex(callbackfn /* , that = undefined */) {\\n\",\n       \"\\t    return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t__webpack_require__(195)(KEY);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 200 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(201)('Array');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 201 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar dP = __webpack_require__(18);\\n\",\n       \"\\tvar DESCRIPTORS = __webpack_require__(13);\\n\",\n       \"\\tvar SPECIES = __webpack_require__(34)('species');\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (KEY) {\\n\",\n       \"\\t  var C = global[KEY];\\n\",\n       \"\\t  if (DESCRIPTORS && C && !C[SPECIES]) dP.f(C, SPECIES, {\\n\",\n       \"\\t    configurable: true,\\n\",\n       \"\\t    get: function () { return this; }\\n\",\n       \"\\t  });\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 202 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar addToUnscopables = __webpack_require__(195);\\n\",\n       \"\\tvar step = __webpack_require__(203);\\n\",\n       \"\\tvar Iterators = __webpack_require__(137);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\t\\n\",\n       \"\\t// 22.1.3.4 Array.prototype.entries()\\n\",\n       \"\\t// 22.1.3.13 Array.prototype.keys()\\n\",\n       \"\\t// 22.1.3.29 Array.prototype.values()\\n\",\n       \"\\t// 22.1.3.30 Array.prototype[@@iterator]()\\n\",\n       \"\\tmodule.exports = __webpack_require__(136)(Array, 'Array', function (iterated, kind) {\\n\",\n       \"\\t  this._t = toIObject(iterated); // target\\n\",\n       \"\\t  this._i = 0;                   // next index\\n\",\n       \"\\t  this._k = kind;                // kind\\n\",\n       \"\\t// 22.1.5.2.1 %ArrayIteratorPrototype%.next()\\n\",\n       \"\\t}, function () {\\n\",\n       \"\\t  var O = this._t;\\n\",\n       \"\\t  var kind = this._k;\\n\",\n       \"\\t  var index = this._i++;\\n\",\n       \"\\t  if (!O || index >= O.length) {\\n\",\n       \"\\t    this._t = undefined;\\n\",\n       \"\\t    return step(1);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  if (kind == 'keys') return step(0, index);\\n\",\n       \"\\t  if (kind == 'values') return step(0, O[index]);\\n\",\n       \"\\t  return step(0, [index, O[index]]);\\n\",\n       \"\\t}, 'values');\\n\",\n       \"\\t\\n\",\n       \"\\t// argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7)\\n\",\n       \"\\tIterators.Arguments = Iterators.Array;\\n\",\n       \"\\t\\n\",\n       \"\\taddToUnscopables('keys');\\n\",\n       \"\\taddToUnscopables('values');\\n\",\n       \"\\taddToUnscopables('entries');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 203 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (done, value) {\\n\",\n       \"\\t  return { value: value, done: !!done };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 204 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar inheritIfRequired = __webpack_require__(95);\\n\",\n       \"\\tvar dP = __webpack_require__(18).f;\\n\",\n       \"\\tvar gOPN = __webpack_require__(57).f;\\n\",\n       \"\\tvar isRegExp = __webpack_require__(142);\\n\",\n       \"\\tvar $flags = __webpack_require__(205);\\n\",\n       \"\\tvar $RegExp = global.RegExp;\\n\",\n       \"\\tvar Base = $RegExp;\\n\",\n       \"\\tvar proto = $RegExp.prototype;\\n\",\n       \"\\tvar re1 = /a/g;\\n\",\n       \"\\tvar re2 = /a/g;\\n\",\n       \"\\t// \\\"new\\\" creates a new object, old webkit buggy here\\n\",\n       \"\\tvar CORRECT_NEW = new $RegExp(re1) !== re1;\\n\",\n       \"\\t\\n\",\n       \"\\tif (__webpack_require__(13) && (!CORRECT_NEW || __webpack_require__(14)(function () {\\n\",\n       \"\\t  re2[__webpack_require__(34)('match')] = false;\\n\",\n       \"\\t  // RegExp constructor can alter flags and IsRegExp works correct with @@match\\n\",\n       \"\\t  return $RegExp(re1) != re1 || $RegExp(re2) == re2 || $RegExp(re1, 'i') != '/a/i';\\n\",\n       \"\\t}))) {\\n\",\n       \"\\t  $RegExp = function RegExp(p, f) {\\n\",\n       \"\\t    var tiRE = this instanceof $RegExp;\\n\",\n       \"\\t    var piRE = isRegExp(p);\\n\",\n       \"\\t    var fiU = f === undefined;\\n\",\n       \"\\t    return !tiRE && piRE && p.constructor === $RegExp && fiU ? p\\n\",\n       \"\\t      : inheritIfRequired(CORRECT_NEW\\n\",\n       \"\\t        ? new Base(piRE && !fiU ? p.source : p, f)\\n\",\n       \"\\t        : Base((piRE = p instanceof $RegExp) ? p.source : p, piRE && fiU ? $flags.call(p) : f)\\n\",\n       \"\\t      , tiRE ? this : proto, $RegExp);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var proxy = function (key) {\\n\",\n       \"\\t    key in $RegExp || dP($RegExp, key, {\\n\",\n       \"\\t      configurable: true,\\n\",\n       \"\\t      get: function () { return Base[key]; },\\n\",\n       \"\\t      set: function (it) { Base[key] = it; }\\n\",\n       \"\\t    });\\n\",\n       \"\\t  };\\n\",\n       \"\\t  for (var keys = gOPN(Base), i = 0; keys.length > i;) proxy(keys[i++]);\\n\",\n       \"\\t  proto.constructor = $RegExp;\\n\",\n       \"\\t  $RegExp.prototype = proto;\\n\",\n       \"\\t  __webpack_require__(25)(global, 'RegExp', $RegExp);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(201)('RegExp');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 205 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 21.2.5.3 get RegExp.prototype.flags\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tmodule.exports = function () {\\n\",\n       \"\\t  var that = anObject(this);\\n\",\n       \"\\t  var result = '';\\n\",\n       \"\\t  if (that.global) result += 'g';\\n\",\n       \"\\t  if (that.ignoreCase) result += 'i';\\n\",\n       \"\\t  if (that.multiline) result += 'm';\\n\",\n       \"\\t  if (that.unicode) result += 'u';\\n\",\n       \"\\t  if (that.sticky) result += 'y';\\n\",\n       \"\\t  return result;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 206 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar regexpExec = __webpack_require__(207);\\n\",\n       \"\\t__webpack_require__(15)({\\n\",\n       \"\\t  target: 'RegExp',\\n\",\n       \"\\t  proto: true,\\n\",\n       \"\\t  forced: regexpExec !== /./.exec\\n\",\n       \"\\t}, {\\n\",\n       \"\\t  exec: regexpExec\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 207 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tvar regexpFlags = __webpack_require__(205);\\n\",\n       \"\\t\\n\",\n       \"\\tvar nativeExec = RegExp.prototype.exec;\\n\",\n       \"\\t// This always refers to the native implementation, because the\\n\",\n       \"\\t// String#replace polyfill uses ./fix-regexp-well-known-symbol-logic.js,\\n\",\n       \"\\t// which loads this file before patching the method.\\n\",\n       \"\\tvar nativeReplace = String.prototype.replace;\\n\",\n       \"\\t\\n\",\n       \"\\tvar patchedExec = nativeExec;\\n\",\n       \"\\t\\n\",\n       \"\\tvar LAST_INDEX = 'lastIndex';\\n\",\n       \"\\t\\n\",\n       \"\\tvar UPDATES_LAST_INDEX_WRONG = (function () {\\n\",\n       \"\\t  var re1 = /a/,\\n\",\n       \"\\t      re2 = /b*/g;\\n\",\n       \"\\t  nativeExec.call(re1, 'a');\\n\",\n       \"\\t  nativeExec.call(re2, 'a');\\n\",\n       \"\\t  return re1[LAST_INDEX] !== 0 || re2[LAST_INDEX] !== 0;\\n\",\n       \"\\t})();\\n\",\n       \"\\t\\n\",\n       \"\\t// nonparticipating capturing group, copied from es5-shim's String#split patch.\\n\",\n       \"\\tvar NPCG_INCLUDED = /()??/.exec('')[1] !== undefined;\\n\",\n       \"\\t\\n\",\n       \"\\tvar PATCH = UPDATES_LAST_INDEX_WRONG || NPCG_INCLUDED;\\n\",\n       \"\\t\\n\",\n       \"\\tif (PATCH) {\\n\",\n       \"\\t  patchedExec = function exec(str) {\\n\",\n       \"\\t    var re = this;\\n\",\n       \"\\t    var lastIndex, reCopy, match, i;\\n\",\n       \"\\t\\n\",\n       \"\\t    if (NPCG_INCLUDED) {\\n\",\n       \"\\t      reCopy = new RegExp('^' + re.source + '$(?!\\\\\\\\s)', regexpFlags.call(re));\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (UPDATES_LAST_INDEX_WRONG) lastIndex = re[LAST_INDEX];\\n\",\n       \"\\t\\n\",\n       \"\\t    match = nativeExec.call(re, str);\\n\",\n       \"\\t\\n\",\n       \"\\t    if (UPDATES_LAST_INDEX_WRONG && match) {\\n\",\n       \"\\t      re[LAST_INDEX] = re.global ? match.index + match[0].length : lastIndex;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (NPCG_INCLUDED && match && match.length > 1) {\\n\",\n       \"\\t      // Fix browsers whose `exec` methods don't consistently return `undefined`\\n\",\n       \"\\t      // for NPCG, like IE8. NOTE: This doesn' work for /(.?)?/\\n\",\n       \"\\t      // eslint-disable-next-line no-loop-func\\n\",\n       \"\\t      nativeReplace.call(match[0], reCopy, function () {\\n\",\n       \"\\t        for (i = 1; i < arguments.length - 2; i++) {\\n\",\n       \"\\t          if (arguments[i] === undefined) match[i] = undefined;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    return match;\\n\",\n       \"\\t  };\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = patchedExec;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 208 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t__webpack_require__(209);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar $flags = __webpack_require__(205);\\n\",\n       \"\\tvar DESCRIPTORS = __webpack_require__(13);\\n\",\n       \"\\tvar TO_STRING = 'toString';\\n\",\n       \"\\tvar $toString = /./[TO_STRING];\\n\",\n       \"\\t\\n\",\n       \"\\tvar define = function (fn) {\\n\",\n       \"\\t  __webpack_require__(25)(RegExp.prototype, TO_STRING, fn, true);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// 21.2.5.14 RegExp.prototype.toString()\\n\",\n       \"\\tif (__webpack_require__(14)(function () { return $toString.call({ source: 'a', flags: 'b' }) != '/a/b'; })) {\\n\",\n       \"\\t  define(function toString() {\\n\",\n       \"\\t    var R = anObject(this);\\n\",\n       \"\\t    return '/'.concat(R.source, '/',\\n\",\n       \"\\t      'flags' in R ? R.flags : !DESCRIPTORS && R instanceof RegExp ? $flags.call(R) : undefined);\\n\",\n       \"\\t  });\\n\",\n       \"\\t// FF44- RegExp#toString has a wrong name\\n\",\n       \"\\t} else if ($toString.name != TO_STRING) {\\n\",\n       \"\\t  define(function toString() {\\n\",\n       \"\\t    return $toString.call(this);\\n\",\n       \"\\t  });\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 209 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 21.2.5.3 get RegExp.prototype.flags()\\n\",\n       \"\\tif (__webpack_require__(13) && /./g.flags != 'g') __webpack_require__(18).f(RegExp.prototype, 'flags', {\\n\",\n       \"\\t  configurable: true,\\n\",\n       \"\\t  get: __webpack_require__(205)\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 210 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar advanceStringIndex = __webpack_require__(211);\\n\",\n       \"\\tvar regExpExec = __webpack_require__(212);\\n\",\n       \"\\t\\n\",\n       \"\\t// @@match logic\\n\",\n       \"\\t__webpack_require__(213)('match', 1, function (defined, MATCH, $match, maybeCallNative) {\\n\",\n       \"\\t  return [\\n\",\n       \"\\t    // `String.prototype.match` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-string.prototype.match\\n\",\n       \"\\t    function match(regexp) {\\n\",\n       \"\\t      var O = defined(this);\\n\",\n       \"\\t      var fn = regexp == undefined ? undefined : regexp[MATCH];\\n\",\n       \"\\t      return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[MATCH](String(O));\\n\",\n       \"\\t    },\\n\",\n       \"\\t    // `RegExp.prototype[@@match]` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-regexp.prototype-@@match\\n\",\n       \"\\t    function (regexp) {\\n\",\n       \"\\t      var res = maybeCallNative($match, regexp, this);\\n\",\n       \"\\t      if (res.done) return res.value;\\n\",\n       \"\\t      var rx = anObject(regexp);\\n\",\n       \"\\t      var S = String(this);\\n\",\n       \"\\t      if (!rx.global) return regExpExec(rx, S);\\n\",\n       \"\\t      var fullUnicode = rx.unicode;\\n\",\n       \"\\t      rx.lastIndex = 0;\\n\",\n       \"\\t      var A = [];\\n\",\n       \"\\t      var n = 0;\\n\",\n       \"\\t      var result;\\n\",\n       \"\\t      while ((result = regExpExec(rx, S)) !== null) {\\n\",\n       \"\\t        var matchStr = String(result[0]);\\n\",\n       \"\\t        A[n] = matchStr;\\n\",\n       \"\\t        if (matchStr === '') rx.lastIndex = advanceStringIndex(S, toLength(rx.lastIndex), fullUnicode);\\n\",\n       \"\\t        n++;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return n === 0 ? null : A;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  ];\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 211 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar at = __webpack_require__(135)(true);\\n\",\n       \"\\t\\n\",\n       \"\\t // `AdvanceStringIndex` abstract operation\\n\",\n       \"\\t// https://tc39.github.io/ecma262/#sec-advancestringindex\\n\",\n       \"\\tmodule.exports = function (S, index, unicode) {\\n\",\n       \"\\t  return index + (unicode ? at(S, index).length : 1);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 212 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tvar classof = __webpack_require__(82);\\n\",\n       \"\\tvar builtinExec = RegExp.prototype.exec;\\n\",\n       \"\\t\\n\",\n       \"\\t // `RegExpExec` abstract operation\\n\",\n       \"\\t// https://tc39.github.io/ecma262/#sec-regexpexec\\n\",\n       \"\\tmodule.exports = function (R, S) {\\n\",\n       \"\\t  var exec = R.exec;\\n\",\n       \"\\t  if (typeof exec === 'function') {\\n\",\n       \"\\t    var result = exec.call(R, S);\\n\",\n       \"\\t    if (typeof result !== 'object') {\\n\",\n       \"\\t      throw new TypeError('RegExp exec method returned something other than an Object or null');\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  if (classof(R) !== 'RegExp') {\\n\",\n       \"\\t    throw new TypeError('RegExp#exec called on incompatible receiver');\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return builtinExec.call(R, S);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 213 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t__webpack_require__(206);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\tvar wks = __webpack_require__(34);\\n\",\n       \"\\tvar regexpExec = __webpack_require__(207);\\n\",\n       \"\\t\\n\",\n       \"\\tvar SPECIES = wks('species');\\n\",\n       \"\\t\\n\",\n       \"\\tvar REPLACE_SUPPORTS_NAMED_GROUPS = !fails(function () {\\n\",\n       \"\\t  // #replace needs built-in support for named groups.\\n\",\n       \"\\t  // #match works fine because it just return the exec results, even if it has\\n\",\n       \"\\t  // a \\\"grops\\\" property.\\n\",\n       \"\\t  var re = /./;\\n\",\n       \"\\t  re.exec = function () {\\n\",\n       \"\\t    var result = [];\\n\",\n       \"\\t    result.groups = { a: '7' };\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  return ''.replace(re, '$<a>') !== '7';\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar SPLIT_WORKS_WITH_OVERWRITTEN_EXEC = (function () {\\n\",\n       \"\\t  // Chrome 51 has a buggy \\\"split\\\" implementation when RegExp#exec !== nativeExec\\n\",\n       \"\\t  var re = /(?:)/;\\n\",\n       \"\\t  var originalExec = re.exec;\\n\",\n       \"\\t  re.exec = function () { return originalExec.apply(this, arguments); };\\n\",\n       \"\\t  var result = 'ab'.split(re);\\n\",\n       \"\\t  return result.length === 2 && result[0] === 'a' && result[1] === 'b';\\n\",\n       \"\\t})();\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (KEY, length, exec) {\\n\",\n       \"\\t  var SYMBOL = wks(KEY);\\n\",\n       \"\\t\\n\",\n       \"\\t  var DELEGATES_TO_SYMBOL = !fails(function () {\\n\",\n       \"\\t    // String methods call symbol-named RegEp methods\\n\",\n       \"\\t    var O = {};\\n\",\n       \"\\t    O[SYMBOL] = function () { return 7; };\\n\",\n       \"\\t    return ''[KEY](O) != 7;\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  var DELEGATES_TO_EXEC = DELEGATES_TO_SYMBOL ? !fails(function () {\\n\",\n       \"\\t    // Symbol-named RegExp methods call .exec\\n\",\n       \"\\t    var execCalled = false;\\n\",\n       \"\\t    var re = /a/;\\n\",\n       \"\\t    re.exec = function () { execCalled = true; return null; };\\n\",\n       \"\\t    if (KEY === 'split') {\\n\",\n       \"\\t      // RegExp[@@split] doesn't call the regex's exec method, but first creates\\n\",\n       \"\\t      // a new one. We need to return the patched regex when creating the new one.\\n\",\n       \"\\t      re.constructor = {};\\n\",\n       \"\\t      re.constructor[SPECIES] = function () { return re; };\\n\",\n       \"\\t    }\\n\",\n       \"\\t    re[SYMBOL]('');\\n\",\n       \"\\t    return !execCalled;\\n\",\n       \"\\t  }) : undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t  if (\\n\",\n       \"\\t    !DELEGATES_TO_SYMBOL ||\\n\",\n       \"\\t    !DELEGATES_TO_EXEC ||\\n\",\n       \"\\t    (KEY === 'replace' && !REPLACE_SUPPORTS_NAMED_GROUPS) ||\\n\",\n       \"\\t    (KEY === 'split' && !SPLIT_WORKS_WITH_OVERWRITTEN_EXEC)\\n\",\n       \"\\t  ) {\\n\",\n       \"\\t    var nativeRegExpMethod = /./[SYMBOL];\\n\",\n       \"\\t    var fns = exec(\\n\",\n       \"\\t      defined,\\n\",\n       \"\\t      SYMBOL,\\n\",\n       \"\\t      ''[KEY],\\n\",\n       \"\\t      function maybeCallNative(nativeMethod, regexp, str, arg2, forceStringMethod) {\\n\",\n       \"\\t        if (regexp.exec === regexpExec) {\\n\",\n       \"\\t          if (DELEGATES_TO_SYMBOL && !forceStringMethod) {\\n\",\n       \"\\t            // The native String method already delegates to @@method (this\\n\",\n       \"\\t            // polyfilled function), leasing to infinite recursion.\\n\",\n       \"\\t            // We avoid it by directly calling the native @@method method.\\n\",\n       \"\\t            return { done: true, value: nativeRegExpMethod.call(regexp, str, arg2) };\\n\",\n       \"\\t          }\\n\",\n       \"\\t          return { done: true, value: nativeMethod.call(str, regexp, arg2) };\\n\",\n       \"\\t        }\\n\",\n       \"\\t        return { done: false };\\n\",\n       \"\\t      }\\n\",\n       \"\\t    );\\n\",\n       \"\\t    var strfn = fns[0];\\n\",\n       \"\\t    var rxfn = fns[1];\\n\",\n       \"\\t\\n\",\n       \"\\t    redefine(String.prototype, KEY, strfn);\\n\",\n       \"\\t    hide(RegExp.prototype, SYMBOL, length == 2\\n\",\n       \"\\t      // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue)\\n\",\n       \"\\t      // 21.2.5.11 RegExp.prototype[@@split](string, limit)\\n\",\n       \"\\t      ? function (string, arg) { return rxfn.call(string, this, arg); }\\n\",\n       \"\\t      // 21.2.5.6 RegExp.prototype[@@match](string)\\n\",\n       \"\\t      // 21.2.5.9 RegExp.prototype[@@search](string)\\n\",\n       \"\\t      : function (string) { return rxfn.call(string, this); }\\n\",\n       \"\\t    );\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 214 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar advanceStringIndex = __webpack_require__(211);\\n\",\n       \"\\tvar regExpExec = __webpack_require__(212);\\n\",\n       \"\\tvar max = Math.max;\\n\",\n       \"\\tvar min = Math.min;\\n\",\n       \"\\tvar floor = Math.floor;\\n\",\n       \"\\tvar SUBSTITUTION_SYMBOLS = /\\\\$([$&`']|\\\\d\\\\d?|<[^>]*>)/g;\\n\",\n       \"\\tvar SUBSTITUTION_SYMBOLS_NO_NAMED = /\\\\$([$&`']|\\\\d\\\\d?)/g;\\n\",\n       \"\\t\\n\",\n       \"\\tvar maybeToString = function (it) {\\n\",\n       \"\\t  return it === undefined ? it : String(it);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// @@replace logic\\n\",\n       \"\\t__webpack_require__(213)('replace', 2, function (defined, REPLACE, $replace, maybeCallNative) {\\n\",\n       \"\\t  return [\\n\",\n       \"\\t    // `String.prototype.replace` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-string.prototype.replace\\n\",\n       \"\\t    function replace(searchValue, replaceValue) {\\n\",\n       \"\\t      var O = defined(this);\\n\",\n       \"\\t      var fn = searchValue == undefined ? undefined : searchValue[REPLACE];\\n\",\n       \"\\t      return fn !== undefined\\n\",\n       \"\\t        ? fn.call(searchValue, O, replaceValue)\\n\",\n       \"\\t        : $replace.call(String(O), searchValue, replaceValue);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    // `RegExp.prototype[@@replace]` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-regexp.prototype-@@replace\\n\",\n       \"\\t    function (regexp, replaceValue) {\\n\",\n       \"\\t      var res = maybeCallNative($replace, regexp, this, replaceValue);\\n\",\n       \"\\t      if (res.done) return res.value;\\n\",\n       \"\\t\\n\",\n       \"\\t      var rx = anObject(regexp);\\n\",\n       \"\\t      var S = String(this);\\n\",\n       \"\\t      var functionalReplace = typeof replaceValue === 'function';\\n\",\n       \"\\t      if (!functionalReplace) replaceValue = String(replaceValue);\\n\",\n       \"\\t      var global = rx.global;\\n\",\n       \"\\t      if (global) {\\n\",\n       \"\\t        var fullUnicode = rx.unicode;\\n\",\n       \"\\t        rx.lastIndex = 0;\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var results = [];\\n\",\n       \"\\t      while (true) {\\n\",\n       \"\\t        var result = regExpExec(rx, S);\\n\",\n       \"\\t        if (result === null) break;\\n\",\n       \"\\t        results.push(result);\\n\",\n       \"\\t        if (!global) break;\\n\",\n       \"\\t        var matchStr = String(result[0]);\\n\",\n       \"\\t        if (matchStr === '') rx.lastIndex = advanceStringIndex(S, toLength(rx.lastIndex), fullUnicode);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      var accumulatedResult = '';\\n\",\n       \"\\t      var nextSourcePosition = 0;\\n\",\n       \"\\t      for (var i = 0; i < results.length; i++) {\\n\",\n       \"\\t        result = results[i];\\n\",\n       \"\\t        var matched = String(result[0]);\\n\",\n       \"\\t        var position = max(min(toInteger(result.index), S.length), 0);\\n\",\n       \"\\t        var captures = [];\\n\",\n       \"\\t        // NOTE: This is equivalent to\\n\",\n       \"\\t        //   captures = result.slice(1).map(maybeToString)\\n\",\n       \"\\t        // but for some reason `nativeSlice.call(result, 1, result.length)` (called in\\n\",\n       \"\\t        // the slice polyfill when slicing native arrays) \\\"doesn't work\\\" in safari 9 and\\n\",\n       \"\\t        // causes a crash (https://pastebin.com/N21QzeQA) when trying to debug it.\\n\",\n       \"\\t        for (var j = 1; j < result.length; j++) captures.push(maybeToString(result[j]));\\n\",\n       \"\\t        var namedCaptures = result.groups;\\n\",\n       \"\\t        if (functionalReplace) {\\n\",\n       \"\\t          var replacerArgs = [matched].concat(captures, position, S);\\n\",\n       \"\\t          if (namedCaptures !== undefined) replacerArgs.push(namedCaptures);\\n\",\n       \"\\t          var replacement = String(replaceValue.apply(undefined, replacerArgs));\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          replacement = getSubstitution(matched, S, position, captures, namedCaptures, replaceValue);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (position >= nextSourcePosition) {\\n\",\n       \"\\t          accumulatedResult += S.slice(nextSourcePosition, position) + replacement;\\n\",\n       \"\\t          nextSourcePosition = position + matched.length;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return accumulatedResult + S.slice(nextSourcePosition);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  ];\\n\",\n       \"\\t\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-getsubstitution\\n\",\n       \"\\t  function getSubstitution(matched, str, position, captures, namedCaptures, replacement) {\\n\",\n       \"\\t    var tailPos = position + matched.length;\\n\",\n       \"\\t    var m = captures.length;\\n\",\n       \"\\t    var symbols = SUBSTITUTION_SYMBOLS_NO_NAMED;\\n\",\n       \"\\t    if (namedCaptures !== undefined) {\\n\",\n       \"\\t      namedCaptures = toObject(namedCaptures);\\n\",\n       \"\\t      symbols = SUBSTITUTION_SYMBOLS;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return $replace.call(replacement, symbols, function (match, ch) {\\n\",\n       \"\\t      var capture;\\n\",\n       \"\\t      switch (ch.charAt(0)) {\\n\",\n       \"\\t        case '$': return '$';\\n\",\n       \"\\t        case '&': return matched;\\n\",\n       \"\\t        case '`': return str.slice(0, position);\\n\",\n       \"\\t        case \\\"'\\\": return str.slice(tailPos);\\n\",\n       \"\\t        case '<':\\n\",\n       \"\\t          capture = namedCaptures[ch.slice(1, -1)];\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        default: // \\\\d\\\\d?\\n\",\n       \"\\t          var n = +ch;\\n\",\n       \"\\t          if (n === 0) return match;\\n\",\n       \"\\t          if (n > m) {\\n\",\n       \"\\t            var f = floor(n / 10);\\n\",\n       \"\\t            if (f === 0) return match;\\n\",\n       \"\\t            if (f <= m) return captures[f - 1] === undefined ? ch.charAt(1) : captures[f - 1] + ch.charAt(1);\\n\",\n       \"\\t            return match;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          capture = captures[n - 1];\\n\",\n       \"\\t      }\\n\",\n       \"\\t      return capture === undefined ? '' : capture;\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 215 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar sameValue = __webpack_require__(78);\\n\",\n       \"\\tvar regExpExec = __webpack_require__(212);\\n\",\n       \"\\t\\n\",\n       \"\\t// @@search logic\\n\",\n       \"\\t__webpack_require__(213)('search', 1, function (defined, SEARCH, $search, maybeCallNative) {\\n\",\n       \"\\t  return [\\n\",\n       \"\\t    // `String.prototype.search` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-string.prototype.search\\n\",\n       \"\\t    function search(regexp) {\\n\",\n       \"\\t      var O = defined(this);\\n\",\n       \"\\t      var fn = regexp == undefined ? undefined : regexp[SEARCH];\\n\",\n       \"\\t      return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[SEARCH](String(O));\\n\",\n       \"\\t    },\\n\",\n       \"\\t    // `RegExp.prototype[@@search]` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-regexp.prototype-@@search\\n\",\n       \"\\t    function (regexp) {\\n\",\n       \"\\t      var res = maybeCallNative($search, regexp, this);\\n\",\n       \"\\t      if (res.done) return res.value;\\n\",\n       \"\\t      var rx = anObject(regexp);\\n\",\n       \"\\t      var S = String(this);\\n\",\n       \"\\t      var previousLastIndex = rx.lastIndex;\\n\",\n       \"\\t      if (!sameValue(previousLastIndex, 0)) rx.lastIndex = 0;\\n\",\n       \"\\t      var result = regExpExec(rx, S);\\n\",\n       \"\\t      if (!sameValue(rx.lastIndex, previousLastIndex)) rx.lastIndex = previousLastIndex;\\n\",\n       \"\\t      return result === null ? -1 : result.index;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  ];\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 216 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t\\n\",\n       \"\\tvar isRegExp = __webpack_require__(142);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar speciesConstructor = __webpack_require__(217);\\n\",\n       \"\\tvar advanceStringIndex = __webpack_require__(211);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar callRegExpExec = __webpack_require__(212);\\n\",\n       \"\\tvar regexpExec = __webpack_require__(207);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar $min = Math.min;\\n\",\n       \"\\tvar $push = [].push;\\n\",\n       \"\\tvar $SPLIT = 'split';\\n\",\n       \"\\tvar LENGTH = 'length';\\n\",\n       \"\\tvar LAST_INDEX = 'lastIndex';\\n\",\n       \"\\tvar MAX_UINT32 = 0xffffffff;\\n\",\n       \"\\t\\n\",\n       \"\\t// babel-minify transpiles RegExp('x', 'y') -> /x/y and it causes SyntaxError\\n\",\n       \"\\tvar SUPPORTS_Y = !fails(function () { RegExp(MAX_UINT32, 'y'); });\\n\",\n       \"\\t\\n\",\n       \"\\t// @@split logic\\n\",\n       \"\\t__webpack_require__(213)('split', 2, function (defined, SPLIT, $split, maybeCallNative) {\\n\",\n       \"\\t  var internalSplit;\\n\",\n       \"\\t  if (\\n\",\n       \"\\t    'abbc'[$SPLIT](/(b)*/)[1] == 'c' ||\\n\",\n       \"\\t    'test'[$SPLIT](/(?:)/, -1)[LENGTH] != 4 ||\\n\",\n       \"\\t    'ab'[$SPLIT](/(?:ab)*/)[LENGTH] != 2 ||\\n\",\n       \"\\t    '.'[$SPLIT](/(.?)(.?)/)[LENGTH] != 4 ||\\n\",\n       \"\\t    '.'[$SPLIT](/()()/)[LENGTH] > 1 ||\\n\",\n       \"\\t    ''[$SPLIT](/.?/)[LENGTH]\\n\",\n       \"\\t  ) {\\n\",\n       \"\\t    // based on es5-shim implementation, need to rework it\\n\",\n       \"\\t    internalSplit = function (separator, limit) {\\n\",\n       \"\\t      var string = String(this);\\n\",\n       \"\\t      if (separator === undefined && limit === 0) return [];\\n\",\n       \"\\t      // If `separator` is not a regex, use native split\\n\",\n       \"\\t      if (!isRegExp(separator)) return $split.call(string, separator, limit);\\n\",\n       \"\\t      var output = [];\\n\",\n       \"\\t      var flags = (separator.ignoreCase ? 'i' : '') +\\n\",\n       \"\\t                  (separator.multiline ? 'm' : '') +\\n\",\n       \"\\t                  (separator.unicode ? 'u' : '') +\\n\",\n       \"\\t                  (separator.sticky ? 'y' : '');\\n\",\n       \"\\t      var lastLastIndex = 0;\\n\",\n       \"\\t      var splitLimit = limit === undefined ? MAX_UINT32 : limit >>> 0;\\n\",\n       \"\\t      // Make `global` and avoid `lastIndex` issues by working with a copy\\n\",\n       \"\\t      var separatorCopy = new RegExp(separator.source, flags + 'g');\\n\",\n       \"\\t      var match, lastIndex, lastLength;\\n\",\n       \"\\t      while (match = regexpExec.call(separatorCopy, string)) {\\n\",\n       \"\\t        lastIndex = separatorCopy[LAST_INDEX];\\n\",\n       \"\\t        if (lastIndex > lastLastIndex) {\\n\",\n       \"\\t          output.push(string.slice(lastLastIndex, match.index));\\n\",\n       \"\\t          if (match[LENGTH] > 1 && match.index < string[LENGTH]) $push.apply(output, match.slice(1));\\n\",\n       \"\\t          lastLength = match[0][LENGTH];\\n\",\n       \"\\t          lastLastIndex = lastIndex;\\n\",\n       \"\\t          if (output[LENGTH] >= splitLimit) break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (separatorCopy[LAST_INDEX] === match.index) separatorCopy[LAST_INDEX]++; // Avoid an infinite loop\\n\",\n       \"\\t      }\\n\",\n       \"\\t      if (lastLastIndex === string[LENGTH]) {\\n\",\n       \"\\t        if (lastLength || !separatorCopy.test('')) output.push('');\\n\",\n       \"\\t      } else output.push(string.slice(lastLastIndex));\\n\",\n       \"\\t      return output[LENGTH] > splitLimit ? output.slice(0, splitLimit) : output;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // Chakra, V8\\n\",\n       \"\\t  } else if ('0'[$SPLIT](undefined, 0)[LENGTH]) {\\n\",\n       \"\\t    internalSplit = function (separator, limit) {\\n\",\n       \"\\t      return separator === undefined && limit === 0 ? [] : $split.call(this, separator, limit);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    internalSplit = $split;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  return [\\n\",\n       \"\\t    // `String.prototype.split` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-string.prototype.split\\n\",\n       \"\\t    function split(separator, limit) {\\n\",\n       \"\\t      var O = defined(this);\\n\",\n       \"\\t      var splitter = separator == undefined ? undefined : separator[SPLIT];\\n\",\n       \"\\t      return splitter !== undefined\\n\",\n       \"\\t        ? splitter.call(separator, O, limit)\\n\",\n       \"\\t        : internalSplit.call(String(O), separator, limit);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    // `RegExp.prototype[@@split]` method\\n\",\n       \"\\t    // https://tc39.github.io/ecma262/#sec-regexp.prototype-@@split\\n\",\n       \"\\t    //\\n\",\n       \"\\t    // NOTE: This cannot be properly polyfilled in engines that don't support\\n\",\n       \"\\t    // the 'y' flag.\\n\",\n       \"\\t    function (regexp, limit) {\\n\",\n       \"\\t      var res = maybeCallNative(internalSplit, regexp, this, limit, internalSplit !== $split);\\n\",\n       \"\\t      if (res.done) return res.value;\\n\",\n       \"\\t\\n\",\n       \"\\t      var rx = anObject(regexp);\\n\",\n       \"\\t      var S = String(this);\\n\",\n       \"\\t      var C = speciesConstructor(rx, RegExp);\\n\",\n       \"\\t\\n\",\n       \"\\t      var unicodeMatching = rx.unicode;\\n\",\n       \"\\t      var flags = (rx.ignoreCase ? 'i' : '') +\\n\",\n       \"\\t                  (rx.multiline ? 'm' : '') +\\n\",\n       \"\\t                  (rx.unicode ? 'u' : '') +\\n\",\n       \"\\t                  (SUPPORTS_Y ? 'y' : 'g');\\n\",\n       \"\\t\\n\",\n       \"\\t      // ^(? + rx + ) is needed, in combination with some S slicing, to\\n\",\n       \"\\t      // simulate the 'y' flag.\\n\",\n       \"\\t      var splitter = new C(SUPPORTS_Y ? rx : '^(?:' + rx.source + ')', flags);\\n\",\n       \"\\t      var lim = limit === undefined ? MAX_UINT32 : limit >>> 0;\\n\",\n       \"\\t      if (lim === 0) return [];\\n\",\n       \"\\t      if (S.length === 0) return callRegExpExec(splitter, S) === null ? [S] : [];\\n\",\n       \"\\t      var p = 0;\\n\",\n       \"\\t      var q = 0;\\n\",\n       \"\\t      var A = [];\\n\",\n       \"\\t      while (q < S.length) {\\n\",\n       \"\\t        splitter.lastIndex = SUPPORTS_Y ? q : 0;\\n\",\n       \"\\t        var z = callRegExpExec(splitter, SUPPORTS_Y ? S : S.slice(q));\\n\",\n       \"\\t        var e;\\n\",\n       \"\\t        if (\\n\",\n       \"\\t          z === null ||\\n\",\n       \"\\t          (e = $min(toLength(splitter.lastIndex + (SUPPORTS_Y ? 0 : q)), S.length)) === p\\n\",\n       \"\\t        ) {\\n\",\n       \"\\t          q = advanceStringIndex(S, q, unicodeMatching);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          A.push(S.slice(p, q));\\n\",\n       \"\\t          if (A.length === lim) return A;\\n\",\n       \"\\t          for (var i = 1; i <= z.length - 1; i++) {\\n\",\n       \"\\t            A.push(z[i]);\\n\",\n       \"\\t            if (A.length === lim) return A;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          q = p = e;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t      A.push(S.slice(p));\\n\",\n       \"\\t      return A;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  ];\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 217 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 7.3.20 SpeciesConstructor(O, defaultConstructor)\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar SPECIES = __webpack_require__(34)('species');\\n\",\n       \"\\tmodule.exports = function (O, D) {\\n\",\n       \"\\t  var C = anObject(O).constructor;\\n\",\n       \"\\t  var S;\\n\",\n       \"\\t  return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? D : aFunction(S);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 218 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar LIBRARY = __webpack_require__(29);\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar classof = __webpack_require__(82);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar anInstance = __webpack_require__(219);\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\tvar speciesConstructor = __webpack_require__(217);\\n\",\n       \"\\tvar task = __webpack_require__(221).set;\\n\",\n       \"\\tvar microtask = __webpack_require__(222)();\\n\",\n       \"\\tvar newPromiseCapabilityModule = __webpack_require__(223);\\n\",\n       \"\\tvar perform = __webpack_require__(224);\\n\",\n       \"\\tvar userAgent = __webpack_require__(225);\\n\",\n       \"\\tvar promiseResolve = __webpack_require__(226);\\n\",\n       \"\\tvar PROMISE = 'Promise';\\n\",\n       \"\\tvar TypeError = global.TypeError;\\n\",\n       \"\\tvar process = global.process;\\n\",\n       \"\\tvar versions = process && process.versions;\\n\",\n       \"\\tvar v8 = versions && versions.v8 || '';\\n\",\n       \"\\tvar $Promise = global[PROMISE];\\n\",\n       \"\\tvar isNode = classof(process) == 'process';\\n\",\n       \"\\tvar empty = function () { /* empty */ };\\n\",\n       \"\\tvar Internal, newGenericPromiseCapability, OwnPromiseCapability, Wrapper;\\n\",\n       \"\\tvar newPromiseCapability = newGenericPromiseCapability = newPromiseCapabilityModule.f;\\n\",\n       \"\\t\\n\",\n       \"\\tvar USE_NATIVE = !!function () {\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    // correct subclassing with @@species support\\n\",\n       \"\\t    var promise = $Promise.resolve(1);\\n\",\n       \"\\t    var FakePromise = (promise.constructor = {})[__webpack_require__(34)('species')] = function (exec) {\\n\",\n       \"\\t      exec(empty, empty);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    // unhandled rejections tracking support, NodeJS Promise without it fails @@species test\\n\",\n       \"\\t    return (isNode || typeof PromiseRejectionEvent == 'function')\\n\",\n       \"\\t      && promise.then(empty) instanceof FakePromise\\n\",\n       \"\\t      // v8 6.6 (Node 10 and Chrome 66) have a bug with resolving custom thenables\\n\",\n       \"\\t      // https://bugs.chromium.org/p/chromium/issues/detail?id=830565\\n\",\n       \"\\t      // we can't detect it synchronously, so just check versions\\n\",\n       \"\\t      && v8.indexOf('6.6') !== 0\\n\",\n       \"\\t      && userAgent.indexOf('Chrome/66') === -1;\\n\",\n       \"\\t  } catch (e) { /* empty */ }\\n\",\n       \"\\t}();\\n\",\n       \"\\t\\n\",\n       \"\\t// helpers\\n\",\n       \"\\tvar isThenable = function (it) {\\n\",\n       \"\\t  var then;\\n\",\n       \"\\t  return isObject(it) && typeof (then = it.then) == 'function' ? then : false;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar notify = function (promise, isReject) {\\n\",\n       \"\\t  if (promise._n) return;\\n\",\n       \"\\t  promise._n = true;\\n\",\n       \"\\t  var chain = promise._c;\\n\",\n       \"\\t  microtask(function () {\\n\",\n       \"\\t    var value = promise._v;\\n\",\n       \"\\t    var ok = promise._s == 1;\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    var run = function (reaction) {\\n\",\n       \"\\t      var handler = ok ? reaction.ok : reaction.fail;\\n\",\n       \"\\t      var resolve = reaction.resolve;\\n\",\n       \"\\t      var reject = reaction.reject;\\n\",\n       \"\\t      var domain = reaction.domain;\\n\",\n       \"\\t      var result, then, exited;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        if (handler) {\\n\",\n       \"\\t          if (!ok) {\\n\",\n       \"\\t            if (promise._h == 2) onHandleUnhandled(promise);\\n\",\n       \"\\t            promise._h = 1;\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (handler === true) result = value;\\n\",\n       \"\\t          else {\\n\",\n       \"\\t            if (domain) domain.enter();\\n\",\n       \"\\t            result = handler(value); // may throw\\n\",\n       \"\\t            if (domain) {\\n\",\n       \"\\t              domain.exit();\\n\",\n       \"\\t              exited = true;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t          if (result === reaction.promise) {\\n\",\n       \"\\t            reject(TypeError('Promise-chain cycle'));\\n\",\n       \"\\t          } else if (then = isThenable(result)) {\\n\",\n       \"\\t            then.call(result, resolve, reject);\\n\",\n       \"\\t          } else resolve(result);\\n\",\n       \"\\t        } else reject(value);\\n\",\n       \"\\t      } catch (e) {\\n\",\n       \"\\t        if (domain && !exited) domain.exit();\\n\",\n       \"\\t        reject(e);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t    while (chain.length > i) run(chain[i++]); // variable length - can't use forEach\\n\",\n       \"\\t    promise._c = [];\\n\",\n       \"\\t    promise._n = false;\\n\",\n       \"\\t    if (isReject && !promise._h) onUnhandled(promise);\\n\",\n       \"\\t  });\\n\",\n       \"\\t};\\n\",\n       \"\\tvar onUnhandled = function (promise) {\\n\",\n       \"\\t  task.call(global, function () {\\n\",\n       \"\\t    var value = promise._v;\\n\",\n       \"\\t    var unhandled = isUnhandled(promise);\\n\",\n       \"\\t    var result, handler, console;\\n\",\n       \"\\t    if (unhandled) {\\n\",\n       \"\\t      result = perform(function () {\\n\",\n       \"\\t        if (isNode) {\\n\",\n       \"\\t          process.emit('unhandledRejection', value, promise);\\n\",\n       \"\\t        } else if (handler = global.onunhandledrejection) {\\n\",\n       \"\\t          handler({ promise: promise, reason: value });\\n\",\n       \"\\t        } else if ((console = global.console) && console.error) {\\n\",\n       \"\\t          console.error('Unhandled promise rejection', value);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should\\n\",\n       \"\\t      promise._h = isNode || isUnhandled(promise) ? 2 : 1;\\n\",\n       \"\\t    } promise._a = undefined;\\n\",\n       \"\\t    if (unhandled && result.e) throw result.v;\\n\",\n       \"\\t  });\\n\",\n       \"\\t};\\n\",\n       \"\\tvar isUnhandled = function (promise) {\\n\",\n       \"\\t  return promise._h !== 1 && (promise._a || promise._c).length === 0;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar onHandleUnhandled = function (promise) {\\n\",\n       \"\\t  task.call(global, function () {\\n\",\n       \"\\t    var handler;\\n\",\n       \"\\t    if (isNode) {\\n\",\n       \"\\t      process.emit('rejectionHandled', promise);\\n\",\n       \"\\t    } else if (handler = global.onrejectionhandled) {\\n\",\n       \"\\t      handler({ promise: promise, reason: promise._v });\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $reject = function (value) {\\n\",\n       \"\\t  var promise = this;\\n\",\n       \"\\t  if (promise._d) return;\\n\",\n       \"\\t  promise._d = true;\\n\",\n       \"\\t  promise = promise._w || promise; // unwrap\\n\",\n       \"\\t  promise._v = value;\\n\",\n       \"\\t  promise._s = 2;\\n\",\n       \"\\t  if (!promise._a) promise._a = promise._c.slice();\\n\",\n       \"\\t  notify(promise, true);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar $resolve = function (value) {\\n\",\n       \"\\t  var promise = this;\\n\",\n       \"\\t  var then;\\n\",\n       \"\\t  if (promise._d) return;\\n\",\n       \"\\t  promise._d = true;\\n\",\n       \"\\t  promise = promise._w || promise; // unwrap\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    if (promise === value) throw TypeError(\\\"Promise can't be resolved itself\\\");\\n\",\n       \"\\t    if (then = isThenable(value)) {\\n\",\n       \"\\t      microtask(function () {\\n\",\n       \"\\t        var wrapper = { _w: promise, _d: false }; // wrap\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          then.call(value, ctx($resolve, wrapper, 1), ctx($reject, wrapper, 1));\\n\",\n       \"\\t        } catch (e) {\\n\",\n       \"\\t          $reject.call(wrapper, e);\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      promise._v = value;\\n\",\n       \"\\t      promise._s = 1;\\n\",\n       \"\\t      notify(promise, false);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    $reject.call({ _w: promise, _d: false }, e); // wrap\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// constructor polyfill\\n\",\n       \"\\tif (!USE_NATIVE) {\\n\",\n       \"\\t  // 25.4.3.1 Promise(executor)\\n\",\n       \"\\t  $Promise = function Promise(executor) {\\n\",\n       \"\\t    anInstance(this, $Promise, PROMISE, '_h');\\n\",\n       \"\\t    aFunction(executor);\\n\",\n       \"\\t    Internal.call(this);\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      executor(ctx($resolve, this, 1), ctx($reject, this, 1));\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      $reject.call(this, err);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t  // eslint-disable-next-line no-unused-vars\\n\",\n       \"\\t  Internal = function Promise(executor) {\\n\",\n       \"\\t    this._c = [];             // <- awaiting reactions\\n\",\n       \"\\t    this._a = undefined;      // <- checked in isUnhandled reactions\\n\",\n       \"\\t    this._s = 0;              // <- state\\n\",\n       \"\\t    this._d = false;          // <- done\\n\",\n       \"\\t    this._v = undefined;      // <- value\\n\",\n       \"\\t    this._h = 0;              // <- rejection state, 0 - default, 1 - handled, 2 - unhandled\\n\",\n       \"\\t    this._n = false;          // <- notify\\n\",\n       \"\\t  };\\n\",\n       \"\\t  Internal.prototype = __webpack_require__(227)($Promise.prototype, {\\n\",\n       \"\\t    // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected)\\n\",\n       \"\\t    then: function then(onFulfilled, onRejected) {\\n\",\n       \"\\t      var reaction = newPromiseCapability(speciesConstructor(this, $Promise));\\n\",\n       \"\\t      reaction.ok = typeof onFulfilled == 'function' ? onFulfilled : true;\\n\",\n       \"\\t      reaction.fail = typeof onRejected == 'function' && onRejected;\\n\",\n       \"\\t      reaction.domain = isNode ? process.domain : undefined;\\n\",\n       \"\\t      this._c.push(reaction);\\n\",\n       \"\\t      if (this._a) this._a.push(reaction);\\n\",\n       \"\\t      if (this._s) notify(this, false);\\n\",\n       \"\\t      return reaction.promise;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    // 25.4.5.1 Promise.prototype.catch(onRejected)\\n\",\n       \"\\t    'catch': function (onRejected) {\\n\",\n       \"\\t      return this.then(undefined, onRejected);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t  OwnPromiseCapability = function () {\\n\",\n       \"\\t    var promise = new Internal();\\n\",\n       \"\\t    this.promise = promise;\\n\",\n       \"\\t    this.resolve = ctx($resolve, promise, 1);\\n\",\n       \"\\t    this.reject = ctx($reject, promise, 1);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  newPromiseCapabilityModule.f = newPromiseCapability = function (C) {\\n\",\n       \"\\t    return C === $Promise || C === Wrapper\\n\",\n       \"\\t      ? new OwnPromiseCapability(C)\\n\",\n       \"\\t      : newGenericPromiseCapability(C);\\n\",\n       \"\\t  };\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.G + $export.W + $export.F * !USE_NATIVE, { Promise: $Promise });\\n\",\n       \"\\t__webpack_require__(33)($Promise, PROMISE);\\n\",\n       \"\\t__webpack_require__(201)(PROMISE);\\n\",\n       \"\\tWrapper = __webpack_require__(16)[PROMISE];\\n\",\n       \"\\t\\n\",\n       \"\\t// statics\\n\",\n       \"\\t$export($export.S + $export.F * !USE_NATIVE, PROMISE, {\\n\",\n       \"\\t  // 25.4.4.5 Promise.reject(r)\\n\",\n       \"\\t  reject: function reject(r) {\\n\",\n       \"\\t    var capability = newPromiseCapability(this);\\n\",\n       \"\\t    var $$reject = capability.reject;\\n\",\n       \"\\t    $$reject(r);\\n\",\n       \"\\t    return capability.promise;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t$export($export.S + $export.F * (LIBRARY || !USE_NATIVE), PROMISE, {\\n\",\n       \"\\t  // 25.4.4.6 Promise.resolve(x)\\n\",\n       \"\\t  resolve: function resolve(x) {\\n\",\n       \"\\t    return promiseResolve(LIBRARY && this === Wrapper ? $Promise : this, x);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t$export($export.S + $export.F * !(USE_NATIVE && __webpack_require__(174)(function (iter) {\\n\",\n       \"\\t  $Promise.all(iter)['catch'](empty);\\n\",\n       \"\\t})), PROMISE, {\\n\",\n       \"\\t  // 25.4.4.1 Promise.all(iterable)\\n\",\n       \"\\t  all: function all(iterable) {\\n\",\n       \"\\t    var C = this;\\n\",\n       \"\\t    var capability = newPromiseCapability(C);\\n\",\n       \"\\t    var resolve = capability.resolve;\\n\",\n       \"\\t    var reject = capability.reject;\\n\",\n       \"\\t    var result = perform(function () {\\n\",\n       \"\\t      var values = [];\\n\",\n       \"\\t      var index = 0;\\n\",\n       \"\\t      var remaining = 1;\\n\",\n       \"\\t      forOf(iterable, false, function (promise) {\\n\",\n       \"\\t        var $index = index++;\\n\",\n       \"\\t        var alreadyCalled = false;\\n\",\n       \"\\t        values.push(undefined);\\n\",\n       \"\\t        remaining++;\\n\",\n       \"\\t        C.resolve(promise).then(function (value) {\\n\",\n       \"\\t          if (alreadyCalled) return;\\n\",\n       \"\\t          alreadyCalled = true;\\n\",\n       \"\\t          values[$index] = value;\\n\",\n       \"\\t          --remaining || resolve(values);\\n\",\n       \"\\t        }, reject);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      --remaining || resolve(values);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    if (result.e) reject(result.v);\\n\",\n       \"\\t    return capability.promise;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  // 25.4.4.4 Promise.race(iterable)\\n\",\n       \"\\t  race: function race(iterable) {\\n\",\n       \"\\t    var C = this;\\n\",\n       \"\\t    var capability = newPromiseCapability(C);\\n\",\n       \"\\t    var reject = capability.reject;\\n\",\n       \"\\t    var result = perform(function () {\\n\",\n       \"\\t      forOf(iterable, false, function (promise) {\\n\",\n       \"\\t        C.resolve(promise).then(capability.resolve, reject);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    });\\n\",\n       \"\\t    if (result.e) reject(result.v);\\n\",\n       \"\\t    return capability.promise;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 219 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (it, Constructor, name, forbiddenField) {\\n\",\n       \"\\t  if (!(it instanceof Constructor) || (forbiddenField !== undefined && forbiddenField in it)) {\\n\",\n       \"\\t    throw TypeError(name + ': incorrect invocation!');\\n\",\n       \"\\t  } return it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 220 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar call = __webpack_require__(170);\\n\",\n       \"\\tvar isArrayIter = __webpack_require__(171);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar getIterFn = __webpack_require__(173);\\n\",\n       \"\\tvar BREAK = {};\\n\",\n       \"\\tvar RETURN = {};\\n\",\n       \"\\tvar exports = module.exports = function (iterable, entries, fn, that, ITERATOR) {\\n\",\n       \"\\t  var iterFn = ITERATOR ? function () { return iterable; } : getIterFn(iterable);\\n\",\n       \"\\t  var f = ctx(fn, that, entries ? 2 : 1);\\n\",\n       \"\\t  var index = 0;\\n\",\n       \"\\t  var length, step, iterator, result;\\n\",\n       \"\\t  if (typeof iterFn != 'function') throw TypeError(iterable + ' is not iterable!');\\n\",\n       \"\\t  // fast case for arrays with default iterator\\n\",\n       \"\\t  if (isArrayIter(iterFn)) for (length = toLength(iterable.length); length > index; index++) {\\n\",\n       \"\\t    result = entries ? f(anObject(step = iterable[index])[0], step[1]) : f(iterable[index]);\\n\",\n       \"\\t    if (result === BREAK || result === RETURN) return result;\\n\",\n       \"\\t  } else for (iterator = iterFn.call(iterable); !(step = iterator.next()).done;) {\\n\",\n       \"\\t    result = call(iterator, f, step.value, entries);\\n\",\n       \"\\t    if (result === BREAK || result === RETURN) return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\texports.BREAK = BREAK;\\n\",\n       \"\\texports.RETURN = RETURN;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 221 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar invoke = __webpack_require__(85);\\n\",\n       \"\\tvar html = __webpack_require__(55);\\n\",\n       \"\\tvar cel = __webpack_require__(22);\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar process = global.process;\\n\",\n       \"\\tvar setTask = global.setImmediate;\\n\",\n       \"\\tvar clearTask = global.clearImmediate;\\n\",\n       \"\\tvar MessageChannel = global.MessageChannel;\\n\",\n       \"\\tvar Dispatch = global.Dispatch;\\n\",\n       \"\\tvar counter = 0;\\n\",\n       \"\\tvar queue = {};\\n\",\n       \"\\tvar ONREADYSTATECHANGE = 'onreadystatechange';\\n\",\n       \"\\tvar defer, channel, port;\\n\",\n       \"\\tvar run = function () {\\n\",\n       \"\\t  var id = +this;\\n\",\n       \"\\t  // eslint-disable-next-line no-prototype-builtins\\n\",\n       \"\\t  if (queue.hasOwnProperty(id)) {\\n\",\n       \"\\t    var fn = queue[id];\\n\",\n       \"\\t    delete queue[id];\\n\",\n       \"\\t    fn();\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\tvar listener = function (event) {\\n\",\n       \"\\t  run.call(event.data);\\n\",\n       \"\\t};\\n\",\n       \"\\t// Node.js 0.9+ & IE10+ has setImmediate, otherwise:\\n\",\n       \"\\tif (!setTask || !clearTask) {\\n\",\n       \"\\t  setTask = function setImmediate(fn) {\\n\",\n       \"\\t    var args = [];\\n\",\n       \"\\t    var i = 1;\\n\",\n       \"\\t    while (arguments.length > i) args.push(arguments[i++]);\\n\",\n       \"\\t    queue[++counter] = function () {\\n\",\n       \"\\t      // eslint-disable-next-line no-new-func\\n\",\n       \"\\t      invoke(typeof fn == 'function' ? fn : Function(fn), args);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    defer(counter);\\n\",\n       \"\\t    return counter;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  clearTask = function clearImmediate(id) {\\n\",\n       \"\\t    delete queue[id];\\n\",\n       \"\\t  };\\n\",\n       \"\\t  // Node.js 0.8-\\n\",\n       \"\\t  if (__webpack_require__(42)(process) == 'process') {\\n\",\n       \"\\t    defer = function (id) {\\n\",\n       \"\\t      process.nextTick(ctx(run, id, 1));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // Sphere (JS game engine) Dispatch API\\n\",\n       \"\\t  } else if (Dispatch && Dispatch.now) {\\n\",\n       \"\\t    defer = function (id) {\\n\",\n       \"\\t      Dispatch.now(ctx(run, id, 1));\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // Browsers with MessageChannel, includes WebWorkers\\n\",\n       \"\\t  } else if (MessageChannel) {\\n\",\n       \"\\t    channel = new MessageChannel();\\n\",\n       \"\\t    port = channel.port2;\\n\",\n       \"\\t    channel.port1.onmessage = listener;\\n\",\n       \"\\t    defer = ctx(port.postMessage, port, 1);\\n\",\n       \"\\t  // Browsers with postMessage, skip WebWorkers\\n\",\n       \"\\t  // IE8 has postMessage, but it's sync & typeof its postMessage is 'object'\\n\",\n       \"\\t  } else if (global.addEventListener && typeof postMessage == 'function' && !global.importScripts) {\\n\",\n       \"\\t    defer = function (id) {\\n\",\n       \"\\t      global.postMessage(id + '', '*');\\n\",\n       \"\\t    };\\n\",\n       \"\\t    global.addEventListener('message', listener, false);\\n\",\n       \"\\t  // IE8-\\n\",\n       \"\\t  } else if (ONREADYSTATECHANGE in cel('script')) {\\n\",\n       \"\\t    defer = function (id) {\\n\",\n       \"\\t      html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function () {\\n\",\n       \"\\t        html.removeChild(this);\\n\",\n       \"\\t        run.call(id);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // Rest old browsers\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    defer = function (id) {\\n\",\n       \"\\t      setTimeout(ctx(run, id, 1), 0);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t}\\n\",\n       \"\\tmodule.exports = {\\n\",\n       \"\\t  set: setTask,\\n\",\n       \"\\t  clear: clearTask\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 222 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar macrotask = __webpack_require__(221).set;\\n\",\n       \"\\tvar Observer = global.MutationObserver || global.WebKitMutationObserver;\\n\",\n       \"\\tvar process = global.process;\\n\",\n       \"\\tvar Promise = global.Promise;\\n\",\n       \"\\tvar isNode = __webpack_require__(42)(process) == 'process';\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function () {\\n\",\n       \"\\t  var head, last, notify;\\n\",\n       \"\\t\\n\",\n       \"\\t  var flush = function () {\\n\",\n       \"\\t    var parent, fn;\\n\",\n       \"\\t    if (isNode && (parent = process.domain)) parent.exit();\\n\",\n       \"\\t    while (head) {\\n\",\n       \"\\t      fn = head.fn;\\n\",\n       \"\\t      head = head.next;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        fn();\\n\",\n       \"\\t      } catch (e) {\\n\",\n       \"\\t        if (head) notify();\\n\",\n       \"\\t        else last = undefined;\\n\",\n       \"\\t        throw e;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } last = undefined;\\n\",\n       \"\\t    if (parent) parent.enter();\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  // Node.js\\n\",\n       \"\\t  if (isNode) {\\n\",\n       \"\\t    notify = function () {\\n\",\n       \"\\t      process.nextTick(flush);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // browsers with MutationObserver, except iOS Safari - https://github.com/zloirock/core-js/issues/339\\n\",\n       \"\\t  } else if (Observer && !(global.navigator && global.navigator.standalone)) {\\n\",\n       \"\\t    var toggle = true;\\n\",\n       \"\\t    var node = document.createTextNode('');\\n\",\n       \"\\t    new Observer(flush).observe(node, { characterData: true }); // eslint-disable-line no-new\\n\",\n       \"\\t    notify = function () {\\n\",\n       \"\\t      node.data = toggle = !toggle;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // environments with maybe non-completely correct, but existent Promise\\n\",\n       \"\\t  } else if (Promise && Promise.resolve) {\\n\",\n       \"\\t    // Promise.resolve without an argument throws an error in LG WebOS 2\\n\",\n       \"\\t    var promise = Promise.resolve(undefined);\\n\",\n       \"\\t    notify = function () {\\n\",\n       \"\\t      promise.then(flush);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  // for other environments - macrotask based on:\\n\",\n       \"\\t  // - setImmediate\\n\",\n       \"\\t  // - MessageChannel\\n\",\n       \"\\t  // - window.postMessag\\n\",\n       \"\\t  // - onreadystatechange\\n\",\n       \"\\t  // - setTimeout\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    notify = function () {\\n\",\n       \"\\t      // strange IE + webpack dev server bug - use .call(global)\\n\",\n       \"\\t      macrotask.call(global, flush);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  return function (fn) {\\n\",\n       \"\\t    var task = { fn: fn, next: undefined };\\n\",\n       \"\\t    if (last) last.next = task;\\n\",\n       \"\\t    if (!head) {\\n\",\n       \"\\t      head = task;\\n\",\n       \"\\t      notify();\\n\",\n       \"\\t    } last = task;\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 223 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 25.4.1.5 NewPromiseCapability(C)\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction PromiseCapability(C) {\\n\",\n       \"\\t  var resolve, reject;\\n\",\n       \"\\t  this.promise = new C(function ($$resolve, $$reject) {\\n\",\n       \"\\t    if (resolve !== undefined || reject !== undefined) throw TypeError('Bad Promise constructor');\\n\",\n       \"\\t    resolve = $$resolve;\\n\",\n       \"\\t    reject = $$reject;\\n\",\n       \"\\t  });\\n\",\n       \"\\t  this.resolve = aFunction(resolve);\\n\",\n       \"\\t  this.reject = aFunction(reject);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports.f = function (C) {\\n\",\n       \"\\t  return new PromiseCapability(C);\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 224 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (exec) {\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    return { e: false, v: exec() };\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    return { e: true, v: e };\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 225 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar navigator = global.navigator;\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = navigator && navigator.userAgent || '';\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 226 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar newPromiseCapability = __webpack_require__(223);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (C, x) {\\n\",\n       \"\\t  anObject(C);\\n\",\n       \"\\t  if (isObject(x) && x.constructor === C) return x;\\n\",\n       \"\\t  var promiseCapability = newPromiseCapability.f(C);\\n\",\n       \"\\t  var resolve = promiseCapability.resolve;\\n\",\n       \"\\t  resolve(x);\\n\",\n       \"\\t  return promiseCapability.promise;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 227 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tmodule.exports = function (target, src, safe) {\\n\",\n       \"\\t  for (var key in src) redefine(target, key, src[key], safe);\\n\",\n       \"\\t  return target;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 228 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar strong = __webpack_require__(229);\\n\",\n       \"\\tvar validate = __webpack_require__(230);\\n\",\n       \"\\tvar MAP = 'Map';\\n\",\n       \"\\t\\n\",\n       \"\\t// 23.1 Map Objects\\n\",\n       \"\\tmodule.exports = __webpack_require__(231)(MAP, function (get) {\\n\",\n       \"\\t  return function Map() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\\n\",\n       \"\\t}, {\\n\",\n       \"\\t  // 23.1.3.6 Map.prototype.get(key)\\n\",\n       \"\\t  get: function get(key) {\\n\",\n       \"\\t    var entry = strong.getEntry(validate(this, MAP), key);\\n\",\n       \"\\t    return entry && entry.v;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  // 23.1.3.9 Map.prototype.set(key, value)\\n\",\n       \"\\t  set: function set(key, value) {\\n\",\n       \"\\t    return strong.def(validate(this, MAP), key === 0 ? 0 : key, value);\\n\",\n       \"\\t  }\\n\",\n       \"\\t}, strong, true);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 229 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar dP = __webpack_require__(18).f;\\n\",\n       \"\\tvar create = __webpack_require__(53);\\n\",\n       \"\\tvar redefineAll = __webpack_require__(227);\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar anInstance = __webpack_require__(219);\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\tvar $iterDefine = __webpack_require__(136);\\n\",\n       \"\\tvar step = __webpack_require__(203);\\n\",\n       \"\\tvar setSpecies = __webpack_require__(201);\\n\",\n       \"\\tvar DESCRIPTORS = __webpack_require__(13);\\n\",\n       \"\\tvar fastKey = __webpack_require__(32).fastKey;\\n\",\n       \"\\tvar validate = __webpack_require__(230);\\n\",\n       \"\\tvar SIZE = DESCRIPTORS ? '_s' : 'size';\\n\",\n       \"\\t\\n\",\n       \"\\tvar getEntry = function (that, key) {\\n\",\n       \"\\t  // fast case\\n\",\n       \"\\t  var index = fastKey(key);\\n\",\n       \"\\t  var entry;\\n\",\n       \"\\t  if (index !== 'F') return that._i[index];\\n\",\n       \"\\t  // frozen object case\\n\",\n       \"\\t  for (entry = that._f; entry; entry = entry.n) {\\n\",\n       \"\\t    if (entry.k == key) return entry;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = {\\n\",\n       \"\\t  getConstructor: function (wrapper, NAME, IS_MAP, ADDER) {\\n\",\n       \"\\t    var C = wrapper(function (that, iterable) {\\n\",\n       \"\\t      anInstance(that, C, NAME, '_i');\\n\",\n       \"\\t      that._t = NAME;         // collection type\\n\",\n       \"\\t      that._i = create(null); // index\\n\",\n       \"\\t      that._f = undefined;    // first entry\\n\",\n       \"\\t      that._l = undefined;    // last entry\\n\",\n       \"\\t      that[SIZE] = 0;         // size\\n\",\n       \"\\t      if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    redefineAll(C.prototype, {\\n\",\n       \"\\t      // 23.1.3.1 Map.prototype.clear()\\n\",\n       \"\\t      // 23.2.3.2 Set.prototype.clear()\\n\",\n       \"\\t      clear: function clear() {\\n\",\n       \"\\t        for (var that = validate(this, NAME), data = that._i, entry = that._f; entry; entry = entry.n) {\\n\",\n       \"\\t          entry.r = true;\\n\",\n       \"\\t          if (entry.p) entry.p = entry.p.n = undefined;\\n\",\n       \"\\t          delete data[entry.i];\\n\",\n       \"\\t        }\\n\",\n       \"\\t        that._f = that._l = undefined;\\n\",\n       \"\\t        that[SIZE] = 0;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      // 23.1.3.3 Map.prototype.delete(key)\\n\",\n       \"\\t      // 23.2.3.4 Set.prototype.delete(value)\\n\",\n       \"\\t      'delete': function (key) {\\n\",\n       \"\\t        var that = validate(this, NAME);\\n\",\n       \"\\t        var entry = getEntry(that, key);\\n\",\n       \"\\t        if (entry) {\\n\",\n       \"\\t          var next = entry.n;\\n\",\n       \"\\t          var prev = entry.p;\\n\",\n       \"\\t          delete that._i[entry.i];\\n\",\n       \"\\t          entry.r = true;\\n\",\n       \"\\t          if (prev) prev.n = next;\\n\",\n       \"\\t          if (next) next.p = prev;\\n\",\n       \"\\t          if (that._f == entry) that._f = next;\\n\",\n       \"\\t          if (that._l == entry) that._l = prev;\\n\",\n       \"\\t          that[SIZE]--;\\n\",\n       \"\\t        } return !!entry;\\n\",\n       \"\\t      },\\n\",\n       \"\\t      // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)\\n\",\n       \"\\t      // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)\\n\",\n       \"\\t      forEach: function forEach(callbackfn /* , that = undefined */) {\\n\",\n       \"\\t        validate(this, NAME);\\n\",\n       \"\\t        var f = ctx(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3);\\n\",\n       \"\\t        var entry;\\n\",\n       \"\\t        while (entry = entry ? entry.n : this._f) {\\n\",\n       \"\\t          f(entry.v, entry.k, this);\\n\",\n       \"\\t          // revert to the last existing entry\\n\",\n       \"\\t          while (entry && entry.r) entry = entry.p;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      },\\n\",\n       \"\\t      // 23.1.3.7 Map.prototype.has(key)\\n\",\n       \"\\t      // 23.2.3.7 Set.prototype.has(value)\\n\",\n       \"\\t      has: function has(key) {\\n\",\n       \"\\t        return !!getEntry(validate(this, NAME), key);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t    if (DESCRIPTORS) dP(C.prototype, 'size', {\\n\",\n       \"\\t      get: function () {\\n\",\n       \"\\t        return validate(this, NAME)[SIZE];\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return C;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  def: function (that, key, value) {\\n\",\n       \"\\t    var entry = getEntry(that, key);\\n\",\n       \"\\t    var prev, index;\\n\",\n       \"\\t    // change existing entry\\n\",\n       \"\\t    if (entry) {\\n\",\n       \"\\t      entry.v = value;\\n\",\n       \"\\t    // create new entry\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      that._l = entry = {\\n\",\n       \"\\t        i: index = fastKey(key, true), // <- index\\n\",\n       \"\\t        k: key,                        // <- key\\n\",\n       \"\\t        v: value,                      // <- value\\n\",\n       \"\\t        p: prev = that._l,             // <- previous entry\\n\",\n       \"\\t        n: undefined,                  // <- next entry\\n\",\n       \"\\t        r: false                       // <- removed\\n\",\n       \"\\t      };\\n\",\n       \"\\t      if (!that._f) that._f = entry;\\n\",\n       \"\\t      if (prev) prev.n = entry;\\n\",\n       \"\\t      that[SIZE]++;\\n\",\n       \"\\t      // add to index\\n\",\n       \"\\t      if (index !== 'F') that._i[index] = entry;\\n\",\n       \"\\t    } return that;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  getEntry: getEntry,\\n\",\n       \"\\t  setStrong: function (C, NAME, IS_MAP) {\\n\",\n       \"\\t    // add .keys, .values, .entries, [@@iterator]\\n\",\n       \"\\t    // 23.1.3.4, 23.1.3.8, 23.1.3.11, 23.1.3.12, 23.2.3.5, 23.2.3.8, 23.2.3.10, 23.2.3.11\\n\",\n       \"\\t    $iterDefine(C, NAME, function (iterated, kind) {\\n\",\n       \"\\t      this._t = validate(iterated, NAME); // target\\n\",\n       \"\\t      this._k = kind;                     // kind\\n\",\n       \"\\t      this._l = undefined;                // previous\\n\",\n       \"\\t    }, function () {\\n\",\n       \"\\t      var that = this;\\n\",\n       \"\\t      var kind = that._k;\\n\",\n       \"\\t      var entry = that._l;\\n\",\n       \"\\t      // revert to the last existing entry\\n\",\n       \"\\t      while (entry && entry.r) entry = entry.p;\\n\",\n       \"\\t      // get next entry\\n\",\n       \"\\t      if (!that._t || !(that._l = entry = entry ? entry.n : that._t._f)) {\\n\",\n       \"\\t        // or finish the iteration\\n\",\n       \"\\t        that._t = undefined;\\n\",\n       \"\\t        return step(1);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // return step by kind\\n\",\n       \"\\t      if (kind == 'keys') return step(0, entry.k);\\n\",\n       \"\\t      if (kind == 'values') return step(0, entry.v);\\n\",\n       \"\\t      return step(0, [entry.k, entry.v]);\\n\",\n       \"\\t    }, IS_MAP ? 'entries' : 'values', !IS_MAP, true);\\n\",\n       \"\\t\\n\",\n       \"\\t    // add [@@species], 23.1.2.2, 23.2.2.2\\n\",\n       \"\\t    setSpecies(NAME);\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 230 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tmodule.exports = function (it, TYPE) {\\n\",\n       \"\\t  if (!isObject(it) || it._t !== TYPE) throw TypeError('Incompatible receiver, ' + TYPE + ' required!');\\n\",\n       \"\\t  return it;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 231 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar redefineAll = __webpack_require__(227);\\n\",\n       \"\\tvar meta = __webpack_require__(32);\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\tvar anInstance = __webpack_require__(219);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar $iterDetect = __webpack_require__(174);\\n\",\n       \"\\tvar setToStringTag = __webpack_require__(33);\\n\",\n       \"\\tvar inheritIfRequired = __webpack_require__(95);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (NAME, wrapper, methods, common, IS_MAP, IS_WEAK) {\\n\",\n       \"\\t  var Base = global[NAME];\\n\",\n       \"\\t  var C = Base;\\n\",\n       \"\\t  var ADDER = IS_MAP ? 'set' : 'add';\\n\",\n       \"\\t  var proto = C && C.prototype;\\n\",\n       \"\\t  var O = {};\\n\",\n       \"\\t  var fixMethod = function (KEY) {\\n\",\n       \"\\t    var fn = proto[KEY];\\n\",\n       \"\\t    redefine(proto, KEY,\\n\",\n       \"\\t      KEY == 'delete' ? function (a) {\\n\",\n       \"\\t        return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);\\n\",\n       \"\\t      } : KEY == 'has' ? function has(a) {\\n\",\n       \"\\t        return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a);\\n\",\n       \"\\t      } : KEY == 'get' ? function get(a) {\\n\",\n       \"\\t        return IS_WEAK && !isObject(a) ? undefined : fn.call(this, a === 0 ? 0 : a);\\n\",\n       \"\\t      } : KEY == 'add' ? function add(a) { fn.call(this, a === 0 ? 0 : a); return this; }\\n\",\n       \"\\t        : function set(a, b) { fn.call(this, a === 0 ? 0 : a, b); return this; }\\n\",\n       \"\\t    );\\n\",\n       \"\\t  };\\n\",\n       \"\\t  if (typeof C != 'function' || !(IS_WEAK || proto.forEach && !fails(function () {\\n\",\n       \"\\t    new C().entries().next();\\n\",\n       \"\\t  }))) {\\n\",\n       \"\\t    // create collection constructor\\n\",\n       \"\\t    C = common.getConstructor(wrapper, NAME, IS_MAP, ADDER);\\n\",\n       \"\\t    redefineAll(C.prototype, methods);\\n\",\n       \"\\t    meta.NEED = true;\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    var instance = new C();\\n\",\n       \"\\t    // early implementations not supports chaining\\n\",\n       \"\\t    var HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance;\\n\",\n       \"\\t    // V8 ~  Chromium 40- weak-collections throws on primitives, but should return false\\n\",\n       \"\\t    var THROWS_ON_PRIMITIVES = fails(function () { instance.has(1); });\\n\",\n       \"\\t    // most early implementations doesn't supports iterables, most modern - not close it correctly\\n\",\n       \"\\t    var ACCEPT_ITERABLES = $iterDetect(function (iter) { new C(iter); }); // eslint-disable-line no-new\\n\",\n       \"\\t    // for early implementations -0 and +0 not the same\\n\",\n       \"\\t    var BUGGY_ZERO = !IS_WEAK && fails(function () {\\n\",\n       \"\\t      // V8 ~ Chromium 42- fails only with 5+ elements\\n\",\n       \"\\t      var $instance = new C();\\n\",\n       \"\\t      var index = 5;\\n\",\n       \"\\t      while (index--) $instance[ADDER](index, index);\\n\",\n       \"\\t      return !$instance.has(-0);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    if (!ACCEPT_ITERABLES) {\\n\",\n       \"\\t      C = wrapper(function (target, iterable) {\\n\",\n       \"\\t        anInstance(target, C, NAME);\\n\",\n       \"\\t        var that = inheritIfRequired(new Base(), target, C);\\n\",\n       \"\\t        if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\\n\",\n       \"\\t        return that;\\n\",\n       \"\\t      });\\n\",\n       \"\\t      C.prototype = proto;\\n\",\n       \"\\t      proto.constructor = C;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (THROWS_ON_PRIMITIVES || BUGGY_ZERO) {\\n\",\n       \"\\t      fixMethod('delete');\\n\",\n       \"\\t      fixMethod('has');\\n\",\n       \"\\t      IS_MAP && fixMethod('get');\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (BUGGY_ZERO || HASNT_CHAINING) fixMethod(ADDER);\\n\",\n       \"\\t    // weak collections should not contains .clear method\\n\",\n       \"\\t    if (IS_WEAK && proto.clear) delete proto.clear;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  setToStringTag(C, NAME);\\n\",\n       \"\\t\\n\",\n       \"\\t  O[NAME] = C;\\n\",\n       \"\\t  $export($export.G + $export.W + $export.F * (C != Base), O);\\n\",\n       \"\\t\\n\",\n       \"\\t  if (!IS_WEAK) common.setStrong(C, NAME, IS_MAP);\\n\",\n       \"\\t\\n\",\n       \"\\t  return C;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 232 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar strong = __webpack_require__(229);\\n\",\n       \"\\tvar validate = __webpack_require__(230);\\n\",\n       \"\\tvar SET = 'Set';\\n\",\n       \"\\t\\n\",\n       \"\\t// 23.2 Set Objects\\n\",\n       \"\\tmodule.exports = __webpack_require__(231)(SET, function (get) {\\n\",\n       \"\\t  return function Set() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\\n\",\n       \"\\t}, {\\n\",\n       \"\\t  // 23.2.3.1 Set.prototype.add(value)\\n\",\n       \"\\t  add: function add(value) {\\n\",\n       \"\\t    return strong.def(validate(this, SET), value = value === 0 ? 0 : value, value);\\n\",\n       \"\\t  }\\n\",\n       \"\\t}, strong);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 233 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar each = __webpack_require__(181)(0);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar meta = __webpack_require__(32);\\n\",\n       \"\\tvar assign = __webpack_require__(76);\\n\",\n       \"\\tvar weak = __webpack_require__(234);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar validate = __webpack_require__(230);\\n\",\n       \"\\tvar NATIVE_WEAK_MAP = __webpack_require__(230);\\n\",\n       \"\\tvar IS_IE11 = !global.ActiveXObject && 'ActiveXObject' in global;\\n\",\n       \"\\tvar WEAK_MAP = 'WeakMap';\\n\",\n       \"\\tvar getWeak = meta.getWeak;\\n\",\n       \"\\tvar isExtensible = Object.isExtensible;\\n\",\n       \"\\tvar uncaughtFrozenStore = weak.ufstore;\\n\",\n       \"\\tvar InternalMap;\\n\",\n       \"\\t\\n\",\n       \"\\tvar wrapper = function (get) {\\n\",\n       \"\\t  return function WeakMap() {\\n\",\n       \"\\t    return get(this, arguments.length > 0 ? arguments[0] : undefined);\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar methods = {\\n\",\n       \"\\t  // 23.3.3.3 WeakMap.prototype.get(key)\\n\",\n       \"\\t  get: function get(key) {\\n\",\n       \"\\t    if (isObject(key)) {\\n\",\n       \"\\t      var data = getWeak(key);\\n\",\n       \"\\t      if (data === true) return uncaughtFrozenStore(validate(this, WEAK_MAP)).get(key);\\n\",\n       \"\\t      return data ? data[this._i] : undefined;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  },\\n\",\n       \"\\t  // 23.3.3.5 WeakMap.prototype.set(key, value)\\n\",\n       \"\\t  set: function set(key, value) {\\n\",\n       \"\\t    return weak.def(validate(this, WEAK_MAP), key, value);\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t// 23.3 WeakMap Objects\\n\",\n       \"\\tvar $WeakMap = module.exports = __webpack_require__(231)(WEAK_MAP, wrapper, methods, weak, true, true);\\n\",\n       \"\\t\\n\",\n       \"\\t// IE11 WeakMap frozen keys fix\\n\",\n       \"\\tif (NATIVE_WEAK_MAP && IS_IE11) {\\n\",\n       \"\\t  InternalMap = weak.getConstructor(wrapper, WEAK_MAP);\\n\",\n       \"\\t  assign(InternalMap.prototype, methods);\\n\",\n       \"\\t  meta.NEED = true;\\n\",\n       \"\\t  each(['delete', 'has', 'get', 'set'], function (key) {\\n\",\n       \"\\t    var proto = $WeakMap.prototype;\\n\",\n       \"\\t    var method = proto[key];\\n\",\n       \"\\t    redefine(proto, key, function (a, b) {\\n\",\n       \"\\t      // store frozen objects on internal weakmap shim\\n\",\n       \"\\t      if (isObject(a) && !isExtensible(a)) {\\n\",\n       \"\\t        if (!this._f) this._f = new InternalMap();\\n\",\n       \"\\t        var result = this._f[key](a, b);\\n\",\n       \"\\t        return key == 'set' ? this : result;\\n\",\n       \"\\t      // store all the rest on native weakmap\\n\",\n       \"\\t      } return method.call(this, a, b);\\n\",\n       \"\\t    });\\n\",\n       \"\\t  });\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 234 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar redefineAll = __webpack_require__(227);\\n\",\n       \"\\tvar getWeak = __webpack_require__(32).getWeak;\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar anInstance = __webpack_require__(219);\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\tvar createArrayMethod = __webpack_require__(181);\\n\",\n       \"\\tvar $has = __webpack_require__(12);\\n\",\n       \"\\tvar validate = __webpack_require__(230);\\n\",\n       \"\\tvar arrayFind = createArrayMethod(5);\\n\",\n       \"\\tvar arrayFindIndex = createArrayMethod(6);\\n\",\n       \"\\tvar id = 0;\\n\",\n       \"\\t\\n\",\n       \"\\t// fallback for uncaught frozen keys\\n\",\n       \"\\tvar uncaughtFrozenStore = function (that) {\\n\",\n       \"\\t  return that._l || (that._l = new UncaughtFrozenStore());\\n\",\n       \"\\t};\\n\",\n       \"\\tvar UncaughtFrozenStore = function () {\\n\",\n       \"\\t  this.a = [];\\n\",\n       \"\\t};\\n\",\n       \"\\tvar findUncaughtFrozen = function (store, key) {\\n\",\n       \"\\t  return arrayFind(store.a, function (it) {\\n\",\n       \"\\t    return it[0] === key;\\n\",\n       \"\\t  });\\n\",\n       \"\\t};\\n\",\n       \"\\tUncaughtFrozenStore.prototype = {\\n\",\n       \"\\t  get: function (key) {\\n\",\n       \"\\t    var entry = findUncaughtFrozen(this, key);\\n\",\n       \"\\t    if (entry) return entry[1];\\n\",\n       \"\\t  },\\n\",\n       \"\\t  has: function (key) {\\n\",\n       \"\\t    return !!findUncaughtFrozen(this, key);\\n\",\n       \"\\t  },\\n\",\n       \"\\t  set: function (key, value) {\\n\",\n       \"\\t    var entry = findUncaughtFrozen(this, key);\\n\",\n       \"\\t    if (entry) entry[1] = value;\\n\",\n       \"\\t    else this.a.push([key, value]);\\n\",\n       \"\\t  },\\n\",\n       \"\\t  'delete': function (key) {\\n\",\n       \"\\t    var index = arrayFindIndex(this.a, function (it) {\\n\",\n       \"\\t      return it[0] === key;\\n\",\n       \"\\t    });\\n\",\n       \"\\t    if (~index) this.a.splice(index, 1);\\n\",\n       \"\\t    return !!~index;\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = {\\n\",\n       \"\\t  getConstructor: function (wrapper, NAME, IS_MAP, ADDER) {\\n\",\n       \"\\t    var C = wrapper(function (that, iterable) {\\n\",\n       \"\\t      anInstance(that, C, NAME, '_i');\\n\",\n       \"\\t      that._t = NAME;      // collection type\\n\",\n       \"\\t      that._i = id++;      // collection id\\n\",\n       \"\\t      that._l = undefined; // leak store for uncaught frozen objects\\n\",\n       \"\\t      if (iterable != undefined) forOf(iterable, IS_MAP, that[ADDER], that);\\n\",\n       \"\\t    });\\n\",\n       \"\\t    redefineAll(C.prototype, {\\n\",\n       \"\\t      // 23.3.3.2 WeakMap.prototype.delete(key)\\n\",\n       \"\\t      // 23.4.3.3 WeakSet.prototype.delete(value)\\n\",\n       \"\\t      'delete': function (key) {\\n\",\n       \"\\t        if (!isObject(key)) return false;\\n\",\n       \"\\t        var data = getWeak(key);\\n\",\n       \"\\t        if (data === true) return uncaughtFrozenStore(validate(this, NAME))['delete'](key);\\n\",\n       \"\\t        return data && $has(data, this._i) && delete data[this._i];\\n\",\n       \"\\t      },\\n\",\n       \"\\t      // 23.3.3.4 WeakMap.prototype.has(key)\\n\",\n       \"\\t      // 23.4.3.4 WeakSet.prototype.has(value)\\n\",\n       \"\\t      has: function has(key) {\\n\",\n       \"\\t        if (!isObject(key)) return false;\\n\",\n       \"\\t        var data = getWeak(key);\\n\",\n       \"\\t        if (data === true) return uncaughtFrozenStore(validate(this, NAME)).has(key);\\n\",\n       \"\\t        return data && $has(data, this._i);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    });\\n\",\n       \"\\t    return C;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  def: function (that, key, value) {\\n\",\n       \"\\t    var data = getWeak(anObject(key), true);\\n\",\n       \"\\t    if (data === true) uncaughtFrozenStore(that).set(key, value);\\n\",\n       \"\\t    else data[that._i] = value;\\n\",\n       \"\\t    return that;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  ufstore: uncaughtFrozenStore\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 235 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar weak = __webpack_require__(234);\\n\",\n       \"\\tvar validate = __webpack_require__(230);\\n\",\n       \"\\tvar WEAK_SET = 'WeakSet';\\n\",\n       \"\\t\\n\",\n       \"\\t// 23.4 WeakSet Objects\\n\",\n       \"\\t__webpack_require__(231)(WEAK_SET, function (get) {\\n\",\n       \"\\t  return function WeakSet() { return get(this, arguments.length > 0 ? arguments[0] : undefined); };\\n\",\n       \"\\t}, {\\n\",\n       \"\\t  // 23.4.3.1 WeakSet.prototype.add(value)\\n\",\n       \"\\t  add: function add(value) {\\n\",\n       \"\\t    return weak.def(validate(this, WEAK_SET), value, true);\\n\",\n       \"\\t  }\\n\",\n       \"\\t}, weak, false, true);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 236 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $typed = __webpack_require__(237);\\n\",\n       \"\\tvar buffer = __webpack_require__(238);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar ArrayBuffer = __webpack_require__(11).ArrayBuffer;\\n\",\n       \"\\tvar speciesConstructor = __webpack_require__(217);\\n\",\n       \"\\tvar $ArrayBuffer = buffer.ArrayBuffer;\\n\",\n       \"\\tvar $DataView = buffer.DataView;\\n\",\n       \"\\tvar $isView = $typed.ABV && ArrayBuffer.isView;\\n\",\n       \"\\tvar $slice = $ArrayBuffer.prototype.slice;\\n\",\n       \"\\tvar VIEW = $typed.VIEW;\\n\",\n       \"\\tvar ARRAY_BUFFER = 'ArrayBuffer';\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.G + $export.W + $export.F * (ArrayBuffer !== $ArrayBuffer), { ArrayBuffer: $ArrayBuffer });\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * !$typed.CONSTR, ARRAY_BUFFER, {\\n\",\n       \"\\t  // 24.1.3.1 ArrayBuffer.isView(arg)\\n\",\n       \"\\t  isView: function isView(it) {\\n\",\n       \"\\t    return $isView && $isView(it) || isObject(it) && VIEW in it;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.U + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  return !new $ArrayBuffer(2).slice(1, undefined).byteLength;\\n\",\n       \"\\t}), ARRAY_BUFFER, {\\n\",\n       \"\\t  // 24.1.4.3 ArrayBuffer.prototype.slice(start, end)\\n\",\n       \"\\t  slice: function slice(start, end) {\\n\",\n       \"\\t    if ($slice !== undefined && end === undefined) return $slice.call(anObject(this), start); // FF fix\\n\",\n       \"\\t    var len = anObject(this).byteLength;\\n\",\n       \"\\t    var first = toAbsoluteIndex(start, len);\\n\",\n       \"\\t    var fin = toAbsoluteIndex(end === undefined ? len : end, len);\\n\",\n       \"\\t    var result = new (speciesConstructor(this, $ArrayBuffer))(toLength(fin - first));\\n\",\n       \"\\t    var viewS = new $DataView(this);\\n\",\n       \"\\t    var viewT = new $DataView(result);\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    while (first < fin) {\\n\",\n       \"\\t      viewT.setUint8(index++, viewS.getUint8(first++));\\n\",\n       \"\\t    } return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(201)(ARRAY_BUFFER);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 237 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar uid = __webpack_require__(26);\\n\",\n       \"\\tvar TYPED = uid('typed_array');\\n\",\n       \"\\tvar VIEW = uid('view');\\n\",\n       \"\\tvar ABV = !!(global.ArrayBuffer && global.DataView);\\n\",\n       \"\\tvar CONSTR = ABV;\\n\",\n       \"\\tvar i = 0;\\n\",\n       \"\\tvar l = 9;\\n\",\n       \"\\tvar Typed;\\n\",\n       \"\\t\\n\",\n       \"\\tvar TypedArrayConstructors = (\\n\",\n       \"\\t  'Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array'\\n\",\n       \"\\t).split(',');\\n\",\n       \"\\t\\n\",\n       \"\\twhile (i < l) {\\n\",\n       \"\\t  if (Typed = global[TypedArrayConstructors[i++]]) {\\n\",\n       \"\\t    hide(Typed.prototype, TYPED, true);\\n\",\n       \"\\t    hide(Typed.prototype, VIEW, true);\\n\",\n       \"\\t  } else CONSTR = false;\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = {\\n\",\n       \"\\t  ABV: ABV,\\n\",\n       \"\\t  CONSTR: CONSTR,\\n\",\n       \"\\t  TYPED: TYPED,\\n\",\n       \"\\t  VIEW: VIEW\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 238 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar DESCRIPTORS = __webpack_require__(13);\\n\",\n       \"\\tvar LIBRARY = __webpack_require__(29);\\n\",\n       \"\\tvar $typed = __webpack_require__(237);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar redefineAll = __webpack_require__(227);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar anInstance = __webpack_require__(219);\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar toIndex = __webpack_require__(239);\\n\",\n       \"\\tvar gOPN = __webpack_require__(57).f;\\n\",\n       \"\\tvar dP = __webpack_require__(18).f;\\n\",\n       \"\\tvar arrayFill = __webpack_require__(197);\\n\",\n       \"\\tvar setToStringTag = __webpack_require__(33);\\n\",\n       \"\\tvar ARRAY_BUFFER = 'ArrayBuffer';\\n\",\n       \"\\tvar DATA_VIEW = 'DataView';\\n\",\n       \"\\tvar PROTOTYPE = 'prototype';\\n\",\n       \"\\tvar WRONG_LENGTH = 'Wrong length!';\\n\",\n       \"\\tvar WRONG_INDEX = 'Wrong index!';\\n\",\n       \"\\tvar $ArrayBuffer = global[ARRAY_BUFFER];\\n\",\n       \"\\tvar $DataView = global[DATA_VIEW];\\n\",\n       \"\\tvar Math = global.Math;\\n\",\n       \"\\tvar RangeError = global.RangeError;\\n\",\n       \"\\t// eslint-disable-next-line no-shadow-restricted-names\\n\",\n       \"\\tvar Infinity = global.Infinity;\\n\",\n       \"\\tvar BaseBuffer = $ArrayBuffer;\\n\",\n       \"\\tvar abs = Math.abs;\\n\",\n       \"\\tvar pow = Math.pow;\\n\",\n       \"\\tvar floor = Math.floor;\\n\",\n       \"\\tvar log = Math.log;\\n\",\n       \"\\tvar LN2 = Math.LN2;\\n\",\n       \"\\tvar BUFFER = 'buffer';\\n\",\n       \"\\tvar BYTE_LENGTH = 'byteLength';\\n\",\n       \"\\tvar BYTE_OFFSET = 'byteOffset';\\n\",\n       \"\\tvar $BUFFER = DESCRIPTORS ? '_b' : BUFFER;\\n\",\n       \"\\tvar $LENGTH = DESCRIPTORS ? '_l' : BYTE_LENGTH;\\n\",\n       \"\\tvar $OFFSET = DESCRIPTORS ? '_o' : BYTE_OFFSET;\\n\",\n       \"\\t\\n\",\n       \"\\t// IEEE754 conversions based on https://github.com/feross/ieee754\\n\",\n       \"\\tfunction packIEEE754(value, mLen, nBytes) {\\n\",\n       \"\\t  var buffer = new Array(nBytes);\\n\",\n       \"\\t  var eLen = nBytes * 8 - mLen - 1;\\n\",\n       \"\\t  var eMax = (1 << eLen) - 1;\\n\",\n       \"\\t  var eBias = eMax >> 1;\\n\",\n       \"\\t  var rt = mLen === 23 ? pow(2, -24) - pow(2, -77) : 0;\\n\",\n       \"\\t  var i = 0;\\n\",\n       \"\\t  var s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;\\n\",\n       \"\\t  var e, m, c;\\n\",\n       \"\\t  value = abs(value);\\n\",\n       \"\\t  // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t  if (value != value || value === Infinity) {\\n\",\n       \"\\t    // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t    m = value != value ? 1 : 0;\\n\",\n       \"\\t    e = eMax;\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    e = floor(log(value) / LN2);\\n\",\n       \"\\t    if (value * (c = pow(2, -e)) < 1) {\\n\",\n       \"\\t      e--;\\n\",\n       \"\\t      c *= 2;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (e + eBias >= 1) {\\n\",\n       \"\\t      value += rt / c;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      value += rt * pow(2, 1 - eBias);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (value * c >= 2) {\\n\",\n       \"\\t      e++;\\n\",\n       \"\\t      c /= 2;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (e + eBias >= eMax) {\\n\",\n       \"\\t      m = 0;\\n\",\n       \"\\t      e = eMax;\\n\",\n       \"\\t    } else if (e + eBias >= 1) {\\n\",\n       \"\\t      m = (value * c - 1) * pow(2, mLen);\\n\",\n       \"\\t      e = e + eBias;\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      m = value * pow(2, eBias - 1) * pow(2, mLen);\\n\",\n       \"\\t      e = 0;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t  for (; mLen >= 8; buffer[i++] = m & 255, m /= 256, mLen -= 8);\\n\",\n       \"\\t  e = e << mLen | m;\\n\",\n       \"\\t  eLen += mLen;\\n\",\n       \"\\t  for (; eLen > 0; buffer[i++] = e & 255, e /= 256, eLen -= 8);\\n\",\n       \"\\t  buffer[--i] |= s * 128;\\n\",\n       \"\\t  return buffer;\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction unpackIEEE754(buffer, mLen, nBytes) {\\n\",\n       \"\\t  var eLen = nBytes * 8 - mLen - 1;\\n\",\n       \"\\t  var eMax = (1 << eLen) - 1;\\n\",\n       \"\\t  var eBias = eMax >> 1;\\n\",\n       \"\\t  var nBits = eLen - 7;\\n\",\n       \"\\t  var i = nBytes - 1;\\n\",\n       \"\\t  var s = buffer[i--];\\n\",\n       \"\\t  var e = s & 127;\\n\",\n       \"\\t  var m;\\n\",\n       \"\\t  s >>= 7;\\n\",\n       \"\\t  for (; nBits > 0; e = e * 256 + buffer[i], i--, nBits -= 8);\\n\",\n       \"\\t  m = e & (1 << -nBits) - 1;\\n\",\n       \"\\t  e >>= -nBits;\\n\",\n       \"\\t  nBits += mLen;\\n\",\n       \"\\t  for (; nBits > 0; m = m * 256 + buffer[i], i--, nBits -= 8);\\n\",\n       \"\\t  if (e === 0) {\\n\",\n       \"\\t    e = 1 - eBias;\\n\",\n       \"\\t  } else if (e === eMax) {\\n\",\n       \"\\t    return m ? NaN : s ? -Infinity : Infinity;\\n\",\n       \"\\t  } else {\\n\",\n       \"\\t    m = m + pow(2, mLen);\\n\",\n       \"\\t    e = e - eBias;\\n\",\n       \"\\t  } return (s ? -1 : 1) * m * pow(2, e - mLen);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction unpackI32(bytes) {\\n\",\n       \"\\t  return bytes[3] << 24 | bytes[2] << 16 | bytes[1] << 8 | bytes[0];\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction packI8(it) {\\n\",\n       \"\\t  return [it & 0xff];\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction packI16(it) {\\n\",\n       \"\\t  return [it & 0xff, it >> 8 & 0xff];\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction packI32(it) {\\n\",\n       \"\\t  return [it & 0xff, it >> 8 & 0xff, it >> 16 & 0xff, it >> 24 & 0xff];\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction packF64(it) {\\n\",\n       \"\\t  return packIEEE754(it, 52, 8);\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction packF32(it) {\\n\",\n       \"\\t  return packIEEE754(it, 23, 4);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction addGetter(C, key, internal) {\\n\",\n       \"\\t  dP(C[PROTOTYPE], key, { get: function () { return this[internal]; } });\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction get(view, bytes, index, isLittleEndian) {\\n\",\n       \"\\t  var numIndex = +index;\\n\",\n       \"\\t  var intIndex = toIndex(numIndex);\\n\",\n       \"\\t  if (intIndex + bytes > view[$LENGTH]) throw RangeError(WRONG_INDEX);\\n\",\n       \"\\t  var store = view[$BUFFER]._b;\\n\",\n       \"\\t  var start = intIndex + view[$OFFSET];\\n\",\n       \"\\t  var pack = store.slice(start, start + bytes);\\n\",\n       \"\\t  return isLittleEndian ? pack : pack.reverse();\\n\",\n       \"\\t}\\n\",\n       \"\\tfunction set(view, bytes, index, conversion, value, isLittleEndian) {\\n\",\n       \"\\t  var numIndex = +index;\\n\",\n       \"\\t  var intIndex = toIndex(numIndex);\\n\",\n       \"\\t  if (intIndex + bytes > view[$LENGTH]) throw RangeError(WRONG_INDEX);\\n\",\n       \"\\t  var store = view[$BUFFER]._b;\\n\",\n       \"\\t  var start = intIndex + view[$OFFSET];\\n\",\n       \"\\t  var pack = conversion(+value);\\n\",\n       \"\\t  for (var i = 0; i < bytes; i++) store[start + i] = pack[isLittleEndian ? i : bytes - i - 1];\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tif (!$typed.ABV) {\\n\",\n       \"\\t  $ArrayBuffer = function ArrayBuffer(length) {\\n\",\n       \"\\t    anInstance(this, $ArrayBuffer, ARRAY_BUFFER);\\n\",\n       \"\\t    var byteLength = toIndex(length);\\n\",\n       \"\\t    this._b = arrayFill.call(new Array(byteLength), 0);\\n\",\n       \"\\t    this[$LENGTH] = byteLength;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  $DataView = function DataView(buffer, byteOffset, byteLength) {\\n\",\n       \"\\t    anInstance(this, $DataView, DATA_VIEW);\\n\",\n       \"\\t    anInstance(buffer, $ArrayBuffer, DATA_VIEW);\\n\",\n       \"\\t    var bufferLength = buffer[$LENGTH];\\n\",\n       \"\\t    var offset = toInteger(byteOffset);\\n\",\n       \"\\t    if (offset < 0 || offset > bufferLength) throw RangeError('Wrong offset!');\\n\",\n       \"\\t    byteLength = byteLength === undefined ? bufferLength - offset : toLength(byteLength);\\n\",\n       \"\\t    if (offset + byteLength > bufferLength) throw RangeError(WRONG_LENGTH);\\n\",\n       \"\\t    this[$BUFFER] = buffer;\\n\",\n       \"\\t    this[$OFFSET] = offset;\\n\",\n       \"\\t    this[$LENGTH] = byteLength;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  if (DESCRIPTORS) {\\n\",\n       \"\\t    addGetter($ArrayBuffer, BYTE_LENGTH, '_l');\\n\",\n       \"\\t    addGetter($DataView, BUFFER, '_b');\\n\",\n       \"\\t    addGetter($DataView, BYTE_LENGTH, '_l');\\n\",\n       \"\\t    addGetter($DataView, BYTE_OFFSET, '_o');\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  redefineAll($DataView[PROTOTYPE], {\\n\",\n       \"\\t    getInt8: function getInt8(byteOffset) {\\n\",\n       \"\\t      return get(this, 1, byteOffset)[0] << 24 >> 24;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getUint8: function getUint8(byteOffset) {\\n\",\n       \"\\t      return get(this, 1, byteOffset)[0];\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getInt16: function getInt16(byteOffset /* , littleEndian */) {\\n\",\n       \"\\t      var bytes = get(this, 2, byteOffset, arguments[1]);\\n\",\n       \"\\t      return (bytes[1] << 8 | bytes[0]) << 16 >> 16;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getUint16: function getUint16(byteOffset /* , littleEndian */) {\\n\",\n       \"\\t      var bytes = get(this, 2, byteOffset, arguments[1]);\\n\",\n       \"\\t      return bytes[1] << 8 | bytes[0];\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getInt32: function getInt32(byteOffset /* , littleEndian */) {\\n\",\n       \"\\t      return unpackI32(get(this, 4, byteOffset, arguments[1]));\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getUint32: function getUint32(byteOffset /* , littleEndian */) {\\n\",\n       \"\\t      return unpackI32(get(this, 4, byteOffset, arguments[1])) >>> 0;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getFloat32: function getFloat32(byteOffset /* , littleEndian */) {\\n\",\n       \"\\t      return unpackIEEE754(get(this, 4, byteOffset, arguments[1]), 23, 4);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    getFloat64: function getFloat64(byteOffset /* , littleEndian */) {\\n\",\n       \"\\t      return unpackIEEE754(get(this, 8, byteOffset, arguments[1]), 52, 8);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setInt8: function setInt8(byteOffset, value) {\\n\",\n       \"\\t      set(this, 1, byteOffset, packI8, value);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setUint8: function setUint8(byteOffset, value) {\\n\",\n       \"\\t      set(this, 1, byteOffset, packI8, value);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setInt16: function setInt16(byteOffset, value /* , littleEndian */) {\\n\",\n       \"\\t      set(this, 2, byteOffset, packI16, value, arguments[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setUint16: function setUint16(byteOffset, value /* , littleEndian */) {\\n\",\n       \"\\t      set(this, 2, byteOffset, packI16, value, arguments[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setInt32: function setInt32(byteOffset, value /* , littleEndian */) {\\n\",\n       \"\\t      set(this, 4, byteOffset, packI32, value, arguments[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setUint32: function setUint32(byteOffset, value /* , littleEndian */) {\\n\",\n       \"\\t      set(this, 4, byteOffset, packI32, value, arguments[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setFloat32: function setFloat32(byteOffset, value /* , littleEndian */) {\\n\",\n       \"\\t      set(this, 4, byteOffset, packF32, value, arguments[2]);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setFloat64: function setFloat64(byteOffset, value /* , littleEndian */) {\\n\",\n       \"\\t      set(this, 8, byteOffset, packF64, value, arguments[2]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  });\\n\",\n       \"\\t} else {\\n\",\n       \"\\t  if (!fails(function () {\\n\",\n       \"\\t    $ArrayBuffer(1);\\n\",\n       \"\\t  }) || !fails(function () {\\n\",\n       \"\\t    new $ArrayBuffer(-1); // eslint-disable-line no-new\\n\",\n       \"\\t  }) || fails(function () {\\n\",\n       \"\\t    new $ArrayBuffer(); // eslint-disable-line no-new\\n\",\n       \"\\t    new $ArrayBuffer(1.5); // eslint-disable-line no-new\\n\",\n       \"\\t    new $ArrayBuffer(NaN); // eslint-disable-line no-new\\n\",\n       \"\\t    return $ArrayBuffer.name != ARRAY_BUFFER;\\n\",\n       \"\\t  })) {\\n\",\n       \"\\t    $ArrayBuffer = function ArrayBuffer(length) {\\n\",\n       \"\\t      anInstance(this, $ArrayBuffer);\\n\",\n       \"\\t      return new BaseBuffer(toIndex(length));\\n\",\n       \"\\t    };\\n\",\n       \"\\t    var ArrayBufferProto = $ArrayBuffer[PROTOTYPE] = BaseBuffer[PROTOTYPE];\\n\",\n       \"\\t    for (var keys = gOPN(BaseBuffer), j = 0, key; keys.length > j;) {\\n\",\n       \"\\t      if (!((key = keys[j++]) in $ArrayBuffer)) hide($ArrayBuffer, key, BaseBuffer[key]);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (!LIBRARY) ArrayBufferProto.constructor = $ArrayBuffer;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  // iOS Safari 7.x bug\\n\",\n       \"\\t  var view = new $DataView(new $ArrayBuffer(2));\\n\",\n       \"\\t  var $setInt8 = $DataView[PROTOTYPE].setInt8;\\n\",\n       \"\\t  view.setInt8(0, 2147483648);\\n\",\n       \"\\t  view.setInt8(1, 2147483649);\\n\",\n       \"\\t  if (view.getInt8(0) || !view.getInt8(1)) redefineAll($DataView[PROTOTYPE], {\\n\",\n       \"\\t    setInt8: function setInt8(byteOffset, value) {\\n\",\n       \"\\t      $setInt8.call(this, byteOffset, value << 24 >> 24);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    setUint8: function setUint8(byteOffset, value) {\\n\",\n       \"\\t      $setInt8.call(this, byteOffset, value << 24 >> 24);\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }, true);\\n\",\n       \"\\t}\\n\",\n       \"\\tsetToStringTag($ArrayBuffer, ARRAY_BUFFER);\\n\",\n       \"\\tsetToStringTag($DataView, DATA_VIEW);\\n\",\n       \"\\thide($DataView[PROTOTYPE], $typed.VIEW, true);\\n\",\n       \"\\texports[ARRAY_BUFFER] = $ArrayBuffer;\\n\",\n       \"\\texports[DATA_VIEW] = $DataView;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 239 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/ecma262/#sec-toindex\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tmodule.exports = function (it) {\\n\",\n       \"\\t  if (it === undefined) return 0;\\n\",\n       \"\\t  var number = toInteger(it);\\n\",\n       \"\\t  var length = toLength(number);\\n\",\n       \"\\t  if (number !== length) throw RangeError('Wrong length!');\\n\",\n       \"\\t  return length;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 240 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t$export($export.G + $export.W + $export.F * !__webpack_require__(237).ABV, {\\n\",\n       \"\\t  DataView: __webpack_require__(238).DataView\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 241 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Int8', 1, function (init) {\\n\",\n       \"\\t  return function Int8Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 242 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tif (__webpack_require__(13)) {\\n\",\n       \"\\t  var LIBRARY = __webpack_require__(29);\\n\",\n       \"\\t  var global = __webpack_require__(11);\\n\",\n       \"\\t  var fails = __webpack_require__(14);\\n\",\n       \"\\t  var $export = __webpack_require__(15);\\n\",\n       \"\\t  var $typed = __webpack_require__(237);\\n\",\n       \"\\t  var $buffer = __webpack_require__(238);\\n\",\n       \"\\t  var ctx = __webpack_require__(30);\\n\",\n       \"\\t  var anInstance = __webpack_require__(219);\\n\",\n       \"\\t  var propertyDesc = __webpack_require__(24);\\n\",\n       \"\\t  var hide = __webpack_require__(17);\\n\",\n       \"\\t  var redefineAll = __webpack_require__(227);\\n\",\n       \"\\t  var toInteger = __webpack_require__(46);\\n\",\n       \"\\t  var toLength = __webpack_require__(45);\\n\",\n       \"\\t  var toIndex = __webpack_require__(239);\\n\",\n       \"\\t  var toAbsoluteIndex = __webpack_require__(47);\\n\",\n       \"\\t  var toPrimitive = __webpack_require__(23);\\n\",\n       \"\\t  var has = __webpack_require__(12);\\n\",\n       \"\\t  var classof = __webpack_require__(82);\\n\",\n       \"\\t  var isObject = __webpack_require__(20);\\n\",\n       \"\\t  var toObject = __webpack_require__(65);\\n\",\n       \"\\t  var isArrayIter = __webpack_require__(171);\\n\",\n       \"\\t  var create = __webpack_require__(53);\\n\",\n       \"\\t  var getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\t  var gOPN = __webpack_require__(57).f;\\n\",\n       \"\\t  var getIterFn = __webpack_require__(173);\\n\",\n       \"\\t  var uid = __webpack_require__(26);\\n\",\n       \"\\t  var wks = __webpack_require__(34);\\n\",\n       \"\\t  var createArrayMethod = __webpack_require__(181);\\n\",\n       \"\\t  var createArrayIncludes = __webpack_require__(44);\\n\",\n       \"\\t  var speciesConstructor = __webpack_require__(217);\\n\",\n       \"\\t  var ArrayIterators = __webpack_require__(202);\\n\",\n       \"\\t  var Iterators = __webpack_require__(137);\\n\",\n       \"\\t  var $iterDetect = __webpack_require__(174);\\n\",\n       \"\\t  var setSpecies = __webpack_require__(201);\\n\",\n       \"\\t  var arrayFill = __webpack_require__(197);\\n\",\n       \"\\t  var arrayCopyWithin = __webpack_require__(194);\\n\",\n       \"\\t  var $DP = __webpack_require__(18);\\n\",\n       \"\\t  var $GOPD = __webpack_require__(58);\\n\",\n       \"\\t  var dP = $DP.f;\\n\",\n       \"\\t  var gOPD = $GOPD.f;\\n\",\n       \"\\t  var RangeError = global.RangeError;\\n\",\n       \"\\t  var TypeError = global.TypeError;\\n\",\n       \"\\t  var Uint8Array = global.Uint8Array;\\n\",\n       \"\\t  var ARRAY_BUFFER = 'ArrayBuffer';\\n\",\n       \"\\t  var SHARED_BUFFER = 'Shared' + ARRAY_BUFFER;\\n\",\n       \"\\t  var BYTES_PER_ELEMENT = 'BYTES_PER_ELEMENT';\\n\",\n       \"\\t  var PROTOTYPE = 'prototype';\\n\",\n       \"\\t  var ArrayProto = Array[PROTOTYPE];\\n\",\n       \"\\t  var $ArrayBuffer = $buffer.ArrayBuffer;\\n\",\n       \"\\t  var $DataView = $buffer.DataView;\\n\",\n       \"\\t  var arrayForEach = createArrayMethod(0);\\n\",\n       \"\\t  var arrayFilter = createArrayMethod(2);\\n\",\n       \"\\t  var arraySome = createArrayMethod(3);\\n\",\n       \"\\t  var arrayEvery = createArrayMethod(4);\\n\",\n       \"\\t  var arrayFind = createArrayMethod(5);\\n\",\n       \"\\t  var arrayFindIndex = createArrayMethod(6);\\n\",\n       \"\\t  var arrayIncludes = createArrayIncludes(true);\\n\",\n       \"\\t  var arrayIndexOf = createArrayIncludes(false);\\n\",\n       \"\\t  var arrayValues = ArrayIterators.values;\\n\",\n       \"\\t  var arrayKeys = ArrayIterators.keys;\\n\",\n       \"\\t  var arrayEntries = ArrayIterators.entries;\\n\",\n       \"\\t  var arrayLastIndexOf = ArrayProto.lastIndexOf;\\n\",\n       \"\\t  var arrayReduce = ArrayProto.reduce;\\n\",\n       \"\\t  var arrayReduceRight = ArrayProto.reduceRight;\\n\",\n       \"\\t  var arrayJoin = ArrayProto.join;\\n\",\n       \"\\t  var arraySort = ArrayProto.sort;\\n\",\n       \"\\t  var arraySlice = ArrayProto.slice;\\n\",\n       \"\\t  var arrayToString = ArrayProto.toString;\\n\",\n       \"\\t  var arrayToLocaleString = ArrayProto.toLocaleString;\\n\",\n       \"\\t  var ITERATOR = wks('iterator');\\n\",\n       \"\\t  var TAG = wks('toStringTag');\\n\",\n       \"\\t  var TYPED_CONSTRUCTOR = uid('typed_constructor');\\n\",\n       \"\\t  var DEF_CONSTRUCTOR = uid('def_constructor');\\n\",\n       \"\\t  var ALL_CONSTRUCTORS = $typed.CONSTR;\\n\",\n       \"\\t  var TYPED_ARRAY = $typed.TYPED;\\n\",\n       \"\\t  var VIEW = $typed.VIEW;\\n\",\n       \"\\t  var WRONG_LENGTH = 'Wrong length!';\\n\",\n       \"\\t\\n\",\n       \"\\t  var $map = createArrayMethod(1, function (O, length) {\\n\",\n       \"\\t    return allocate(speciesConstructor(O, O[DEF_CONSTRUCTOR]), length);\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  var LITTLE_ENDIAN = fails(function () {\\n\",\n       \"\\t    // eslint-disable-next-line no-undef\\n\",\n       \"\\t    return new Uint8Array(new Uint16Array([1]).buffer)[0] === 1;\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  var FORCED_SET = !!Uint8Array && !!Uint8Array[PROTOTYPE].set && fails(function () {\\n\",\n       \"\\t    new Uint8Array(1).set({});\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  var toOffset = function (it, BYTES) {\\n\",\n       \"\\t    var offset = toInteger(it);\\n\",\n       \"\\t    if (offset < 0 || offset % BYTES) throw RangeError('Wrong offset!');\\n\",\n       \"\\t    return offset;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var validate = function (it) {\\n\",\n       \"\\t    if (isObject(it) && TYPED_ARRAY in it) return it;\\n\",\n       \"\\t    throw TypeError(it + ' is not a typed array!');\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var allocate = function (C, length) {\\n\",\n       \"\\t    if (!(isObject(C) && TYPED_CONSTRUCTOR in C)) {\\n\",\n       \"\\t      throw TypeError('It is not a typed array constructor!');\\n\",\n       \"\\t    } return new C(length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var speciesFromList = function (O, list) {\\n\",\n       \"\\t    return fromList(speciesConstructor(O, O[DEF_CONSTRUCTOR]), list);\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var fromList = function (C, list) {\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    var length = list.length;\\n\",\n       \"\\t    var result = allocate(C, length);\\n\",\n       \"\\t    while (length > index) result[index] = list[index++];\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var addGetter = function (it, key, internal) {\\n\",\n       \"\\t    dP(it, key, { get: function () { return this._d[internal]; } });\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var $from = function from(source /* , mapfn, thisArg */) {\\n\",\n       \"\\t    var O = toObject(source);\\n\",\n       \"\\t    var aLen = arguments.length;\\n\",\n       \"\\t    var mapfn = aLen > 1 ? arguments[1] : undefined;\\n\",\n       \"\\t    var mapping = mapfn !== undefined;\\n\",\n       \"\\t    var iterFn = getIterFn(O);\\n\",\n       \"\\t    var i, length, values, result, step, iterator;\\n\",\n       \"\\t    if (iterFn != undefined && !isArrayIter(iterFn)) {\\n\",\n       \"\\t      for (iterator = iterFn.call(O), values = [], i = 0; !(step = iterator.next()).done; i++) {\\n\",\n       \"\\t        values.push(step.value);\\n\",\n       \"\\t      } O = values;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    if (mapping && aLen > 2) mapfn = ctx(mapfn, arguments[2], 2);\\n\",\n       \"\\t    for (i = 0, length = toLength(O.length), result = allocate(this, length); length > i; i++) {\\n\",\n       \"\\t      result[i] = mapping ? mapfn(O[i], i) : O[i];\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var $of = function of(/* ...items */) {\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    var length = arguments.length;\\n\",\n       \"\\t    var result = allocate(this, length);\\n\",\n       \"\\t    while (length > index) result[index] = arguments[index++];\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  // iOS Safari 6.x fails here\\n\",\n       \"\\t  var TO_LOCALE_BUG = !!Uint8Array && fails(function () { arrayToLocaleString.call(new Uint8Array(1)); });\\n\",\n       \"\\t\\n\",\n       \"\\t  var $toLocaleString = function toLocaleString() {\\n\",\n       \"\\t    return arrayToLocaleString.apply(TO_LOCALE_BUG ? arraySlice.call(validate(this)) : validate(this), arguments);\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var proto = {\\n\",\n       \"\\t    copyWithin: function copyWithin(target, start /* , end */) {\\n\",\n       \"\\t      return arrayCopyWithin.call(validate(this), target, start, arguments.length > 2 ? arguments[2] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    every: function every(callbackfn /* , thisArg */) {\\n\",\n       \"\\t      return arrayEvery(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    fill: function fill(value /* , start, end */) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t      return arrayFill.apply(validate(this), arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    filter: function filter(callbackfn /* , thisArg */) {\\n\",\n       \"\\t      return speciesFromList(this, arrayFilter(validate(this), callbackfn,\\n\",\n       \"\\t        arguments.length > 1 ? arguments[1] : undefined));\\n\",\n       \"\\t    },\\n\",\n       \"\\t    find: function find(predicate /* , thisArg */) {\\n\",\n       \"\\t      return arrayFind(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    findIndex: function findIndex(predicate /* , thisArg */) {\\n\",\n       \"\\t      return arrayFindIndex(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    forEach: function forEach(callbackfn /* , thisArg */) {\\n\",\n       \"\\t      arrayForEach(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    indexOf: function indexOf(searchElement /* , fromIndex */) {\\n\",\n       \"\\t      return arrayIndexOf(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    includes: function includes(searchElement /* , fromIndex */) {\\n\",\n       \"\\t      return arrayIncludes(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    join: function join(separator) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t      return arrayJoin.apply(validate(this), arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    lastIndexOf: function lastIndexOf(searchElement /* , fromIndex */) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t      return arrayLastIndexOf.apply(validate(this), arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    map: function map(mapfn /* , thisArg */) {\\n\",\n       \"\\t      return $map(validate(this), mapfn, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    reduce: function reduce(callbackfn /* , initialValue */) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t      return arrayReduce.apply(validate(this), arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    reduceRight: function reduceRight(callbackfn /* , initialValue */) { // eslint-disable-line no-unused-vars\\n\",\n       \"\\t      return arrayReduceRight.apply(validate(this), arguments);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    reverse: function reverse() {\\n\",\n       \"\\t      var that = this;\\n\",\n       \"\\t      var length = validate(that).length;\\n\",\n       \"\\t      var middle = Math.floor(length / 2);\\n\",\n       \"\\t      var index = 0;\\n\",\n       \"\\t      var value;\\n\",\n       \"\\t      while (index < middle) {\\n\",\n       \"\\t        value = that[index];\\n\",\n       \"\\t        that[index++] = that[--length];\\n\",\n       \"\\t        that[length] = value;\\n\",\n       \"\\t      } return that;\\n\",\n       \"\\t    },\\n\",\n       \"\\t    some: function some(callbackfn /* , thisArg */) {\\n\",\n       \"\\t      return arraySome(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    sort: function sort(comparefn) {\\n\",\n       \"\\t      return arraySort.call(validate(this), comparefn);\\n\",\n       \"\\t    },\\n\",\n       \"\\t    subarray: function subarray(begin, end) {\\n\",\n       \"\\t      var O = validate(this);\\n\",\n       \"\\t      var length = O.length;\\n\",\n       \"\\t      var $begin = toAbsoluteIndex(begin, length);\\n\",\n       \"\\t      return new (speciesConstructor(O, O[DEF_CONSTRUCTOR]))(\\n\",\n       \"\\t        O.buffer,\\n\",\n       \"\\t        O.byteOffset + $begin * O.BYTES_PER_ELEMENT,\\n\",\n       \"\\t        toLength((end === undefined ? length : toAbsoluteIndex(end, length)) - $begin)\\n\",\n       \"\\t      );\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var $slice = function slice(start, end) {\\n\",\n       \"\\t    return speciesFromList(this, arraySlice.call(validate(this), start, end));\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var $set = function set(arrayLike /* , offset */) {\\n\",\n       \"\\t    validate(this);\\n\",\n       \"\\t    var offset = toOffset(arguments[1], 1);\\n\",\n       \"\\t    var length = this.length;\\n\",\n       \"\\t    var src = toObject(arrayLike);\\n\",\n       \"\\t    var len = toLength(src.length);\\n\",\n       \"\\t    var index = 0;\\n\",\n       \"\\t    if (len + offset > length) throw RangeError(WRONG_LENGTH);\\n\",\n       \"\\t    while (index < len) this[offset + index] = src[index++];\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var $iterators = {\\n\",\n       \"\\t    entries: function entries() {\\n\",\n       \"\\t      return arrayEntries.call(validate(this));\\n\",\n       \"\\t    },\\n\",\n       \"\\t    keys: function keys() {\\n\",\n       \"\\t      return arrayKeys.call(validate(this));\\n\",\n       \"\\t    },\\n\",\n       \"\\t    values: function values() {\\n\",\n       \"\\t      return arrayValues.call(validate(this));\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var isTAIndex = function (target, key) {\\n\",\n       \"\\t    return isObject(target)\\n\",\n       \"\\t      && target[TYPED_ARRAY]\\n\",\n       \"\\t      && typeof key != 'symbol'\\n\",\n       \"\\t      && key in target\\n\",\n       \"\\t      && String(+key) == String(key);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var $getDesc = function getOwnPropertyDescriptor(target, key) {\\n\",\n       \"\\t    return isTAIndex(target, key = toPrimitive(key, true))\\n\",\n       \"\\t      ? propertyDesc(2, target[key])\\n\",\n       \"\\t      : gOPD(target, key);\\n\",\n       \"\\t  };\\n\",\n       \"\\t  var $setDesc = function defineProperty(target, key, desc) {\\n\",\n       \"\\t    if (isTAIndex(target, key = toPrimitive(key, true))\\n\",\n       \"\\t      && isObject(desc)\\n\",\n       \"\\t      && has(desc, 'value')\\n\",\n       \"\\t      && !has(desc, 'get')\\n\",\n       \"\\t      && !has(desc, 'set')\\n\",\n       \"\\t      // TODO: add validation descriptor w/o calling accessors\\n\",\n       \"\\t      && !desc.configurable\\n\",\n       \"\\t      && (!has(desc, 'writable') || desc.writable)\\n\",\n       \"\\t      && (!has(desc, 'enumerable') || desc.enumerable)\\n\",\n       \"\\t    ) {\\n\",\n       \"\\t      target[key] = desc.value;\\n\",\n       \"\\t      return target;\\n\",\n       \"\\t    } return dP(target, key, desc);\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  if (!ALL_CONSTRUCTORS) {\\n\",\n       \"\\t    $GOPD.f = $getDesc;\\n\",\n       \"\\t    $DP.f = $setDesc;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  $export($export.S + $export.F * !ALL_CONSTRUCTORS, 'Object', {\\n\",\n       \"\\t    getOwnPropertyDescriptor: $getDesc,\\n\",\n       \"\\t    defineProperty: $setDesc\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  if (fails(function () { arrayToString.call({}); })) {\\n\",\n       \"\\t    arrayToString = arrayToLocaleString = function toString() {\\n\",\n       \"\\t      return arrayJoin.call(this);\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  var $TypedArrayPrototype$ = redefineAll({}, proto);\\n\",\n       \"\\t  redefineAll($TypedArrayPrototype$, $iterators);\\n\",\n       \"\\t  hide($TypedArrayPrototype$, ITERATOR, $iterators.values);\\n\",\n       \"\\t  redefineAll($TypedArrayPrototype$, {\\n\",\n       \"\\t    slice: $slice,\\n\",\n       \"\\t    set: $set,\\n\",\n       \"\\t    constructor: function () { /* noop */ },\\n\",\n       \"\\t    toString: arrayToString,\\n\",\n       \"\\t    toLocaleString: $toLocaleString\\n\",\n       \"\\t  });\\n\",\n       \"\\t  addGetter($TypedArrayPrototype$, 'buffer', 'b');\\n\",\n       \"\\t  addGetter($TypedArrayPrototype$, 'byteOffset', 'o');\\n\",\n       \"\\t  addGetter($TypedArrayPrototype$, 'byteLength', 'l');\\n\",\n       \"\\t  addGetter($TypedArrayPrototype$, 'length', 'e');\\n\",\n       \"\\t  dP($TypedArrayPrototype$, TAG, {\\n\",\n       \"\\t    get: function () { return this[TYPED_ARRAY]; }\\n\",\n       \"\\t  });\\n\",\n       \"\\t\\n\",\n       \"\\t  // eslint-disable-next-line max-statements\\n\",\n       \"\\t  module.exports = function (KEY, BYTES, wrapper, CLAMPED) {\\n\",\n       \"\\t    CLAMPED = !!CLAMPED;\\n\",\n       \"\\t    var NAME = KEY + (CLAMPED ? 'Clamped' : '') + 'Array';\\n\",\n       \"\\t    var GETTER = 'get' + KEY;\\n\",\n       \"\\t    var SETTER = 'set' + KEY;\\n\",\n       \"\\t    var TypedArray = global[NAME];\\n\",\n       \"\\t    var Base = TypedArray || {};\\n\",\n       \"\\t    var TAC = TypedArray && getPrototypeOf(TypedArray);\\n\",\n       \"\\t    var FORCED = !TypedArray || !$typed.ABV;\\n\",\n       \"\\t    var O = {};\\n\",\n       \"\\t    var TypedArrayPrototype = TypedArray && TypedArray[PROTOTYPE];\\n\",\n       \"\\t    var getter = function (that, index) {\\n\",\n       \"\\t      var data = that._d;\\n\",\n       \"\\t      return data.v[GETTER](index * BYTES + data.o, LITTLE_ENDIAN);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    var setter = function (that, index, value) {\\n\",\n       \"\\t      var data = that._d;\\n\",\n       \"\\t      if (CLAMPED) value = (value = Math.round(value)) < 0 ? 0 : value > 0xff ? 0xff : value & 0xff;\\n\",\n       \"\\t      data.v[SETTER](index * BYTES + data.o, value, LITTLE_ENDIAN);\\n\",\n       \"\\t    };\\n\",\n       \"\\t    var addElement = function (that, index) {\\n\",\n       \"\\t      dP(that, index, {\\n\",\n       \"\\t        get: function () {\\n\",\n       \"\\t          return getter(this, index);\\n\",\n       \"\\t        },\\n\",\n       \"\\t        set: function (value) {\\n\",\n       \"\\t          return setter(this, index, value);\\n\",\n       \"\\t        },\\n\",\n       \"\\t        enumerable: true\\n\",\n       \"\\t      });\\n\",\n       \"\\t    };\\n\",\n       \"\\t    if (FORCED) {\\n\",\n       \"\\t      TypedArray = wrapper(function (that, data, $offset, $length) {\\n\",\n       \"\\t        anInstance(that, TypedArray, NAME, '_d');\\n\",\n       \"\\t        var index = 0;\\n\",\n       \"\\t        var offset = 0;\\n\",\n       \"\\t        var buffer, byteLength, length, klass;\\n\",\n       \"\\t        if (!isObject(data)) {\\n\",\n       \"\\t          length = toIndex(data);\\n\",\n       \"\\t          byteLength = length * BYTES;\\n\",\n       \"\\t          buffer = new $ArrayBuffer(byteLength);\\n\",\n       \"\\t        } else if (data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER) {\\n\",\n       \"\\t          buffer = data;\\n\",\n       \"\\t          offset = toOffset($offset, BYTES);\\n\",\n       \"\\t          var $len = data.byteLength;\\n\",\n       \"\\t          if ($length === undefined) {\\n\",\n       \"\\t            if ($len % BYTES) throw RangeError(WRONG_LENGTH);\\n\",\n       \"\\t            byteLength = $len - offset;\\n\",\n       \"\\t            if (byteLength < 0) throw RangeError(WRONG_LENGTH);\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            byteLength = toLength($length) * BYTES;\\n\",\n       \"\\t            if (byteLength + offset > $len) throw RangeError(WRONG_LENGTH);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          length = byteLength / BYTES;\\n\",\n       \"\\t        } else if (TYPED_ARRAY in data) {\\n\",\n       \"\\t          return fromList(TypedArray, data);\\n\",\n       \"\\t        } else {\\n\",\n       \"\\t          return $from.call(TypedArray, data);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        hide(that, '_d', {\\n\",\n       \"\\t          b: buffer,\\n\",\n       \"\\t          o: offset,\\n\",\n       \"\\t          l: byteLength,\\n\",\n       \"\\t          e: length,\\n\",\n       \"\\t          v: new $DataView(buffer)\\n\",\n       \"\\t        });\\n\",\n       \"\\t        while (index < length) addElement(that, index++);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      TypedArrayPrototype = TypedArray[PROTOTYPE] = create($TypedArrayPrototype$);\\n\",\n       \"\\t      hide(TypedArrayPrototype, 'constructor', TypedArray);\\n\",\n       \"\\t    } else if (!fails(function () {\\n\",\n       \"\\t      TypedArray(1);\\n\",\n       \"\\t    }) || !fails(function () {\\n\",\n       \"\\t      new TypedArray(-1); // eslint-disable-line no-new\\n\",\n       \"\\t    }) || !$iterDetect(function (iter) {\\n\",\n       \"\\t      new TypedArray(); // eslint-disable-line no-new\\n\",\n       \"\\t      new TypedArray(null); // eslint-disable-line no-new\\n\",\n       \"\\t      new TypedArray(1.5); // eslint-disable-line no-new\\n\",\n       \"\\t      new TypedArray(iter); // eslint-disable-line no-new\\n\",\n       \"\\t    }, true)) {\\n\",\n       \"\\t      TypedArray = wrapper(function (that, data, $offset, $length) {\\n\",\n       \"\\t        anInstance(that, TypedArray, NAME);\\n\",\n       \"\\t        var klass;\\n\",\n       \"\\t        // `ws` module bug, temporarily remove validation length for Uint8Array\\n\",\n       \"\\t        // https://github.com/websockets/ws/pull/645\\n\",\n       \"\\t        if (!isObject(data)) return new Base(toIndex(data));\\n\",\n       \"\\t        if (data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER) {\\n\",\n       \"\\t          return $length !== undefined\\n\",\n       \"\\t            ? new Base(data, toOffset($offset, BYTES), $length)\\n\",\n       \"\\t            : $offset !== undefined\\n\",\n       \"\\t              ? new Base(data, toOffset($offset, BYTES))\\n\",\n       \"\\t              : new Base(data);\\n\",\n       \"\\t        }\\n\",\n       \"\\t        if (TYPED_ARRAY in data) return fromList(TypedArray, data);\\n\",\n       \"\\t        return $from.call(TypedArray, data);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      arrayForEach(TAC !== Function.prototype ? gOPN(Base).concat(gOPN(TAC)) : gOPN(Base), function (key) {\\n\",\n       \"\\t        if (!(key in TypedArray)) hide(TypedArray, key, Base[key]);\\n\",\n       \"\\t      });\\n\",\n       \"\\t      TypedArray[PROTOTYPE] = TypedArrayPrototype;\\n\",\n       \"\\t      if (!LIBRARY) TypedArrayPrototype.constructor = TypedArray;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    var $nativeIterator = TypedArrayPrototype[ITERATOR];\\n\",\n       \"\\t    var CORRECT_ITER_NAME = !!$nativeIterator\\n\",\n       \"\\t      && ($nativeIterator.name == 'values' || $nativeIterator.name == undefined);\\n\",\n       \"\\t    var $iterator = $iterators.values;\\n\",\n       \"\\t    hide(TypedArray, TYPED_CONSTRUCTOR, true);\\n\",\n       \"\\t    hide(TypedArrayPrototype, TYPED_ARRAY, NAME);\\n\",\n       \"\\t    hide(TypedArrayPrototype, VIEW, true);\\n\",\n       \"\\t    hide(TypedArrayPrototype, DEF_CONSTRUCTOR, TypedArray);\\n\",\n       \"\\t\\n\",\n       \"\\t    if (CLAMPED ? new TypedArray(1)[TAG] != NAME : !(TAG in TypedArrayPrototype)) {\\n\",\n       \"\\t      dP(TypedArrayPrototype, TAG, {\\n\",\n       \"\\t        get: function () { return NAME; }\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    O[NAME] = TypedArray;\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.G + $export.W + $export.F * (TypedArray != Base), O);\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.S, NAME, {\\n\",\n       \"\\t      BYTES_PER_ELEMENT: BYTES\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.S + $export.F * fails(function () { Base.of.call(TypedArray, 1); }), NAME, {\\n\",\n       \"\\t      from: $from,\\n\",\n       \"\\t      of: $of\\n\",\n       \"\\t    });\\n\",\n       \"\\t\\n\",\n       \"\\t    if (!(BYTES_PER_ELEMENT in TypedArrayPrototype)) hide(TypedArrayPrototype, BYTES_PER_ELEMENT, BYTES);\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.P, NAME, proto);\\n\",\n       \"\\t\\n\",\n       \"\\t    setSpecies(NAME);\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.P + $export.F * FORCED_SET, NAME, { set: $set });\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.P + $export.F * !CORRECT_ITER_NAME, NAME, $iterators);\\n\",\n       \"\\t\\n\",\n       \"\\t    if (!LIBRARY && TypedArrayPrototype.toString != arrayToString) TypedArrayPrototype.toString = arrayToString;\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.P + $export.F * fails(function () {\\n\",\n       \"\\t      new TypedArray(1).slice();\\n\",\n       \"\\t    }), NAME, { slice: $slice });\\n\",\n       \"\\t\\n\",\n       \"\\t    $export($export.P + $export.F * (fails(function () {\\n\",\n       \"\\t      return [1, 2].toLocaleString() != new TypedArray([1, 2]).toLocaleString();\\n\",\n       \"\\t    }) || !fails(function () {\\n\",\n       \"\\t      TypedArrayPrototype.toLocaleString.call([1, 2]);\\n\",\n       \"\\t    })), NAME, { toLocaleString: $toLocaleString });\\n\",\n       \"\\t\\n\",\n       \"\\t    Iterators[NAME] = CORRECT_ITER_NAME ? $nativeIterator : $iterator;\\n\",\n       \"\\t    if (!LIBRARY && !CORRECT_ITER_NAME) hide(TypedArrayPrototype, ITERATOR, $iterator);\\n\",\n       \"\\t  };\\n\",\n       \"\\t} else module.exports = function () { /* empty */ };\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 243 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Uint8', 1, function (init) {\\n\",\n       \"\\t  return function Uint8Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 244 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Uint8', 1, function (init) {\\n\",\n       \"\\t  return function Uint8ClampedArray(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t}, true);\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 245 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Int16', 2, function (init) {\\n\",\n       \"\\t  return function Int16Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 246 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Uint16', 2, function (init) {\\n\",\n       \"\\t  return function Uint16Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 247 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Int32', 4, function (init) {\\n\",\n       \"\\t  return function Int32Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 248 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Uint32', 4, function (init) {\\n\",\n       \"\\t  return function Uint32Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 249 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Float32', 4, function (init) {\\n\",\n       \"\\t  return function Float32Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 250 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(242)('Float64', 8, function (init) {\\n\",\n       \"\\t  return function Float64Array(data, byteOffset, length) {\\n\",\n       \"\\t    return init(this, data, byteOffset, length);\\n\",\n       \"\\t  };\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 251 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.1 Reflect.apply(target, thisArgument, argumentsList)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar rApply = (__webpack_require__(11).Reflect || {}).apply;\\n\",\n       \"\\tvar fApply = Function.apply;\\n\",\n       \"\\t// MS Edge argumentsList argument is optional\\n\",\n       \"\\t$export($export.S + $export.F * !__webpack_require__(14)(function () {\\n\",\n       \"\\t  rApply(function () { /* empty */ });\\n\",\n       \"\\t}), 'Reflect', {\\n\",\n       \"\\t  apply: function apply(target, thisArgument, argumentsList) {\\n\",\n       \"\\t    var T = aFunction(target);\\n\",\n       \"\\t    var L = anObject(argumentsList);\\n\",\n       \"\\t    return rApply ? rApply(T, thisArgument, L) : fApply.call(T, thisArgument, L);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 252 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.2 Reflect.construct(target, argumentsList [, newTarget])\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar create = __webpack_require__(53);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar fails = __webpack_require__(14);\\n\",\n       \"\\tvar bind = __webpack_require__(84);\\n\",\n       \"\\tvar rConstruct = (__webpack_require__(11).Reflect || {}).construct;\\n\",\n       \"\\t\\n\",\n       \"\\t// MS Edge supports only 2 arguments and argumentsList argument is optional\\n\",\n       \"\\t// FF Nightly sets third argument as `new.target`, but does not create `this` from it\\n\",\n       \"\\tvar NEW_TARGET_BUG = fails(function () {\\n\",\n       \"\\t  function F() { /* empty */ }\\n\",\n       \"\\t  return !(rConstruct(function () { /* empty */ }, [], F) instanceof F);\\n\",\n       \"\\t});\\n\",\n       \"\\tvar ARGS_BUG = !fails(function () {\\n\",\n       \"\\t  rConstruct(function () { /* empty */ });\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S + $export.F * (NEW_TARGET_BUG || ARGS_BUG), 'Reflect', {\\n\",\n       \"\\t  construct: function construct(Target, args /* , newTarget */) {\\n\",\n       \"\\t    aFunction(Target);\\n\",\n       \"\\t    anObject(args);\\n\",\n       \"\\t    var newTarget = arguments.length < 3 ? Target : aFunction(arguments[2]);\\n\",\n       \"\\t    if (ARGS_BUG && !NEW_TARGET_BUG) return rConstruct(Target, args, newTarget);\\n\",\n       \"\\t    if (Target == newTarget) {\\n\",\n       \"\\t      // w/o altered newTarget, optimization for 0-4 arguments\\n\",\n       \"\\t      switch (args.length) {\\n\",\n       \"\\t        case 0: return new Target();\\n\",\n       \"\\t        case 1: return new Target(args[0]);\\n\",\n       \"\\t        case 2: return new Target(args[0], args[1]);\\n\",\n       \"\\t        case 3: return new Target(args[0], args[1], args[2]);\\n\",\n       \"\\t        case 4: return new Target(args[0], args[1], args[2], args[3]);\\n\",\n       \"\\t      }\\n\",\n       \"\\t      // w/o altered newTarget, lot of arguments case\\n\",\n       \"\\t      var $args = [null];\\n\",\n       \"\\t      $args.push.apply($args, args);\\n\",\n       \"\\t      return new (bind.apply(Target, $args))();\\n\",\n       \"\\t    }\\n\",\n       \"\\t    // with altered newTarget, not support built-in constructors\\n\",\n       \"\\t    var proto = newTarget.prototype;\\n\",\n       \"\\t    var instance = create(isObject(proto) ? proto : Object.prototype);\\n\",\n       \"\\t    var result = Function.apply.call(Target, instance, args);\\n\",\n       \"\\t    return isObject(result) ? result : instance;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 253 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.3 Reflect.defineProperty(target, propertyKey, attributes)\\n\",\n       \"\\tvar dP = __webpack_require__(18);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\t\\n\",\n       \"\\t// MS Edge has broken Reflect.defineProperty - throwing instead of returning false\\n\",\n       \"\\t$export($export.S + $export.F * __webpack_require__(14)(function () {\\n\",\n       \"\\t  // eslint-disable-next-line no-undef\\n\",\n       \"\\t  Reflect.defineProperty(dP.f({}, 1, { value: 1 }), 1, { value: 2 });\\n\",\n       \"\\t}), 'Reflect', {\\n\",\n       \"\\t  defineProperty: function defineProperty(target, propertyKey, attributes) {\\n\",\n       \"\\t    anObject(target);\\n\",\n       \"\\t    propertyKey = toPrimitive(propertyKey, true);\\n\",\n       \"\\t    anObject(attributes);\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      dP.f(target, propertyKey, attributes);\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    } catch (e) {\\n\",\n       \"\\t      return false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 254 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.4 Reflect.deleteProperty(target, propertyKey)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar gOPD = __webpack_require__(58).f;\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  deleteProperty: function deleteProperty(target, propertyKey) {\\n\",\n       \"\\t    var desc = gOPD(anObject(target), propertyKey);\\n\",\n       \"\\t    return desc && !desc.configurable ? false : delete target[propertyKey];\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 255 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// 26.1.5 Reflect.enumerate(target)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar Enumerate = function (iterated) {\\n\",\n       \"\\t  this._t = anObject(iterated); // target\\n\",\n       \"\\t  this._i = 0;                  // next index\\n\",\n       \"\\t  var keys = this._k = [];      // keys\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  for (key in iterated) keys.push(key);\\n\",\n       \"\\t};\\n\",\n       \"\\t__webpack_require__(138)(Enumerate, 'Object', function () {\\n\",\n       \"\\t  var that = this;\\n\",\n       \"\\t  var keys = that._k;\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  do {\\n\",\n       \"\\t    if (that._i >= keys.length) return { value: undefined, done: true };\\n\",\n       \"\\t  } while (!((key = keys[that._i++]) in that._t));\\n\",\n       \"\\t  return { value: key, done: false };\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  enumerate: function enumerate(target) {\\n\",\n       \"\\t    return new Enumerate(target);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 256 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.6 Reflect.get(target, propertyKey [, receiver])\\n\",\n       \"\\tvar gOPD = __webpack_require__(58);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction get(target, propertyKey /* , receiver */) {\\n\",\n       \"\\t  var receiver = arguments.length < 3 ? target : arguments[2];\\n\",\n       \"\\t  var desc, proto;\\n\",\n       \"\\t  if (anObject(target) === receiver) return target[propertyKey];\\n\",\n       \"\\t  if (desc = gOPD.f(target, propertyKey)) return has(desc, 'value')\\n\",\n       \"\\t    ? desc.value\\n\",\n       \"\\t    : desc.get !== undefined\\n\",\n       \"\\t      ? desc.get.call(receiver)\\n\",\n       \"\\t      : undefined;\\n\",\n       \"\\t  if (isObject(proto = getPrototypeOf(target))) return get(proto, propertyKey, receiver);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', { get: get });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 257 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.7 Reflect.getOwnPropertyDescriptor(target, propertyKey)\\n\",\n       \"\\tvar gOPD = __webpack_require__(58);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  getOwnPropertyDescriptor: function getOwnPropertyDescriptor(target, propertyKey) {\\n\",\n       \"\\t    return gOPD.f(anObject(target), propertyKey);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 258 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.8 Reflect.getPrototypeOf(target)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar getProto = __webpack_require__(66);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  getPrototypeOf: function getPrototypeOf(target) {\\n\",\n       \"\\t    return getProto(anObject(target));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 259 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.9 Reflect.has(target, propertyKey)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  has: function has(target, propertyKey) {\\n\",\n       \"\\t    return propertyKey in target;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 260 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.10 Reflect.isExtensible(target)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar $isExtensible = Object.isExtensible;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  isExtensible: function isExtensible(target) {\\n\",\n       \"\\t    anObject(target);\\n\",\n       \"\\t    return $isExtensible ? $isExtensible(target) : true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 261 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.11 Reflect.ownKeys(target)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', { ownKeys: __webpack_require__(262) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 262 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// all object keys, includes non-enumerable and symbols\\n\",\n       \"\\tvar gOPN = __webpack_require__(57);\\n\",\n       \"\\tvar gOPS = __webpack_require__(50);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar Reflect = __webpack_require__(11).Reflect;\\n\",\n       \"\\tmodule.exports = Reflect && Reflect.ownKeys || function ownKeys(it) {\\n\",\n       \"\\t  var keys = gOPN.f(anObject(it));\\n\",\n       \"\\t  var getSymbols = gOPS.f;\\n\",\n       \"\\t  return getSymbols ? keys.concat(getSymbols(it)) : keys;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 263 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.12 Reflect.preventExtensions(target)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar $preventExtensions = Object.preventExtensions;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', {\\n\",\n       \"\\t  preventExtensions: function preventExtensions(target) {\\n\",\n       \"\\t    anObject(target);\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      if ($preventExtensions) $preventExtensions(target);\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    } catch (e) {\\n\",\n       \"\\t      return false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 264 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.13 Reflect.set(target, propertyKey, V [, receiver])\\n\",\n       \"\\tvar dP = __webpack_require__(18);\\n\",\n       \"\\tvar gOPD = __webpack_require__(58);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar has = __webpack_require__(12);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar createDesc = __webpack_require__(24);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\t\\n\",\n       \"\\tfunction set(target, propertyKey, V /* , receiver */) {\\n\",\n       \"\\t  var receiver = arguments.length < 4 ? target : arguments[3];\\n\",\n       \"\\t  var ownDesc = gOPD.f(anObject(target), propertyKey);\\n\",\n       \"\\t  var existingDescriptor, proto;\\n\",\n       \"\\t  if (!ownDesc) {\\n\",\n       \"\\t    if (isObject(proto = getPrototypeOf(target))) {\\n\",\n       \"\\t      return set(proto, propertyKey, V, receiver);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    ownDesc = createDesc(0);\\n\",\n       \"\\t  }\\n\",\n       \"\\t  if (has(ownDesc, 'value')) {\\n\",\n       \"\\t    if (ownDesc.writable === false || !isObject(receiver)) return false;\\n\",\n       \"\\t    if (existingDescriptor = gOPD.f(receiver, propertyKey)) {\\n\",\n       \"\\t      if (existingDescriptor.get || existingDescriptor.set || existingDescriptor.writable === false) return false;\\n\",\n       \"\\t      existingDescriptor.value = V;\\n\",\n       \"\\t      dP.f(receiver, propertyKey, existingDescriptor);\\n\",\n       \"\\t    } else dP.f(receiver, propertyKey, createDesc(0, V));\\n\",\n       \"\\t    return true;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return ownDesc.set === undefined ? false : (ownDesc.set.call(receiver, V), true);\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Reflect', { set: set });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 265 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// 26.1.14 Reflect.setPrototypeOf(target, proto)\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar setProto = __webpack_require__(80);\\n\",\n       \"\\t\\n\",\n       \"\\tif (setProto) $export($export.S, 'Reflect', {\\n\",\n       \"\\t  setPrototypeOf: function setPrototypeOf(target, proto) {\\n\",\n       \"\\t    setProto.check(target, proto);\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      setProto.set(target, proto);\\n\",\n       \"\\t      return true;\\n\",\n       \"\\t    } catch (e) {\\n\",\n       \"\\t      return false;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 266 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/tc39/Array.prototype.includes\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $includes = __webpack_require__(44)(true);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'Array', {\\n\",\n       \"\\t  includes: function includes(el /* , fromIndex = 0 */) {\\n\",\n       \"\\t    return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(195)('includes');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 267 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatMap\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar flattenIntoArray = __webpack_require__(268);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar arraySpeciesCreate = __webpack_require__(182);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'Array', {\\n\",\n       \"\\t  flatMap: function flatMap(callbackfn /* , thisArg */) {\\n\",\n       \"\\t    var O = toObject(this);\\n\",\n       \"\\t    var sourceLen, A;\\n\",\n       \"\\t    aFunction(callbackfn);\\n\",\n       \"\\t    sourceLen = toLength(O.length);\\n\",\n       \"\\t    A = arraySpeciesCreate(O, 0);\\n\",\n       \"\\t    flattenIntoArray(A, O, O, sourceLen, 0, 1, callbackfn, arguments[1]);\\n\",\n       \"\\t    return A;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(195)('flatMap');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 268 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://tc39.github.io/proposal-flatMap/#sec-FlattenIntoArray\\n\",\n       \"\\tvar isArray = __webpack_require__(52);\\n\",\n       \"\\tvar isObject = __webpack_require__(20);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar IS_CONCAT_SPREADABLE = __webpack_require__(34)('isConcatSpreadable');\\n\",\n       \"\\t\\n\",\n       \"\\tfunction flattenIntoArray(target, original, source, sourceLen, start, depth, mapper, thisArg) {\\n\",\n       \"\\t  var targetIndex = start;\\n\",\n       \"\\t  var sourceIndex = 0;\\n\",\n       \"\\t  var mapFn = mapper ? ctx(mapper, thisArg, 3) : false;\\n\",\n       \"\\t  var element, spreadable;\\n\",\n       \"\\t\\n\",\n       \"\\t  while (sourceIndex < sourceLen) {\\n\",\n       \"\\t    if (sourceIndex in source) {\\n\",\n       \"\\t      element = mapFn ? mapFn(source[sourceIndex], sourceIndex, original) : source[sourceIndex];\\n\",\n       \"\\t\\n\",\n       \"\\t      spreadable = false;\\n\",\n       \"\\t      if (isObject(element)) {\\n\",\n       \"\\t        spreadable = element[IS_CONCAT_SPREADABLE];\\n\",\n       \"\\t        spreadable = spreadable !== undefined ? !!spreadable : isArray(element);\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (spreadable && depth > 0) {\\n\",\n       \"\\t        targetIndex = flattenIntoArray(target, original, element, toLength(element.length), targetIndex, depth - 1) - 1;\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        if (targetIndex >= 0x1fffffffffffff) throw TypeError();\\n\",\n       \"\\t        target[targetIndex] = element;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      targetIndex++;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    sourceIndex++;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  return targetIndex;\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = flattenIntoArray;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 269 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatten\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar flattenIntoArray = __webpack_require__(268);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar toInteger = __webpack_require__(46);\\n\",\n       \"\\tvar arraySpeciesCreate = __webpack_require__(182);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'Array', {\\n\",\n       \"\\t  flatten: function flatten(/* depthArg = 1 */) {\\n\",\n       \"\\t    var depthArg = arguments[0];\\n\",\n       \"\\t    var O = toObject(this);\\n\",\n       \"\\t    var sourceLen = toLength(O.length);\\n\",\n       \"\\t    var A = arraySpeciesCreate(O, 0);\\n\",\n       \"\\t    flattenIntoArray(A, O, O, sourceLen, 0, depthArg === undefined ? 1 : toInteger(depthArg));\\n\",\n       \"\\t    return A;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(195)('flatten');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 270 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/mathiasbynens/String.prototype.at\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $at = __webpack_require__(135)(true);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'String', {\\n\",\n       \"\\t  at: function at(pos) {\\n\",\n       \"\\t    return $at(this, pos);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 271 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/tc39/proposal-string-pad-start-end\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $pad = __webpack_require__(272);\\n\",\n       \"\\tvar userAgent = __webpack_require__(225);\\n\",\n       \"\\t\\n\",\n       \"\\t// https://github.com/zloirock/core-js/issues/280\\n\",\n       \"\\tvar WEBKIT_BUG = /Version\\\\/10\\\\.\\\\d+(\\\\.\\\\d+)?( Mobile\\\\/\\\\w+)? Safari\\\\//.test(userAgent);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * WEBKIT_BUG, 'String', {\\n\",\n       \"\\t  padStart: function padStart(maxLength /* , fillString = ' ' */) {\\n\",\n       \"\\t    return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, true);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 272 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-string-pad-start-end\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar repeat = __webpack_require__(98);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (that, maxLength, fillString, left) {\\n\",\n       \"\\t  var S = String(defined(that));\\n\",\n       \"\\t  var stringLength = S.length;\\n\",\n       \"\\t  var fillStr = fillString === undefined ? ' ' : String(fillString);\\n\",\n       \"\\t  var intMaxLength = toLength(maxLength);\\n\",\n       \"\\t  if (intMaxLength <= stringLength || fillStr == '') return S;\\n\",\n       \"\\t  var fillLen = intMaxLength - stringLength;\\n\",\n       \"\\t  var stringFiller = repeat.call(fillStr, Math.ceil(fillLen / fillStr.length));\\n\",\n       \"\\t  if (stringFiller.length > fillLen) stringFiller = stringFiller.slice(0, fillLen);\\n\",\n       \"\\t  return left ? stringFiller + S : S + stringFiller;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 273 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/tc39/proposal-string-pad-start-end\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $pad = __webpack_require__(272);\\n\",\n       \"\\tvar userAgent = __webpack_require__(225);\\n\",\n       \"\\t\\n\",\n       \"\\t// https://github.com/zloirock/core-js/issues/280\\n\",\n       \"\\tvar WEBKIT_BUG = /Version\\\\/10\\\\.\\\\d+(\\\\.\\\\d+)?( Mobile\\\\/\\\\w+)? Safari\\\\//.test(userAgent);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.F * WEBKIT_BUG, 'String', {\\n\",\n       \"\\t  padEnd: function padEnd(maxLength /* , fillString = ' ' */) {\\n\",\n       \"\\t    return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, false);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 274 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/sebmarkbage/ecmascript-string-left-right-trim\\n\",\n       \"\\t__webpack_require__(90)('trimLeft', function ($trim) {\\n\",\n       \"\\t  return function trimLeft() {\\n\",\n       \"\\t    return $trim(this, 1);\\n\",\n       \"\\t  };\\n\",\n       \"\\t}, 'trimStart');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 275 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/sebmarkbage/ecmascript-string-left-right-trim\\n\",\n       \"\\t__webpack_require__(90)('trimRight', function ($trim) {\\n\",\n       \"\\t  return function trimRight() {\\n\",\n       \"\\t    return $trim(this, 2);\\n\",\n       \"\\t  };\\n\",\n       \"\\t}, 'trimEnd');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 276 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://tc39.github.io/String.prototype.matchAll/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar defined = __webpack_require__(43);\\n\",\n       \"\\tvar toLength = __webpack_require__(45);\\n\",\n       \"\\tvar isRegExp = __webpack_require__(142);\\n\",\n       \"\\tvar getFlags = __webpack_require__(205);\\n\",\n       \"\\tvar RegExpProto = RegExp.prototype;\\n\",\n       \"\\t\\n\",\n       \"\\tvar $RegExpStringIterator = function (regexp, string) {\\n\",\n       \"\\t  this._r = regexp;\\n\",\n       \"\\t  this._s = string;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(138)($RegExpStringIterator, 'RegExp String', function next() {\\n\",\n       \"\\t  var match = this._r.exec(this._s);\\n\",\n       \"\\t  return { value: match, done: match === null };\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P, 'String', {\\n\",\n       \"\\t  matchAll: function matchAll(regexp) {\\n\",\n       \"\\t    defined(this);\\n\",\n       \"\\t    if (!isRegExp(regexp)) throw TypeError(regexp + ' is not a regexp!');\\n\",\n       \"\\t    var S = String(this);\\n\",\n       \"\\t    var flags = 'flags' in RegExpProto ? String(regexp.flags) : getFlags.call(regexp);\\n\",\n       \"\\t    var rx = new RegExp(regexp.source, ~flags.indexOf('g') ? flags : 'g' + flags);\\n\",\n       \"\\t    rx.lastIndex = toLength(regexp.lastIndex);\\n\",\n       \"\\t    return new $RegExpStringIterator(rx, S);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 277 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(36)('asyncIterator');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 278 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(36)('observable');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 279 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-object-getownpropertydescriptors\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar ownKeys = __webpack_require__(262);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar gOPD = __webpack_require__(58);\\n\",\n       \"\\tvar createProperty = __webpack_require__(172);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Object', {\\n\",\n       \"\\t  getOwnPropertyDescriptors: function getOwnPropertyDescriptors(object) {\\n\",\n       \"\\t    var O = toIObject(object);\\n\",\n       \"\\t    var getDesc = gOPD.f;\\n\",\n       \"\\t    var keys = ownKeys(O);\\n\",\n       \"\\t    var result = {};\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    var key, desc;\\n\",\n       \"\\t    while (keys.length > i) {\\n\",\n       \"\\t      desc = getDesc(O, key = keys[i++]);\\n\",\n       \"\\t      if (desc !== undefined) createProperty(result, key, desc);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return result;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 280 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-object-values-entries\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $values = __webpack_require__(281)(false);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Object', {\\n\",\n       \"\\t  values: function values(it) {\\n\",\n       \"\\t    return $values(it);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 281 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar getKeys = __webpack_require__(38);\\n\",\n       \"\\tvar toIObject = __webpack_require__(40);\\n\",\n       \"\\tvar isEnum = __webpack_require__(51).f;\\n\",\n       \"\\tmodule.exports = function (isEntries) {\\n\",\n       \"\\t  return function (it) {\\n\",\n       \"\\t    var O = toIObject(it);\\n\",\n       \"\\t    var keys = getKeys(O);\\n\",\n       \"\\t    var length = keys.length;\\n\",\n       \"\\t    var i = 0;\\n\",\n       \"\\t    var result = [];\\n\",\n       \"\\t    var key;\\n\",\n       \"\\t    while (length > i) if (isEnum.call(O, key = keys[i++])) {\\n\",\n       \"\\t      result.push(isEntries ? [key, O[key]] : O[key]);\\n\",\n       \"\\t    } return result;\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 282 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-object-values-entries\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $entries = __webpack_require__(281)(true);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Object', {\\n\",\n       \"\\t  entries: function entries(it) {\\n\",\n       \"\\t    return $entries(it);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 283 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar $defineProperty = __webpack_require__(18);\\n\",\n       \"\\t\\n\",\n       \"\\t// B.2.2.2 Object.prototype.__defineGetter__(P, getter)\\n\",\n       \"\\t__webpack_require__(13) && $export($export.P + __webpack_require__(284), 'Object', {\\n\",\n       \"\\t  __defineGetter__: function __defineGetter__(P, getter) {\\n\",\n       \"\\t    $defineProperty.f(toObject(this), P, { get: aFunction(getter), enumerable: true, configurable: true });\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 284 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// Forced replacement prototype accessors methods\\n\",\n       \"\\tmodule.exports = __webpack_require__(29) || !__webpack_require__(14)(function () {\\n\",\n       \"\\t  var K = Math.random();\\n\",\n       \"\\t  // In FF throws only define methods\\n\",\n       \"\\t  // eslint-disable-next-line no-undef, no-useless-call\\n\",\n       \"\\t  __defineSetter__.call(null, K, function () { /* empty */ });\\n\",\n       \"\\t  delete __webpack_require__(11)[K];\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 285 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar $defineProperty = __webpack_require__(18);\\n\",\n       \"\\t\\n\",\n       \"\\t// B.2.2.3 Object.prototype.__defineSetter__(P, setter)\\n\",\n       \"\\t__webpack_require__(13) && $export($export.P + __webpack_require__(284), 'Object', {\\n\",\n       \"\\t  __defineSetter__: function __defineSetter__(P, setter) {\\n\",\n       \"\\t    $defineProperty.f(toObject(this), P, { set: aFunction(setter), enumerable: true, configurable: true });\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 286 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar getOwnPropertyDescriptor = __webpack_require__(58).f;\\n\",\n       \"\\t\\n\",\n       \"\\t// B.2.2.4 Object.prototype.__lookupGetter__(P)\\n\",\n       \"\\t__webpack_require__(13) && $export($export.P + __webpack_require__(284), 'Object', {\\n\",\n       \"\\t  __lookupGetter__: function __lookupGetter__(P) {\\n\",\n       \"\\t    var O = toObject(this);\\n\",\n       \"\\t    var K = toPrimitive(P, true);\\n\",\n       \"\\t    var D;\\n\",\n       \"\\t    do {\\n\",\n       \"\\t      if (D = getOwnPropertyDescriptor(O, K)) return D.get;\\n\",\n       \"\\t    } while (O = getPrototypeOf(O));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 287 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar toObject = __webpack_require__(65);\\n\",\n       \"\\tvar toPrimitive = __webpack_require__(23);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar getOwnPropertyDescriptor = __webpack_require__(58).f;\\n\",\n       \"\\t\\n\",\n       \"\\t// B.2.2.5 Object.prototype.__lookupSetter__(P)\\n\",\n       \"\\t__webpack_require__(13) && $export($export.P + __webpack_require__(284), 'Object', {\\n\",\n       \"\\t  __lookupSetter__: function __lookupSetter__(P) {\\n\",\n       \"\\t    var O = toObject(this);\\n\",\n       \"\\t    var K = toPrimitive(P, true);\\n\",\n       \"\\t    var D;\\n\",\n       \"\\t    do {\\n\",\n       \"\\t      if (D = getOwnPropertyDescriptor(O, K)) return D.set;\\n\",\n       \"\\t    } while (O = getPrototypeOf(O));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 288 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/DavidBruant/Map-Set.prototype.toJSON\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.R, 'Map', { toJSON: __webpack_require__(289)('Map') });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 289 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/DavidBruant/Map-Set.prototype.toJSON\\n\",\n       \"\\tvar classof = __webpack_require__(82);\\n\",\n       \"\\tvar from = __webpack_require__(290);\\n\",\n       \"\\tmodule.exports = function (NAME) {\\n\",\n       \"\\t  return function toJSON() {\\n\",\n       \"\\t    if (classof(this) != NAME) throw TypeError(NAME + \\\"#toJSON isn't generic\\\");\\n\",\n       \"\\t    return from(this);\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 290 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (iter, ITERATOR) {\\n\",\n       \"\\t  var result = [];\\n\",\n       \"\\t  forOf(iter, false, result.push, result, ITERATOR);\\n\",\n       \"\\t  return result;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 291 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/DavidBruant/Map-Set.prototype.toJSON\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.R, 'Set', { toJSON: __webpack_require__(289)('Set') });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 292 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-map.of\\n\",\n       \"\\t__webpack_require__(293)('Map');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 293 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (COLLECTION) {\\n\",\n       \"\\t  $export($export.S, COLLECTION, { of: function of() {\\n\",\n       \"\\t    var length = arguments.length;\\n\",\n       \"\\t    var A = new Array(length);\\n\",\n       \"\\t    while (length--) A[length] = arguments[length];\\n\",\n       \"\\t    return new this(A);\\n\",\n       \"\\t  } });\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 294 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-set.of\\n\",\n       \"\\t__webpack_require__(293)('Set');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 295 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-weakmap.of\\n\",\n       \"\\t__webpack_require__(293)('WeakMap');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 296 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-weakset.of\\n\",\n       \"\\t__webpack_require__(293)('WeakSet');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 297 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-map.from\\n\",\n       \"\\t__webpack_require__(298)('Map');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 298 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar ctx = __webpack_require__(30);\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function (COLLECTION) {\\n\",\n       \"\\t  $export($export.S, COLLECTION, { from: function from(source /* , mapFn, thisArg */) {\\n\",\n       \"\\t    var mapFn = arguments[1];\\n\",\n       \"\\t    var mapping, A, n, cb;\\n\",\n       \"\\t    aFunction(this);\\n\",\n       \"\\t    mapping = mapFn !== undefined;\\n\",\n       \"\\t    if (mapping) aFunction(mapFn);\\n\",\n       \"\\t    if (source == undefined) return new this();\\n\",\n       \"\\t    A = [];\\n\",\n       \"\\t    if (mapping) {\\n\",\n       \"\\t      n = 0;\\n\",\n       \"\\t      cb = ctx(mapFn, arguments[2], 2);\\n\",\n       \"\\t      forOf(source, false, function (nextItem) {\\n\",\n       \"\\t        A.push(cb(nextItem, n++));\\n\",\n       \"\\t      });\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      forOf(source, false, A.push, A);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return new this(A);\\n\",\n       \"\\t  } });\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 299 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-set.from\\n\",\n       \"\\t__webpack_require__(298)('Set');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 300 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-weakmap.from\\n\",\n       \"\\t__webpack_require__(298)('WeakMap');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 301 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://tc39.github.io/proposal-setmap-offrom/#sec-weakset.from\\n\",\n       \"\\t__webpack_require__(298)('WeakSet');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 302 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-global\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.G, { global: __webpack_require__(11) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 303 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-global\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'System', { global: __webpack_require__(11) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 304 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/ljharb/proposal-is-error\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar cof = __webpack_require__(42);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Error', {\\n\",\n       \"\\t  isError: function isError(it) {\\n\",\n       \"\\t    return cof(it) === 'Error';\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 305 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  clamp: function clamp(x, lower, upper) {\\n\",\n       \"\\t    return Math.min(upper, Math.max(lower, x));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 306 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { DEG_PER_RAD: Math.PI / 180 });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 307 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar RAD_PER_DEG = 180 / Math.PI;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  degrees: function degrees(radians) {\\n\",\n       \"\\t    return radians * RAD_PER_DEG;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 308 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar scale = __webpack_require__(309);\\n\",\n       \"\\tvar fround = __webpack_require__(121);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  fscale: function fscale(x, inLow, inHigh, outLow, outHigh) {\\n\",\n       \"\\t    return fround(scale(x, inLow, inHigh, outLow, outHigh));\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 309 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tmodule.exports = Math.scale || function scale(x, inLow, inHigh, outLow, outHigh) {\\n\",\n       \"\\t  if (\\n\",\n       \"\\t    arguments.length === 0\\n\",\n       \"\\t      // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t      || x != x\\n\",\n       \"\\t      // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t      || inLow != inLow\\n\",\n       \"\\t      // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t      || inHigh != inHigh\\n\",\n       \"\\t      // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t      || outLow != outLow\\n\",\n       \"\\t      // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t      || outHigh != outHigh\\n\",\n       \"\\t  ) return NaN;\\n\",\n       \"\\t  if (x === Infinity || x === -Infinity) return x;\\n\",\n       \"\\t  return (x - inLow) * (outHigh - outLow) / (inHigh - inLow) + outLow;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 310 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  iaddh: function iaddh(x0, x1, y0, y1) {\\n\",\n       \"\\t    var $x0 = x0 >>> 0;\\n\",\n       \"\\t    var $x1 = x1 >>> 0;\\n\",\n       \"\\t    var $y0 = y0 >>> 0;\\n\",\n       \"\\t    return $x1 + (y1 >>> 0) + (($x0 & $y0 | ($x0 | $y0) & ~($x0 + $y0 >>> 0)) >>> 31) | 0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 311 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  isubh: function isubh(x0, x1, y0, y1) {\\n\",\n       \"\\t    var $x0 = x0 >>> 0;\\n\",\n       \"\\t    var $x1 = x1 >>> 0;\\n\",\n       \"\\t    var $y0 = y0 >>> 0;\\n\",\n       \"\\t    return $x1 - (y1 >>> 0) - ((~$x0 & $y0 | ~($x0 ^ $y0) & $x0 - $y0 >>> 0) >>> 31) | 0;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 312 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  imulh: function imulh(u, v) {\\n\",\n       \"\\t    var UINT16 = 0xffff;\\n\",\n       \"\\t    var $u = +u;\\n\",\n       \"\\t    var $v = +v;\\n\",\n       \"\\t    var u0 = $u & UINT16;\\n\",\n       \"\\t    var v0 = $v & UINT16;\\n\",\n       \"\\t    var u1 = $u >> 16;\\n\",\n       \"\\t    var v1 = $v >> 16;\\n\",\n       \"\\t    var t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);\\n\",\n       \"\\t    return u1 * v1 + (t >> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >> 16);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 313 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { RAD_PER_DEG: 180 / Math.PI });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 314 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar DEG_PER_RAD = Math.PI / 180;\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  radians: function radians(degrees) {\\n\",\n       \"\\t    return degrees * DEG_PER_RAD;\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 315 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://rwaldron.github.io/proposal-math-extensions/\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { scale: __webpack_require__(309) });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 316 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://gist.github.com/BrendanEich/4294d5c212a6d2254703\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', {\\n\",\n       \"\\t  umulh: function umulh(u, v) {\\n\",\n       \"\\t    var UINT16 = 0xffff;\\n\",\n       \"\\t    var $u = +u;\\n\",\n       \"\\t    var $v = +v;\\n\",\n       \"\\t    var u0 = $u & UINT16;\\n\",\n       \"\\t    var v0 = $v & UINT16;\\n\",\n       \"\\t    var u1 = $u >>> 16;\\n\",\n       \"\\t    var v1 = $v >>> 16;\\n\",\n       \"\\t    var t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16);\\n\",\n       \"\\t    return u1 * v1 + (t >>> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >>> 16);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 317 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// http://jfbastien.github.io/papers/Math.signbit.html\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Math', { signbit: function signbit(x) {\\n\",\n       \"\\t  // eslint-disable-next-line no-self-compare\\n\",\n       \"\\t  return (x = +x) != x ? x : x == 0 ? 1 / x == Infinity : x > 0;\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 318 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/tc39/proposal-promise-finally\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar core = __webpack_require__(16);\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar speciesConstructor = __webpack_require__(217);\\n\",\n       \"\\tvar promiseResolve = __webpack_require__(226);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.P + $export.R, 'Promise', { 'finally': function (onFinally) {\\n\",\n       \"\\t  var C = speciesConstructor(this, core.Promise || global.Promise);\\n\",\n       \"\\t  var isFunction = typeof onFinally == 'function';\\n\",\n       \"\\t  return this.then(\\n\",\n       \"\\t    isFunction ? function (x) {\\n\",\n       \"\\t      return promiseResolve(C, onFinally()).then(function () { return x; });\\n\",\n       \"\\t    } : onFinally,\\n\",\n       \"\\t    isFunction ? function (e) {\\n\",\n       \"\\t      return promiseResolve(C, onFinally()).then(function () { throw e; });\\n\",\n       \"\\t    } : onFinally\\n\",\n       \"\\t  );\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 319 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/tc39/proposal-promise-try\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar newPromiseCapability = __webpack_require__(223);\\n\",\n       \"\\tvar perform = __webpack_require__(224);\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'Promise', { 'try': function (callbackfn) {\\n\",\n       \"\\t  var promiseCapability = newPromiseCapability.f(this);\\n\",\n       \"\\t  var result = perform(callbackfn);\\n\",\n       \"\\t  (result.e ? promiseCapability.reject : promiseCapability.resolve)(result.v);\\n\",\n       \"\\t  return promiseCapability.promise;\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 320 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\tvar ordinaryDefineOwnMetadata = metadata.set;\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ defineMetadata: function defineMetadata(metadataKey, metadataValue, target, targetKey) {\\n\",\n       \"\\t  ordinaryDefineOwnMetadata(metadataKey, metadataValue, anObject(target), toMetaKey(targetKey));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 321 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar Map = __webpack_require__(228);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar shared = __webpack_require__(28)('metadata');\\n\",\n       \"\\tvar store = shared.store || (shared.store = new (__webpack_require__(233))());\\n\",\n       \"\\t\\n\",\n       \"\\tvar getOrCreateMetadataMap = function (target, targetKey, create) {\\n\",\n       \"\\t  var targetMetadata = store.get(target);\\n\",\n       \"\\t  if (!targetMetadata) {\\n\",\n       \"\\t    if (!create) return undefined;\\n\",\n       \"\\t    store.set(target, targetMetadata = new Map());\\n\",\n       \"\\t  }\\n\",\n       \"\\t  var keyMetadata = targetMetadata.get(targetKey);\\n\",\n       \"\\t  if (!keyMetadata) {\\n\",\n       \"\\t    if (!create) return undefined;\\n\",\n       \"\\t    targetMetadata.set(targetKey, keyMetadata = new Map());\\n\",\n       \"\\t  } return keyMetadata;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar ordinaryHasOwnMetadata = function (MetadataKey, O, P) {\\n\",\n       \"\\t  var metadataMap = getOrCreateMetadataMap(O, P, false);\\n\",\n       \"\\t  return metadataMap === undefined ? false : metadataMap.has(MetadataKey);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar ordinaryGetOwnMetadata = function (MetadataKey, O, P) {\\n\",\n       \"\\t  var metadataMap = getOrCreateMetadataMap(O, P, false);\\n\",\n       \"\\t  return metadataMap === undefined ? undefined : metadataMap.get(MetadataKey);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar ordinaryDefineOwnMetadata = function (MetadataKey, MetadataValue, O, P) {\\n\",\n       \"\\t  getOrCreateMetadataMap(O, P, true).set(MetadataKey, MetadataValue);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar ordinaryOwnMetadataKeys = function (target, targetKey) {\\n\",\n       \"\\t  var metadataMap = getOrCreateMetadataMap(target, targetKey, false);\\n\",\n       \"\\t  var keys = [];\\n\",\n       \"\\t  if (metadataMap) metadataMap.forEach(function (_, key) { keys.push(key); });\\n\",\n       \"\\t  return keys;\\n\",\n       \"\\t};\\n\",\n       \"\\tvar toMetaKey = function (it) {\\n\",\n       \"\\t  return it === undefined || typeof it == 'symbol' ? it : String(it);\\n\",\n       \"\\t};\\n\",\n       \"\\tvar exp = function (O) {\\n\",\n       \"\\t  $export($export.S, 'Reflect', O);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = {\\n\",\n       \"\\t  store: store,\\n\",\n       \"\\t  map: getOrCreateMetadataMap,\\n\",\n       \"\\t  has: ordinaryHasOwnMetadata,\\n\",\n       \"\\t  get: ordinaryGetOwnMetadata,\\n\",\n       \"\\t  set: ordinaryDefineOwnMetadata,\\n\",\n       \"\\t  keys: ordinaryOwnMetadataKeys,\\n\",\n       \"\\t  key: toMetaKey,\\n\",\n       \"\\t  exp: exp\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 322 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\tvar getOrCreateMetadataMap = metadata.map;\\n\",\n       \"\\tvar store = metadata.store;\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ deleteMetadata: function deleteMetadata(metadataKey, target /* , targetKey */) {\\n\",\n       \"\\t  var targetKey = arguments.length < 3 ? undefined : toMetaKey(arguments[2]);\\n\",\n       \"\\t  var metadataMap = getOrCreateMetadataMap(anObject(target), targetKey, false);\\n\",\n       \"\\t  if (metadataMap === undefined || !metadataMap['delete'](metadataKey)) return false;\\n\",\n       \"\\t  if (metadataMap.size) return true;\\n\",\n       \"\\t  var targetMetadata = store.get(target);\\n\",\n       \"\\t  targetMetadata['delete'](targetKey);\\n\",\n       \"\\t  return !!targetMetadata.size || store['delete'](target);\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 323 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar ordinaryHasOwnMetadata = metadata.has;\\n\",\n       \"\\tvar ordinaryGetOwnMetadata = metadata.get;\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\t\\n\",\n       \"\\tvar ordinaryGetMetadata = function (MetadataKey, O, P) {\\n\",\n       \"\\t  var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);\\n\",\n       \"\\t  if (hasOwn) return ordinaryGetOwnMetadata(MetadataKey, O, P);\\n\",\n       \"\\t  var parent = getPrototypeOf(O);\\n\",\n       \"\\t  return parent !== null ? ordinaryGetMetadata(MetadataKey, parent, P) : undefined;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ getMetadata: function getMetadata(metadataKey, target /* , targetKey */) {\\n\",\n       \"\\t  return ordinaryGetMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 324 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar Set = __webpack_require__(232);\\n\",\n       \"\\tvar from = __webpack_require__(290);\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar ordinaryOwnMetadataKeys = metadata.keys;\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\t\\n\",\n       \"\\tvar ordinaryMetadataKeys = function (O, P) {\\n\",\n       \"\\t  var oKeys = ordinaryOwnMetadataKeys(O, P);\\n\",\n       \"\\t  var parent = getPrototypeOf(O);\\n\",\n       \"\\t  if (parent === null) return oKeys;\\n\",\n       \"\\t  var pKeys = ordinaryMetadataKeys(parent, P);\\n\",\n       \"\\t  return pKeys.length ? oKeys.length ? from(new Set(oKeys.concat(pKeys))) : pKeys : oKeys;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ getMetadataKeys: function getMetadataKeys(target /* , targetKey */) {\\n\",\n       \"\\t  return ordinaryMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 325 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar ordinaryGetOwnMetadata = metadata.get;\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ getOwnMetadata: function getOwnMetadata(metadataKey, target /* , targetKey */) {\\n\",\n       \"\\t  return ordinaryGetOwnMetadata(metadataKey, anObject(target)\\n\",\n       \"\\t    , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 326 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar ordinaryOwnMetadataKeys = metadata.keys;\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ getOwnMetadataKeys: function getOwnMetadataKeys(target /* , targetKey */) {\\n\",\n       \"\\t  return ordinaryOwnMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1]));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 327 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar getPrototypeOf = __webpack_require__(66);\\n\",\n       \"\\tvar ordinaryHasOwnMetadata = metadata.has;\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\t\\n\",\n       \"\\tvar ordinaryHasMetadata = function (MetadataKey, O, P) {\\n\",\n       \"\\t  var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P);\\n\",\n       \"\\t  if (hasOwn) return true;\\n\",\n       \"\\t  var parent = getPrototypeOf(O);\\n\",\n       \"\\t  return parent !== null ? ordinaryHasMetadata(MetadataKey, parent, P) : false;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ hasMetadata: function hasMetadata(metadataKey, target /* , targetKey */) {\\n\",\n       \"\\t  return ordinaryHasMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 328 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar ordinaryHasOwnMetadata = metadata.has;\\n\",\n       \"\\tvar toMetaKey = metadata.key;\\n\",\n       \"\\t\\n\",\n       \"\\tmetadata.exp({ hasOwnMetadata: function hasOwnMetadata(metadataKey, target /* , targetKey */) {\\n\",\n       \"\\t  return ordinaryHasOwnMetadata(metadataKey, anObject(target)\\n\",\n       \"\\t    , arguments.length < 3 ? undefined : toMetaKey(arguments[2]));\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 329 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $metadata = __webpack_require__(321);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar toMetaKey = $metadata.key;\\n\",\n       \"\\tvar ordinaryDefineOwnMetadata = $metadata.set;\\n\",\n       \"\\t\\n\",\n       \"\\t$metadata.exp({ metadata: function metadata(metadataKey, metadataValue) {\\n\",\n       \"\\t  return function decorator(target, targetKey) {\\n\",\n       \"\\t    ordinaryDefineOwnMetadata(\\n\",\n       \"\\t      metadataKey, metadataValue,\\n\",\n       \"\\t      (targetKey !== undefined ? anObject : aFunction)(target),\\n\",\n       \"\\t      toMetaKey(targetKey)\\n\",\n       \"\\t    );\\n\",\n       \"\\t  };\\n\",\n       \"\\t} });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 330 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/rwaldron/tc39-notes/blob/master/es6/2014-09/sept-25.md#510-globalasap-for-enqueuing-a-microtask\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar microtask = __webpack_require__(222)();\\n\",\n       \"\\tvar process = __webpack_require__(11).process;\\n\",\n       \"\\tvar isNode = __webpack_require__(42)(process) == 'process';\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.G, {\\n\",\n       \"\\t  asap: function asap(fn) {\\n\",\n       \"\\t    var domain = isNode && process.domain;\\n\",\n       \"\\t    microtask(domain ? domain.bind(fn) : fn);\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 331 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t'use strict';\\n\",\n       \"\\t// https://github.com/zenparsing/es-observable\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar core = __webpack_require__(16);\\n\",\n       \"\\tvar microtask = __webpack_require__(222)();\\n\",\n       \"\\tvar OBSERVABLE = __webpack_require__(34)('observable');\\n\",\n       \"\\tvar aFunction = __webpack_require__(31);\\n\",\n       \"\\tvar anObject = __webpack_require__(19);\\n\",\n       \"\\tvar anInstance = __webpack_require__(219);\\n\",\n       \"\\tvar redefineAll = __webpack_require__(227);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar forOf = __webpack_require__(220);\\n\",\n       \"\\tvar RETURN = forOf.RETURN;\\n\",\n       \"\\t\\n\",\n       \"\\tvar getMethod = function (fn) {\\n\",\n       \"\\t  return fn == null ? undefined : aFunction(fn);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar cleanupSubscription = function (subscription) {\\n\",\n       \"\\t  var cleanup = subscription._c;\\n\",\n       \"\\t  if (cleanup) {\\n\",\n       \"\\t    subscription._c = undefined;\\n\",\n       \"\\t    cleanup();\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar subscriptionClosed = function (subscription) {\\n\",\n       \"\\t  return subscription._o === undefined;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar closeSubscription = function (subscription) {\\n\",\n       \"\\t  if (!subscriptionClosed(subscription)) {\\n\",\n       \"\\t    subscription._o = undefined;\\n\",\n       \"\\t    cleanupSubscription(subscription);\\n\",\n       \"\\t  }\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tvar Subscription = function (observer, subscriber) {\\n\",\n       \"\\t  anObject(observer);\\n\",\n       \"\\t  this._c = undefined;\\n\",\n       \"\\t  this._o = observer;\\n\",\n       \"\\t  observer = new SubscriptionObserver(this);\\n\",\n       \"\\t  try {\\n\",\n       \"\\t    var cleanup = subscriber(observer);\\n\",\n       \"\\t    var subscription = cleanup;\\n\",\n       \"\\t    if (cleanup != null) {\\n\",\n       \"\\t      if (typeof cleanup.unsubscribe === 'function') cleanup = function () { subscription.unsubscribe(); };\\n\",\n       \"\\t      else aFunction(cleanup);\\n\",\n       \"\\t      this._c = cleanup;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  } catch (e) {\\n\",\n       \"\\t    observer.error(e);\\n\",\n       \"\\t    return;\\n\",\n       \"\\t  } if (subscriptionClosed(this)) cleanupSubscription(this);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tSubscription.prototype = redefineAll({}, {\\n\",\n       \"\\t  unsubscribe: function unsubscribe() { closeSubscription(this); }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar SubscriptionObserver = function (subscription) {\\n\",\n       \"\\t  this._s = subscription;\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tSubscriptionObserver.prototype = redefineAll({}, {\\n\",\n       \"\\t  next: function next(value) {\\n\",\n       \"\\t    var subscription = this._s;\\n\",\n       \"\\t    if (!subscriptionClosed(subscription)) {\\n\",\n       \"\\t      var observer = subscription._o;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        var m = getMethod(observer.next);\\n\",\n       \"\\t        if (m) return m.call(observer, value);\\n\",\n       \"\\t      } catch (e) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          closeSubscription(subscription);\\n\",\n       \"\\t        } finally {\\n\",\n       \"\\t          throw e;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t  },\\n\",\n       \"\\t  error: function error(value) {\\n\",\n       \"\\t    var subscription = this._s;\\n\",\n       \"\\t    if (subscriptionClosed(subscription)) throw value;\\n\",\n       \"\\t    var observer = subscription._o;\\n\",\n       \"\\t    subscription._o = undefined;\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      var m = getMethod(observer.error);\\n\",\n       \"\\t      if (!m) throw value;\\n\",\n       \"\\t      value = m.call(observer, value);\\n\",\n       \"\\t    } catch (e) {\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        cleanupSubscription(subscription);\\n\",\n       \"\\t      } finally {\\n\",\n       \"\\t        throw e;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    } cleanupSubscription(subscription);\\n\",\n       \"\\t    return value;\\n\",\n       \"\\t  },\\n\",\n       \"\\t  complete: function complete(value) {\\n\",\n       \"\\t    var subscription = this._s;\\n\",\n       \"\\t    if (!subscriptionClosed(subscription)) {\\n\",\n       \"\\t      var observer = subscription._o;\\n\",\n       \"\\t      subscription._o = undefined;\\n\",\n       \"\\t      try {\\n\",\n       \"\\t        var m = getMethod(observer.complete);\\n\",\n       \"\\t        value = m ? m.call(observer, value) : undefined;\\n\",\n       \"\\t      } catch (e) {\\n\",\n       \"\\t        try {\\n\",\n       \"\\t          cleanupSubscription(subscription);\\n\",\n       \"\\t        } finally {\\n\",\n       \"\\t          throw e;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      } cleanupSubscription(subscription);\\n\",\n       \"\\t      return value;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tvar $Observable = function Observable(subscriber) {\\n\",\n       \"\\t  anInstance(this, $Observable, 'Observable', '_f')._f = aFunction(subscriber);\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tredefineAll($Observable.prototype, {\\n\",\n       \"\\t  subscribe: function subscribe(observer) {\\n\",\n       \"\\t    return new Subscription(observer, this._f);\\n\",\n       \"\\t  },\\n\",\n       \"\\t  forEach: function forEach(fn) {\\n\",\n       \"\\t    var that = this;\\n\",\n       \"\\t    return new (core.Promise || global.Promise)(function (resolve, reject) {\\n\",\n       \"\\t      aFunction(fn);\\n\",\n       \"\\t      var subscription = that.subscribe({\\n\",\n       \"\\t        next: function (value) {\\n\",\n       \"\\t          try {\\n\",\n       \"\\t            return fn(value);\\n\",\n       \"\\t          } catch (e) {\\n\",\n       \"\\t            reject(e);\\n\",\n       \"\\t            subscription.unsubscribe();\\n\",\n       \"\\t          }\\n\",\n       \"\\t        },\\n\",\n       \"\\t        error: reject,\\n\",\n       \"\\t        complete: resolve\\n\",\n       \"\\t      });\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\tredefineAll($Observable, {\\n\",\n       \"\\t  from: function from(x) {\\n\",\n       \"\\t    var C = typeof this === 'function' ? this : $Observable;\\n\",\n       \"\\t    var method = getMethod(anObject(x)[OBSERVABLE]);\\n\",\n       \"\\t    if (method) {\\n\",\n       \"\\t      var observable = anObject(method.call(x));\\n\",\n       \"\\t      return observable.constructor === C ? observable : new C(function (observer) {\\n\",\n       \"\\t        return observable.subscribe(observer);\\n\",\n       \"\\t      });\\n\",\n       \"\\t    }\\n\",\n       \"\\t    return new C(function (observer) {\\n\",\n       \"\\t      var done = false;\\n\",\n       \"\\t      microtask(function () {\\n\",\n       \"\\t        if (!done) {\\n\",\n       \"\\t          try {\\n\",\n       \"\\t            if (forOf(x, false, function (it) {\\n\",\n       \"\\t              observer.next(it);\\n\",\n       \"\\t              if (done) return RETURN;\\n\",\n       \"\\t            }) === RETURN) return;\\n\",\n       \"\\t          } catch (e) {\\n\",\n       \"\\t            if (done) throw e;\\n\",\n       \"\\t            observer.error(e);\\n\",\n       \"\\t            return;\\n\",\n       \"\\t          } observer.complete();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return function () { done = true; };\\n\",\n       \"\\t    });\\n\",\n       \"\\t  },\\n\",\n       \"\\t  of: function of() {\\n\",\n       \"\\t    for (var i = 0, l = arguments.length, items = new Array(l); i < l;) items[i] = arguments[i++];\\n\",\n       \"\\t    return new (typeof this === 'function' ? this : $Observable)(function (observer) {\\n\",\n       \"\\t      var done = false;\\n\",\n       \"\\t      microtask(function () {\\n\",\n       \"\\t        if (!done) {\\n\",\n       \"\\t          for (var j = 0; j < items.length; ++j) {\\n\",\n       \"\\t            observer.next(items[j]);\\n\",\n       \"\\t            if (done) return;\\n\",\n       \"\\t          } observer.complete();\\n\",\n       \"\\t        }\\n\",\n       \"\\t      });\\n\",\n       \"\\t      return function () { done = true; };\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t});\\n\",\n       \"\\t\\n\",\n       \"\\thide($Observable.prototype, OBSERVABLE, function () { return this; });\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.G, { Observable: $Observable });\\n\",\n       \"\\t\\n\",\n       \"\\t__webpack_require__(201)('Observable');\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 332 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// ie9- setTimeout & setInterval additional parameters fix\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar userAgent = __webpack_require__(225);\\n\",\n       \"\\tvar slice = [].slice;\\n\",\n       \"\\tvar MSIE = /MSIE .\\\\./.test(userAgent); // <- dirty ie9- check\\n\",\n       \"\\tvar wrap = function (set) {\\n\",\n       \"\\t  return function (fn, time /* , ...args */) {\\n\",\n       \"\\t    var boundArgs = arguments.length > 2;\\n\",\n       \"\\t    var args = boundArgs ? slice.call(arguments, 2) : false;\\n\",\n       \"\\t    return set(boundArgs ? function () {\\n\",\n       \"\\t      // eslint-disable-next-line no-new-func\\n\",\n       \"\\t      (typeof fn == 'function' ? fn : Function(fn)).apply(this, args);\\n\",\n       \"\\t    } : fn, time);\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\t$export($export.G + $export.B + $export.F * MSIE, {\\n\",\n       \"\\t  setTimeout: wrap(global.setTimeout),\\n\",\n       \"\\t  setInterval: wrap(global.setInterval)\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 333 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $task = __webpack_require__(221);\\n\",\n       \"\\t$export($export.G + $export.B, {\\n\",\n       \"\\t  setImmediate: $task.set,\\n\",\n       \"\\t  clearImmediate: $task.clear\\n\",\n       \"\\t});\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 334 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\tvar $iterators = __webpack_require__(202);\\n\",\n       \"\\tvar getKeys = __webpack_require__(38);\\n\",\n       \"\\tvar redefine = __webpack_require__(25);\\n\",\n       \"\\tvar global = __webpack_require__(11);\\n\",\n       \"\\tvar hide = __webpack_require__(17);\\n\",\n       \"\\tvar Iterators = __webpack_require__(137);\\n\",\n       \"\\tvar wks = __webpack_require__(34);\\n\",\n       \"\\tvar ITERATOR = wks('iterator');\\n\",\n       \"\\tvar TO_STRING_TAG = wks('toStringTag');\\n\",\n       \"\\tvar ArrayValues = Iterators.Array;\\n\",\n       \"\\t\\n\",\n       \"\\tvar DOMIterables = {\\n\",\n       \"\\t  CSSRuleList: true, // TODO: Not spec compliant, should be false.\\n\",\n       \"\\t  CSSStyleDeclaration: false,\\n\",\n       \"\\t  CSSValueList: false,\\n\",\n       \"\\t  ClientRectList: false,\\n\",\n       \"\\t  DOMRectList: false,\\n\",\n       \"\\t  DOMStringList: false,\\n\",\n       \"\\t  DOMTokenList: true,\\n\",\n       \"\\t  DataTransferItemList: false,\\n\",\n       \"\\t  FileList: false,\\n\",\n       \"\\t  HTMLAllCollection: false,\\n\",\n       \"\\t  HTMLCollection: false,\\n\",\n       \"\\t  HTMLFormElement: false,\\n\",\n       \"\\t  HTMLSelectElement: false,\\n\",\n       \"\\t  MediaList: true, // TODO: Not spec compliant, should be false.\\n\",\n       \"\\t  MimeTypeArray: false,\\n\",\n       \"\\t  NamedNodeMap: false,\\n\",\n       \"\\t  NodeList: true,\\n\",\n       \"\\t  PaintRequestList: false,\\n\",\n       \"\\t  Plugin: false,\\n\",\n       \"\\t  PluginArray: false,\\n\",\n       \"\\t  SVGLengthList: false,\\n\",\n       \"\\t  SVGNumberList: false,\\n\",\n       \"\\t  SVGPathSegList: false,\\n\",\n       \"\\t  SVGPointList: false,\\n\",\n       \"\\t  SVGStringList: false,\\n\",\n       \"\\t  SVGTransformList: false,\\n\",\n       \"\\t  SourceBufferList: false,\\n\",\n       \"\\t  StyleSheetList: true, // TODO: Not spec compliant, should be false.\\n\",\n       \"\\t  TextTrackCueList: false,\\n\",\n       \"\\t  TextTrackList: false,\\n\",\n       \"\\t  TouchList: false\\n\",\n       \"\\t};\\n\",\n       \"\\t\\n\",\n       \"\\tfor (var collections = getKeys(DOMIterables), i = 0; i < collections.length; i++) {\\n\",\n       \"\\t  var NAME = collections[i];\\n\",\n       \"\\t  var explicit = DOMIterables[NAME];\\n\",\n       \"\\t  var Collection = global[NAME];\\n\",\n       \"\\t  var proto = Collection && Collection.prototype;\\n\",\n       \"\\t  var key;\\n\",\n       \"\\t  if (proto) {\\n\",\n       \"\\t    if (!proto[ITERATOR]) hide(proto, ITERATOR, ArrayValues);\\n\",\n       \"\\t    if (!proto[TO_STRING_TAG]) hide(proto, TO_STRING_TAG, NAME);\\n\",\n       \"\\t    Iterators[NAME] = ArrayValues;\\n\",\n       \"\\t    if (explicit) for (key in $iterators) if (!proto[key]) redefine(proto, key, $iterators[key], true);\\n\",\n       \"\\t  }\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 335 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */(function(global) {/**\\n\",\n       \"\\t * Copyright (c) 2014, Facebook, Inc.\\n\",\n       \"\\t * All rights reserved.\\n\",\n       \"\\t *\\n\",\n       \"\\t * This source code is licensed under the BSD-style license found in the\\n\",\n       \"\\t * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\\n\",\n       \"\\t * additional grant of patent rights can be found in the PATENTS file in\\n\",\n       \"\\t * the same directory.\\n\",\n       \"\\t */\\n\",\n       \"\\t\\n\",\n       \"\\t!(function(global) {\\n\",\n       \"\\t  \\\"use strict\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t  var Op = Object.prototype;\\n\",\n       \"\\t  var hasOwn = Op.hasOwnProperty;\\n\",\n       \"\\t  var undefined; // More compressible than void 0.\\n\",\n       \"\\t  var $Symbol = typeof Symbol === \\\"function\\\" ? Symbol : {};\\n\",\n       \"\\t  var iteratorSymbol = $Symbol.iterator || \\\"@@iterator\\\";\\n\",\n       \"\\t  var asyncIteratorSymbol = $Symbol.asyncIterator || \\\"@@asyncIterator\\\";\\n\",\n       \"\\t  var toStringTagSymbol = $Symbol.toStringTag || \\\"@@toStringTag\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t  var inModule = typeof module === \\\"object\\\";\\n\",\n       \"\\t  var runtime = global.regeneratorRuntime;\\n\",\n       \"\\t  if (runtime) {\\n\",\n       \"\\t    if (inModule) {\\n\",\n       \"\\t      // If regeneratorRuntime is defined globally and we're in a module,\\n\",\n       \"\\t      // make the exports object identical to regeneratorRuntime.\\n\",\n       \"\\t      module.exports = runtime;\\n\",\n       \"\\t    }\\n\",\n       \"\\t    // Don't bother evaluating the rest of this file if the runtime was\\n\",\n       \"\\t    // already defined globally.\\n\",\n       \"\\t    return;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  // Define the runtime globally (as expected by generated code) as either\\n\",\n       \"\\t  // module.exports (if we're in a module) or a new, empty object.\\n\",\n       \"\\t  runtime = global.regeneratorRuntime = inModule ? module.exports : {};\\n\",\n       \"\\t\\n\",\n       \"\\t  function wrap(innerFn, outerFn, self, tryLocsList) {\\n\",\n       \"\\t    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\\n\",\n       \"\\t    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\\n\",\n       \"\\t    var generator = Object.create(protoGenerator.prototype);\\n\",\n       \"\\t    var context = new Context(tryLocsList || []);\\n\",\n       \"\\t\\n\",\n       \"\\t    // The ._invoke method unifies the implementations of the .next,\\n\",\n       \"\\t    // .throw, and .return methods.\\n\",\n       \"\\t    generator._invoke = makeInvokeMethod(innerFn, self, context);\\n\",\n       \"\\t\\n\",\n       \"\\t    return generator;\\n\",\n       \"\\t  }\\n\",\n       \"\\t  runtime.wrap = wrap;\\n\",\n       \"\\t\\n\",\n       \"\\t  // Try/catch helper to minimize deoptimizations. Returns a completion\\n\",\n       \"\\t  // record like context.tryEntries[i].completion. This interface could\\n\",\n       \"\\t  // have been (and was previously) designed to take a closure to be\\n\",\n       \"\\t  // invoked without arguments, but in all the cases we care about we\\n\",\n       \"\\t  // already have an existing method we want to call, so there's no need\\n\",\n       \"\\t  // to create a new function object. We can even get away with assuming\\n\",\n       \"\\t  // the method takes exactly one argument, since that happens to be true\\n\",\n       \"\\t  // in every case, so we don't have to touch the arguments object. The\\n\",\n       \"\\t  // only additional allocation required is the completion record, which\\n\",\n       \"\\t  // has a stable shape and so hopefully should be cheap to allocate.\\n\",\n       \"\\t  function tryCatch(fn, obj, arg) {\\n\",\n       \"\\t    try {\\n\",\n       \"\\t      return { type: \\\"normal\\\", arg: fn.call(obj, arg) };\\n\",\n       \"\\t    } catch (err) {\\n\",\n       \"\\t      return { type: \\\"throw\\\", arg: err };\\n\",\n       \"\\t    }\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  var GenStateSuspendedStart = \\\"suspendedStart\\\";\\n\",\n       \"\\t  var GenStateSuspendedYield = \\\"suspendedYield\\\";\\n\",\n       \"\\t  var GenStateExecuting = \\\"executing\\\";\\n\",\n       \"\\t  var GenStateCompleted = \\\"completed\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t  // Returning this object from the innerFn has the same effect as\\n\",\n       \"\\t  // breaking out of the dispatch switch statement.\\n\",\n       \"\\t  var ContinueSentinel = {};\\n\",\n       \"\\t\\n\",\n       \"\\t  // Dummy constructor functions that we use as the .constructor and\\n\",\n       \"\\t  // .constructor.prototype properties for functions that return Generator\\n\",\n       \"\\t  // objects. For full spec compliance, you may wish to configure your\\n\",\n       \"\\t  // minifier not to mangle the names of these two functions.\\n\",\n       \"\\t  function Generator() {}\\n\",\n       \"\\t  function GeneratorFunction() {}\\n\",\n       \"\\t  function GeneratorFunctionPrototype() {}\\n\",\n       \"\\t\\n\",\n       \"\\t  // This is a polyfill for %IteratorPrototype% for environments that\\n\",\n       \"\\t  // don't natively support it.\\n\",\n       \"\\t  var IteratorPrototype = {};\\n\",\n       \"\\t  IteratorPrototype[iteratorSymbol] = function () {\\n\",\n       \"\\t    return this;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  var getProto = Object.getPrototypeOf;\\n\",\n       \"\\t  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\\n\",\n       \"\\t  if (NativeIteratorPrototype &&\\n\",\n       \"\\t      NativeIteratorPrototype !== Op &&\\n\",\n       \"\\t      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\\n\",\n       \"\\t    // This environment has a native %IteratorPrototype%; use it instead\\n\",\n       \"\\t    // of the polyfill.\\n\",\n       \"\\t    IteratorPrototype = NativeIteratorPrototype;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  var Gp = GeneratorFunctionPrototype.prototype =\\n\",\n       \"\\t    Generator.prototype = Object.create(IteratorPrototype);\\n\",\n       \"\\t  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\\n\",\n       \"\\t  GeneratorFunctionPrototype.constructor = GeneratorFunction;\\n\",\n       \"\\t  GeneratorFunctionPrototype[toStringTagSymbol] =\\n\",\n       \"\\t    GeneratorFunction.displayName = \\\"GeneratorFunction\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t  // Helper for defining the .next, .throw, and .return methods of the\\n\",\n       \"\\t  // Iterator interface in terms of a single ._invoke method.\\n\",\n       \"\\t  function defineIteratorMethods(prototype) {\\n\",\n       \"\\t    [\\\"next\\\", \\\"throw\\\", \\\"return\\\"].forEach(function(method) {\\n\",\n       \"\\t      prototype[method] = function(arg) {\\n\",\n       \"\\t        return this._invoke(method, arg);\\n\",\n       \"\\t      };\\n\",\n       \"\\t    });\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  runtime.isGeneratorFunction = function(genFun) {\\n\",\n       \"\\t    var ctor = typeof genFun === \\\"function\\\" && genFun.constructor;\\n\",\n       \"\\t    return ctor\\n\",\n       \"\\t      ? ctor === GeneratorFunction ||\\n\",\n       \"\\t        // For the native GeneratorFunction constructor, the best we can\\n\",\n       \"\\t        // do is to check its .name property.\\n\",\n       \"\\t        (ctor.displayName || ctor.name) === \\\"GeneratorFunction\\\"\\n\",\n       \"\\t      : false;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  runtime.mark = function(genFun) {\\n\",\n       \"\\t    if (Object.setPrototypeOf) {\\n\",\n       \"\\t      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      genFun.__proto__ = GeneratorFunctionPrototype;\\n\",\n       \"\\t      if (!(toStringTagSymbol in genFun)) {\\n\",\n       \"\\t        genFun[toStringTagSymbol] = \\\"GeneratorFunction\\\";\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t    genFun.prototype = Object.create(Gp);\\n\",\n       \"\\t    return genFun;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  // Within the body of any async function, `await x` is transformed to\\n\",\n       \"\\t  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\\n\",\n       \"\\t  // `hasOwn.call(value, \\\"__await\\\")` to determine if the yielded value is\\n\",\n       \"\\t  // meant to be awaited.\\n\",\n       \"\\t  runtime.awrap = function(arg) {\\n\",\n       \"\\t    return { __await: arg };\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  function AsyncIterator(generator) {\\n\",\n       \"\\t    function invoke(method, arg, resolve, reject) {\\n\",\n       \"\\t      var record = tryCatch(generator[method], generator, arg);\\n\",\n       \"\\t      if (record.type === \\\"throw\\\") {\\n\",\n       \"\\t        reject(record.arg);\\n\",\n       \"\\t      } else {\\n\",\n       \"\\t        var result = record.arg;\\n\",\n       \"\\t        var value = result.value;\\n\",\n       \"\\t        if (value &&\\n\",\n       \"\\t            typeof value === \\\"object\\\" &&\\n\",\n       \"\\t            hasOwn.call(value, \\\"__await\\\")) {\\n\",\n       \"\\t          return Promise.resolve(value.__await).then(function(value) {\\n\",\n       \"\\t            invoke(\\\"next\\\", value, resolve, reject);\\n\",\n       \"\\t          }, function(err) {\\n\",\n       \"\\t            invoke(\\\"throw\\\", err, resolve, reject);\\n\",\n       \"\\t          });\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        return Promise.resolve(value).then(function(unwrapped) {\\n\",\n       \"\\t          // When a yielded Promise is resolved, its final value becomes\\n\",\n       \"\\t          // the .value of the Promise<{value,done}> result for the\\n\",\n       \"\\t          // current iteration. If the Promise is rejected, however, the\\n\",\n       \"\\t          // result for this iteration will be rejected with the same\\n\",\n       \"\\t          // reason. Note that rejections of yielded Promises are not\\n\",\n       \"\\t          // thrown back into the generator function, as is the case\\n\",\n       \"\\t          // when an awaited Promise is rejected. This difference in\\n\",\n       \"\\t          // behavior between yield and await is important, because it\\n\",\n       \"\\t          // allows the consumer to decide what to do with the yielded\\n\",\n       \"\\t          // rejection (swallow it and continue, manually .throw it back\\n\",\n       \"\\t          // into the generator, abandon iteration, whatever). With\\n\",\n       \"\\t          // await, by contrast, there is no opportunity to examine the\\n\",\n       \"\\t          // rejection reason outside the generator function, so the\\n\",\n       \"\\t          // only option is to throw it from the await expression, and\\n\",\n       \"\\t          // let the generator function handle the exception.\\n\",\n       \"\\t          result.value = unwrapped;\\n\",\n       \"\\t          resolve(result);\\n\",\n       \"\\t        }, reject);\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    if (typeof global.process === \\\"object\\\" && global.process.domain) {\\n\",\n       \"\\t      invoke = global.process.domain.bind(invoke);\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    var previousPromise;\\n\",\n       \"\\t\\n\",\n       \"\\t    function enqueue(method, arg) {\\n\",\n       \"\\t      function callInvokeWithMethodAndArg() {\\n\",\n       \"\\t        return new Promise(function(resolve, reject) {\\n\",\n       \"\\t          invoke(method, arg, resolve, reject);\\n\",\n       \"\\t        });\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return previousPromise =\\n\",\n       \"\\t        // If enqueue has been called before, then we want to wait until\\n\",\n       \"\\t        // all previous Promises have been resolved before calling invoke,\\n\",\n       \"\\t        // so that results are always delivered in the correct order. If\\n\",\n       \"\\t        // enqueue has not been called before, then it is important to\\n\",\n       \"\\t        // call invoke immediately, without waiting on a callback to fire,\\n\",\n       \"\\t        // so that the async generator function has the opportunity to do\\n\",\n       \"\\t        // any necessary setup in a predictable way. This predictability\\n\",\n       \"\\t        // is why the Promise constructor synchronously invokes its\\n\",\n       \"\\t        // executor callback, and why async functions synchronously\\n\",\n       \"\\t        // execute code before the first await. Since we implement simple\\n\",\n       \"\\t        // async functions in terms of async generators, it is especially\\n\",\n       \"\\t        // important to get this right, even though it requires care.\\n\",\n       \"\\t        previousPromise ? previousPromise.then(\\n\",\n       \"\\t          callInvokeWithMethodAndArg,\\n\",\n       \"\\t          // Avoid propagating failures to Promises returned by later\\n\",\n       \"\\t          // invocations of the iterator.\\n\",\n       \"\\t          callInvokeWithMethodAndArg\\n\",\n       \"\\t        ) : callInvokeWithMethodAndArg();\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Define the unified helper method that is used to implement .next,\\n\",\n       \"\\t    // .throw, and .return (see defineIteratorMethods).\\n\",\n       \"\\t    this._invoke = enqueue;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  defineIteratorMethods(AsyncIterator.prototype);\\n\",\n       \"\\t  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\\n\",\n       \"\\t    return this;\\n\",\n       \"\\t  };\\n\",\n       \"\\t  runtime.AsyncIterator = AsyncIterator;\\n\",\n       \"\\t\\n\",\n       \"\\t  // Note that simple async functions are implemented on top of\\n\",\n       \"\\t  // AsyncIterator objects; they just return a Promise for the value of\\n\",\n       \"\\t  // the final result produced by the iterator.\\n\",\n       \"\\t  runtime.async = function(innerFn, outerFn, self, tryLocsList) {\\n\",\n       \"\\t    var iter = new AsyncIterator(\\n\",\n       \"\\t      wrap(innerFn, outerFn, self, tryLocsList)\\n\",\n       \"\\t    );\\n\",\n       \"\\t\\n\",\n       \"\\t    return runtime.isGeneratorFunction(outerFn)\\n\",\n       \"\\t      ? iter // If outerFn is a generator, return the full iterator.\\n\",\n       \"\\t      : iter.next().then(function(result) {\\n\",\n       \"\\t          return result.done ? result.value : iter.next();\\n\",\n       \"\\t        });\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  function makeInvokeMethod(innerFn, self, context) {\\n\",\n       \"\\t    var state = GenStateSuspendedStart;\\n\",\n       \"\\t\\n\",\n       \"\\t    return function invoke(method, arg) {\\n\",\n       \"\\t      if (state === GenStateExecuting) {\\n\",\n       \"\\t        throw new Error(\\\"Generator is already running\\\");\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (state === GenStateCompleted) {\\n\",\n       \"\\t        if (method === \\\"throw\\\") {\\n\",\n       \"\\t          throw arg;\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        // Be forgiving, per 25.3.3.3.3 of the spec:\\n\",\n       \"\\t        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\\n\",\n       \"\\t        return doneResult();\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      context.method = method;\\n\",\n       \"\\t      context.arg = arg;\\n\",\n       \"\\t\\n\",\n       \"\\t      while (true) {\\n\",\n       \"\\t        var delegate = context.delegate;\\n\",\n       \"\\t        if (delegate) {\\n\",\n       \"\\t          var delegateResult = maybeInvokeDelegate(delegate, context);\\n\",\n       \"\\t          if (delegateResult) {\\n\",\n       \"\\t            if (delegateResult === ContinueSentinel) continue;\\n\",\n       \"\\t            return delegateResult;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        if (context.method === \\\"next\\\") {\\n\",\n       \"\\t          // Setting context._sent for legacy support of Babel's\\n\",\n       \"\\t          // function.sent implementation.\\n\",\n       \"\\t          context.sent = context._sent = context.arg;\\n\",\n       \"\\t\\n\",\n       \"\\t        } else if (context.method === \\\"throw\\\") {\\n\",\n       \"\\t          if (state === GenStateSuspendedStart) {\\n\",\n       \"\\t            state = GenStateCompleted;\\n\",\n       \"\\t            throw context.arg;\\n\",\n       \"\\t          }\\n\",\n       \"\\t\\n\",\n       \"\\t          context.dispatchException(context.arg);\\n\",\n       \"\\t\\n\",\n       \"\\t        } else if (context.method === \\\"return\\\") {\\n\",\n       \"\\t          context.abrupt(\\\"return\\\", context.arg);\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        state = GenStateExecuting;\\n\",\n       \"\\t\\n\",\n       \"\\t        var record = tryCatch(innerFn, self, context);\\n\",\n       \"\\t        if (record.type === \\\"normal\\\") {\\n\",\n       \"\\t          // If an exception is thrown from innerFn, we leave state ===\\n\",\n       \"\\t          // GenStateExecuting and loop back for another invocation.\\n\",\n       \"\\t          state = context.done\\n\",\n       \"\\t            ? GenStateCompleted\\n\",\n       \"\\t            : GenStateSuspendedYield;\\n\",\n       \"\\t\\n\",\n       \"\\t          if (record.arg === ContinueSentinel) {\\n\",\n       \"\\t            continue;\\n\",\n       \"\\t          }\\n\",\n       \"\\t\\n\",\n       \"\\t          return {\\n\",\n       \"\\t            value: record.arg,\\n\",\n       \"\\t            done: context.done\\n\",\n       \"\\t          };\\n\",\n       \"\\t\\n\",\n       \"\\t        } else if (record.type === \\\"throw\\\") {\\n\",\n       \"\\t          state = GenStateCompleted;\\n\",\n       \"\\t          // Dispatch the exception by looping back around to the\\n\",\n       \"\\t          // context.dispatchException(context.arg) call above.\\n\",\n       \"\\t          context.method = \\\"throw\\\";\\n\",\n       \"\\t          context.arg = record.arg;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  // Call delegate.iterator[context.method](context.arg) and handle the\\n\",\n       \"\\t  // result, either by returning a { value, done } result from the\\n\",\n       \"\\t  // delegate iterator, or by modifying context.method and context.arg,\\n\",\n       \"\\t  // setting context.delegate to null, and returning the ContinueSentinel.\\n\",\n       \"\\t  function maybeInvokeDelegate(delegate, context) {\\n\",\n       \"\\t    var method = delegate.iterator[context.method];\\n\",\n       \"\\t    if (method === undefined) {\\n\",\n       \"\\t      // A .throw or .return when the delegate iterator has no .throw\\n\",\n       \"\\t      // method always terminates the yield* loop.\\n\",\n       \"\\t      context.delegate = null;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (context.method === \\\"throw\\\") {\\n\",\n       \"\\t        if (delegate.iterator.return) {\\n\",\n       \"\\t          // If the delegate iterator has a return method, give it a\\n\",\n       \"\\t          // chance to clean up.\\n\",\n       \"\\t          context.method = \\\"return\\\";\\n\",\n       \"\\t          context.arg = undefined;\\n\",\n       \"\\t          maybeInvokeDelegate(delegate, context);\\n\",\n       \"\\t\\n\",\n       \"\\t          if (context.method === \\\"throw\\\") {\\n\",\n       \"\\t            // If maybeInvokeDelegate(context) changed context.method from\\n\",\n       \"\\t            // \\\"return\\\" to \\\"throw\\\", let that override the TypeError below.\\n\",\n       \"\\t            return ContinueSentinel;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        context.method = \\\"throw\\\";\\n\",\n       \"\\t        context.arg = new TypeError(\\n\",\n       \"\\t          \\\"The iterator does not provide a 'throw' method\\\");\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return ContinueSentinel;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    var record = tryCatch(method, delegate.iterator, context.arg);\\n\",\n       \"\\t\\n\",\n       \"\\t    if (record.type === \\\"throw\\\") {\\n\",\n       \"\\t      context.method = \\\"throw\\\";\\n\",\n       \"\\t      context.arg = record.arg;\\n\",\n       \"\\t      context.delegate = null;\\n\",\n       \"\\t      return ContinueSentinel;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    var info = record.arg;\\n\",\n       \"\\t\\n\",\n       \"\\t    if (! info) {\\n\",\n       \"\\t      context.method = \\\"throw\\\";\\n\",\n       \"\\t      context.arg = new TypeError(\\\"iterator result is not an object\\\");\\n\",\n       \"\\t      context.delegate = null;\\n\",\n       \"\\t      return ContinueSentinel;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    if (info.done) {\\n\",\n       \"\\t      // Assign the result of the finished delegate to the temporary\\n\",\n       \"\\t      // variable specified by delegate.resultName (see delegateYield).\\n\",\n       \"\\t      context[delegate.resultName] = info.value;\\n\",\n       \"\\t\\n\",\n       \"\\t      // Resume execution at the desired location (see delegateYield).\\n\",\n       \"\\t      context.next = delegate.nextLoc;\\n\",\n       \"\\t\\n\",\n       \"\\t      // If context.method was \\\"throw\\\" but the delegate handled the\\n\",\n       \"\\t      // exception, let the outer generator proceed normally. If\\n\",\n       \"\\t      // context.method was \\\"next\\\", forget context.arg since it has been\\n\",\n       \"\\t      // \\\"consumed\\\" by the delegate iterator. If context.method was\\n\",\n       \"\\t      // \\\"return\\\", allow the original .return call to continue in the\\n\",\n       \"\\t      // outer generator.\\n\",\n       \"\\t      if (context.method !== \\\"return\\\") {\\n\",\n       \"\\t        context.method = \\\"next\\\";\\n\",\n       \"\\t        context.arg = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t    } else {\\n\",\n       \"\\t      // Re-yield the result returned by the delegate method.\\n\",\n       \"\\t      return info;\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // The delegate iterator is finished, so forget it and continue with\\n\",\n       \"\\t    // the outer generator.\\n\",\n       \"\\t    context.delegate = null;\\n\",\n       \"\\t    return ContinueSentinel;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  // Define Generator.prototype.{next,throw,return} in terms of the\\n\",\n       \"\\t  // unified ._invoke helper method.\\n\",\n       \"\\t  defineIteratorMethods(Gp);\\n\",\n       \"\\t\\n\",\n       \"\\t  Gp[toStringTagSymbol] = \\\"Generator\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t  // A Generator should always return itself as the iterator object when the\\n\",\n       \"\\t  // @@iterator function is called on it. Some browsers' implementations of the\\n\",\n       \"\\t  // iterator prototype chain incorrectly implement this, causing the Generator\\n\",\n       \"\\t  // object to not be returned from this call. This ensures that doesn't happen.\\n\",\n       \"\\t  // See https://github.com/facebook/regenerator/issues/274 for more details.\\n\",\n       \"\\t  Gp[iteratorSymbol] = function() {\\n\",\n       \"\\t    return this;\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  Gp.toString = function() {\\n\",\n       \"\\t    return \\\"[object Generator]\\\";\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  function pushTryEntry(locs) {\\n\",\n       \"\\t    var entry = { tryLoc: locs[0] };\\n\",\n       \"\\t\\n\",\n       \"\\t    if (1 in locs) {\\n\",\n       \"\\t      entry.catchLoc = locs[1];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    if (2 in locs) {\\n\",\n       \"\\t      entry.finallyLoc = locs[2];\\n\",\n       \"\\t      entry.afterLoc = locs[3];\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    this.tryEntries.push(entry);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  function resetTryEntry(entry) {\\n\",\n       \"\\t    var record = entry.completion || {};\\n\",\n       \"\\t    record.type = \\\"normal\\\";\\n\",\n       \"\\t    delete record.arg;\\n\",\n       \"\\t    entry.completion = record;\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  function Context(tryLocsList) {\\n\",\n       \"\\t    // The root entry object (effectively a try statement without a catch\\n\",\n       \"\\t    // or a finally block) gives us a place to store values thrown from\\n\",\n       \"\\t    // locations where there is no enclosing try statement.\\n\",\n       \"\\t    this.tryEntries = [{ tryLoc: \\\"root\\\" }];\\n\",\n       \"\\t    tryLocsList.forEach(pushTryEntry, this);\\n\",\n       \"\\t    this.reset(true);\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  runtime.keys = function(object) {\\n\",\n       \"\\t    var keys = [];\\n\",\n       \"\\t    for (var key in object) {\\n\",\n       \"\\t      keys.push(key);\\n\",\n       \"\\t    }\\n\",\n       \"\\t    keys.reverse();\\n\",\n       \"\\t\\n\",\n       \"\\t    // Rather than returning an object with a next method, we keep\\n\",\n       \"\\t    // things simple and return the next function itself.\\n\",\n       \"\\t    return function next() {\\n\",\n       \"\\t      while (keys.length) {\\n\",\n       \"\\t        var key = keys.pop();\\n\",\n       \"\\t        if (key in object) {\\n\",\n       \"\\t          next.value = key;\\n\",\n       \"\\t          next.done = false;\\n\",\n       \"\\t          return next;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      // To avoid creating an additional object, we just hang the .value\\n\",\n       \"\\t      // and .done properties off the next function object itself. This\\n\",\n       \"\\t      // also ensures that the minifier will not anonymize the function.\\n\",\n       \"\\t      next.done = true;\\n\",\n       \"\\t      return next;\\n\",\n       \"\\t    };\\n\",\n       \"\\t  };\\n\",\n       \"\\t\\n\",\n       \"\\t  function values(iterable) {\\n\",\n       \"\\t    if (iterable) {\\n\",\n       \"\\t      var iteratorMethod = iterable[iteratorSymbol];\\n\",\n       \"\\t      if (iteratorMethod) {\\n\",\n       \"\\t        return iteratorMethod.call(iterable);\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (typeof iterable.next === \\\"function\\\") {\\n\",\n       \"\\t        return iterable;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!isNaN(iterable.length)) {\\n\",\n       \"\\t        var i = -1, next = function next() {\\n\",\n       \"\\t          while (++i < iterable.length) {\\n\",\n       \"\\t            if (hasOwn.call(iterable, i)) {\\n\",\n       \"\\t              next.value = iterable[i];\\n\",\n       \"\\t              next.done = false;\\n\",\n       \"\\t              return next;\\n\",\n       \"\\t            }\\n\",\n       \"\\t          }\\n\",\n       \"\\t\\n\",\n       \"\\t          next.value = undefined;\\n\",\n       \"\\t          next.done = true;\\n\",\n       \"\\t\\n\",\n       \"\\t          return next;\\n\",\n       \"\\t        };\\n\",\n       \"\\t\\n\",\n       \"\\t        return next.next = next;\\n\",\n       \"\\t      }\\n\",\n       \"\\t    }\\n\",\n       \"\\t\\n\",\n       \"\\t    // Return an iterator with no values.\\n\",\n       \"\\t    return { next: doneResult };\\n\",\n       \"\\t  }\\n\",\n       \"\\t  runtime.values = values;\\n\",\n       \"\\t\\n\",\n       \"\\t  function doneResult() {\\n\",\n       \"\\t    return { value: undefined, done: true };\\n\",\n       \"\\t  }\\n\",\n       \"\\t\\n\",\n       \"\\t  Context.prototype = {\\n\",\n       \"\\t    constructor: Context,\\n\",\n       \"\\t\\n\",\n       \"\\t    reset: function(skipTempReset) {\\n\",\n       \"\\t      this.prev = 0;\\n\",\n       \"\\t      this.next = 0;\\n\",\n       \"\\t      // Resetting context._sent for legacy support of Babel's\\n\",\n       \"\\t      // function.sent implementation.\\n\",\n       \"\\t      this.sent = this._sent = undefined;\\n\",\n       \"\\t      this.done = false;\\n\",\n       \"\\t      this.delegate = null;\\n\",\n       \"\\t\\n\",\n       \"\\t      this.method = \\\"next\\\";\\n\",\n       \"\\t      this.arg = undefined;\\n\",\n       \"\\t\\n\",\n       \"\\t      this.tryEntries.forEach(resetTryEntry);\\n\",\n       \"\\t\\n\",\n       \"\\t      if (!skipTempReset) {\\n\",\n       \"\\t        for (var name in this) {\\n\",\n       \"\\t          // Not sure about the optimal order of these conditions:\\n\",\n       \"\\t          if (name.charAt(0) === \\\"t\\\" &&\\n\",\n       \"\\t              hasOwn.call(this, name) &&\\n\",\n       \"\\t              !isNaN(+name.slice(1))) {\\n\",\n       \"\\t            this[name] = undefined;\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    stop: function() {\\n\",\n       \"\\t      this.done = true;\\n\",\n       \"\\t\\n\",\n       \"\\t      var rootEntry = this.tryEntries[0];\\n\",\n       \"\\t      var rootRecord = rootEntry.completion;\\n\",\n       \"\\t      if (rootRecord.type === \\\"throw\\\") {\\n\",\n       \"\\t        throw rootRecord.arg;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return this.rval;\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    dispatchException: function(exception) {\\n\",\n       \"\\t      if (this.done) {\\n\",\n       \"\\t        throw exception;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      var context = this;\\n\",\n       \"\\t      function handle(loc, caught) {\\n\",\n       \"\\t        record.type = \\\"throw\\\";\\n\",\n       \"\\t        record.arg = exception;\\n\",\n       \"\\t        context.next = loc;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (caught) {\\n\",\n       \"\\t          // If the dispatched exception was caught by a catch block,\\n\",\n       \"\\t          // then let that catch block handle the exception normally.\\n\",\n       \"\\t          context.method = \\\"next\\\";\\n\",\n       \"\\t          context.arg = undefined;\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        return !! caught;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\\n\",\n       \"\\t        var entry = this.tryEntries[i];\\n\",\n       \"\\t        var record = entry.completion;\\n\",\n       \"\\t\\n\",\n       \"\\t        if (entry.tryLoc === \\\"root\\\") {\\n\",\n       \"\\t          // Exception thrown outside of any try block that could handle\\n\",\n       \"\\t          // it, so set the completion value of the entire function to\\n\",\n       \"\\t          // throw the exception.\\n\",\n       \"\\t          return handle(\\\"end\\\");\\n\",\n       \"\\t        }\\n\",\n       \"\\t\\n\",\n       \"\\t        if (entry.tryLoc <= this.prev) {\\n\",\n       \"\\t          var hasCatch = hasOwn.call(entry, \\\"catchLoc\\\");\\n\",\n       \"\\t          var hasFinally = hasOwn.call(entry, \\\"finallyLoc\\\");\\n\",\n       \"\\t\\n\",\n       \"\\t          if (hasCatch && hasFinally) {\\n\",\n       \"\\t            if (this.prev < entry.catchLoc) {\\n\",\n       \"\\t              return handle(entry.catchLoc, true);\\n\",\n       \"\\t            } else if (this.prev < entry.finallyLoc) {\\n\",\n       \"\\t              return handle(entry.finallyLoc);\\n\",\n       \"\\t            }\\n\",\n       \"\\t\\n\",\n       \"\\t          } else if (hasCatch) {\\n\",\n       \"\\t            if (this.prev < entry.catchLoc) {\\n\",\n       \"\\t              return handle(entry.catchLoc, true);\\n\",\n       \"\\t            }\\n\",\n       \"\\t\\n\",\n       \"\\t          } else if (hasFinally) {\\n\",\n       \"\\t            if (this.prev < entry.finallyLoc) {\\n\",\n       \"\\t              return handle(entry.finallyLoc);\\n\",\n       \"\\t            }\\n\",\n       \"\\t\\n\",\n       \"\\t          } else {\\n\",\n       \"\\t            throw new Error(\\\"try statement without catch or finally\\\");\\n\",\n       \"\\t          }\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    abrupt: function(type, arg) {\\n\",\n       \"\\t      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\\n\",\n       \"\\t        var entry = this.tryEntries[i];\\n\",\n       \"\\t        if (entry.tryLoc <= this.prev &&\\n\",\n       \"\\t            hasOwn.call(entry, \\\"finallyLoc\\\") &&\\n\",\n       \"\\t            this.prev < entry.finallyLoc) {\\n\",\n       \"\\t          var finallyEntry = entry;\\n\",\n       \"\\t          break;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (finallyEntry &&\\n\",\n       \"\\t          (type === \\\"break\\\" ||\\n\",\n       \"\\t           type === \\\"continue\\\") &&\\n\",\n       \"\\t          finallyEntry.tryLoc <= arg &&\\n\",\n       \"\\t          arg <= finallyEntry.finallyLoc) {\\n\",\n       \"\\t        // Ignore the finally entry if control is not jumping to a\\n\",\n       \"\\t        // location outside the try/catch block.\\n\",\n       \"\\t        finallyEntry = null;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      var record = finallyEntry ? finallyEntry.completion : {};\\n\",\n       \"\\t      record.type = type;\\n\",\n       \"\\t      record.arg = arg;\\n\",\n       \"\\t\\n\",\n       \"\\t      if (finallyEntry) {\\n\",\n       \"\\t        this.method = \\\"next\\\";\\n\",\n       \"\\t        this.next = finallyEntry.finallyLoc;\\n\",\n       \"\\t        return ContinueSentinel;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return this.complete(record);\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    complete: function(record, afterLoc) {\\n\",\n       \"\\t      if (record.type === \\\"throw\\\") {\\n\",\n       \"\\t        throw record.arg;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      if (record.type === \\\"break\\\" ||\\n\",\n       \"\\t          record.type === \\\"continue\\\") {\\n\",\n       \"\\t        this.next = record.arg;\\n\",\n       \"\\t      } else if (record.type === \\\"return\\\") {\\n\",\n       \"\\t        this.rval = this.arg = record.arg;\\n\",\n       \"\\t        this.method = \\\"return\\\";\\n\",\n       \"\\t        this.next = \\\"end\\\";\\n\",\n       \"\\t      } else if (record.type === \\\"normal\\\" && afterLoc) {\\n\",\n       \"\\t        this.next = afterLoc;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return ContinueSentinel;\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    finish: function(finallyLoc) {\\n\",\n       \"\\t      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\\n\",\n       \"\\t        var entry = this.tryEntries[i];\\n\",\n       \"\\t        if (entry.finallyLoc === finallyLoc) {\\n\",\n       \"\\t          this.complete(entry.completion, entry.afterLoc);\\n\",\n       \"\\t          resetTryEntry(entry);\\n\",\n       \"\\t          return ContinueSentinel;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    \\\"catch\\\": function(tryLoc) {\\n\",\n       \"\\t      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\\n\",\n       \"\\t        var entry = this.tryEntries[i];\\n\",\n       \"\\t        if (entry.tryLoc === tryLoc) {\\n\",\n       \"\\t          var record = entry.completion;\\n\",\n       \"\\t          if (record.type === \\\"throw\\\") {\\n\",\n       \"\\t            var thrown = record.arg;\\n\",\n       \"\\t            resetTryEntry(entry);\\n\",\n       \"\\t          }\\n\",\n       \"\\t          return thrown;\\n\",\n       \"\\t        }\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      // The context.catch method must only be called with a location\\n\",\n       \"\\t      // argument that corresponds to a known catch block.\\n\",\n       \"\\t      throw new Error(\\\"illegal catch attempt\\\");\\n\",\n       \"\\t    },\\n\",\n       \"\\t\\n\",\n       \"\\t    delegateYield: function(iterable, resultName, nextLoc) {\\n\",\n       \"\\t      this.delegate = {\\n\",\n       \"\\t        iterator: values(iterable),\\n\",\n       \"\\t        resultName: resultName,\\n\",\n       \"\\t        nextLoc: nextLoc\\n\",\n       \"\\t      };\\n\",\n       \"\\t\\n\",\n       \"\\t      if (this.method === \\\"next\\\") {\\n\",\n       \"\\t        // Deliberately forget the last sent value so that we don't\\n\",\n       \"\\t        // accidentally pass it on to the delegate.\\n\",\n       \"\\t        this.arg = undefined;\\n\",\n       \"\\t      }\\n\",\n       \"\\t\\n\",\n       \"\\t      return ContinueSentinel;\\n\",\n       \"\\t    }\\n\",\n       \"\\t  };\\n\",\n       \"\\t})(\\n\",\n       \"\\t  // Among the various tricks for obtaining a reference to the global\\n\",\n       \"\\t  // object, this seems to be the most reliable technique that does not\\n\",\n       \"\\t  // use indirect eval (which violates Content Security Policy).\\n\",\n       \"\\t  typeof global === \\\"object\\\" ? global :\\n\",\n       \"\\t  typeof window === \\\"object\\\" ? window :\\n\",\n       \"\\t  typeof self === \\\"object\\\" ? self : this\\n\",\n       \"\\t);\\n\",\n       \"\\t\\n\",\n       \"\\t/* WEBPACK VAR INJECTION */}.call(exports, (function() { return this; }())))\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 336 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t__webpack_require__(337);\\n\",\n       \"\\tmodule.exports = __webpack_require__(16).RegExp.escape;\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 337 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// https://github.com/benjamingr/RexExp.escape\\n\",\n       \"\\tvar $export = __webpack_require__(15);\\n\",\n       \"\\tvar $re = __webpack_require__(338)(/[\\\\\\\\^$*+?.()|[\\\\]{}]/g, '\\\\\\\\$&');\\n\",\n       \"\\t\\n\",\n       \"\\t$export($export.S, 'RegExp', { escape: function escape(it) { return $re(it); } });\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 338 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\tmodule.exports = function (regExp, replace) {\\n\",\n       \"\\t  var replacer = replace === Object(replace) ? function (part) {\\n\",\n       \"\\t    return replace[part];\\n\",\n       \"\\t  } : replace;\\n\",\n       \"\\t  return function (it) {\\n\",\n       \"\\t    return String(it).replace(regExp, replacer);\\n\",\n       \"\\t  };\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 339 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t// style-loader: Adds some css to the DOM by adding a <style> tag\\n\",\n       \"\\t\\n\",\n       \"\\t// load the styles\\n\",\n       \"\\tvar content = __webpack_require__(340);\\n\",\n       \"\\tif(typeof content === 'string') content = [[module.id, content, '']];\\n\",\n       \"\\t// add the styles to the DOM\\n\",\n       \"\\tvar update = __webpack_require__(342)(content, {});\\n\",\n       \"\\tif(content.locals) module.exports = content.locals;\\n\",\n       \"\\t// Hot Module Replacement\\n\",\n       \"\\tif(false) {\\n\",\n       \"\\t\\t// When the styles change, update the <style> tags\\n\",\n       \"\\t\\tif(!content.locals) {\\n\",\n       \"\\t\\t\\tmodule.hot.accept(\\\"!!./node_modules/css-loader/index.js!./style.css\\\", function() {\\n\",\n       \"\\t\\t\\t\\tvar newContent = require(\\\"!!./node_modules/css-loader/index.js!./style.css\\\");\\n\",\n       \"\\t\\t\\t\\tif(typeof newContent === 'string') newContent = [[module.id, newContent, '']];\\n\",\n       \"\\t\\t\\t\\tupdate(newContent);\\n\",\n       \"\\t\\t\\t});\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\t// When the module is disposed, remove the <style> tags\\n\",\n       \"\\t\\tmodule.hot.dispose(function() { update(); });\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 340 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\texports = module.exports = __webpack_require__(341)();\\n\",\n       \"\\t// imports\\n\",\n       \"\\t\\n\",\n       \"\\t\\n\",\n       \"\\t// module\\n\",\n       \"\\texports.push([module.id, \\\".lime {\\\\n  all: initial;\\\\n}\\\\n.lime.top_div {\\\\n  display: flex;\\\\n  flex-wrap: wrap;\\\\n}\\\\n.lime.predict_proba {\\\\n  width: 245px;\\\\n}\\\\n.lime.predicted_value {\\\\n  width: 245px;\\\\n}\\\\n.lime.explanation {\\\\n  width: 350px;\\\\n}\\\\n\\\\n.lime.text_div {\\\\n  max-height:300px;\\\\n  flex: 1 0 300px;\\\\n  overflow:scroll;\\\\n}\\\\n.lime.table_div {\\\\n  max-height:300px;\\\\n  flex: 1 0 300px;\\\\n  overflow:scroll;\\\\n}\\\\n.lime.table_div table {\\\\n  border-collapse: collapse;\\\\n  color: white;\\\\n  border-style: hidden;\\\\n  margin: 0 auto;\\\\n}\\\\n\\\", \\\"\\\"]);\\n\",\n       \"\\t\\n\",\n       \"\\t// exports\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 341 */\\n\",\n       \"/***/ (function(module, exports) {\\n\",\n       \"\\n\",\n       \"\\t/*\\n\",\n       \"\\t\\tMIT License http://www.opensource.org/licenses/mit-license.php\\n\",\n       \"\\t\\tAuthor Tobias Koppers @sokra\\n\",\n       \"\\t*/\\n\",\n       \"\\t// css base code, injected by the css-loader\\n\",\n       \"\\tmodule.exports = function() {\\n\",\n       \"\\t\\tvar list = [];\\n\",\n       \"\\t\\n\",\n       \"\\t\\t// return the list of modules as css string\\n\",\n       \"\\t\\tlist.toString = function toString() {\\n\",\n       \"\\t\\t\\tvar result = [];\\n\",\n       \"\\t\\t\\tfor(var i = 0; i < this.length; i++) {\\n\",\n       \"\\t\\t\\t\\tvar item = this[i];\\n\",\n       \"\\t\\t\\t\\tif(item[2]) {\\n\",\n       \"\\t\\t\\t\\t\\tresult.push(\\\"@media \\\" + item[2] + \\\"{\\\" + item[1] + \\\"}\\\");\\n\",\n       \"\\t\\t\\t\\t} else {\\n\",\n       \"\\t\\t\\t\\t\\tresult.push(item[1]);\\n\",\n       \"\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t\\treturn result.join(\\\"\\\");\\n\",\n       \"\\t\\t};\\n\",\n       \"\\t\\n\",\n       \"\\t\\t// import a list of modules into the list\\n\",\n       \"\\t\\tlist.i = function(modules, mediaQuery) {\\n\",\n       \"\\t\\t\\tif(typeof modules === \\\"string\\\")\\n\",\n       \"\\t\\t\\t\\tmodules = [[null, modules, \\\"\\\"]];\\n\",\n       \"\\t\\t\\tvar alreadyImportedModules = {};\\n\",\n       \"\\t\\t\\tfor(var i = 0; i < this.length; i++) {\\n\",\n       \"\\t\\t\\t\\tvar id = this[i][0];\\n\",\n       \"\\t\\t\\t\\tif(typeof id === \\\"number\\\")\\n\",\n       \"\\t\\t\\t\\t\\talreadyImportedModules[id] = true;\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t\\tfor(i = 0; i < modules.length; i++) {\\n\",\n       \"\\t\\t\\t\\tvar item = modules[i];\\n\",\n       \"\\t\\t\\t\\t// skip already imported module\\n\",\n       \"\\t\\t\\t\\t// this implementation is not 100% perfect for weird media query combinations\\n\",\n       \"\\t\\t\\t\\t//  when a module is imported multiple times with different media queries.\\n\",\n       \"\\t\\t\\t\\t//  I hope this will never occur (Hey this way we have smaller bundles)\\n\",\n       \"\\t\\t\\t\\tif(typeof item[0] !== \\\"number\\\" || !alreadyImportedModules[item[0]]) {\\n\",\n       \"\\t\\t\\t\\t\\tif(mediaQuery && !item[2]) {\\n\",\n       \"\\t\\t\\t\\t\\t\\titem[2] = mediaQuery;\\n\",\n       \"\\t\\t\\t\\t\\t} else if(mediaQuery) {\\n\",\n       \"\\t\\t\\t\\t\\t\\titem[2] = \\\"(\\\" + item[2] + \\\") and (\\\" + mediaQuery + \\\")\\\";\\n\",\n       \"\\t\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t\\t\\tlist.push(item);\\n\",\n       \"\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t};\\n\",\n       \"\\t\\treturn list;\\n\",\n       \"\\t};\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ }),\\n\",\n       \"/* 342 */\\n\",\n       \"/***/ (function(module, exports, __webpack_require__) {\\n\",\n       \"\\n\",\n       \"\\t/*\\n\",\n       \"\\t\\tMIT License http://www.opensource.org/licenses/mit-license.php\\n\",\n       \"\\t\\tAuthor Tobias Koppers @sokra\\n\",\n       \"\\t*/\\n\",\n       \"\\tvar stylesInDom = {},\\n\",\n       \"\\t\\tmemoize = function(fn) {\\n\",\n       \"\\t\\t\\tvar memo;\\n\",\n       \"\\t\\t\\treturn function () {\\n\",\n       \"\\t\\t\\t\\tif (typeof memo === \\\"undefined\\\") memo = fn.apply(this, arguments);\\n\",\n       \"\\t\\t\\t\\treturn memo;\\n\",\n       \"\\t\\t\\t};\\n\",\n       \"\\t\\t},\\n\",\n       \"\\t\\tisOldIE = memoize(function() {\\n\",\n       \"\\t\\t\\treturn /msie [6-9]\\\\b/.test(self.navigator.userAgent.toLowerCase());\\n\",\n       \"\\t\\t}),\\n\",\n       \"\\t\\tgetHeadElement = memoize(function () {\\n\",\n       \"\\t\\t\\treturn document.head || document.getElementsByTagName(\\\"head\\\")[0];\\n\",\n       \"\\t\\t}),\\n\",\n       \"\\t\\tsingletonElement = null,\\n\",\n       \"\\t\\tsingletonCounter = 0,\\n\",\n       \"\\t\\tstyleElementsInsertedAtTop = [];\\n\",\n       \"\\t\\n\",\n       \"\\tmodule.exports = function(list, options) {\\n\",\n       \"\\t\\tif(false) {\\n\",\n       \"\\t\\t\\tif(typeof document !== \\\"object\\\") throw new Error(\\\"The style-loader cannot be used in a non-browser environment\\\");\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t\\toptions = options || {};\\n\",\n       \"\\t\\t// Force single-tag solution on IE6-9, which has a hard limit on the # of <style>\\n\",\n       \"\\t\\t// tags it will allow on a page\\n\",\n       \"\\t\\tif (typeof options.singleton === \\\"undefined\\\") options.singleton = isOldIE();\\n\",\n       \"\\t\\n\",\n       \"\\t\\t// By default, add <style> tags to the bottom of <head>.\\n\",\n       \"\\t\\tif (typeof options.insertAt === \\\"undefined\\\") options.insertAt = \\\"bottom\\\";\\n\",\n       \"\\t\\n\",\n       \"\\t\\tvar styles = listToStyles(list);\\n\",\n       \"\\t\\taddStylesToDom(styles, options);\\n\",\n       \"\\t\\n\",\n       \"\\t\\treturn function update(newList) {\\n\",\n       \"\\t\\t\\tvar mayRemove = [];\\n\",\n       \"\\t\\t\\tfor(var i = 0; i < styles.length; i++) {\\n\",\n       \"\\t\\t\\t\\tvar item = styles[i];\\n\",\n       \"\\t\\t\\t\\tvar domStyle = stylesInDom[item.id];\\n\",\n       \"\\t\\t\\t\\tdomStyle.refs--;\\n\",\n       \"\\t\\t\\t\\tmayRemove.push(domStyle);\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t\\tif(newList) {\\n\",\n       \"\\t\\t\\t\\tvar newStyles = listToStyles(newList);\\n\",\n       \"\\t\\t\\t\\taddStylesToDom(newStyles, options);\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t\\tfor(var i = 0; i < mayRemove.length; i++) {\\n\",\n       \"\\t\\t\\t\\tvar domStyle = mayRemove[i];\\n\",\n       \"\\t\\t\\t\\tif(domStyle.refs === 0) {\\n\",\n       \"\\t\\t\\t\\t\\tfor(var j = 0; j < domStyle.parts.length; j++)\\n\",\n       \"\\t\\t\\t\\t\\t\\tdomStyle.parts[j]();\\n\",\n       \"\\t\\t\\t\\t\\tdelete stylesInDom[domStyle.id];\\n\",\n       \"\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t};\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction addStylesToDom(styles, options) {\\n\",\n       \"\\t\\tfor(var i = 0; i < styles.length; i++) {\\n\",\n       \"\\t\\t\\tvar item = styles[i];\\n\",\n       \"\\t\\t\\tvar domStyle = stylesInDom[item.id];\\n\",\n       \"\\t\\t\\tif(domStyle) {\\n\",\n       \"\\t\\t\\t\\tdomStyle.refs++;\\n\",\n       \"\\t\\t\\t\\tfor(var j = 0; j < domStyle.parts.length; j++) {\\n\",\n       \"\\t\\t\\t\\t\\tdomStyle.parts[j](item.parts[j]);\\n\",\n       \"\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t\\tfor(; j < item.parts.length; j++) {\\n\",\n       \"\\t\\t\\t\\t\\tdomStyle.parts.push(addStyle(item.parts[j], options));\\n\",\n       \"\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t} else {\\n\",\n       \"\\t\\t\\t\\tvar parts = [];\\n\",\n       \"\\t\\t\\t\\tfor(var j = 0; j < item.parts.length; j++) {\\n\",\n       \"\\t\\t\\t\\t\\tparts.push(addStyle(item.parts[j], options));\\n\",\n       \"\\t\\t\\t\\t}\\n\",\n       \"\\t\\t\\t\\tstylesInDom[item.id] = {id: item.id, refs: 1, parts: parts};\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction listToStyles(list) {\\n\",\n       \"\\t\\tvar styles = [];\\n\",\n       \"\\t\\tvar newStyles = {};\\n\",\n       \"\\t\\tfor(var i = 0; i < list.length; i++) {\\n\",\n       \"\\t\\t\\tvar item = list[i];\\n\",\n       \"\\t\\t\\tvar id = item[0];\\n\",\n       \"\\t\\t\\tvar css = item[1];\\n\",\n       \"\\t\\t\\tvar media = item[2];\\n\",\n       \"\\t\\t\\tvar sourceMap = item[3];\\n\",\n       \"\\t\\t\\tvar part = {css: css, media: media, sourceMap: sourceMap};\\n\",\n       \"\\t\\t\\tif(!newStyles[id])\\n\",\n       \"\\t\\t\\t\\tstyles.push(newStyles[id] = {id: id, parts: [part]});\\n\",\n       \"\\t\\t\\telse\\n\",\n       \"\\t\\t\\t\\tnewStyles[id].parts.push(part);\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\treturn styles;\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction insertStyleElement(options, styleElement) {\\n\",\n       \"\\t\\tvar head = getHeadElement();\\n\",\n       \"\\t\\tvar lastStyleElementInsertedAtTop = styleElementsInsertedAtTop[styleElementsInsertedAtTop.length - 1];\\n\",\n       \"\\t\\tif (options.insertAt === \\\"top\\\") {\\n\",\n       \"\\t\\t\\tif(!lastStyleElementInsertedAtTop) {\\n\",\n       \"\\t\\t\\t\\thead.insertBefore(styleElement, head.firstChild);\\n\",\n       \"\\t\\t\\t} else if(lastStyleElementInsertedAtTop.nextSibling) {\\n\",\n       \"\\t\\t\\t\\thead.insertBefore(styleElement, lastStyleElementInsertedAtTop.nextSibling);\\n\",\n       \"\\t\\t\\t} else {\\n\",\n       \"\\t\\t\\t\\thead.appendChild(styleElement);\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t\\tstyleElementsInsertedAtTop.push(styleElement);\\n\",\n       \"\\t\\t} else if (options.insertAt === \\\"bottom\\\") {\\n\",\n       \"\\t\\t\\thead.appendChild(styleElement);\\n\",\n       \"\\t\\t} else {\\n\",\n       \"\\t\\t\\tthrow new Error(\\\"Invalid value for parameter 'insertAt'. Must be 'top' or 'bottom'.\\\");\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction removeStyleElement(styleElement) {\\n\",\n       \"\\t\\tstyleElement.parentNode.removeChild(styleElement);\\n\",\n       \"\\t\\tvar idx = styleElementsInsertedAtTop.indexOf(styleElement);\\n\",\n       \"\\t\\tif(idx >= 0) {\\n\",\n       \"\\t\\t\\tstyleElementsInsertedAtTop.splice(idx, 1);\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction createStyleElement(options) {\\n\",\n       \"\\t\\tvar styleElement = document.createElement(\\\"style\\\");\\n\",\n       \"\\t\\tstyleElement.type = \\\"text/css\\\";\\n\",\n       \"\\t\\tinsertStyleElement(options, styleElement);\\n\",\n       \"\\t\\treturn styleElement;\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction createLinkElement(options) {\\n\",\n       \"\\t\\tvar linkElement = document.createElement(\\\"link\\\");\\n\",\n       \"\\t\\tlinkElement.rel = \\\"stylesheet\\\";\\n\",\n       \"\\t\\tinsertStyleElement(options, linkElement);\\n\",\n       \"\\t\\treturn linkElement;\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction addStyle(obj, options) {\\n\",\n       \"\\t\\tvar styleElement, update, remove;\\n\",\n       \"\\t\\n\",\n       \"\\t\\tif (options.singleton) {\\n\",\n       \"\\t\\t\\tvar styleIndex = singletonCounter++;\\n\",\n       \"\\t\\t\\tstyleElement = singletonElement || (singletonElement = createStyleElement(options));\\n\",\n       \"\\t\\t\\tupdate = applyToSingletonTag.bind(null, styleElement, styleIndex, false);\\n\",\n       \"\\t\\t\\tremove = applyToSingletonTag.bind(null, styleElement, styleIndex, true);\\n\",\n       \"\\t\\t} else if(obj.sourceMap &&\\n\",\n       \"\\t\\t\\ttypeof URL === \\\"function\\\" &&\\n\",\n       \"\\t\\t\\ttypeof URL.createObjectURL === \\\"function\\\" &&\\n\",\n       \"\\t\\t\\ttypeof URL.revokeObjectURL === \\\"function\\\" &&\\n\",\n       \"\\t\\t\\ttypeof Blob === \\\"function\\\" &&\\n\",\n       \"\\t\\t\\ttypeof btoa === \\\"function\\\") {\\n\",\n       \"\\t\\t\\tstyleElement = createLinkElement(options);\\n\",\n       \"\\t\\t\\tupdate = updateLink.bind(null, styleElement);\\n\",\n       \"\\t\\t\\tremove = function() {\\n\",\n       \"\\t\\t\\t\\tremoveStyleElement(styleElement);\\n\",\n       \"\\t\\t\\t\\tif(styleElement.href)\\n\",\n       \"\\t\\t\\t\\t\\tURL.revokeObjectURL(styleElement.href);\\n\",\n       \"\\t\\t\\t};\\n\",\n       \"\\t\\t} else {\\n\",\n       \"\\t\\t\\tstyleElement = createStyleElement(options);\\n\",\n       \"\\t\\t\\tupdate = applyToTag.bind(null, styleElement);\\n\",\n       \"\\t\\t\\tremove = function() {\\n\",\n       \"\\t\\t\\t\\tremoveStyleElement(styleElement);\\n\",\n       \"\\t\\t\\t};\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t\\tupdate(obj);\\n\",\n       \"\\t\\n\",\n       \"\\t\\treturn function updateStyle(newObj) {\\n\",\n       \"\\t\\t\\tif(newObj) {\\n\",\n       \"\\t\\t\\t\\tif(newObj.css === obj.css && newObj.media === obj.media && newObj.sourceMap === obj.sourceMap)\\n\",\n       \"\\t\\t\\t\\t\\treturn;\\n\",\n       \"\\t\\t\\t\\tupdate(obj = newObj);\\n\",\n       \"\\t\\t\\t} else {\\n\",\n       \"\\t\\t\\t\\tremove();\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t};\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tvar replaceText = (function () {\\n\",\n       \"\\t\\tvar textStore = [];\\n\",\n       \"\\t\\n\",\n       \"\\t\\treturn function (index, replacement) {\\n\",\n       \"\\t\\t\\ttextStore[index] = replacement;\\n\",\n       \"\\t\\t\\treturn textStore.filter(Boolean).join('\\\\n');\\n\",\n       \"\\t\\t};\\n\",\n       \"\\t})();\\n\",\n       \"\\t\\n\",\n       \"\\tfunction applyToSingletonTag(styleElement, index, remove, obj) {\\n\",\n       \"\\t\\tvar css = remove ? \\\"\\\" : obj.css;\\n\",\n       \"\\t\\n\",\n       \"\\t\\tif (styleElement.styleSheet) {\\n\",\n       \"\\t\\t\\tstyleElement.styleSheet.cssText = replaceText(index, css);\\n\",\n       \"\\t\\t} else {\\n\",\n       \"\\t\\t\\tvar cssNode = document.createTextNode(css);\\n\",\n       \"\\t\\t\\tvar childNodes = styleElement.childNodes;\\n\",\n       \"\\t\\t\\tif (childNodes[index]) styleElement.removeChild(childNodes[index]);\\n\",\n       \"\\t\\t\\tif (childNodes.length) {\\n\",\n       \"\\t\\t\\t\\tstyleElement.insertBefore(cssNode, childNodes[index]);\\n\",\n       \"\\t\\t\\t} else {\\n\",\n       \"\\t\\t\\t\\tstyleElement.appendChild(cssNode);\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction applyToTag(styleElement, obj) {\\n\",\n       \"\\t\\tvar css = obj.css;\\n\",\n       \"\\t\\tvar media = obj.media;\\n\",\n       \"\\t\\n\",\n       \"\\t\\tif(media) {\\n\",\n       \"\\t\\t\\tstyleElement.setAttribute(\\\"media\\\", media)\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t\\tif(styleElement.styleSheet) {\\n\",\n       \"\\t\\t\\tstyleElement.styleSheet.cssText = css;\\n\",\n       \"\\t\\t} else {\\n\",\n       \"\\t\\t\\twhile(styleElement.firstChild) {\\n\",\n       \"\\t\\t\\t\\tstyleElement.removeChild(styleElement.firstChild);\\n\",\n       \"\\t\\t\\t}\\n\",\n       \"\\t\\t\\tstyleElement.appendChild(document.createTextNode(css));\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t}\\n\",\n       \"\\t\\n\",\n       \"\\tfunction updateLink(linkElement, obj) {\\n\",\n       \"\\t\\tvar css = obj.css;\\n\",\n       \"\\t\\tvar sourceMap = obj.sourceMap;\\n\",\n       \"\\t\\n\",\n       \"\\t\\tif(sourceMap) {\\n\",\n       \"\\t\\t\\t// http://stackoverflow.com/a/26603875\\n\",\n       \"\\t\\t\\tcss += \\\"\\\\n/*# sourceMappingURL=data:application/json;base64,\\\" + btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap)))) + \\\" */\\\";\\n\",\n       \"\\t\\t}\\n\",\n       \"\\t\\n\",\n       \"\\t\\tvar blob = new Blob([css], { type: \\\"text/css\\\" });\\n\",\n       \"\\t\\n\",\n       \"\\t\\tvar oldSrc = linkElement.href;\\n\",\n       \"\\t\\n\",\n       \"\\t\\tlinkElement.href = URL.createObjectURL(blob);\\n\",\n       \"\\t\\n\",\n       \"\\t\\tif(oldSrc)\\n\",\n       \"\\t\\t\\tURL.revokeObjectURL(oldSrc);\\n\",\n       \"\\t}\\n\",\n       \"\\n\",\n       \"\\n\",\n       \"/***/ })\\n\",\n       \"/******/ ]);\\n\",\n       \"//# sourceMappingURL=bundle.js.map </script></head><body>\\n\",\n       \"        <div class=\\\"lime top_div\\\" id=\\\"top_divYVHIOT8C7798I3Z\\\"></div>\\n\",\n       \"        \\n\",\n       \"        <script>\\n\",\n       \"        var top_div = d3.select('#top_divYVHIOT8C7798I3Z').classed('lime top_div', true);\\n\",\n       \"        \\n\",\n       \"            var pp_div = top_div.append('div')\\n\",\n       \"                                .classed('lime predict_proba', true);\\n\",\n       \"            var pp_svg = pp_div.append('svg').style('width', '100%');\\n\",\n       \"            var pp = new lime.PredictProba(pp_svg, [\\\"computer-vision\\\", \\\"mlops\\\", \\\"natural-language-processing\\\", \\\"other\\\"], [0.9982587695121765, 0.0006825028685852885, 0.00036548610660247505, 0.0006933456170372665]);\\n\",\n       \"            \\n\",\n       \"        \\n\",\n       \"        var exp_div;\\n\",\n       \"            var exp = new lime.Explanation([\\\"computer-vision\\\", \\\"mlops\\\", \\\"natural-language-processing\\\", \\\"other\\\"]);\\n\",\n       \"        \\n\",\n       \"                exp_div = top_div.append('div').classed('lime explanation', true);\\n\",\n       \"                exp.show([[\\\"object\\\", 0.2055245291068719], [\\\"pretrained\\\", 0.13423432880040287], [\\\"detection\\\", 0.11231008650828866], [\\\"convolutional\\\", 0.10582258153782365], [\\\"networks\\\", -0.05290703848070405], [\\\"Using\\\", 0.019617127150369586], [\\\"for\\\", 0.013421583056673963], [\\\"neural\\\", 0.007494440447793467]], 0, exp_div);\\n\",\n       \"                \\n\",\n       \"        var raw_div = top_div.append('div');\\n\",\n       \"            exp.show_raw_text([[\\\"object\\\", 51, 0.2055245291068719], [\\\"pretrained\\\", 6, 0.13423432880040287], [\\\"detection\\\", 58, 0.11231008650828866], [\\\"convolutional\\\", 17, 0.10582258153782365], [\\\"networks\\\", 38, -0.05290703848070405], [\\\"Using\\\", 0, 0.019617127150369586], [\\\"for\\\", 47, 0.013421583056673963], [\\\"neural\\\", 31, 0.007494440447793467]], 0, \\\"Using pretrained convolutional neural networks for object detection.\\\", raw_div, true);\\n\",\n       \"            \\n\",\n       \"        </script>\\n\",\n       \"        </body></html>\"\n      ],\n      \"text/plain\": [\n       \"<IPython.core.display.HTML object>\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    }\n   ],\n   \"source\": [\n    \"# Explain instance\\n\",\n    \"text = \\\"Using pretrained convolutional neural networks for object detection.\\\"\\n\",\n    \"explainer = LimeTextExplainer(class_names=list(class_to_index.keys()))\\n\",\n    \"explainer.explain_instance(text, classifier_fn=classifier_fn, top_labels=1).show_in_notebook(text=True)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"5Pkm_pH847x1\"\n   },\n   \"source\": [\n    \"### Behavioral testing\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"NUsd9Z8347x1\",\n    \"outputId\": \"b909da29-5227-4649-edd7-c4d696d1db88\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:46:15,716\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:46:15,717\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:46:15,718\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/2 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"['natural-language-processing', 'natural-language-processing']\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# INVariance via verb injection (changes should not affect outputs)\\n\",\n    \"tokens = [\\\"revolutionized\\\", \\\"disrupted\\\"]\\n\",\n    \"texts = [f\\\"Transformers applied to NLP have {token} the ML field.\\\" for token in tokens]\\n\",\n    \"[preprocessor.index_to_class[y_prob.argmax()] for y_prob in classifier_fn(texts=texts)]\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"7VLqZDYr47x2\",\n    \"outputId\": \"eade6d4d-d90d-42a2-cd09-19835fb3595f\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:46:16,783\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:46:16,784\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:46:16,784\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/2 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"['natural-language-processing', 'computer-vision']\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# DIRectional expectations (changes with known outputs)\\n\",\n    \"tokens = [\\\"text classification\\\", \\\"image classification\\\"]\\n\",\n    \"texts = [f\\\"ML applied to {token}.\\\" for token in tokens]\\n\",\n    \"[preprocessor.index_to_class[y_prob.argmax()] for y_prob in classifier_fn(texts=texts)]\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"colab\": {\n     \"base_uri\": \"https://localhost:8080/\"\n    },\n    \"id\": \"OW57njXQ47x2\",\n    \"outputId\": \"b0fd3a50-308e-4864-f38c-5e737b268312\",\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:46:17,810\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"2023-09-17 22:46:17,811\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:46:17,811\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/2 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"['natural-language-processing', 'mlops']\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Minimum Functionality Tests (simple input/output pairs)\\n\",\n    \"tokens = [\\\"natural language processing\\\", \\\"mlops\\\"]\\n\",\n    \"texts = [f\\\"{token} is the next big wave in machine learning.\\\" for token in tokens]\\n\",\n    \"[preprocessor.index_to_class[y_prob.argmax()] for y_prob in classifier_fn(texts=texts)]\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"id\": \"OkBxFVAA47x2\"\n   },\n   \"source\": [\n    \"We'll learn how to systematically create tests in our [testing lesson](https://madewithml.com/courses/mlops/testing#behavioral-testing). Be sure to also checkout the [evaluation lesson](https://madewithml.com/courses/mlops/evaluation) where we cover more ways to evaluate our model, including generating slices, counterfactuals and more.\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"# 🚀 Serving \"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"source\": [\n    \"### Batch inference (offline)\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"import ray.data\\n\",\n    \"from ray.data import ActorPoolStrategy\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Artifacts\\n\",\n    \"run_id = sorted_runs.iloc[0].run_id\\n\",\n    \"best_checkpoint = get_best_checkpoint(run_id=run_id)\\n\",\n    \"predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"preprocessor = predictor.get_preprocessor()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {},\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:46:24,211\\tINFO streaming_executor.py:93 -- Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[ReadCSV->SplitBlocks(64)] -> ActorPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor)]\\n\",\n      \"2023-09-17 22:46:24,213\\tINFO streaming_executor.py:94 -- Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=True, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"2023-09-17 22:46:24,214\\tINFO streaming_executor.py:96 -- Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\",\n      \"2023-09-17 22:46:24,951\\tINFO actor_pool_map_operator.py:106 -- MapBatches(preprocess)->MapBatches(TorchPredictor): Waiting for 1 pool actors to start...\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"Running 0:   0%|          | 0/4096 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapWorker(MapBatches(preprocess)->MapBatches(TorchPredictor)) pid=848995)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"array([0, 3, 3, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 3, 0, 0, 0, 2, 3, 2, 3, 0,\\n\",\n       \"       3, 2, 0, 0, 2, 1, 1, 2, 2, 2, 2, 2, 2, 0, 0, 0, 0, 0, 1, 2, 2, 0,\\n\",\n       \"       0, 3, 1, 2, 0, 2, 2, 3, 3, 0, 2, 1, 2, 3, 3, 3, 3, 2, 0, 0, 0, 2,\\n\",\n       \"       2, 3, 2, 1, 0, 2, 3, 1, 0, 2, 0, 2, 2, 2, 0, 0, 2, 1, 1, 0, 0, 0,\\n\",\n       \"       0, 3, 0, 0, 2, 0, 2, 2, 3, 2, 0, 2, 0, 2, 2, 0, 1, 0, 0, 0, 0, 2,\\n\",\n       \"       0, 0, 1, 2, 2, 2, 3, 0, 2, 0, 2, 3, 2, 3, 3, 3, 2, 0, 2, 2, 2, 2,\\n\",\n       \"       0, 2, 2, 2, 0, 1, 2, 2, 2, 2, 2, 1, 2, 0, 3, 0, 2, 2, 1, 1, 2, 0,\\n\",\n       \"       2, 0, 0, 0, 0, 2, 2, 2, 0, 2, 1, 2, 2, 0, 0, 1, 2, 3, 2, 2, 2, 0,\\n\",\n       \"       0, 2, 0, 2, 1, 3, 0, 2, 2, 0, 1, 2, 1, 2, 2])\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Batch inference\\n\",\n    \"preprocessed_ds = preprocessor.transform(test_ds)\\n\",\n    \"compute = ActorPoolStrategy(min_size=1, max_size=2)\\n\",\n    \"outputs = preprocessed_ds.map_batches(predictor, batch_size=128, compute=compute)\\n\",\n    \"np.array([d[\\\"output\\\"] for d in outputs.take_all()])\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Online inference (real-time)\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"While we can achieve batch inference at scale, many models will need to be served in an real-time manner where we may need to deliver predictions for many incoming requests (high throughput) with low latency.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"from fastapi import FastAPI\\n\",\n    \"from ray import serve\\n\",\n    \"import requests\\n\",\n    \"from starlette.requests import Request\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"# Define application\\n\",\n    \"app = FastAPI(\\n\",\n    \"    title=\\\"Made With ML\\\",\\n\",\n    \"    description=\\\"Classify machine learning projects.\\\", \\n\",\n    \"    version=\\\"0.1\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"We'll start by defining our FastAPI application which involves initializing a predictor (and preprocessor) from the best checkpoint for a particular run (specified by `run_id`). We'll also define a `predict` function that will be used to make predictions on our input data.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"@serve.deployment(num_replicas=\\\"1\\\", ray_actor_options={\\\"num_cpus\\\": 8, \\\"num_gpus\\\": 0})\\n\",\n    \"@serve.ingress(app)\\n\",\n    \"class ModelDeployment:\\n\",\n    \"    def __init__(self, run_id):\\n\",\n    \"        \\\"\\\"\\\"Initialize the model.\\\"\\\"\\\"\\n\",\n    \"        self.run_id = run_id\\n\",\n    \"        mlflow.set_tracking_uri(MLFLOW_TRACKING_URI)  # so workers have access to model registry\\n\",\n    \"        best_checkpoint = get_best_checkpoint(run_id=run_id)\\n\",\n    \"        self.predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"\\n\",\n    \"    @app.post(\\\"/predict/\\\")\\n\",\n    \"    async def _predict(self, request: Request):\\n\",\n    \"        data = await request.json()\\n\",\n    \"        sample_ds = ray.data.from_items([{\\\"title\\\": data.get(\\\"title\\\", \\\"\\\"), \\\"description\\\": data.get(\\\"description\\\", \\\"\\\"), \\\"tag\\\": \\\"\\\"}])\\n\",\n    \"        results = predict_proba(ds=sample_ds, predictor=self.predictor)\\n\",\n    \"        return {\\\"results\\\": results}\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"> `async def` refers to an asynchronous function (when we call the function we don't have to wait for the function to complete executing). The `await` keyword is used inside an asynchronous function to wait for the completion of the `request.json()` operation.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Connecting to existing Serve app in namespace \\\"serve\\\". New http options will not be applied.\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:46:46,923 controller 840558 deployment_state.py:1390 - Deploying new version of deployment ModelDeployment in application 'default'.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:46:47,027 controller 840558 deployment_state.py:1560 - Stopping 1 replicas of deployment 'ModelDeployment' in application 'default' with outdated versions.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:46:47,027 controller 840558 http_state.py:265 - Start to drain the proxy actor on node 860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:46:49,260 controller 840558 deployment_state.py:2027 - Replica default#ModelDeployment#qtfPwF is stopped.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:46:49,261 controller 840558 deployment_state.py:1679 - Adding 1 replica to deployment ModelDeployment in application 'default'.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:46:52,625 controller 840558 http_state.py:276 - Stop draining the proxy actor on node 860a06117a62bfc12416a8163d19974a865e594674344a920da1e53b\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Deployment 'ModelDeployment:fHCaeN' is ready at `http://127.0.0.1:8000/`. component=serve deployment=ModelDeployment\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:46:58,941\\tINFO router.py:1226 -- Using router <class 'ray.serve._private.router.PowerOfTwoChoicesReplicaScheduler'>.\\n\",\n      \"2023-09-17 22:46:58,947\\tINFO router.py:537 -- Got updated replicas for deployment 'ModelDeployment' in application 'default': {'default#ModelDeployment#aAAvxd'}.\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"RayServeSyncHandle(deployment='ModelDeployment')\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Run service\\n\",\n    \"sorted_runs = mlflow.search_runs(experiment_names=[experiment_name], order_by=[\\\"metrics.val_loss ASC\\\"])\\n\",\n    \"run_id = sorted_runs.iloc[0].run_id\\n\",\n    \"serve.run(ModelDeployment.bind(run_id=run_id), route_prefix=\\\"/\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=False, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=350914, ip=10.0.34.101) Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba) pid=351034, ip=10.0.34.101)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'results': [{'prediction': 'natural-language-processing',\\n\",\n       \"   'probabilities': {'computer-vision': 0.0006470938096754253,\\n\",\n       \"    'mlops': 0.0003823915321845561,\\n\",\n       \"    'natural-language-processing': 0.9983959794044495,\\n\",\n       \"    'other': 0.0005744708469137549}}]}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Query\\n\",\n    \"title = \\\"Transfer learning with transformers\\\"\\n\",\n    \"description = \\\"Using transformers for transfer learning on text classification tasks.\\\"\\n\",\n    \"json_data = json.dumps({\\\"title\\\": title, \\\"description\\\": description})\\n\",\n    \"requests.post(\\\"http://127.0.0.1:8000/predict/\\\", data=json_data).json()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"The issue with neural networks (and especially LLMs) is that they are notoriously overconfident. For every input, they will always make some prediction. And to account for this, we have an `other` class but that class only has projects that are not in our accepted tags but are still machine learning related nonetheless. Here's what happens when we input complete noise as our input:\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m INFO 2023-09-17 22:47:02,865 ModelDeployment default#ModelDeployment#aAAvxd 7abfafdb-67ae-4204-a021-9f7507e22f78 /predict/ default replica.py:749 - __CALL__ OK 3898.9ms\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=False, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=350914, ip=10.0.34.101) Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba) pid=849454)\\u001b[0m /tmp/ipykernel_841208/1209796013.py:7: UserWarning: The given NumPy array is not writable, and PyTorch does not support non-writable tensors. This means writing to this tensor will result in undefined behavior. You may want to copy the array to protect its data or make it writable before converting it to a tensor. This type of warning will be suppressed for the rest of this program. (Triggered internally at ../torch/csrc/utils/tensor_numpy.cpp:206.)\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'results': [{'prediction': 'other',\\n\",\n       \"   'probabilities': {'computer-vision': 0.010165845975279808,\\n\",\n       \"    'mlops': 0.2043360322713852,\\n\",\n       \"    'natural-language-processing': 0.05693763121962547,\\n\",\n       \"    'other': 0.7285605072975159}}]}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Query (noise)\\n\",\n    \"title = \\\"this is random noise\\\"  # random noise\\n\",\n    \"json_data = json.dumps({\\\"title\\\": title, \\\"description\\\": \\\"\\\"})\\n\",\n    \"requests.post(\\\"http://127.0.0.1:8000/predict/\\\", data=json_data).json()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:47:06,943\\tINFO router.py:537 -- Got updated replicas for deployment 'ModelDeployment' in application 'default': set().\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeployment pid=350914, ip=10.0.34.101)\\u001b[0m INFO 2023-09-17 22:47:06,917 ModelDeployment default#ModelDeployment#aAAvxd 3c3a4798-af4d-45f3-a2b1-c73d15e1ce83 /predict/ default replica.py:749 - __CALL__ OK 4037.2ms\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:47:06,939 controller 840558 deployment_state.py:1707 - Removing 1 replica from deployment 'ModelDeployment' in application 'default'.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=840558)\\u001b[0m INFO 2023-09-17 22:47:09,134 controller 840558 deployment_state.py:2027 - Replica default#ModelDeployment#aAAvxd is stopped.\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Shutdown\\n\",\n    \"serve.shutdown()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"### Custom logic\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"To make our service a bit more robust, let's add some custom logic to predict the `other` class if the probability of the predicted class is below a certain `threshold` probability.\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [],\n   \"source\": [\n    \"@serve.deployment(num_replicas=\\\"1\\\", ray_actor_options={\\\"num_cpus\\\": 8, \\\"num_gpus\\\": 0})\\n\",\n    \"@serve.ingress(app)\\n\",\n    \"class ModelDeploymentRobust:\\n\",\n    \"    def __init__(self, run_id, threshold=0.9):\\n\",\n    \"        \\\"\\\"\\\"Initialize the model.\\\"\\\"\\\"\\n\",\n    \"        self.run_id = run_id\\n\",\n    \"        self.threshold = threshold\\n\",\n    \"        mlflow.set_tracking_uri(MLFLOW_TRACKING_URI)  # so workers have access to model registry\\n\",\n    \"        best_checkpoint = get_best_checkpoint(run_id=run_id)\\n\",\n    \"        self.predictor = TorchPredictor.from_checkpoint(best_checkpoint)\\n\",\n    \"\\n\",\n    \"    @app.post(\\\"/predict/\\\")\\n\",\n    \"    async def _predict(self, request: Request):\\n\",\n    \"        data = await request.json()\\n\",\n    \"        sample_ds = ray.data.from_items([{\\\"title\\\": data.get(\\\"title\\\", \\\"\\\"), \\\"description\\\": data.get(\\\"description\\\", \\\"\\\"), \\\"tag\\\": \\\"\\\"}])\\n\",\n    \"        results = predict_proba(ds=sample_ds, predictor=self.predictor)\\n\",\n    \"        \\n\",\n    \"        # Apply custom logic\\n\",\n    \"        for i, result in enumerate(results):\\n\",\n    \"            pred = result[\\\"prediction\\\"]\\n\",\n    \"            prob = result[\\\"probabilities\\\"]\\n\",\n    \"            if prob[pred] < self.threshold:\\n\",\n    \"                results[i][\\\"prediction\\\"] = \\\"other\\\"\\n\",\n    \"\\n\",\n    \"        return {\\\"results\\\": results}\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(ServeController pid=850735)\\u001b[0m INFO 2023-09-17 22:48:54,599 controller 850735 application_state.py:183 - Recovering target state for application 'default' from checkpoint.\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Started detached Serve instance in namespace \\\"serve\\\".\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(HTTPProxyActor pid=850784)\\u001b[0m INFO 2023-09-17 22:48:55,884 http_proxy 10.0.35.174 http_proxy.py:1441 - Proxy actor 8bf33b9832cc186ec5c3be470b000000 starting on node c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a.\\n\",\n      \"\\u001b[2m\\u001b[36m(HTTPProxyActor pid=850784)\\u001b[0m INFO 2023-09-17 22:48:55,890 http_proxy 10.0.35.174 http_proxy.py:1626 - Starting HTTP server on node: c268d87a05f14889a7bdc3c259e78ced37c574c65ab440657e85be5a listening on port 8000\\n\",\n      \"\\u001b[2m\\u001b[36m(HTTPProxyActor pid=850784)\\u001b[0m INFO:     Started server process [850784]\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=850735)\\u001b[0m INFO 2023-09-17 22:48:56,036 controller 850735 deployment_state.py:1390 - Deploying new version of deployment ModelDeploymentRobust in application 'default'.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=850735)\\u001b[0m INFO 2023-09-17 22:48:56,138 controller 850735 deployment_state.py:1679 - Adding 1 replica to deployment ModelDeploymentRobust in application 'default'.\\n\"\n     ]\n    },\n    {\n     \"name\": \"stdout\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"Deployment 'ModelDeploymentRobust:tMjDvR' is ready at `http://127.0.0.1:8000/`. component=serve deployment=ModelDeploymentRobust\\n\"\n     ]\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:49:02,011\\tINFO router.py:1226 -- Using router <class 'ray.serve._private.router.PowerOfTwoChoicesReplicaScheduler'>.\\n\",\n      \"2023-09-17 22:49:02,015\\tINFO router.py:537 -- Got updated replicas for deployment 'ModelDeploymentRobust' in application 'default': {'default#ModelDeploymentRobust#YziEno'}.\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"RayServeSyncHandle(deployment='ModelDeploymentRobust')\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    }\n   ],\n   \"source\": [\n    \"# Run service\\n\",\n    \"serve.run(ModelDeploymentRobust.bind(run_id=run_id, threshold=0.9), route_prefix=\\\"/\\\")\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeploymentRobust pid=850829)\\u001b[0m Executing DAG InputDataBuffer[Input] -> TaskPoolMapOperator[MapBatches(preprocess)->MapBatches(TorchPredictor.predict_proba)]\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeploymentRobust pid=850829)\\u001b[0m Execution config: ExecutionOptions(resource_limits=ExecutionResources(cpu=None, gpu=None, object_store_memory=None), locality_with_output=False, preserve_order=False, actor_locality_enabled=True, verbose_progress=False)\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeploymentRobust pid=850829)\\u001b[0m Tip: For detailed progress reporting, run `ray.data.DataContext.get_current().execution_options.verbose_progress = True`\\n\"\n     ]\n    },\n    {\n     \"data\": {\n      \"application/vnd.jupyter.widget-view+json\": {\n       \"model_id\": \"\",\n       \"version_major\": 2,\n       \"version_minor\": 0\n      },\n      \"text/plain\": [\n       \"(pid=850829) Running 0:   0%|          | 0/1 [00:00<?, ?it/s]\"\n      ]\n     },\n     \"metadata\": {},\n     \"output_type\": \"display_data\"\n    },\n    {\n     \"data\": {\n      \"text/plain\": [\n       \"{'results': [{'prediction': 'other',\\n\",\n       \"   'probabilities': {'computer-vision': 0.010165845975279808,\\n\",\n       \"    'mlops': 0.2043360322713852,\\n\",\n       \"    'natural-language-processing': 0.05693763121962547,\\n\",\n       \"    'other': 0.7285605072975159}}]}\"\n      ]\n     },\n     \"execution_count\": null,\n     \"metadata\": {},\n     \"output_type\": \"execute_result\"\n    },\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeploymentRobust pid=850829)\\u001b[0m INFO 2023-09-17 22:49:40,637 ModelDeploymentRobust default#ModelDeploymentRobust#YziEno 333d113e-1023-404d-b299-f40a53693dca /predict/ default replica.py:749 - __CALL__ OK 840.9ms\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Query (noise)\\n\",\n    \"title = \\\"this is random noise\\\"  # random noise\\n\",\n    \"json_data = json.dumps({\\\"title\\\": title, \\\"description\\\": \\\"\\\"})\\n\",\n    \"requests.post(\\\"http://127.0.0.1:8000/predict/\\\", data=json_data).json()\"\n   ]\n  },\n  {\n   \"cell_type\": \"code\",\n   \"execution_count\": null,\n   \"metadata\": {\n    \"tags\": []\n   },\n   \"outputs\": [\n    {\n     \"name\": \"stderr\",\n     \"output_type\": \"stream\",\n     \"text\": [\n      \"2023-09-17 22:47:23,037\\tINFO router.py:537 -- Got updated replicas for deployment 'ModelDeploymentRobust' in application 'default': set().\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=849560)\\u001b[0m INFO 2023-09-17 22:47:23,033 controller 849560 deployment_state.py:1707 - Removing 1 replica from deployment 'ModelDeploymentRobust' in application 'default'.\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeReplica:default:ModelDeploymentRobust pid=849661)\\u001b[0m INFO 2023-09-17 22:47:22,994 ModelDeploymentRobust default#ModelDeploymentRobust#MzdUXm 0b2038b6-fe98-4a0d-a31b-a1034a075ebf /predict/ default replica.py:749 - __CALL__ OK 3964.4ms\\n\",\n      \"\\u001b[2m\\u001b[36m(ServeController pid=849560)\\u001b[0m INFO 2023-09-17 22:47:25,326 controller 849560 deployment_state.py:2027 - Replica default#ModelDeploymentRobust#MzdUXm is stopped.\\n\"\n     ]\n    }\n   ],\n   \"source\": [\n    \"# Shutdown\\n\",\n    \"serve.shutdown()\"\n   ]\n  },\n  {\n   \"cell_type\": \"markdown\",\n   \"metadata\": {},\n   \"source\": [\n    \"---\"\n   ]\n  }\n ],\n \"metadata\": {\n  \"accelerator\": \"GPU\",\n  \"colab\": {\n   \"provenance\": [],\n   \"toc_visible\": true\n  },\n  \"gpuClass\": \"standard\",\n  \"kernelspec\": {\n   \"display_name\": \"Python 3 (ipykernel)\",\n   \"language\": \"python\",\n   \"name\": \"python3\"\n  },\n  \"language_info\": {\n   \"codemirror_mode\": {\n    \"name\": \"ipython\",\n    \"version\": 3\n   },\n   \"file_extension\": \".py\",\n   \"mimetype\": \"text/x-python\",\n   \"name\": \"python\",\n   \"nbconvert_exporter\": \"python\",\n   \"pygments_lexer\": \"ipython3\",\n   \"version\": \"3.10.11\"\n  },\n  \"toc-autonumbering\": false,\n  \"toc-showcode\": false,\n  \"toc-showmarkdowntxt\": false,\n  \"toc-showtags\": true,\n  \"vscode\": {\n   \"interpreter\": {\n    \"hash\": \"8071f8c6175eca3e18fb18842fbea041b655e67ca9cf317ca1066c8b060a000c\"\n   }\n  },\n  \"widgets\": {\n   \"application/vnd.jupyter.widget-state+json\": {\n    \"00b6bb6473124fbf95cbe3c9b3baa455\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"IntSliderModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"IntSliderModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"IntSliderView\",\n      \"continuous_update\": true,\n      \"description\": \"min_freq\",\n      \"description_tooltip\": null,\n      \"disabled\": false,\n      \"layout\": \"IPY_MODEL_a12d66d6747f4e9f99e0a06dc83a2c52\",\n      \"max\": 388,\n      \"min\": 0,\n      \"orientation\": \"horizontal\",\n      \"readout\": true,\n      \"readout_format\": \"d\",\n      \"step\": 1,\n      \"style\": \"IPY_MODEL_a23177628b624969855185844d6e2648\",\n      \"value\": 75\n     }\n    },\n    \"0668507328804600a511d7667b8f1796\": {\n     \"model_module\": \"@jupyter-widgets/output\",\n     \"model_module_version\": \"1.0.0\",\n     \"model_name\": \"OutputModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/output\",\n      \"_model_module_version\": \"1.0.0\",\n      \"_model_name\": \"OutputModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/output\",\n      \"_view_module_version\": \"1.0.0\",\n      \"_view_name\": \"OutputView\",\n      \"layout\": \"IPY_MODEL_d9d89c0ae6704406a43a3d160b5cf83a\",\n      \"msg_id\": \"\",\n      \"outputs\": [\n       {\n        \"name\": \"stdout\",\n        \"output_type\": \"stream\",\n        \"text\": [\n         \"{\\n\",\n         \"  \\\"precision\\\": 0.7058823529411765,\\n\",\n         \"  \\\"recall\\\": 1.0,\\n\",\n         \"  \\\"f1\\\": 0.8275862068965517,\\n\",\n         \"  \\\"num_samples\\\": 12.0\\n\",\n         \"}\\n\",\n         \"\\n\",\n         \"=== True positives ===\\n\",\n         \"  pytest pytest framework makes easy write small tests yet scales support complex functional testing\\n\",\n         \"    true: mlops\\n\",\n         \"    pred: mlops\\n\",\n         \"\\n\",\n         \"  test machine learning code systems minimal examples testing machine learning correct implementation expected learned behaviour model performance\\n\",\n         \"    true: mlops\\n\",\n         \"    pred: mlops\\n\",\n         \"\\n\",\n         \"  hidden technical debt machine learning systems using software engineering framework technical debt find common incur massive ongoing maintenance costs real world ml systems\\n\",\n         \"    true: mlops\\n\",\n         \"    pred: mlops\\n\",\n         \"\\n\",\n         \"\\n\",\n         \"=== False positives ===\\n\",\n         \"  machine learning methods explained examples common techniques used data science projects get know easy understand examples put practice ml projects\\n\",\n         \"    true: other\\n\",\n         \"    pred: mlops\\n\",\n         \"\\n\",\n         \"  five cool python libraries data science python best friend majority data scientists libraries make life simpler come across five cool python libraries working\\n\",\n         \"    true: natural-language-processing\\n\",\n         \"    pred: mlops\\n\",\n         \"\\n\",\n         \"  practical tips tricks successful transfer learning training models learn knowledge skills related tasks transfer boost performance tasks interest\\n\",\n         \"    true: natural-language-processing\\n\",\n         \"    pred: mlops\\n\",\n         \"\\n\"\n        ]\n       }\n      ]\n     }\n    },\n    \"3c27428cf61540b9bb41c1b178e28f84\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"VBoxModel\",\n     \"state\": {\n      \"_dom_classes\": [\n       \"widget-interact\"\n      ],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"VBoxModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"VBoxView\",\n      \"box_style\": \"\",\n      \"children\": [\n       \"IPY_MODEL_00b6bb6473124fbf95cbe3c9b3baa455\",\n       \"IPY_MODEL_6f38988c04464d7b978ef7b2467fdeb2\"\n      ],\n      \"layout\": \"IPY_MODEL_50ed661b382a4c8693b96c223d92fb17\"\n     }\n    },\n    \"430cdc93d426476e8d1c361e9a8f0928\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"450f4ebef68f4c1c9a04c65396b6fb82\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"498fb0321ba14697865a3d7ea2714b03\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"CheckboxModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"CheckboxModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"CheckboxView\",\n      \"description\": \"lower\",\n      \"description_tooltip\": null,\n      \"disabled\": false,\n      \"indent\": true,\n      \"layout\": \"IPY_MODEL_f7059f0b23a34a2692ec7c0826e1617b\",\n      \"style\": \"IPY_MODEL_d196e549046e436d8b1de126740c57bb\",\n      \"value\": true\n     }\n    },\n    \"50ed661b382a4c8693b96c223d92fb17\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"514d889853be4756ac2b996693ad9d54\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"VBoxModel\",\n     \"state\": {\n      \"_dom_classes\": [\n       \"widget-interact\"\n      ],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"VBoxModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"VBoxView\",\n      \"box_style\": \"\",\n      \"children\": [\n       \"IPY_MODEL_498fb0321ba14697865a3d7ea2714b03\",\n       \"IPY_MODEL_cbbe9c30bd8641bfa9a4fdbc8d517e63\",\n       \"IPY_MODEL_bdea131e25c5444a9af6a2a602a48e93\"\n      ],\n      \"layout\": \"IPY_MODEL_bb704b732e3b4db78ce1ed7b3ecb43e0\"\n     }\n    },\n    \"53f5b6e055864bb19eadba0aa640668d\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"6f38988c04464d7b978ef7b2467fdeb2\": {\n     \"model_module\": \"@jupyter-widgets/output\",\n     \"model_module_version\": \"1.0.0\",\n     \"model_name\": \"OutputModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/output\",\n      \"_model_module_version\": \"1.0.0\",\n      \"_model_name\": \"OutputModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/output\",\n      \"_view_module_version\": \"1.0.0\",\n      \"_view_name\": \"OutputView\",\n      \"layout\": \"IPY_MODEL_ff4494a494454ca5b23c93d599e5ef41\",\n      \"msg_id\": \"\",\n      \"outputs\": [\n       {\n        \"name\": \"stdout\",\n        \"output_type\": \"stream\",\n        \"text\": [\n         \"Most popular tags:\\n\",\n         \" [('natural-language-processing', 388), ('computer-vision', 356), ('other', 87)]\\n\",\n         \"\\n\",\n         \"Tags that just made the cut:\\n\",\n         \" [('computer-vision', 356), ('other', 87), ('mlops', 79)]\\n\",\n         \"\\n\",\n         \"Tags that just missed the cut:\\n\",\n         \" [('graph-learning', 45)]\\n\"\n        ]\n       }\n      ]\n     }\n    },\n    \"795b443fc1834645937b199e1214fcc3\": {\n     \"model_module\": \"@jupyter-widgets/output\",\n     \"model_module_version\": \"1.0.0\",\n     \"model_name\": \"OutputModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/output\",\n      \"_model_module_version\": \"1.0.0\",\n      \"_model_name\": \"OutputModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/output\",\n      \"_view_module_version\": \"1.0.0\",\n      \"_view_name\": \"OutputView\",\n      \"layout\": \"IPY_MODEL_8c6ffc9537344c709b47a5acea0e3075\",\n      \"msg_id\": \"\",\n      \"outputs\": [\n       {\n        \"data\": {\n         \"image/png\": \"iVBORw0KGgoAAAANSUhEUgAAAdMAAAEeCAYAAADRiP/HAAAAOXRFWHRTb2Z0d2FyZQBNYXRwbG90bGliIHZlcnNpb24zLjcuMSwgaHR0cHM6Ly9tYXRwbG90bGliLm9yZy/bCgiHAAAACXBIWXMAAAsTAAALEwEAmpwYAAEAAElEQVR4nOz9d5Bl2Z3nh33Oufb599L78tVVXV3tDdDdGGCAnRmO4YZ2lzLLXYpLKXYjxL/EEBX8T6EIKfSHQhFkUGKQQUlUaDnicrnLnV3OjsNggIbrRqNtdVWXt+nt8+9df47+uC9fZlZmVmVmVQMYsL6IauS79txzzz2/83Pfn9Baa57hGZ7hGZ7hGZ7hyJC/7AY8wzM8wzM8wzP8dcczYfoMz/AMz/AMz/CEeCZMn+EZnuEZnuEZnhDPhOkzPMMzPMMzPMMT4pkwfYZneIZneIZneEI8E6bP8AzP8AzP8AxPCPNRO4UQv6h2PMMzPMMzPMMmhEj/aZ3+O8jxB81yNAxIkh3nCgk6eYIsSQHoPf7+NcR+2aSPFKb/Y4ZAYkkHKcwdYyNRIZEOnujalnRJVIQiefzBPdgyQ6QCNOqJ7m1IG60VSsdHvMKv95diOBlUHCOkBDQqCnfsF6aFjqN9zxeGiZUtELZqX3FLfzVhChtL2P3fuvdfpRWJjknYv++eYQv29CTm8BDx2gbR4hIYBjpJEKaBkc8T1+oIQ4LW6ERhT08Szs6DlAjTRCfJliCWIh3PSiNcl9wbr9D6wY8BkJZB7tQwVsmlfWuVuBuBUuk5QqDidL6RpkTFCiEFaNBKIUwDnaT7s1MVurNVjKyFVc7iLzbQWqdt3Ha+jg4+5/11w4GFqWFJDMcg8mJMWyKkIOzGv9R5tTCepbXUPfR5btlGCIHfCNFq7wdwjTwz+RcpWSMU7GG8uEGsQla82zzofPFE7Z7KXWDdf0ArWj/gGYLjhdeYa1/CS1pHvm/GKlFwx4gSj6a/jBQGSidIYaJRKBVjSDsVtFpjGDaJipDCAEDpGMcskKiQIO7w6yZUpWUz8up36K48wMwWUaFPc/Y60rJJ/C5ozcD5N2jc/ZIk6KLiEGk5GE4GncTEQRcrX94SpkJg5cqgFUngIUwTw3KJgy4q9H/Zj/vUYWAx41zgTO71/jalE2Id0kka1ONllsP7dOIaCUddzP1qQggD284jpUkUe8TR4eel7TCKReJqDWt8FJnNYg5WiNbXIU6wj03j37yDWSmh2p3+ceH8Iu6ZU5iVCnGjjvYDlOchMxmMQh6dJHjXb8G2Oc8surijRWqfzeKOlajMDBB3Asy8S9INSIIYIQV2OUtQ7SBNg7jtE7V88ieHiTsB/kqLsd95noV/+TnSMXEG8/3r25Uc0jZwR4r4q01qHz/Y83kdMrgiS7pYT6FIaOk6oBGI/sLssHDNImHSQemjCHKBa+YJk+5jzz+wMM2PZhk8VWTx83UGjhcwXYPlL2uoWOEUbIJ2SOwlSEPgFG0QEHsJSmmSIMHKmiRBgjQl0hRISxK0InSiMSyJU7IJWxFxkDbYzltIKdBaEwcKtCaJFIYlEYbAKVgcf2ecy//8DgDSFDiFdEXsN0N0ojEdA6do49cDkkil5+Utpt8YIQkVsx+uEPt7d5CXNLnR+AkAbw7/bW42fkY9XDxodz0S91qfHPIMzc1eW54Eg/mTLDeuEquQ4fwpEhVjGg5SyFTr1RoBeFGDnD2AY+YJkg6mcAiTLokOyVhlgqhNmHjoIw3OX11orVFxiF0cREgDFYeUjl/AzOSJug06yw8ozJwnbNXxNhZRnYTs6DEyg+N4G4t0V+fIDE9iWC6dpfvYxUFKx18gaG4QVJfJjs5g5Uo0527gbyyBPriVwRoexp6YQAUBwewsqrtzspbZLJnTp0m6Xfzbt5921xwa7bhGJ6kDYAgTR+Y45l5kzD7Nff8LloLbT2zh+VVCLj9KoTCBlBZaJywufMTmxC+Q5EWJrCgQ6YCG3ti1mBAIcqJEVuRpqTpIgXN8hmhxGXtqkqTdQboZgnv3McslUArV6RIupHOSzGaR2Ux6bKuNcBwAzEIe5acLN3NwECO3gMxkEBkX7flopZGWwcDrx3HHikRNHxOwK1nmv3+dyf/JywhDEta7WKUswXqL9p01MtMDqDghOz1A7bM5grU2UdPHGc5jljKw0iR/api4G5KdHiDxQqxiZt/+GzYmmZZnsYWDgYkpLNqqwYfRd0mIyVoDxCogSNqHfjcVd5L17gOUPvwCxxAW08WXWGhdoRvVH3nsgYWp6UjckoM0BHbOwsqaDJ0tUzmWp7sRkCnZXP/zWcrTeUbOV/CqAVGQoCLF6tUqx94aZeValdJUgdyQi4oVzaUuG3caTL46jGFJ3KLNze/OghBc/NsnqT1o0Vn3CZohbslm406T8YuDtFa7ZAddTDvVmBAwcLLI0Oky3ZrP8uUqWmlO/MYEUSfCzlrceW+B0lSe4efKlKby1GePruEJJEV7pDdJZLGky0YwSyeukzMHqDjjCCSJjqkFC3hJEwBLZijbY2TNEmv+PbpxA0hNuEPODIHyyJolgqRDNVgg1gGuUWTAmcASDkveLULVBQQlewRLupjCwZYu7bhKNZgHIGuWKNtjSGFhCIN2VKMeLhHFHjlnkDD2sM0sbX+NvDNEJ9wgURF5d4ROsI5SMRmrTKJCDGFiGS5+3EQgCeI2sQoOJQj++kCAkKlJTEisfJnE7+JXl7EKFaJ2nbBVpfngKmiNkAbCMPGqy7TnbwHgrc5TOnkRhOgL2fb8TYRhYuYKaJWAOvwiJPP88wz9zb9J3GhQ/ZM/of3JzgWZNTjIyN/7e/gPHrD0KyBMV6MH3O1+hkZjCpucUWbYnmbSOcupzCtIJLP+1UO5On41ITAMi3x+jG53Ha+7wdTMOwgh+r41E5MJeYJj5jk83eFK9AE1vbrjKgYm4/IYU8ZZbsWfsbyyRnDnPubQIN6NmwjTIq5W0UFIXK2h/YC466HjBOk4xKvrCNPEu3YDYRrE1RrStpHFAqrVRudyJK02IIiWl5GWReL5JJ2Qzr11jKyNt1QHDVHdw65k0UrTvL6MCiIQgrgToBONChNUEBOstolqXXSi6NzfQFoGOlZE1Q5R3SOsdfFXmvgrLay8g7+2/5xbVcuE2sfEpigrzBjPASCFJGePMJY/R5C0qXZnaYcbDOdOEiUehrTxojqdqIZrFik6w0hh0gxW6EYNis4IhjSh5x6TwqRgD2ObuXRuDDfohBuU3AlsI4NGU/PmkcKg5I4hMLAM90Aj4Yl8pqWJHIWxHPMfrfHS/+wUmQ9ssgMOw8+VmfvZCtmKg2FJ1m7UGD5Xob7QoTSdBw2ddY/BU0VMW3LymxN01nwmXxtm9XqN5lKXiZeHuffTJfx66rOafmsUvxly7O0xPvtvblLvtHj5f36Gz/6bmwDkhjMMnSkx+6GPThRjLwxy+jcnWblaY/KVYWqzLQZOFIn9BK/2ZCY2KQxG3OO4RoGNYA6lk77xwZR2quEQ4RoFpvMXudn4abqz56scz5ylG9f7wtQ1cpwovs5c5zKJihnLnCbRMdVgDk3qazpZeJ1auESouggEw+5xsmaZDX8WgFOFN+hENWIdMJW7QJB4gGLQmSHRCfVwkbo3h2Xk0CTUunMIBOudeyQqRGtFmHT6Jt/1zh0kBrEOGc6fJow7RImHFLuHTPH4C7gDowAE9VUad69wWHOMla8QdRq/dCGtlSL2OpjZAnGnhTQtrEKFoL6KVoqo06B44gLeyhyx10arOPVPAYadITsyjVMexq2MErYb5CdPAZqwVUMrjVPp9VNjve9vOnjjNEYuR/bCBbybN0laR18Q/iKg09FLqD3C2KOZrBEqnzPZ1xl3TlOP16jHy7/sZj4RpDTJ5UYwTYdcbhjXKZEkwb5BKq7IMiwnaSU14kf4j+OVVNiGnc6ufcG9naZS5Xl4V64CkNTqW9sBNqrpj/WN/vbu55e3jglj2nfWdt3DX07npuaXe1vjug82dvyufZK2KWp4eAtpGxqXF/r7vT2vsu16uk1Xp1qnz1hfmKbo+W91guoJxWPlV7lf+5hER/1tm3OlaxapZKYJ4tS0O5I7Q9WbJ1I+prSpZKYBTZh0GMmdZhXBSO4UG94srllgvHAOP2qRt4fwogai5+Z6HA4sTFWiEQIM28DKWcRBjOEY1O41aa928RshhmOwdqNOEikmXh4i9hP8VioM7byVPnCi8ao+3Q2fTNnGLTs05tosfr7O7M9XaK96oMGrB1TvNDf7Ep1oxl4YpFv18RoBOtZb/k4NK1eqhJ2YqVeGaMy3yVQcVq7WuP+TReY/WcVvhkhL0rrfSs2Z8skjlf2kxXL3Vu9lboWy5a0KGnBkloxZ7B8f6YCNYI7p5IWHrpQOlFXvLn7SIWuWyBgFhDAIkjYr3h1O5F/dcYZE0omrLHu3UTphIvccWbNEK9qgYA2x3P2ASAU4Rh4vbqTBH3Hc83XujTDZvU8g2ejcpxtW9zzHzJWoPPcqa5d+hBCSJPQ4il9j4PybrF364S/Vl6iTiPrNT1JfqGmjogBh2kjTJPE90IrajU+QtksS+mil8NYW+lGUKonors0TNDaIuk1UFKCTCBWFJIGHjiMady4RB91UQz1s++KYcG0NZ3oa99QpOp9//pR74KtFomOWgtsM2zOUzCGGrCnq8QoPjxcTm1HnBCVzBFs4JMS04ior4T08tfcCQiDIGwMM2zPkjTISg1D71KJlVsJ7e2rApzKvUjAGuNL5EYYwGbdPUzQHEcLAS1qshQ+ox6uPDPpTOsHzamhgaOgcrXCRbmd11zNB+v0LBGPGMRbVPdq6foje+x8nlFb4cZNuWKMZrNAJUyEuhUHVmyPRmwsSgWvkyVmDOGbqexVC0g7XCR6a1xId0gk3aIcbnKx8nZIzSsEZJVIBhrARApRStII1msEKRWf0QG09sDDtrHkIQ/Da//I5DMfgsz+8ydBZa0c4tmFJBs+UmHp1hOygy4MPljn+zhiF0RylqVx6Q9fg5Dcn8RsBazfrLHyyRuV4kWNvjyOk4KPrNQxL7gwM0rB8tcqb/+vn+ewPb+AUbJ777RnKxwuc+4NjPHh/mcHTJSZeHCQ3nEUakrmPVnnrH13g5LcmUbHm0j+9RXvN49wfHMMwJUuXDhr8szeUTohUsOMjNYTFudI73Gn+nE7coGANcKLwOgeJgE10hN/zBygdI4TkceLejzv9wZSouBdQFLPuPeC58jfwkzadqEY7OnpkqUbRDfc/XycxdnGQxO8Q1NMVrl0cJDd+gs7SXcJmlcq510kCn+aDqww+/3Uyw1PoJKJ570u6a/OUT71E+eyrWIUyKgpZ/PEfIU2b8tlXyY0eI/Ja1G9+ilMexqmM4g6M0Vm6R278OKuffj/1Pz4NaE3Y3HjkIVG7vuN34m99qDqJCRs7x9X2tiUBqfZ9RKg4xr97l+y5c2Sfew7/9m2S9uN9SObAAPlXXsE9dQqZzaI8j+DePVoffURc23q35e98h+zzz7P6h3/Y3y4LBcb/4T8kaTSof//7+PfuAZC9cIHSt75F80c/onP58p733QuRDlgLH1Axx8gZJRzhEugtvSVnlLmQ+wY5o4QhrP72YWuGUfs4N7ofUo93CiuJwah9gpOZl3GNHGJb+vyIfYxR+wRXuz8hVDv1o5I5zJA1zUB4ixOZl8nJEgKJFBJtKUbsGe56n7Mc3N3fHK0VUdShWJrG82vEsU8+P4YQxq6YgpiIjmpSlAOMyWPcTZp9reoZ9ofWGiFS10t/G5pkW0aCbWQoOCN4UYMw6ZC3h/a9ntJJak3UCiEgUj5h0mGpdY002ElSzkwihZlmc4iD0TEcWJiGnZhrf/IAK2OgE03YiWkspB9yEio+/f/dJIkUzcUO1bsttNJE3ZjFz9YQQnD5n98miRTDz5W5/d48y5c3iP2EJFR8/t/exHQNdKxJQkUSKX78H3++4/4btxr81f/po14EsebKH93l2p/cJw4SkiBh6dIG6zcb6EQRdmK00rz///gCwzZIQkXsJ8z/fIWVyxtpcFTv3k8C/fCKWlo4Rp5mvE6U+EznLjzR9Q/Sgj0hBGvefeY7X6JJdgy6p3ofUmGy9P4fM/rG76CSiPUvfkxQXcHM5LHyFcJmleLxC8z/8L9HSIPy6RdZfP+PCRob6DhCJwm1W59QOnWR1U/+ithL/TrOwAju4DiL7/8xxePPkxs/iTQtok4TrRLMTI7G3cvkJ08/PWF6AAy+/TeQjotOYry5u3Tu3dyxP3f8DJ3Ze6CefrSqAJJmk86VK+QuXsSemcG7evWR5zjHjzPwe7+HMz2NCgKSTgdncBD3+HGyFy+y/s//OcGD1ESntcYaGcEcGCCu10Fr3Kkp7IkJkmIRa3y8L0ztyUmcyUnixuEWB4qEZryBEAJbZrBltueSAEs4vJj/Nnmjwno0x53uZ/iqhS0zzLgXGLNPcT73Np82/4KgH0wiKJkjnM2+hUZxp/sZK+E9Eh1RMAZ5Lvc1hu1pzvF1vmj/gIfHshCCC7nfoJVs8Enrz/GSJqawmXLPM+2c44T7Mp24TiPZbQrdDilNTNPFcUpks8PoPdwVAsmaWsQWLlPGKeaSmwSPNYBuwSHDtHGWQTmKLVwiHVJVK8wlt/DYuajKizKvWt+ipla5HX+xa79E8pL5LhmR517yJUtqp+n4tPkSE/IEl6OfUtcbDMoxJuVp8qIEaDq6wYPkJnW92p8HBYK8qDAmZyiLIVyZaoiB7lJVq4d+3k3EykfphGPlV1nrlFhp3+Lh95ioENCMF8+nwZIqxpQux8qvU3YnOF55g7X2bRrBbrdCw1+m4AxzauDrqYWwc5tuWGO69BKVzCS2kTtQOw/lM016gqv/O9x6oM2o2CTRJOFWlF7Q2hpU0hTEXkLYigiaW/6C2EuIvW2rOJ0K7+3QShO0ts6JvJho23t5uG3Qu8a266h45zUOitT/sfPlpQNo57Yg6bLYucqbQ3+bWIWsB7N9bRNgPHuWiew5StYoeWuQY/mXudl4P73aNg1fs5Wo/VzpXcr2GHlrgBcqf4NGtMz91qe77t4X7EJgS5ep3AtM514g0SF3Wh+z6t09Qo6q2KUdP7yAAGgv3KazfJ/c+AmGXniH5Q//HH9jCStbJDt2HH9jCRV4aKVY/tmfMfTCu6goZP3KTwlqK6goRCuFCv3UzCskbmWcwvRzOMVBEIL2/E0QkthP+1MaBonfxS2PHPKZ9n+2x0GjkaZF7eMfYzgZ8meeR2tN7vgZurN3idsNKq9/A3d8hu7sLbyF2SO2bb8mC1QUEdy4Qf7ll8mcPk1w7x7K23uCMisVSu++iz06ysYf/zGdTz9FRRHCMCh/+9uUv/MdBn73d1n5x/8Y1e0Sb2ygfB9rdBT//n1QCufYMXQYEtdq2ENbq317eBidJGm6xiERaR+tNYYwMbb54I+5F8gbZdpJlS/a3+8vAsPE53b3Y1yZZ8iaYtQ5yZz/ZS+4yWLGfR5TmNzzv+CBf6U/zjfiBS61v8fbpX+LAWuCQWuSjWh+V3sUCZdaf9WPLg61z33vCyxhM+k8x4A1STvZP53HMF0a9fuUKyfJZAZYmP+AvRagEolPl3W1xIxxlknjJHeTLw/UZ2UxzEvmu1jCQfe80Y7IkDfKjBjTXI7ep6G33oVAYgsXE3ufkS6whI0lHCS7fYImFjYuWVmkwABnjJf6Gr8AMiLPgrq74zFLYpDXrG/3j1MkCCSuyFAyBpkwTvBx+Fd0OZyvX6OZb15moXmlP+9+NP/P2H7zRMfMN6+w0PySYkHwd/92gXNnLf7xP/2EyeOX+fqUgWXCD95XnDv9gGNTJh9fkvzgJ+8RJAl3qj/r99Pm+GmubrogxIHmzqdP2vAIJg4Va259b+6p3/Krxkfrf7Tjd6Ij7rY+3vPY262fc7v18z33LXVvstS9uee+j9b/Rf/v7de+sU9KzK3mBzt+f7z+LwEYdo+TMUu8t/RfoVGMuCcp2sM0wuUdgv0g+NaF/x2WuTOc/fby97m3ki4AAKTtppGLShH7XZLQRxgGnaW7DFx4m+zYMTa+fL/vI/Trqyz+9F9RPH6B0smLrH6yko4XIZCOi4xDVBTh19II2eWf/Un6+SQJlede7Y2tvUT6wZF3Rzg/9buUczOHOu/6wp8TSMnAG78BQhBurGLmCmz87AcUn3+ZsLZOsLFC7eMf7yJ7eFoQUhIuLdG9cYPsuXN0vviC4P79PY+1p6bIPPccrQ8/pPPZZ/0UCZ0k1H/wAzJnz2IND5M5e5bO55/3hak9MoKQEq01zrFjhEtLRKurGOUyMpNBJwlGuUy4stIPvjoM0jeoEIhtE7RgxD6BQDLnX9tlTQm1TzNZo2KNMmJNM+9fQ5NgCYdhe5pO0qAaLeya9DpJg0a8StEcZNCa2FOYroYPiPXO9xVqj0a8xqh9grI1ymJwc18LTzYzSGXgNIbpgNZMTL7FrZv/ml1acG+6XlL3GDOOMW2cZTa5+chAJEiDll6yvoGJyXxym3vJVQK6uCLLCeMC4/I4F62v8WH4l0Q83XSjMXmMnCjxQF1nMblHqH1ckaUkh6mr9R1fYle3WEju0qbBRrKETweBYEhOct58HYcMJ82LXInfP0JL9I577S3c0mM6XfiTv2yxuubw299y8QPNez/tUm8m/Pv/XomPPg/4//yTJn/w21lGh0Puze6+/s57HGy2OZQwFdJINahtJgyZzSFtGxX4SMdFWBbRxsaRwv+f4ckhkGitcI0CQkDWKhOrkEQdjXnmcZSSdmGAsbf+DXSSoKKA+p1Lfb+iCn1UFBB10kAyYVpM/sbfQauExO9Sv/15/zqNO18w/ubvEXdbLPzkjwiqK3hr80x8428BUL/5KSoM0mAew0caaR5o7B89Of4odJlaaxqXPkSYJpVX36E7ewdpu6RRchodxxjZHLqj0PFXQEwgBEmrhXfrFtlz58icOUO4tNvMLRwHe2wMadsk3S5GPo+R30qmF6ZJXK9jj4xg9TTOqFpFeR7W6GjKpCMEzvg47c8+I240yF64gFkuo5VCOk5fez0sJLJPGLLpi8zIIpZMcyMj7ZOVpV3npYQ+moyxtW/Tt6q0QmDsOk+wGfhj4MrCnu3pJPU9p8tAdQm1R1YWUuKSfebUVmuBKOowMPgcpuXS3HjA3gcLQNDRTTaSJSaNU0wap3iQXN/7wj2cNF7AxmZdL3Ej+aQ/6fu6y+34EnmrTFkMMWGceOy1DgMBlMUQN+PPmFO3+tvbukE72W3eDwm4nuxUMjSaVTVHPilyyrhIWe7vy3xaeOs1lzdecVhaiTGMNF7FcQS5rCSMwTAEuZzY/GSfGg6eZ5rNkxmbIaxvpJNYt4WOY6yBQfIvvITqdlBRRFSrAoJobeUJmyZwrSIZp7LnXqUiGt2FPfc9Dq5VxLXLezqWtU7oBlXCR0S9Pg7W0DDCSoOz4mZjV4L9E0FKjFwOHcUof7d5byOYI28NcLr4JhqNFzdY9G58ZQny/sYi9//0v9qxTZgWdr6MlSvSXriDitNVv44jZr/7X+95nerVn1G9+rP+bxWHVK99SPXah4+8f3flKZtSH4OoUSV38hwkCa3rX6BVQuHsC4S1dZJuG2/uLvlT5+nM3iFcf9JvYH8E9+7h379P7qWX6F65smu/sCzMUgkMg8pv/Rblb397z+uoKALZM8t1uyTNJs6xYwjDSDVU2yaYm0MFAUY2i1mpgNZI1yWYnz+0Zip6UZeQBuRsaoSm2DJHvpj/Do/SBpRWbAomS6Q5gCVzmNeLv7fveRqFsYc5E+hpnLvPS4hRWmEK65FOAdPKYFo5NoNXMtlh2Njt1xNs8fvMq9uMGFNMG2dYTO7ua2sxMBmWk2jY87iIkKaqUjQqDMmJpypMAXy6zKs7T3ydutpAG6n5OGUz+urY02r1hE5X47qS+3MRo0Mm777lslFT/PgDj/NnbX7vOzlu3A5Zrz49pe9AwlSYFpmxGYpnLtK8dRmrOEDr3lWiRpWk28Gfn8UsFFJWjsB7KuLekBbjlRc5M/Gbu/ZprQnjNj+++p8egSJKMDHwMidG38GQ1q69QdTixuJfslzbPUEdBDKfp/Tuu0TVGmiFd+c24VMUptJ1yZx9jqRWw7u7e5AnOuJ+67O+GU3vYb74qmHYGbJjx4k6Dby1+V3ay6YnIF8QWCY0m5okSed0xxF43t7tFQIcB/zHZM8IAUPDEq+rabf3SFFIfDZadwmiDoY0kTKN2tv8f9Owsc18L9l7J+qf/2zXtu6DLZKEzv1bdB7c+crzZeN6He/mTdwTJ8g+/zzerVs79gshQEp0GNL98kvC5b3zOXWSEMxtuV7ClRUy584hs1mckyfT/bOzffOuWS6nxOimSbS8fGjNVGJQMcfQWhMkHQKVLlq3m+2Wwzu7zK47nl3H/eM3o2F91WEjmt836laj6cT1PfelQnZ3xL1EIhAo1CO/IccpkcuPkCQhUdghjB5PtdnSNdbUAhPyJBPyBAvq7p5nZEUeg3SeyokSE3uMSVdkAEFW7K15HxUaaKv6oWItJAYZkcMhgyGs1AqBJCsKfTP3V83vffVmxPXbUX9o/nt/t8Bf/chjfilmasIkSeBnn/jUG0/3Gz2YMO1pcLHXwcjkMNwtP5r2fezBIcKV1NSkgoC4vndO4tOCEALLyJJ1Bmj7j46yexim4eDaxT0F6dOAkc1h5HJs/NmfooNUGzTyeZypaaTjECwtEa2vgVJkn7+AMNIP2bt1A5nJYI+Ng9Yo30tX/nGMPTaOPTaGjiLiVgtp25gzxzBKJcLVldTM1xs5AkHBGCTWIaawaCUbGJipeVDHKYG/sAl0F4nEEm4//00Kk1gHTyx8426T2vWPdm23LHj3mw5RqFlfV/ie5vhJk8ufR2xsKBxHMD4puXt77wnRtgWjY5L5uYRHKURCwKnTJo4j+NF7wa61XRA1ubfyU6S0MKWFlDamYaWMUdIi5w4xPfQ6eXf4aB3wCyKe8K5fJ3fxIoXXXydc3Jlcr+O4bxHp3rxJ+6Pd72MvRMvLqcVpaAh3Zoak0SCqVrEGBkhaLcxKBWHbKM87EmlExigyYh8j0j7NZJ24l9rlq06qIQqY929Qiw8Woe0lLZRWeKrFXe8Snmoeuk2ukd9zereEiyltuknzkQKl016m0z48+cRscoMROc2EcZI1vbTnPQysVKMVghPG84+4mj5CSN3jj48PwaGcIc+4cZyyGMIRWQSg0CB0Ogf9ArF9jfeTD32qtQSlYKOacOVaSLf79L/RAz2hikOCjRWsYgXDyeCvLpB00xWlzGRQgU+4sZ5G/TXqT72Re0IIStnJQwtTx8zjWsXHH3hExPUa/uwclW/9JuHKCt0bN7AnJ3vk0w2y587R/rRL0m6RdDpIy8SZnEbNzCCEJHPiJJ3r11BeGvEobJvS2+/QvnwJHcXoKEKYVo/IIiH73Dnieh3VY0oRSArGAKawWI/msUWWnFHElXmayQZFY5BO0iRIPCzhUjSHkBg9M7CmEa99ZSTkr75uMzoqufxFRKetCUNNPi/I5gS1Gnz9XQetNHdvJ9g2vPCizdCwpNNWfHk54sxzFoWiYGkxQWv4G/+GCxpu34zRaF64aPHgfsKNaxGNhuK1N+x94+E0ikQFJGq3+TuIW4yVHzVxbcHOGhRHHExL0lwP6NajAy+6K5MZOrWQsHs0U1Ncr9P98ksqv/M7ZC+mFIabUEFAuJKamZ3JSbpXr/bHyKMQrqygowhrZCQ97+ZNUIrE84jW1rCGhpDZLNHGBjo6nB8+IwuczryKK/PUoiXWw61goEj71KMVXCfPpHuWenvlQBqRr9o043UyskDFGsULWhxW6xm0prgrPusLdgBTWOTNCrZwWY7v7tj3tNDWDVbUHBPyOGNyZs+cU0WcBmxpzc3k80e6aw5LzXgwAXewvjQwOW2+yJCcoKVrzCe38UkXSBpFXpY5Z7x2qPY9Ldy6u/XuOl1Np/vVzG8HWy5oTdSq0bj+GcIwUVHYj1bUUYS0HTLHTxK3Wr8wYSqAUnaShernhzrPsfI41tM1h2yHDkNaH/8ca3AIZ+YYxbe+BlJgDQ9j1OpI206DOywL9/gJSGLMcomk2yFptYibzTSXr6fdmINDYJp9M57MZlGBT7xSJ5ifw52aRpg7X2NK4pZGOtrSpWAMIoTEUjagaatqT4MdIC8rKBLiJCQny7RF/Snkpe6Nl1+1+N5f+NzpaZ4Dg5K49/1rDRsbCS++lFoMbFtw5qzB3FxCuSw5dsKk0VCcOmMjDcHFCyalkuCDn4Y06qlW6/uaCxctVlcSAv/pBhfsB2kIJs4VEVLgtSJyZYtOLcItmEhDYNqSOFJ0axHZsoVhSTrVkMpkhmOvVLj7840jC1OAzhdfkH/tNXIXL/Z9nwAoRTA7m/pVX3yRaH2d1kcf9a0lCIHVCz7ybt1Ch+n3HFWrqG6XzOnTGIVCP69U+T7R2hqZM2eQjkO7l2bzKAghMTHIyAID1jhjzkmKxhC+anHfv0z3ITaj+/5lBqxxRqzjJNmQheAWHdXjrxYuWaPEgDXOYnCrT6If6YC54Crnsl/nmPsCEoP1aI5Q+RjCwhYuBXOQvFlm1vuSUO/2EeSNCmcyb3Dfv4ynWhiYjNonGbNPpqxl0cJXIkwBZuPrjNszjMoZNtRubbyj2yhiJBZd1WRDH1QDTt07Usg9g6cMDFyRRz2lhXNOFBmR0/h0uJt8SU3tZI6ytPMLdjb94nEgYSotm8zYNLHXIVhfpvz867Qf3CTuNIlbLRoff5j6aH6hxcQFxezkoc+yra9WM4WUKzNYmAfDoPDqawTzcyTtNt1rV0FpEq9L5vQZpGPT/PBT8i+/Qj8aNIl3mAmV10390dugkwTiuJ9S8jASHdNVLWzpEiiPhASzZ9IJVUCsQyQGWaOIKU0SLTBIK3sYwvzK3BmtlqYyIGGPFbTWUKsqbLvnVRGpqebB3Rj7nEUmI1hZTpBpEB5j4wYrywnzswnliuDNr9kYZlr32LJ/ceMwaMd0GxFxoOhUI17/W5N89C/mOf/NYXIDDu31ACtjcP+zGiMncgzO5OhUA7qNmGMvlbj/6ZO5RJJ2m/annzLw+7+/a1+0tkbjhz9k4Pd/n8pv/zaFN98krlYRloVRKGBks4Srq/gPHvSFKXFMuLpK7vx5kDKN2AVIEuJGIy3nlc+nGuwjopWnnXOM2id6yS8SQ1iYwqaZrKcsRtFuGsFWUuVK+4dcyP8Gk+45RuzjfW1L9CKADWGxHs7ToQ6kC8e1cBZHZDmeeZGz2Tc4qV9GbUu9MUTKMT3v39hzbM/5VxlzTjFszxDpEInElhmkMLjvXd6T8vBpoUuL5WSWceM4Qk7s2p8Q9XyrJ5g2zlCLVw/EmqRQRNrHJYMjMruoC0fkNKYwCZ/SwtkWbtrPKqKrdpvFR+TUEczQf71wMJ+pYSCdLHipD2YzBUY4DiQJ0rKQtoM9Nk778udfWWNr7VkKmVFMIw2hd+0Ctpk7cOStEAauWcDcVgWg3pmnlJ04MGXU4+AeP0HpG78BSYKKIuo/+iFCCgqvv4l7/ATBwgLtTz8mWlul/M1vYWSyKcl8d+/E+6TVovPlFUb/3r9D0ungP7j/yPsrElai+2wmG4Ommaz3AikSNv0kioT54EY/SEkg2IgXDmziHbAmaUQrDDnTBEl3F8XbXvjun/n8B//7PK+/ZXP/bur3/Oa3HPI5gWVF/Pbvubz4ksWXVyK+/CJCA0mP9rhSkRw/6fLW2zarqwmf/DzgP/iPipw6bXH/bszgkMHYmKTTUYyMGrz2usULL9rcvR3zwU+/mpxPSBcBKk7LA6pE4+RMhBC4eRPLldz9uMqxl8sMzWQZOZ0nCRWDx3Jc/6/vUxxxnkobWh9/TPGdd7BGHiKwUArv1i1W//APyb/+OrkLF8icPYtOkjS95vZt2p9/vivaPFxcJPfCC6mlZGOLXjFptUiazbRKSbXKfo5rrTWmcDCFQ0JEqHxq0Ryr4Sxr0ey+0bOg2YiX+LD5PzDlnGPYniFrlJAIAuVRi1ZYix7QjHcSRUQ64IF/hUayxqR9hrI1TkbmiHVMoLqsRSushPf6wU4PoxGvsRTe5oT7EhVrHCkM2kmNef86K+G9RwZDPSk0mtnkBuPGcXKiuKeP8k5ymSE5waAc56L5Ng+SGz3hKHBEhpIYYFhOcTu5REenPuNYhzR0lRExxZQ8TaC6tGliYDAmZzhrvvJUTTddnXKeuyLDoBxjQd0DNDYux83nGZZTT+1ev6oQer/yBmzLwxOC/LGzFE9fJGrVMXNF1j/6PiKXRbou2ZNnSAIPaTvUfvCXe15LGhZD06/gZMr9hHCA6uIVOvXdKS6GtJkZemtHNO9C9XOGi2exzSyQRmV+cf+fs9G6e6CHtc0cp8a+yfTQVvHi2dUPmRp6DdmLknvSaF5gp7a42b2b27Z3917HPe6aDx/3CJKMJ8W3LvyH2FZ2x7ZbS3/FvZX3OZ65SDPZYMSeoZu0mPOuHsjHJWX6b3Me3mz+ppK9qZFu37f598PHb14rTsCQ6b4k2ftaj4Jh2CTJ1oSZc4d4fur3qeSP7Tju2vyfMbe+O5DnxGsVokCxeK3J2XeGmDhfYOhYjpU7bT767+c5/mqFjbkuUy+UyA/YrN/vMHw8x8jpPN/7z25TnfcQpoU7MoHhZggbNcL6+k5htflAmw//MHr7hZA4Q2OEtXVU6Kf9JsRWP0qBkAIVq61+1Xr3JR813vbavqM/JYi0OMbWYUcZo7v5t57mea8Wfodhe4bL7fdYDG6ztQA97P0eDQubk8YLTBon+TL+kBW1k7jGwOS8+QbjxnFiHXMr/ox5tbOMXkFUeNF8l4zYj9pO82H0XVq61vstGBYTnLfewCFVHmLifnrQmlokImBYTnI7vpSyGW3DOfN1puRpltQ9vowfnZ4GaRTvc+arTMpelSTSQEYbh4SEK/EHXDTfBjTvhX+0Y64oiSHG5DSuyGFip8xOskSiY1q6RqRDIiIaap1ldZ+Ir25xswk7LY1NuMet9hOZB/aZth/cIqxvYOaKBNUVEq8DrdQHGC4voZMYs7g70XoTJ1/5O2QLo3Sby+QHpvE7VbROqC4cnCTbD+ooFfeIjwVSGBQyYwcWpqbhkrG38la11nSCnSweTwV7RrwccNthrnnYazxFdJMmI/YxOkm9Z0ozSXT02L5UaqeA2978h+XEXn9v37b9Wg8rSfvJHAApLSwz218sDg9dYG5hi9XpIEjLMmm0Vtz7pNbffv1Ha9z86doOzpKr30/Laa3cbqfyUKWc3TuCfrVC2g5WeYiguoYQEntoJOUv1iqNxu62U4IIrTALJeJ2C4TAzBfwV5dSjXhsGndojLjTQoU+p785Rnkyy5d/Ok+3FnL8zSEu/O40//r/8CmWa3Dy7RHCbsy9nz0UyHfE8VYYdXnr758iU7L52T++zdrtJykTd9SxfdjztsfyHu2e0rQRxtZ0qqKgz/qlSXNqQx3sGSSUELOQ3GZQjpL0/vcwWrrGh9GfM2mcZFBMkBVprm6IT1PXWFXzfVOudEykbdIQNa6JT5nUJ8iHRYQStHSH5eQBi+ouk8YpynpozzbFRIT4j2Vn6j8vCTfjz2jKGuPyGK7Iog1Yd5Z5oG7SVGtU1QrFzBCm7ZIEASrqEXaIHANyDFtsZYkEPd92RhTIbC6kgTU1f2hhKiWMjxlYlmB+ISaO022mmc4bm3OHYYBpgGkKvv6Wg2XBX3wvbcdBFuUHjlc23AzSyQAaZ2AUf3UeFUcI1yV/4SXiehVh2UQbe3N1loZPcen7/wmGYTF17m9w//K/ZuTY65hOfs/j90KsIoKohWPloVdip5A5WHkcAMvIkN1GAhGrAD86fPTfM6T0bl7SJki6mNJi0JqinWzQ2YMZ5VcNuewwudxon4zcdfZfBO4FIQwqxVRr7XobhFEHtc33tC/51zYB/3D2jE4SomYNYZjErQa5Y2fQWpEZnUbrBGGYBBurCCEIq2vkpk+ThD7ScgjWl0BrShffIKpXsUpbY3ztVpPhU0VyAw7dWsipd0a5+ufzIMDKmqzcbODVtyYnp2DhFqxU448UrRUfO2diuQadjQCnYCKkIGhFZCsOVsbo/+7WQlorPp//0Syn3t35XVquJF+xQEOnEaESTa5soVX6280ZeK0YlYBpC5ysgWnLNLCrGaMSTaaYBnV1GxGh96tVbWX41W+THZlBham7ZvXT7+Otpxa3mJA7yWXuJPsrDjW9xg/Df/nIe8REPEhu8IAb+x8kBUPfOMPQu2fIjBWJWgHrH93n6vc+JqzuNHPPJbeYS27teZnb8SVuc+mR7XkYCTEL6jYLPa26eGacsd95gRH5IurPr3Dp2k8Ye/cCz73926y+d4PVv7oGwLJ6wPJDRPtPE8NDkn/3387R7mh+9NOAS5dDThwzee6MRaut+PDjgDiGt99yKJUki0vpB2xZgtMnTXxfs7D06HQ8OEQAUm76NO7gGGEzXYUHG8uYmQxmqUTSbuIeO0Hr0/1z2bSK0UqhJSkPqzSRho1lZ/c9Z1djDZumt0whM9orUSbJOoNIYe6YzPaDbWZxtgUftbxNhpqn6xiXwsQ2c1hmBkPaaVBPak9DqYREhUSJRxB1UF9RlOAmBALLzGCbeUzDQQqr5x9WJComTvy08Hfs7TLTPkrLrEfL1KMnK+yc9lMWy8xgSgchzR5Xq0bptJ/iOG1fvEcKy1HR7qzQ7iz3hWm9nvp3DgqtFV1vg2J+ipGB81Qb9+h4afUMM2dj5W2idkjcObo5KhWqNaJ2HWm7aK9LdvI4zRtf4IxOYBZKqHpMWF3FW5oFlWBYNl67QdzZyrVsLHnoRJMp2ViuwcBMjh/+ZxtIQ3Dia8OcfmeUmz9c5tp304n/4h9MM3QiT+gltFY8Pvmn95h5dZDxC2V+/F/c4NTbo9hZk6vfXeDk10cYPFHAzqSmw+/+X/cWFqYtePm3himP2SSh5vbHdSzX4MybZZJIce2nNY6/WOTGz2qszXqcfLVEacQmX7YZPpbh/X+2hDQFz39jgCRW1JcDLn1v/VdOoK598SPacze3VkpC4A6MIU07Lc/XqpEEXaTl4JSHUuuGEHRXZ0EI7MIApptFxRFhs4qKjjDmlWb1e9eoffKAsd96ntbNFeqfp2Zlq5LFGS4gpCRqevhLdaxyFmcoj5CpK8Cbr5F0Q5zRInY5CwLidoA3X8PIWLhjJaRjEXd8/KUGOlbkz4wQtwPMvIOKErz5GnY5y8DXTuGvNKl/MUf71goozcr3riHtnWLHKmdxhvMIwyBqdvGXGuTPjNK5t05mokzc9hFSkgQxcfPwVWc2rVTrG4qNahrEODggKRQE/+DvF7j5H0a025p/9A/y/LN/2cWxwTQEF85ZVEqS937sP1aQwkE1UyHQSYy/toC/nk6gKgow7DSNIQ1muImw7H0vUV26hpMpEfpNoqDD1Pm/gWHadOq7iaf3gyFtmt4SE/pir1mip20O0PZXH3muFBZZZ2AHq03LW35qgUeQ+mSLmXEK2TEK7ihZZwDbymMZLlIYaK2IVUAQtekGVVreCk1viWZ38YnoC/eGwLWLVHIzlHJTFDJjZOwSlpHpLz7ixMcLG7S8FRrdeWrtWfyw3hei6oh8vo+DIW2KmXFK2QkK2TFyziCOVewJexOtFYkKCeIOXlCj5a/Q7C7S6C4QRG2e1JKgdYIUJvn8eOoTFoKgevBkfyEkrlOi3V2m1rzX2yhBJ1TOj5CbKNJdabP64U6qw6xVpuROYIrN70RTD5ZoBenYTXyPqFFFa4W3PIczMJxSdDaqPV7iiLC2ijRNvCgk7rSJu500Ahxo3b2OMzBC3Glvpa4pzcb9FtkBh8kXKyxerhEHCq00t364jJN7KK0q0azcaNCphqzc2MPK0OPEk1JQnW3TWvMRUvDb/9EL+xLbTJzJceLFAn/0f7tLFChKozav/PYwV36wQX7AYuxUllY15OxbZaoLPi99Z4j3/nABAbzxN0eZv97m7NfKrNzrcvujOt/6+1NULwTc+fhXywqSGz2G0TPDNx9cA63JDE9hOlnMXJHu8gMad7+gfOolrHyJJAxSzXt9AStfZuDcG8R+ByuTpzV/i/binSNxH+8F6ZiMfPs8QgpQGne8xOw/+ZDSC5MMvXOG5rVFsjMDrP3oJvVL80z9nVdJvJio0cVfaeIvNyicG6f88jRxy8cqZVj9/nU699eZ+Xtfo3FpDhUnJJ2QYKWJM1LEHSuigpiCH9G9v4EKd0skw7UYevs0VjmDCmOcoTzz//0nzPzdN7nzX/yQqb/zKs2rSyDAX2r0FwaHwUZVsbCUcP9BzNx8QrkkKJcknqeJ49S82/U0f/qXHqWiQEoDreHcWYubt2NW1w72Dg4kTHUco8KAzNg00nZAQ8vrEDcb6Dgmc+ZsGhH4iNSYpds/Jo58kjhgY/4S5dGzBN067drB+XUNadHqLqFQfZZNQ1rk3eHHClPTsHYx2jS7T6ZZbUIKk4H8cUbL56nkj5GxK3uSqAshsWWqtRYyo4yUzuGFdWrt+6zUr1Ft3zsCPeJe7TGo5I8zOfAylfwxbDO3qz1Gj+3HsQqUcpOMxuepd+ZYrH7OevN2Wvw88chQfuL2bEchM8Z45SIDhRPknKE9KfuEMJAyg2VmyLtDDBVP40dN6u1ZlhtXWW/e2rNepBQmm1rt42DZOXK5YfLZUYQ0qdZu73nNvWCbGbLuYMqgZLg0O1tjWCuNkbFwyu6u84rOKGcH3iVjpWZlrTU3qz/aEqbdNkk3rewTt+rErTpCGrgjUxAnBCuL6DAi6bTxVxbYLMm2maISbqwQbuzmA164XOP535lk8sUKV/5kHq32X4xc+bN5xs6VKE1kefcfnuVP/8+XUInGdNIvzslZmI6kOJ7hwu9O8eDjdQxTYrnmvrFw46dz3P28SRSk/StlasatLfskiWJgwuXB5Ra/+e9OkR+wcPMma7MeIzOZXdeKAsX9y03GT2W583EDM1vAzJcIa6s7KvVI20GFaY3LvWCVBljP1Km11mjGhyN+2Q/CMJGmDbpH5SlARSFRHGEVKtjFAaRpk586w8on3yOo9d6VlGSGJskMTdK4dwVZdHBKw3RXZlFPySLjjBQovzJD/fNZEj/EnSjjjpUAgbfcYOFffsb4H7yEXckhLQNvsQFao8KYzt11jIxNdnqA9u1V1n98i8m/9Sr5UyN052ugNZ0HVeqfbplqm1cXyZ8ZIap32fjgzp6CFMAZLmAP5Vh97wbebJVT//5vUnhuHH+pQXaqgjANrHKWqNEl7h7N0qN1KlDf+ZpNp6uo1xXnz1lUa4ogSIPkSkVJu60ZGpK88zWb770X8OHHAdmM4MJ5i88vhzyubsXBhKlS+OtL6DhCJTEq8Pvk5TKTQboZgvm5R5adyhbHqC2nNvJOfYFuYwknO4CQB9cMDWnhR02CsIXpOgghevRvj6d9M6S9Q5hGsU832MC1izyJmdcyMkwMvMTkwMvpBCv2JtPeC0IIsk4F1y71CSgWqp8TJ48hn33kNSUj5fOcHHmXnDt0IM1bILDNLMPFs+ScIRyrxPzGx09dWx4rX2Bm+C0KmbE9hei+7ROCjF3CrbxAMTtBITPK/ZX3d5n2R4pn0zqyrTs8TntNYp9GY44kDnGd8r4RenueqxKi2CMIm8TxznflrbTRicYZ2C0IjoLcsbPEzTpJFFI6+zLdhTtkJ0/RmbuFMEyiVp2o9ehJplMNULHGzpjUF9J3ajqSV/+t40y+OEDkxfjNkPnPq5z79jjF8SyGlUb96kTTWOpSHM3w7j86S3Esy8qNBirWZCsOw6eKhN2Y1oqHEILydJaLfzDF8Oki2YrN5T+eo1mNOPZCoa+5JrEmChTZokUmbxKFCd1GRGM14I2/Ocr1D2qPfH0TZ3LMfrkV2OQMjBJ3W7gj06goQAUeuenTdObvolWCXR4iatWRhokwLRKvTXbyFLWgg99ZwJ4YxG4ZqCjCGRghbG4gLQdp2gTVlbTG7gHQXryzw8ybGz9BfuIktVuf4cYhwjBSq48QO+c9LVBJRBIFhI11wsY6UaeBSp4eeYqOVLogW24QtXzm/ruP8Fea2OUscctP/fmx6itEK395lcxkGWekwMzffZO7/+UP0UojzLTd0jbQieq/p3D9cOUdN6ES1Y8wBzAcExXGtG+vUnn9OJ27axg5ByNjE9WOxnGuFHz4UUCjoWg0FCtrir/6gY/jCO7ej6nVFVIIlpYSFpYSPvwoZKOa8MWVlDs8jp9mAJIQOAMjlC+8QfPmJWR5mCQOSTotdBRhuBkyp8+SNJt0mnunlEyd+3ZfmELqdyoOnyAK2tSWru15zsOQ0kRrTdNbJOempXwMaZF3Hl/Wx5A2WXfruG5YJU48pBg80L33gmm4TA29xszQm3tqf5vYKi4u9jxGCknOHeb4yNsY0mJ2/aMjC9ShwinOjn8H194/qEbrNApVyp2CXwhBzh3k5Og30Dp+qsJ0euh1Toy888h2ASQqRgpjH80+bd+x4a9hmzluzP/FDj9v1q4QHbDfhDAwTQfbyuG6hwtAihOPjcZtBALD2OnayE4WcUpuqv31TGpPAqc4SGf2Vi+hVZGbPouOw170qHGwxaiG699b5PZPVgh7VGpJpLj53jJ3P1hFa+hWA+JI8eDjdSw3HRd+OzXz1+Y7/OS/vJEKV6XxmxF+K+JH//l1pCFIIsXd91dQiaaz4XP5j+cwbIMkUjRXPForXZ57s8y/+b89QbcZc+P9GuuzPt/8+5PEkeLKDzbwWjFX3qvy7/xfnuP//r+6RH7A4rU/GGHqfJ6ZF1LSktOvlzj+YpH2Rsj9S6lZfnMBL00Ladlp2l0cptHPgUfp3KuowMMqlEm8NkF1lbjbIvHahM0q0nIwnAx2eQidJLTuX8OwXXJTp9Jyf0GX8IDC9GEkgYddGqJ4/AJWNk93tY5OYuq3Pmfwwtd7zjxY+vBP8NcWCIanKJ1MXVi1m5+COnzh9f0QrLdYf/8OpRene1Skigf/3w/2PlgIjv3bbyEdE2FKgo02cTekfXuVkW89R/niFIkfs/bjW+hNCrMDuF6kazLzv3iLwrkxVJhKqOrHD+g+qDLx+y8iDEnU8ml8uYgzlGfyb73Kzf/4Lxn82kkM1yKqH71gyPqG4qc/2+LpvnLtYReW5pPPQ4Q8umX9YAFIdjrggo20GLCZyWJYNgkQt5o0Pnx/92rrIVjuThYfISS2WzxUCafNSbbemWO8cpFNB45t5bHNPGG89+pIIMjYFUy5lSTf8deIkwApjSPppVKYjJbOc2z461iGu2Py11rjh3VWGtfYaN3Dj5okSZiaVe0CldwxRsvnyTlD/fOEENhmjpnhtwjjLovVSwcKqtoOx8pzbur39hRYUeyz1rzBSv06XrBBrCIMaeLaJSr544yWzpF1BtMallaO0xPf2aV1HRVj5QucGvsWlrFTW9Na0ewusda8Sa0zSxC1UCpJcyWtApXcDCOl5yhmJ3b0r2W4TA68TBR1ubPywx3XHMgdQwq5Z/CUHzVZbabF2aU0yWaGkNIiCFtIaR7QRywo5sbJZYaxzCxB2GKlurWADOseSaeXIvSEghQgqK1SPvcqYaOaTs5ulrDTxBkY6e0/mImyU91pLtQKqg92fy/1hd0Tloo0G/d3H7vX+WE3Yf3e7u1/8f+cxbIlSOjWIlbudrn3RRO07kXrwtKtNv/5/+YynXqMlPDDP1zAsAReKwENCzc6CAFxoPA7vYjL0gBOZYiwsZ4G7AiBShKENDBzBRKvi7QMgtoGhm0Te52UDjVOKVEzo9Mp6YxlE/sNCseeI6hvpMcEPio42Dew9vl7u9jL/Noqc9//b1P3gQadRKA1rdlrdFfub+vfCBVFrF36EdLoxaGEPk8SGxA1PBb/9RfoXvqJjhVr792g+vN7WxYCP6T68X2Ekc7ba+9dT9dsQcTcP/uor6WqIEGYNu276/hLDcxKmaTVIaylC5pb/8n3iNu7zdEr3/0SrXTfxKuCmIU/+rR/v8SPSLyQ9Z/epvbpA5ACFSYknYCuF/Ll//FfEdW7+MuNNG85ejIX2OOMT5rdUfaHwQF9punkkB2f6QnWLPreNYTtgEqQrou07ZQB6YvPd5w7ee47FCpT2E6Bc1//B/3thuUiEMxe++6BGyt6ntL6Nh9VGoTkknUq+wtTYVDIjvYn5DS/dINYBYcyy25H3h3h5Ng3dghSrTUaxYPVn3Fv9ackqpcjuO2j6AQb1NoPuL/6PtNDr3Nq7JtIkbLmbAZUnRh9m7a/Sr1zOGf7qbHf3EWVqLWm5S1zY/G7NDoLPX/i9vZUqbbvM7/+CSdG32G8chFD2ljSxbJ3+/0Oi5w7zJnx72AZmR39FMZt7q++z2L1C2IV7PJXemGNRmeehepnTA6+yrHht3ZcQwqTmeE3qXbuU2tv+WpyzsAujXsTLX+1L0yDsEnXr1Kt38F1SocIttK0usv4YQulIgzDeng35fMjaKWoffnk9Uzbc7cQ0kArRWfx7g7GKqCfy/irDq8ZszMOUxMFO83TKoHGSrpNKeg2di4m43D3TBdsLLNWW0U/lLxcvfKzlJ94YyXVVlWP/as3zjrzd0DrtJC9EAidjsvNY/2V9Ns7aP/uaQrWiri7O89Wq4TY2z1XqdBH8XQWsChN8pCPUYVxqhFu3xZs/U68rW8gqm+9LWGYZE6fJXPsBHG9hk4ShNMiannoMCRq7MPe5j30TWn2PHavdqE04UZqGXv4OX5VcTBhmsR0Zu+gowi7NEDj6idEzTr22BjSzZA5eRoV+Mg9onmXbv2IzuAJ8gMz1JfTwrUaUElEuzaP1zr4hJP6/wRtf5U4CbHMdLI3DZesXdlX+EhhUHC38t7SAuAbJCo6El+kabjMDL+Fa5V2aExKJ1yb+xOWal88Iq1Eo7Um0SH3V9+n1V3mpRP/0z5FohAC1yozM/TmoYqUl7JTTAy8uEtDbvur3Fj4LrXOfnlcaXv8qMGNhXRhMzHwUl/A74Wzr+Q4/1oGrcF2Jf/8P9v7HQohOTX2Gzj2llVCa00Qtbi19H2Wal888pk0ijDucH/1fbRWnBh5G7O3eBFCYBoOp8a+ySd3/rAvjOeqnzFf/ewAbEyCdmsRjSKKDm/Otq0c7e7yLnN8/lgFb6WFmbX2jW49FDb5mkmv9WTUAr+G0DoVpA+rHcmW+VEnqv/39vOAvk2v36+9Y/VTCAT8dYLyfaLqBvbYON0b10AKhGGifwFsRH9dcMAokDRMrzN/l87c7X4JsHB5KeXprNeQlrWnyVYlEfXVmzRW77B8b3dh5cNga3LXNLxFhgon04cwXDLbyBh2nSeNHeQOXtggjI5ufy+4I4yVn39IcCnurf6E5frVQzEqVdv3ubHwF5yf+v2+RiWEYKR8nsXaF6w3N2nOHo2Z4Td6OZpbiBOf+Y1PqXdm9zlrJ5SOubX4V+Qzo5Sz+3Np3vysQ7Eiuf1Fl4tvF3az+fQwWDhFKTvV1/41GqUjFquXHitIt0PrhIWNTynnJhkqnt0qMSwkeWeY4eJZVhvXSXSM0vGB+t91y2TdQVrtRRIVotTBTeoCSc4dRKmIMOoSJ1ur7fq1FcyMRfHs0DOJ9xXDHh4DFGaxTPfOzV92c35toZOYcHUZaVkEC3PYo2OE62sHNoH/jwUHEqZmLk924gRhfYOwuUH5/Gu07l4latYw8kWKb7yFPzeL6naIqht7XuPu5//iqTa80ZnrC1NDWrhWaV/yBsvMkrHL/d9+WCdMjiZMpTCYGnp9lymx5a2wXLtyaBIGjWKteZOR9jmGi2e33UcyPfga9c4scfLo8HjHKjCQP7HzulrT6C5Sbd09lHCPVcDs2ocUZ8aQ7K+drs6HvPMHZQJP7SlIpTAYLZ3HMbcxXGnoBnVm139+4PZsIko8VurXKWWnegxYKUzDYaR4ltXGDVabN3aZ1fe9XtTBLZ/CNF0SFbFRfQSrzEPQKKLYo1yYoeOt02hvWUSccobGnQ2a92qPuMIvH1IYmNLpp0gJ5DYzvEpzonVEoiJi5T99yk3AECaWkcEQdi8eYpOwQ6F0RKxCoiRA71On0x4ZTX2djdqBOKoFAlOmBb+3P7PWCqVjwsQjUr9OAkJgCisljpEWhjD71j1Nqs0rnZDoiEgFJOoRWqbWxK0mQgg6N6/tKo6wF6QwsaTTJ67ZzCxICVkiwsQj+YqKCGze25TOtrGVju1ExylxjvKfSiriJh4vTIXAzBVxh8Yxc0XsyhCGmwOtMXJ5zHKZcG2VaH0NFe4/6SdRgJOtIB+Kfgz9Bkl0+AG83aSbBs2kdUq98OFJTFDMjO1IEemGNcIjmPYgLeE2VDy9Y5vWiqXaFYLoaDykUeyzsHGJgfwJDLnlgxsonCBjV2h5j86HHSqcwTTsHYIvURGN7gKdYO/FzaOw3rxFELV3LEAehpOVBF2NaYs9zZl5d4R8ZmTHokNrxUr9yyNHCVfbd4ni7o7IaSlNcpkRXKuAFzZwrSIDuWMIIQmiNu1gfXfjAKViavU7GIaNOrTfUSClnbJ4PeRzt4ouxVODJN2I5r0nK692oJYYZs8idIBoSmGQMUu4ZoG8PUjBGSFrVciYxVSw9qLlEx0RJz7duEEnqlH3FmiFa3Sj2oEnH8fIU3CGMEQ6njtRjXa43m9HwR6m4k5RyUyRt4dwzFyP3zlJiU3iFs1glbq/SM1fwIsau0z3cb2GcBySduuxgjRnDVB0RqhkpijYQ2SsEqZMyVTiJCBI2mx052gEi499xjDxqPm7yWayVoWcNYDcnLhRNPxlguRw4z1jFsnbQzvGVtWbJ1IHY/8xhEXWKpO1yhTsYfLOMFmrjGPkeoLNINEJSkUESYduVKcZrNLoEYjsaq+U2KNjuBPThGsrJN0uiv2FqSEs8vYgZXeCsjtOzh7CNXMYwkYISZh4dMMaG94DOmH1kS4ZjaIT1uhEB/uWDGGRswd6956gYA/jmHlMaaO1TsdW0qEVrFH3F6j7S3TCjUMXVt8LjxemWhN3WvjrSykTUhzRfnCDuNvGLJcRhkHSbmGWK6hul7i290OXx55jYPwCaIXl5EmSEK0Slu++T6e+eOiGN7vLaYRsTzjbZh7XLu4SpptFxDehVIIX1o+cejJYOIll7AzMCaI2LW+J5IiMQRpFJ1in469TzI73txvSYrh4tkd7uP9kUc5P94jXtxDGbZrd3cWGD4JERVRb95gcfGXfY6QUrC4EjEzZe7oGi9mJ3cFQKNYaRzfHBVEbP2r20qJ2Rvfm3GGkMJkaeAXXKqJ0jBSSuepn1PY0c0scp4gUJnFy+NWxJsEPm7s0tqDmUTo9iFb6UMJUGCaZgfE+M463Pk8SPHryFNLAyhSIvNaWX3XvIyk5YwxkphnITFN0RrGN7N5WB5FWMbGNDFm7wqA+xlThBer+IgutL1nr3DmQ9lbOTPDc4DfJWmUA5puXubL6F5jSZqLwPJOFCxSd0V150KaQmNLCNfOU3HHGC+eperPMNS6x4c3usDyZxRJGJkv4iGx6gcFo/gyThQtUMlOYcndch21msc0sBWcEeO2Rz6W1purN8dHiP921bzR3mpOVr2P14h9iFXJp+V+z1r3zyGs+jMHscc4MvItj5vr3/HDhn1D3H01wIxAMZU9ScSf6i5SH56pNmEKCtHrPPcxI7jRB0mGtc4f55mWawfKOsa3DgLjbRsXRI/3JjpFjvPA84/nzFJyhPQM8XTOPa+YZyE4/ti9iFXCv9nPu1B7vInTNImP5s717D+++twBDmjhmjqIzwnjhHA1/iZX2LRbbXxImh6cq3I4DmXkTv0PcbeOOTKLCACOTJ6ytEW2so5MEnSQor4s1NLyvuWXquW+zPn+JOOwyPPMq1aWr5MrjSGntccfHI0582sFaX1A6Vm7vot9CUN4mTMO4gx/uXuUeFA+bUwHa/mqP5m4bDpljGMVdmt7SDmEKqXZ6b+Un+5rZBJK8O7TLXxrF3mNZoR6FRnd+X2FarJhkCxLTFmSyxh5VugxyziCWuZUKo7UmSryepnh0eGEdrdWOSdiQNhm7hGNkkcJkduNjoqTLYP4kx4e+tqcwtawMGTdtozQsWu2FAzMgaZ3QaM9jm9ld5n675FK/uYZODm8WFaaJUxklatXwpUl+8jTSdumuzGJli5huDgR0V2dJAg+nMoqdLxMvdtFJTGHmPFIaeLUVwsbOlJnR3GlmSq9gSHtf0/2ebRICQ1gMZGbIWmVMabHQvHpo81zZnUAKgxPlN5guvYRtHIyT25Q2w9mTuEYeVU2oduf6365O4jSTwN2bIEMgmCm9wony67jW9iA4RZB0CZI2SicYwsQ1i1jSPVTf/CriePlVBjLHDv0cQghcM89U8SI5e4Dr69+n2WPmQiniZgNhWgjDSKkz94AlM5yovMlE4QL2tjQ4pRO8uEmUeGg0lnBwreKeC5ujImtVOFF5k9HcmR33fhSkMFJLhTNC3hnkdvVn+PHRKSoPWBzcwsxkierrBI10ta2iNDE69/xFpG2n5aBIg5L2gpsbYPX+z7GcHKXhU6zPf45pZ3flnx4UGt0r7J0KSsvM9oTpTj3JkDb5zFbR5CBu4UdH77BSdmLXNj9sEPVWNfZwgcFvnkcFEa0vFwhWGpRePkaw0aJzfX9NMVYhXrDbz1bMjCGlQbJPJrFjF7CM7A4Sp74544hmZ4C2v8Ym0cTDGD/h4LUVg+MWUbxbaNhGBscq7FoZdoPqE0dJRslu/52UJpaZBZnQCdZpdBfQKIKozcmRd/e8jlIRYdjGcUp0vbUDMyAJBMMD59A69ddGcZd2N510iqcHKRwrY+Vt4m5E887BTew6ifGrKxhOlrBVxR0YRUiDsFmlcvY1VBQStqroJCI/eZrG3cvoJMLM5BGGiVscxM5XaC/dIQkeNsFpGsEKiY4wRao1aa0Jky7NYJVuVMOPW8QqTHN8jSxFZ5TB7AwCox897ZpFposv0QrW9zRzPgpZq8zJylvMlF7BMlw0mjDuUvPnaYcb/RgG28hScsYYzMz0awwLISk4IxwvvUE3rOHFaX5j4nkgZDrB74Hh3ClOVt7ANrY0vG5UZ6F5hXqw2E/JEkJiSZdyZoLp4su42/z8sQrpRnX8uEkQt/Hj9paQ+RWDRrPRnWUwe7y/TemYblinFa7TjWpEyk9zzIVFxipQdicoOVtuMCEkFXeKU5W3+Xz5f0CjEJaFCkKi6gZmuYI0rV1GUYFkonCeycLFvmautWK9+4Cl1jW6cY1EpUXhpTBxzDwjuVOM5s72jwcIE59uVO33tRc3qHqPThG0jRynBr7OaO4s5jblzI/b1Lx52uF635pi98Z22Z3oC93UWnIBU7pcWf0z4kf5jh+BA9IJxmjAHZlMJzKtidspm4d35ybCtNBxTNzZf/IOvAZOtkISp4nVhYFj2G6BKDjqhK9pdOZh+C0gXWW4dgnLcPuCDSCfGcHYtgIKohZ+eHBS8+0QvXs8jCBu9YOEhn7zeRqfPyBu+wz/1gus/fllii/N0Pxilo5Y2tdaq1SEHzVROtkhhAxp41hFuvv4Ph0zFVrbU3w2BclhSR+2wwvr++4TAiZOOFRGzDQR/yFYZmaHVrqJYmacr539h0duE9AT0juHrUBiSBulAjJ2mXJ2qp+LaUqLSm4mXWAkAe1NHtwkxjAcDMPaxlD1eGig460TRt2en3qbL36xSaPgUD43QrBP7t1BYeXLeOuL+NUlhl54h6C2StSpo+KYQiWNTE/NwGltX7tQIeo2tvheH8J69x6tcAND2qx377LavkMzXCVWAYmKUDrpaXwCKSSmdMjbQ5wf+jY5ewDoMVDZQwxlj9MK1w5VyUcgOVZ6DctwSFTMevceD+qf0ImqxHrLdLgZGFVyxlIzca/+sBCSgcw0ZXcSv91Go7DKAzQ/+/nOHNMeDGFxovwmtrHlX/fiBjfW32PDe0CyR6BgPVii6a9wYeR3+gJV6YT79Y+oenMkKkbp5Im+q68aC60rTJdfQSBYad9gvXufTlQjUSGJjlBa9etBbwaAjebOcLz8et+sLIRgKHuCgcw0G/4s1uAwRjaHPTyCzGTwH9wnqu60MNlGluPlN3YIxqX2de7WPtzbLxoIGv4SYdJlpvRKX0tNVMiXq98lTDyUjnsBUvv3txQGE4XnGcud7cebKJ2w2LrKXOPz/iJx8/4SA1PaFJ1RTg58rb+QEEiGsyc5NfA2N9bfO1LfHyw1RmnidpM4k8PMpINsk+0o8TzKX3+NuFEnbjbpXN27DNPizffSCMGwS6e+xNk3/x6dxgLr858fqeEAje5if2AAuHYJ28zuEKbbUzy0Vvhha7dJ9oBwzPwucypAlAT9D8weKdK9t5YSMBSzGHkHnSikbWJV8kTV/e+dqAilYuS2lbYQafWX/YSpYdi7CgxorXakaxwFUbx/gMHtL7rcu9plP8IroxdFtx2beaEPm7GfBtJC8ZJQhYxXLjJY2DLFh4nHuYnfBtLxcnXhTwHQOqbeuIdh2FRKx1lbv8rBBKqm46VBTUrHOyaPuBthl1we/PFVRt85/kR5pp2le1ROv0z55EXaC7ew8xUqZ19HhT7thdtI2yU/eZr85BlUHNNZusPo67+NUxqiuzJLZ/nejuslOuLGxnskKkyjKFW0r6tD6VQjC+I2X6z8Ka9P/J0+e5UUkpIzjm1kDidMhcAyHJROWO/e5era9wiS7q4OUjrp3buD0ooXR3+/38eGNBnJnWGte7d/78LFV4kbVdrXv9xxnZI73l8EQPptrbRvsda9u+9zJyqk6s0z17jEmcF3ALCkS8WdZK1z969FpG+QdLm0/K/w4w5RTyDt5SLSOtVaI+Uz17yEIU1OlN/sC6S0r0+z4T0gWlsldhyCpQWkYyMzWYTtoLcFnA5mZ3DNLStjJ6yx2LrWDzrbDU2QtFlsXaXsTjCQSf2nrplnMHuM+/WPD/S8eXuQk5WtdmuteVD/lPv1jwmSPYgxSIiTkKDbIUg6XBz5XXJ2yvwmMRjPn2O5dYNGcPh4kwNqpgn+2kLK0BGFO8o+Gdks4coyRj6PzGb39ZluLFxh88NZufsB63OfoJVKNdUjIko8ukGVnJvy67pWKTX3bRM824OP4iTAC2tH9peaezjz0zSCLaNH0gmwihniToDMWBQuTKH8CHdygGCl+UhhqrVK8x2NnYLIkvv7AExp7Sae0LpnUjk6NOk1TGO3XyOONHG0v5QwpHVkX/jRIZjd+Ji56qf7H7JtXJpmhoHKaZrteZZXP+fgUk9Qyk+Rz45imRn8sMHy+lbOrIoUM79/DivvMPO751j68d3HEtFvIgm6NB9c7bdz5bP3eqkbCcMXv8HG1Z8Rtav9fO76nUupuVenaQ7zP/4XCCH3pehsHdI8qdG0wjXmm1c4UXmjvz3vDGLJw7NjpablDtfWf/DYCFeNohEssdq5yWTxYn972R3DECYxAa0vP0cYJua2YuibqLiTvXSM9NuIVchq5/Zjv/1Eh2x4Dzih3sDs+ZeHc6e5V//4r4UwBU3dP5wgiFXAaucug5njVDJb8+WmgAPIzBzH7TEgkSRYpQrdu7f7AnUoc3yHn7YVrj5CkG6hHa7TDtb7PnUQTBVePJAwFUhmSq/258c0OGyWhdaVPQXpdmg0jWCZueYXnBl8B1M4fQa6yeJFGmtfkTAV0iB37DkGX/kGtS8+wMyXaN25QtSsES4vYY+MISyL4PatPQWpEAaG5ZAtjSMNm9BrEHTWSeInq5eptaLlLfWFacYuYfdMFZvYLkxT4Xv0/D+5R6WTNCdua/Ja++5lJv/+OwghaHz6AHsgz9w//jGlV0/0Ky7sh/1MSHvdd2vf7oAS3dOanhRax8DhgwQ2fWw7r/ULYjDoUToCO8z7kK5KN2VmHHs9ISqwTJcoPqgmr2m05/GCekon+NC78dc75CaKhA2P2T+9fqT2b/2d9H/6tRVU6O0UlFrv9EErdeSF4n5QOmG1c4fj5df779SSmV2m9oNAo3nQ+Bw/PpibJUp8Nrw5JgovbFmfzGK6qB2p4E5MISwLaVpUf7LTvO2axV3sZAdNr4hVgB83ydtpYQzHyOEYObrRr3bu8JOgE27QiWqU3Ykdfb2JxOsSbaxjj47RvXm9x4Bk9D4nQaYXtb0JP27vsBA+Cl7cJFER0kj981m7jCUzj00Fso0M4/nn+u1VOmGte492ePBYhaX2dY6XX++l7aTaacWdwDUL+PHhXJAHE6Y9msD2/WuoKECQclgiJUahSPfubcSdW8jMbg1KGhajJ77G2MmvIaSZUuUIQbexzOKtH9HcuL83fc4BoHVC01tmrPJC+jCGg2MVEcJA6wTXLu5I8I9iDy94gty/Pdoptv0XwF+oce8//QsG3jmLsEwW/7s0pLvxyb1d5+6+lthlsu3d+FGNeux1j4qjy79eBemHEMbdfYOipGkBOi07tc99hRBpncrNSiG2gwp8EhURRE0quSkcM896KzUDvnPmH/ZzSDWKpfqX3F37KVJaadCSlUMIyfDgeR7M/YiD9qUUBoPlU0hh0O6u7XAbZMcLdBYbWAX36dAJ9tCaOzipxNNFao6LVdBPszCkuS//8b5X0ekCb7l18AWGRhHEHSIVYPfuLYTAki6dpfm0NJ3XxSzujmOwDJudY1A/mpTgobZut+xs8n9v8iL/OiLREWHcRusE0VsomdLqWTpiwrVVhGHiz93HGZ/cxYD0cAqO1smBc5ITvclhvgXbeLwwHc+f37Fg7kRVmsGj0wgfRph0aAUrPR95j6ZUOhTska9GmG7WCLRLQ0jTRiuFCkPMYonS199FRzHK6/bJG7ZjYOIFhqZe4sGVP6OxdockDsjkBhk5/gYjx14n9Fv47aMV51Va0fKWd6RK5JxBTOkQJV1KO/ylafSiF9WPdC9gz6AFIYzd+Uwaqj+9iT10uEhlIeSeK/4k2V+DV0m0h9YnjqQ57GrPIWrNbscmg87DWK5d4cbiX+zabmRyOENjaK3wFu6n71KmbDha6XQFHEcIw6T0/Ku0566i4pjyxTeoX/+wTxZybPDNtExf72PSWnNl4Y9JVEwxO85Qfosxy3GK5HJpIM9epuxHoje5JiretfZp3NlASEHhuPFrQyeotSJW4Y4JU2Jy2NVCJ6ziHTL1IGXLCWHbvS3pYBbKIDRmsYxZKKXmx21Idk3kae3j5AA1QqWQO8hTgJ6P+dcbiY5QqB1RIQYmsYiQlkXcrKOjiHBlmaTb2bHafjhISPbmxeQAitKm0N6Og0TUDmRmdvz24+aR5vdWuMFQ7mR/6WVKm7w9eOj84AMGICm8pVkS38MuDeKvLRB3WzjlSYL5WTAshICosdsMMjT1Eou3f0J18Us2Pzyvvcby3Q+YOPtNssWRIwtT0CnPbtzB6eWRZZ2BNGUh6fZMvJsmgJhuUD0ysQKkmtXD2IyKE8idJjYN4drhVjZSGBh7CMFHUR+mkWo7P/PNoulPAoHEEEfLA1M62pNW0Tb3zi10hsexSgOEvXJi2ZlTKU2c1yXx2liFcprX3KihklSoqm4brWKEYQI9v/tDku3Bxkc0eost28z1FxhR3E1JHWRKcRYEDQ4jFLROaHWXkcLaNZ7cgRyNO+t0l46elvSriIdTmo6SjZlqDYe8L2qXhiOFgTs1g4ojhGEgHRd/bqflx4sa6YKut9CVwiBvDz02zQLAMjI4xs70mHCPYKlfN2it93bTSQN7dBx3agatFHGtmpan8zdL1Gk6YY2Ss8V/7ph5bCOD9xhXnhAGrlncEUAUJT6hejRdoRQGJXdsR9vDxOsFtR0OD/vvpTD2nasehccKU2FaZMdm6CzcBa2QtkNm/BhJ6BNtbPRNwMAuPxmAnSnRbSylWs629xSHXZIowLAOlmC7HxIV0vbX+sI05w72K7CUc1M7j/OeLD8sij1i5e+qy2mZGaS0SA4R3fgwBALTcHf5RzcruuyHWAW7zM9CyDQQ6wlgGc7eFucDIE6CPfmEXXsPUg0gWE/Hh1WsEKwskjt2BhWHsL6Cmc3jDI8BYs/F2nZ0gyqjpXMM5o9T68wyu/ERUlgUMsOMlp7bQWIhpU0+N0rXqx6i/BrQq5+bVi3arcEYtkHpzBDKj6ld+9XMR9yExMA2U3+gZbgYwk5NuMJEItKUAWFgG5l9mXQOA2/bOBa2gz04jLBSDTdcWUQFB/1+BN27t5COg5kvEO4hpKveXEpSQfp+TGkzmjtLw1/e08K0CVPajORO7YjSTlM4niw6/pcJUzp9v68pbaS0MISFFLKfFiKEpJLZzaQGPctEvUroZpCOg05iVLTTNLvevcNE4Vz/d9EZpeiM4sftR/rxi/YwRWd0h3VvvXv/sQQqtpHbRc6QtwY5Xn79sf3xMEpOOr9sQgjZz8c+DB4rTKVlk50+hbe6gDM8AVLglEfwV+YIG1X8B4/2BQppMP38b6F2mSoFudI4/u0nY8RJVETLW2WwR3rvmAUcM09gZsk6W6HxcRLS9p+0vqSm5a0ykD+2Y6tjFXv5c0cXplLauHZpl7kjjDuP5BH2w8aulbtA9th5rEMKii24j+DlfRzCuLtnak3WGcSQ9i7flbQc0JrM+DSdezdIwoDE65B02jgj4xhuNvXPu1ns0iAkCXpBY1eGcUcn6czeBqWod+fJ2hUmyy8xVrpAokKkNDGljRfWWdhWqUbrBKViHLuQ9l/roCQEuu9WSJIQ9dBHHzZ9Kpv1TH8lhamg1EtaLzgjPUGa6ZHe9wRpf5IV2ybbJ2cG2hENqxUyk0FaNsKy0gIZBxamoAKf3JlzCMsirteINnZatxr+EnV/keHsyV7qlMlo/gzduM5i8+qe/jhLukyVXmI8f76/LVERy+0bf00iebdgSJtKj582Zw1gG9leUQGrv2DafK+bwlSwO3AQSLVVIXFGx9BKEXpdwpUldLQ1t2x0Z2kGqxSdlCAnYxaZKb1CrEKq3tweAlVQsIc4Vn6tH+gFqRVgtvnZY5/PeYhBSwhBOTNBObObVOewSPPWD2/ZOxA3r5AG5XOvgJQ0bl6i/NwrHNTQM/vlX2Dae2ufjbXbtDbuH6K5u5GoaIeQlNJIuVsFSGH1UgtSRqC2/2SCG1KC/YeFadapYBkZ/OhoZBCQBk/lnMFd25ve0iNXaWlQT5uMXel/CGlOp0vGKh6J6B5SovqjGfNSDf5hAorNPNNCZnRX3dnE7xI2BLXPPyAJPJpXP0WrBBWFRK0awrRIuh1UFNK8fildGfse9S9+TuJ1+6apKPFYrH9B3Zsn5wz1fOceftSiG1QJegEFQhhYZoYo6iKEgR/UD/F0AtOw6XrrFPMTqGjnpJwZyRN1QqRlPNUApKeBojPKVPFFyu4ErpnHkpmnIiQPiu0aoY4ioo01nPHJlMHoCEGIcbeNOznTZ197+F53qu9Tckb7xA2Okedk+S0GM8do+Et4cYOkxwaUtStUeguMTapDrRUrnVusd+/9ShM17IRgKHucqeLFPsm70ZsHj3xFKZGuS9yoYxZLxI16WlxgG8Kkw93aB7ww/G9gGk5P053ivJmn4S/RDFYIki5aJ1gyQ94ZouJOkLMH+4QNSivu1T6keQCl5yipWYfBkepcP+6AJPBoXPsEuzKMv75M0m3jry89loR7E/XlazxqUj4oH+r+5ycpnV/s9Vl38u4IlpndKruDouNvHDia71FYb97m5OhOirq8O4JjF2k9geZrm9kdaTyb2HhsCTVNp8dRvN1EY5tZ8pnRIwvTUm53Ww4KjaLtrxHGnR18yUJIxsoXdglTFfg7IgOjxlbEtfJ3jrOwuqXtBXvkgkWJT6O7SNNbTv3Yene6iBCyF8lrgBAMD12g3TlYFKBAUMhO0OjM49rlXrTwltRsz9excjbFM4erZyqE0a/J6wXVR34XR4kqHcs9x8mBr/Wqmhi7JtdEJ4RxmyDpECU+iQp7JdhipDAYL5x7Yi7VhwPldJIgTQvl+zu0nAMjitLi3vtML41ghcurf8bFkd/HMVNif8fMMWScYCAzlbI+6ZQpS0pzh9BJ0yzucq/2c7xDRnX+MrFJ2WgbmT1J5mMV4sctosRL37OO+qX2Ss4YJXds13laKcK1FXQcYScTqD3elUaz1rnPLeOnnB54B8twen7qQbJWmZHc6b4FTQjZt4Js5QFH3Kt9yFzz0oHSux6VLvjLwoE006C6SlBf71el7yzc7f/9+NOfbt7bXohiDy+sbQnTzDAZVd4Spjqh5R2tgsrDaHnLdPz1XuWSFIa0KeemD1R7dC8IYVDIjO2iKkxUzHrjFo+blWvtOcbKF5FsF6Y5iplxVupXj9SeoeKZQ5+3HY3uIn7Y3ClMkQwVz2Cv/IQwPhoL1UGxlxDdhFIRrfYCm7NwIT+epgAcIJRfo/HCGuX8NNXm3R7TU/p+MmN5Rt86xurHc8z+ycFTQIQwqBSP4zplGq1ZbDNHFHtImdbnde0KSsX4YZ18dphy4Rhrtc1UGUEYtjBMJ11AIuj6G2wfMyO5U5wefJucNdifvFJSjoiVzi1W27dpBstEKkj3aPrnazRZq8xw7uRTJSYHMLI5hG1j2DbCceARJRz3gjkwROPTD8lMH9/nCM169wE/X/xvOTvwDUZyp3oR8xK5j09sM+p/rnmJucalXnDKL9a8sGl2PSxOVb7GycrXdpgoNZp2uMFK+ybr3Xt0o3pPqOlti5t0aXaq8rXUTCt2MrBJJ4OOY4LFRcLl5T3pGyElvJhvfoEXtzhd+RoFZ6RnYjd2sLpth9aaZrDCndoHbHT3pnncCw9H+yYqYqH1JXPNL/Y54zDQR6oqdnDxvr0DDyhIf1GIEp9uUKPYI6EvZMZT8/RmJK9K81GfBpSKWahe4sz4t3eYVScqL7Jc/5K2d3jt1DazTA++tkNb0Oi0rugBhM5a8yZn1d9ICx5v1vkUJqXcJHl35NDVY4YKp48UzbYdHX+NZneJQmZsi9hAgGPlOTH6DjcWdqfI/KJgmhmGB8+TzaRm9VZ7+RAE/Jpme4Fme3c5rNLpIR78yTXGv3GC5t2D5zMb0iKfHWFu+edonTBUfg4vqJLLDJGoiKw7SKu7jB/WkdLGNFzy2VEMwybjVFir3mBs+CUs06HrVbG7eerN+wC4RoHJwgs7BanWNPwlLq/+GZ2oxuOExVdl4ozbrZRq07L3ZW16FHQSU3rlTYRlpbnrd2+ho4etTxovqlP15hjKHkciUKTpNpK0aHTco1hshatUvTnWOrcJkpT3+JeBlGv7cMK05IxxvPJmP2I9dW2FzDUvcb/+US+A6nHvWe0+QkqcqWm07xNtpG4yFQboeD+BGtEOVmlHG+SdIdCSpKf5bi7GosTHT9o0/CXWunep+wuHJpd/mBBCCEmiQlpHiBh/WvjV05WPgFSYVvs8vZvkB5v+UtVLZXga0CiWa5eZHnptR/FsxyowM/Qmtxb/iugQ4dlSWIxXLvYXAptQKmG++umBUnnixGe9eYuJgZf724QQFDPjDBfP0A2qB54QTWlzYvTtHSaYo2K5foXBwkmyzkD/vRjSYrR0nkZnnpXGtSeyXGwGyBw0OXwTceyxtPII2sEjwt/oMPGbp7CyFsf+zfM8+FcHswpoNEolmIbTs2zoNH9Z2nS8dbLuEKX8NPXmA8KwhR+2UComSUKiqItlZUgSnyjqUG89wLa30jrKmQmKztiOd9mJqny8+M+ID1FGTR5BU3oslMKfu49VGTi0h0pISef6lZROsFwhXNnb8iSFwdnB3+BYKa1TGiQd7tc/Yq5x6cBa0C8aaYDQ4fp7uvTyLjP1cvsat6s/PfC3L4Xc8z1I08I5d5Kk0wYN3t3b+/Z3zqrw3NBvMpxNA0KbwQpX179Hw1/maS5Ogl45t832CiF7BA6/vECFXwthmqigV+cyZe94WAh0w9qhBNzjEMZdHqz+jDMT3+mbVIQQTA2+Qhi1mFv/+EAapWVkGCmd4/TYb+7USrVipX61twA42MCY2/iEkdK5HdVaTMNhYvAVumGNtcbNx35UlpHhxOi7FNzRpxKYUu/Msdq4zszQG8htWrNrFzk9/ptIabLWuEmUpLlqB4EUBoa0e8FMY2TsCg/WPnjitj4N1K+tUb92+JzpJAlptOeYGHmVVmeRMO5QzE+ScSt0/XWi2Ou7ALRWmKZNFJtpHVe3zPL6FQI3neiUikh6xc4Fkpw9sKOkmEZza+PHhxSkxlM38UJq5s3MHEcnah/mr/1hD41ij4+neaaWs+/kPlW4yLFSavWJk4CF5mUe1D9D7yoi9uTQ2/67icN+RgKZ0jUewidoSIuBzFTfEqfR+HGL+eblQ1kVDGnvQUCjCddW8efuk7QfPaeZ0mGm9AojuVNASnZ/ff0HNA7JFXwQhEkbP271i88LBI6RwzXy+Mkvx8f9ixGmAgxLkoRfnXk4iFr4UYus8zDpda9U21OE0jErjWuUc9OMlM7toFY7MfouWXeI+fWP+4QSSkU9r0Qaom+bGRyryPjARSYHXt5xvtaatr/G/PrHhPGjycC3o9ldZH7jE46PvL3D35JzBjg99i0sI0Ot/YAgapFsI3qQwsQyM2TtCuOVi4xWLmAYNlqrfYnuD4MHax+Qd4cZKp7u9UD6wWedAc5O/Bbl3Axrjet4vZqwSiW9iS4N2ZdCIqWFKW1M0yXnDFLIjFPJHyPnDFLvzB1SmIpeAI7s+88EW7+FkGTtgT1D4x2rSN4d7gWuqF45q94/kv7fabrMYVbHmlZniVZnic2VdbO92L9Gq7Nlhg6iFvPLP+fhFfjy2udbl/NSgW5KG1vmdowHpRM2vN3F0veHwDVLT4VR62Ek3Tbe7H2EbfcpIg+KYHUJFaU+VmHuncZgCJPj2wj6/aTNcvvmVyJIYW9zuCEPl69oG1lcM3+oaFLXKPQzF4CUMEZ1D1V31ZQutpHZ5avVShGvH+w6rlFgvPB8//da9+6heHIPi2p3lmyp3P+dsYpk7DK+92ssTE3HIDeSpTH71T1kELfxo+YuYZoWEX8868mh7xe1ub/2AZaZpZKb6QtEISSjpfMM5I9T78zR8lb6AlX0BFfeHaacm8K1Sg9ppGlwy/3V94/k432w9iGl7DQDhZ2pOzl3iLMTv0Wzu0C9O08YtYlVhBQGlpEh5w5Szk2TsbeCtqrteyQqZqT03BP0UqrF31z8HgjJUOHUjshL28wyNfgKo+XzdPx1ukGVOPF7pm2BIU0MaaXEAlaBjF3GNNwdvr/DwDZzDBfPYpkZDGlhyE2SAqv3O612YxmZPRZlMF55gUpuulf/M/UDJSomUWGqEaoYpSPC2GOx+vkRe0w/9P+72Yce3r8fhDB2EfHHSXAoFjApDIa3FZt+augxFwnDwCqVSZoNkvBwAtUeSnMaEYJwbff34ppFHCO/bbyor9S0Gyt/R9CbQJIx9yYq2Q9Zq7yjdNxBYEr7IeGb1u49TNGDnFXpa3lHgyBjFXcQKTyqzN/TwErnNhPFF/om8axVoeyM0/AXD+36eRo4tDAVhmDwTIVMxaV6t45TsHFKDqYjqd5uIA1B5XSZ2ItZv1El7ESMvjiMMATN+TYDp8u4JQcVK2r3GmSHMuSGs9QfNGgtdY5s7k6Lfu9kCtI6TbBvdHcHizw5NK3uMneXf8SJ0Xep5I/1Jy4hBLaZZaT0HCOl57YVn94nKbrX1m6wwf3VDw5kkt0LYdzh1tL3OCt+i0p+J2+ladgMFE4wUDjRb89+EYPV1n1uLv4VxczYEwtTgE6wzs2F7xKOvM1Y5fld1Vwsw6Wcm9rBWPVVIGOXOT3+mzuKHxzu/BKZPYrDP4ww7rBYvcQvO8lU691UfGlKwsE4UyGdZEdyTxbZvRcEadECmcmkeaZHcCvIbJak1cQaGMIeHiOsrsG2QKaH04ccM89k4QWW2tfwoibJIUzdB4EXtXb0txSyV4XFOFCAmyEsyu44WWv3Qu5RSHlxtz+rSP2nB0yhMoTJQGaanLU7z/0wePheQ9ljdMINqv5cP8f0aaLqz9H0l/tEDZvsVVVvlkbwdGJkDoNDC9Py8SIjFwZRiWbo3ABBO8SvBYStgOPfmqY53yI3nEHFmvqDJmE7QitN6ViRxY9XGHlhCK/qIyWUjk2DSJWVwecqXPkn14mDo3V4mpzf2EEUAOCFtX0rlTwpNIp6Z47bS99naug1xsoX+lSG25EK0P0nC6USap0HzK7/nGrr/hPlwza6i9xa+j7HR77OUPHMnoEM+7VH6YS1xk3ur75Py1t5qqu7TrDO7eUf0PSWmRx4mWJ27PEnPQKbC6Vu+ARVgH7NkeiQKOn2A/Mg9YsVnVFq/uNdH7bMcmbwXTLW4bSrg0AnMYnvId0M/sJ8Sr5xSHgP7iIth7jTTvOUH7JU+HGTTlSlYA/3q81Ml15iIDNFkHT3XLBqrUl0TKx8vKhBI1imHa4f6FtohxspV3a/vwVFZ5jBzAzr3cdVjRIUnVHGC+cP7Z8O4jbJZs5s7z3bRoasVXls2TmBoOxOMlE4v4NC8fDQeFEDL2qQsdIFZ9EZ5fTA23SjOpHaW1NOS1hGBHGHblSn7i8euBhCokLuNz7movN7fUWm5I5xrPw6t6s/oXsE0ntLumj0oQrfb+LQwjQ3nKZMdFY6dNc9yseKNB406VY9xl4aoTnXJD+aY+5niwSNADS0VzoMnRtACBBSULtbJzPgMvLiMM2FNu3FNu3VLio5+kpea5X63WIfx9qqaVpvP30T7477omh6S9xeeo+N5l0mB19mIH+i53979Gpba03LW2axeom15i38Hjl3edBkcMzCMGHpQUirvpnsDKNTNgOjFjc+71AcMFEKmtV4G4GMptGZ4+Zih0Z3gcmBV3rm20cRZ6Tm5YWNz1iuX8UL64DGD+uEUQd7W38+DJnPooIQYaYLGO3tPwiDqMXCxqfUO3MMF08zVn6BnDt4qJy6VIOvUu3cZ61xk45/1CIJvxoo2qNMFC4c6VylY6re3L6FEJRO6EapL3oz1UkIwemBt/ls+V89csIoOiOcHfgNBrIz+x7zpFBeF+VmyL/wEu0vL+2q/PI4PO54pRNubLzHS6P/Zs8fKLCNDHZmfwuI1hpNWic2ViGR8mn4S9yvf0wrXOdR1oZIeVS9ebJWueeHF9hGnpOVN1MykWDvQByBZDB7jFMDXydvDx/o2Xfe16cdrJExC2xav1yrwGThArdrH+xr5RJIRnKnevcd2vOYw8CLm9yvf8KZwXd7hdUlWbtC1t5f09a9+sNKx/2CAhveLPdrHz22gDzAevcB880vOFZ+FUhjQEZzp7GNLLONz1jr3Hmsqdk2cpTcUYYyx8nZg9za+CmNYPFwD88RhGn1dp3BMxWGzg2yfiNd9SSxApUuDM2MRWmmQGO2QO1OA6docOJbM4xcGGTjZjr4VazQGpqzLaQp02vdrLJ9oCYqZG7jI5brV/rblIoeGZSzXLvCRvPOjsn5ccm3m4JsExp1iELRWwjjNqvN69Q6D8jYZQYLJynlpsk5g9hmDkOaKJ0Qxh26QY1md5GN1l06/noaeLNtwGvg3Gs51hZDlmZDTEswc9ZlYzkiSTT5soFlCYYnbJJYI9B4HUXgbSXad4MNZtc+ZLV+nUr+GIOFk+TdEVyrgJQmiYoJ4zYtf4Vq8x7V9n38qLHDn5aoiJ/d/H/t6M/ooXw199xxouUNMs+fovX9nyNcB6OQQ0cRqtPrR9PoC1mlY1reEt1gncXqFxQyo1TyM/3IXNvMYkirV1MyJE78Hh3gBm1/jXp3niBsEquwn0ZyULS8ZT689f8+dA7fYZF+vAdr10juFIPZY48/cA+ESZcrq3/xyKpCDX+JVrjGoLl1j0pmilfH/hb3Gx9R9eb7QtWUDiVnlNH8cwxnT+D2Jucw8fDjVp939WnByOawKoN4d2+RtI5OxfkoVLtzXF9/jwvD39nlXtgLW6l1KT+rQ46sVaLiTnJ59S+o+Y9enM83v0gLVhsp121q6p3k4ujvstq5zXr3fko72tOUC84IQ9njVNzJvr+xG9UxhX2oXO/55mUGs8cxet+qIWymii9iGi7zzS9ohet9M6tj5Ki4k4wVzjOQmcKSGTSaTriBbWR3EcgfFErHLLWvk7FKzJReOlDQWtrfRi9i3ME1C+SsgbS/V/6cTvToAKZY+cw2PiNvD/a/ozS6eZr/P3v/HWZZmp11or/t9/E2vE/vK7OyvK/qqnZSS90ySEJCMJgHGODCBYY7zIU7Fy4zlxkYhuE+oAE0GEnII7XaqLuqq7q8zcpK7zMiw/vj3fb7/rFPnIiTEZEZkaa6Wk+/9eRTESfONt823/rWWu96V1zroGGXKBgzVK08TrOcRhIVVDFMSEkQUTOElURQISAouL6zjmewVWx7q/pyg3O/fRlRFvFsl5kT8/hOUOx7/ZVxuh/o4J3/5QSDT/URzoYo3Chx/ncuI4gCru0x98kinutRna+zdCEXaOjKIp7t4TntE5DjGttSonA9a9shUsczcbapvLIZfN8LhOmdWlPOTmgaImEN99Jvrcb8TVifpbxDOe8wM2ZSLbmksjKJtMzjX0jw3d9sPlyCgCgJJDtk9h4L89rvrQ/nuJ5NzQyIPbP5M5ucywobdePV26061gAIqkLyqy9Q+L2XETSF0KFdiKkYoq7ROH0FpbcT89oEzk0ea0DeKWHYZZYro21i6msp/q3/t12zO4PXlJ78rCBo36e0OptsF77vId5mYVC1cyzWRolpHS0tXoFANzWhdzf7hdrQbNsnstpJBAKv5/ziy4SVRCtceq/gex7mwixOubQuRHsvkA0PsyP5KHG9B1GQt01YA1oi+SElyQPdP84H07+OcYuyt7K5wHjxBLvST7bywKIgEVHSDCcfYijxYFtucYWxjiCAD0VjlunyOfrjh7dlTJfqoyzXx+iM7A7usSCgSCH644fpjR1okuOc4B4372+QDgvOcal2nanyWXamHkfRe7d9nwVEemMHGEo+GAiEIN3V9U5o3RzsfIlP5v7wtiHXmp3nSu4t9gsvkNSD/KkoiIG4vxgipnWu4a0EZ7tyrJXnfGW8W+l3uxnuyAR7todnr0xqqxestljHyBsc+Ond5K4Vqc7XwaetJGZt42bf81v7+5MG33dZo8q2zY2D6+MFql/sOhymd1glnpIJ+mYLCGLwSBx7OsZH3yvjOJsfqGWE7nK+6n1igKN/4xEWT81x/ldPYeQb4EPtw3OEH9hL7eRFlP4uvLqBeXUCuSuD0pOlfupW0np+81q5P2i+zp9YTJVPE1Li9McOt7yzFUMu+nJTEpEmf2GV+Wq6Nc4sfItCY5q0HrCY77ZUai0kPYQUDfKxTqVC8MDfPURBYnf6aQYTR1vekee71OwcS/VxGnYhYJreNNkLgoQsymhSlJjWSVLvRZXCLeOkSRF2pp/kwuKt1Lt8xgofokhhBhNHVzuzND0wNtDLXekjWrGWuZZ/l7I5R2dkZ1sO9Hbw8Tm3+B2O94SbBkVo8/okYc2CrXmffd/Hw2W5Ps6V3FvU7QK90QMk9J5tlebIosrhzi/TGdnV+sz2DIrGLAVjGtOp4Xk3GammzKAiqoTkBEm9j5jWgYjcFNuBmNpBX/wQE8WTtz2HsjnP+cXvsiv9JJ2Rnc3m9ay57rfefsXYer67JdLWRrinpTFOw2HinRkm3rkf7NlbQ5AElIiKpEo4poNdtX6oJ2fL8Fs55HhaxrJ8TMOjd1hj15EQhSUbz/P53m/n2PtghKlRheXZ+6joIkCkN0Z8IIFTs1GiKka+gW/ZWLOLCLKEFAljjk4hd2dxqw3kTBJrehGcH5aOG/cXnu9gunU26hl5MwRFRhAlPMvc9Dm23DreFmomPd/lyvIb1KwCw8njQaN0pKZXuzLL+E3yjYvnO8EEu/wWZrMA3nRr5I0p4s0G0OsZpDcd03Ow3PqaUJ+/LnfnmgZKtpPQ4Aj10au49fUpHN93sdw6krNqDNxbMN0FRHakHqM/caSVLrC8OleW32S2cvGW53wzYmoHe7PPkQkNtjgQ3ZG9XBJeuyXb3sfn8vL3KRnzjCQfIqQkmrXNUpuRWml87no2ucYEo/n3W4ShmpXH0MrNZ8XfUkTG8Sw+nv09dqWfbBKZtA2kCX08L6iLtl2DmcoFxosncZot5grmDHG9q01z+lYQBYkjXT9GR3gngiDg+R4FY5prubcpGtvLO3ZGdnOo8wsoYlD+JosamdAgk6VTWxp/zc5zfvG7dEV2M5g4SlhNNVsKrlz3drnWlYic57s4nsly/Qaz5QsUN8lt3w6Cfwtf/NNsz3S3SOxMcfxvPkb3I33MvD3BB//T25jFrYWIw12RQNtzfnvi65Iuo6d0zJKJU7+/0mSieG8kke90rAAdD3Sx9+cPsXxugdFvXsWubBJSFwQERSZ0dC/mtUncwv3Jh7UdUteR0ykEUcB3PTzTxC2WPnM60luFvncPckeG2kcn8bdZf3krKKJOR2QnCb2HiJIMmiALAq5nYjhVytYiufo4Vaudw3A/IMcThIZ24FkWjfHRts5Bd4qU3seBjheJNfO7nu9yfvFlZisX7mh/fbHD7M481VKR8n2PD2d+a8uGQhJVMqHBVl9RRdIRBTloXOBWqJiLLNcnqFj3svetQEhO0BndSVzrIiTFEEUFfA/LMzCcMiVznuX6+JaU2m6FvtghDnZ+HlEIwro1O8+Fxe/dNre8GQ50vMRA/IGW7Skac5xd+DZ1+/bkNFEMnljfC6IMSa2bpN5HVM2gybE1rd5sbNek4VSo23nK5gJlc+vVC5uZzM+UnKAsB6mTmzWvW8Iem73bAsQHEyR2pPA9n+wD3YSy4a0ZUwEe+XtPYjcc3v0H39/W+Wb2Zzn4Zx/gyu9eZPa9+8savic2QYCH/+4TuLbLO//D9sYKsHRmgaUzWxCS9n3EaAjrxgxu+f52h1lBaM8ukj/+RdxSGd8wA6b0u+9jXLl2+40/gzCuXIUrt//edmF7BrOVC3dsXO4lBEVBUBRkTQvE6u+FMQ0NtEozAOp2gbnKpTveX83OYbtGmySjJm29Ttn1LBZr11msXb/jc9g+fBpOcUvh0buDQF/8UMvz9fEoGfNbKrvaDAVjioH4EVa8yCAUrBGKSWS6VUJRiVrJYW7caGuBK4gQScp4rk+t5OL7Lm5kgfHCTGBcRYgmZSr5+xcluy/GNJYQGdqpEAoL1CoeVy5YbJbXHRiWKeQ9qmWP3QdU+ocUvvfN9nBPd5+ErAjMTTs4GziASkghtTuDElGoL1bRUiG6H+6lNF7ctLvBCkIdEbJHushd3F6JhaiIxIeSxIeSiOr9ZYfeK4SyYbKHOylcu/+1mW7+/nujN8McG6f0ymt4pkX8c8+ReOFZjGuj4PsonR2IsSj4oHR24JZKGGM38A0TQZbRdu1ATibxbRtregZ7IfAUpEQcdbAfKRYLdEqnprGmA69EjEbRhgeRohHccgXzxgReI2AwC6qCvmc3UjwGno+9sIg1PRP07ZQk9J0jyJk0iCJeuYJxfRSvYSAoCupgf3COxRKNa9fBcUESiT58HGtmFrWvF991sSansZeWwPMRZBl99y7ESBhR14JznV/AHJ9cvzr9jMAzDHzXQ5Dke7JaFAWZkBxHElbzukVj7q5UeNqJK83PtuCxd+6MkhmKEIorNEo2+ek6C9fubb17vEun72CC+StlCrONWwYSFF3EsbyWARJE6DuYYHG0ilW/s+dDETUiyqpak+s5VKwl7iai4W3wHPhAKCKy43CEkUMRLnxQRlIEKnmHcEzCqHv4nk/PzhCLkwa1kks4LvHsT3dw+eMKS9Mmiiry6JdSnHmrRH7OIpKQSXYoLM9aVAsOfbt0FE0kP2+xPHtnkaD7YgV6+mX2H1aJREUefSbEwLBCNC4SjgiIIsSTIpIEiaTIwIiCrgerENP0+eJPrdY0ygp09UocPq6zc4+Komwcdg51BEaiNldl7oMZrJLJwPMjSMrth9f9UA+Sevsc1s1QYyqZA1kE6YcnFN51vAdJvzPm6A8F/CDv59VqmGM3AkMGIIroO3eQeOkFtMF+RE1FDDeVd4DoYw8TOXoEQVWRM2mijz+C0tOFFI8TfeIxtJERBFUNDFU08ErEUIjIQ8fQd+1A1HVChw8SfuBQ4GEB4YMHiDx4FEFWEMMhpES8FWLRdwwTfeQhRE1DVBTkjiys9HsUgo4o2o4RwsePIipNwpAsk/raV4gcP4ao62hDg0QeOY4UDwg8oYP7CR8/iiBLKJ0dxJ9/FlHXP60rf0cQVQ23UsKpVu5IAelmSILc1oYQaDZRuHNocmSdTrPp3j7aIoighmUe+EofWiwgDt5rCALseDRDZiiKKG5+/SRVZOhYmlC8fRzCLbbZCmRRa5GrAvh3JTgDEFFTrM1tBvlMg/y8zZWPK4ydq3Hx/TKHnkhw8PE4R55OsPehKJIikMzKRBMrxCPoGtKQZQFBAFkR6BzQEQWBVLfKvodjDB8I88gXUiSyMo9/JYMoCXd1Te6LZ6qqAdu0XvVQ1KAQ49AxDdPwuHbR4pGnQnz8XgNVExjeqTAz6bC86DJ2xW55sJIEew6qHDqqkUxLzM9s4toKEOmJkd6XZf7ELFOv3yBzsIP03gzxoQT5y+11SoIskNnfQccD3cT642QPdyIqEqndGZ76/36u7bul0QKj37xCfSHwlOWwzOALO4j2x0kMJ8ge6kKJqhz4pQcY/sIqkw0fJr9/g8lXxzY+ZUmg68FeOh/sJtIVRZBFjFyDpbPzLJycwyrfRAUX4JG//xSe7XH2/zyJGtfoe3qQ5I4kki5jlS3yV5aZ+v4N7Jrddpz0viydx3qI9sfoONSFpEokd6XXj/VGgbFvXqU2V207bv8zQwx/cVfbd3MXlxj75hXM4q0p63JIpvN4L50PdBHKhhEkESNXZ+nsAvMnZrCrG4QZBHjkv38K3/M58ysfo0RV+p8eJLEjhRySsSoW+Su5YKzV9S+uIAhI8RihA/swp2ZYkXFEkhAkidrps7ilEoIo4bsuYihE/PlnWP6N38Ecn0CKRYk99zThQwewF5eRE3Eq774feKOS1HrZpESc0L49FL/9XayZOcJHDhE5fpTGxcu4to2UTiLFY5ijY9iLSyCKrdynFI8hZ9JUPzyBOTaOoKl4jWDS9y0b49oociaDOrhWXEAAz8OanqF26iza0CDRxx9BSsRxiyXCDxzGnJyi+sEJlM4OlJ5u7KXldV7pvkdi7H0oxh/9m1miKZnjL6Z48/c2j8rE0ncfGlN0gc//cg9//O9n21M1oogYCiNHogjDu2iMXw/afN0hPN9dl/cKamXvDAISiSajdwWOb1Ozbp+/W7hWpThnsOPRDFffWqRetBk+niYzFEGUBUpzBtffC7y4R39+GEkVMco2N07k6NkXJ96lo0UVrr+7xPT5IgDHvzaAFpWpFy2uvr1Ead6gMF3HWxN9e+xPB/tyLZcz357Fc3x2PZHl8Bd7WbhWZuyjHJOnC+x/vou+g0kK0/WWZzp4LEXfgQSyJnL+lXlCcZkdD2fwfPA9nwuvzlOeX12c3KxzLDTLUe4UkqDSsYYRvNKo3dxAW0BSBJKdKrIiELZ8KgWHWslBVoP3s1ZyqeQdbpyrYTQ8wnGPwoLF1NU6Q/vD6GGRpVkLWRaCPKsPl0/cXeTgvuVMwxGRjm6ZcERElgRSGZFGTUCWBbKdEqoqkF9yEWVanula6GGBkV0qN67ZJFIu4iYrVzmkkD3UiRxSKF7Ps3R2gfJ4kcRwkv7nhslfybVFHWRNpuexfoZe2oGsy6hxDQRQYxqdR9sl7gRA1lcvkZ4KsffnDyKHFJSwghJVESWR+HCSaN/qS+v7PrmLGxMK1ITG4T9/jN4nB9HTISQtUEpxLZfBz40w+94UF3/jLNXp1TCpIAj0PjEAHhQu5xj+wk6Su9MoYQVBEvEcj4HqCAPPDfP+P3qzZYwlTab7kT6Gv7gLOSSjxppjja4fqygJbWNd+7meCqHFNfRMCDWuIUoCE6+MApsb02hvjAO//ADdj/ahJ3VEdc04Xxhh/uQcF3/tDOXx4rpte58YQBAFcheWGP7CTlJ7Mu1jfd5i8Plh3vsf32hbeOj79qAND+E26thLy5RfewM8HyTA83CLJdxCcDy/SdWXkgkEXcOcmgLfx603cPIFtP4+fMfFrdZwCsXgbXOc4FFqGmxtZJjMz34tMMqahhiJtDzM2olPEESJ5Je/gFurUXn3A6yJoFtL4+IVRD1E7OkniX/uOaofnKB+5tym13IFvu1gTc2A6wbhZM9redeeaSLFAq9ZUJXAeBvr70+2T+PIM0ne+0YO1/UZ3Lf55BdNyzzxE1le/k93p3MqyQK7j0W5udVk67qFQtiTN/CM7YulrIXr200BlFVJ0XRooNmWa7tGWqAjMkJXZFdbWUmuPtFivm4XnbtjSLLAtXeWaFQCNj4+XH5zES0iM/hAkoEHUqT6wyxcq2BUKux/sYu5y2XA5+BL3bzyf1yhXrAwKhsTHq+8tYCiSQwfT9N/KMnoB8vkp+vkp+uMfZRjcbSK78HsxTJ7n+1CCcmARbxbp3tPnPlrFRzT49GfG2T8kwI9+xO8/m+v0Xcwwc5HM5z6o9VKDdttYLuNVv2yJMgk9T4UUcfe5jUSBIkdqUeJr1GAcn2LkjG3YXOC/JxFqlOhsGCjRyX6d4U4+HiC3LzFwoRJpeCwMGny/M91cP69MovTJkbd44mvZJi62sC2fQb2hJi60sD3wDbuPs1w34zp/IzDyfcNLNNj90EVzwNRFhAliMSCmIfjgGNvHGEXgv7eNBo+mu6jbyLKocZUuh/po75Uo3SjgNNwWDg5R8+j/Qy9uJOz//4TWCNTaNdtLv/Wea7/YVD7ePgvPciOH9vD8vkF3v2Hr7ft27Vc7Nqq91Obr/L63/ouAgKR7igP/q3HiHRHOPvvTjL73mrS3cfHqa9fzYuKyKE/d5SRH9uD73ic+/cnWTw1j2M4ZA93svdPHWTky7uxqhaXfv1MIMe4Bno6xJG/fJz6Uo1P/uWH5C4uIukyQy/tZO/PHqDnkT72/cIhzv7bgHjgNGyu/u4Fxr55FYBDf+EYO398D8sXltaRrVzbXe/p+TDzzhQLJ+cQRIHBl3bywF95aOMbsQZaUmf/Lx5h+Iu7qM1XOfkv3mfx9Dy+55Pam2Xfzx9i6MUd4Pmc+bcf01har+CjJXQe+CsP0cjVOfWvPmL5/AKSJjP44g72/qmDdD/cx/5fPMyZX/m4tY05Nk7l7fdwCgV8y27lL1t3ZYM6Rq9eR5BkRFXFcxoIohj8bJl4loWUiLcM1uqufDzDwJ6fJ/c7f4BXq7eO4ZaD1a1brlB+8x3Ej08ROXKQ2JOPUWo0cBaX8BoNqh+eoHbmHNpgH4nPv4jXaGyBLOXjt5UZrS4wy6+/Sedf/HNow4P4pkXl3Q9wKxuvtE+/XuTpn+rgjd8LFnx9u0M8/pUM8bTCiZfzXPqgTLZP40t/voehA2GiCZmFCQNBDEpB1ZBIYcHC9+DCeyV+8q/1EU3K1Msur/zaPD07dA4/ncT3fJZnLU6/Hnhyoijw3M93Uis7fPCtHE6pSOXcaUKDwzjVCv49yO2WzUVMp9bSE1alMIc6v8S5xe9sKTwLQfiyN3aQocSDhNd0dvJ8hxvFE3d+cr5PYcZgeXzV09JjMo/94jCu6RJKqMxfK1MvWOSnalSWTB74Sh+CCI7lc/IPpnjsF4aYuVDik69Pc/PMqYYlHvvFEZyGSySjYVQdPNenUbJplGxKcwaNUmCYqjkTq7H6LEXTGr7nk5uoUVkyeOG/3cXE6QLLEzXyk3WiWY3+g8n24eCzVL/BUGIlNCuQ1HsZST7CWPHDLevbRpQ0I6lH6YrsQhRW6kx9DKfKXHW1Rn1pxqSwZGMbHh9/r4AoBc+jKILj+MxPGHguGE1P+71v5tDDIvWKi+P4vP67i0iSgFH3mB83kFUB2/RxLI9v/193L4x/34zpsUd1Hn5SRw+J/Mo/K4APf/sfpTl0TEPXBfSQyFOfU3n82RBDOxT+62+Uefy5MMM7FX7pLyf45u9WmJ6w+alfjOH7cPqjDVY6AoQ7IqT3Z1k6s0B5PFC3mT8xg904SrQ3RvZAB8vn1niJPthVq2U4nEbwcLmWS2P51mLbvutjLAcTtKRJeLaL7/mYZfO22wJ0He+l9/EBZE3mjb//XRZOzeE3xRYqkyWMfIOH/7snGf7iLmbenljHnBUkAatq8cm/+pDlMwst0Yvi9TzhzjBDL+5k4PmRljHFB7tmt0K/TsPGBzz79mNdgWu5uFbwcNpVa0uqJp3Huul7egCzaPDhP3mL3KUl/OaCpjpXpTxe5LF/8Az9zw6xcHKOG99Zb0QEScCu23zyrz5k6dT86lhHg7EOfz4Y61pj6lsWTqmEW9o6+cktlTGuXiPxhRcpfvtllK4OtB3D1E6cxCmUCB3cj757V+A5KjJyIoE9N49brmAvLQff/fBjBF1DTiRwazVwXLRdO7AXl3BLJeylZZT+XgQ5eN3UgT7cWh23UMSamWt6aDeJIQhr/m0BcjKJW66w9Kv/Gd91A8O0yb1amjHZ/WCUcEwiFJUY2Btm9EyNyYs1PveLXUxfrbMwYfDeN5Zp1FJ8/d/M0LczxP5H49QrDp0DGpkelRMv5zn4eBzP9fmtfzrJyKEIz/5sB/PjBkbN5fu/tYhRc1F0AdfxeP7nO5EVgY++E6RegtKYEQRZxpy7N7Xpy/VxeqL7AvZt0whmwoM8PvBLTJfOsVQfpWrl2rwdUZDQpRgRLUNGHyQbGWnq666qcvm+z43ix5SNu5h0fVrvwQp2P9lBdcng1DdmeODHehEQcF0Pv3n7WtlIDy6+tsDE6QIHX+xh4EiSGyeaRMLmc7LryQ4aRYsPf3uCYz+xmiLwXB9JEdr5HU3hhpWAn1GxkRQRLSzhZ3RquaBO37W9VfGZDZ7F8eJJ+mIHkVu1oSrDqeMkQ33Mls+Ta0xhOOU1JLDAgw0rSWJaFx3hEdKhgaaEodAypK5vM178uK0kxnPBagT7sTbwJB2rfTFmGV7b94za6s+u42OuWWs3qne/kNueMb0pTLMZzp8yOX9q/ark7/75xeYqIvh98obNO681EMTgwbl+qcSv/8qq3Nvpj0zOftzUdN3AC5cUiZ7H+xFFkepUicp0sG11pkJptEA4G2bopZ3txvQHiI4Hugj3RJl5b4rcxaWWIYUgJ1EcLbB8boHBF3eQ2pMhf3kZd00XHd/xyF9aYulU+wvtuz5zH84y+Lkd6EkdOSTjNO4fBfxW9lQOyaT3Zgl1RLjy2+cpT5baJxDPpzpTZvyVUR78m4+SPdzJ3IfTgZrS2mO4PoUryyyenFv3+fxHswy9uBM9tTpW3/MCr22Tk/NdF9/e+Jos/9bvk/rJH6P37/9t3GqdytvvUT97IVCleeMd4s8/TeonvozvOJRffT0wpsUS5dfeJPHS8yQ+9yy+41J97yPsxSV8XPSRYbJ/+mcRVBUnl6f8+tvYc8F9U7q7yTz/NHI8jmcY1D4+Rf18UL6h7dpJ4nPPovR0ISoq2sgI1swM+d/9A3zTWh2f5+M7dhDGFgQERUHp66HvH/69YBG1nKP0ve/TuLC+LMT3fD74Vo7HfiyDrAoM7gszuDdMKWdTWrZxLD8oUXN8PM/Htf2WUfTLgZeU7dcoLtnsfjDK/LiBZXgUl21SnSqz1xsUFy1qpeB6Kwj07gyR7dP4lb8zGngTeghEAWthDq2n/54QkCAQm79RPEFYTa1hmgpoUpSd6cfZmX4cHx+v2WszKOpfPw2uNaI+LpOl04zl398eM9gHx3Rbt8x1/HXNPKbPFzn21X7i3SHshkthpo7reHhNVSTHCoxZNKvx4//9AWzLozTX4PLrDQ59voc9T3cycDRFqi/E2Ic5Hv6ZQaJZDbvhUl4MHJDqsonvw4t/fQ8XvjfHxCcFnvkLO+k/kuSJPzPChe/Nc+NEjvKiwRN/dgdaSOKd/zRGOK3iWkEo2nN93A2U6gynzMWlVznY+UWkpnoRvkRK7yOl9zUvg9ckJgktEYVbXW/Xt7mWe4fp8tmtX+vPALZsTLW4ip7Uqc5XcW1vlfW0ZsXiu8FSShQDOSglouDaLq7RNAiSiOsGVHNJlxBlEafuEB+IY5ZNjEJw80VZbHkivkDr55sh6TK9Twxg1SwauQah7Gr+J39lma6Heul/dojT//qjNqP0g4ASUYh0R5E1mfpilVBHBDXePrmrMQ3PDSTEIj0xRFVqO2/HdCmObkx+MApNT1MAUZXgPhrTW817alwj0hM0ZC7dKG4oZuGaLtXpMq7hEu2Loca1dcbUNZ1NS3iMQqO5bBdaY22cv0jj/EUApHg4CPMazWO7LtUPTsAHG4fo/EaD/G///sbHunoN4+rG4Vd7bp7lX/ut4BdRCAxbE6XvfZ/S9zao5RUFaidOUjuxpgZQADGk4RkW5vVRFq+Pbni8mf/pn60ee2GB/O/9IQBKVyfJH/8Sc//rv8QtFBFkmcjDDxI5dmRDYwowcanOi7/UhVHzmLxcZ/JynQvvlXCswHACmA2PcFQimpSxrUCOUg9L5BcsYmkF34OpKw0OPpkgkVXo6NNYmNw4V7YwafKb//MEX/vrffzO/zZFtaGiprOroV3x3tFdC8Y0FxZfYV/2OSJqJujtueahFRAQb9NuLGgk7tBwykyVTjNTPn9L5aWNYNYcvvlPVut5T/7B+lr0wnSDX/srm4eOv/GPg0YfVcPkt/+704haCEEU8GyX4itznH+lfbH5n//yR+v24bk+b/679jrX7/zzm54LQeDiq/NcfHV1oS6Gwlx/dxmAyVMFJk9tPPfMVS/j+z57Ms+gyZFWqLa1ayTE24jnryhB1ew8o/n3Waq3kzfX1rICTa3lzTXFfxDYsjGN9cXof7yX8e9P4touSkRBjarYtUDjUtYkclcKRDrDaHEVo2Qy+FQ/xYkysyfmkFSR7N4MjuGQv16k+0gn0d4oU+/OoKc0rKaaTiitE+uN4tkePj6iLGIUTSqz1XVecaw/TmpPBlESOfwXH+TwX3xw3XmH0iG6jve05TR/EJB0GUkLLveenznAnp85sOl3fd9HDsnraNq+62NV7o0o/93gVp6pqEjIzfIbu2bhuRs/7K7t4hg2SlhB3KCEyff81jNxS9xk2AVZovfPv0jj+hy5736C73wKiyhRQOvLYC+X8Rq3OOdNvidqKvFH9lA5eR23cgckHFHEq9VQOjuRYlFETUPp7MCaWy+wUc7ZOHbgbX78coHOAY0b56o8+Lk0X/jlbmZGG3zyWgGz7jF3I+A8PPenOjj3Ton5GwaSLFDKBYsU2/K4cqLC8MEIL/5iJ42ax9v/dYm+XSFsa/Uh8Vyf2dEGy9Mmr/3WIg+9lOb7v5MP8tKmiVOt4Jn39rkuGNN8PPv79MeP0BHZiSZFkEW1KfS+Vl5upeVaYDxdz8b1bQynQr4+yXztyh31xbwfUBIpkg88iu+5GHPTVK9fAlFAVFR8x8Z3XQRZCVa7nteUTXMRFBXfdfBtG0EMdGoFRcW3bXzXQdRDKIkUnmlgl0vguYiqTuqBR8l9sMojEWQZQVbwbWtdfnu+doWytcBA/CipUD+aFEYSVSRBbmucENToeni+h+s5uL6N45lUrRzL9RssVK+0Fi2aFGnKQTaIKCkUUadsLeL5Lhm9H9NtULZuLyKjSzE838H2TFQpjOfbwfF9G1nUUMWghMz2zG0Tp9ZiS8ZU1mVCKR1FlwllQ0S7IjRydboe6EKUBKben6H7aBd2zSGzJ4VjeWhxDVmTAralD7HeGOFsiM7DHXz4r04G7rzp4jRsYr1R7JqNUWiw4/MjLJ1fov+JPlzTobbUIJwJU19qtHJ3ENRIDXxuBIDKdJnK5PpuILH+ONG+GIMv7PiBG1PfWxX2L1zJUZku3zL/mL+0vEEDAL/N+/kswvf8FlVflMVWDuRmCKKIKIl4jr9p5OFOCvm1/gzWQoHQnh6E1ySkWAgpomHO5JATEcSwhjWbR+1KIiXCyPEwTrkOrofveoiagu+6uBUDa6GIko0jp6IIioQ5uYSgyqidgcKO73pY80WUTIzks4eoX5mhMTaPvRQ8i6HdvQED2bSx5ouoXcnge5emaIwtBN8TQOmMYy8V8azASCnZOHI6iiCJmFPLCIqM2pVoLSaNqWW8+qrxsefmqbz1LuHDBxEkEd9xMaemW576Wpx9a/U9OfHyquf/nf+wXo/UsTx+83+ebP0+cXE1z375o1Vy081s35tLDKyGz+/+s8Aru36qyvVT1eY4JtYdczNIkoYoyjhOY8udg2zP4EbxIyZKp0hoXUTVDLocR5H0prcqNstpAiNqulUMp0LdLlK1crfU3/3UIQiomU6cRp3SmQ/xLCuon+7qQ27WPtduXCWyYy++YyPqITzTwK1VkWMJBFmmduMaSjyBksy0jG1t7DJapovIzn3YhWWqo5dx61W0zm7cNYpUUihCqH8IEDAX57BL66NGdbvIldwbaFKUuNZFRE2hyzEkQW22NROa19rB8UxMt0LDLlO1cs286uo8IAoy/dFD2J7BZOUMnu8QVhLUnRKmW8XxbZJaT8uYyqJGSIq1mpBLgoosKhhOlYHYEUy3ymJ9jN7ovuB4biCdmdL7iKud2G4dAZGJyuk7vkVbMqZqTCXWG6U0WUYNy6gRhZkPi+jpEMmhBIvnl4n1RBEVEc8L+mt6jodjuEG5hQCZPWnC2RCyJjc9LItIRxgloqLoMomBGOXpCq7ltlqyWTWb3NU8kc7wOnEEOSQz8Mwwds3m+h9eYuzb60NxA88N8/Dfe5LOB3sIZUI0cndHvd8YW2OJ2DUbs2jguR6z709x4T+d/vRDz5+CHbZrFo1cMOlGemJIurwu1CtIAqG0jhxWaOTq91TXOLSrh/q1ucAgJcJo/Vn0oQ6Wvv4h+lAn+lAnue98TOyRPeB5RA4MYEwvIyciNEbniR4cxJhYxDVsim+eI3psB4LY1Boe7sTOVUg8tZ/qJ2PI2RjGxBK4HkoqipKJYS0WsZfKQQlSZxIxrCInwlTPTiDHQiipSPC9pRL2ckCUUruSJJ7cj7VQwpUtokeHEVQFwQd9qBMnXyH57CHKJ66hdCSQ4iEqJ9rDdvWz56mfPb/RJfnMQxBlYrEeVC1OuTiJZbUbY1nWicUHgl64peltt+HzfJuCMX1XMnc/cPg+5uIcaipLdOd+rPwinmUR338Et1EnNLADu1QgtvsApfOniO0+RG30Ekosge9DdNd+zOUF1HQnob5Bimc+In38SRqzE/iug2fUsYp5PDuImNjFPNknX6R46n0QRbTOHtRMF7UbV1rf2QymW2WpXmUDkv6WIQsKmhTF8gwUMYTr2201xI5rsNK5UBJkUlofESWF6zut8K/rBQYXwMMjomzcpNxy6zScMnH17vr1bilRYdcsZj6aY+zVcXJX8syfWcSqWiydX2birSl812Px/DKV2SrLl3LUFusUx0vMnJjDbIbqclfzzJ6Y4/rLNwCoztco3CgF9PkreSpzNXzPZ+rdaVzLZeHcIgtnlmjkGpQmym1eKUDmUCfRvhhWyWDm3SnMorHu39Rb41gVEy2h0f1I34Zjc82ANqcl9S0zJyHwwFzbQ9IkZP32Ckqe5ZK/soxZMOh9cpBwZ+S229xruFbQ5my7Y90O7KpF8Xoes2TQ81hfWx57BXo6RPej/fieT+FqrpUrv1sIioTWmyF6eAhRV4keGd64WYNP0LxZkXBKNSqfBJKDjWuzuHWT+ug8giSiZOKERrqQokGeShsKauCsxTLFty9i3FhESQcG1ZhYpHLyOsbYQqBNrMoIqgyOh6SryFEdY2IRY2KJ8ser38P3qV+axikE5RJqNoagKFRPjpL//llix3eCKGItB8esX5lB6+9YP6YfZvg+shImGu8FAWLxPtKZvWQ6DqCH0sSTQ6Qyu1CUcJAnFyUy2X1kOw6gajFUNUYmu59keheqFiOeGCTbeRA9lCIa6yWV2UO28xCankTV4mQ7D5BIDiNJGoIgkc7sIdt5EFW7c4GHTwNOpUTp/Cf4noveM4iSTOMaDcyleYqnP8A1GviAsTiDUyni1CoIiopTLePWa8ErL4AxP4NdWMapVRBlFdeo49SrOOUCftNQOtVyq5QsKBfTsAvLmAuzuPX7r7ed0LrxfBtJkNtqTzeCJCiElSSGU8Fya0iihOGWWWqMEVUygE/RmCGt92+6D893mavdqlXk7bElz9SuO5Qmg1V01ahTXQiWHCufrf3ZqliUp4KVZX250WIAF0aLbfs0iiZGU0GnvmYJU1uoU1toX9JYGyjljHxhF77vUxwrUJnauOGzmTdY+HiO/meH6H1qkBvfvb7OOyuNF4Peef1xRr60m6k3xoNcXkhBVCTsqtWmMLIC13CozVXoOt5D7+MDFK7mKU8UEUQhIBLZ7rqc39z70/Q+PkDvEwM89HefYOxbV8ldWsKuBrlDPRMiuTONltQZ/+51anfQ2eVWKI8X8T2faF+cHT+2m8nXx3Eatx/rzbgVAcl3fRY+mWPx9Dw9j/Rx+C8c4+rvXSR/ZRnfh/hQgl0/uY/ex/vJX1pm/uNZXOPehNPUziRupY4xncOrGaS/fJzi988hqoHgg5QIDLvvuOB72MsVaucmMKaW4bngc9/1oJnn9R0Xz7Qwp5exlkr4J0fRetO41cZqP16xGcaWxLYLE94/gNqVpHpqDKUr0SIoCZKwsYFfuX6OG+xGEhFVucVAdqtGswuEd9cycHcDtaeXxMOPIaczqx96HsX336Fx7c6U+X3fxWgU0fQEtlUn23kQ0yjjOiaJ5DCNRo5GPUe9tojvOaTSuwiFs9h2je6e4+RzVwlHsiwtnkfXU0RjPXieQ3fvcWyrhmmWsa0qHV2HqFcX8TwPwyjgeQ7J1DDhSAe2Xaen72EmxjZvAJF8+jn0gSFKH71H4/r2GijIqTSRA4fQevsQ9RC+4+BWytQuXaAxuvm+Eo8/RWhkJ+WTH0LDRu/uQ5AV3FoFc2keNdOBmunA93xqN642L2jzHwJKLIGkhxDV1dIr/6b0iWeZiJpO/OCDlM6fxLNMojv2ocTTxA8+SHX0Ena5SOLgMeR4ksbUDYyFmVuTJ+4AiceeJLRjJ5WTH5NazDBVPReULCkpBEEkoXbjeBYVSyClDxBXs0SVLA2niOGUiaoZqlYex7ObrQQ9IFA4Mt06hlshLCdQ5QgJrSfIowsqdbtIwZi+4z6mK7j/XWPuQ2hRiar0PjmAZ7nMvT+9rnZrLSa+N8rAC8Mkd6aIDSTW5VZn35mkeD1Pen+WY3/9EQ780hH85qS3eGqei79+pl1irwmzbDL3/jR9Tw7S/8wQmYOduGYw8QmSyMVfO82NP24PxTWW65z9dyeRNInuh/tI7krj1O2AwSsKSIqIHFIoT5aYeXvr+aStYva9KQrXcmQPdXL0rz3C/l88gu8GY106u8DFXztDdWY1xJY51MnQizsCtaeIQmwggazLZA918ej/8AxGoYFTt7EqJpd/8zxmKfAwa7MVLv76WbSETv8zQ2SPdLVCuUHbuhD1+QoXf+MMxau5Dc/1TqANZLELVWrnxvEMm+xPPoK1UCT9hWN0/fzTCLKEvVRG1GREVSZ6ZBhvXz/2UnHDFYK1WMK4sUjkwAARYZDa5elAdP4muOU6giTQ8dVHKX94jcrpMZxClfCuHgRJQFSCyIVTriPIEh1fe4zyR1epnL6BFNHJfuURIvv78SybysfXcasGmS89iKDIFF47Ewi9rn2RfpBy0L4PkoQUiSKFw8jJFPg+1Yu3V3DaKkRRplFfxvNsIrEunHIDy6xgWTV830MPZ3CcBqZZwjSC99my6xiNAqFwFgDTLGMaZSKxLhr1HJZVIdt1EKNRpF5bbG2nhdK4rtn6/i1OisRjTyInk3hGY1vGVOnoJPulr6APjSBqWrNXmI/vOphzt2jlJorEH34Mtasb37FZ+qM/xC4XA6Uus4FnNChfOIWoas3SMJvlt17GMxvkPnoT3zIxlxdAFBAQcKrlYHuCUrHCJ+/jGg3wPSqXziKqKm69iu951MavYcxP4xoNPNPEWp4n//E7IAh4jfo9N6SIIrGHHkXr6cV3PSZ+/w8x3RoNu0zZWsTHp2rlcHwLz3OYr19lsT6K7Rm4vsNyY4KiOd/Mc680+fYYLX2I73vYnslc9QqSqOD5LpKg4Pr2mr6mdz+ez1QLtq2i97F+1KiKVbFu2/ps/sQMdsVCS+h0HetZZ0ytisVb/4/vsf8Xj9D35ADRvhi+B43lGkbRWBdeXoHv+sy+P8VH/8s77PnpA6QPZJFDEZyaTWW6jJHfOHRZnijy3v/4Bn1PDjD0+V2k92VQYypO3aG2WGX2/WkmXh2jMr114YGtwqpYvPP3Xw3G+tQg0d5AEKOxXMcsGutyuOk9GXb/1P6A/Sc0RaAF0FI6XQ/1BEXovo9rOIx962rLmPqeT/7iEu/9v15n5Eu7GHhhhNhAAkGE2lyVa//1ImN/fI3KzTWod4nKyWDx4tvBOKb+j2/hGRZT/+qbrAhw+q5HaGc31lKZwhvn8Qyb/r/1Fab+xR/hNSwW/subeLZD/dosuB6l9y9TPnENBCHwaD0fztwA16N2dpzaeQHfdln++kcgiYEn6fmYk8vUf+UUudpE8MLaLr7jsvQHH7R9z60a5L5+AveVafK1aRQxRGNuFudyYCjsWg1BEKiemwDPp3Z5mvr1VbKQooRxHGPDPKKmJ5BknXp1c8ajoCjoIzuIHnoAracXKRID38OplDFnp6lfukD9+rXW5GktLLD87W8gND3xob/99+9aUF+SNdKZXcQSA1RKQV7T971NF+L55SsMDD2FokaCHCo+K+1QqpU5orEe4okBKuWZ5r6C9IbrmDhOg+6+h6iVZ8nnrlHMX6dv4AlkJUKlfIu5xPMwpqcIh8M0bmysub0RBEUhsnc/4T37MOdmKLz5fYypSQRJRM10YM7ewph6HubsDHIqRX1sFM9s4Jk3lZDVa21N1Z1KML+5tWBRfHN+01/TvmttuNatV3HXBASD36trtgOnaYjvC5pjVTIZGmPXMd1gTB4uXjPc7KyRL7Xc9uil69u47voI5lrVK8e3cNxmTph7k1pai7tuDi6I8Fdf/jLF6WDws2dzfPB/XcEob0wqkTWJ9HCUxSsbh2a3BFFAbBKSVhiv0ayOKAuU59sfth1Pd5MciHL698bw3c2Zo4K4aiyAwFB4t2CatjZcs+3Kpn7A9LzlYmeD7RCE1nHx29dKUtO78VwvMEA33zYhYM8CG7CA72ysgihsuSvOZscURCFYGW/juq6UyvhuED7NPDxM/08eIbqzA1GTcWomtetLnPvH38Kzts/4lVMR0l98ELUzgajIlE9co/jWhVveLwGB4diDyKJK3pzBcKr0RvZRtws03DIRJUNYipMzp1k2JoirnexJPMFC4zoFcxZV1MnogxTNOUAgrCQJSTEW6qMIQrDvhcZ1LN3H9BqoehyjXiAS7aBRW0ZSdEr5GyTSO/BcG0EQsMwq2a4DlAoTmEaZZHqYWmUBz3OIxLqxreCdtKwKZqOIY7e/G3IqTfYrXyOye++mdZ6e0WDht/8L9Wsb55NG/p//GDEUYvHrv0fl4/U1jlvHivpNEJpbvRkrP7crxgiCCIj4LcZt+zaCIAVGFNbtSxAkaHok7ftyueVDIIqrZSdb9MykaIyOr/4M4d17yH3vu5TefWt7Xt0dHPMHBSkaI/Plr2BMjFP+8L3t7+CHZKz3tTm43XD5zf/mzfYdaxKe6+G5PmpIxjYcEATiPSGO/uwOXv8X5/BsD9f2kLXg4V6Z5K2aE5QM6EGXDt/zcUyvFX5VtFXCj+V4iJJA/4MZ1KjCpe9O4xiBzJ+kiEx/sszkR4utyV4QBWRNDAqfHR/HdBEkYfUcCKTPNlL72BBNibBte1g3bRfd1cHh//ePo3cnVr8jtH9/BcvvjXL5X7yKXWy0/f12RrT11a0sErbxvdvtA297QZTWOATIPjLM3v/755BDCo3ZElbZQInpeJ5/R4YUwCnUWPytt7e1TUrrw3Sr3KhcQRIU+qMHmaycJqJkyOpDlKxFFurXGIkdJ29MUbGWqNhLTFXPE5JiRLV+KtYySbUHD5eStcB09Tx7k09xtfQeJWuemdol4uog4WgXsqzj2ga23SCWGqJeXSSRCkrBBFFCEERMo0ituki9uhjkG+068fQIrmOwMHOSUDhDtvsQxdzYOkOqpNN0/5m/gNrVjVevUb96meqFc9i5HIIso3Z3E9l/CFHVqF+/D13K18FfM0n5bZ+v/6zpubYV7Ldv429Y1tIUgrmps8z6fW2COyjVEmSpJTPplorbNxL3oM/rpwUpGiWyey/24h0qzv0QjXUj3BNjKoiBkcQPDKtjuTz4CzspTFbJ36jw1F89wPf/t7NoEYXjv7iLwYc7eOHvHGH0nXmuvz7L439pH47pEk6phJIa3/3Hn6CEJB79c3uIdYZwLI/TvzfG3PkCO57oYt8XBgJJMMfj9X9+lu4DKQ79xDBaVKbnYJqPfu0qhYkqu57v4chXh5n6ZJkPfvVK0BD3gTT7vzSAFlUozzf4+L9cI9ET5qm/coDSXA0trrJ4uchHv3btnoYgbwfPcKiOLmOVVsMPkaE0UkihPl3Eqa6GOOozxds2Pf+TADmqkTjYixxRGftP7zPz9TN4zbw0nzoJR8DDRxH1oODf9xGFQADA930cz8S5qbuF73soot6UTwuepSVjnJiSwXIbzeL0ZjQCD0XQcB2LcmEcVYujhZI4jolj1akUJxne83luXHmZcLQTRY0gK4GqjKbHCUU78DwHx6pimRUynQewrSrlQlAnqqiRlqcqKArZn/gp1K5u7Nwy+ddepnr2dNtkZk5PUvn4o0AE4DPsJXzmIYgIihLkND+jTdrvCUQRfXAYpB/KzOE9wT0ZuRISeewv7APfZ/ZcgfPfmODiH0/x8J/ZzZGfHOaD/3AlCL/6DT78j1dQwzIv/38+adtHo2Tx0X+6uuoR+j7nvzGJ7/sc/okhEn0RFq+WeOjP7Oblf/QJxZnVPMHER0tEO3TUqMKp31nNZ1x5ZQZZkYj1BJOOHlfpOpDixnsLXH9jjqf/2kH6jmSo5QxCKZXf/5vvkeyL8ODP7SCS1qgu3fu4+maoTxc49z9+s+2zY//7z5I83Mf1X3mT3Ac3PrVz+axAVGXUdBgrV6M+nl81pPCpi1cUrTkGo0foDO2gaufJmzN0hkYw3RoFaxbbM4MyF6e0oqlD0ZqnQx+maM1StXNE5DSW18B06zi+BfjU7AIeDjW7SEYfIF+bwfLq1Kvtq/tQpIPlhYu4jkGluCqkYDaKAFTLN+feNhfSjuw7QHjPfjyjQemDd6ie/mTD7wGB/u+9gigix2KI4Qii2iTieB6ebeFWKrjVyq0NtyQhx+JIkQiCogYhQdfFs228Rh23VsW3Nz5fQVWRE0lEPYQgS0EaxXGbwga1DUk1gqqhZrOBjnALPnahgFPYWOoSQMl2ImoagiyjpNOImo4giqjdPXjG6pzimQbmTHvtq6AoKJkOpHB7SZldyN/ymOvHqyHHE4ghPWiw4Af5Us808eo13OpNpEpBQNR1pGgMUdeDRRSA6+A2GriVctu5A8H9TCSD7cIRIgcOIYgicjpNaEd7D2SnVMTOLW8w1ixSuL1M0C4WcPK3JyYKkoScTCGGwwiSDL6PZxo4pVLQzm+DZ0kMhVC7enBKRZxSESkSRY7FEZpsZ9+2casVnHK5lYffKu6JMbVqLq/8k1NtnzmGi2MGXqpRae+ztlEerjBRaYlACyJ07Epw4McGyd0okxqKsXS9HISOHQ9ro1IK4dYlB9BU5CHQuAUwazZqRKaWh8JkrZVTdSxvQ4m7zyrSjwwj6QpLb19DVGViuzrROgIFHbdhUZvIY8y3k30EUUDrihPqjqMkQgiKiO942KUGtYk8Vm5NQ14BQr1JojuylK8s4LsekaE0ajIMooBTNWlMF6hPFzc+QQFC3QlCAynksIogi3img10xMObLmMvVlqct6TKJw31IuoKWjRLuTyFqCqmj/SjJ1Uktf2IcK99OQpBCCuH+FHp3HElT8BwXM1elNraMU9u40Py21248h7FQxnMdxiufsNZIVezldfubqq2yWhcbYwgI+ARGNm+u74wyUQ3em4XGdW5lAG2rRqO2eRPv9djcKMUffQLwsRYXqJy8i5Zi24EoEj/+MKEdu1B7+lASycBjcxycchFjYpzKJx/TGB/beBLUdcK79xI59AB6/wBSLI4ginimiVurYi3MUzl9ktqli0F7kTWQkyliR48T3rsPNduJGNLxXQ+v0cAu5DFnpsi/+vK6fqpKMknquRfRh0cQZCVg4gL5116h8P1XNh1q5vNfQu3qRgyFA6OqBIYp/fxLbWUp5vQkM7/6K23jleMJkk8/S3jXXgRFRtR0EAQKb7xG/pU/3tKlVnv6iOw/SHjnbpSODsRQOFi0mAZ2IU/98kUKr7/avk13D7Ejx9CHhlGyHS0D5xkNrOUl6pcvUTl7qs3ISaEw6Re/gNrVjZJMI4ZCQSrvwYeJPdAu7Vr64F1y3/1W21ilaIzkk88Q3rMPQVFWx/rm98m//O1bjlGKJ4gePER4/yG0rh7EcBhcFzufo379KtWzpzBnZ9aFjrW+Abr/9J+l8skJ6tcuEzlwmPDO3UjxoNWeU61gjN+gfPIjGmPXtxV6vifGVNZEHvjpIJ9Tnq8zf6HAzmd6KM3UWbxU5NCPD3LiN65TWzaCLgiuz+GfHGLufIHl0SZrde37IwhoMQUtKmNWHRpFE8d0sWoOM6dzHPjSAEbJxnU8rr42g2t5GGWb7gNJDvzYADfeXaBRstj5TDe9R9KEkirDT3SxeLlIabZGz8EUsc4QkYzG2DvzKCFpS63FPqsY/sVHiAylKZyaov8nHyDz+A7UhI4YUsD1Gf+ND5l7+WIbky+6s4OhX3qEyFAGJabjex6CKOJUTUoX55j4zY+oTwXC1oIkkjzSx44//ySzf3wOOaySOjqAFFaRoxqe5VC+MMf0109TOH2TyowAXc/tpePZ3cR2d4IPgiI2j2Ww/MENpv/gNOZSwD5U4iEGvnYMKaKixHS0bBRRk+l8bg8ZY9XrqE/k24ypmo7Q9cJeOp7ehd4VD9jHsoiZr1E4OcHMN87SmF1Pehv+pUeJDKY2vXY3fu0D5l+5tObabe852V62ePPvOvZdyMmsgRgKo/X2g+vRGLu+3tu4j4gdfxgpFMFamKN+7TK+bSOFwujDO4gdewitu5e53/iPOKXium1Du/aQ/vyXERWF+uh13FIR3/cQ9RByIomcSqNksqy7hoJA6oWXiB09jr20QOXsKTzDQJBlpEgEpaMLfWhkw9Iop1yi9MG71C5fQFA10s99DikWv+04a1cv0ZgcRwDEcJj4Q48iiCK1SxewFlalFwPvp/18nUqF8okPaVy/hqCqpJ5+rr2m9zbQBgbJfOHHCA3vwCkVMW6M4VQrCIKIGImgZjs2DMVq3T2E9+3HrdaoXTyPW6sFXmYqTXjP3sBgaRr573+vJezguw7G5ATW3CxIEvFjx5HTWRpj12lcv9q2f3N2et1Y3VqV8scf0RgbDcb61LPImextxyhGoqQ/9wViDx7HLZWoXb6IWy0jyApadw/xhx5F7+tn+TvfwpyZ2nBxpo/sILRjJ55pUbtyCa/RQAyF0AeHiR45ipxIsNyor4sc3Ap3bUx9D974389hNZthGyUL1/FYvl6istCgXrBolO1WiUk9b/LJb4+ihGTsZmeTK6/OUFtutAya7/rMXwwEEBzL5dJ3pshPVPE9n9O/f4POvYlmqYLXIsjMnctjG06TWBQwaRtFi7F35xElAaNkYdUdpj7JUS9YqBGZxWsl8uMVtKjC6d8Pwqi1vMnlV6ZpFH7wgvLbgRzRmkY1w9x3z2PlaoiKRKg3SXVsGc9uX617tosoiSy+foX6VAHXdJAjKt0v7qfr+T14lsOVf/la29ykxHV6vnCQ6vUlZr5xFnO5iqjLdD69m+zTuxBUierYMnZ5dYIO96cY+qVHUJNhxv/LhxgLQShPjulEBtNYhXqbGL1dbjDxO0GPUiURou8rhwkPpJn++mnKl1dLPOrThdbPUlil64W99H/tKOUrC8x95wJ2uYGkK3Q8tYv+rx5FSYS4+v97A7e+3kNdvXbp9mvXl6R2Yxnv0xDL/5QgJxKIzRze2on9vsPzyH3nWwiSjJ3PBSFZx0HUdUI7dpH98k+g9fWjj+ykevpk+7aihD44jJLOUHr3LYrvvY1TLgV5a1VDjESQYzGcUmmdJyGqGrEHjuHbFoW33qB2+SK+ZSJIUmCIk6nAw22sX6x4hhF4J00kHnp0S8Z0LatZTqWJHjgMskzt0gVqF28t+ehbJsb4GMZ4kK6KPfAgcip9y21WIChKYEhHdmJMT1J4/VWs+TncRj0wprqOnEhiFwvrtq2PXg96Addrq2FSUUSOxbGXl0i/8BL68AhKOt16bjzDaLF2BUVBHxpGiicxxm9QfOfNdcdYP1YLY+IGxkQw98YOP7ClhUPi4ceIHXsQt1Jh6Zt/gDE1hdeoI0gSSjpD4qlniR05RvpzLzH/m7/eMv5roXX3Ur9+heJbb2BOTwXCFaqKNjBEx0/8FGp3L6Eduz5dYwpw6bvrDzh/sdj6eeLD1fyPa3lMn2qPhy9eLnIzjLLFjffW18fV8ybj769ni9ULJpMftYfByvNJtMxTWI0aglJGlE9ilPLMnG4/fqNoMf3JciCbJSdZuLQ+fHc3kFQdUVax6/e+drQFQSB1tJ+L//Rl6lOFoDQHEPVAC/nmHGN9Ms/Vf/0GdqmBu6KNKwqYi1WiO7J0PLObK//y+6y1pqIi4dRMZr51lvzHE63QbOXqIvEDPUSGMkRGMhTPrIYzQ71JtEyU6ugiM98816oBRRCQI0Gewllj4FzDoXgmeJ7UTISOp3aid8Soji63Pr8ZoZ4EPV8+RH0yz8RvfkR1bLk13tLFOcLDGdIPDZN6cIDldzZobyYIJI/2c2ndtVOCnz8jzQUkQSEe7iWmdxJWU6hKBFnUEEUJ3/fwfBfHNbCcOoZdpmbmqBrLmPaqiLioh5olWH5bfeKnAWNifN1nXqNB/col7EefQE6mUDu71m/oe9Bsdi7F4s0a3eAeeaYR5Mk2ybH5rtNUqhKRItFgYvX9QIGo2szT/glBaGQHoeEdeIZB4Y1XqV+51PLKfIKQrbOBIQVwyyUa5ZsiN66LUyxQOXuK5JPPIOohpGgMPs1F2E0QwxGiR44iyArlj96nfmW1ZMt3HKzFBUofvkdoaITwrr3oA4NtC6IVeLZF5dRJGjdG1zxLJsbUBI2x68QfeRw5kWzl9beCP9HUK1mP4lkGC+deJ9zRT9ehZ5k5+R08e+PQlqjodOx7nOmPvrnh3+8UeqobLZYlf/3je7rfm7H49nVq4+2TireJVJ/v+RhzNxl3z6dyfRHXctE7w0HjgptEK8oX56hcWWhjExuLFWo3ckR3ZlHT7WSCxlwJz3GJ7e2i+8X9LHz/ckAk8v02hvKdQpBFIiMZQj0Jlt66RvXGcpvxMxYrlC/M0vXCPhL7ezY2psDSWxtdu3tIvrkLqHKEgcxxOuN7UeXwahuxNa2tAqy2E/N8F88LOnQU6pOMLrxNwyo0GaV+UOcs3V5T+tOA7zg41Sr4XkCWWfcFn/roVSL7DxI5cAils5Pa+bNUz5/FXrp1GYbvOJTee4vU8y+Rev5zhHbsoHL6Exqj1/Aa96PxxQ8OoZ17QBRxyiXqV6/cMxa2ZxqBtq8g/MCfGbWrGykSdMmpXtjYy7fmZnHKJZSODkI7dm1oTJ18HjuXW28oXQ+7kG+miWQEUVonv7gZ/kQbUwDXMrGqeXzPIZTsJpztQ5I1UjuPIWsRaosTzJ95FT3RQdeRF4j17ESJJClPXyZ37QTp3Q+R6N+PrIWozI0xf+ZVREWj69CzhLP9uLbB8uUPqM6PkRg8QHrncSRZpTx3naWLbxPt2kHXkedRwnESA/uZP/s6jdz96V5RvbaN+i4B9J4E3c/vJX6gB70rhhTWkHQZJd4Uwt8gj2QsV7Fv7qnq+zg1MyCBSe3ErfpUgYnfOsHOv/Ake/7Gcwz96YdY/P4V5l+7Qn1y6+zEzSAqEuGBFKIqMfhzD9H/taPrviNpQeciJbF5g+Lq9dv3RfxBoCu+n729L6LJEQRBug3JTmiKmUtIKCAFBeZlQ2GljjJgrdKMDHzKwu6CQHjXHkJ79qF1dSFF44i6FpB79BCIEptpJTbGRln8+u+TfuElQiM7UV/oIvn085gzU5Q/fI/apXZOwFoU3vg+TrlE6pkXiOw/RHj3PpxSkeq5M5Q/fP/+Kvt8ipATyeBdLOYDT36bUDJZwvsOBCH1ZAoxHEJQVERZQQyFsJfvsH70HkKKRltzjFPcZP7wPNxaFTwfObVxpxi3Ud8w/Bts31yEbK0hWAvbNqYC4oaT7KeNmwuvbwfPdXAtA1kNU5q6SHn2KgICu7/0V1k49waNwjyzJ/+Ywcd/mhtv/EZrVVcYO01h7DQCAvu++reZP/MaoqwSzvQx/dE3sSp5fN9DDsVIDh9h+sNv4Jh1dr7wy1Rmr1KZG0VSdfRkF/Nnv39fa/a2LBgvCnS/uI89f+N5BEmkPl2kcn2pmb/06PuJI8hRbcNNPdPZsF5uU6KN7zP9B6cofDzB4M89RMfTuxj8hYfp+8mjLLx+hcnf/Xi9h7wNCKKAHFLxXR9zqYK5vHFzAN/1aExvHOKCbVy7252PcO9ucX/6GHt6Pocsas1939l7V2ksYjUJTHY+h2dZiJqK2tsHJ2+z8T2CnEzR9fN/Bn1gEN91AyZtMY9TKuJZFvrAIHIyufkOPA9jfIzZ//jv0AeGiB1/hOihw4RGdqIPjdC4fpXl73xzQ0/Vty3KH75P9expIgcOEz/+CFpfP6nnPkfikcdZ+uYfUj13+oe/nrZZe71doRVBUYk/9Aip515EikTwbTsoTykWg6btgkB41+77ccbbhuCzmY5HO253Cbx7n77ZljHVlQT7ez9PZ2LvPT2J7cL3fd69+m+pmVvPbUqyiqyFaeRnSQ0fIdq9A89z0WKplqRfi9Hrr5ToyHTsfQw92YXnuSh6JCBFGTUWzr1B96HncKw6y1c+RFR09HiWwSd+Gt9zcG0j6Gq/ouyy8u8zAL0zxt6/9TnchsXov3+X+Vcutl5AOabR9bl9mxrTO4IPtYk8l/7XVxj99+/Q/dJ+uj9/gN4vH0KJaoz+6jsBMelOdu35uIaNZ9pM/9EZpv/rqdtvdAtoYRHH9hHFoEzFNtffM0kW6NsdZvJSe85RlAX2PZqgtGgxc63e3J+EGhKp5LYXMk5FhhjpfBJF2lj31vd9fLybNHlXPFMRoSnPZ7sGdTOHuyIo4XkYE2OE9wWlE2I4jFe/N0zhTSEIdP6pX0AfHMJamGP5W18P9G3XhM+6f+GXkeOJW+ykCd/HmBzHmBxn+dt/ROzYcZJPPUt4zz6SpRK5l7+1KUPZazSonPyIyqmP0foHST3zPOE9e+n86Z/DnJ/DXvzB5QLvBdxKJYg4JJLbWtXpQ8Oknn0BQZbIv/YypY/ex6utPttyIkn/X/2/3X5Hn8L05taqrbCrnExt7C0LAlI0CqKIW7oL2dpt4oenmHITKGEJWRORdQkltD6eL2k6WqKTaM8uREXFqpdQ4xnKM1dZvvQejrn60PieF5TlxLNIagg1kkCJpsiPnWb58vt4zmpYwDaqLJx/A9cyCHcMYFXzNPKzzJ3+HtMnvs3sJy9Tz8209iuqOmosgyAp9/+i3AbJI32Iqkx9qsDcdy+0rWS1jmhL4/d+wCrUmfzdk5z7R98k//EE6UeHCfVvHIrZCjzbpT5VQNRkQl1xRP3Or68WFvnx/3aAw8+keOqnOnn4Sx2E4zKJDgVVFxElSHaqpHs0HnwpYB1qIZFEh4IelVqyl/seDYyCJAuke1SiKRlZEYgkg32FohKiBIkOhVSXSiTRvqaVRI3BzIPoyvowrO97WE6NcmOe+eJFxpc+5Pr8W4wuvM3E8kdMF86wWL5CuTFP3cxTqs9Qt9o98tJHH+A7DnIiSeLxpxG0e7hw2gByMone0x+0anvzNRqj7fV7gqoGxJZN9IE3g2+ZlD96n6U/+q/geSidnVtjvnoe5uQ4i7//W1jzcwiKQnjPD9ZBuBcwbgR9eZVkEn1oeEvbCLKM2tGJnEhSv3qZyqmP2wwpBKQfMbS+L/E6eH4QPZHu3/xhzs+1iHPhfQc2/I7a3YMci4PnBXXLnxJ+qHOmoiTQuTOGpIg4loekiEydWo2jO40ygijSse9x7FqJhXNv4hhVjMIC4Ww/aixNaepyqwmuZ5uUZ66S3fsY5dmrVOfHMIoLxHt341h1CmNn8H0fSdHJ7nkUfA/brFFfmsI16+RvnCY5fAgBAc91mD/zWtCrsbRIONNHds/D5K6ewKzcu7Zjd4LAePp4roeoKy2ijRLX6XpuL1JYvfUOtgE1FUaQRKxivY205FYtjKUKKUVel2fdDnzHozq6RH2yQOJwH6kH+il8MtlWCiSFVZSEjrlUvaUMo++DbXh0DulIsoht2Rx6KkkoJlFctMjPmRx8KkUlbyMIgfHd92iC/r0RCgsWZ17PUy3YLYdA1UV2H4+zPG2CB7sfiiOrIkbNZfxchaMvpFE0kYWJBh98YzXKkooMEAt1N2UI156fR8VYZCp3koXSFWx3c49SFGTCagpRlKmZN7HXr12hdvE80UNHSDzyGLhOs1avgmfbCGIggSeFgmbc1vzcJkfZIvzg3AWCOldBkoP8ZtODiBw4jJze3AgKioqSSgUdimrVwPP0PBCDcg8pEgk8dNddRyiRYjHkZAq3Usat1wOFJN8PxheNtVJW91Tp6QeE+rUrmPNzaF3dpJ9/idyrL+Pkc3hWk88gK0jhMIIktZdF+UH0TFDVQJmqCUGWUTJZEo89sTExbC18H7dSQlAU1GwnUizeYkoLktRSYLpbeI061TOfkHr+JZKPPYk5NYG1MBeEo0UROZ4g/vCjyMkkxtREq+zm08APtTH1PJ96waL3UBLHdCnNtbPzqovjVBfHUbo6kZJJxI4EwqJFceIcxYn1/Rc9x2Lxwlttn+Wuru+E4VoNZk58a93ntuqweP19nGKx7XOrkmP+zKvrvv+DQuXyPFa+TmQ4S//XjlKfyCGqMvH93cT3dOGZDtKtPLxthHMyj+8gcaCH2mQeu1jHNRxERSIykiH94CDlS3MtwYY7RWOuxMw3zjD4cw8x9AsPEx5MYy5WQAQppBLqTaBlIlz/t+9gF28d0hQEkCQBSRLoGNC49EGJU6/l+Ym/PkCj4nD2zQLlvM1Lv9xLLK3Q0a8zf6NBJCGjau2LArPhMn2lRqpbo1oUqZUcrn1c5tmf62Z5xsDzfBbGDWZH1z63AolwL9pNXqnv+5hOjdGFt1gstxfEbwTPd6iaGysm+a5L7pXvIIgi4T17ST3/IpF9BzHnZ3Hr9UDQIBxGyWRxKhUWfvM/B2emaqidnUiRaMB0bP5DENAHhvBNs9lg3cFaXmqVqzjlEsb4DcL7DpB47ClERQvYoYqK2tODmu3EKZcC47YB5Fic5DPPIyeSWPNzQZ7VthFlGSmVIrx7L77j0hgfW1dDqQ8Ok/nij2POTGHnlnFrtaA+tVmgr3Z2Y87NBOzXtXdBUVCyHcjxRDBOSQ5UdgQBraeX6OGjQdmN42AX8oFU3l0Kta8YLzmZQpBkBFkKwpWCgNrVTfTIUXwnOKZTKmItLbYd0zNN8i9/i8wXfpzQzt10xhM0bozhVitB2V8ohJLtwG80mP/tXw+eBcfBWlrAzucIDe8g+eQzGDOBwIIUiRDasQtB07EWF4O2upvAd13qo9eIHn2Q0M5dZF76ImZzESZqGsbkRHsTdElCyXagtI01WNxoN4+1XMJaXGiNtXziA5RsB9HDR+n8qT9F7dIFnFIxqHXtHyS0czd2LheoWlmbkIzuA36ojSk+lOYbCFLQWLs0u8FEKQhog4OI4RBerYagabilMnImhb24jFsuoe/aCQiYU1N4lSpSIoHa24NbLuPk8yg9PUjRKObEBF7DQBseAgHsxSUEQUDp6sKtVlF7e/C7u/AaDazpWZz83bNV7wfqMyXG/uP7dH9+PwNffQDXcvBsF2OuzNQfnqbj6V10PnsLwsHmqnfrYJcahHoSZB4dCUptbBcQcA2bytUF5r57kcZM8a7G4zZsFt+4ims5dD69m/6vPoAgi4HT4YNZqFM8M41n3X5l7LlQLTrEMwqlZYdEVuHQ00mKSxaFOZNdD8YpzJs4to9Zd2lUXVJdGvPjDQRRoH9fhK5hna5hHbPhMXQgih6VMOsutuVhmR7gU5iz2P3fxJm8VOfGudXFhCLphNUUknjzYsYnX51gqbKe5n8ncPLLLH/nm0SnJgnt3IXa0UWspxdBkvAdB88ysfM5rNnVmmE5kST5xDPoQ8NNQ6q0QsSxo8eJHjgUGFPHpvje25Q+fK9J9PDIvfpdnEqZ0I5dJJ//HIIg4hkG5vwspY/eQxAlsl/+iQ3P1TUaWIsLqF09RI8+iKSHQJLAdXHrdaylQBaxevY0vtnONLeXl7GXFtH6Bgjv3d/yvDzLxCkWqZ49ReXUyXV1qlIkSvzhx4js3d9aNKxo9Ib37Sc0sqM12Zc/+Zjiu2+uO/Z2IeohYg8+TPTQYQRJaR4zyJlH9uwjNDTcOmb1wjkKr7+6TgKxfu0qvvsNooeOoA8OETt6rNk83MUzTZx8ntpNpSLm7AyF118lduw44QOHiB59EN/1cCtlGmPXqZ47Q3jfASJ7921+8r5PY/Q6xbdeJ3LwCNHDR4k9+DC+6wY9V2u1oESlGbaR9BDxo8eJHn4geI7WjDW8ey/64DC+Y+M7QdQk/9rLrVImt1Yj98p3sJeXCO/ZR/z4I4i6ju+5OKUStUvng/KnTaQp7xe21c9UFBTioa4Nczm3w8H+ryCJSts+Xc9mOneKYv3WDb43wnJlFEENWq2pEZlYh45jeeTG1ws4Rx9+CKUzi1Ms4RSKSLFosFILh6mfPUf82aeonTqLOR1MHOGD+4NwlCxhXL2GIMtoQwN4lk3jylXizzxN9aMT+I6D0tUJnoe9sIi+ezf4LvZSDn3nCKVXX9/2uNYiebQfNRGieH62XSv3JqSODaDEdQqnp7FL7S+XFkriuXarYwiAooZxPIPIUBqtI4aoSLimgzFfpjFbJLGzD7VbZ+ntUVQ9gdkooHfFie/rDkKqUzexYgWI7+9BTYaoji61kYmkcOAZqskwUkgJGIeuh1OzaMyVgtCru/GKXlRlojuzKDGdyrVFrMJtvEpFItQdR+uMIYfVIPRkuThlA2OxHGx/09O+9tq51QZdwyGMmosekTBqLqouokckKnmbesWld1cYs+bi+z5zYw2SHSqxtEKt5FCvOKS6NcIxicVJA9v06BjQEQSoFhwcx6OSd+ge0hl5IEa95FBctNj9UJxX/mMgVB/VOtjX+3kysZG283Q9hwtz36GgFhAEATO3gGduUi+th/GMza+VkspgFwLjIcgyciqNHIsHk5ko4rsuemcvtWuXcEqFwJsjmOy13r5Wnd+tYC3OYy0ssPaCS9EYSkcnkq6DKOFbZsAaLeQRVI3Q0DB2sRDI07XdWAEpHEFOpZDCEQRFQRBFfM/DsyzcShk7n8PfyAsRRZR0JhAzb4rPC4DnOHiNeqDGVFkfGRFUDa2nd0ukKDu3HHhh3nqWu6CohEZGQBAx52ZxbxZGaPuugtrdi5K8PYfALhYCib5NSmCkcAQ5kwmaAsgKeF4gVFGr0h0vM3GpnUEvKApKOoucSARNBDwPt1HDXlrCrddRslmUVBpzduaWQheipqF0dCFFY0FDAc/DM02spcW2sQuygtrdg7KFHLdTKgbe8k1hYkGWUbKdyPH4mnOuBxGITZomSNEY+uAwXqOOOTuz/h0SBJRMB1pPL3Z+OdD3vWk/m5nMu24OvlW8cODvIEt62z4d1+TC9LeZL128o3127o6hx1U6d8ZQwxKLoxWuv30Tu0sQiBx/EFHXEFUVc2YWpbMDJ18IiAjj4yidXWg7hjCuXsctV4gcP4ZTKOKbBiAgRiL4toXa3U3lxMfEHnmY4svfQ0ok0IcHMadncHJ5og8fx15awpycJvPTXyX3e39wF1fs7iBKKtF4D+FYJ0a9gCCI2FYN17Ho6HuAxelPkCSt2YQ6h6xGwPdwbINM9wFy8xdxbINEZpjcwiUi8W5EUcH3XGQ1jG1VqZXmtl2i9CME2PNQnN7dYRzLY3nG5PIHwUSTDA+wr/clEuHetu+7nsWHE/8FYaATq7CMkkjh1mtBxxSzgZrtDEKcvkd0537KV84jhyNBEX+1jJJI4hkN7EqJyPAeypdOExkKog92pRjkR31wzQZqPIXa0UX+wzc/Mwz0H2Fz7D0gc+O6w8EjCsWCz/AOmZkph3BYQFIECnmPdFpkecmjXPJ44mmNP/5Gg937FNIZgWLeI9shUa16XL3sUKv+6J7fCve1OfgPCrmJGkrIYGm0gqoHzcg3RNNzFEQRJZvBdxy0wX6s6VmkRAJtaBA5lULUdeyFReylJfQdI1izc/i2g9rThWetEhRW6iy9Wg0fiD76MNb0LIKmBV6W77Otat/7AEUNIyk6jXqBeGoQ26yhhVMszZzBdUxsq052+AFss4IeSVMtzVIrBzkOxzExjRK+7yIrISRJRdXiWGaZRHoHxeXrhCJZGpUl3D/JPRrvI0ZPV5i6Enh8VmP1uZVEeYMQb/BImU6VaHwPnm0FK2rfxyosEz/wQMDO7Y9TvnAK12zgWwZiKoO5OBuE0CQZrXcI6/xJJD2EIIgoqTS1G1eJ7T4YlNrYFoKsULlyHiV9e8HxH+GzgWRSZM9+hY5OiUcel5mfc8lkVRYXXK5ctJEkga4DEqWiR6XsEY0JiBLsO6Bw8kOTF76gM3rNQVUFEkmRWvVH7/Sd4DNqTAXkcAzPNvBaKhUCsb5d6OluytNXMQsL+K5Puj9CvWghKSJKSKW6bLYvpn2f2ukzqyvs6wF9XJCaMlGeF3ip+IHmp+/TuHQZ4+p18AMh/cblKwHj1wdcl9LrgYiz7zjUz12gcfHyquSUFxjT/B/+0ad0rTaG73vNBtI6tlXHx8eoLuO6FrISQtMTWEYJ3/cx6gVCkSySrFHOjyPLGnooCDWFYz2EynNIskpIyuI6Jp5rBUydH7x2xw8tXMenUdkgLNiUCVwPH9ezcKplqqOX0NIdCIqKb5vYpSJKPIG5MIvvOEihSCDI7rl4lome6USKxkESkRMptM4etI5ufDvISXmOHeS2ahVERSM8tAPpPpfL/Aj3Dqc/sfkH/zjBv/inZRRVQNMExm84qCpUqz7xuECj4bNzt4znwZ79Crv3yNi2z5FjCtWKh9HwkaSW7sOPcAf4TIZ5RVml/9mfQRBlJr73awB0HHmazmOfQ1JD+L7H6B/9Gzxjnqf+0m5kVcSsOYx9sMTEiR9s2clnF2tYQ20F3Sufb/b3H+HTREdsN/t6XyKsreaSfN/HcU2+f/Gfb76hINJqZrzR/bvtPV15L/0f3f8fRqx5fZvcrDaIUvB43Hxbt6Hj/iM08UMV5hUkiVC6l8LoaQC0ZAfxwQNUJi+Tu/whfU9+lY6jzzHx6q/z3n+4juf5GOUf/jqx+4s1D0C7636bv/8IPxRYq4S00f277T390f3/ocaaW7ZR5mUDblTw+WfAkAqCiCipLUfLsX84GxB8Jo0pCIiqhl0OSkvCnUOIqs7yie9SX5igOHqWzIHHwAfbdIlmNcJJlXrRuqdGVUBEljRkSUMSlKBLRzME1+rM4TtB+M018e4DGUcSFSRBDTqFiHLrHJrCcfi+h4+H57m4vo3rWjiexaei7bUhBGRJQxE1xDXdTWh1M/HwfAfHtXA881MlMImCgiw1r6UgN89tRc06KFxvv682rmfdl/u6EQIJQJHPdvxcQBbV4J1oXse119DzvWa3GgvbNfD8Oy/Ul0UNxzORhCCH3JJEvCfnr7d134Hmu+R7uK17b+J693Y+UeQQihRCEoOp1/McbNfEcms3SUO2QxIVVDlouScIQiBg4dnYbgPbNbhf77skqsii1pp/xNbz6bfeZdezcVwT17uzms5IvJdEdgeSpIIPk9de416MRxSk5n1WkUQZgZX3ffU9dz0H1zNxXAufu1tZfEaNaZPkIwhIWohw1yBmYQG7EpRkeLaBrIcRRIHO3TH2v9hLOKly6dU5rr21UfcPgbCaIqp3tn1aqs9gOutp3qIgEVJTxEJdJMN9RPVOQmoSpfkCQlDWYzsNDLtM3cxRMRapmXnqZo6GfTd6kAKKFEJX44SUOGEtS0RNEdJS6EocWdSQpWAS830f1w8eZNOpYdglakZwLnUzR8Mq4nh3V/umSCFSkaG2zxpWnqqZazOEAiJhLU1U7yAZ7iOmdwXXTA4jiwq+7+F4gQE1rQoVY5GKsUC5MU/NzN3xi3g7CAiE1BQhNUlM7ySqdxDWUmhyrM0geL6D59k4noPl1DDtMg27RM3MUTcLWE6Vhl3GcTcuR9nKeYiigiTIwf9FBUmUEQWlRTqSJZ1kuB9ZWp+vFASJzvgt6vw2QCA7OHdXBm0FK+9EVO8gHuoiqncRVpOocqTtGjqu2eqlWm7MUWksUDWXsZzt9U4VBYmk3oPp1NCVGIZTpWK2M/V1JU481M56rpnLTcWnmydjgZCSIBbqJBHqJRbuJqymUaWAYAcrhs3AsCs0rAJVY5GqEeyvYRVvOdmGlAQRvQNRWJlSfZYro61rL4saqcggXYl9pCKDTVEOH9OuUmrMsVS+Sq46juWsb9QQ1TrIxnfREd9NVMsiiyqOZ2FYJQr1aZYr1ynUpu7ZOxS8M0lCaopEuIeY3kVYS6PJUWRJQxQkPN/D8Uwsu0rdKlAxFinVZ1vz360WBjcjFMlQzk/QqCw0G2a03ztRUIiFOtHk9pLMXHV0w8WOLGpEtAyxUDfJcB9hLUNISQTnLkrNhYiF5dRoWGVq5hJVY4m6VaBu5jE3uAdbwWfSmPqei1lcIj60HzkcI5ztI3fxAxwjeCGVaBLXMgGfRsnm6psLdOyIUi9sbDhEQaQjvod9vS+2fX5u8hvMlc633XhFCtOV2EtXYt+mExuAKElBgb2WIh0NjI1hV5hc/pjxpfc276KyCQRBJKymSYb7iId6iIe6ieqd62pz27cBkeA8QmoC6MWP+3i+Q7mxQK46xmL5KtXG4h2vuiJqhmPDP9P22Uz+DFfnv9+aIFU5TGdiH13xvSTC/SgbGgMRVZRRCRNWU6Sig7ieQ9VYZKlynfniBWpmnnu5wg6raTKxEbKxncRDPbesj5aEwMApQEiNAz1AkB+xnDp1M0fJmKNcn6fcmNtWkwVRkElHh0hFhlAkHVnSUSQt+L+4+rsobvw6CoKALCnr7sPtsFwZ48L0tzHucnEX0dJ0xHeRie4kEe7dVHx/5RpqSpREuJee5CEaVpF8dZzl6ijLlbEtTfiSoBJSYoiCQm/8EJZbp7LB9U5FBjky+NW2z8YW3+PG4rtti0hJVMjGdtOd2Ec6OoQqR9gIoiQhSxohNUEq0g+A5dSZLZxlbPFdbHfz8GM6NsLurmdbylWe7/LBtf9AxVhAFjV6UgcZyj5GWE21vc9hLVjoZaMjTBdOM7l8AsNerQHNREcY6XiCdHS4bTtVlFHlMPFwDx2xXUzlP2Fy+cRdL5xCSoJMbAcdsV0kIwMoUmjD+UcSRCRRRpMjxEJddMb34rgGhdoki+Vr5KpjbeO4FSyrSiiSQVUj+L5PfvFS2981OcJIx+N0JVYXk77v8/61X6VirHWeBKJalq7EfjoTe4jqHeskOZtfQ2pev6jeQQc78X2fulVgbPFdZgtntnTeN+MzaUw9xyZ/5QRdD71EKNNLdXaU6uxowKgVBKI9O2gsTeN7UF0yiWV1zJqDY27PYGhKFAGxZWh0JcFI5xN0xveiK7cvTL8ZuhILQpfb3E6VwgxkHyIZ7ice6kKRwndM/hIEAUlQSEWCfaUig4wvvU+uOn7PQqphLYUsqljUCGtpdnQ+SWdsD4q8eb/QjSCJMolwL1E98BbGl94nX5u4B2co0BXfS2/6COnIEJKo3tX11JQImhIhGRnAStaZWPqQG0tbN6ayqNIR381g5qE7OocfFAQEOhP76U8/QDI8gCxtT7NZEATCWoqwliITGyEVucZk7gR189bKYLKoElKSAFStIAKyMcN5PVQphCgq0DSmihRipONxupMHCKnJbZ0/BAtFz7+5O8/tISAQD/VQNZdJR4cZ7nicsLqxGIMgCChyiP7UUVzXYnz5Q1zPIhnuZ1f3cyRCvbd8fsNaih0dT+C4JtP5T7Z1nqvnK5KKDNCfPkY2tnMdWfS22zfH0BHfQyLcR6rSz2TuJJXG/G0dC9c2Mdwcrru9kHpITbSM6cr5D3U8SjoyfEfPakiJ33HkCT6jxhTfozJ1GbteQpQVrFIOq1YEgod06dzbWKUcggiJ3hDxnhCl2TqN0vbCHJoSRRREPB80Jcb+3i+QiY1sWOe3FbieRaE6zna9K1FU6IrvJRbquqPjbgZJVEhHBoOwkGtRrE9v+9w2QlhNI4kqITUVXLPoyJYnu43PUyYb24muxDg7+fVNNWW3it7UYUY6HieiZe8pI10QBBRJv2k1/CcTAgIjnU/Slz5K+A6M0M3QlQQD6QeJ6BlG59++peqZ5TYoGu0qSFvNXSryaj5SkUKtlpGSeGfNG1zPoVSfafIQtgOBRLiHXHWMoewjmxrStZAlna7EPgr1KSqNBYayjxLXu7f0DCtyiJ2dT7Fcub5lj7B1poJIR2w3I51PENe7No2QbG1fApoSpTt5kJCa5NrCm5Rq07c0qKoeo1aex2xs3m94I6wsjlYM6e6eF4hv0CBiK/B9H9szyVfvfDH/2TSmBKLz9YX1A/N9j+LY2aDdjyQQiilkh6Ot8pjywtZXFpocRRBEJFHhQN+XycZ2bHgjfPyA2OMaIEgootrKs6xFqT6Huc3cEIDtNliqXL+lMfV9H9OuULcKOJ6B69mIgowqR4jqWWRx45WkIIjEQ92MdDzOhZlvYTl337tSlcOEtTQ9yYOko8PcTJjxPJeGXcKwS1hOA4FgoojqWXQlvuE+BUEgqndyoP+LnLzx23dM/EhFBhnMPEREy2x4PXzfx3br1M0iplPF82x8QJYCUkpYTTWfi423rTaW7uqF+2HBzu5nGcw8tGlIF8Bs5stsp47r28iijq7ECKnJdekRQRBAEMlEhpF7Na7Mfq+5uFsPHxfXs4iqnZTN7XWsCcg9QQ53b89LdCb2b/5OezaOYwQ9QJskm5vve81cpmEVuZNFaCLcSyY6QjIchIxNu0rVWMTxTGJ6NyE12XY8QRCIaFnSkUGiWgepyACCIDZzfCbF+gyOaxLW0sT0znULWE2J0Z08yPjS+1s+RwGBdGSYXV3PEtWzGy6Kg3fGoGYuYzl1PN9phvNjxLSOZm10+3WTRIVkZJC9PS9yfuqbt0yLCIJI9+AjOHYd3/eYvfEeW7neK3NJWEuzu/sFEqGedefvBy2LcDwT17UQBHnTlEqhOoHj/UnzTG+HlkACmHUHWZeIZjTUDfqZ3gorxnRv9/PrDKlhlVmqXGe5MkbFWAhyPX5Qgycgoqtx4qEesrEdpMIDKHKIfHX8joyA61ksla/RlzrS1i3EtKssV2+Qq4xSbsxju/Um43D1QRMEEVGUSEUGGc4+RjzUs+7BFgSRbHwnycJAs+PI3XmngiCyr+fzqHIIAbF1PNs1mC2cY750gbpZCFiwK+cqCIiCRFTvZDj7CNnYznUPviAIJML99CQPMZ1fbfIdiwv0D0js2y8zskPm//zXNeq1DXQ3BYWe5CFioa51+/Y8h3xtkqncScqNOVzPXhe6EwQBQZBQpXAwEcZGSEeGUNcY15nC6W3npWzPZCr3CbnK7XsrxkO99KcfaHsOVpib56a+vq3jWk4dy93+4q4//SCD6ePI4vrct+e75Co3mCmcoVifCRYja+pbBQQ0OUpHfBd96WNtOUIBAQSBRKiHnV3PcHHmj5uGaj1EQSIZ6r4zYyoojHQ+Tldi7xrGdvB8LldGWS6PUmrM4rhGM8UTsJF1OUo01EUmOkw6OoyuxKg0FrZNnlpBVO9kd/ezIMBC6Qqji28H4/V9RFFhV9fT9KcfbHtfRVEiG9uNLKqocgRBEJgtnOP6wltBztb3kSSN/tRRhjseXbdo6U7s35YxDWspdnU9s6Eh9X2fQm2CieUTlOqzeL7T9s4Igogi6WRjOxnueGxdGF0URBKhHvb0vMDZya9vmi8v5caoldc2Zt9iU3MliSxq7Ol+nkS43ZCWG3MslUfJV8epmzk8PFbq6SVRCfgpkf4mn6IbAZGl8rVNj7UV3FNjKqoaoeGdCKJEY3Ks1cT1vmCF4uz6GGULo2qj6NsbjqpE6Ukeojd1OMidNovjZ/KnmMx9jGFXNiXumE6FUn2W6dwnaEqUzsQ+cpWxOyYA1K0Ci+Vr9KYOk69OMJU7SaE2GUz6GzDc2uDCfPESS6Vr7Op+lqHsoxs0KZDoTx8jVx27J3R/bU1O2fd9KsY8F6e/Q7kxf0uyU756g0pjnoHMQ+zofGJdSF1AZDD7MDP5M639KDIMDkrE4yL5nIeySRQ+FupqvRhrz83zXSZyHzE6/9aW7o/l1Kiay8wWziGKCunoEH3JwyQjA8wW1rfuux18320yQxe38F2fnuT6pse+722p9drdIqZ3MdLx+LqcWdACrsr40vvMFM7iuAEBcCPYboPq0jLzpUvs7n6BzvieNqMGQjOC8DDX5l/f8J74gCpF2N/xErbXYLk2ti70uxFW8nY9qYOt0K7nucyXLjK2+C51M7/p+2Q5VcrGAnOFcyiyTia6A9Op3lE0RxAE8EVUOUaxPsOVuVdprG3S7plcnnmFeKhnnQ5zPNTd+nm+eImLM99pM0SOZzJbOEMs1ElnfG/bfYrqWVQpjHWLXrcrkEWNocwjJMJ96+6141lcnP5jFsqXbpkvtt0Gk7mTzBUvsLf38/QmD93kbQch5L7UESZzJ9nououSStfgQxSXriOIIkZ9a8I7YS1JX/oBOuK7oVkuVDNz3Fh6j8XSVVzP3DS8HBDjbjC2+C4RLUVP8jCLlc+QMRVUFTkaB99DisbumzHVkh3s+drf5MKv/UNkXeLGh8t4TtAcfDsIqyn29HyuNfmaTpUrc68yX7ywxT34gUyfXWZyeX3f0+3AcmrcWHqPqdxJqsbittnAEJTJXF94E0UKBwuEmwxqMtKPKMi43L0xXdl3YEgX+GT8dzHtrfUltd0G0/mTaEqUgfSxthWlIARlTKnIIPnaOAD5vM/VKw4nT9gkUyLVTYS4Q2pQPnTzuCuNea7Nvc72PHK/GQo0WSpfZal8tVX+8ScVoiAx3PkYuhpfN7laTo3xxfeYyH3M1q6jT8Mqcn76mxzu/3E6E/vAF5vev4CIRGd8N4XaxIaLBNezmCyeRBKVVphxK9DkKCOdj7ciJo5ncXXuNaZyJ7d4FYL7bjl15ornt7jNxhAEAdtpMF+80G5Im/BwubH4Hg8M/fS6cC+A5TS4vvjWhh5dwy5Rqs+Sje1AEtTV7XyRqN6xJSJfPNRDX+bouvfFdhucnvh9CrXJLY7Ux3YbXJl9BXyP3tSRdePZ0fU0c8WLGza0j6eHqVcWQRCIJfop5cYCsultENM7g/lbEPF8j0Jtkqtzr1E25hFECSQZwfc23VcQAnapGstcm9+8w5coq0FE8DbNze+cNbIBPNPALuZBEDduh3SPIKkhBEnGc31y41Wyw1E6dsYpzW9POUNohh4heIAuTn97G4b03qNhFakYC3dgSFfhejbjy+9vGN5TJJ2Yfm9JTrbb4MzEH2zZkK7AcuoslC5T3SCXIiCQCPet/i7AxLhLoeBRLHpstlBW5TDyuhyfz2L5CveCePUn2ZACpKMjJEJ963KMnu8wX7rIZH5jz+JW8Dyb89Pfplyfb/s8YPqmycZ2b1iqIiAS07oYSByjJ7YfXd68rOnm/a54wY5rcXH629swpPcWK4uA5cropt9ZvkWkaKly7ZbvVcMqrvOaV+qqbwdJVBnpfGJNXWwA13O4Pv8GpfrMJltuDtttMLH80YbvtCZHGMwc33A71zZRlDB6KI2khFZ1zm+BYFEmIgoSvu9Rqs9wde5Vyo05Il3DdD/8RXoe/iKdx15AkIJQliDJzZ+FlZ0gyiqC1LwGgogoK82oZ/B3QZJJ7jxKpHs40F68Be6dMRVEpFAYa2kBY256W1RyJZJAS3S0DUJPdW/+L93Tuh6+B+e/M8OFV2buWP3Ix2di6YN71nh5IwiIQU2hcGeswu3AtKsslTceS1S/d91AfN/nxuJ71K08gigQzuqoUQVJk4h2hdGTGrci+VYa81QaC+u0LgVBbIW+NA0yGZEdO2UOHJD52k/p6PrG7EZxjULVWjju/VvY/aAhqwLhmIi6yTVZgaoLyMrm3xEFiY7YTkI3EcR836du5pnKndx2ecgKXM/i2sLrG3pYmdjIhgs8SVSIaR1cz71LyZhHk7dXqub7HlO5k8wXL93+y/cRllujvoFXugLPczZlhxdrU3i3SMmYTrUZbl8DoT0FsxkSoYAcdTNy1RssVq7dsepX3SqwULy44bPSmz6yzngDlAvj1GuL+L7DwtRWIx8BgvRDjcnljyk3ggWbrIcxcrMsnXsLSQuhJzsQJIVo705ig3vRkh2AQCjbS2xgL+HOQQRZIdo9QrRvN6FML4IoocWzRPt2o8bTW6pWuPMwrygg6UpLFNuzQe8bwndspHAUc34Gp1Tc0q4yBx4n1NHPxPd+Hc82kRSdoRd/cVNBYUkNgSAiayK7n+7ENlx8Hxoli+mzhW07IdXGIuN3Gaa9HXQpSkROAtBwyvj4OL6F7/soooblNXD8ezPpu54deAIb9N1VpO3Vgt4KDbvETLPAWQlJ7PvyMLnrRXwfYl1hzKrN5IfzWJWNJwTbbVA38wETtG2RIRDWkgBIkkAsLtDTIyLJAo6zuXSs6zn4vgM37etelxzdCSRRRRQkHNe8a9mytRjZH0LTRdSQyKUTVRo1j0hcwmy2dVM0AbPh0bdDp1FzyS86OJa3Tqs1omWJhdaXRXi+y0L5SlNV6M6Rr46Tq95oK7yHoFYwGe6jWJ9uM7a+72E5dZJ6H6qkU7eL2zpezcwzmfvonl7r7cLH25IQSd3Mk4oMtH3meg41M3dLoxZI+N0cLRG29I73Z46tC++6ns1C6dJdMf5dz6LUmMV0quuY+yEluNc3h6BDkQy10hxF6xqZnkMYteUtL9x8gvDuQql90aTG0kR6PARRxjFqgchOOIEaS6EnO1k68yaxgX14tolrNQhn+8kcfILq3CiJkUMsnXmTcNcQnm0hKtqq93oL3JExlUIqyYeGEWURfPAdl+V3r1O/cQ0pEkW2zG3lSxu5OVzLWHXvRRE1nqE4ega7vl69RYtnSUSCnKAPhBIKjuVRmLbvKJo3mbt75ZDbQZPCWJ5BWE6Q0Qcp20vExCyiICEKEnWnRMG6PcFiK/B8B8Mu4eO3NHxXsNGLJglKa8UYiE5s7UFeLF9p1d8JooAWU4l0huk5kuHGm7MoYRlFlzc1phCoRrmuiby2DlCgKbQgUq97zM97mCak0wLRqIDnbXyTLaeO7RhIarv3n43tJB0ZukeCEEEoLRruJqQmsOxaUO5ws4dwEzQ5QljPUK7P3TE7dCMM7wthmR4jB0KMna/TM6wRjkkoqkCl6BJJSCxOWSQyMuGYRGe/xqUTVTy3/RoGkpnt4cEV2bWF0uV7cq4zhTPrjKmAQCo6yGzxPI01qSHPdzGcCunwILbboGzenry1FnOFc1jOD1Yw3fd9DOvW6lNBfnb982Bt5HXeBNe38Wg3tgLctk5ekUJkozvWfV43C1SN5bsWdzHtCjUzv2EZXCY60vYeKmqERGYnjl3HtmqEIh1sR5va9Wxm82fXzVmOUcMsLaMlOtGSnbi2Ab4XGFZZwfc8qjPXUeMZtGQX+B5WNY9TL1OZuY6o6Pi+T2N5GknV8W6TL4U7NKZadxw1GaI2toRne60enoIooqbS+D6I6tbDmaWxM7T1EAJcs87S2bcw8uup8ZGeERIjh7BNl5mzBbr2xNFjClp4+8NZyWmIgkQ2ewBZ0jCMAvniWFCDKim4rrXJSklAltRAGH3dCrEdnu8SkuKIiIiCSMVeIhE+gOf7eDj3fAXt+g6+5wWJ+DUQxZWcQWBoY1onKb2/ZRSX6qNbYgIC5MpjrevimC7THy8i6xLj78yhRhUcy8Uxbn1dHM/E9W6eEIL/ZFHDdhvoGuzaLTE8IhOPB/0aTXO9Qa2ZyzTsIrq6+hILgoCuxNjd8wJTyx+zWLl2VyonwT4lYnpQXyc2Jy4fD12JU67PYzl1MvERBETy1fGgDtOzW00T7qUx9X2f5blVY3nkiRgfvVbi6FMxogWHwpJDtldB1UX2Phhi/FIDx7lZ+1QioqVR5fC6/dfMHDVj62pPt0KhNoVhV9bJOsb1blQ53EbSEQQRXYnj+14zN7b1d9txLfK18c9AjntjQ3kzNhKEWKnnvOXefY+NCAS3Ey0IZFLX1w9XjcUNtYG3C8tpbJLrFYjfxFz2fBejnguaIzgm+fkLWzbmK8S4jYhSaiwIy8l6GM8yUGNp9GwfTr2M73uI/3/2/jvIliu/7wQ/J/3199atW948b/AevGkADTTakC01nUhKojjyKxO7s7N/7MTuH6uJDe2EdicmtDOKCU1odzTSSCIpUaITqSbZjm2ANkA3/MMDnjfl/fUufZ79I6vqVb269cq8QqNF7hcBoO69mSczT2ae3zk/8/3qOqpuomg66aFjrH7wGma2iKIZhJ6D21jDzPWTnXwEI1vE6+xNyXkoYxp2PIxiGrfcJux6yDBCaDqJ8WNouQIyCAg7B0tI2WpIZehTu3WJoNu7jdBz2Mhu79Q8lq83GDyTxczo99vkPdGyV/FDh2x2HENPUW9Mrxf3KmQzY6SSJWy7Sr05i5QBqeQAmmbR6ZYxjBT57ASu16bRnCUIbHQtSTLZT6e7GheEr6MT1PEiGyklQghCGbLi3CWSEQoKvny4AX4HpFw30Pe9WFsmfYrQsNQMXb9Gx48p3vZLjB+EHh3vngsr9CIW319DNRR8OyBRMJGhxOs8OI4dyd0mEmJzAG23JfWa5J01j1S6tyGFeOBvdBfJJoa3zc7Fer2bNfQ5StnTLNevUmlPPZQIgBAqKaufrltF1xKYeoYoChgpPs70yht4QYdMYohCaoLVxvV1hY2jV58RQjA4blIYiK+3vORx+vEkRkJBVmH8lMXsbYfAl0xdtSkO6aRzGq3avYFaVxNYerbnINy0l45soheGHm1nbYcx3SDLaHa3HitO3jHV1OZ17hddr3ok5CQPi/1mIfd6LmIVqgf3e6wYtfNd2Kuv8ve5lDdg+42HnmgC6+IbvdvZqtMLEPoOtdUb22vS9w1Js7u8Q02oszyD26qChO7qLE51Ga9VxWtVkaFP5LvIMMBtlPHtFt3lGZz6ajxxQxCuu35bCzfRrDRC3IkZ+PZIjDqcMXV87MU6ei6BlrGQfkjzyiLO4jwJVUPLF3aNd+4Hke+xeunbhG7vG+I1Kkx/8zdAQG4owemXBwi8iNn3KgePl66XoQSBSzYzRrV2G9upoioGlpnDNLJ4fju2QUIlnR4GGTHQf4G1ynUsq0AY+nEBs55ifOQF6s0ZTkz+FLenvrGZQBDLo22/6U748LPAh0EkIyIi8tY6qTsSL7T3NejbXm1bjEvRFEaf6mfkqQGEgOnvL7F0eR8rGrn5n13h+zA9FWBagpkZibuLDYxkwEL1A/Kp8R18pkIomEaGAf0shdQEbbfMSuMaK/Vr+16Jb0UY+dhunXiFHycneEEHx29SSE9i6mk8v91ztXeUeONrdVQN3v9ek2Y1oLriYyUVokgS+GCYArsTxhO4UJJIKXRb2++vrlq7JK1I2ke0Kr3X3ir9me0uxpj5p4iiqITrA5ZYJ1FQFR1/n8/kBrpu7eC11IpKavg4bm1lfRIfy0DKKEQG29vSUjlCt4MM9lr5ykMrufQiFdnlEAfG1jrWzWbWV3nBEdSgSxkS7rKq1pRYAnHr/dHNNIHXJQw9kplBuq390XVKoNWjdjtw2gRO+77vOptCKRvwWts5op3Kdi9o0G3tuqDrhUMZUxmEpE8O4JVbCENFzyZYe/V6bNl1naDZ6K1QewCE7u7xjijwaM5eAwnVuQ7v/cdZ8qNJwuDgT1Zc9yTpdFeYnf8BQ4NPEvhd5hZ/iOPGS/tGc5ZIBrGMllBJJAcwzRye16LbrdBsLeD7HUr9F0glB1BVg3RqiFSqRKv18HHQDUmkpFkkaeQx9UxcBqKY64ktWiznpWjrf+to698/GBI3bOMEzc1Y6n55Lb2gu23CpCVUSucKvP/vbhAFEaF3dKuwZFLw+Z82GRhQcRzJ7/12l+4u9q/tlrmz8n0ujP4Mpp7ZblCJGY5MPY2hJcknRzkx8BLl5i0W6x8doK4OQNKyVzD0JKoay6hlkyO0ussoikYmOYjrd/CCdkytlh6jP3saXU3g+h3Ch5TG20Cnub2fwyDC6d4bhO+NBfG98t2d90VVjZ60gRLoPmTi0c72epPcm3pmG9lGJCPsoImlZWi6q3uGUbYiiBys0ggDF57G7zToLM/Qmtqj5E1GqLpJeuw09ZvvIRQFzUoSei7hfcY0e+IC7dmbeI29JxoHOe9t+xGyL0t5COrp3XiCTw1+lhMDLx28wR7oFbcV6wxZqmJsM6bJzBDd1gqh7dM//Cjznco++03iH4Lh6+PCoYxpcrJI/b1p6pfmkGHE5N9+CaGpRI6DszSP0Vfasybn8Fj340qJmdY5+/khhs/ncFs+7/7e9IFb80M3bo6ITmeVxeBt+ovnMIz0phtlw2YMDDyGquosLL7JsYnPbgpzbzz0URRSrl5nZe3yutD0YQ1KHOfrz5yilD1FPjGGppmwLZ1o77doL3ePJKLlrm7qROqqtW9C79i1ssU1H0kCN6LvRBav7dNZs3EOKDywGxIJQa0akU4pFPoEqvogX76k3LrNpdn/yIWxnyVt9gOiJ8Wiuh6LG+17kpG+x+k4VeZr77Fcv7ruJux9jEgGLNfuH5zjY8QTDMla4+aW1VT8ea1xa/PzTxJi6bReUoMS/yG4SnvB32USYWqpbeUHqqKRM4eo2vNYWgYpQ+xgf1JyQegjhaC9cJv6zUuAJH/mSYxcERmGNGeuYfUNkxqaxGvXqHz4BjLw8btNrPVVm9k3SGr4OK2Z68jAo/j4Z9CsJPWb76PqJn0XnyfyXBq3P8Ctre56Sw/t2pd7sJ5tbnfQhgV6D29JLPNnAB9z6d6W2n6ARHqA4tAjlEYeJwxdus0Von0QNmzAD93NipJ7Y+In834dypg6Sw36XjiJjCSoCoqlIYMQFIlfLSM9j8h/CHeBEBjZIpHvbi6zFU0nO34eq2+I1sItuqsz5EYsBk5maCx2aa46dKoHH7w3ZkDFvrMUC6fjgLhdxXNbSCnpL54lkx5meva72HaF0uhLmEYWKUP8oIuqGoyNvsD84o+o1m5x8thPc2LyCwDcmf7WgQyqIjQy1gDj/U8zkD27jRv1KNVPth4P5ObDPZA8RdWexQ72Vp24R3MYIwok3TWb0pk8QhEsvr92ZMa0UomolCPOnRdcvuRj23u/LI3uAm/e/jccL32a8eJTaIrRk5D7Hm+sStrq59zwFzleepGF6iUW6x/ieI19Dohy20q9d/LIT5YR3YBYzyjvhaOt0ZWEu2SoKoq+baoYm5KIpJ5DU0zcA4REIhmAkKTHz2Bki7QXbqEm0rRmbqCoKtnJ87iNCu2FO2xMzO+H16xgZAoohonix4kqtetv49bLpEZP0rzzEVHgrruGV3ed2z4MAcs2bDy395/rAYcFTTHX67GPfjzZP+4d226vMnfrVcLQI9p81g7QZ5rK8Kd+ls7iHfRMH5HvUL/zQcyKFAYg43weIGYwkhKrMIhQNZzqCjIKEZqGQGxuf1gcypj69S7LX7lM/skJZBAx+2uvg6piDY9h9PWjpjLYc1OHSEKKoWg6w8/9DDIKmf32byIUlf7HPkP/Iy8AUHris0x9/d+wevMW3759jcJ4ksmni4w8kmP+cv1Qx6xUb1Ct3UbRBIomUQyB57WYmv42IJBENFvzXLnxu9sM5OLSO4j13wFuT319XYn+IDNSgaVnGe17nPG+p/ZVdA1xnEMSrScbSTYUEuR6HO9Bmn6q0BnNXiCIPIqJY0QyIKnn10sQ9jamW/tA0eJhcOZHyyiaIDuSOrC27IOgKLCyEvHtbzooQuw7TyGMfG6vvMZC7QMm+5+llDmFoaV21Tfd+M7SM5wcfHmTcH+lcR3bq3+iNYsfJ2L3d29P0mHdlLtht1imItR7BoOYOWmtM0V/6hhu0O7JqrMXukvTNO5+hAwDrMIQodOFRAq/00RP5zDSBapX30SGIUJVUU0LRTcQmo6iGShG/Dn0HGo33qXvkefoLNwBKQmczo/HIKkKWqmA0DQIQ/yl+/rhgLZaUQ4uT/ZxQ1E1+gbOouoWQqjM3foO+74wKYkCD7MwgKJouG6X/KknMbN9dFdmcWorFM4+i4xC2vM3cWorpEdOYuZKNGau4tSW6b/4EjIMqN/5ALd+sBKsrTg0aYO70mTl6zF3Zfr0IO1bK7hLC/HKVMqHsvBCUbEKg1RvvgOAWRgkM3aG+p3L1G69y8iLv0DpsZdpL9xCRpLqTIfqzBH4zpWIvok0udEU9YUO1Zk2qq4gJQROTEyw8beR0kgWDNqrDpJ4dh94IUKAUCNMU8Nt728gSpv9nBh8iaHc+V0lkKQM8UMbP3QIIo8o8gkijyCM/w6lTxgFRDIginwSRp7xXei7IHbTzjc/IqX3Ue5O44VdiolJ3EPEIKycSaqUYOBcnHiWHU6x/FGF2vTBdBV3QyYr+MwrJmEkadQl09PBgULytlfj+uI3mTPfYyj/CH2pYyTNAoaWfGCMOGkWOD30OUqZU8yU36LSvnsIXcuffDxISOFhdGp7t7dLf8vtK0RF0RlIxcpCST1PUs8fKFEsdB2sRIrciQs4tVX8dp0o8BGuHdezSwjsFsmhSbxmFS2RwsyVUHQTM9ePUDW0ZAYZBoSZDlZxGL/dILC7CLVG5Hsx9257f67nw0Ir5si8/ATunXmkF+w0pkdkz6WM8EP7SBKQHoQwdHckVmXy44Shh+91SGaHt7ht9wchlLgEUFEws0VCz6a7Nk9yYByrMEjQbeJ3GiQHJ+Ls3voqbqsaeyzMJIHTwV6bI7AfLiH0wMbUHIxJsM2hLIqugYDSK2e5+T98HTWdwSwNEXkOfqNO5Bw23iJQdAO/XQcEqcFJhKJSu/0ednmB5uw1So9+5pBt7w5FFRQm0lhZfdOQFsZT5EZSrN1qUJhI0yk7rN1p0jeRZvK5EnffWEEzVBJ5g+WrNVRdoXQqi9sJWLhc3XOCZelZTg29sqOYfQNu0KFlL9N21mg7a3S9Go7XxAs7D8xY7M+cfKAxhdgd1vLuzcTqzuKhYjx23SX0I6ycQeV2g+xIas+SmP0ikYDxcZUwlKytRbSacq8M9V0g6awnJy3qH1BIT1JIjZO2Bkib/Q9crRbSE6SsfmbKbzFbfvuhSmp+EiHZvWxHUw2OQBdhe3s9EEp/x6sSyYCOV0PK6MCTPLe2SuetnQllQReEZiDDAL/TIFEaXTeKdSofvbFtW3v1noC5u5FsJCX2lsVLPEZ9fJBBSFCuEzY7SL/HPTrgyjT2NOzcKYwCluofUT1AEp6R0Aj9iCiI9n0aG0Z7K+xOGd/rki1MxG7Xnme4GwQyigg9B81MxmWTCFQjSWvhNnoyi5EpEDhd2osxR3IU+JipHEa2SOja2Gvz5I4/hlCu0l44vHLMgY2poqsYpQypySJ+y4lFunV1nRRYRTENIs9hB1/ZAREFPoqmoyXTJAcnccqL+K06ADIMUfReCRMPj41KDRlJknmT3HCSU58ZpLVm0zeZJpk3WL3dxHdDAjsgmTconYxrXFsrNpqpUDye4ca3F/f1REwUn2Uge3bneUhJrTMbZ5m2Z+h6vbMgHw6ClF6gmJxcP2bESuf2gTUwN+pJ7arD8OP9aKZK+Wb9SM5QUQTJVOzaVVV4/EmdO3cCgl2UY/Zxtth+A7t2mZXGddJWiVximHxyjHxqnISR67mXoSU5MfBpAKZWXz+6WNjHAEvNxAYo2t99jKJgl4mZ2CUx6bAQPTVSgfV6zPv0ZVEw1CRShqjiwaw++z4DTSewW4BENSxaM9eIgn3MFh6i1O9hELVtgnIDfbhEUO7B8XvAlWkY+UQyRFmvd99sRgha9iqrjRvbth8+n6N4LIXTCli+3qBdvjeRPHa6SGuhS6Oyf6ap/uNpouaWGmcjjW6kAUG7sUC7fjBe9ygM6M7fJPBsNCNB4LRRzSSKZhB0WziVRVJDxwk9O3bzA16jjFDUmPheUSCKaM3fwGs+XOb6gY2pPV/Db9h07qwRtGyQ4FXaICVhu0XQbqEY5rb4x0EhowCnskjh9NMkSmMk+oZYff9VAjfuDDPbR+h+PEXZoR9Rm+vQWnMYOJMlN5LESGibz+zA6SxXvgb+uii5ntRACKIwwusGqIZBfbFDcx8KNimzn9G+nRJIAOXWHe6u/oB6d4HDJK7cTyPYC6rQSBtFLC2DG7Qx1BSaYhxKUFozVUaeGqB8s04URtiNo1m9dbsSx4ZSSUHTBMnk0cWpwsij0V2g0V1gtXmTtFWimD7OQPYsSXNn+YAiNCb7n6XRXaDSnjqy8zhqaMKkYA7R8Fdxw86eRjWIvJ7kAgKwjCyNI3zVelHMAbh+ZxtJQRT5rHRuoSlGXAN5iFrgXlCtJHo6j1dfw/GcPQvxP3EoCmouTdTqoOZ7KOcccGiQRLh+B83cXgoVl9Tt9BoMnMygJVRCL2L8iQK1+S6lE2lWbrbom0jSfzyN74TcfbOMXfcoHk9Tm++SLpogJYXxFKk+g/nLdWQkeeFvnOD6d5ZZudWkueKQzA6hqDqZ/BirC5cIvANO5KOQzso0ALuNOM3Z7by9gdMhWLp77/NDunc3cKiYadDa/uI1r8a1lELTEaqGu7JI6ByeFzMKfMpX3mDk+Z8jM3qa+p1LtJfuxJlZQiE9epru8tHwrG5F6EcsfFAlCiICJ6Ryt0VrxWHqh6u0Ky7dmodQ4sG8U3G5/q1FfCdk+UodRRe0yy7dmkt9YX8PxFD+fM/6vq5bY6b81roM0mEMqbLvFUUoAzpeFUlEQs/tu850xzFFTNzgdXy8jk/gHE2dqZSwuBjy9tvQdzGtMwABAABJREFUakZ4Htjdo18lOH4Tx29S7y6w1rzFWPEpBrNntxG/CyHQ1STHSy/8RBtTL+rghC1UoaHsI+YZhM6uNHIZs8T+Suj3hkCQ2kW1yF53526FIhRSenGdMcw/GoMaRaiJJMnkMbpLs4RHNJB+XNAKGWQY4k4tkn7piZ3xxEPMLdtumZRZ3PadEAJTT6Mq5rYaaKHAwKkMzWWN8lSbwliSlVstxp8okMjoVOa6lKdbPPELY7z929MMns7Qrbr0TSRRFMHgmRyL1+p0qnGbiipYudXEbsTeAE2LReg1PUE6N4rnNOm2tsv1/eeCw9WZHi+hJjTaN1eQYcTQzz/O0pfX1UOyOfR8H92ZO/iVtcOdlZR0VqaZ+savIRSF0LWJ/PhmSCRzr/0Ofvdoklu2HxfcLaTsbjvYlkS09bfQj2gs7ny5Ix98e3+GpD99suf31c7MIQXCY8SD/t7GNJQ+Hb+KpWXQhYUXdA8dD4xCidtwGXmyhIwki5fWqNw6muSMSjmi045IpxXUjzkZMQgdqp1ZbL9JJCOG8xd2GKR0YpCkWcRXGuQnM2gJjfZKl/ZKFxl+8u5fXbHIG0O4kY2UEXb44Kx6L+ji7MKlmrYGju7EhCDToz2J3KGQoioGg+mzdLwqitDRj8jdLKMIRdXipL6HDEX9OOCv1TBPjZN++QncmeUjcTc3u0sM9ggtJY0ChprA3jIGRKFk8Uqd7KBF4EaYukZttsOpF0qoukJrzaE63SE3FJO+qJqCoitoporbDrjyjQXOfm6I0I+YfbeK2wlorTmb+ame0yCZGcJz25hWFsPM/NkxplrGInNmED2fRM8mQEryj0+w9IcfxJlvtr1O4PCQig1RRNDLYEpJd/UgTDU/ueg1S5dS0rKXH4oMXRHaDg7MXlCFTtYcIpIBNTdef+yHS7QXIj+itdzlzJcmaS118btHN1BlsoKf+TmLZFLQbku+/Ac2uzBNHhEktldjsXqJjFXaRr8mhEAVGllrkLJbJz2UItln0V7pgoS+E1mcxrq0XlLH7wbY1Y/1ZO+DQBMG3aCJoVj7ijVGMqDrVvECG0PbriqUT47sWK0cFgk9t2NFBGC79fWV8VZDIQkiF9tv0J86juMfzcRMMS0UKwlSopoW0QOY1j5pCNNAuDbOjRmEppK4cALnw4fXXK52pnt+n7L6Y8GBrXJ3EporDrW5LuNPFGitOXz2vzpL+W6bMJCcfWWQR35qmFuvrxJ4cajrpf/dSTw7ZPGjOvmRIvnhBNWZNlJCba7DS3/nFNe+vUx5qk2rPk+7cTRqWZ80DmxMIy8gCkK0tInRn0H6IbO//jqEESKho6bSMTVXKk3YOZwLRag6fWeepjH1URwnfYgym30fc91fIrf89+OEImLqv/vjpZEM1jUvD38OmmqSTYzsuV0kQyLpM5Z5FCdsApKp2tsH1o4E0BIaxTN5Xvvv32H48X4yQwmaC0fkQpMwMx0yMxWwthbxMHwgB0HDXqTr1shYg/fdJ4GhpQgaIe2lDn4nZnw69vIIMpKc+VI/USip3KqTG89w+bduHJnbe29I2kGVjFYkkiHdsL6vvTpuBcdv7DCmqmJSypxkuXH1oc9st9Kvpr20YxIXRD4LjY9QFI22V6Z7RMY0dLrIwEO1UsiHpDz9uKH15TATaaxHThC2O+gjpSNpt9FdwA1aO+LXabNEJjFE01nZrCO//NWFzd9nL8VJkMpXF9fL9QARu26jdSrXq99c4tp3lpFh/LuiCT6Azd/f/K1pVE0h9O8JGjys5NtPCg5uTN2A6uu3qb83g9+wYYu2ZOS5BO0GWiaP9A4/k1U0neEXfo7BZ75Ic/oKtdvv4dRWiDz3Y3HNDDBKHwME+HRoscQ0W7VANwybSQINjS4dxPrniBAXlw0DrKAQbclK3M7qsoV+T8Y0hPK+rLp7FIWHhSBpFMglh/feUihEUchU/S1abuxWPiwxN1JCJMmNZTCzxpGxHwH4vqSvT+HTLyWJIvjn/98O3c7HP+EJI79nfwjBput361kkChYzbyyimSrF0wWWPiijGipm1iB4WE/NARDJkIo7hyJUvGh/x205K7Sd8raJgxACRdEYzJ9npXnjoQY9VegMFS7u+F7KiGpndocnRhEqWWuISneK5dbR6KkCqIaFULWYDWeflKeGnsYPugfKMj0K+EtrONg4d+YhCNFK+SNre7H2IccHXtxOUCoEg7lzVNp3sb36zp3WH/Zoq6tZ3jOUsF4uvOVzdD9fumSLIf2Eoarr49bRnM/hVGO8AC2XIDneF1MKSok9X0MIBb9eo3P75kOVxoS+w+y3/wO5E4+RHj1F7vhFnNoK9buX6SxPEXRaR7pitUiyxgJtGoxwHIskEREpMkREtKijoDDCMSSSBlU8HAYZw8WmwgouNimyWCTxcGlSRUGlQImIEB+PNvdm15KIIHQxtO23QFH09ay6A2rJrUNXE4wXn9lTIBjigSyUAQOpkwykThHJgNnGJZx90AneD98OmXtzhckXhrAbLovvH53aiO/D2mrI5DGVcjmiv19h2Q/xPmb+BFUx0FRzh/dgq7RW4AR4WpwUsvxhmfFnh0j0WQgBky8Oo2gK3fKP080LKa3AgHUMP3Jxow6rzt7JUkHoUu1MU0xPYm6RSFOEQiE5TilzitXmjQe08CAIxvufXudJ3o62s0bLXtpR56oIhYzZT8eLSWCCyN0htXWoM9E0FN1EhkHP3B1FaJjm9hXbQP8FllYv4XmHY3R7GMSPnkACUffo6psXqpcZKz6FoW73RBTTxxjMnmOu+u7BlXc+SQiBkkwgLBPpekTd7raFXq/tjYkRQODNLjy0MAscVhx8IMPIX3iS1IkSrevLJMYKXP9//hFCVdFzfQhFxa9XDx83jSKaM1dozl7DzBXJTpwnPXKS0qMv03/xZbor07Tmb+LWV/FatSMokxGkyaOhb64eS4ygY2KRAASddYo9Hw8PGxBERLi4hAQkSDHKCVrUGeMk13gXkIxxgnnuELKTDanr1TC01LbvFKGQtkroqrWjuHkvqIrOaOFxBrJn9rW9JKLr16jac6hCww27Bz7mBhRdIdFnMfX9RYYf7yfZZ+LUj+bll8DycsT1qwH5guCZZ3WuXxNcvXKvTxWhoioGQbSTYeWwyCWGSfRQ2JAyorNOb1efuTfAVu80qN1tICU8+pdPc+2P7n5CdLwR3aBOIH00oWMpqTgZaQ+PR7l5m8HsWYpaalvSla4lmeh/hq5Xpe0cNKlQ0JeeZLL43I5fwshnrXWbdg9lmkhG+KHDUPocgXSp20u0vUMmNG6B9H38Vh0ZBj3rS00rx7Gxz+C49c3vMukRVsofPfSxDwwhsM4dR5g6/nKFxJkJmq++82AjsU/Yfo35ynscL72wzfUuhMLxgRdwgzarzRtHYlCFUDC1NI7/MSSNrkNJJEg8eh41k8KbW8KdmkXNphG6RtjqIF0XrdiHDEOCah2CAOn5mCcm8ZdWkFKiDfTHJZ61BvIQM/VDGVM9m6B1dRF3tUXjo3mGvvQYKGI9BiEx+gcI7c7DJyHJCLe+xlp9jeqNd0iPnqJw5hnyJx+n7+wzdNcW6CzdjYnvV6YfKNu2FzwcbLqYJEmRRUMnwKOFQ0RAgIeLjYtDhxY6Ji42Nm18PLIUCAmICKmygoJCSIhNl8ouxQXV9jT55NiO7/vSx1lt3KDWmd137NTUM4zkH+XEwKf3zb+pCJWMOUBCy9L16xQT43hhl67fozh8D2iGwvinBqncbpAomCQKFojmkRgTTY1l2G7eDFhdDfF9OH58+zVaeo7B3FnCyKdpL9N2yw8hdCxImX2M9j1O6r5ELikltt+ktYtR2fCATf9gf6QdHw8EBXMUBZVuWKcbNvEid09j6gZt5quXyFgDmHp2c0WuCIV8coyTA59hau0NWs7KviYsqqLTlz7GqcHP7pDDixPtVlhr3ux5nxJaltX2LXQ1EbN97aKPeVBIGeE3qniNck9j6q/LL7Y79zJKC7kTBP4nITYuELqGmklBFOGXG0diSCHuh4XqJQqpCQr3iYUbWoqzwz+NpedYa95c50U+2HEFCoaWImX2kUkMkrEGuDL/lY+R7CQi6nSQnodfrqAkLaxHThM227FrWUrM4xOIhIlz7Tb+4jLScSGMn2NjfATr/Bmk6xJUatiXD54jcGjVmMgP6c7VyDwyjD0X0+YJVUWxErGH8ggl2PRkjtTwcVLDx9EMC7uyiL0WM2UkSmNkxs9Qu/0+1atv7hCF3S8skkgkCgouDgoqBub6OrSLROJg07futm1RB6CPAUICOrRJk0cSxXEOuugYD3x4Vps3OFZ6fkfGZdoscqz0PBKo72FQDS1JITXJYO4cA9kzmxqmGyT4D64bFSgo+JGDHTTIyAEOS/YZuCHLH1UI7IDK7TpREB2JMUkkoL+kUqtFnDmr8cRTOt/8usPdO9vdMppqMpA9S9oq0XErMf2iW6bjlOm4FdygvY94sCBp5MmnxhnInqWYPrbDXS6RLNY+2LOt1tInpbMoUIWOHbawlBRtv0bT3/+Krty6w3z1EscHXowT5NafB1XRKWVPYWgJlhvXqLSm4trQHjdZFTppq0Qpe5rB3HlSZt8OV7kbtFmoXaZp7yyDECj0p46z1LpG2uhntXPwyd2DoKWzqFYCp7yzHj4IbNqBQzo9TF/uJFJGcRJUdwV2Ubz52CAj7Mu3QFXjgf+IifVtr8HU2g83jd5WmHqKk4Mv0ZeepNqeoWkvxu+R3+45KVMVA1NLY+ppLD1HyiqSMvpImUWSZhEpQ67Mf5WPa4YZdR282QX00WGsMyeQnk/U6mB/cBWkxJgcI+x0UGSEWsjhL25/7sxTxwmbLcJ6A8U4HNvWoUkbgo4LkSTsuoSOH6uVRGFcFJ1Kx8TDDwMhMHMlsscukBk5iZ4u4LWq1O5cwl5bwG2sxp2Ujd3A+WMXcWsrNKYO7o4ps7ju4o3jox2auNjrLt4NoV5oEpMbeDgEBNRYw8QiJMDHo8wSKvF1SyQBPktM73rclrPGSuM6I4VH77t0hWLmBKaeod6dp95dwHZrBJGHQKCpJqaWJm2VyCQGSVsDJPTc5oAVhC7l1h10LUkxfWzX40cyoO2VKSTG6EtM0PWqeAeQutqK0IuYfWM5rik/VAu9kUopTEyolAYUKpU4XmpZAtftfRRNNcklR8glRwhCFzdo4wUd/NDB9du4fosgdAmlRyQjFKGgKDqmlsbSs1h6joSRx9LTOzJPpZTU2tMs1j48wis8akicsE3VnSej9xPIgxmASAbMVt6JXbvFZ7bNrVRFp5CaJGX2M5y/QMetYHsN/NAhjHw01cBQUyTNAkmjj5TZ15Pz2A8dFmuXWWlc680JLAR5a5RQ+mSMQYSAlrt2qCzz+yHDAKFq6Okcbn0N2OnN0lSTpNWHrifo2lUSeuLQZCYPCzWXRkmYeAurJC6ewv7w9pFRG0oiqu0pptd+yImBl3ZQaaqKTjF9nHxyFMdv4gYdgtAmCD3CyI8T1ISOqmioio6mmmiKia4m0LUk6hbCk+BjzpwWCQt9ZAg1n0UxTdylVaxzp0g98xj+agV9qIQ2NEDU6RI22wjLxJgcw5gYwV9dw5uZJ/HoOYQQeHMLex+wBw5lTBOTRVRTo3NnDXe1xeDPPMrqt66jF4q4K0uEdvehXLyKZjDy4i+QHj6BUFU6S9OUr7yBU13C77biTLx12OUFosAnOTCBkdlZw7YfdNk52/Jw8LgvXR+fGvdm+Q5dHO65fzo0SUwUSR4v0ReVqH7/5rako/shZcjd1dfJJUd3zAwVoZJNDJEy+xnMxu5LKSWI9fWkoqEpxo7BKopClhvXuLv6OqOFxx5oTAViffWhEkQudXfp0KooQhX0ncgxcL6AELB0uUz17sPHSBqNCNuRBAFcuxogI3Y1pPdDU0001SRlFtdT+eOEKynDTRHvDVHvmE5Ne6BKSttZ5frinxw6rvzjgiQmarCD1uZE8CDwQ5s7K98HJBPFZ3dwuJp6vALJJWKDJ2WEXGcnU4SKoui7Mi+Fkc9C9RLTa2/u2o9SRiy0PiKMfGy/FSsiHZGbV9HNOAS1TojeG5Iw8unaFaSM0LXUNiasHysUBfPMJGGzg3lyLF6pHiHCyGepfgUQnBh4kYSR3/Z7LBpuklZLpCmte7zidynOjVI2vRefpEaqdD28hSXEajleldo2YaOJQBDaNkG5gnJ7GukHRJ6H9HycW1N4c4tEnS6R5xHU6hBGRPbh3u+DkzakTTJnhtDzCfRcEmRE4ZnjlF+7Q3LyFGoiiV+vYs9O4VUOpw0nVI3s5Hnqty9Ru/0+bqNM5Hu7Zu/KMCD0nR976novJI+XqL8zhQz3dy4dt8LVha/x2PgvYuqpHb/Hs74enJw9IGXEfO19bi29ShC5dNwKQeii9WBDEggKiTEGU2eoO4sk9TymmmaxdRV/n+UUW6EnNE791BjVqQa6paEnj4aY3Pfhww98rnzk47nw1pveobJ4hRCxCDaHW2FU2tNcW/ganR7JMj9JSKhZjqUfp+M3WLJvHjoD1g+73F7+LrZX5/TQ53pmhyvK/vtTSkkkA24uv8pC9dIebnJJ5T5igaOKtUWBh5ZIoZgWbrX3+BSEHrX6NIoQpNMjhOFtPP+TcdsH5RrBSoXUsxfovn/YbOoHI4w8FmuXcYMWpwY/S8Ya2NUwCiFi43nE0nwPjSgiam73qoXV+ubfEoja2+PeUatN1Lq3T1h5uHDCwetM/TjJSM8nsYYDIj9k/j+8Sdjt0rj0Fmoihd+oPlSgPHRtbv7e/xSXv+yjBshr11n4wR984vRguScnsYbzDP7s4wRtl9WvfrCPvSS19gyX5/6Ac8M/vUnftt9Znlx3+YSRx/Wlb7JYu7w5qXD8JrZXJ5MY3LGfInQKiTFu114nCF1AMJmPU+UPY0wB3KZHa7HD5IvDtBY7h63u2QHfZ1MGbDdD6gVdOl6VTGJom0vuMLNlucWN5ocdptfeYr76/k/8ihQgqeZYcaaQMiSjF6n7y4eS1QMIIpfZyrs07WXODv8U2cS92uX99OvWfmx0F7m2+DVa9sq+DOPHIcSuGCZGvp/uynzMrrbr2CKRMkDV0vh+lyDofmJji5pJkXj8DFGzjXVyDG/6PragI4qpRDJgrXmblr3C8dKLjPY9vpl/8bDvUMetsFC79BOttHQUOBRpQ+X12zQ/WkBNxC5GGUUITcccHCZoNYl9kXLbjQ4ib4cLLYi8bUoR9yAPxuQvoz0zeaUM143Gfdcj48nBUaDx/gxh1yPzyAiRu/8VQRy7mOb96d9hov9ZhnKPoGvJ9VlgrxnghqtFEoYuK60b3F15fQflmuM1aTtr21w3G3qGAjCUBFnzHlWepWV2qM1I5C79FmyL3fhdn2t/PI2R0qjebdJc6u6rWyURYeTvOMZBU/Idv8GV+T9mvvI+I4WLFDOnMNRELBwsBPfoM3Z37UnimmmJxPaarDausVC7fGj5O4E48AByrz88tnbgfsk07LDJYOIe57NEUvMOT9cmZUitM8s7d3+TofwjjPc9TcosbuvXndcgQUZEMqJhLzJbeZu1xq0jN5CRjA70TiuaTnrsJMIw8dsN2nev4bd2rkYURWeg+AiFwglcN36n5hbfJPJ3dzVLGRJEPuqW8wkib38Thx5jUxQFMYNQKoF7dx6tkAFLv4/oXhKuM6ZttoUkjA7rEpc4fpNri19npvwm48VnGMydxdBSm6vR3dWo7o1JIHH9FtXODMv1a9Q6s/F4ceizkj3HCKFIEJ+8N3IDQsrdo9m7zUjMwSzjv/ocXrkdC8P6AUt/fIXs48+gpjKxm3du6vBE93uetYKezOB3Hp5iTFWPpF53E/2fO0/9nSkKL5yi8v2bRI63b1sttNhwmkqGQnKcfGqclNGHplroqklERBj6uEGbrlul0V2k1pnGPQSPryJU+pPHMdX0tu9XOrcOJcGm6AqTLw7RfyrP4vtrtFbs7XSC67qBPw4IRUGgkDL6SFsDJM0iyWSRZG4QXbUQXoj0A4SMRZEjNSQQId1umVZriaazTNtZ3WbQBQo6OjE/VbhnLFJBoU8M0ZFNbPaeGCqom20KBDomPt7HskJ7GKhCJ5sYopCeJGMNkDBycRhBqERhrOxiezWa9jLV9gxdt/rQ1yBUFaEZsdjFQz5DqplEMS2CTgOhqHF5zH1DoKYlyGcncdwGtl1BIok+QQKDxJNnMSeG6F6+iTe19GM9thAqucQI+dQoabNEwsihqwkURY9zENZZwrywQ9et0XUrNO2VdeGCo4lz74YXf2mA6Q/bLN7eR9mSgFROI9Ono+mCTj2gVfMJvIMvpHYzmYcypqlTAyTH+2h8tEDkxiuUoOXE7CJmgtDuEvNMfTwDgZkvceoX/kuu/MY/uvedCf1FhWRKwe5KlpbDPY2kYcDAgMrCQtgzQU4xLbS+PhQ91vlzV5aQ7oOzI/PPHCd5rIRianTurND4YJbI3vtFVBM62RN9KLpKe7aGW7VRjJjuKvIjFEONpai8AKEIZLSeKS9AMVRCJ4gF2hWBoimEToBQBUJVkNE6ZaGAyAsRmkJiII1b7cb7HQGMtM4Tf/UMa9drJPImtdkWS5fusSClR07i1NcIus0403vj2ZIShNhMKlM0AxkFIFS0RJrAbm1mYEIcH0coGJkCQbdFFHgITY9rnGWEUDUSxWGCbhuvXQckKCqZJ5+m+MUvAYL6D16j8aM3kH682jPPnUAfLuHNLePd7i3tl6OfUfUkLVmjLeu0ZQMfFxUVQWy8NTS8dRIPgaAohtHQWZFzqKgEBGjoRIToGCiouNho6BSVYSrREgEeGgYJkaItG5ttmeulWwEuKtq68Y3w2YXHWVHR0znUZByHD+0Ofqv+E6rfKdAyWYJOq+f5mcVBEiOTdGZu4TcfLq6lZwokhiYInS5aKkN34W7cL1vPRqgUC6fJZsbo2mWkjChXbxD+uEtjYt7Kzb/VfIawfO9cDWFhqqnN1WIoQzrhvf7RhIkqVNzok6iR/fjxv3z4It/8tQW+8r/Mk8xpKAq43ZBuMyS6T72pf8zkl/+vx3jyC0UUTbB8p8s3/tUC736jjNs92Duxm8k8VIqau9ai/6XTqEmD0PGRQUj5e7diRQbTxCiWCFoN/NrHk6yhmklUI7ntu1xO4aWXTZ58QueDyz5f+YpDqaRgGoJKNaLblYyPq3S7ksXFuPD/2KRGsV9haSlkcFAllRKoKiwshLRaEmNklNIv/DLmUBwrmv9f/xnO9N1ep7SJyA8JbZew61L70Z19X5OeNsicKKIlDYSqAFWSw1m0hE7zboX0RJ6g49NdbmL2JfFbLlpCw8glEJpC7doKZi5BeiKP3/Zoz9RIjmQxC3GSWOAGGLkElfcW0DMmx37xAnNfu0Fr6nAuzB3XHUS0lrpkhpIIRWwjdheqSmbiHEa2SO3WeyRL4zH9l6YTeg6qYdFdnYtjWqkcCEFgd8ifepzazffw23WMbBEjnaezPI3QdEqPvkTt5rsEro2ezhO6Nn6ngZHpIzl0jM7SFHTqcf2zppK+cBEtG6f+WxOTtD+6TFBbJ+5OJkAI9P4C3p3ZXUsPbNmiJlfxpUdBDNCSNQxhoUiBIlRyokhL1inLRSQSDxcNHQOLtMjSkBWKYpiWrJFV8qTIUZdreNKlKIZwRZe2bJAQaVIiS1e2CIEMfWSVAoEMiAjQMNYHUElZLuNy32CpKCRHj5G/8AyqmYiJJpZmqF1+8ydSJUVNpig+9RnKb73aU1/UrazgVo5GVVXKCKEIjFyR0O0itPtdpwCSTjdOTlIUjSD4ZJIb9aE+lIS1aVSt88dp/OH3Nn8vmZMMmidwoy6RDHGjDne7G8ZUkFQzGEoS1zsala2NMN3H0ReK0A6+khVw4okMX/ibI0w8ksKwVNbmbD58rcbNdxp4dnyeiip45VeHeeILRZbudmmu+QweT/Bz/9UElQWXm+80joSZ9lDGNHJ8Kj+4hTGQwSu31ysMBIqVQMvkUC2LsLt/V2FycBLN2pnJuhsSxdEdBcyrqxHf/76L60reeMNDEfArv5LkzTc9fD9+UR59VMeyBN/7nsv0dMjAoMLkhMY773i88opB4Mek6iMjKt/5zuFmoUKAs1jHHMjuvfH9+6oKMowIbZ++x4YxshaJgTRGIYHXcPCWmugZk8zxPuzlJkYhSaKUonZ1FRlKEoNpsieLLH73LkYhQf9TY6imip42WXtvnuyJPlp3KgSOH5eY1I5oxiogPZDErru4TYFqKNuMaaJ/lNBzSAyM05i+QnJwEqe2Qnr4ON21ebREGr/dID12ivb8bdJjp+iuziHDkNDpolpJjEyB7MR5nNrqJn2k73TIH380djd5DnoivZlluC22E0W4CwtYx06CjPBWV4mce2VPUauNVszjzj9YL1LDwCJBSIAt2wwoY9iyhYONRNKWDVIiR1kusdW3r6CgocesMMLEIokrHSIkGVFgXt6hIxtU5brBkJIkmc14eb8yzEJ0h4iIk8pFGrJKVa5QECV0jB3GVEuk6Hvy03iVVdZe/wYyDBGaFmfEA0JRSU2exsj3E/ke9vIsbjkuYs+efRy/UcUsjaAaJl6zRnvqOjLw0TN5kqPH4yTDZo3O7O1NnWGzOIieLRD5PtbAMEGnRWf2NqHdQcvkSY2dQEumicIQt7xEd/4uCAVrcJTsqYukxk8SOjaR52AvzWAvz4GiYPUPkxiZJHId2jM3CbuxsRWaTvrYGfRMgch3sZdmNw1u5vSjBO0mZnEQ1bTwW3Xad68TBR4y8Il8P3YbBz5Bt7Xjnst1b4mqxh4pRdmp7vTjgJJKIjQFoWmxrGVr55ha8eZZdG7ib6knFihktCJprY9uGIfCVDT6jFGATW3YVXeGQLooqGS0IiktH9dS+0uESkRf4RSe38b1WnS7ZbR1RSF/H5nN8baSINibhUwIFcPM4LrNA4kpCEVw6qkcJ5/M0iz7BH7EqacznH8+z+/84ymuvVEnDCSKCk/+dJHmmsfv/5MZ5q62efpL/fy5vzfG45/vY+ZKG6fzCXHzAiSP95M6OcD0//Y9+j9zlvbtVaTvo1oJItchdPY/UBcfeYH00PF9by90Y082EEUFTYNXX3VRVXjyCZ1GI0JVFIpFhampkKmpkDOn4y5IpwRv/NCj3ZZ84fMHFCLekrXq17vxv9WDxx1D28f3gtht6wboaYOg4+F3XMxCgqCbxlltoyV0CheH8Oo29mqHzkJMMyalpD3XwFltYxaTcXmO0IiCiO5iEzOfQNFVgkoHGUQkSmm8+sOTsCuq4MTnxmjMNkkPpXAabsyAtI7U4DE6S3exisMk+oaQoY9bXyVRHMbvNONBXghC10bP5BGqSuS7cY1bMo1QNcxsMVb8EILId4kCHyNdIPRd9EQar10n9ByMTB+qYW3Li5FBQPOdN/EqayAl7twskX3v+QyqDYShY56awJ/fXZhYCAVFajGPsbQxsHDoIoUkL0pEMto04iYJcqKIjklXtlDRKYkRDCykiDBJ4Mm41lESERGtx1gbJEWWtMjh0MWXLi1ZoyiGCAk3a6Ijwl1D8XquDyPbx+r3vrrDhQmQPf8kqfFT2IvTaOkM+QvPUvvwTbzqKvlHnyNybLoL08gopHDxWYRQ6C5MkXvkaRTdwG/VyZy6gGJZNK5dAhlhDY1TePRTtG5/tH4/FcQ6C5pqJVCTKSLfQ7WSFJ96mcBu41XX1t32cZ9FvkvoOUQb8RkZu/W1VBZz7ARuZWXTmPY98SJGXwlneR4tlSF/8TnqH72FW1kh/8jTSBnRnbuLDEPyF59DKAqN65cQmk7ke3jNKn6zStRD3UpVDVKJElHkYzt1+vvO0OosEYYPTgIr9J2mWDxDpXKDWnWn7mix/zzF/vt4syV0umsszL2xY3t3ehFF10k+fQ7puoTNnWNqQR/GUtJEBLSCCsvuXTaSgdJqnqSaoe4voyoGx5KPsebO4ERtCvowAoUF5zpprUCfMbLJmjVinWaNZbK5CVZWLyOjCF1PkstO0O2uoSgaiUQRQ0/S6azS6a6iKgaFwsm4Pre7Rj43iaZaNJozgILrNfH9DoXCKcLAQddTSBnSai9iWQUMPYPndeIs9PQIupFCETrt9iKKopFODxOGLo3G7Db6yTCI+N5vL3PjzQaBLxk+meAzvzLMi780wNQHLTqNACEEfSMmy3dtbr/XxGmHvPeNCo9/vsjJp7LopvLJGdPEaAEkaCkThCB9ZpDKD6cx+ku4a8vo2RyqmSBs709lwUjlaC3epr1we18uhERxhIHHP7vndt1uPNyoKpw8pTE5qdJsxt/lcoLnnjO4cFHn8cd1EODYMo6z7nMSqlsqY0+X6D+ZpXynyfy7a5hDOYK2i1s5mMKE13BYe3tusz41CiM6s3UgXkFaA2nCro9bsym/v4CW1PFbLpEfxnFroD1bR9Hi43p1h+UfTKFaGghwK13K7y8QdDxkKJn/kxsE+4jl7gtCUJhMU59pkh9PM7vYwd8Si23MXMVrVHCqywhVx21WCZw29TsfEDpdhKIQhQF+t4FmJvGaVbxWlfrdy/FqJQpo+tfpLE3hd+Prq954BxkGuLUVVDNJ6NlEvktgt3Hqq/jt2rYVR9Co0770Xs/TVzMphKbhzeye9dqhwVI0TSRjtisfj4XoDgF+zMksAyT3aBwDfKrRMgKBi40n41hnQ1YI12OnIWHMG0rISjSHQBDg05VNlvHwpINEUpXLWKTjzFy5ikDg41GTKwTcdw+FQEtlkVGI36yRHDtJ4bFPoegGy9/5Mn67TulTP8Xyq1+mPX0DPZun+MwrJEeO4VVXAYHXqFC/8g4y8FGTGdLHzhB0W1gDo6y+/nW8epnIc8mdf4rWrdh4CkVB0Q2aNy7jt+sIoWy+y16tjN+sEbkOWjKDNTiK1T+EV1nFXVuik85i5PtpXr8UrxQ3ICPcygqdmZtoiXthHdVKUnz6M8z+p3+Ds7qAls5SfOplUsfOxqtTAX69SuPqu4S+i5pMkzp2LjamioKWyqBaifhYvaQi12URFcUAJMo+FJhAMDj0BAODFzGtHLXqHe7PPAwCG9dtkcmM0Fc8TaV8g057Bc/dhdwkCFH78wjLQM2m4nHpPpe0E7Wo+YsE0t+MjUpiTduWmiel5becocKaN0snrBPJkAHzOEvOLXJaiQHjGK2ggqYY6MKgEqxh6GlSqQHa0SJ+0IlDIXoKQyiYRhrbrlHqf4TuXJli3xlMM0sY+Rh6ar0KwMHz2vQVTiOR+H6X/uJZup01HLeOouikU0O4XgsjlUZRVKIIstlxPK+J79v095/HtquoqoGiaDHv+Ibdk5LF212+8s/naFfj8ebmWw0KQyaPf64PI6GwkaOq6XHuiGfHOzfKHvUVlwsvFVD1o/E6HMqY+k0baziPljbpe+4EatJYpxHMoGXyqIkE0R6JOvejs3SXxtSH+6rnCrotBh5/Zcf3q6sR3/mOS7cbC9P++q93kTKuTfz61x2SSQXPk3Q6EZ4H3/2uy9tve9TrEXfvBrTb8X5/8Af7iytlR1Mk+0xuvbrIqVeGKd9pEHRc0meHkUFI7c39x0wjL8Stbp95Bu17M+H29L3EAnu5t6Heur0MI5zy9tVx6N4zcO11Q30UkJFk9UoNPalRvlVHt1SMlL4pPeY1yuvHt9lK3+Y174up+2zzaMR0b+vbettX0G79XsF94Ny7Tq918Biwv7yGv1pBzaZ33SbApyW3t93l3n3osP2exHzN9wZJnwevahzuXUNIgCvtLZ9DOj2YtNweVHgAkevEyWiqilteonnjEv0vfBHFMFATafRcgYHP/AylF7+IUBRUK4nfrN87l5WFdZIUSdBpYhUH0VJZUpOnGcsXkVGEYpjrHoB1zd/1bTdKTba664xcH/nHPoWeLiBUBT1bQKy7UA8DPZNDaDrO6iJISWh3CTot9Ex+83yc1UVC34MoImg3sEpx3kPkecgoij0eu1CehpFHs7VAPneMfPYYldpNPO/BGdmJRJFUqkStdpd84QS6ntzhDm025mi3FukvPUIuf4yV5Q+oVW8/sA44KDeI2jbaZA77yp0dLmk7bFPzl7e5eXdtS3r40lv/20cR6jqZiULNX2LeiXVjpYwQVoKuvUalEideSRkRBm5cEqUoeF6HdmeZwcHHAEEi0YfjNvC8Fp7fwTLzhKGL53fWJyYqQihoavzMdO0yhpFB15IEwfaqD0XR6NpVgsAml5vY7N9y+Rr+FrdxFEhWpp1NQwrgORFrcw5mQkVRtzJ3sT7ZjT/LCLrNEDOhoCifoDH1Km1Wv32VQvM4atpg5l9/n8h1aV+7vJliupXyby80Zq5ilxc3VWf2Quj2rmEMAjZXngDlcjwzlhLqdUm9vv2hrVYjqj3G3lptf+nSeiLOtq3PtRGaQFEFSsok8n38apfSFy+y9q0rR6b08JMKGUqu/tH2xKwdosA/odBHBjCOjSEMHW2gj/rvfO2TPqWHg5Trrl2BWRyK46HV1U13ZuR0kWHI4td/e4sBlZvxVGDdzSo325MyInIduvNTrHz3Dwk3481y03DHpaU9vEqKwsif+xUa196j/MNvoZgWgy//7HbvzwEflcDuruuS6kSei1DUTfftxmi59Rq2ZjsrhonfqhG06z1avgfXa7JavoIQSsz+tAcfbjY3jqZZzMx8l1xukmL/GZaX3t+2jZQhYRiuu4slYejtmSEsg4Duu9dwbs4g7Z3b7l732bM17u/sUIa4kU1aLRBEHp600YSBgUUQunheCyEUMukR+ovn8YMOjtvAcWpb2pJUqjcZGX6GTncNr9HB89v0FU6hqgZdu8ro0LPYTnW9zn09Li1B0xP0FU5SyB8nCB3K5avrv0ebXa5pFgmrQDJZpGuvEQTxON5thWT7d3oNkhkNRQPNjMMMiYy63lf3jOrGF+KIDCkcNmYqwVmqs/RHl+IyjfU0ZBkcrsyi/NEP9nxYt8JrVrj71f9t23fJ/gTnfvEUqYEkqx+VufPNGYINV+NG0xv9dv+hDsnUE/nxSla31M0CdtXUQVVIjvfTuDyLWcrgruyDo3a3GPDDkFo/KK580HY36nDkzhcSIQj9w7YX9fi+Bw50vmL9Xu9eYL7Rnr+4SmQ7hI022kBf7823khN8LOe7W3v7eNF7hEWCbht7aZric5+j/KNvo1oWiqavbx7SuPYefU98muXX/giiAD1bIPQcgtZuddsSr1kldLskhidp3vwQ1bLQ0tl11ZXdr1VRNbRkGrdWJvRcrOFxrMFRWlPXNreJnC5aKo2aShPYnfUxJbzXHxv9v/530G7Qmb5J6cU/x9ob38AqDZMYGKX24Vt7dlfkOegDIyhmEq/xYC/GBufwYOki5erNByTeCLK5MVy3Qasxj+s2KA08tsOYHhT6aAk1myZstMl+4Vkix6P2u9+6d34bRCP3QRMm5zOfJq32oQoNQ0mw7NzZse0GwULVWyChZHgy90WEUFl2bjNnX2Vu7vXNfmi25mm1F7eUhcT/v33na0gZ0e4sc+vOVwGx6ZXodFY2+7DVWiSS4bqXOj6u49RoNONM45XVy5vfz82/sdn+Wvkq2cwYN25+mYHSo+h6ajOpafrDFqefyfHkTxe59O3YyzV0PMH5F/Kk8jp//f9xkj/6/8zy2Ct9SClRNUEyp8UrWQGprIrnRERHtNg5lDG1xgokRwvYCzVO/Jefw1lqcOeffRtgMwPxQIXaBxx4osCnvXhfgF8I6tNNpr4zS2O2hZ7UePRXL5AoJrn+5VtEfsQjf/EMlVs1Zr4/T/F0gc5Kh+ZCh4t/5SyXf/Na74M9APX5Nv2ns3zh//YEK9fqOE2PYL5K8ngJZ7VB6tQga998gIqNoqAkEqQfeYzkufOYwyOoyRRSRgSNOs7MDO0P3seZn0X2iu30ak830Iv9JM8/QmLyOHppADUVuy8j18WvlnEX5ul89AHO3CzS3ztuqpcGGPm7/we0bI7aq9+k9uq3kEGIsExSp86SfvJpjMEhtHQ6Ft+t13HmZ2l/eBln+i7yPt1IY3iU0b/7v0dJpqj+yVepf/+7IMAcGyf92FMkT55CTWcQuk7YbuEuLtC+/D7d27eI9pEl3veFL5J/6RWE2TuRrPH696h882uxALAQKOkUUdveTJi5H0O/+jdIXXgUFIXp//6/JWy1UJIpkmfOkn70CcyR0fi+hQFBrYY9PUXr7R/hlVf3N8EUAjWZInH6DOmLj2MOj6JmMght79dz6Tf+Fd3r27UXI9em/PZ3GXjhpxj/xb+FjCKcpdlNubGVV79M//M/xfH/4v+Iohl0F+5Sfus1AhpEnrst1CLDmBjcq65Re/91is98loEXv0jke1QvvYG7uoSM5Pp2PdiIfI+1N77J0Cs/D4qCvTBF7YMfbRerWJmnPXWdsZ//mwhg7Y0/oXH9fbRMjsGXfgZraBzVsEiOHcctr7D0rf/Iwtd/m8FXfo4Tf+O/Jui0qL7/Ou3p2E0Zu3LDe4vrMNzMOg6dLs3bH2Hk+3t6z3QtyfDAE4QyoFg4TRSFJBIF6o3ZXY1pIlEgmSzRbC4QhA7Vyi1Gxz6Frqf2lfm6G4Suo5g6iU8/QfX3vkP6+Qugq+DH92fRudlzv0C6fNj8zo7vq417OQFVf5GqH3/2pcu0/QHT9oPpT3vls2z97v7foy1MTNE6R/TOoX59IXZfadIGXLeBb/UxOvopWq1F3C3x5e/8uyXOv1jg7/+Tsyzd7mJ3QoZPJEjmNH705VXOPJfjv/7XFxGKwLUjEHDhpQLvf7PC0PEEA8cSrM7aB18I7IJDioNbKIbK4BcvMvW/fpfSF87HpAJBzJYhhKDlrKKpJp7fJpLheh1RuFmrFEXBngZXKCqKZqwXLt83S5dys0Ri/QuyYxlK5/tYeGeZtatVpl6dp/9sgbFPDbPw9jKtpTYLby3hNj3qM03GPjVMaqiDXT9cGYzXCbj6x7Os3WgweC4fu3kNDS1lolo6y398afdrMwxS5y5Q/Ok/j95f2rwmuX6l5uAw5uAwuWc/Rfv6VSpf/2P8tdUHTjySZ85TeOXzJCaPbVvhbDyomqahpdMkJo6Re/Z52h9dpvLNrxFU91cPLNbLnxTTRBso0P/zv4g1cWyHEVKTKcyR0TipZ3mRsN3bYAshUDNZ9GKRzNPPknv+JRRd3+ZIUAp96IU+0ucv0L72EZVvfDXuhwcg8lxCu4uyrmSCosQsOqq6ceDNbZVMitRzjxGslBGGjr/44LbNwWGCRIril36O1NnzMeHEev8quo46ksQcHiH33PPUvvttat9/7cFEH0Jgjo7T/zM/T+L4yTiBKQiQYYAMQxRdA2XD8xG7UqXv39tml8lQ0Kqz+Ce/17t/Ap/VH3yN1R/sdGnP/+Gvb/tc/+ht6h+9DYC9PMf8H//bnm02r79P83rvlVj96jvUr77T+/oBpKT85ncov7ndAAStBgtf+w+77rb0J7/b8/uFr/77bZ8bV96hceWdeOJkmAhVw8j341ZXdlQd+EGXhZV3SSVLrJWv4PkdBvovEgS751Gk0kNYVp7FhbeIQp9q5SZj4y/QX3qEpcW3d7/uPeDNLKEPPEL33atIx8VbLG8a0j8rCEOPSvUGlepOkv9rP6zz5X86w+f/+gh9oyZCgO9KfvSHa/zh/zxDuqDzhb85QjKn8d43ykycT/MX/y/HeOILRUpjFkMnE3z9X87j2kfTp4cypvZ8jdxj44SOj71QI2g7REGELow4jd6toAiNgcwZqp0ZdNUiYeRxvCaGlsALHRy/SdvZfeDSklmyE+dI9I+imgm21zpIQs9h4Qe/v22f7lqX1Y861KebDD81QOF4jtZiGwG0lzu0Ftuc+MIkU6/O0lrsoFka48+PcOnXrxymGzaxdqtBp+LgdgIS+ST2Yh09n9h1e2GY5F94icIXvhjX/7kuQb1GaHfjlYxQYoOVy6GmM6TOPYLRX2L1P/4Wzsz0ru0apRLW5LGYs7fTJup0iByHyPcBidB11FQavdCH0DTSFx8DKVn7o9/ft+yQmkhiHT9B4ZUvYA6PErZbhN1OPKhLidB0lEQCNZHEmZvdU4rPKA3Q99N/nuTps8gwxK2WiWwbGQQITUNNpdHyeRTDJH3hMWQYsfbl3yPq7l561bl+laBeQ0mlUK0ESjJF4vhJrLHxHdtGzTadty8TdR2kt/cqPXn6LOb4JNbkMYJWk6DZiJPtJCimgZbLo2ayCE0j//JnifyA+vdf3ZV5SO8vMfiXfhVjcCgu2VhZwZmbiQklFBVzcBBzbAK9vxSXBbkunSuXse/eIajXcJcOp734ZxFC1bCKQ2ipuAZ8N69BGLo0W/Obn6u127vGNoVQSaeHUDUTw0iTyx+LM06B0sBFlhbf4VAxJAAp6bx1b2xyb/Rm5/qzChnBN39tgQ+/W+P442l0U2H5rs30R23cTkht2ePX/kEsWScELNzoMnkxzaknM0gJ139Y5+2vljfJHR4WhxMHbzosffl9FEtHhhGrfxIn2YTCIwhdCulJ6p15HL+JH9jkk6OEkYeuJdDUBB23iqmldmUsFapG/4UX6Tv3HE5tGSOVRwJ+p46RLqCaCSrXtsdHAifE6/pkR9NIKemsdtFTOr4dUL3bwMqZKJpCfbqB341fouZCCy2h4e2ycjoIutX4ZbPnq0R+iPRzu1ycIPP4kxQ++3mEphG2mrTee4f21Y/wV5fjgVlR0fJ5kidPk33uBczRMfRiP8U/97Os/M6/J6j3plRrvvcOyTPnCJoN3LkZ3IUF/Eo5pneUEiWRwBwZI/vMp0g/9gRC07AmJ0kcP0nn6v5E1Y3BIfoGh1CzOTrXPqJz/Rru4gJhuw0yREmmMEoDmEPD6y7eB7s5rWMnEIqCX6vSvvQunWtX8FZXYmOq65vnm7rwKGoiQfrCo7Tee5vujd3d8v7a6rbVq9A0+j7/xZ7GFOLSGDWfRU1YdN58sKsr+9wLCF3HmZ6Kz+POLYJmA6REzWRJnj5L/qVXMAaHELpB5smn6Vy9jL/Wm6e68JnPYwwOIcMQZ3qKyje+gru4sM0DkTh5moFf+svoxX4QENTrtC69+3Dx9D9tEAqKqqHoBqHv7ggtAMjAp7s4vXdTQsVYj82FkYeup4hkiOzBz2taOdLpYaSMGB55etNL4ToNMtlREok+bHt/nh/F0FAsnaDZQ7A8Y6FlE3hrLSLv4+W8/c8JMoKlO12W7jyY10BKmL/Z4Tf+77c4+WSWMJDcerdJbenoKCIPZUwVQyX/9DFSJ0rM/eaPyJwfofqjO4AgiFzazhp+aNNxK0hCKu1pVEXHD2xK2dNEMnygLqSi6uSOX6Q5c5XV979D8ZHnkUDtxjsYmT5Kj79Cd3X7LM1reUy/Orftu7VrFbZ6kpvzrc18jdRAEitrMvuDeaJ9ao/uB0YpQ+f2Kq3rvQmp9f4SuedfRJgWRBG1736bxps/3M62H4UE1QrNagW/Wmbor/5tlEQCY3iE9GNPUP/eqz3bjjpt1v7w9wkajZ4x1si2se/cwltbxRgawhwaQU1lMIdH929Mh4aRvk/jR69Tf/17hK3tyVVhu42/ukLnyof7ak/RdYJ2i9pr36J16b1t/SB9H2dmirDbQc3GhkqoKqkLj9K9dePIeGaVdJKw1kQZKKJPDBMsrSF7KIQIIcA08ZaXKH/tj3Dnt9O0hc0GrXffInJshv6Lv4lQVdRUisSxkz2NqZJMxrFYIOx2aX3wPu7C/I7t7Du3aLz1Q/q/9PMopoU5PoGaTBF2DqCs9KccmpnAKo6g6ibdtXn8oH7IlgSWmaeQO4bt1HC9BoOlx1laeQ/H3dlmItFHItXP8uJ7VCs3NpN8Eol+zp77RYqlc8zPvr7HIQXmQBZrpIAwVJyFWsyE1nExSln8Rgck6H1p9EIKZ6lO5PpoKRMlYRC5AWHHxRzK4ZVbhyKM+bMAGcHKtMPK9MMT1fTC4RKQhvNoGQtrOAeKIP/kOLV3pomCgI57j9z8nv5jXIMnENQ6s7ScPXg2FYFqJOgs3cVrVQldB0U3CLot3PoqycFJSo99luZ0b/fsmVMa/UWFj675tFqSsRGVuYVw05BaluCJCyoLSzUaM61De2F6QkL69BCRH9C8PLfj59T5C2iFPoQQOEsLNN9564GyNfbdOzgzUyTPPYJimCROnqbxo9fj5Jke2CueCBC2W9hTdzCHRhCGgZrevb7yfghFoTt1m8bbP9phSA+L7o3r8Upzl37wy2u4C/Mkjp1AGAbm4NCeDFgHQVhvYZwYj2PWjod8UHZfFNF8+0c7DOlWdG9cI6jX0Iv9cUJYX+8sYb3Yj2JZcbOOjbu405ButnnrJnxpPc6cSKJms7sa0zwlRtUTu1/D1nZlm9noBiE/vtWOhs6wcpysKOy6TShDFuQdWnK/xPYidoMHfiyUsO0XhQnlDGmxi7doyzGvR++iqgaWlUfVLEw/i+PWe7p5FUUjlR4kigKq1Vs0GveeiXZ7hYnJlygWz7Iw9yOkDNH1JIaRIZnsRwiVVGoAz2sTCpfk2QH8WofURJHQ9lBNHTVlYs9WkH5I0HJInRjAb9okJ/oJbRdrrIjQFKQfIsOI7tTaut40WCQ5rl5A6SnheDjEubYxKYnckH/DJ5AeHi4uNq7s4q7Ta/5Zw6GMaWj7GPkkiqGRf3ISxTI2mXseBImk7exDlk3GWYAbSiGh76CnsrELx7PxGmskHn1p193PntG5ftPnS19M8J3XHJ58wmB5xebkCY2+PpVbt31yhs+dpQ6TY4KTx02mZ0MMDYaHNZaWQ65eP5zrN2g7ZB8ZJfLDncZUVbHGJ1HMeAC1b93c1Sje6wuJuzBP8twjcYF9Oo2WzeGXH0LeTkqidjx7FevF/fuVSJNS0rl+bVdX84FPJYqwb98kfEAMFCkJW81Y5cUwUFL7N/77gZpNE9WaoCgEq7t7TKSMs1bblx9c8iCDAL9Sid2yqoKyhb1n23Gte3F1GcW1nLthK/0hqhITtPeAQJAQaUaUvY2pRGLLDi1ZoywfoHm6UZ6y8XzsIIY/GFQ0+sQgA8rYrtv40qMSLtFif89ZFAU49TVAxrJqWxAr+AxRVIZ777zlmNejd7CdKmuVa0RRQBC4RJG3jSxgA7qRIpuboNNaptvZ/j5Goc/q6kcMjzxDKj1Iu7XIwOBjjIw+h6Yn0DST8YmXGBp5mra9QMW6iSikQFXQMgkUTQEhsMYKyCAk++g41mgf9bfuIE2dxGQJb7WBOZTHbzkolk5iohivaFsOujAZVo6hHp4xdgc2DOTm/2VMgxmLEoaEBIQywMOhJes0ZYW6XNuTsORhIAT0j1lMXkyTzmsomrJrQVmz6vH2V8q7/PrwOJxqTLlF5Yd3iLwAvZBg7t//aN8v135KZmQU4rWqJErjcP0t/Had/MnHSQ5O0lm8Q3biPIG7++Br6LC6GlLqV2m1IvI5gaYJ8nmF8VGVdjtiI/v/2adMvvWqwy//QoJaPUIC5YcQUrFGC3i1Tiyfdh+0bJxQtJGZmX3ueVIXH9uzTTV5bzBWVA0lmQIeYEyFQC8WsSaOYwwMomazqIkkimGApqPoGlpm6yy9t8hzL0SdTpwcc0QisGGnHccc9zDkMgg2SQGUfZSMHAT+4hoiYWCMDO69baVC2NnbjbZJKo/YteQmaN1jTYqZiBK7rg/VTGbzbxmEe0/C9gGBwCJJSYxRlSs9NVrN4VHSjz1JUK3gLi+iF0sYg0M487MQhliTJ9DSabp3btG69E6cMHf+It7KMs7s1EOf476uQ1FJ9o+RGpwk8j2ac9dxG4efbEZRgGnmGB16mjAMAMmtu1/H9bbX4Xpui9s3vxJTN/r3j0eS+bkfsrL8AZ4b3+fVlctUe3D2RpFPcNten7SwSfIiI4mixzzdXrVN84NZQsdHCEHnzgqRF6DcWkb6YZyprKuEzsenu7pBELFJFCEU7h/lpIjJGApikJAAH4datMZiNEWTo1URUxT4839vjJd/ZQgzpRIrO+4+js1d72wzptbZCayz4zS/9Q7Jiyewzk8Q2R72R3eRfkjqU+dxp5bovHsT6ez9vh16VLLnKtgLMf+pDI4u5ghxbVt96kMSfUMIRaO7Oktgd5j43K/GiTSazvI7f7Lr/pmMwl/6pSR37vpMTGhcOG9w/aLPI2d1IgmDAypnz+h4vsT1JK+8bNJsS4IQ+goKlerhr6dzewUtbZE+tXNgViwLoWubLkolmVo3jPuDlDKuJX2AMUmcPE3hs1/AGh0HVY0H8s3Cdx7aPRq5zr5qU/fdnuPsWEn8OGFdOI0xORIrq+yjb4L9ura3TS57t+uXV4m6HdRUOs6SHp+Mk496IHXukfVmJVGnjV87Guk8IQQ5pUhe9t9Trdly3sbgEPbUXey7NzFHxpBhSO173yH33Iu0Lr1D2O1ijY7R/vASEGd7m8OjBI36kZzffiCjELu6hN+p43caRAdgX+sFTTVRhEKleotWZ5l0arAnOYaUESRNksPj2EtzKKZF9sxjNG9exlmeIwwcwi0rWt/v9jC6D0a0bhzDLUlHEmD9c7ilVCb6GA3pfiHWCVO09X8MTJJKlmHlGA1ZZiq8Qu1BC4ED4MkvFvm5/9MEmi6wWwFr8+4DCetXprcndhnjJfShPoSmoiRMOu/cxF+qkP2pp2l8/U3cO4v4K9V9GVI4pDFNnx4gMVKg8vrtTR/9UUJGIdVrP2KDmiiw2yy/+RX8dhUj00dr/jaVaz/cdf9f/831lUM8SeIf/MM6kYR33vU3SXe+9aqzoUuNEpci8vf+VprLH3k8dkFnfv7g12WN5On79Bnqb99l+SuXdvyu6Po2PlDpefeYXvaJyHF67yMExZ/+EvlXPn/PYEYRod3FX1slqNcJO524KD/wSZw4RfLUmZ3t7AEZRbuK4x4GMgg+UcFq58ot1HyG7luXST55Yc/t9xKHPwhkENB464cUPvtTKKkUmWeew11awJmfu2eMhSB56jT5lz+3WfLUvXVjfyQe+4BAkCJLnxikLteItnmOJJ3rV8h/+rOYwyP41QpEEZEdixPIKEIG/npN7HpJVyJWjVKtBGo6s2+xi4eGlFh9w5j5QTpLdwm9w+u2RjIkCF0UxSCVLJHLjFOt3eF+TQGIJw9aIkNq/BRGoZ/KO98lf+FpnJX5/3+2NeueGSFQUOhjiLw2wIqc5U744TY+6sPgs391GCHgh3+4xu/+47t06ntMorbcDmEaCFMnrDSwTo2BqpD+9AWk49N572ZMRBKE+wpfbuBwRPd1m/SZIbSsFbsVJISdj0OFfgsTRrPC4g//eH973fcMb+STRFuZ8O5RjxKG8b+/9psd+vsVFt46nAstebzE6tcu0/fp0zgLtU01l83z2OKqBFj98u/Rfv/dQx3rfuQ+9cI9QxqGODNT1L7/GvbUnZ0uQSEQun4oY/qnEf78CukvvEBU/zEN/FtQ/95rcQ3s+CTW2ATDf+PvYE9P4a2tIlQFc3ScxLEToChI36N76wbN9x9AgHAIKEKhIAZIk6fJ9hWv9APqP3gNc3iEzKNP0p2+g5pKxROg+140xbKwRieIul30/hJaZe3HZkxVw0IzkyCIFasewpiGoUu1dgeBIJMepmtXdrh4NxCHHwL0bA6j0I+Wyf8ZTL3ZH4QQqKgMi2NkRJ5b4SWqcvVgbHlbMHY2hd0O+fI/ndlGdr8fmMcGUQydyPFIPHYSf36N9o+uYV+OxUnUXAqha/eIXvaBQxlT6YekjpfIPz5O6AYELYepf/7aOsOIBoqIrfp/Zmwdti2Zmzv8ObsrDfLPHI/18148TfnV7bWQMRlBTG6AEOj5XbhgDwhhGORf+uxmYogzN8Pyb/87wtZuA5nY5Gr9sw6RsGJ3nR8c6Yp7v4gcm9Xf/S2KP/sXSJ07j5JKk7rwKCmIQyhRROS6hN0OnWtXYirHI1wdbyCr9JGT/bSj+rbVqXXsBOZ6HWzzg/fQcjlyz7+MuzAXe0mSyc3kMaEqRK5D84dvkTx1tjfx/ceE0LVjuTUj8dBuXhCoioYEHLeBomi7SkO61dVYXxlo3PiA5OgJ2nev72tVmigME3hdQrf7iYY6ftwQCDKiwDn1Ge6GV1iRsz3j9XtB1RS6DZ/qIWpFlaRF592beLMrFP7CpwnbXaLG+kpZUdD6cxgTAxBFeAtrSHfv+3O4lWnDZuVrH6L3xTNUtxyn6CuGRvL0MGo2iTO7hrdUQ+jq5pJZqEqsGO/4CD2O50k/6L2UFgpGpoCezMZZvfeHnaSkvbAzmP9JonN7lc7t3UtTwlaTsN1CruslJk6cpPbdbz+0m9MYGERJpdaFs31aly89wJASxzQKR2PI/3OHMTqIefYEIHEvHZyf+SgQuQ7u/AyJ4yeIuh28tVWIImQUEa5/tu/cxFvqXbt8FFBQGRCjVFneJh1n37mJPXV7+zO6JZvXW13BW41jrWG7TfO9mEyle3sn/dvHiY3M/8DtPPT7pKkG2UycaZxODZFMFJmafQ3X2xkv11IZrOIgimGChPqVt3dQFO6GgYuv4LttnNoKbrOM367h2619yVD+aUBSZDihXoiJf+T8gQ3qylSXwpBJKqft7eK9D933b23+XfvyfXXAUYR7ZxH3zgMy3HvgUMbUKGUoPHuM7lwVITSGf+5x7vyz7xAFYczOb+mEHQetkMYYzKGmLJyZVazxfoJ6B2+1Qer8OCjgrTRw5ivIraweQpAaOs7A469gFgbW+XzvUzyIQq7/1v/7MKf/iUEGAc7sDIkTp+KEk4ljWBPHcKbv7r3zA6BY1r0MOyn3dK1p+QLW5LGHOOKfHkeWe3sGb34ZY2IErdRHWKn/eE9AUck9/2kKn/08QaNJ9dt/QvujD440yWu/yIl+cqIfW7a3x07vN057rLqEESfZSddHSSeIus7HLkMoFAVF1WNptof2ughUzSKTGqLRnIv1PUXvjGzVShK6Ds3bV5BRSOTu3708+8bvxVnIpUkSExeJQp/AbtGtLmJXFzfJ+XdAWU/0CB7O6EoZ0aZJM9pfMpsQAkEc/1TWE4x0YWJgoWPsK4HvfiRFhmPKebzIpSZXDlSf+vrvr/CL/+dJXvgLA3zvd5aPjBbwsDiUMRWqILQ9vLU2KKBoKqnj/QQdl7BlE1gGYdsl96lTaNkkWl+asG1jDBWw766gJE2SZ0bwK/FMz6+0CLYYU0UzKD32Mno6T+XKDwmc9o4X+GFccho6WVHEECZt2aAt64du66DoXPmQ9KNPoIwmELpO8Ys/Q/nrf4Q7uwfvpqqiF/oIm80d6hxhp3PvIVQUjIEhOlzu3UwqRd/nfxotk32Iqzg6woSfBEjHxb354ynjuB9qKkXuhZdA1fBWl+lc/fATMaQAqtAYVo5RCZd2FR7fD7T+HEJT8ebWSJyfxL46Q9Q5fHv7QRT4RIGHbiYeOmM9jDy63TICQbu7Qhj5BGHvGuDIc1EMg9T4SWQU0Zm+sbsRvA8yDOiW5wFBZvgUZrYf1Uygp3Ik+kaoTV0idHYm6SiWiT42iDDiSYN7Zx5pH5zVJyKiGi1zO+o9VtwPwT1jqq7n6urCxCKBJVJkRJ6M6CMh9l+hAJBRCkxyjm7YxGH/2c5vf7XM8ccyfP5vjJDp05m63KKx5hN4UU+T7DkRq9Mf33N4OG7elkvkRyQni6AInOUGyWP9eJU2bm3jZCVBo4sxmCdyPJDgrdTxq22MgRyR7eJX20R+sOPhF4pKojhC+cobrH34/Z5p6ZvbrtfKacLAlm0kEgUVSyRwZBcfD4EgKTIIFFzZpagMIVCwZZtQ+lgkN1k7NPT43HtU/GnZLFpfcV99FDl2TzJ2v1Km/v3XKP3CL6EkU1iTxyj93C/SuX4Ne+oOQa0aD6aqippMouXyGKVBzOERhGlQ+fofE5W3v6x+uUxQr6MMWghNJX3xMdyFOew7tza5cYVpkpg8QebpZ0mdv0DkOJvsOwfHn56V6ScNxTRRU6nYo5PNxZ6KudmYwOETiOHmRD8FEWdcHobFRklaJC8eRx8s4K/UEKaOfe3jJ2hXNAM9lUNGwUPHTKWM6NprdO01pIzwvQ6R7N2m327Qmb2DUBTMQulA88zi2edJ9o/hdeo4jRWa89fxOw1UM0HpkU/TXs72NKbCNDDGh1AySaKOjTe7hDykjZBEh4pXggt0NocCRSqYJEmKDEUxxIAyfiCj2icGGFaOMxNduy+jfHf8lX9wgsHjCYqjJj/1t0aorXrYzYAwlD2HqOUpe5P4/uPA4RiQOi61H93FGi/QnS7Hsc8gJApCIj/Cr7SRQUjn5iLuUm1zH6HGrhK/1qb66kdEbpyM07M+SkYEduuBhhTAIs2Ieox6VCbARxcGRWWEjqwzqpzkZvg+ApW0yKOjYyoTuHSpRat0ZLwy7hcjpESOerTGoDJBOVrsaUyLX/wZon0Vy0taly9Rf+3bPX/tXP0IxTAofunnY/L5sQn00gCZJ59G+jGdnRACVBVF11EsC8VKxOQG6s5bJn2P+g++y8Av/WWEomAMDFL6hV8mqFUJOm2EUFCzWbRMFi2Xx69WqL32bQb/0q8eKS3fJw5FxRobR+8voZgmwjBQTAvFskhMHt/cLHHyNP1f+nlC20Z6LpHrErkekR0n+fw4EbZbuKvLmANDGIODlH7xL8UqPGHE1hFB+h5hu4O7OE/3xrXNOOVRQxUqY8pp1sJFwl61IHsgcj3sG3O4syuEtTaRF8Ru3iNEZjxLeiTD0psL60xBIGVI6HbRrNRDu3lV1SSTHsF1m9hOpbchFQItlUVLZdCzBRTdwBoYxV6Z66nruhsqt97G7zQItsRKfbtJc+EGodd7lSb9gKhjoyTMWFrwJ+AdjoiwaWPLNk1ZoSKXmFDO0ScGUMTeGbGKUBlXTrMUTe+7ZOapLxZRdUEUShRNUBwxYaS3hjHEnvGPE4cjurc0hn/hcVInB7j6336Zib/2PDO/di+Iu1FgLN0A390Zv5N+iF/ZPa4no5Du2jzJgUlqt95/oEGVhJgigS4MfOliksCTNrVojYxaICVydGULDZ20KGAKCydqE2x5QepyjbPqUzSjKimRZZHeMUy92L9n30Dsgtamd3cbysCndeld3JVlil/8EsmTp+O6PGt32TYZRfjlNeQuUmntD95DSSTp/+KXELqOXuiLk4w24l2KghCC7tQd1v7T7xJ1bYJmAy2X39c1bccn//L2gmIaMavUIxdBxNe7QVixNcXdGBiM76WUm/9u1HD+uI1p5Lqs/cHvMfDLv4JRGkDpK6Lf5/3YDGlEEanzj5B95jnqr3+f1ntv7098/IDIiSL9yhAr0U5u6T0RRoTNDokz4xjPxXqvld//HlHraNxrIy+M8chffxQzZ/HVt/8TfeeKTHz+DFd/c4ra3Q8QQiUKHpIdSkoUoaLrSWxnF9YeKYlcByVXQCgqbnkZLZ07UPipdufdXbN4m3M3kLL3ilGYOmohgzA0wq7zsWRNm3oGyyrQtcv4wd6u13RyCNutEYYuPh5VuUInbHFafZwBxvZlUA1hMaqc4E60P5GMf/gz7x1oKAq8jzemeihjmpwo0vhoAWHGuyumhtC1nkobh0Hku6x+8BpjL/9Fxl7+izSmLuN3W9sfGilx6ys4dLkVfMCgMkG/MoIjuwgEkmj9/zCojBESshzNMKCMoQoNQ5i4Mn5IAnxcaTOkTNKQ5e3urfWB9mDYe3sZBLhzMyz923+NNTpO6uKjJCaOo+YLsfs1DAlaLfzyKs7sNN1bN/GWl3pKS22013jj+9h3bpH71Iskjp9Ey+djxpx2G2dhjs6Vy3RvXCNyXRTTwl1cQM3m9nW+yPVBXW4t1n0ISA7er3vtIwSKYaDsMinZ3FcIxH0sUoI4hrXrgQ+Be+e6+/7pRx4l/5nPohf79+4PRUEYJnppkMJnfyo2/vtU59mKqlwhQwFdGL0PIxQmxDlWmT+Uq1cfKBDUWjS/9wFE8sjGBYATXzrNu//0LV7+f8UkFt3VLsXzQ2RGNdLDJwFozlzBax2eIUoiSVgFhgaewA+6SBlx8+5Xcd3ttaaR79JdmkWIuZgT1+keKAFJs9KMPvfzRIHHzPd/BytXQtEtumszO8j6tx236xB1XaTnEyyX4QhVrzZQ7DuD6zY5MfF5bk59HSEElpHD89voehIQOG4NKSOy6RGy6TGCqr0pCCCROHS4Hr6Drpr0MRC/dw+wfgLBiHKCqejKvly9hymJ+ThxOHHwhTpjf/lZEsN5Sp8/j5owjvSFUc0kJ37m76OaSRL9o/Sde3bHNjIM+PBf/TdkRR/DyjEkkkq0DMQ1c0mRQRcGHVnHFBajykl8HLpRmy5txtXTAKxGc5SjZZaiKR7VPs3b/rc2j+FM3WHuf/4feeD0RwgUobDBWLlJBb2He3rzOjwPe+oO9tSdfW3/QEQh3tICa//pd3c5V4VPnfrbtOxlrs5/laXf+Few5ax3g7+2ysw//kcPf37r8JYWmPrv/uG+jr2B5ts/ovn2j+59oaqwYRDDMF4pdLss//vf4N79kpuUijII7h1Kifly5ea+3Nu+B5b/w789wNWt7/Obv8YDr08I+n/+F8k9/+n1fIJlGj/8wT1B9a2GVVXRUinM0Qmyzz2PMTQc692ePY8zO/3gMqge6MgWDcocE4/sOrjlRJE+MUzlQQT4u0C6PsqQiTkxgPQCvIUy8iEzTzeg6ApOzd5KEEXoerQX72BXFon7+yEpMyOfheW3WVjeIMd4sIqQXL/Pfqt+oDj32PO/SO3O+/SffwFkhGomyQyforv24BizVsiiWCbewgr6cIlgtXrkrnQh4uzoKAxQFY1S3zk0LYEfdOl01xjov8D80lsUcscIQpd0aohy9eaOdnw8roVv84z2BUyZ2PPWmCTIi36qcm/1q4Ngg7c3DHa/P/vU+tgVh0xAsln8g3fJPTGBDEOm/uV3D38GPRAFPmuXXnvgNhuz+Kas0grr8XdE5EWJSrREJVomWI/5VKIlqtHytll2OVpEoCCJUFBRUFmNFnaRoup9A1RFp5g+wWjf46StAVRFJ4hcOk6FhdolVhsff62dIuJbuFuCxFYICV7QuU9O6pNMJtp5bFXR49X0g65H1+j7S7+AsExkGNJ98z2cG1trju+1m3npeVLPP8Xav/i3hLU6ANbZ0ySfuEDYbNN69QdE3Y8rw+8BK9InniL77POAwFtdYunX/mUcE98FQbWCMzeLszjPyN/8O6ipNEZpEDWVPrAx1dCYDq8wKk5hiN4xJiEEx9XzVIPlAzPUhF0HxTSwzk1AJPHX6kdmTBvTdYrnSyi6Qno0w6mfP8vah/MEdpvcsYsEThsj00d78RZ+e/f+3AuqapJKlvC8NkHoEoZuzwmyni+ip3M4qwuYxUGc8nKsbrTOUSo0NfZuuTtdz6ph0Zi7EhtTWBdE2IdXKwxBEWilAmruaBWUtkIg8IJOnBBq9a1TLOpk0sOYegYhFEwjQ2XlFpaxu7ydTZvp6CpnlKceuDLdQL8ySjU8OmOqqPC5vzpM34jF7/7jOPzWV1Ao5BXabUm1FlIqqTx2weC9D1xW1w5nUQ9sTBVTwxrOoegqtXem0FIm+ScmqLx+dAQKMvRZ/aC3ALaim6hmEs1KxW4Dy0B6/qarI1BChHSRmoDwXnF5L3fVxiCRF/0UlAHmwp0zq90ghMJA9gynhz9P2ymzUL1EJEMsPUM2OYyu7h7/PEoMFy4ipWSp/tGuMZYNSCLen/rtH8t5HRbHBl6kba+y0tidQEEfGoxjcb/xO5vqNcLQUdJphKoSdTqbBrL1vTfQJ0bjHYVASVgYE6N4swt0L18lOkRJwVEg88TTMU9zFNG+9P4DDelWRN0OfrWKmkqjGMaB6M42oGPg4bAY3WFSPb/rAJenn6IYerA8Ww/IIERoKkGliXT30Ic9IG78zhUe/btP4jVdXvpHn6N6vcwH/+I9wEJRNazCIH63iaKbIJQ9Exh7QVE0CvkTDA88weLyu6SS/ayuXcHpQSmoGhap8ZOoVhIjX8SrVwh9D72/iDYwgDEyRNS1af3gjR37us01EsVxFM0g2T9Osn8cv7u3kEKwVsO+fBPj+Cj2R7cJG0cvEu/7HWrNGRRFQ1MMqo27JBP9RGHMb+649VjHtXGXgf4L6HrqgRPghegu48oZkmT2NKh5UTrSaxGK4PSzOfrH7lUvDJZU/tqvpCnkFH7jt9r86i+neOMtl7//tzL8d//j4SZhBzammbNDZC+MohgqoReiqArO8uFngPuBYlgYqTx6pkCyNEZq6DhmvsT13/sfsM4eIyjX8OdXQVWwcwGdVhNjfAgqNcLG3plhVblCNTxYdqSuWhTSk3ScCjcWv7lNFF0I9ceSoiOESn/mJB23uhkf/s8ZitAYyV9kxn/rgdttrDATF88TrJUJ1ioYE2NYZ+KYWVBv0n3vA6RzX0xFVdAGSugjQ+QSPoVxB//2bZZmHdZW7w26yaRgfCKWdHIcyeJ8SCIhOH5So9uVNOoRui4o9Cm0WxHttqTQp5BOC+p1yd3bwZ7ePr1Q2NQI9Rv714YVuo6aiCdqsWjBwVd8GgYREUtyhiF5DEv01lsFwYRyllq4eiDxcL0Yr1Kk52NMDOHcWiTcp/LGXnCbLm//kx9i5mOiErcZT4YUTSH0nHXyBo3Q7hzKkMK6t0dK2p1lFEVDiHtKT/djg7BBKAqJwbHN7WQQoqYS+MvLRK7X04e4cvk1+s+9SOC0KT3yadzGGtXZByfACVNHGDrS83Fvz2FMDqOsVI7coK5WrgKwvPYBALZbo96c4f6Vs+e3aLWXdnx/PyJClqIpTiqPPdjVKyAtc6hoRypYn0hvn3SGIXx4xaPTjXj5BYvREY3vvl7n5InMLi3sjQMbU3Moh71Yx11rcfzvvczC772Ls7pPWaoDQNENzPwAVn6QRHGYRP8YWipL6HRxm2Va8zdjd0cUoQ/248+vovUX0Ep5vLsL6BNDqP15wlYHf3aZqGujZFLog8U4cF9poBVzKOkk3twK0nExJoYAQdixkZ5HWG2iDfQR1ls93DRx+XIkgx0zMinDHY+WribJJYdJGPm43jVoU+/M4QbtbdsUUuN0vRqKUMgkBlEVgyB0aHaXabtr69slyCVHSFsDZBPD6GqSyf7niAiRMqLWnqPlLG+2mzDy9KWPoamxS6/r1lhr3luFC6FSSE0Qhi66liRh5Gk5K7TsFQayZ1AUnWZ3kZazsqXNAtnEMKYe10jaXp1GdwE/vOcyTZlFcslRVps3ySYGSZn9gMAL2jS6Szh+PAlLGn1kEkOkrX4sI0df5timBqgf2FTbM5vbAkTtDs1vfZfEhXMYwwP4K2uo+XgA91fWMI6No5gm4f3GNAjxpmdxbw0zdMrhQuEOzbNw4ZzFl3/f5sKjOp4n8QPJp182WV4MKQ2qfOMrDgNDCn/uSxZvv+lhGIKz5zQKfQqNesTaWkS+ILhw0eCNH7gsL4ace0RDVQXXrvq0mjsHmtB20OPOxxwaoS3e3zPeplgWqXOPbFJB+pVybDQOCD0+Mo7ssBzNMKme67laEEKQo0hRDLMq95/ZG9TbRF0XvZQnattHmk8x/plJVi+v4FTi5yzRn6T/Yomlt2pIGesg29VlwgfoHe+FMPRw3AaZ9DAJqy929fYQBwcIWvWY7SmMY/IbpXMyCvErVbzpWYRl9gzGpYdP0lq8Se3u+3idBoHTevAzIASKaaIN9qEPl4gcF/P4CN70InwMq9Od2O3c9jeNX40WYmP6AGzQQlik6BC/86omyPTpBEFEpx5szpFSeW1fixbNUEjmt5dLLa4EPOLpjA5rzC8GRBG89ILF0vLhwxEHNqb2fA1rOIc1mKX29jSKFbt9H8RJu18omoHVP0Kyf4xE/whmroRqJNASKQKnQ/mjH9BdncVrVGJVCEUhclxUPe4ooSlofbl4lUpcKhF1bZLPPEL7+++jDxYxT4xhX70LUiJMA318CDWfwbl6l+QzF+i8/RFC19D78wTJBPpoCffaFOF9xjQIXZr2MpOl5xjJP8pC7TKO36TXg2XqWSaKT5NLjRFGLkiw9Axtt8Ltpdew/ToQfzfR/wx+6CIJ12fIkLL6sL0Gt5ZepeWsoCoGSbNIxhpAU00MLUHK6kfKiEiGtJ3tavJCqBhaCkvPMtr3BOXWnW3GVBUaQ/nzJPQcjt8imxxGypDVxi0yiUEsPUsnNcGtpW/jBm1yyVEm+5/D0NMEoY1AxdRTVNuzTK/9EC+IB/hsYpiTg6+QtkqkrRKRDBCoJIzs+rY/wvEbGFqStNVPJjGIQGBqadJm7OpxlRZNZScnbbBaplV+ncT5MyQefQR/tQxCENkO9gdX9hUHFQIMAyrliJdeMQl8ievBmXMGAtB1QeDLuAh8yz62LWN1ElUQhDAzFXD3NoDgrR96BKEkm1U4flLDtOD7r+1cldl3bmGNjoGikL74GH55lc6N64T366UKgZrOYA6PkDx7nvTFxxGqStBsYt+9Tdg+uDHVRPy+BPisyQUG5TgJ0Tv2pqIyqpykEi4foO5UIgwNNZ8mKDePVEDg+J8/Se12ddOYapbK8T9/iuV33kPVTcIoOpLKLc9rs1L+CIHAcRv35RkQ3xcriWol0ZJphKaTGBzDb9UJAw9hGBgjw0RdG+m6RD3vkyDZH7t5A6dNe2UKp7oUu1J7QUrCdheJJOrYhI0WYa1J1D78xOHHiS4tXGwsdvOE3ENCpOjI2JhOXkzzub82jGdHfO1fzFGej+/Fr/43J9iF5XEbFEVQGrMoz9+bELXbku98z6bUr9K1JULA0IDK/OLHaEyFqmH0DRDabYJ2k/btFey5aswPuYEjeFlKj32G9OhpjHSeKIrwGmUaU5exK8sUTj2JlszQmr3+wJT3sNmNhcrXz81fKuPOLNL3V84D7wOCoNbEn1tGHx1AzWcIy3X00VI8u/R8vDvzoCqo2RTJJ8/h3p4lsnemYEcyoNy6TSYxwHDfY/RljlHrzLHauEHTvjf4K0KjlDlFX/o4i7UPqLZnkEjSZpELE3+BMPS4uvDVe/0tFHKJYabW3qDWmSWKQtKJ/x97/x1nx5Wfd8LfU+nm1DkiNDKRmNMMySEnabKCFeyVJcuyJXvXa2/wfiTbr71e27vvWl5rV85ZVtrRjCbnIWeGHGaQIEFkoBsNNDp33xwr13n/qIsO6G6g0WhyRn79/EE26lbVrbpV5/zOLz1PN0eHP0N/7hj1ueewvQZz5XPUWrOkYr2Um1NM5F/DDzxA4gerJ++WXWKy8CaqotGX3VizU1OjzOdfp1C/wtEdP4nrWVye+x7pWB+7eh4jHulEErCj80F0Lc61hVcwnXLbsx1mT9+T2G6N64XlMK2iqHSm9jA2931aTgWBoDu9l+HOB6m2ZpirVKlbi7ScMulYP12pveRrY0yX3gFCNhovWP3764N9xO8/HsZqVIXW6fNI1yV6cC/GUD9e27CKaJTEA8cx+npIPHgv1qVRnKnl/F+5FHDgkM5rr7T41Gdi/P7vNtF1+OjHo1y+4DE+5nHv/TqGEb5PxULAxDWfWi3Ac8HzJJGIIJ8P6OhYHtVHj+kkkoK5WZ/+AQ1Ya0xrb7xGfN8BIoNDaLkOOj78MZL3PoBfq+Gb4eSoaBpKIoESi4eEG7kciqbjt1rUT52kNXoZtkCKrrHcEtOUNfLBDDvUA+vvLAQpsnSJfhbk5KbOr8ajKDEDv9ZqC1psYwpCCAJv2csLPImiipDTdnEKLX77nNxmviMazZLL7MJ26nietdaYyvDd1BJJ9FQOt1FF6DqiPfcE9QZ+tYYSj29YvlUcfQMjkcFI5jBSHXTsuQ+ra4jCxVdJxfrQ1Aj11jzRSJZcYgf52iiWUyWoNQlqoXF2rs3ckebmjxISSUvWb5FWCCEI8/o30DkY4djTHXhOwMtfmF8ypg99shtV3fyzLkwv/51OCX7m0wmSSQXHCd/Of/u7dycXeGtjqiik9h9r5x98fDskrA6sAKFqKJEwye/WyqixBEokQuC6CEBoOl6jCggU3UBLZbALC6jRGL7VQmg6BP6S0HVu3wNEO/upXj1DZfw0zcXr+HYoWZYcGEGLr41l670dxI4dAFXBXSyhdWWJHtyF9H2ErhE9PEL00G6ssXapuZRLOSYlHsXY2d9WUW/nOW6Eo/wAv9pAGBpBywoLnNaB6VS5Mv8C2fg4vdlDDOaO0589TL52hbH55/EDB0OL05XaQ8spslC9tOS1mXaJhjlPT+YAo3Pfw1thAKvmLPnalaXQpuVWsdwa6Vhv+zZ8XL+F40UJpI8fONhu4xYFAKGB9QPnlgufllOmYeXxAxcpA+r2Ag1rcYmTU1ejpKL9pOP9TORPUGpeXyp68nyL4c4HySV2MFV8e9W15KuXKTauLVVDKg2NoY77lioAb1zbjeZwz7dxvI3DVl6hRPP1k+HzDCR+rYYQAq9QCmXAHDekZBQC8/wl7PFrbYaj0JtpnTqLjUoxGvDlP2nxyc9EeflFmz/7i3FqNcnF8x69fQqPPRFBVZZqnNh3QMP3YfyKh+tKzp52yeUU7jmsMz+3bNQ6O1WO3WuQX/SpVtaf6LxKmYXP/xGdH/k4yXuOoKUzqKn0kloMsMSCdeNvGQTYC/NUX32JxvkzBM2tiSvfoCoPCHCxKcp5uuXgut6pQKAToU/ZScGf3VQeSxgaft3Emc5ve59pabTIwZ+9hytfHwUJez65j+pEg3jXEHoySySVo+raeOvQ8G0WUvo0Wws4Tp1EvIc9uz7M1evfx7IrK/cisCysxVnswgKB6+CbDfx2n2lgWdgTkyAE/kbPSQa4ZoNY5xCpwQMY8TTNfBhOT8Z6QEpiuSwxPcts6QydqT3MFN9G7cgQvWcEd2oeZ3rh7p0ZAbE9fWQeGMEtN6i8cvld0qdm05zP6grTNHqiyh/+vSu4dsD81RXHS8m1sw2+/s9vvchTNYWf+1u7V23r61GpVgNeOWFRr2/PUu/WxlRKArtFpLsPuzBPtLsfGQQokSjxod2oegSnXsEpLZLYsRcZBDjlPG6tQqx3iMbVi0ggc+g+mlPjCKVAcs8hrPlp9EwHzckrSzNV/txL5PbcS3L4AMnBfTj1MvWpS9QmL6Go69ODuYslqt98MbxUx8ObL2BfnggNpiAsTVeVkBs4CLCvzSytHO2rM7iz+XDikhJpu9SefW355J6PMzmPf0vBaInjtcjXxig1JogaaXb1PM5gx70E0md07nuoikHMyJKIdtCZHFlVVayrMaT00bUE3gqaQtMpryLWDmSA59uoyvpN9tsFz7eRBG0PFxy31b7LkOtSCIWokUJXYxzo/yB7+55aOjY0tjFcv4WmRnBWMPPUzflVoT4Z+ATSRxVb6sxC2g5efjUzjQT8yk2FcFLiV6prmEeDZoszJ8JiT8+FyetNTFNy+aKLBFxHomniRn0QpilZXPD536/U8D1w271qgR/WldwQmF+YN7FteOEHFm+87uA4Ev8WlaxufpHFL36O6qsvkbjnKJEdO9A7OlGjUUCE5O31Gm6xgLMwT+vKKPb0JIFp3YJg4vYQgIpOQDhh1mSJslzcMNQrhCBJlg7RR15Or7vPSgS2i96VwRgIUw/OfAnpbk/70egXLnLkl47x/n/wAYQimDs5x4XfO43TkNi1Ii3dWJfP9k6h6wl6Og8Ti3VQrlzdgAVIrqIODGXgwgiFmk6RfvJ9eJUKXrmCee7CmqMHHvoE6aGDNBeuURp9k1ZxhsBbcb52xCdmZJkqvImhhYVnfqWGdfEa0YO7iD1wD40XTuKXtl4EqneliO/to352kvj+AWIjvVizJQQQ3dFFa3wBv2YiDI3oUCfS8/HqZkjksLMLZ766RBt7a6zPeb4eVhrTasHl7WeLSAnBipSLlJCftDj30q2/WzcUqouD6NHl6FGhFHBwv05nh8r8gkcg4ZvP3t07eltj2pgYJVKvktp7D06lROBYKJqO9H1cp4Y5M4GR68J3bLxGDbdaDnuvcl1L3qe1MENrahyCgNbMBOn9R3GrpbAfq43y6FtUxk6hGFEyO+8hO3Kc7qNP0HPv0wihYJZmiWS6cJvVZb0/P0CuCMFKnzWr4FVTme+z1D3i+2uULG4UGanZFJF9O3CmF25jTG98RxiKbFh5zk9+ncTeDgY6jjI6FxJACKFQac6wWLu8ZhUZyGDNQPUDb91Wnne/Qng1QfTKvrob13MjhDZTPoNpl7k5R2y5NbybQmJu4KzabyusOtuNlcIsN1amtVWFQjc9pwCqlVtf9w0P1rbBtjcXegssMyTtuH5tmSFm5YOW7V9LyraM2XatonXctjF1sCgFC3SKfiJibUvXDTGJbmWAoj93W2J0IRRE1EDLJMI2GWX73ly7YvH2v3xz6ZwykEhfoicyxLvD1pJE324a06ObajNZD4qiE41kaLYWKFXGAbmWsk9RiPUMEuvfsbQp2jPE4ivfwWs4KMkkzvw8ajKJEo+zUgP2BszSHAtnXgjrP26qPF6sXiYd66MweyVkpOp5lPnyufanAjUZQ+/rXF7N3QX0TCLMDV8vhAZyuBOjN0Pq2E4qL11k6C89w9S/eY7U0R1Eh7pQ4hEC0ya6s5vyyxcZ/LUPMfFbXyUwN1OxvclxcdM7th7ZggygXnJvW7Tt+xKz7qFHl50Rz4O3Tzt0dSqk09tD2ntrYyoUkrsPYuS6CWwTr1ElvmMPkY5evFadwPaQvo8MAqTnIX0vLE3XdaTvIWUQFsV43pKeYWCZCEXDKa0ukglp+3x8q0np8puULr+JFkuR3nUP2T3HiXcNs/tjv4pTL1GfvEx14hyN2XdHHNyv1Gm8+NaWjpUEWG6NRLQLRWgE0sNyazhek7nyeVx/+4oFlo3Se8eVa3tNvMChbs4zVzl/297W9bDR1Yb3I//LIt/fLNqT9Xu1zFBvGvplmacmS3QxsC5xuhCCNJ1tdppbt5HZ1+ex/2ABoQjSz9y/reI3QhWoES0kuG8j8AIQCooRJZ7IYNeKqNE4rtnYcntMNJIhlxnBcioATM++ESpcLV2HhhpPYuXn8K32olzRltJW7vw8keEhhK7jTs+sa/Aq105vKATu+w7V5szSv6/M/mDpby2XRh/oofHSKbxC5a7F0EP+6nDxHPhBm8c7oPb2NWrvTBDd3UNi/wDxA4MYnSlERMO6tkj99AT1UxMk9g+gd6WwpzbgMV6Bm9+7jbCZdMJ3/v00Yyc3sWCS0Kx6xLPL312rB3zn+8vO1NDgnfdr34zbeKYBjfELCFVbCivZhQVuHvJ2fnVTd/P6apkbp7A8+BRNx62WsPK3bwT3zDqliycoXTyBke4iteMAmZ2HyYwcJbvvPs7/3v9623O8W1CERtzI4gY2QeATrrgU4pEcucQOKs1pAunheE1KjWsM5I7TlRqhUL+KlH5I16Vo4YrQ3doK2vNt/MAlHslhaPG2RygIpEuwwsgJ2qTvba9HINrMSZunPbyBmjlH08oz2HEvNXMe2w2rNYVQURUNP/Buu2DYaG51vCZSBiSj3e0QeBBWLgbeHbPw/FfcCmLNpGbRpCwXyYguDNayIgkECZGmQ/RSkYVbeqdKPIrek0UYGlp3ZkvEEhthx9O7OPgLR8jt6cCqmGhRjdnXpznxf57Et5oErk0k04Vdnt96n6mi4Xk207Ov07KKIMEPVtdNSNehMRFGmoSmI1SV5sQlAidMz0SGh9G7OmmeOo3W1Ykzu7Yivff4Myyc/sG6BjUV76UrvRdNiQKSsdllBarAshERneih3XjFKs61mbvSi/UaJlJKooMdxIY7cRYqaJk4WjaBlo6hRHS8uok1VaD+zgTW9Tzx/f2oicjSImFzy1+xqvhtI0jA3UTl+Ndukyu9gcCXvPLlBdIdYbowGhHoOhiGQNcFSPirfzHN3/mHm+/3Xg+bWiaszs/cxTJTKKjxJI1rl+44NOHUChTPFSiee4VIpptE/+7bH/QuIqIn2dv/NFE9jelU8QMHTTVIRnsxnQpj8+FK0g9cFqqXSUS62NX9KN2Z/bheK2xvMbIUGle5uvDylq7B9VuUGhMMdBxn/8CHsN06SFioXqLSCgsZFKGSjQ+TiHagKhEURSMeybGj60G8wKFpF6m35m/zTcuw3TqThZPs7nmcw0OfpGmHBUuaGkVXY8yVzzJXOXf7E60Dy62Rr1+hO70XRai4voXjNlmoXqTlbJ24/EcOQVhhHsj3zvW8DdR229VK5IMZusUQOl3reqcKSpg3FTNU5cZeiIjooUC4odN44xL+NrZu7PzQCCf/6Wsc//UHeOXv/5Dhp3aiRTUUzQhbTOxWu8Zi69EN3w/Dld1d99Ayi0gZUCyNrhUIDwK0ZJrEzv1he4yqUT79Gr7pETgOzVOnMYYGN4y0pPr3snD6B+t+loz2UKiN07KKa9IiaiaJEovizuUxhnrw5ot3ZUydxRpuvkbmkX1I16d6crwd0u0g+/6DeNUW5tUFkJB+aA+J/f04i1W8SgukxFmohnKat4GADfPyN8OSd5/3vgEp4dJryznlvSMae3fr3HPQIJsR+B48+lBkKRIvFEEsaxBJhca3sWjhmrf3lLdWAbJVyABr4fYFDLeDXc1jV/PbcEFbh+M1mSm9QzY+hKElEELBdhuUGtfJ10YxV1CPmU6ZsfkX6EyNkIn1o6khEcN85SKF+jLBveubFOvXaNiFm8Knsr3f2kE5WXgD262TivWhq1Ecr7WqNUYIjVSsl3S8H2CJLzgV6wMkqmJQbc5Qbc4gkfgybK+Zq5xfYnXyfIt8bQyzXV1cbFzFcmt0pfaSiHSgKjq226BYv0qpsUzSbToVFqqXsN3VlbleYJOvja0igbiByzPPMtB5nJieRVMMLFld5WW/l1ATESJ9WRRdxZqvhJPHVs4TjxAf6cEp1LHnKtt7kVvEeuG2FnWKco6UyKKxftFfSsmSld3UZWVD7zRoWbTOXUNaDmo6fvdhyBUQQmBVQuH0wPWZfX2aB/7GI4x/fQqEwEh1EDhWqAq0Tp5yc5A0W4tIJKqi43rmhu+gnsqiRqI4lSKRzr4lw+kVSyG71WIerSO37rFmeZ7U4H7sWmEpDea7Jp7VxPGaJCOdGFocpKRYX5aFDEyboGWidWXDnPHdyvD5AbW3rlJ7+9oy/Wogqb11leobY9Au+jGvLmBOtPkEVhTWFZ89vamvUdGIc2vBcBnGojataboVnLvoki8GnLvkMDXtYTvw8z+dWHpVommdPU/2o2gKEsnEqws/hsb0XYAmDDpiw0S1dMj+Y81g+XW6YyPMNy/fUXgwqqZxgiaB9EOPLjKA6VUxvbVhWD9wydfGyNfWKrfHtPRSvvQGHK/BXPkMc+UzG36/5da4uri+lzq+8OK6213fYrp0asNz+oHN9cKJDT+/gZny6gFxYfqbq67rhqeNUIh09qJkOshbC1yfPbH+hKUo1Lw8ldnvrvncduuMza/PvWx7DRaji1iLp/HN27O6CE1HCEGwopgt2jOIXc6vKnDbCqKDOVKHh/AaFomDAxR/cB6vZqImI2jJGE6xHhYNKYLAchGG1h6AYOSSOIUage2BECT29qFnE0vGVI0b6Lkkdr6GdD2UqBFKGaoKXqWF9AOUqI7ekcQtNQgsFy0TDwtvhMAtN1AMDb0jSeD6uMXGHRkOlfVDr/PBdXrFMEmyG3inKj1iiAKzNFk/PaH3ZBG6hn11juiBYczz17dN1aQ0WkCLahQvFjjyK/cReD5moRWGSoMAoSgEvovXug2b0C0Qpi0EmhoNK59VY0MBbq9RozV9DS2eBN8FJGga0nURhoHQddDW/62deomOfQ9ilxeW0i2twjS16UtYTpVUppek1huGmm9AU1FScfxas82IZGxfn+mK38u8nm+XyN/0G94Fz3JadKLczuRIsGjhrtObvV2Ix0S4WKhJMu3io5OnlosmtYiKoitcfWkOz/ZxGptbrPypNqaKUBlI3UNcz1Gzb3g5Ek0xGEodYbF1BX+TeROBwmDqHqbrZ7H9JorQ6IrtpGhOrmtMb4XB5BGmG+ew7vC4Px2QYe/vyD1UL74NgBqJhTJh8SRuvUrg2kR7Bolku3CqRcyFGbRYAiEEihHFLi0iVAUtmUX6Hl6zDjJAjSfREmkSw3vxmnVk4IdFbUKAUAhcG6EoGLkeZODhNRskd+1H+j7WwjRuvYKWSKOncjiV4lJwTIsnUeNJnEroAShGBDWWQPoebr26YW5Nieg4xQa105N0Pn0PyYODNEdn6XjqEE6+TuJAP82xeSI9aVpXF0ke6MfO10kf24E9XyHzwC4Wv30av2Fhz1UQ7aIZLRun4/EDOMUamYdGKDx7hvSxnWi5ONILsKaLmNeL5B7fh1e36Hh8H4vfOc3Azz5K4/IsTrGOV2uRvm8XatTAq5vUqi2ku3kPXtnAmJo0WJDTxEV6Q4ObFh3klB7MoLmud6pEDIyhLpAQ2dWHNXr30agbuPqNMdyWy9hXLzP05E4EMPHdcXzXwSzOEu3owyrP4ztbN96qahCPdeMHNpZVobPjAPXG7FL4dxWEINLRg57pQNH00JZmMwhdwxgagiBAScRxZ9bmTBsLV2kuTqza5rYXkIaWpG4uEAQe6XhIcwoSJREjenA3QaOFkoyHnLzvgjj4ZoqJ7hS9yvCm9ivfJL/WszPKyPGtc+beQLPqcf6lMnt2azx0f4ThQY1KJcD3JR2dKv/gH1cA8ByfwAsYfrCbwAuYfrtAY/H279NdG9Oej/0URmfP3Z7mjrDwzS/glotE1AR9if1cLD5P3Sm0yd4lETUs9d6ZuZ+ImiCQPhPVk4BgIBHS5gXSY7p+loZbxFAT7Egfoz9xiJiWpuVWKFnTgKA3sY/u+AiB9LlWfRM3sBAodMZ20hMfwQtcFltXqNpzaEqUwdQ9DCQPEdVS2H6DfOsqFXvtQPpTCylxKgWk72GXwobx+PAeYn07sPKzxAdHqF46RSTbhdHRE5J4iDl6n/g4jetjBI6FWysR69+J0dGNUFSa01fxW3Vyxx/HnJ8i2jtEbewc8cHduPUyQlFRIlGshWlyxx7DrZdBgulPEu0dwqtXccphSFpoOtHeQcz5SQLHQs90kj10P3ZxnvjALhrXx0iNHCJwbPRMB5Vzb+DWbl14IH0fe6aE0ZNBTewifXQH1nwFNR7BnMhjdKXwWw6Jg4MYXTXSx3bQSsdI7O+neuo61k0TU+qeIfyWRePyHIk9vcRHetAyMbyqifR8jO40WjJK+vhOnHyN1JFh6hdmiAzlmP/Km/hWqMSiZ+JE+rJUTly5Y+9EYeN2gNlgnEFlN1ES67IJKUJlQOymwCwWa0PfzmwBNBW9N4d5fmJbtTabC23mn7rD2JcvhVEBx0eNxDFSuXbb3l0aFxkghEBVDUCgKvqGuW7fbGIuTGMX50ns3AcI/HoDEYngTE6Fffnx9RWkMsP3IG7qoW8uXsepF4noSVp2kZZdpiezzE6l6BpaLo3nB6jJeNgr7/9o0iB3gggxusXgpvYtBqvny11HU/zU/7Trrq9hZqzJ2R+WmZrx6er0UITgnXM2jYbkL/9yCl0D1wPP9LFqLjse7KY6u/lw810b09jgTiIDwxuGQd4NKEZYbRjXsmGbhlPgRrT9BiJakpZbYb5xmf7kQfqTh5iqnWaxdYWAgO7Ybjpiw5heDdc3ma1fpCu6i+n6eUwvzA3qahTTrbLQGqM/cZAd6XsZr7xOXM8wlLyH8eobRNQkXbGduIFFy60w17jEQOIeZhsXaLkV3ODdkfjS2xVpVku+GwvTO4ISieJUC1iLMyR3H0KoGl6zBoqCOT+J9F20ZIbGtYvIwEeJRNGznZizE2ipHEamE6WzD7dWojVzjeTIwXAyi8XxrWbYhhCJEcmFrDCtqXECz4UgwKtVsEsLOJUwh+7WKyiatlRBmho5hDk/iVWYJ733CJHOHmTgY+VnUCJR1ERqSdQ5klD5zG/sp2MoxokvznJlBbd74sAAtTOTRPuzVE5epfLGOAjwaiax4U6S+/vxKk0kUDt9ndIro4hnz+Cuk2dVDA2/ZePVTAIvQKgKBBLfdJCujxrVUQyNxugc1TfHyX/3DL7pEDRtnMJy33Pp5ctE+rJ0f/Q45lTxjlhrbmVMbUxmg6uMKEc3rONJiQ5ySi/zwcTavuFAondniO4fxrx4/a5bnRL9SRCC5mx479HOGFbJRHoBkpDTO967g3jnAEiBUDdX5bkR/MClVp8hm9lFNrOTYnkUx10/5SClRPoeAQI1mkDRNPx6A+k4SMdGiUTXCi600SpMhjJ8CLRokljn4FKUpNSYoDO1h47Ubharl7hhzQPLwVsoIn0fL19GTcYRmoZ8F8Oi24FhZT8G0dvaCRdnTeuV3fQpza6dR11HIgM49Fg2pCqselQWHWzTx4iodA5FiCVVPEfyypcWGD8Vvj+VasClUZeH7ouwa1ij2ZL0dqvcEGAykjp6VOWN373MwL2dRJLGe+OZ/uggUIS6VDBzM7zApmhexw0savYC3fERNCVCX/IASb0TQ43TcIoIoSCli+XX8aWH5dWx/QaaEsEPHOpOnqZbZrE1zsGOD3CVE6T0bkyvTt3J0xIVOmPDRLUkTbeE7TfD3lKvgeXfnvBB0+DDP5XmnvuiaLrg8hmLH367Qblw69Xmrr0Gn/j5NF//bJXxi9szkNR4EiUSBQF+s0Fgb34h4LeaBK4T5q6EIPB8pOcReOG1BZ6Db7U5Z3WjvS3Mc6EobeWNgMC1IWg/0UCGLUSqHq7g21WxgWMTuA5CUQk8j8DzllfngR/qZ67I/wRBgPRc2s10IfWbbYV5rRVM2UP3pHnwMwMoqqBVcZn/WovovbvJPbqP5vg8zcuzmBN5dvzlZ4gOdmDPV8h/+x2a4wsM/fknyD93luboHDv+0jMY3Wmk5zP7+ddJ3DNIx1PhAsFerFF95zoDP/8oyXuG0OIGi99cIL67h66jw/imQ+XNq9TPTTHwC4/T+8n7EarC9B++vOo1V+IGuUf3ER3uQDHuvOlc3MKYAkwFVxhWDqBjbOCdKgwr+1gMptb0BOqDXfj1FsX/9/uknjoeirg7Wy+S6X94EKEKxr50CYCn/+lHePavfBPfCs8ZeA7N2av4ZpPAc27J3307KIpOMtFLvTHHYuE8Qgji0c72PLF2TGrxJIkde1H0CObcJF6bV1nr6iT9vsdw5ufxqjX8i5fXHFudWt4mhCDRs4t41xAAjttgoXwehKAzNbK0X9BoUX/5phqJH3PPNE0ng8rI7XcE8nIG76a2mHMvlbn85lqGJyOi8Ov/7CD5aZMv/9/XuXyiiue0Jw8Bmq5w5IkcP/ubu4nEFU5+Z5nbYH7R5wtfbfLoQ1EScfg7/6i8NGUoqsCIaUgp2/nTzS0G/xQbU4np1YmpaVSh48vVD8ALnKUKPIlEFTqd0WFUoXO28F164iMk9XVEaFfy96/QCJU3nlC7V/PGanzV9i3A8+A7X6gxds7ikacTfPWPqsgAunpVRg5FGL/oUFzwUFTYsccg16Vy+YzN2AWb2Ul32yICwjDo/cRPkzxwFIDFb3+Ryluvr91P1UjvP0asb5iO449TOPH90HDdeBNlSLzg1suk9x8l1r+T/GvPruql81pN3EqRzgeeRAY+5bMncGsl+p/5KaLdfejpLNJz8Vo1Ou57H4Hr0pq9jl1cJLn7EL1PfRIpYfHFb+HWSnQ+8CS1RIrG9VFSI/cQHxpB6Dqlt16keukUvU99Gn/kEG69il0uEI/G2iQhq1tVhCJC4mwRTm71s1PMvdiuopThvQW2x9X/59somho28QcSe67C+P/1jaXijGv//Dsohk7geKH494UZGpfafdXtfSb//Q9QdI3A9VB0Da9ukv/uGRqX58KFgYTp338RxdAIXB/8gPHfXi4KC1oOxRcuIHQV6fp3HNoUQrllm46LzVQwyohyZMNXO03HuvJsQgiUqIGIRVBjxl1zcCi6glhBaK4n9VWXpOgRkoN7ieX6kFISeB5OfWs5P02N0JnbR60e5nmlhI7cXrziRSxrrZF2a2Uq508ub1jRd2ldvUbr/MVN9ruKMJcfiS39O5Dhe5BNDJKvrjDGW9Cw/VEhQoyD2v3oRG47VwUyYCoYXbPd9yR+Y+09f+DP9jO0P8F/+o1RTj9fWud99nn9a4v4vuS/+V/38OBPVHj9q2EES0pYLPicfMfCMBSSyeXFZbNgsXCpwrGfGaEwVqU6vblQ710bU9+2CKzN9zgpkUg7tLGMwLHvKO5/o/LN9Go03RI7Mw8wXTuLEKwijF+NsIjFlx6q0Egbfau5YSV4gUVcS+P6JgIFTTFIGZ3UnAW6Y7up2DNIAmp2gf7EQaJqmpiWQsoA21/+wR2/RVzP4PhNfHl7wgEp2zUEMhx3fUMaP/EzacYu2Pz6b3byr/5hgeERnSd/Isnlszaf/IUIX/mD6rb2LBqd3Wjp3HKD/QYvvvQ9qhffXio+AqheWGaLKp9+denvhRe/wQ2C2+mv/f6KkwQ0p67QnG63BbUnoJlvf3aViLJdIORvXrFP/tXvhuTv7felOTkWnqdt0KuXTlG9tHrlPvudz646ploJV6iVc6urnKfPVTn93CIdg1HOPLdAo7jBu+S3mWJWYmWVYyBDPuiNPr+xT7s3T0qJ37TDMO/KiTKQBJa74TmkH2w5P7gZZZWpYIwdyn70dUgcIDSau9RDFLwZghXvuDNbQOvOkPvkozTfHsNv3D0vr6KpqFFt6XvVqLa80A08ahPnqU3cWlh7M5BtIhO9TYIihIKqRjY0iGosidA0tGgcPZ2jOXmFwLUJHJfIjmGMnTvw8nkar7+55ti9H/s1VD0a/kMoBI7J3KnnyCQGl1rZABLRdRb9P/YIKSgPqg+QouO2hlQiWZRTtOTmizYf/Uw3jhVw7uXyhnOhlHD2hRL6/7GXez/YuWRMe7oU/tqvZVAUaDRDb/b8RWdJ0m1xtEJ+rErnnjR6XMNpvgetMXNf/IP2BLz8Y90oBLoZwjAY+DO/RLRvdSJ68dmv07xyYdNl134zDJ/60mG88jq7Mw9xb+8n8AOXq9WTNN1iuwK33bsVuLS8ClV7jmykj0MdT9P0Kth+Y4mAPSBgun6eXZkHabglFptXqFqzJIxODnY8FRLXl8O2FdOrMtO4wIGOJ/Gly3zzMs0VpALXam+xO/MQvYl9zNQvULFnuBPs2mcwet7mrVdadHar7D8aYc+hCM99tU654PPg++N09W1vUMHo7EVLpbf1nKs81o0+vxk3J4DX2+fmhddmksabWKxZTZ/f/x83bl16tyAdj/Lr7w415kbYjLMYeqdX2K3es6HxDb3TgSUCfCURJfnQAYydfWFUPh5BKMpdFQUFbsDAo31E0mF6QAjB4T9/dEmKrbXQZLQdAr5beJ5FoznPruEnqTfnMIxwsbxuJS9gZHJEuvqQEqLd/ZgLU2HVuaaCqhLU6xuqTl1/4bPLi1YZ4FktZOBhaAm8Fd9Xql9f9/gfV2jopEUnu9V7yIruW+bnb8CRNpPBZfzb8D6vRGd/hHrFQ97cvnMTAhkO/2zPMvtSNqPw1imbU2dtKtXldzPZHSPVF6dzJI1qKHTsTHHxW5M08+9BztRvrXaBIyJGVEngSRczaKwqnRdGZF0PNDCbeLXalui/Wl6F88Xn1mw/V/ju0t9le4Zy26BdKH5/zb4hJHnzKnlzuTm6Yq9PeSjxWWxdYbG1/gRYtqYpW1tvBygVfHbvN9gxYpDr0jj/tkU8qTC82yAW99B1QSQiyHSq9A5oTF9zsMy7cFMVBaOrGzWxOXaS/4r//8GsvMqA3H1LDcpd6iFK3jw+HlpHGhSF4me/j1AUsp98FOvSFP5dyLAVzi2uCvOe/8PVCx6rtD2KNABS+hTLY7TMEvF4F1Ztinpjbo1G8A0Ejo0WT9KamVgdYRMCZ3YWNZ1eHW0A1GiCwHVwW2EeUIulMBJZFM3ArpdwvOaSVOOfFqhoGESJiSTdYoAeZQfRdUQT1oMvPaaDMRryzpRv6mWXeFpj5+Ek185s3JO+9/4URkShVV1+BxfyAR//iMbggEqxFCAlfP4rTZolCwREkjqFK1Vq+zOYlc0V9t2ZMRUCRdFCLtp1DJ+CSlLNkVa7AcmCO0Er+C+x13L7Uav4XLkQPrSrl2w6u1V27TOYn3a5NuqwMOvx5MeSdPdrTE84aLqgWvJJZhRiCQXLvAuF+EQKo6M77JPbZmR6I+x9pAPNUChOtrjyxsZtKOlug4NPdCEEFKdNrpzYeN9Up0H3rjjJToNIPBSg9l2J3fSoFx3Kcxa1vH3LUHjXjhg7j2fRI2tXzgvXmlx7q3LLe9OjCsOH0/TsTnD9TJWF8SZCgd6RBB1DMaIJDUUV2KZPdd5i8VqLVvX2tGsAqS6Dnt0JUl0GRlRFuYUIcjVvM/pqEd/dfq5CW7aYDa6yWz28rncqhCAtO+gSA6F4eBCgJqLEDoZqKmIbVE0q42Uq4+G7kBxI0VxorPJGjJRBZlcWs2Ti1O5eh1PKgJaZp2XenmXNLudx33kV6fvomc4l8hCvVEZNpZCWvYaXt2PP/dSmLmHX8iiaQe+RpxCajm+3qE5eoFWYWu+rfuS4oYOroKKioQsdnQgGUeIiRVp0kBYd6yoPbYRABhTkLHPBtU2R26/EqeeKfPCXBvj0f7+DH/zhHAsTJq2ah+9JNF0hkdUY2Bfn478+jGMFXHitsnSslFCrBRzYp9PbLVEUwee/0iRwJfV5k8aiiQzAqrmrxOhvhU0bUyEUYpk+ovEcvmtTL08uVWouXSASR1r40l1BTfdfsRkUFnwKC21xbBde+0FrZfqQRi3gW5+rrdo2dn57BHz1bA6j493Jy/TuSfCTv7mfeEbn7W/M39KYdu9K8Gf+3iEUVfDOd+bXNaaKKjj8dDdHnulm4GCKTG9kyWh5ToBZd6ku2BSutzj1nQXOP5/f0KDuPJblM7+5n2RuLfn2a38yfVtjGktpPPSTAzzyM4M896+vcvLrcxx5ppuD7++id0+CWEpD0QRW06c0ZXLlzRJvfGmWxavNDe2Lqgl2P5Dlvo/3sfNYhmx/lEg8NKYb5Z0uvVJk4u0K5jaKcN9AQMCCnKJP7iQu1m+cFwiGlf0U/Tm8ahPr2jLXc+vCdQJ7+9o29n7mAM35Rkgl+No0rumx9zMHiGQiNBeaTP3wOmZ++7iAN4QQqJEYSjSGFk0gNI1Y7zCVCyfxPRclGm17p/Oo6XRIL9hGomcXtakwLJ0a2IeezDJ78tske3eRGtj7nhlTgUJW9LBHOXab/W7k2EVoSIWGho6OgSGiRImjCm1TefiVkARUZJ7r/mXMLdAH/vCP59lxT5JDj+fo3R1ndqxJvezhuwGaoZDu0tlxT5JkTufUc0VOfnu5mjeXUYhGBZ0dKi+/bvHEo9El9klVVzCSOmbZRtUEMtjmal5F1TGiaSKJDhTVoFVfXGNMIVxpBHgYShxFqD82xN5/GrFeKvDd6CnVMjn0js7tP/G7gHs/3suHf32Ent1xAk8yP95kulAj8CXxjE7ncIyhw2l2HM0weqLU5o1ZHxOnK3zzt6+Q7NCJJDRSXQaP/PTmGstvRv+BJB8ZGuHgE11ohmD2coNWxSWSVOndk2T4SJqekQSJrM63fmec2uL6C6Gd92b56H+3h53HMlgNjwsvFCjNmGgRhf59SfY/2oGqKzRKDhd+mGfybI3Fa02cu4hM3A6mbDIfTDKiHl5/BwEpsnSLQeYaE5jnrr1r19J1uAehCJyGw8FfOMylPz5P34MDnPvPp+m5v4+OA13M5O+uz/ROoCcz6OksXrOBGosjFAURiaDEY+hdnURHdmOO3kQ5Kn2EqqJoOt2HHmf+ne/h1Is4iQyRzHtHgKMIhazoIkvXe/adNyCRVGWRa8F5amytlWlx0uJP/vE1Hvl0D8efznH0qY5VERzfC5i90uKFz85x8psFKgvL9krXYXbex3Zs5hf8sJVGC3WOIymd7n0ZJt9YpPtAlkbepHz99tSmmzamvu/imDXi6T4cs7quIRUoGEoUgRry226zzqbQNbTuDtz5PCC2ZFmUSJTowDCxoZ3oHV2oiVSovxpIAsfCq5axF+cxp67hFPPvjvX6MYISixPtG0KJbj4086NCPKPxvp8fpntXHLPm8YV/cJG50QauHYCUqLpCLKXRtzfJznszXHyxcMsIY3HKpDI3i6IJVF0h0xvZsjHd+3AHqiaYPFfj+//uGsVpE88JUHWF3pEET/3yDvY+3MHxj/Ry/vkC55/PE9xUOJHsMDj+kR52Hc/Qqrl85f8cZfzNMnbTQ1EFyQ6DBz/dz4d+bTdGTGX2UoM3vjyLt0kh8q3Cx6UoZ+mTO9b1TkVb0m1QGSHvr+0T3E6YpRZXvz2GVbJ4/O8+EfYd+5LFd+ZJDaXQE9ufqlgXUuLbJnZ+Dru0SODYeK06vm2hdXWg9/aEbTqOE5Lur0B18iIDD3wMoWqYpTma+ckwhaZHUDQNxYiEhZECpPPjTcawFQQyoCwXGQ/OUpOlrcsrSpi82KQ4M8VrX1kk22OQ7THQDIFjBZRmbWoFl9KcjdVcvdicmvWoNyUC+MD7ojz3vInvhV7pzkd62P14H3335Aj8gLHnNxfp2LQxVbWQ7Lk4c4ZYqgehatwc4g7wMP06XuAiCbDl9rH/iGiE1IcfJ7JnmMK/+WPSn3iK6hfXFh5tBCUSJX3sAdLHHkTPdqDoengPbcIAAGQQip17Hr5tYU1do3ziJay56Ts2qloqzcDP/QpqfLVKQuPSWUovfx/f3EIoSlFIjByg+8OfWjNAiz/8LrUztxY0F7qO0dGN0dNPpKePSE8fekc3WjK1JoTY+YGPkXvs6U1fmt+oM/WH//auyeVvhc7hOOmeCIoiuPRSkTPPLRJ4a63lzKU6Z7+/iFm/fdjT9yS+J3GtYN3c6WYRTWosXm3y5f/jMnOj9VUlBaVpk2hKo3tXnExPlL0P5Rh9rYh90wDP9kfYeTyDqiuc+36esdeKNErLhsmseZz+7gJHnummb1+S7t1xogmNxjaGUTdCU9bIBzPsVA+uv4OABJnQO5UT79p1eJZHajiDkTRI78py6BeOoEXVsEBJCUUH3isY2U5yxx7Dys/SnLgcaj3LADdfQHoeyYcfxC0U0Pt6sK8ue+uV6+cwi9OgqLjNyhLRiVWeRySiGL0DSC8kFHHrVfx6FaXt9SqRKNJ18Rp1tHQ6JC6xbYSmIRQFt/LjLVUYyID5YILx4FybivIuQ5cy5NxtVj1mRpuomrjRjYfvbSx5aNuwmPeREr7+3Ra+324m8QIm38hTmW5SmW4i/WBTbTFwB8Y0kuige8cDSOkjpaRZWb/S1ZYmAQFq2zvdLmi9nbiTsyjxaJus3GCJTPE2MHoH6P34TxMdGEao2sY9T0INe2B1AyUaQ09nSOw5SOn1H1J+/cU7MhRes0Hl5Kv0febnV7HsZB96P9bsFPWLZ+7YQOupDF3PfAyju3fpHqSUNMcu0hi9sOFx8T0H6Hj0KaIDQwhNB6G01UfChcR6v4eWSMIdVPe6mn7XtHG3g+8GoeSUlCQ79HUNabiffFfyh7eClJITX5olP9FcU5sX+JL50Tr5iRaZnig9exJouoJ9UxtALKmT7gl7OhevNbFba8ePWfMoTpn070+R7o4QSag03oP58wbNW68cJirWymgJBDoRepUdLPpTd9TicCcY/cJFjv7qfcQ6Yrz1OydI9KfwHZ9n/u+P4tYdRr+8PS0ym4FTKVJ4/XtEuvvJHX8cxTAovPE8vtlEiUaxrk3gzswS3bd3lRyc9F2smyUkpcRplFFbWRJ7DqDG4jTHLxPftZfyiRdJHTiK0d0b7ldcxJqfgSAgeeAwQtOxF2aJDe0i//y3kc721FJsF260H1q0GA3ephDMrupL3rbvCcBzNmec9+3R6etVOXUm5Ob9m38twz/7t1UcF+yGi5HQOPqZnQCM/mCWyuQ2hnnN2iIzo8/je/a6IV4Iq3k7tUHSWidW0KTgTmPL7SkG8IsV4vcdQu/rIv7ocZRE9PaGVAgSew7S/zO/iBJZywt54yHTDqnAsmEJlUpUlFicrqc/RqSrl/lvfAHpbvJFDQIal89RfXsnmfsfWz6vptH94U9hzU3jlgq3OcmKW9ENOt7/DJG+wVWG1K2UyH/vG7ckzjByXUT6B1Fiiba9e+9W79uJwqRJo+zQORRj76Md/ORvHuB7/+4araq7JmT6XsO1A66dquBa608SZsNb8pRjSQ2xjhMsFJZyPq4drNspFgQSzw2W9n8PKbGpyxIluUg/u9ZfkLa905AV6XatYVt7XuXRIi/9re+zMhmuxXU6D3VhVSwqV24tWrCtkKAYUSIdvajxBE65sNQa48zMknzsEYzBQaxLlzdd0Sz9APP6eCgQoYiwGlpRELqOb7bwm3XswmIYXTMiaOkOpOvQHB9F0SOosTjej4ExlYReoUTiYDEVjDEdjOLdYcUuhO/4rarZN31NUhL4kEoKjhzS2b9Hp7tTxbICHn4gwo2XKt4ZYfiBbhYvV4h3RFE2Ge3YtDGVgYfvWiiKhmLE8Vxz3RfEkSYFd4qGXyXYwg+3HtTOLFo2hXVxHL/WQKgKjRdvHdIMNSQPMfCzv7TEBQttYmrPDflZmw28epXANBGGgZZMo6UzKHqoQyiEsjRppI89gPQ9Fr71xU2L8QaWSfn1F4n0DhAd3Iloe4F6Jkf3Rz7N/Jf+iGAzL74QJA8cJvvAY6tmz8C2KD7/bZzSrUv4ZeC3Q0Fr80kCgdDUMOS98tpddxUF4O0QOPZdt0DcDo7p89IfTJH7X6KkuyM88eeHue8Tfbz19Vne+fYC+YkWtulv6LG+m6gu2Ni3CAdJnyWDr2hiXStot3waJYd0V4TOoRh6VAm5RlcgklDJ9UfDiETJfVcLj9ZcHxblYIFOtY8Ia3PsAkFUxOlSBij68xu2OsibRCnuBGpUIzuSI9YdXyLxtOs282+uHyl7N2Hkusgcuo/G1YtUzr2xNF7UVAoZ+DReazNs3cG4kIHf5pr2IFCw5mfIPvg+jGwHdnEx5L/2fYQSjtnAtsKImQzCtpwt9OpvF0IDKgkI8PFoyhoLcpL54Ppd6ZPueyjD+3+m966vrzhj8dV/NontSOr1AEWBTFpg6Ar/4LfKOO3WMt8NKE3UMasOPQeyaNH1pQhvxh1U8xrk+g+S7T2AqhpcP/ct7NbqVaAkQCLp0PrJaX3MuxNYwe3d41tCCLSODJH9uzB2DuDOhLJfsY++n/zoxIaHRQeG6f3Uz64yINL3cEpFGpfOUj//DnZ+AVYajLahSx46SvroAxjdvat6L9P3Pow1P0vl5CubDtE6pQKlV56n5yd+Cj2T4YZXmDpwBPPBxym//sPbnsvo7qPnoz/JSncmcF2qp07QHL98W3Yf8/o4BWd9Y6pEIqQOHCG+e9+q7fUL79CaGN/UPQJI19n0IuNucOpb8/hewAf+4k66huIksjof+Au7ePTPDDH+ZpmTX5vj+pkqtUX7PfVW7aZ310a8Mm8xda5G354kRz7Yw+VXi0ydreFYPkIRxFIa+x/rZOieNHbLZ/pCjWb53Sv2WQ8luUhNluhiYAPxcIW06CQjuijJ+XXOECLYojE9+LP3MPi+YVr5FrI9bhrTdRbe3vi73i045Tz5V59ds13v60XEonjzofpJ4Dj4lc0REthzaz365vjlNUbSnl1bsVw/f2rNtu3GEie5DNqzfWg6Q/PpYckGFVmgJBdoyMq2hHM7ByPc+6GOtdcS0oATS2mAJPAlniuRQVvcPaJwo825XnS5fi60RY4DL71uceqsQ7UWcPO0ZdccZs+WSHREqM40MSubWwjcQZ+pwKoXKAcBkXiWwF87iCUSK2hS8RaBAC/YhnCDlNhj1/GbLfxKDfvKJNL1SKeToIh1KQjVRIquD34CLbFcWCM9j9bkVYovfQ9zYpx1w0ztsGn5tR/Smhin6wMfJT6yf5VB7XrqI1jTE1izm+wFCwJaE1eonnqd3KNPoa6omu188sM4i/M0r1zc8HAtlab3J35qFTuR9P3wnO+8sYaBaj04xXxYmbwO1EQSo6t3jTG1pieovfPGbc+9nVA2twDkzLOLjL1e4vhHejn0ZBc9u+Nk+6Mcfrqb/Y93MPpqiVc/N83oa+8OkcF68D25nDbYImqLNmefW2T4SJq+PUl+5u8e4uxzCxSmTXRDZeBAkmMf6cV3Jed+kGf0tVJYZPEewqJJUc6TEZ0YRNfdJyHSdIhearKwYVhPbtGD6j7Wy4n/8xWqE5UtHf9eQPo+ei63NPf49camjen6J3x3vE0pJSbNTfPh3ogoBAT40sXBRkmn8AxJMX8ZP6ETxHRaG7QmRTJd6PEMzcVQlhFCUo/QKN4Ugcn24NTLSN9l5nKT5353LSVrEMDI8RT7H8owfblJftKkVnBx7ADdUMj1GXTviDGwN86Jb+Q58fVl0XGBQFEgYgjuParjunD6XGg0IymDQx8dRigCKSX6dnumUvp4no1sFHDtBv46eVMFlYSaQRcRDBHBlQ5ecBcv0Qr45Rrshsi+MCnsLRQ25PJNH3+QaP9wmG8gHLh2fp7iD7+LObm5Hjh7bprSq8+jpbNEegeWQrRKNEb2kSdY+NrnNk3OH1gmtbNvY3T1kjx4ZMk4K0aErg99ArdWxllcu7IWhkHH+z5IbOfIqjypU8xTOfkKTn5hzTHbiUg2SjQbwSyZuE0XoQoCZ52BLSDZn6Qxe3dRiEhc23Q616x5vP6FGU59a56d92bY82COkQeyDB5Kc/jpbnr3JPjC/3aR0dfXU5P48YSUMHaixA/+/QQf/qsj9OyK89Rf2Imihu0fVsOjONli/GSZN78yR37iPSAnWAeFYJZeMbyhEoiCQqfoIy9mqMq1dQE3puStoHKtTKwrRn22TuD8eKqneMUi7sIiQfPHmxIwwCcfTHMlOLuJveW6z61n5wdI9Oyk9v3X6R55gnjPDia+9/vrnsFIddJz/ANM/vBzuI0KCIVothfPMcN/L0EQSXfhmXV832XyQpPJC2t/y5F7UzzyqW5OfifPs/9xhvlr5mqbLGBwX5xP/bUdjBxP8fKfLM+xgwMqI7t0FAH3HTPo6Vb5jf+1hOuFGRin5VKdbuL7Equ2zZ4pQiWW7ApZPVqVdVeWEokXOBhqFE+6eHL7QlDStDHfuURk/y4AWm+s/wJomQ6SB46gRFbkSV2X2jtvbtqQ3oA5dZ3W+GWMXBci0lbOEIL4rr0Y3X3Y85snsHdLBSpvvoLe0UW0f3ApHxvp7qXzyQ+z+K0v47dWG6PMsQdJH39wVX7NbzWonjpB69qVdz1H2XtvL618E6fukNybJJqJUpmoEMlE8FoebtMlNZzCLJj0HOvBbboomoJZXC6Gkm01HOC2ifxsX/SOC2rsls/oqyWunizTM5LgwU/18+BnBujaEefpX93FlTfKP/LipDtB4Ek8L+ybXZxo8dbX53BNPxzUDY/StMncWAOz9qNjFzNpUJCzpEQWjbXsUQBJkaFD9NCQlXVyp3LL4T8hBMd+9X7KV8v4dnje5nyTy5+/e8WY7YJf/dNDoRo+ibt9lwRCM4hkewlcm3j3ML5t4jSrpAb30Zy/hu+Y1GdGye29LzxCUYl1DZLbez+e1aQxPUqrMI0MfJL9I0QyXTQXb03w/6FfHiCZ1fnOv5tmYWKdNkwJM6MtvvmvpviNzx7jsZ/s4Uv/NDyn78GeXRp7R3T+5X+o8Zd/KYWqClwvDGSrukKiO0rgSYqR7fZMfRfXqqNH02hGAiFK6yz4Q93QhJJBAjVR3D6vQNeI3Xco7K9UBIn33U/j+RNrdovv2oOR61xqR5FS4tVr1M6+vWbf2yIIw6mpw/eitI2pEAIlEiW+c88dGVMAc/o6lRMv0f3hT6Il2wotQiGx9yDZhx6n+NL3lvKn8V17yT70/lVVyIHr0rh8ntqZk+9qP+cN1CarJHoTSC+sdtZiWvhvX5Lal0KP6eTP53FNl0gmwsCjA0y/vDrn45j+ks1PdN66oX7X/ZmwZWcL74znSGYvNXihOMmOoxkSOZ3d92XD8/0pMqb9+5O87+eHyfZF+dL/folT315410kZtoK54Dp9yi6S6BuIh6v0iB3kmaHB6uiUhC0b09nXp6mMl1YtMO3K9vSzC0WQvXeYvo8ewWvZSF9SPTdD+c1r+ObGjoHQVLrev5f66DzWbPteBXQ8uIvMsWHsfI3Zr51ec1y0P0PPBw8x+Ydt3WBFkDk8CAKqZ7YulPFew2mUiWa6UI0IntUkmuvFaVTwrCbJgRHM0iy+s7rbINSddQhcC7dRwTXrS2kS16zT1bOT6vUL+NbG3v2BhzPYLZ/FyVs//4XrJhLYdWyZcGR2wePEWzZvn7GZmfV47gUTu91W4zsBxWt16vOtNj/vNnumUgZYzSKea+J7zro5U4GCRFLy5oko28uoo/d0Ih0X6/I1cD3SH3sCVAVWSjsJQWx412qiBClpXR/HN7cWcrEW5vBti5VmQNF0okM7Ya0tvzUCn/rFM0R6+sk+/P6QOEIIFCNK+ugD2AuzNC6dQ0tnyT32FEZn94rwboC9MBsSPmwiT7odiGQixHvjKLpC9XoVNaKiRlSMpIEW1Qj8gM6DnVSuVgj8ALNgkhpKUbq83PhYnjGXCnP69yVJdhrr6oT27U2Exk/cncPdqrohIxI3ChT+9BhSCLmM+w8kaVZcJs/VfiwNKYBNi/ngOiPKEVSx/so9KTJ0KL20blKPCv2hrYVoF07NrTLeiqYQ71nb97olCIHRkQABc984Q6Q7RedjI1izFRpXFjc8TPo+1XMzeI0Vk7qExngePRsnc2xo3eP0VJTMkRWMW4GkeX3z7XI/Lmjlp0j07g4N5srxJm7UW68DGeC16jiNClZlAae+PGfY1QK+c/sUhqoJ9IhCLKnSqm38PiWyGrqhoGnL1+J5cPaCg++Hl/zK69bSpWuGghZRWbx8ZynKzRcgKRqp7hES6T5816YwcxrPXj2pSySKEOTUfgSChJKh7C9S8ea3XAp/A36jRbyvm6DRQgYSJRFfbUgBLZ1Fz+ZCVqOli5JY01vXA/QbNaTrtntR2w9DUdCzHQhVvSNRcwirXosvf4/o4DCxnXuW22VynWQfeBy3VCR1+F7iO/esyPlKAssi/9zXcMvFLd/LnaJwoUBprETghmLYrcUWgRegaErYQyYliqbgOz71mTqBG6wZO/Wiw9xYg2RXB/GMzsf/xh6+/H9cXtWP2b0zzmd+4wDp7jAHt9G7cs/TXWR7Ilx+tURxam1fraIK7vtYLz0j4eR67VT5T5stRSgCRRGkuyMc/WAPZnWGesH5sbyP2WCcIWUvUeIbeKcKA8oeFoIpbFaE/mHrFHIBq94PLa6z/2cO8tbvbE+xnJQSp2rSnCggdBXZLiwzOhPs+x8+xIW//3WklOTu20HqYD8Lz52n7yOHyd67g6v//kXql5fzck6lhZ2vrzp/YncXQz/7IHoqSmuyuDSnqHGD3g8dovOxPSw+f5mFZ8OwtdGVZOTXnsQtt4gP57CLLSb+8ysIRdD30cMk9/YQ39FB48oio//P9/Bb7z39oFVZYOCRh6lOnCWS6QmnSlVDiyZuqUQlpUSgIDZYjN0OU5eajNyb4oO/NMA3/uXUumNEKPCpv7aDIJDMXV1+B0d2aRzYa/DqGxblSsDNkrPd+zP0HMjiNF1GvzdDeTtJGxRVQ/oenmuiR5Ihif1NkASUvUUqXn7Ftnb98l0iqNZpvnGG2LEDgKT8+W+v2UdLZ1BjiZuKIiROqcDqWV5u8O+bt4ebpOus+kQIgVA1FCO6JY83sEzmv/55dv7Fv44SD69XKAqxXXvo+8k/GxJmG5EVNIeSwvPfxpycuOPvuhv4to9vLy8WvHYNeeAGq/a5edtKSAkv/N51Rh7IokUUHvzMADuPZRk7UcIxfbp2xhm5P0uyw+Ctb8xx/yf6N8ybdg3H+eBf3sVnfuMAxSmTmUt1KvMWrhOQyOgMH0nTvz+JEVNx7YDn/s21DfOlmqEQS2vE0zrRtEYsoZEbWFFpPRTj8NPdWA0Ps+5i1UPShXc7Vzk/1mD+SoPd92f56H87wod+ffeq4eN7kkbJYfJMlRNfmuHa25X3rGL5ZjjYzATj7FGObuiAJMnQKfqYkxMrjOCdeaaRbFg1bFcssntz6LHlCTqSiRDv2z4dXlXX6PvQPXQ8sDPMuX3tHczpMnomhpENvVYBKBENLRnBzteZ+copjO4UQr+1URCaQv8njlF64xqlE1fZ8eceWfrMbznMP3sBoaqoK+5PqILOh0c49/e+QvNagf6PH6X7yX24dQvf9rj0T77D7l95P5UzU/jWe9smBYTzo+8jA4/W4hR6LI1n1uk8+DBuq4ZqxECCGknQe+/TxLt30HvvB6lcO0Nj9gqB79J99EkimS4qV08jVJXe+z5Eonc3vccFlWtnqE+PrvvV3/u9Wf67hw/xkb84xM7DSd78VoG5qyaO6RNNqgwfSPC+n+ll19EUZt3j9a8uRxcaTUk8LogYYuU0C0CrZHPqj8dR9LCvxixvc5jXdy0cs0o8M0CruoDnro1TK6gklAxJNUdK62TWHqURVDb7FRtfZH83+D7eQpH6s68AED00glW7unq/RGotYbuiMvzL/+1dX8PNEGqoDsEWw8duqcD8N/6EgT/zS6Cq7XNqRPrCsM/K6t36+XeovPnKmnNkMjsZHH6MVGoAoShYZpWZ6dep16Y5dPhn8TwL0ywxO32CVuv22ozvFi6/XOTr/9cYn/if9qEZgr69Cfr2JUCGjD6+J3njSzN89bdG2f9oB6nOyLrn8ewA35MIVdAzkqB3T2J5Eg/7xQl8SXnW4qu/Ncr1dzYO0zzxi8M885d2E8+sPwT2PdrBvkdX97blr7f4x5989V3rixcCClMml18ptiXcdG4mflF1QedwjK4dMY5+qIdv//NxXvv8NM461IPvBaaCMXYoBzBY/5kJIRhWD7DoTS8R4Esk/h14pl1HuhGKYPrFSR76nx9Di+tLGpOKpuC1ts+I+K7HwvcuMP6vXyDal2bnLz1Oa6KAtbBBUZEkvJYNOgtWQs+Ec5M5U8E3XUonJ0juWyYjkH6A9NdGd5xyk+rZGYQqMGcrJPd04zXspfV/4PkE7l0+f0Vt1yvIO4q2LZ55AYCr3/4PAEttMfXpy8s7qRr4HrMnvsHsiW+sOr40+ial0TeXN3iwcPYFFs48v6Yg82ac/WGJr/7OdT7268McfaqDY0+v7UUN/LBI8Su/c52xk8vPMAjgfY9E+aWfT9JqBQQS/txfyiMJ36m+wzlG3tdH8Xqdy9+dxrNv/5vcgTi4wGzkMa/k0fQoMlh/ha4pBqrQaPnVLedFboYx1Itfb+ItLsfV44/ei3VlchWloBKNouirwwob8vDeLYSy5rvuFI1LZym/8RK5h59AqOq6dIf2wiyL3/7SusdXq9epVq/TP/AAmhZjavIVQBKNddBq5rl86ct3dX3biZf/3ynG3yrz8E8OMHw0TTyj41kBC+NN3nl2gdFXi7hWwNWTZYaPZlYRvN/Aa5+fZvZynf2PdzJwIEluMEE0ZSCUsHy9NN1i/M0yZ7+3SGXhJmFwVV1FbmE1PCrzFlZj80OgurC6bzrwoVl2KU6b1BbtW/Z8+r6kUXSW9pU3ecyKCjuOZviJ/34vO49nqC5YXD1ZobJgLXnXQgiMqErHUIz+/UkSOZ0P/dpurp2qMHmm+iNpAfJwmA7GNhQPB0iLHF1igHl5I91yZ57pzMvLPd3lK2XO/qdT2OVwMR/tiHHvX3lwy9e/Hm78jHa+gfR8tFQU5mthX3t7jOrp9Xtsb3negJALu71CEurmhBXWeJxCUB9dYOhnHuDA//wRrIU6tXMzmzLo60GNJUgdupdITx9erUL1zJt4jdpS47dQREjI0o7I3RAEAUIiGCmRvodQVbR0FoIAt16FIECoKrn7H6P8zuthugyWziMDP7RqioJQ1KV/J0YOkD5wlOkv/O4trzvw4dv/foarZ+o89Qv97DiUCMUqRNgf6poBY2/X+MEfzjJ5frXTs5j3+R//dhFdD0kcViKWNYhlDb7/W++w56kB4rkIzcLti9w2NZMIRSMSzy3l8NKduynNnse1V+cDAnysoImCgi89XLk98fvAtFHTSdSODNJxEdFI+CLetIJSdGONmsq7i7s31MUXnyXSO0BiZP+az/xWg8VvfXFLCjOKqpFI9BIELrZdI9hg8fNeYu5yg6/+4/VDNjfwB//LuQ0/kxIm3qky0fY49b5etM4O/HoDZyakkxPtgaRls/imhbQsUFWM/l7cxUK4aNE0XvvCHK99cS7Mu4t27O4OJ6NGyeEbvz3GN3577Lb71hZtvvgPNyZh7xiM8/H/YS+7789y+tlFvvsvxslfb61rIFVN8MCn+/nYX99LpifC7vuyzF6sr6EefK8wFYwxoOwhKjYuOtypHiTvzeDjtat5t/Y+XvnqZdzG8rzi2x7509vHfiSEwMjGSe7tIdIVho/tQgOn2iJwPDJHBvGaNqkD/fiWixo3iA1k0VJRon1p7EIde6EOUhIfyhHtS6MlI8QGs7h1C69mktrXS+D6pO8ZWDLOQlOJD+YwOsN8f7Q/g13Y2DPTkhGcUpP8S6O45RZKRIf61khyhKoSOBaVt18lMXKQSHcfXqtBcu+hkLRfN2heG0ONJ8O2PsCcnURLpNBznUjPozkxhpbuIHP0Afxmnca1UdxSHqOrD69ZXxpbQlGJDgyjxhO4lRJ2fh6jowejowvpuTQnxqidf5vU3kObuvbAl1x8tcrFV6tEkyqZbgP9hgTbnL0h8b2iwO6dGsePGHz3+yYD/Rpj46Gx970A6Ut69mfRYyq+t7lxtSnLo2oG8UwfMvARioKqrd9bpqASV1Jk1O6Q4Ni1cOXdsyA5EzPEHzhM/P57QsOaTWJdGF8z+QlFWUW5B6F35zcbbPey3W81tkXrVLou5uS1dY2pU8zjVu6cuNv3bEyzTHfvUTQtSn7hLNXq1ouwNgeBgnhX1CA2QmR4CBExCFomaiKO1tGBiBj45QqJ++/FHL2CffUaQtdRs1m8UpnIjmHUXJbWmXOo6TR+pYqWzeDVagTNHw0JgqKGVbwjD+So5W3OfHfhloQMvieZv9KkPGuS6YmQzOnrEue/Vwhzp1cYUY9s6J2myNEthphv506DLcbKnZqNXDHu3abL5AsTpIZSWBV7laG9Y0iJXWwgXZ/ejx6GQFJ4bZzW9SLS8Zn8oxN0PrYHr25ReWcSoatEOpPkHtiJV7dI7OhEKILF5y8jvYCOR0bQMzHciknuwV1UTk0y/+x5up86QPcT+8MK4fa9qHGd3IM7UaNhtCt3/04Kr1whsDzKb10HJDIIvWU1ZqBnYmjJCLn7diL0UAVq/N/8ELnFcK8aiRLp7gcZhN0CUtL52DMUXnq2XRciUSIRtFiyXRypERveTePKhXCVK2XbY/VwG7Ul4Q2/WSf5yFM0xi8hfQ8910nm8P1Uz7215N1q8QRKJEr2wScwZyYJNismchOsho/V2FjwYyW6OxU++kyMJx+L8tKrFn/lV1L85t8PSRvMss3M6RJ9h7OUJxpUZzaXytuUMfUck8r8ZaKJDox4FrOeJwjWpxN0pI0nHUBsmwRb0GjRfPUUWm8nSjyKPXYdb3FtVesNrsbVBweUXvk+vmUhFIGaTiMMHa9SRd5cwrUZiJDP1qtW8B0TEY0gra0vGGK79pK57+H1PxvcQeb+R9v9p5v/LV23xcTV7wOwY+cTRGMd1GpTW6Zw2ww0NDQRwZJ3ycV8h5Cui3Qd1HQKrasToWmhoLIQ+LV2jkQGaLkcjj6D9H0Cyw4jHLqOMTxEZNcwtRdffU+veyWEIkh3GyiqwGp4WI3be22xlEY0GQ7fRtn9UfKbA5K5YIJ+Zde64uE3sFM5SKEtHr7VFNDezxygMVPDdwIW3prFszxGPrGPWEeMxlyD6ZcnsYqbm1DX3EUgqZ6epnp6/R7P8skJym9dJ92zB0U18JwmrUKJ1ufW18Cb/pOT626f+uM3EIqKouoUXg6jGl7NYvoLy+IdkUQOTUtj1fNc+w8vtS9QUr80h52v0fPMIYqvj1M+eR29I8Hhv/cphKps2ZgKTUdL6lhzU9jFRZCSwGrSvBpGU4Suo6cy7d5QBzWZxKtXMWcnl3refbOJV6/iVkpL+U6vUUN6y/Oslspi5ecxZ8LFvZpIosbiBGYrJPffQlrOiCoMHojTPRwjnlaRAZz6XpFaIfzeeDrk7l3ZPhOJCKq1gHwxYM9uHV0LtXCT3RF8N8BuOFz6zp31+m4yJhq2hRjxLLFUD4qq06jM4N9UhCQJsII6ZcKS5+0K8wJI18OdvjV9nvS9tUonUtIcvYhTyqOkUhj9vXjFEtLzULNZArOFEo2CphFUayAESiJO0GyhRCNIzyNome1wYh0pIbpvD+bMBEosipZOhp5RNhN6Np6HkkmD5+FM3ZrUwejspvuDH0fP5Nb9XKgauYffj1su3Fb4eyWisSzd3YcBUNUoZuvathrShJLFkSautOlQ+6n4C3Rq/djSwvabxJU0KSVHM6jSCKpbb4PYBMKwrY6UAX6jgfQ8pBcKvGsdObxiETWRQM2k0bu7kK6HEo0gohGcmVnSTzxOYFpI+84a/xVN0Hsgg2YoTJ3anKBoPGfg2j7uTcVCMghzr0EgSXVF6N+XZOKd6rqKMEKBnpEE93+ij47BGGbNZfp8bdOhqHcLNi1mg6vsVY+v+7kQgiQZesUOZuQ4N2jSN/JkN0LP8V70uIbTcMnszjL2pYsMPj7Mxc+eo/toD50Huph5dZO82VtAPDtAsmOIRmlmiWgfoRCJZxCqjt0oIQMPPZYO+V81A8estvnMPRyzCkKQ7t6DFonRqsxjVsMwtWbE0WNpXLOGkcgRSXSgqDpOq4JrLafU/JaDW2mRvW8nid3daAmDwstjSG/rzovXrGMvzGLn55a2yRWRN6FqGJ3dqNF4uH+tQrRvmPSh48jAp37xNDIIx11y5ADSc3FrZWL9w+iZDpJ7DtEYv4RbLpLcc4D0kftxq2V8s0Wkuz80uoGPGo2S2LkHLZ0lvmsf5vTEKmN8Mzr6DZ7+xQH2PZimcyBCNKHh2gHXzzeWjOlH/uIgqQ6Nb/3baYozNsmEQFUFlWrAYt7n0H6dN0/ZuB70j6RJdEWRgWTubDium0ULdxPqTHfMgBRP9+KaNQJ/raFMKFm69SFc6RAQYAct/G2kFLwdAtte+8OLcPVDKY8SMRCxGGo2g97fB36ADHyUeIzW6XPE9u9FGAaB7SB9j6DWwF1cRMRjoefT14N57iJKLIq0bEQsFhY9JeJIx8UY6AuT65p225ChMCJ0f/jTRPqWG7qllAS2hVAUFCOsjlTjCbo+8BPYhUXsDcj1S8Wxdq9Wm0HENalWwpWf51lYVmVrP+gGUFHJKt20ZJ2kkqHsz+NJj6hIUGERX4aeVVbtwZImrtwehpqbYY5eQYlG2p6mww2JCBkEBGa7gVyC32rRfPsdgmYT6br4zWa4f7v4wTx34Y6zAIqm0LEjiRFXN21Mdz7cRWWqxdyFyqrtgS+ZH28yfa7G8NE07//FHXTvTnD9TJV6wUYGoEUU0l0R+vYm2HE0Q++eBKouOPHFOebGGtvjmSqw9fbPgHwwS7+ym4RIr7uPQDCk7mPRm1pSG1HvpAYSsCoWV791Batk8ujffoIxJeQtnntjhnh3Aj21fgpquyCAaKqH4tQZ7EYZhCDTt49IogPPaeGaNfzAY8fxj1GZG8V3LALfIZbpI5LIUc9fw6oXSHSEusSu1cCsho5K9677Met5bryMyY4hAtema9d9TJ3+ztKc65supTcnaE2WwqIoKTFnKsgtLqh8s0VrYmyNHGThpeeW/g4cm+b4ZZRYKH3nVIo4pQLCMNrzaBCKekxeQUtl8c0W0vdDveWXn8VvNZcMbPXsSRAKvtnEN1vULp1BKAJrcRa/1cTOz5N//pu41cotZSCjCZWf/9sjHH5/jiCQzF81SXXIMO2xYo1mxBQe+kQ3E2cbvPLFBfbt0Xn84QgjO3UcV7Jnt0Y0pvCHn29QmqiT25kiO5RYapWZfruAa94+2nFHDEit2gK2WQ3j6jfFtRVUIiKOFbRQhIIVNNrh3vcOfqtBsMbDEBg9fZhT15COi6JraMODEATIQOBVqhixKH61GoZsbxhS0yJwbIJGk+iOYUQkghKNEZgmiqajJpOoHTm0jixBs4VTmkV0dSL9ADWZwJmZW/cab6DrqY8Q37M6T+oUFqm8+TLxkf0k9x9eKvjSsh30/sRPMfPH/3Fd9iPbXl2273sWtdq7tzpvBGU69D5SooN5b6Id3reIiBiGiJFVuwlzqCoK714yz69W8TfofvGs5fdAWjbu7PLzCFrhwND7+7DHr+GVbp+XPvSRAXY90oOiQnGiwck/voaiKex+tIe+Q1l8N+DEH1yhOmty7DM72PFAJ74bMPbiPNdPFNj1aDcP/NxunIZHbb7FD//VZczq8vgoTrV49l9f5WN/Yy8DB1I89Jl+jn24JxQCl2EoWNMFekxFjyg0Si6vfHaKVz83jVm9uwWrntDZ8f5BOvZkKVwsEstFcVou489d596/cBin5lC6WsWuORhJncDxUSMqtek6u54a5vwXRkGGnL3zwXX2qEfX/yIBcZmkV9lBS9YJZLCm9ed2cFsu8b4kakQlvTPNgT9zD1q03dYh3sXq/TZa1XkWr75B14578T2H4tQZ9EiSVmUOs7qA74XzohHLUJ27HHpbRhQtkiCRG8KqF2mWptsOiUujOIkQCrF0D45Vozo/SuB7JCMJzHqeeuE6yc6d6PEMdn25vc2ttHAr25Pjl74XVu/eBGt+RZgzCHCrJaguLxwda62B8Rp1vMayF+3WKri1yqp97MXVc6NTWF1A5pTyt9VoBnj8p3o48mSOibMNvvI71ynN2nz0V4d47Cd7Vu134ZUyT/+5fkbuTfHSnywwesUlEhGUygFvn3Go1wP++l/JoKlQXzQZ+8EMqd4Ylam2ZFtrc8Vymzamqh4jlurGblVI5IZolqdx7eX8mCTAwyEpcgjCFhlT1Je8lPcCXq2K37rpBROC6OAOqm+9hl+v0zx9NuTtlQEIBen7OFcnwA9ovHIC2sEngqDduBhgXri0PEg9n9qLLyNdF69WRQgl5JT0fbxKldTjj2BPTBHdu3vVBL4SqSP3kb73YYSqLcs0WSb1C+9QffsETmERo6uHSNdyD1q0f4iuD32Sha9//kdOkRcQ4EqblMhhBWFYt0/bhSGibaOaQBeRdsXmjyF1TxvuQruJ+6ZCMhE1yH70YYyhbop/8gLeYpmjnxzm5B9fZfZchaBdNKJHFapzLV79T6M8/It76d6TJp6NsPeJXr79j94hktR5/Ff2Ubza4NrreQaP5Fi4XOXq64s4N+VFfVdy6eUii9eaHH66m4NPdNG3N0Eyp6OoCo7p0yw7XD9T5erbFS69VCA/0QqpE+/yJ87uTCMEnP3sRQ5+Zi/RTARFU5h4YYpEdxwjroMQFEdLGAmd6XMFjv7CQXY9NcT5Pxld+n4fj6Kcp1+unzsVCFQ0+sUursmLW8qbjn3pEkd++TjRXJRT/+ok8Z4EhbOLfOC3Poxnuox99fLtT3IXkIFPo3gdp1Whc8dxjFgahCDwXXx32bj4novntFD1KOmevdiNIjUkMvDClITvhot2zwnnIxGGVVemzjy7he+Fnq3yo6ww+zHFI5/uwbUlX/rt61w9VUNKsJpr7U1h2kZRBbneMNrXbEkmrrs880QorNEyJbuGVDwfkOC2PHI7ktzziR0gBGe+dI3C2O2pBe9Igk0z4iiKRjTRSauy2lBIJDW/QM0vrtr6XsKtFMPYu5TLxk8I4jtGwrya54LrrbmqG1VlS31QN8NbfYy02x5F4CNXTgieR+P1N1BzOeqvrE/ca3T10PnEh0OWoxvEDEGANXOd8omXkL5H69oY9TNvoT3+9BLRvVRVUgeOYE1fp/r263f4y2w/Zrzxds+4pBXUuOKEwsQSSdGfW/p7s+/AwN/5Jdx8mfx//OYamkiA7McfJX58D4v/4Zt4+cr23MQtqrFFREdJRJd6Ab/32+d56OdHeOjP7uHEH40z/U4Ju+lRnmpiVlysqoMWUekaSVGcaGBWXXxXUi9YZAfjlKebeI6PY/rY9fUXmIEvKUyavPgHk7z0R1Pr1mKERZNyWwuOtIiK9CVWOZx0hAKTL8+w58O7AInbcqlN1+k92k35aoXADahN10n0xmkVV0eCWrJGIZhlWNm/vpcoIEaKbmVwS5XfpUsFXvr//AAhBIEfhCLQcZ2uI93YZYvy2OZC7ltFbuAQ2cF7wkW4VadZnsWIZejd8ygSydzFF7CbpaUaBRn4CAFdux5ACEGhFY4TszLP0LGPksgNMH3uOczqAh1HjpLs2kFl9nI7pBuOnbvVyf0vFX0jMcy6t2RIN0Kt5CIUiKWXzd38YsDv/3GDJx6Lkkkp/A9/u7R0jmjGwEjqvPjPzhF4waZVpzZtTAPPxawvkurchVlbwNuQiHiLD14RLNmlLbKdS8/DnpsmsecAaizePpVATaZIHjjy3ijROy7ewuK6nymRKJ1PfRSjs3t5fynxqhUKz3+XYEU/aen1F4kO7SSx9yAQyrUpsTi5R96PPT+zeXHy216wXN+oKLd7NVYz6K7811YKjvxyDb07u2E1n5qKE1juHXMhbxdaRZvn/8UFEh0Rfvq3HuL3fuWlkHXppvaswrU6+5/pJ5LUiKZ00j0xqrPtflEhMOIqRlzDMb0Nh4oM1p733YRne6BAJG2EhlpCYbTE4KN9gMCzfZr5FsOPD1C+WkWLacS749hVm+yuNIWLywbMxaEkF+hhmCjxNd8lEBhE6BM7t9SlrWgKgRcsvW9SSryWy8Jbc0hfvuu/W3n2IpW50bYnGb6L5ZnzVGYvto1e+P1jL/8eAIHvkr/2NoWJU6uKAM3aAmOv/OHSv51WhWtvfLHdJ716/Mycf47/UqAIrd3lcffPScr2ovIGE+wGSLQrfFdWyd/wSE+fdzB0QV+vyvxi+Dz9dmql71AWx/SoTDfXRJLWwx2EeaMYsSz14gTJ3BCqESXYRi5Ivb8bd3YRggB9oCf8W1WXw603iOalBE0N/7+OB9O8Nkr62AMo0djSyljRDTL3PUzz2ijBe6S4cjOEqpF54DESI/sRbfpAKSWBY1M68UOsmdV9oNJ1yH/vGxhdPei5LgTthvLOXnKPPcXid7+Gv06e404hfZ/gZgoQQEtu3OKwITQNoShhMYLnhao+Um6KDMEtVInsGwof8TqfK/EoftNcrlhUBGoqjhI1wjCb4xI0TKSz+qVXs2HjvV9voaYTYXO7lPj1FkHLXj5XJokS0cMJMZCrvSoBT/yVg8QyBiA5+cdXw57Eprc0eZs1F6fpsTha48qL8/zE3zqO7wVceXGe0mT4zs2cLnH4Y0PsfqSbH/zOBazaLcbPjVTEe4DK9TqZ4TTH//w9FC6WiHW5yEBy9blJDv3UXuyaQ6tgkj9fDKkcj3SycGaR2kyDY3/uEIVLqwXYa7JEWS7Sx851vVMhBNodFh7dwO6P7SV/egHPdLEqFkjoPtZLx8FOSpeK5M8tvuui4VL6a17SW1fLy/W9yzXHbLDfjxliWho3sPCCO62JEezI3sdc/SK2d/ctdPPjJn0jMXYeTjJxdv3zCQGH35fD9yQzY8vOSm+3yq/9cgo/gEYzQALvnA3vJ/ADWiWb3M4UQhXYdXd7jWnguwggluxG1SLbnreLHhwJ21CaJpEDu/CrdfTBHggkXrECgQxfWM9HH+ghaFm4M2tbZez5WVoT4+gd3Yg23Z9QFKKDO+h45AlKr7+4ygO8Y4iQrupO+j5RFOIj+8gce2CNPFzj4lkqb67f4+jkFyg8/x16P/7TKNF4m2BfJbHnAJl7H6L8xstI5+5IMaTvEdit1aFxIDa8685UcVQFY2gALZfFyxdwF/KouSyBaRKYZju3HD4/hEDoethX1l4QefkKWjoRbvd89N4OlGQcZyYPQYASj+DmK+CGx8cP7ybzEw+jdWURisCrNGi8doHGifMEzeXQY/df+DgIqP3gbdJP34veH2rdlr/xGo3XziI9n/jREXI/+QRqJklg2tjX5lBiK7hmJTz3T9aK0V95cblw4sxXJ5f+Pv2VSU5/Jfy3EApGIoeiG0yftZl44+yGVJwrYSQyuGYDuY7U4aqfXY8SeM5dtT65TZcr352AZ1llJPLVIvkLy2mbsW9fW3PsyX97Zs02G5NSME+H2kNkHe/0brDzmd30PzJIYPtMvzzJ4ukFDv/yMRbfWWDHM7uQgWTxne1jRPqvWIZAENUz9KcPUbcWqVrzSAJUoWN5NVRhYGhxLK9ORE2gKjqKULG9Bo7fIqolKZlTuH44PhWhYqyzX8LoCMsXFQPbq2N59XWv5/WvLvKzv7GbT/zVYb7+L6coz9loerto01BIdmj07Y7x4V8ZpFlxOfP8cgQlkRBcuOxw5oJDubI8drSIQs+BLHPnwn3TfbFNyyBuPmcaeLRq88TTfVjNEr63vZW6UgYhw1HLxC/X0Lo70Ad70TqzWBfG0Tqz2OOTIEHf0U9QbaxrTJGSyluvER3eRbR/aMlAqNEYmfsfRQYBtTNv4VbLm2cwEgI1kcTIdaF3dmPPTWEv3LpadyWMzm6yDzyO0dO/ars1NUHhB9+8pWGun3uHSG8/HY89vUSIr8YSZI4/iFNYpDF2YQ2t4p1Aeh5etUJgW6grRAKiQ7uIj+ynOXZxcycKJNJxUdNp7OthCFrNpJG+R6S7C+n7KLEY9pWrqNkMajaDly/gV0Pv2l2sgCLQOtO48x4dP/cM0d395H//O9jX5hBRA79cR3oekV199PzVz2CNTVP6k+cJHI/4kd1kPvQA0vNovHpu2YMVENnZS+p9R2i9cwX3uZOomSTO1CLS9dH7Ouj+1U/iFasUP/t9AtshfmQ3ifv3Y09s/hlvBMWIktl5eGlhUp8dQwbBkpCyazaI5XrDHsRakcD30OMp4l07aMxfwQt8Yh39gMCuFUAGocyV7+LZTdJDB3HqJaxqHs9cf9LZNLZxfVySi9RkmS5i6+dOtwgpJde+E7bGHP/LD4SeqCc5/3un2fPJ/cR7t0nb9L9iDYRQSRqdJI2ukEcgsNEUg0y0j/HiqySMHH3pQ1wvv8VA5vCSspjrmUxV3yEZ6WZX7iEuLDxLyy2jq3EGMkeWiqscz2SudoGRzsepWnN0J0aYq11gtnZ+3es58Y08hx7Pcvj9ObqHo4y+WWXoYAJVEzz4sS4Ajn2gg2RO44efnWd0BdF9oRjQ263yzBMxKtUAKeFzX26iRTX2PTNIPBvqynbuSTP2/Mz2cfMCaHqMaKITLZIIw3jbXYLu+fitGpEDu6j/4ASRXYOo2TRBPfQilUSMoGWFYTUpMXYO0Dq5Po+rk5+n9MoP6PnoZ9BSmaXBrCXT5B55kkjvAM3xy9gLs7jlEoFtLfWnClUL6ediCdRkEj2dRc91YXR2E+kbQM91svC1P960MVXjCTL3PUJ8ZN+qScUtF8l//xt49duFaiWlV17A6Ogmdc9yQ7zR2UP2offhlorYi7ObupaN4JSKOIVFYkM7l7YJVaXrg59AiURpXR3bWMFBKKjRKKgaQaOB32gQNJohKUYijrTskOTi3AWMoUHchUWURBy9vxdp28vGNF9G+gF6bw6vXCe6ZwB3rkh0ZAB3oYRi6HiVBtILyHz4IYSmUfj9Z/GKYZWdM7mAmk2SuH8/5oUJvMJy9Z3Wkab24mnMc2s9q8SDB9A60sz/8y9ij4WtAN5CCWOoe82+W4UMfHzXQlF1VD1Csm8PVnWRwHdJ5faiaEZItRZNUp8fD8Xnc720CpMkUl0k+/fguzbxzkHM8hyxXD9WeZ7Ac4imuwk8B6VZ2bbr3Q5YNCkEc2TUTgzunBR+I5iFFnbFxq7aRLIR+h7oR9WUsNQtkHc1LQkEKbE+gcp7BU86WJjvKtHJVhFIj5q9QNzKUmxep+EU6IzvWndfP3ApWZOYTpU9Xe9DCJVC8xo9yX2rzxm4lMwZTK/Gns73oSgqqtCw3QZ1e5GKufE8a9Z9vvBPJijO2hx5MseTP9+P2hYAf+YXB/DcgJnRFi9/YYEXPjtH0BaiSMQF/X0q1yY94nEFy5LMzIXRIs/yGX9xbql6t7bQopnfXJ/8JonuVeKZftLde1D1CKXZ8wS3CT/dKezL1whsFzdfCqkCPR8xORd6Ox0ZnOkFgkYLdA179DpO5NaKLY1L51AMg+4PfQotsax3qMbiJA8eJbZjN26ljN+oEbgO0vXCPjVVC7VKIxGUWBwtnkRNppZUXYJbsHHcDKFpJA8eJX3sQRR9uZnct20KP3wWc5Oi5YHVovDDZ9FznUT72yQP7Srl7MPvJ//9bxJsUQoOwCksYE5eJdI3sCTmK4Qg0tNP94c+iTU7hVsuho3YbSUIxTBQIlEUI4qiG7i1CqXXvr987xEDJZ3CiMVA01BzOYShhxXTgUSJxVAzGWizRHmlOtJx0buyBDvDqEfj5CXiR0bQRjMhvVnLBimJ7h/CmS0sGVIAv9rEnSuSfPge1GRslTENTBvz0nIYdiWM4V6k42JfWx60ftPCnSuh96+VdNoKpJQErkOrMI1vt0AIGvNX8R2T3Mh95M+/Eub1hw9Rn7uCXSviO2GbRbxrCM9u4tTLaPEURiKLWZ5bkrpyzTqtwhRO/c45nG9AaAZaPEVgt/Dt2zenC1Uj1juEXVrEtzZOmeTlDH1yB7qI3DHT0UaYfX2aXR/dg2aozLw6RXIwTX22xtG/cJxoLsbs63dGAbcSKioHlAe25Tq3iqoscD24hMO7Q3RytwhzusqSMxVIH0VogMDQlqMCfuASBB6B9BFC2fDpe9LFlx5B4KMIJczDCoHrt1ioj2G6lVteT37S4hv/coozz5fo3R0j12ugRxRsM6A4YzF/1WTyQjNsIWsjm1E4sFcnmQivKp1SGBqIcOqMg2f7TJ5YDIuQCNmPNlvUtiljKoOQsMF1msTTvSQyA7ep6L1zuAulkAyiHE6C7mxYEaukEoh4DG+xGBo818M1F26fsw186udOEZgtuj/86VUVtEIItEQKLdEusrlxLrH0n22AINI3RMf7PrjKmIOkevIVGpfO3lHe2ckvUPjhd+n/9C8s5V2FppE6ci9Ofp7KyVe2XOka2Ba1s28THdxJbMfuJQ9aCIGeyaGlsyFVo+ctFYIJRQ0LqdrEEtbMdfxmC2v0SmgwFQXz3EWEEMQfvA93YRF3MU/QbOEFAa23zyyRYQPg+XjFGmpnmlguiTU2jT0xT+K+/URGBggcj6DdkiSiBsEKYxn+rBLp+Qht+ZqW7s9xw1ztOlAMLXyvVg6YIAjvdZsQuDZmaRa7VkA1omGuuI3G3FU69z+I79pYlbVpi8biBLk99yFUDbM0B0FAeuggejxFc3ESp1UlM3yYxsI1zOKt6SvXg2JEiPftRGg65sIU2CZ6uoPAsfCtFka2C6/VIHAslEgMPZHGt030VA6vWV8ypkamE99abYxtWizKaZIyiy62h5lo5tVpapNVVF2lPlNDjWgYSYPuY72Ur5TJn12/kn4zEEIhJ7YvIrEVeIFDrjtG3fFoVW//DkYTKnvuTzN2sopjvvverBdYCGAoc5R84yp1O89w7j5GOh9DEcqGHrWqGAxkjpKO9DCQOUy+cXXdXKiuRBEo5OI7kEg0NUKxuTaitBKtmsel16uMnaxhRBUUVeD7Ervlr1vDVyj5vPaGhdpmDDEM+Jv/fZaIAbbDkiEFlrzZzWDT3Lye08RzmtjNEoqqrysO/m4gaJo412dWT4abNELS82iMXcQtl+h4/wdJ3XMs1OO7GZuMDUkpka6zlhhiHaixGD0f+TR6brV30xwfpfL2iXWYmm735QHmtSuUX3+Rzg98dIkdSY1E6XjiQ1hz05iTV29zko1hL8xR/OF36f7IZ4j09oWN5G0IIULdQm39aMBSBaLvE9QbS3/7bWYhe/wqXrG4ZLCClrnEQrQS7kIZLZdC68pSf+EUfq2FV2sS3TeEtBykHUYFvGINreMmyjpVQYm1qQXdmyahW7wufq2FEo8gNBXZljATmoYS357QpO+YVKcuLBUS+Y5NcexNfCd8/o35cczyXFhhvGJMCUUFITBLc7itUKvUd0PP3K4Xw9CxY1GfvoxiRJc82TuFFk2gxVOYi9MIVSMxvC/0PDv7cOplAtchObyf+sQlol39GJkOzMXpsN6gPW5Su+9BMQz0eJrSudcJ3OV6ivngOoPKCBr6tninqcEUeix8DzM7swB4pse1715B+pLA/fELj94pOgYiiIaFWfPoGo6y80iKxesmelRh+mKToUMJlDYj1uSFBomshnKnVFJbRCB9pqtnUBUdL3DwA4fLiz9YaguSSDzfYr5+iUB6BDJgLP9DXN9ivnaRfOMKfuDhBw6B9JmvXVzabzT/Ir2p/cxUz1I1Z4kaaXqS+25rTG/A9yRm4/YORcQQdORUbgQLO7Iq/b0qN08bd4o7rk8PfPeuQ7x3VP7d5nzcMoIAe3GOhW9+gdqZt8g9+iSxnSPrG9UNz+FjzU1TP/cO9fPv4N1GAR6g+0OfIjq4A1i+X79eo/zaC7jlwtZuxbGpnT9FdHAHif33LG1X4wl6P/VzTP6nf7b1SmUZ0Jq4wuznf5fOJz5M6sh926YNa1+d2Fx7zEKJ2OERjB09tC5cI2iY+IUqiWN7aJ0dJ2gb09bJS3T8/AeJ7BtaynMafZ1E9w5hX5vDr26+7N4amyb9zP0kHz5E/eWwMlXNJIjs7sevbUMblZQ3SUrJVYZPBv6qwiE9kSU9fBD/RshVBnjm6vtZuX/gOQR3Uwx4o0AvlsAwohiZTqpjp1EUlWjvEIWTPyC54wBaPImiqaiRGL5tosWXW6fiA7vxmjUC1w3H1Qpj6mAxG0ywVzna5o++Oxz42XvI7MoCoCcNYh0xrnztMu/8m80LQfy4Q1EFihI+l2NPd9Ksuuw+nqKadxk8AL274sRTKlbTpzBtveeEaF5g4wXL7/R6bS4rP3f81vL//Vvt16RqzTLS8ShdiV0AzNc31gDeKnq7VZ55MkY2E7LXNZoBf+cfle5aUfO9VNJGOjaT//F3WBNKfQ/66QLbonnlIs2rlzE6uomP7Ce2YxdGVw9aMo3QIyADAschsFq45RJOfh5zdgrz+njojd7Bdc5/4/PMf+NPbtoq77qlyC0VmPncf2JtOPruz42UuOUi81//HIUXvkPq0FFiQ7swevpQ4wmEboRE8WYL32rhlUvY8zOYc9PYC7cogtpkzsFdqJD79ADufAlvsQKAM1tATSfChvy2ZF7lu2+SePgQA3/zF6g+d5KgZZF4YD9qOkn5qy/j1za/oKifuED2Y4/Q/Zc+gT7QiV9vET8ygt6d3R5jeodwmxWKl947hiuvVSfwXDL7jtOcvoqVnyWz7xh6KkdzcozO4+8HoDV7jUhHD0JR0eMpYj1DGNkuymdfozFxicTQHly7jL8OX+tMMM4OZT8RefeVvSf+8SvLaQhF0P/wINl925Pb/nGBlLD3wQzpLoPSnE0iozNxuk5l0eEnfm2Y7/3nafY+kKVVdTEiCv0jcUqz9m2ZgG4NgYLS9i0DBAqGEscObr8wVYRKpzFM3Sti+XdXUV6zFnhn9msrttz6hoSARFbj+DMdHH5fjq7hKHpEwax7zI2bnHmhyPlXKnj28nnGrnpcuba68HM7FiSbMqaKCvGURuBLAgmO6d9Rm+Wq/vN1RUdDRGIKrh1seYWg65BKKNzeocojr+Zxx1/BaRMA+b7E88B15ZbcfV2HdFK50b2yAQSbzcm2TEmzJdd/yFKiCEkqpRBZSkWtPbdkme8i5FEI79F25K1/YynxahXKJ16ifOIl4jGxlKy/GRqQAlIJILE1/tBaXWLZEne+iN8wabw1uvSZm69gjc/iF2tI20UoGqowmP3//hG5n3qC5OOHEYaOfWWG4udfwBpdXWgUtCz8+i2Mq+sx+08+S+ef/SCpJ48jTYfaD9+h+dZlovuHkesQg9wMRQ0l4G6lcPHjisB1qF05Q+3Kcr9oc/bq0uxSn7wMUoZ5VM+lPnEBoerk3/zeUji3OTNOc+YqG41rD4fp4Ap7lA0I8O8EcjnSIwNJZbzE3k/vv81Bf7pw9VSNC6eWF3Ir58/P/e/jABRn2/l1CTNjmytk3AiaiNAX20tcy1JzFsnb11GFRlRLYDsNFKEhEKGhlQEgEbQLMqUfbhPQGRlkpnUpNMtCRcpgi7q1m7NsigoHH83y5/7uHnp2RfE9SeDLdlmHYOTeNE/8XC8TZxv8wd+7wtSl5tKp3w1vXshbxFxvrAB33hPnl//+bq5faFIvubz05QL5qc2RBSgq7DiYYOJC87a/0Qf/mx5Ov1ChMLO1sNXT74/yT/63To4cun2xg+dJTEtimgGliuT6tMv4NY+T79icOmOzsOhTqW3esH/wySj/+v/qZsfQ9jj7//I/VvlH/7SyqqF4JXq7Ff7Fb3XxqY9u3FcXBBLLkjSakmLZZ+yqx6Uxh1dOWIxecckXfRrNWz+UaFTw138tzT/4zXdv9f+rfyPP577cYDM1P517HmTg3o9w8dv/Aq919wxQdwuhqOR234tdy9PMr18x/J5eD4I+sYsj2qMb7iOl5GpwlqvB+v17655XVYl09KLFUpj5GXxz86F0AB2DR7WPExWx2+8MuNLhvP86ebm6qCo1lEaNau1rgu4jvXQe6uK1f/TShudSULlXfYJOpX/DfX5ckA9muOS/hcXdRUVSIsdD2oduKXHnS4+pYJRJrpCN9GN5dRpeiUD6DCYOEUifudYoO5P3oqIQEFBz83iBQ1rvQlMi1N0CBXuKjN5NUu9grjVG1uinIzJAy6uSt6/jBu9Ofc3Owwn+x/90FC0iWLhmMnmhQX7KwnMlsYRK3544wwcTdA5GyE9a/Iu/eoHF63d/LRuZzE3N/IEPl0/W+NxvLfPB9u2KYsQUNF0wM2ZimwFGVKFnRwRVEzTKHq26z+DeGB/4uW6e+8MFyvMOtZJHJK7QuyOKoglqBZfKokOm22Dqkkmj8t6ozGiaIJUUpJIKPd1wcJ8OT4cGaHbe5yvfavKFrzU5fc7BtH78Kb7Wg6II4nFBPA493SqH9ht86qNx/uZ/Jzlz3uELX2/y9e+0GJ9wN2XIfuQQgvTAPhqLE2SHDlEYDcUEtGgSI5EDJIqqYddLuGYdLRInku4OV9CBj1WZR9EMFFXHd0yi2V7M0hyKrqMaMTy7RTQdVnN6VhO7EVaYG8kcyPB7FFXDaVVwGmWEomEkcziNEnY9ZEwRqk4810fge6h6hOD/1957B9h11mf+n/fU2++d3qVR75a7cbcxxRB6qCGbniybhJSFXTYh2SS72SSb3YRkl1QIEEpCMWAwYGMbG3e5yOp1JE3vc3s7/f39cUYzGs2MpJFkQ/anR39o7r3nvqfcc97v+23P43vUCxNI30PRDMxEI4puouoRPLtKLTvKZWVLeIUgfR9r+uL7mV0cRoI+1qk7LqkQadN753OmUkrqM3WOfe3wRY93BWAHVapunkazi6iWYtoaJGuN0BZdG3IpKxGmrX7SRjsCBU0xsPwK+Xof61M3kbXn25F0NUJSb6Li5TGUKLowcV+hNp97f6UHI6bw/ANTPPDJYXJjix28jvUx3vtf1rDxhhS3v6edr//vgXOOmUoK1q/V0TSYnPIZHfcveG68wD5TaO40ufquDJWix8jxGh1rIyQbdbo3Rtn/ZJGDTxdp7jK456faGOmrMXKszvSITe+2OOkWg1Wb4/iepJTziMRUVm+NkWk1KOc9Xno4R1OHwdt+tZOv/PkQw8curjLxckBRBN2dGr/6CyluuTHC//5kgQcfrf+bNahnQ8xqPl69w2TzRoM7bo7wib8r8tQu68feoBqJRhTNZLrvedq23M7M8RcQiiDR2kvLppspT5zEiGWwyjNk+16gecONaJEEnlMPxe2reWJN3ZiJRqzSNO07XsvwC98m2tiBZsYRioIQCoqqIaWkMHSQen6czKrtGLE0nlVFCIXKzCBOJY+iakQb2mlefyPTx3dRHD6EHk2w+tb3kjv1MkLR0GMp8v17KU+cJNm+nnhzN77n0rz+egpDh6jlxi5rzEkiqckSw37fObcryUtXV1EVA02L4HkW/gXwtI4GJzFFDF2L4vlWSP6yDHw86jL0zoyUSbQp9GhPfbeP04XmUoLv+PjWuW9cOStcXpOXzgf7SqMiC/hceg+/I21G/ZOIc+gJSwKKMjvbJyqpuFlSegumEiWmZYiocSJqYjZcG4Z4T3PKG2qMlNGK49fRFGN2+wS6MPGki66YVL0CTvDKzeUbrk9RL3t87++WNqQA4ydqfOMvBvjdr+1k9fbEktuchqrCW98UpaVFRVGgXJY88bTF8ROXW89UExgRBb2uoBsKviup5F3qZYPerTEOPl0MG2XHHZx6QCnnkp9yOPZSieZuk2e+NR3mWUV40FY1oFLwaGjViSZUTuytMDloX9Y1upSS+79X4/iJxTenUMDQBbGooLlJZW2vxqb1BtHILDm+Irj2KpOP/WaG4VGf3fvsFeVyPV/y9C6LE6cu7sF47kUL277wqyGl5Mhxlwcems8PKgoYRuiBtzZrbFqvsbZXR1EEQkDEFNx9WxTTENTqeZ7fvfiG9D3J3oMOn/7CuUOqhiG45YYI69fOt8/sPWCz/7CD45z7PPpOuhd0bVPt67CKk9SmhzCuS2OmmnAqOYSi4llVpo4+QyTZTPPGm1D0CIo+q1841U8tO4rv2vh2HRkPiDf3YBWmMJONxJt7KI4cYdWN72C67wWCwCeabgs913xI5iBUnaljz85W5s5q0LoWpZGjxBq7FxynZsbJnnwZz67StPY64i29lCdOhgxGhSnyg/uJZtooT5w4b1Fb5zUtJNuiHP/+EC1bGmhen+bwtwfO+Z0iWap6gca1KeyKS3F4sRFZfUs75QM6dvniJ+50ehVSSiKRDFPTBwgCH1U1UBQVb1bbMxTLUVEUDSnguL+XuN5C1Z1CygBVNRBCwfMspAwwzTQAjlOZkzfMrM3Qc1fv3H6T3Skqo/PFNtWJCke/vHzIWiIZlscXBQAECgJxkXm980OwfN/lKw2bGseCly9oW1WE3LgCQdYZxZU2nnTI2+G9P2MPYXll8jLADSxiWprw7DQmrZMgwQ5qeK6DJ23y9igRLYnj116xawuhTbKr/nlTjhP9dQJPzvWVLgdNhRuvN/ndPyxgO5K33Buld5V2eY2pDGBqyOaFh8LVbM+mKGuuinP42RJBwByFU37K5fnvZVl/dYKN1yWplsJCJc2YPwnDVFh3dZJUk0al6NHQpl92ZsIzcf/3qnz7wcUFKGLWqBuGIBlXaG1R2brJ4Kffk+C218z3GO7YYvDBdyc42udQrly4cfM9uP+7Ve574OJyH3VLrtgbPnzM5c/+ujD3WgjQtNBoppIK7W0aV+8w+JWfSbJxXZhX1nXBTddHeO874pwadJmeWfjwux489ZzFy/vOfcOmkgp//LuNC4zpU7ss/v6zJYrlc08o5cp5CqIAhEKibS1GvIGua2Iomk5m1Q6mDj+BDHzcepnAtfE9G0QoWTd97DkSrb3EW1aT6trC1JGncO0KESkxEo1UJvuJpFqIplvJ9+8NQ7K5MEdXnR7CKk3P7d4uTZ9BtnDu38Wzqri1EkJR8N16GCYGarkxUp0biKSaQUrqhfMTDLRta6Tr6ib6fjBC783ttG5pOK8xBVBNlaZ1aSpT9SWNaWWqvqA5/WIQjTZRroyTTHSSzR4jFksTj7XieXUsqwBC4Ps2iUQnvmcRi7cyNbmfeLyNupXD0BPE4q3oepR8/hSGHkPTYiQSHYyMPheqswDlkRJDj82f821/fDdHv3II3w4/92oeKaWJBrUNiSTnj1MJipzvd0qpjTSpnQw6h/FZfsJsVDso+Vk8VlbL0aatJu9PYsvLR27zSsCXLiV3esF7BWeeEazmhwQpdjAbKVCilIJpKm5ubsGTOyPUe+Z3XkkMHarQtTFOslGnnFt+UdjYES6qx06e+3eQhAWor70zQqUSsLpHm1OSuRBcVLVMveLT1GGy7dY0kZhCvRIK4HaujXDL25oxIgrDx2p4duipJjIa7/qNbl7+QZ6hIzV8T7J2R4LsuIOqhVW8t7+rmd6tMe54VwsHni5y4KnL82M4zvmMkiSbCxgY9th7wOZon8Mf/27jnEFVFMFb7o3x558sUL6AhuC5UaWkXJHMZF+9lakXLH2upbJkaibgRL/H7r02L+y2+NRftbJpfWj4Iqbg9XfFuP97NaaXIHSu1yX1+rknJtcF6yxPulaXzOQCiqVLvwaRVAtC0Zg6/CROrUhpvI/27XczdTgsPFlKNSXwHQqDBzASDbRtvZNYYyeVqQEUVUcIhVpujNbNtyAlczlPp5LHKk0jFG1BcfRKVFmW21YGHp5VpTR+Aq9/T0jGcEHjgRFTaVidpDxZp3Ftig2v78GIaQw8Pc7onhkCL2D1a9rpubkNt+IydayAmdTpuKqJNbd1MPLyNEPPTeDZPhvf0EPvrR08+7cHcFSP1be007Q+jRHVGNk9xeBzE2x84yoyXXEQggPfOEllculwXcRMMTm1D8+3iCrNuG4V33fQtOgs8YcgFm1ifGIPsVgrqmaG9HJCQ9OjBIGH51poWgQQJJNdSOkTnKGsU5+pU5+Z37/veMwcmMKbDe8qqDSqHfh45LwJHFlHFwZCChwsIiKOJx0U1FChBJV6UKbql+jWNp4RChUklQYUVCpBGG6NisRcywgQ8gwLQUwkqMkyjrRQ0YgpKVxpY8kaEREjosRJKBlK/isrVv6jQNkLlYTkCr3O9DveQGTLOgDcySzFBx7Fn7746/PIZ0f55b/YzJ3vb+d7/zCypIi3EVH4iQ91Uy16PPP1JYRRzoDrwqc+V+H6awxamzVe3uew73Ib07GTdb799/NVddlxh6/+xfBcmfppydGJAYsHPxOuaBwrwK6HIqtf+uOwdNuq+Xiu5MDTBU7sLRP4YcGPXQ+YGXM48HQR35U41o8mNOK4sHuvzT9/ucxN15noejibdraprO/VGZ/wV5zeSsRD4dlqVeIHklhUYWLKxzrD6KkqNGSUV8Xw1i3JS3sd/uuf5vjyp9vmogLrejU2rtPY9SKXzATySiAMy05SmRrAs6vU8xO0br2DaGPnst/puvpezFQrUnq4tRLV7DC+Uw/DwnYNt15CqBpWYRLPqjC+72G6b3gbQihY5Wmmjz23JMXfaUTSbbRtu5NEy2qSbWuIN3WTH1osSXYaiqKTaF1Dom0tQijkTu5m5sQL5z33/FCZxrVpVEPFs+oUhivs+0ofzevSNK1PM3OiSOAG7Hz/Bh797y8S+AGqoZLujjN1NM/4gSwb7ulm6nCOylSdwWcnWH1rB5qp4lk+8ZYo5bEqk4dzbHhdD27dp2ltipe/eJyG1Umues96nv3kYgk6gFJ5BNs+nQKQeJ6F41ZpbFhPLNbM1HQYfvW8GkHgoKomyWQXrlfHc+sEvjPngUoZEDHTVCrjs5J9Fz5Zq0LFFDGiShw3sJFSsta8iiH3CL36VvrsPbTqqzBEhACfql9g2h8lOCMMq6KSUDKoQqNBbWXADY+9SesMjat0adTaaVK7mPFHaFa6GXQP0aR2oqITU1JMeYN06uuZ8UfIqK2MucuzkjV96IMYqzrJffZr2H0Dc+8nXncrxqouit96GD9buOBrcBrCNIhetZn6gWNI69IkGpdCIC9ugqg+/RL2iQFi11+FsboLxTAuyBxn2gw61y+U8pOBxPfh2W9Occ/PdNJ7VYIjzxbJjtn4ToCZUGlfE2Xn3Y209kb5wu/1MXT43DlzRYH1azW++UAdRQHbXlmb5AUZU9+T1Erzpy0DqOQX78VzJOXc4vfLZ23r2hLXXvhe3fWpl3/0fXquByf6XfqHPDauCz03RRG0t6pz2uQrQTKhsG2TwUzORxGQySiUygFre3W2btLZs8+mo13ltpsjPPBQna4ONfSm65KeLpXhUZ90SuHxp+vcfEOEJ5+99Mq4IIBnnrc4OeCyfk14jqoq2LjOIJlQyC3TjvOjRO7UyyDEXC+nDDyOP/wPoTRgVlAcCaXi7FKW4efvRwY+wy89ELZ3yVmis9kw7dSRWW828Bl87r6Q11cG5IcOUhw5Gu5HBnNcx9NHn53b/kxYxSmGnv9G6IHJUNhZBj7HvvdJIPw7P3iQwtAhjEQjkUwr4/seppYbRagGm9/0qxdkTKcO5+m6uoV60Q6JCrY3suENq9BMFafqIhRBsjNGZbpOLRveH2bKwK64VKfqVCbrqIaKMpuOcaouvjP/GzsVh/JEjfJkHdVUaVyXpGNnM7c1RpBSkj25tAc9Nv7iAi+8WDzdGiQZs4qzVdQepdIwUvqMT7yMlJITJ76HJFjUYtDTfQunBh6luWkTsWgT1VoYBl/zpvVs/7mr57aLtyV48+ffMfcslk4UOfoHfahoqBgoKNjUmXKHuDpyN3vqj81SEfjk/XBxZIooGgvpMSUSRYQG9bSRrcsKwRlGXUEl70+Q9yeJiDhJpZG02oImDCIihodD3p8g643ToLSf83dV00m0lkaSr799gTFVohHUVCKklLwIqA1pUvfeiX1iEP8VMKYXC28mh1csoXe0YqzuuuDvbbs1w0/9wbolP1MUgaoLdtwRkjaE6aJQm1ko4byGgH/33zew/c5GPvc7yxfmqSrccpPJd79/cXPsq8qA9G8F9bqkUPThjIctk1EuKrerabB6tUZLi8r+g05Isq+CEJKmBoW6FRYOtbWo+J6kUgmIxxRWb9DYvdfhSJ/DPXdEue2myNn87ZcE25EcOOTMGdPT52gYr2ACewnobWk6f/4elIiBUBUmvvgEtWOLCdulDBalwOaEszVB8vr1KFGDwuOh+Hbz22+ksucU1tBi6sbTRlFvToWybqeJGaRESRqkb91C8anDeLNMSsuTMYQG+uz11QK6TRlqJSqKilAUZBAakWiqGc+6sHx6YajMNR/cyKFv9dOxo4mGNSkGnhnHs3w6r24GAZXJOumuGKqpIIOQko5gtr5JsiBkregKQhEomoJQxRyxx2mURmrMHC/w1F/vC/lulwifhZfr7EWXPOMzb27MMz1PWN6zmZzaT1PDRupWYc6QAozvGqHYv7wqjrQkqoxRCmaY8YcJZo8jrTVTCnKklEay/gQCgYp2RlFQ2KSjCAUktGtrAMmYe5JmrWvu89PsQKfhS3cu7CuRlP08xWCaelCmWetGEwYCMafneS64oxOYm9ZgrOnB6R9efkNFASWsBUCEnhm+v/CHUxWEphHZsh5h6AjTQBjh8y29WTEHVQm1dZ2zcoyqGt4jZ3Kga7PH7/mghfcvMmyTWlDksNSxBf7SzGfBypnaTpPPLAXfl/hL3J9SSghCRxBA1QVtvefucZYy1Dlds1plbGI2H+9duFz0ioypqpqomhmuwgnwXOu8oRgxy4Rx5oOmKBpC0fC9H0+ZIaGAqiw0KsXi4sn8QmA7cOCQQzYXkE4pdHeqbFyvUyxLxiY8tm8xeOFlm2RSIRoRNDeGN3W+GFCqhKQRTz1X56/+tIlf/0/Zy3SG4bOQKy787RIxcQHsUZcf9VOT5B87gJaK0fq+2xj8s/tQE9HQyAmQtov0AhRTR+gqKAK/aoMfoCYiCE0NP5sdTxgahR8eDLeZhRLREYYGfkDg+KipKA33XEXx6cM40yWkE07wgeNRePIQfjW8NxVTRxgqIPBr4T6FoaHMSgDKICCoO+elTLTKM1jFGdq23YFQNGTgM/T8N897bdxa6EWWx6tMHsyRbI1Sm7HY8LoealkLp+oifYlVdDj4zX7u+fgN2EWb8QM5fEviO6HxdsougS8xEhrXfHATmZ4429+5lrF9M7h1D9/xkYHEqThMHc2RaI9x53+8Bt/z6X9qnMFnJ1BQZz2209b58raLOU6Ziak9i69d3sLKLz9XKCi0aCnatF4yahsTbj8BYUrmsPUcm8zrKcsCGgYZrQUXh4I/RYvWTURJ0K1vYsQ9Rj0o0aVvJCbSuLO50Catg7iSplNfz4h7HB8Pn9CIebjUgjKaYtClbwAkw84x1hjbiRpxVHGm4V4a7tA4fqlC4q6byA2OLs1DLgTJ195C9OotqE0NCF3Dm85Sefw5ansOz+VlUm+8g9i129E6WhG6Ttvv/Ie5+zL7ufuw9h0h/Y43kHrD7Qz/+4/PDx+Lkn7b61CTcQpffwg/VwCg6RfeA1JQeuiHpN98N8baVcggoPz9J6k+uzs0yEKQvOs1RK/Zitocyiz6M3nKT7xA/aX9i432ReDZb0zx7DcuXg3oQiEEbNmkc/cdjXOdFJ/5YoUHH76MeqbhjhS6em6mpX0HtlUAYHz0JbLTRznXQ9XYtIFqZRLLys+N09i8iVS6h1N9D13o7l9VJOMKzc3zK1HHkZwY8C6UYnYBpqZ9pqbnjdZTz83/MIePzq96/vlfK0gJe5ZIeHd1anz7wdplzWUKAaax0NW1bHnBq7DLDgG+FYYxFUOn5zffSuXAIEhJec8pnIk8mbu2YbQ1oMYMSi+eoH5inPafvguvVENNRKgdDT3a+OZuWt9zCxNfeoLa0VGUiEHTW65Dy8TxshWqR0eIrmkjsWM1asykvPcUlT39CF2l8Z6riK7vYPyfH8OvWGTu3IbZ2YjQNcq7T1De20/qxg2kb9qIm68gXZ/8Dw9gD59noSMl+YG95Af2ruiyHPxGmHN76OMhQcXpkOupJxcTKAw/VmDksSKB9JBIknozFbeGE7i8+Jkjc9s9/w+HeH6Z/b3w6XC7Q/f1c0KJU/dLgCCqpohpGSpuFieoY6gxHL/2YyFiHRAw6Q0w6Q0seL8UhL/JUfsFVDQcxWLEn6EUZGcp8ATj9gCnea1d3afgPAeqCHV7DYUZdZIpZzT04EWA5Q0iTB1hKIzJQaTnMu0PM+OH1awSyWF71xz93nlhaFQee47Mu9+EsaoTZ2AJPVYp0bvbsU8M4PzweYSqELtuB8nX3443k8c5FXq0td0HsY6cIH77jUS2rCf/r98mKIT5bG9mec9+eQj0rlbSP/FanOExqi/sQ21M445MzBtJKdG7O7BPDeE+GaYsotdsI/W6W/CzeexjF69kdYGHiBlV0E3lvMo5viepnoMUyHHgV37j4guiVuSHSOkzNryL8dEXaW7dRmfPa8jNHMcwk2hahGplAhBEY02ARFE02ruuJ5c9Tq06g1XP4cwWK+h6jFRmNYqiUa/OYNsldD1GPNEWisM6VaqVqbAfMtqIrkcRihY2zZfG8LxXphk4GhHs2GbQ1T5/aV7ebzM47F52PsczDde5xs4XAr73yOU9X1UV9HQtDENNzwSLKnJfDaiJCLENHegtaQpPHwEReoT5H+zHr4TnbfY0Y3Y1Udk/iFAEmdu3ghA4U0VmvvNi+HoWlf0DJK5eM+fZ6i0pzM5GRv7Pd+e28QoV1GSU3Pf34BXCcKt0fQrPHkVNhuEgs6sJxdCY+c5LBLZLz2++hfK+AZASZ6LA1H3Pkr51M2ZX8/mN6SuMqJqkK76VqhsWyuTsUTRhENVSOE6NiJoMmWu8Mq60UVCJaw0EeFh+BU0Ys8TmNdygTlxrQFNM6n6JiJqgLbIOV9qU3RkiaoKImsANrNlGfoW4lkEisfwKilAxlRi+DMf+cTC4koB6UMZPa2iRDEHNDo2iqiBdDy9bInrVOuz+cfTWBvxcCTWdQERNnKEJ1HQCbzpPULXQO5oxultxJ3M4Q5NI21lkOC/IkBLSNFrHT+FOzhB/zTU4I+NLbpf73H0LXge1OpmffBNqel69x5ucAUUhsqOEdF3ckYk5L/NiobW1UPzOY9RfWroADSD3+a8veO0XKzS87y2ojZlL2vf5EEuqbLg+TdemGJk2E8NUEPO65YswM2rz7f9zbsrPxgaFNas1Jqd8iqUwYVC5wJbIiwrqnZZSOp0bikQa6Oy5iaMHv4qqRWhp24Fl5fHcOpFohmisGUWo+L6NY5cQQiESayKV7sGMZLCTBabG99LZc3NInBx4aFqE7PRRqpVJ2jquwTCT1KpTxOKtRKONjI++eDGHfk7oOtx1a4R/954E2myxRjbn8+kvlimdp1fylUQ2d/n33dWhctXWeQ5jy5YcO+FSqb7656lEDIzWDPWBKSoHBlF0lcBx5wwpgNBU1HgEs6MBv2JRePoIQg+FvWUgCVx/WZI6xdCQZxW8ySBUHTkXhKqE+R8pka6Pomuz35WhVxpIpC8R6mVMZl8kmsxVZK1h8k7osapCw5enQ2yhZ5k22qipBSatUxhqjK7YFrL2cChIbXYSUZPMWEN4gU1UTWOoJvlZo6wrJnW3hCTAUGPEtAxld4YASButNBpdeNLF8sv40iOuNVByp3CCGv5lVoVSdcFVb2glltI5+VKBib7zMxsFBBSCaYxUO3pjE162iJKMoZgGQd3Cy5WIrO9BaBp6dyv2sUHUdCIUlg8kWnMGv1ABLPxSFa05jdU3fOki8kIgLYfarj0kX3crRvfS/MFKOonR04GaTiIMA72tGSUeDXWGX0FIx6G+/9wyaEoqgbGqc+7YtJZGlEQUob+yOaPb39vOm36lG81UKE45OFZwTqdE1c/9nGoavPNtUdJJhVwu4PCx0IF68eULa49Z2dkKhaaWLRhGEk2PMD4aVvNVymNI6RNPtM2ynShUSqPUqtO0d17P9OR+ysUwfCFmlw62VWB85AWisWY6um4kkeoime7h8L4vEQQuTS1baO3YSX/fwyiqTqU0xvjoi2Qa1tDRfSPjoy9xqTkbVQ2J3FuaVNb3atx8Q4Q3vz7Gzu1hk28u7/OZL5V56NEaziVIRv64IRoVfOjnUjRk5j3TYyccjhx3cC89xbFiuDMlCk8fwZ2ZbbHQ1UWuujNZoH5qEqREaAp+uY5XrJLYuZqGO7ZitGWwR7IITSW2uYtITzOBtRahqdgjWXzLoenea/FKNWrHx/ArdYShkbl9K5WDQ1j9k6jxCKkb1hNZ3ULy6jXUT04gg4DUzZsQqkLh6cPzx/Vqi0ieB0Ioy3pDphpHEQpVL09Cb0RY4AcuBXd8tudTpeoVECizeT5JxZ2hVVsLgOWHBOhlN4sbWNS9Ekmtca48J2N0YAc1bL+GIhQE4b4KzsQrcq5NXVHe+pGNxBt0nvvqKPf/6bGVDzJb5X3mHOJX6qHo/Ol8ymxllgwC1GQMJWriF8oE5RpB1SIoVeECVIXOiyDAPjFI7PqriF69dX7fs9DaW0i/7XUoERN3YgppOQhTX94FWyEEyw8lbSfsGVwGWlsz6bfegxKL4k5MIy07LHp6JZl4ZnH3T3eg6grf/j9DjJ+s4dgB5wqCWLVz57BUBXZuN/jUZyvccZtJQ4OyIta7FS4dJPValkKhH8+tUavOABI/cJmZOkxz2w6q5XF836NeP0f1XeDj2BV838H3wjyZrsfxnLDhGySOXUI3Qi7FwHdwnDJS+rhuHUW98NXYR389wwffszQno6KEBTeJmEJjg0J3h0YioeD7kqMnXD7zxTJff6BKNr/yB0bXBR/+5RTvfEvs/BufhSeesfjSfRVyF7Hf86GtReU//mqK971r/prU6gEPPlLn8LFXf8XgFaoUnj4yVzkLYRHQ5FeeXrBdULMp7TqGlo6DIvAKVdxcmdzDewGo9Y3jl+vIIMCdLjH9recJbBevUMWvWOQe2oOWjhHYLn7dJqja5B87gBLR58K8getROzaGPZzFL9dxZkr41ZNoqRioAns0C4GkdnQk9Io9n+rBwfOK3Zsxld5rMqy9PkNDRwTNmNVbPF7h6NNZZgYvnSFnxhqiJ76VmJrGCerYfpWM0YET1NCETtpow5cep8t6NcVEFxFMLY4dVGfDvhkAnKBGo9lNUmsiqTdT9+apJFWhkzZaSekt1P0yOXuEojNBS2QNIKi4M2iKSbCMN6pogvZ1cUozNpXsxa3c7JqPXfWJxFWKkysrYgzqNmoqgd7dinV0AKkpRDauRmtIASAiJu54yAYU1CzcyRxCVVGb0pibVuHlihesz7sS+OUK9X1HiN10NUGtvoC3OHnXa4ju2MzM33wed3yKwHYwN/Riruu9iB3Njqsq83/rGsI0l97+POeauOMGotdsY+aTn8cdnySwHIzebsx1q1d+bCuEawXUVZ8nvzqBtQJCneUQSCiVAt5wT5RtW3SiUYVnnrvw+2tlxlRKatUpivn+s94PKJdGaW3fiQz80FOdZTAJgpANZYnBFryq16aJ9NyEbsTxPItEqptadWp2txd38wohuG6nCSxzo5x5NFKSLwT8y30VnnnB4tkXLIZGPKq1i9u3qoZk8lfvOP++z0ahGPD1By59ZaeI0PNublJYv8bgzlsjvP6uKBvX6SRmtUc9X/LYk3W+dF+FUvnV97ak7eGMnZX0DyT1vsW5Izdbxs0uFB+2Ti0mVXAmCziThfO+Zw8vbJuRjofVv3C8oGbPe8yz8PLzLS1nH8/ZyLRHuPfX17Lh5iZiKQ3NDNtSAk9i1zxufm83z/zLMM9+deSSAi11v8hQ9WDYTyk9AukzUjtEIAMC6VHxcmEf7Ow/O6gybQ8gpcSTNorQqPtl/MDBlx7TVj9ZexgnqM++HgzHJaDgTFBxcyE5ApKCM0ndLxPIAF86nEuzt21tnPf98Tae/tIQL96/dH7wfCjN2Hzmw3vRdIXCCo2ply1S23MMoWuhzq0icEamwQ+rnoUiCGx3zjOUs15q+bGXwm1cD6SksusggXUZF5+ej90/TPTabZjrV+MOz18btbWJoG5hHZvVmVUUtIY06uwC4GzIuoVQVJSIuYgUwS+WQYLe0Yo7EkYO1EwKvasNb2rleX+1pZnAsrGOnpw9NhH2zzZlVjzWSvGtvx7kfb+7ltf+dAdP3zdJaebSwmqeC//wmQrXXm1QKAbs3e9w5NiFj3nZgtqeW6NamSCeaGd8dL4RfWp8H6vW3E3XqlsYH3mB3MzSIRnHrjDU/zibt78HAdSqMwz1//ByHd4FIRFXWLdG4+RAGP78t6QUI4Tg7W+McerlngXvKyLsOdQ1ME1BJDIvgOV6kieftfjDP89zcuBHEN/9fxzRpMbb/8tGtt3VgqoJpvqrnHgxTy3v0tIbY8sdLbSvj/OGXwvDqc9+ZYlKzhXA8hcadv+MflfPXzjxB7PFQXPbSm+BVJYdLPSWPTnfZuQG1oJtJcGCsZaDUGD9jY00dkWIJC5+6pEBTA9cpDfvB/ilhf29/gUYRT+3cEEVnEtw/iLhTWexj50ism3jgnyjc2KQ6Nb1pH7ibuxTw5hreohdu21p4fogwOkfQXlLnNSb76K+5zCoKvaJAfxcAevAMeQ73kDjz72byuO7EIZOdMcmtKaGizKmzslBYldtIvXW12KfGMJY1Un8+qsWH5uqoqYSKPEYamMGYeho7S1Ix8GvVEOmphVOt3sfy6GbKu/+WC93f7CDatGjXvYJlvGmJ/vrfP73Tiz52Zc/18yn/rnMDx63mZyuowi49eYIN1xr8MQzF0Z8ccF3tJQBw0NPL3vCUkocu4IQ0zj2/EOdy/aRz52cGwMkM1OHyU6HJfj1epa+I99CygDLKpCbOc1QcVrVHYb6H5/zTivlUQ7t/SIXeuWDQJ43vXU6vK/rcMM1JtftNPnwL6X45vdq/K//W+DU4MqLDKSUC5vhz27LW6pNT5z+7op3B0A0qhCNnr8YJggk1VrAP/5zmb/42wK5XHCJ2ecrOBtCgave2MqO17Uifcnu74zz4F+fpDg1+2AKaF0b55f//moybRFu+2APp3bnmThxaaLQP84QimDjza+cyPyPK2YJskKc+aAFcmEY1fOxTw7hDo3NznfhZ+VHnkJJxkjcfiPJ192Gc2qI0vefJHr11iXz5M7gKMVvPETydbcS3bEZv1Qm94Vv4ucKeDM5pv/ui6Tf+QYy73kTQaVG5akXcQZH0JrP+m3OZvNYdGJQeexZlGScxK3Xk7znNtzBEUqPPEVk87oF341s30jzL78/JI0QCiiC5l96H1JKqs/spvjAowSllUnk3fCmFn76v61DNxQkkGoyzk6DL4BuLD83GjrceWuEt94b48/+ssTEpE80IgjMC48QrjjMuxSEUDHMJMlUFxPjZ8v+yCWIHeSC0O08k8pS2y5mWrlQzk4pJb/+sRkefHTpthJDFyQSgt4enat3GLz9TTE2rNOJmIJ0WuHnPpDg2qsMfuN3sry4Z2USbK4Lf/l3RR5+fOEKNiz4CItF5ph1xGwBSRC2csxkYeYVqOCF8Jp89l/K/NXfl+i7SHm4yw0zIuao7mQArhPgn2P9omohgfWZt3kQgGsHl71P1ogIPFeyLAnSMtAMhbt+thchYPhImcc/M0h+fGFIcuJ4hS//zmH+/aevpaEzwnVv7eC7nzixYIxQcUlgVZa/IEZMRVEEvhfgnoPXWtUFqjbfPiCDWQYZNzifEtzS35+da2Ug8T1J4C2eHxRNoKoCoQqiKY2112eQAeimsqR3alW9JSdDzVTQFlVjSjxH4jkX/qwomkDTBWJWhlAGEPgS7xzXQDMEqq4QeBLXDkLFKUMJz2vWUAa+xHcXskUJVbD61k5u/A87KY5WmNg7zdFvn8QuhZ7w1P/6h0X7ck4NMfmnf7vwLF2Pwle+S+Er313wfu2FfUser3RdKk88T+WJpbuJ7aMnmfrTv5t7rRoq696wCvv4EbJntNJkP/Xl+WsQUTGSBrXp+bl0+3s2Mrp7kvx9D1K878GFx/b83gWvrX1HGPn1P1jyeC4Wb/uNVSiK4OVHsrz4nWnyk84574Vzcb7X6pI/+pMi111j8N8+nua7369jGILaCtJ8K461nJb1OpNRqqV1G60d15DP9lEqDK50yFcU+ULA+OS5Z8JDR12++0iN//3JAu97Z4KP/UaGNas1FEWwc7vJJ/64iQ9+aIr+FXioQSDpO+ny7AsLQwSxZDvp5rXUKzMUsydn2aBUkg2rKM6cQigKmaZ1CHUMIUooqkYQ+HM56HOhWguYyS48V1UVNDYoRCPzdIhTMz6nzhHWFYYOihKW/Xt+WPb8CrI5/NZfrKZ3SwSrFlAt+zz5rTyPfi23rAG79q4UH/ztdnRDobVbZ3rMZXzA5pufmuLgrsvn2emm4Df+fBUPfnGGQy+sbNz29Qna1sVx6j4DewuMH1961d2/p8DgviK912To2pIi0ahTmZWTeuOvruH2n1mNbij8p50/WJbW78NfuIGuLUn2PjjB5z+yuB9Q1QVN3WTPJDEAAD05SURBVDGufUs7W+9qpqknhm4IyjMu/S/nefm7E5zanV+2iENRBc2rYlz1hla23tFMy5oYkYSG5wSUph0mTlQ48Xye/Q9Pznves7jxnZ1svKWRjg0JWlbH5xrr3/KRjbzlIxsX7ev3b/0h1fxZ96aAN314HXf8TDh5Mitw73sBP/zs4IIFyHIQCjR0Rtl6ZzM739BG+4Y4ekSlmncY2Fvk+a+PMnSghFVe/Jzd9XOrufsXezn02DT3/fejdG9JcvP7ull7fQOJjI5d9xk7WubF+8c48mSWWnH++F3Lo++hAfoeGmDt61aRXpUi319AMzWEAKvoEHjhItpI6GiGiu8GOFUXPaqhGiEjml20CXxJJG3Ono+Yc0hkIFFm27iEgHrBJpIywqp3x8etughVwYjr4SJCFdglh8D1iaRNVENFMzVswt/OTBlzVJNW3kbRFdp3tpBZnaTvewM4NRfVUOn/4TBWYT5ELhSBmTYQisC3fXzHR48t3Odp2bzLAaEIKgWPz/6XPuzzVOqeD5WKxA/ghd0OfafyfODdce65M8q/fPXCn/sVGVNFgY4OlY4OlWo14PhxD9+Hqcn9TE3Oq2UoqoERSaIZ0ZBuLfCol6cAgRlN49jlc/Cd/uhgO/Cv36hQrgT8+R820tMVVg1fu9PkV34myX/9s/wlt47UyhPEM12UcgNhr23jKly7RiTRROiBTM/luhKZbmKpNuxagcL08XOOK6Xk4R/W+fB/Xpj3SKcEv//RBt71lvgc7+6v/kKK7zxcY/fepXNFka2bQAiCWg1nYBi9ow1naBQlYoKqEtTrCzk8LwM+9Uej7H26zPodMT7616s59GKV0ZNL5ypefLTEi4+WiCUV/ufXNvAHP3uK3OSPh5d9GmuvDTVM62WPwX3LS60FgeT4cznWXJsh2WzQuiZO5RIb7c+EZipsub2Je399HS29ccozNsUJCxlIjJjG9nta2XhrE89+eYSnvzRMJbfwnhACOjcneffvb6ZrS5JK3qWcdShO2iiqwIypbHhNIxtvbsJ3g0V5385NCTJtEeplj9EjJXq2p/G9gOKkTWlmaTH6RZAwcqTMgR9ME01qRBIaPduWLr5ZCkLAqh1p3vxb61l7XQO1oksl6+D7Et1U2XZnC1e9vpVn/nWYxz49QGl66eeifUOCa9/czls/ugHHCqiXXKyyF3rc1zWw9voGHv+nAR79x/65CIGiCGItUVq2NSEleHWXjW9eQ7QxipnQGd41ztAzY8SaImx5+3q0qEZptML4y1OsvqMLI66jRTSGnxtj6mCW635xO07VJdpgEngSLapRHCrRtKGB3MkCmd4Uz39yH9vfuxEZSOySw6nHhoikTba8Yz31vEW8NcbwrnEm989wzc9txcpbRJuiVKdCw7H27h7ibTFS3QkOf/0Enu2z/vWrMJMGTsVl5PkJ0j1Jrv35bez+9EEmDoTVz6nuBNt+cgOe7VOdqVMerdBzcwduzSPaFGXsxQn6Hhq44N/tfHj4MyPc/p52Nt6QYvhoFdcKQp7eZZzJIJA49aW90899aX6xm89L/vGzFZ593j6v9OSZWJExTcQFV+3QsCy4+TUmIyM+5SUqQDUjRqppDS2rrqVWnsKuZKmXpxFCIZ7pwp85hRe8MgxGlwrXDUWtv/NwnX//s6F3CvCBn0zyF39TvKzhVzPWgO+5RBMteF4d37Mwomk0PYJmRIml2kEGaMaFtdfYjmQmt9DIzeTgS1+rcO1Okw1rNYQQJBMKv/eRBn7hw9Pkl1CIUTMpnP4hzDWr8Cam0Zqb8GZymOt7EZqOfaIfv/AKiP9K6NtXY3rcpWO1QeBLzIjCwNEwPNrZa2BEFIb6rHOGXaNxhTVboyQzKp4rOXWoTn7aw4wK2rrDMVKNGkZE4eCuCpWij6rBum0xGlpDHdOpEZexfhukpKXL4Jo7FCJRhfFBe+54zoW29XEAXMtnZmj5YhUZSCZOhg9yNKmRal159feyENC7M83rP7SWhs4o+x+eZP+jU+RHLTzHJ9MRZdtdzVz1+jZueV83xSmbl741tiBUrJkKN7+ni+5tKYYPl3juyyOM91Wwaz5GVKWxM0Ln5iSNnREOPj696BC+8xd9c95oLK3ze4/cjl31efbLIzz7lcXE7st5x3u+O8Ge74bVp8kWg48/dBuqfmH5rIauKG//2Ea6t6UYOVTkpQfGGd5fwrF8ks0mm29t4rq3dXDr+3tQVMF3P3ECu7r4OFrXxHnLRzYwtL/Iy9+bZPx4mSCA9vVxbnhHJ2uvy3DHz6zi0OPTDB0IC5aEqtCwJo1maoztmUKogszqFCPPT6DoCmvu7mH4uXFSXQlUQ+H5T+4FoOPqFgIvYN8Xj6BoCq/9w5t59Peewa25TB/JkexMhPfmlkYmD8yQ7kly4uFBbv6ta2nb0YQe1eh/YoSWzQ2kV6Wwizau5bH/X44SyZjc8KGr8G2fwmCJ49/pZ+NP9IbHqwimjuRQ+vK072yh4+oW9v/rUfqfGCGSNjn+3bCTozZTZ+o17QSzhUaKqtCxs4WpQ1n6fzjMprespWlDBs/yOfi142imyo3/YedlNab5CYepwTo//Yfr6Ntdojjl4ljLFyAVp12e/MrSvc+7Xly4gPI82Lt/ZQv0FRlT34d8PiASFYyO+kuy9QM49QJTQy8RSTSRGz9CJT8MSBIN3aiaOZc0j8SbMGMNKJqBDHwURSU3foR0y1pUPYrv2ZRzQwTeqysjlM0F7D9oU6kmSCXDB7a9VWXLRoOndl06OX+tNI4MfHy3judUcKwiCIHvOfiehQx8At+jnBtA1Uzs+qUZrqd21fn+YzW6O5PEogJFEdxxc4QPvCvB3322tCgVrhgGRk9nWJGnKqiZFGoygRKJENQt5CvE7KDqgs5ek1hCYWbMpWd9hB2vSfClT0xg1wJe995GxgcdRk/Zy4Y8FQVue0uG9tUG1WKAbgh23Jzkq5+cIJZUee27G1E1wcyYSySm0LevRqXoc/3dKa67O8XkkBOGwyWMD9pIYMt1MUZPOSQy4ff/6iNDVEvn9syTTSG7lO8Gi8OWZ0BKKM96aLqpEL2EKtezEc/o7HhdKx0bE+x9cJLv/EXfgjDseF+VkUMlhCK4+b3d7Linhb5duQV9r6om6NiQwPcC+nfnefH+sQX3y8ihEvsfmcKMq0saoDM9gdNGVUqJa/sX3RvoOedmujkbN72rk9U702SH63z/b09x7Ons3PcnTlQ5+WKectbmrR/dyM43ttH3fJ4DjywmVjeiKjNDdb7xJ8cWVBOPHS1TLbg0dkVpWR1j823NDB8Mjanv+oy9NMn00RyZ3hTRhgh6TCfWHMWpupx8JEyLCVXBd+evlVAFctbLCrwARQvzxTKQ+HYoTHA6beM7Pr4X4NXDELVqqJgpg0jGpDhUpjBQJNoQoZ6zkL7Es7xZST6FwA0Igvlcb7Izzpq7usmdKBBvieLUZtV/ZHhMy0KEnwdeMKdUJITAKlgEXoBPmGe+nHjnb60m0aCDgK23Npx3+5Fj1WWN6eXAip7cak1y8pRPW5tC/ykfa4V2RcqATOtGStl+fNcimmjBjDcSS7VRzg3R0LaJemWGTOtGitMnicQaURSd/MThle3oEiElZPMBhWJAKjl/A6zt1Xhq16WPXy2GlG/l/NI8kVb18vK8WjZ8+gtl7r4tytZNOooiiEYEP/v+BM+8YLHv4MJVWf3QsXDlpChIx8U+0R/22BA+9MI0oHp5WwPu/akmrr0ziaIIHvt6nuETNvVqwOZr46zdGmVm3CHTovPktwu4zvIzaaZZ45rbk3z7szMce7lKLKnyHz+xig1XxRjtt9F0wegpm0e+moMg7LMFePsvtvDdL2R57sECEBaqiNnc3MARi0fvyyEE/K9vbqB9lcHJg+eOrBixWcrN2cKoZSHBqYdGRVHFZZ1wmnqi9F6dJvAk+x+ZWjKsWsk59L9c4Pq3d9KzLUWyyVhgTAMfsqN1Vl2VpmtLijXXZhjcX8R3F/4GSxnSHwdohsL1b+/E9yRD+4v07cotMsSBL9n19TFueX8PmY4IV72+lYOPTi1psF/4xuiSbTnDB0qUZ2xaVsdoXh1b0GorA0m2L0/TxgxaRCPblw8NniKoTFSRgaQyXkXRFLa/byO16Tr5gSKqqbLxLWvQoxrHHrgwwngZSCYPzNCwJo2ZNLAK9nxh2BkRUBlIcicKbHvPBjbe20uqM0F5vIpQBJGMSSRjzmneSl9il2xW39ZJPWsxfSRHw5oUTeszSF+imSpje6aYOpRl3etXE2+NIgPID5ZIdsQv6LgvBt/8q8EVES3ZVYVovAXPsxCIOZ74BRAKhpFY+rPzYEXGNJMRNDUpDA76XH21ztS0T30F0dpaaQLXWZjQtesFjEiKamGUxrbNJDJdxDPd+J6DqpmzjEivPsJKxYVP02m+3n+LOH7S5Z++WOZPfr+BaCT0Tjeu0/nFn07ysT/KLcgNuKMLm+mdSjU0oEEQ8uBeZkMKcHRPjeN7a9TKPmP9Nr4nyU25DJ+w2LgzRsdqk7F+m+x5cqORuIpQBIWZkFezXvEpZj0aWjRG+23qlYDcpIt3lkFu6jAYOlafK6oLHIk+WxY/ctLGnRUAqFcCzAtpP5o10ueiaju9gfIKUa8lm02aemIomsLrfqWXW97XvfR2TQaqJoimdcz4QvED1/Z56f5x1t/YSO/OND/5X7cwsKfA0aey9L2QxSr/eBrR02jsjpJuM3FqPiNHyosWAadhVzyG9pdo6onS3BMl3jBfCHYm+p5fWlWkXnbnxjZm7w/pS2aO5imNVKhlLU4+MoRX95k+nMVMm3PFQgDVqRpHHziJmTBwax7V6RonHx2aKxoqDpXw3YBj3+3HLjvkTpVAwPieKSqTNQ58+RhWyWH3pw5QHq9y7Dun0EwVz/Zxqi5u3cMq2HiWR+D67P7UAUqjZY588wRSwtjLU9TzFk7F5fA3ToCUsxXKwexioMDhb5zAqbg4VZficJk9nzuMZ/tYBQsk5AdK9D04gKIJ7LKDU/UwEjpO2UUIeOlTy5PlXwz2PLIyp8MwUzS1b8WxSqiaSW7qGEYkiQwCzEiaWmUaIcIiUS9bI5ZoQygq1fIEwQXYoRWqxoRC14qA7dt19u51uVR+3DP5LyVhr6pTzzM1GHLv+q9yiPc0YjFBPLZw0swXfrwnjnNBSvjCV8u8+21xbrnRRIiQwOGeO6K84a4o33rw3AZS2g7u5GxO7BWgUxs4UufwC5UF7UeuLRnus2h/bYrN18V59Ks5qsVz/wa5SRffl6zfHmV61KGp3WDN1ij3f3qeTWupFojje6vc+fYGvvzXEyAEZkTgza7ol8vBnAunqwuFKjCiy4tEC8CYNWD+bOvF5YIZU4kkw7x/z/b0BX1H05W5thcIW0dOvpTnyx8/yJ0/28v6GxtoXhVl290tlKZtDj0+za77RilO/mie0/Mh3WogRLi4Kc8sPyFKoDBpIYRAj6jE0ksb0+XoC2Uwv/g+c21kl5y5Vpjy2LwjUZ1e6IUEvqQ8WqXM/DaV8cWVpKWRML9uE45ZnSXscirhsWb7CuFxDi1m5nKr4Ta+L+e2y51cnELKnSgs/m7NY+bYPEVspe5RmVg4ZwRuQL5/4XhOef6aZ48vHvfVhJQ+qmoSS3Xgu3U0PUIs0YptFYkmmqlVp/A9F02LYERSaHqEcmF4TtDlfFiRMS2VJKdOuVx3ncGePc6KKp1UPUrPpntIN69DCMHMyNI9UuXsAJnmdaza+gY8p8bM6AEqy4RDXykYOvR0aTQ2LDSmQyOXUVD0R4BKVfJf/yzH97/WgaaFIczeHo13vy3B87ttJqbOs1h4BYzo+TB8wuLaO5IoCkwMnb/X16oFfO2Tk/zkh1r5yQ+1YdUDvvY3UwyfsGlqX57T+XN/Ns4Hf7ud/3X/BmQg2PVwke9+fnFBzYWiOBFOupouSDYZZIeXCeGIkHIQwLF86sWV5aOFwrLsfUIIhBAUJiwe/8wAUxfAGjR6uLwovOk5AcefyzF0sEzvVWlu/MlONt3aRNeWJG3r4rzmPV08/LeneO6roys69lcDcxqXS0SazoY84/5eTlHoci52ruDC0bsjwaqtcQ4+VSA3trKFmxFVeM3bWrAqBiOHXFRVw/cckplVmNE0rl3Bcy2SmVXY9TzxVAeWVcCIpEk1apTyg/je+XOa5zWmqibo2Z4i1WIweKDEiZM2J0/VkQF0bU4wejQUtT4twjBH7CNh+OjDczdw4NUZOf492tqTJLoE+bEKhdnJuzAZCoz3vfRlJAHDR7+PnB3pdO8UZ4x75sr5zL8vF9as1rn9NRHEGUvMiUmfw8d/vNovLgbPvmDz1fsrfOAnEwgRhnvvui3CG++J8vkvV34kYij/6zcGZlf2iz/zZ2lSj+2tMT260LOolQN+6yeOLWqBHTxm8VcfHUYR4QQazI5dGJPc/9cV6nLxij877vLJ/zIcGidEGM4O4C9/exACgUkEG4vfff+JCyLvON1XakRVWtbEGNi7dBGZogg6NiTDkHTRozCxskIEM6YtK4rs2T6e7aOogtGjZU7tLlx0IEkGUC+6HHl6hqPPzNDYGeWGd3Zy6/t7SLWYvOUjG3BqPru/88oVeFwMTnuXQoVoavnFlABiGR0pQwIKq/pve+H8auCCBdDntlcuWtt252sbefO/7+Fvfu0I+Ql7QXSpc0OMj/3LDp5/YJqv/c/+uZTMacRSGh/8g/UMHa7wP9793JkHNPc8CHG6b1dSKY6F/xeGFzBRnQ/nNaaaodDQGeH4czkURbD1jmasqk92uEbXliRjx6v0XpWibV2c/LhFssnAqvoUJiyauqMUJ21kIOnakmRmsEa6GQ6/WOOa2xPUKyG5dH7ao63HYOCoRbJBpbndYGbcQUqYGXfp2WBiRhRKeY9KIWD9jginjlhEogpda0369tcYPHZ5wkyNGYW3vynO3bdF5424lDzw/SreMvmWf0uQEv7gf+a593UxGjMqQkBLk8q7fiLO8y/ZHO179RcMy7W5GBHBum1RGtp0dn2/iL0EV/JyXBKtwSrSooljwR5AoqIRJUFKNlGX/agoBARIQnFrgYAA/CDAJEpUxCmRJfADdHRMYjjYSD/cGpibGBTUkGD+DFrxk7vzBL4kmtRZc3WG3d+eWLICWTMVNt3aCFJSnLYXeI++N18xEk1pS1YFN3VH0c2lc7jVgkthwqZ5VZSG9giKKpZkKVoRZlmPsiN1Hvq/J3nxW2N8+As3kGgyuOFdnRdoTMW5uPAvKyZOVrEqPpqh0L4uvjSNJ2E4vmdbCimhmnMoTb2KYWsh0JKROe3cwPWRzuU15qrQEEKdM4BSBmfo3a4cUS3NzqZ7GSzvZbx2fgm8hN7EzR0f4FDuMcYqKy8oFYpAUcWS9QeKEraVGRGVpX5gMctPHkYbzvhs9s9kyxoqM4Ok2tZRnjqFlAFmvBEtkqCWH71gToTzGlOn7jNyqMS2O5sRKkyeqjF2rELgBRhRFT2isPHmRnJjdVpWRSlM2hSnbNZdl+H4rhzZ4Tq3/VQP5axNy+ooDc0u19yRYGLQoX2VQb0aUC3PF3X0borw7EMl7nhrhplxF8+VtHYanDpSZ+CIxW0/keblpyrUKwFv/4VmpsfCvNhyxlRVQ5m15aAqYWFRNCpobVb5d+9L8is/k5wjOACYmg74x8+XV0bYIASGIYhFL27WcD35immLjo77fOJvi/zBf26YK6q689Yor7szyuCw92NB8G9EBHe9o4Gb783w7PcKHH15ZQxEcZECBBo6JhHalFUEeHjSp0G00CjaKMocWTlOi+jEIIIqNApyBoMIzaIDDZ2izNKotKGiUg4KtIkeDCIoQqEocygIGkQbLjbjwQDOLAF8bqTOqZfzrL+hkdU7M6y7voGTL+UXGFRVF+x4XRsdG5PUii4nX8wvYOCp5N25fG3P9hRHn1pYcKFogg2vaSSWXtrjyo1ZjB4t07wqys43tjG4v8jM0NLhZkUNDdwiYyvCBbW3THgzO1xnYE+RHa9vIZbSlzVWEIaLfS9A1QTxtHHObS8XfDfgwKNT3PCODnqvztDcE1vc9ytgzdUZurYksas+J17MXxC94uWC2ZZi+yd/nsqxMZBQ2jvA9CMH8IqX3osvUEgaLXQnttFgdqIpJl7gUHKmOFZ4Gse/OMYwKQPqXvGSDPLlhLiEIr5YpgO7ViDR1IOiaJSzgyTb1qFoBroZp5IdwrPPf53Oa0wVTZBoNKjkHFw7IJLQaFsbo5ILqyVTLSYnd+fRdJWxbAVFDXlEx45XaOiMIhTB4L4iZkJjeLiG1a0weNxi7dYoIydtKkWfWjkACekmjeE+m9WbTAaO1hGKoKFFIz/jUc77+J6k/4jF5mtiDJ+wOfxSFVUXDPctHxq76ToTdZn6D0WE5PDNTQpbNujccUuUro6FlySX9/nrfyxyot9d0XOvqnD37RHS6Yv7kffud3juJQv7FVggBwF8/itl3v6mGNdfE+brIqbgZ96XYNdLFrv3OT9y7WvHkjz85RwPf3np6slzIUIMENjUaBYdGJhMBkMoqDQorVhBjQLTxEWaglTRiVCSOaqyzGplExPBECoaMzJsYSoGMzSLrrBYCJOCnMGVFp3KWkoyR02WsLEWeKaBJ3nic4N0bEjQujbG3b+4Gs0UTA/W8d0AM6bSvTXFWz+6gcCXDB8qsf/7C+Xfhg6UcKo+Zkzl7l/opTTtUJ4OK52NmErX5iRX39uGEVOXzAfmx+oc/uE0vVen2XpXM4VJm5e/M05xysZzglBH2FCIJLUwijRlM3K4tKDi1YypXP+2DkYOl6nmHayqj+8GKEpYWNXYHaVnR4rAk0yerJ7TOPqeZHqgRuuaOL1Xp+nclKQ4YREEElVX0HRBYfL86iFneihh+9I5Uj0SnvrCUFg4tTrG636llye/OExp2ibwAvSISsuqGG//LxuREsb7Kux98FUOVUuoD81w7ONfJbqqiba3Xkust4XSviHMjgzS9dEbQh1fZ6aMW6hhNCXC9yTY43m88tJzYNpsY2PmFgQqY9UjWH6FiJokZbQSXABF6XKw/DL7sg9d9Pd/nCAUDTPRiFB0tGgSI5ZGN+PUy2HNhKpHLo8x9V1J/57i/A17xmry6X8JqcOmB2qLbujpgfpZMenw84lQQIaZ8YXVZmMD9vIKK2eg/4jFwFELKcOWhXNtK4Tgw798YVWMZ0NKGB33+MJXy/zzl8srKrYC0DXBe9+e4L1vX1qY/Hz4m38qsu+Qg/0KFTxk8wF//Q8lPvk/DdLpMCqwY6vJB34yQd+pPMXSj947vVhkRAs1WcLBpkV0UZDTxEUKicTApEnpACkRZ8QaoyKOgoqDhSRAFSoxmcTBJioSREQMU4ZMVB4OARIPD4FCWrQwKQcXGFMpoW9Xnqe/NMxr3tPNpluaaFuXYOJEBafmk2o16N6aRtUE/S/neezT/YuI8EcOlzj4+DQ3vLODdTc08IE/2cbQ/uLs9016tqfIDteZPFWlY/3i+0wGcPiJGdJtEW55Xze3vj88jtFjZayyi6IKYmmdxu4ozT0xfvCpfsaPV/Dd+fMwExrv/N3NFCctxvsqFCYs7KqPqiskmw16r8mQaTUZOVJm19fOXYAU+JLnvz7KvR9eT++1Gd718U2MHC7PRbk0U+W+PzqygKxcKNDSG6dzUwJNV9AMhVhGnzWogu6tKW5+XzeeHeC5AbWiy9CBErXCvMc03lfhof97knt+uZer39xO+4YEI4fLODWfZLPB+hsbSLaYDB8o8cjfnyI3eunELBeF2RVC4Phzc2HzPdtRDBWvbCMUKB8eQTF1Gm/diNBUtLiJNV5g5gcHCayFXqKuRGmPbUQROsfyT5G3w1wgLMxf6kqEBrOTqleg6uYWfL81uoacPUrdC3P+ETVB2uxAV0Kmrrw9tuA74diCqJYmabSgCg3br+IFS1dSm2qcpNGCqcQICL3doj2xolzspaKaG6E8M4AQKoFnoxkx6qUpAt8l8Fw858IiBCuQYDv9x3k+X/DmeT5f7vuXcduVQkqoVANeeNnmvm9XeOChGtlXSMHlRwnPgyeerfOdh6v81LuTcyv8978zwWNP1Xnw0fqKVHJ+nFCnQkUW8fEQCEoyR0o04uMxI8cBiUBFBgH+rAEUKCgoTAdjuNiUZQGVMMfk41OWOQQi9EqxCQioyRIaOjk5TpQEVUrYzD94Tt3nyS8MUZyy2XpnMx0bk6y7vgFVC4m/hYDCuMV3/vLEkvy9gSd59B/6qRYcNt3SRPOqGO3r4/iupDBhceKFPLvuG+Xqe9toXb005WSt6PLcV4bJj9XZcmczXZuTbL61CSOqIAOwKh6FSZuDj00xsLeI5y780Z2qz4vfGqNzY4LurSk23NSIqoek6lbFIz9uceSJGfY/MsnJ3fklj+E0ZAAvfWucSEJjy50ttG9IsHpnmsAHq+IyM1SfLQCbh6opbL2jmdd9aA26ERrTMyttN97SxIabG0PlFztg8lSVb/zxUYbOMKaBL9n70CT1ksvON7ax6qo01721A00X2DWf7EidfQ9Pse/7k/S/XDjnObwiEGA0JWh/5/WoUQN7ooA1Mm+g1IjByOefRno+QldpvHUjye09lPYMICM66evWkHvm2CJjGtWSZMwOZqxBSs4UZ06WZxYCRdUka1M3MFY7usAwxrQUWxvv5kD2kTljqgiNmJYiZbTSHO2lL/8MVTe/YOyE3sza9PWYagLHryEJcAN7weI1HD/NquROYnoDQeCiCA1dMRmrHmW4cnl7Us+F8nRIiFGaODf/+flw+bjL/o3C8yW1mqRcCRgc9jh8zOHFPTYv7bU52e9h2f92PbTzIZsP+NdvVLj5hghre8O8W1Ojykd/LcMLu22ms/82rWlRzucWT4dqT/+/FBwsSjKLxXwurShn5v52pU2JxQ3iRZmlQbQCAg+XYIlKxXrJ48X7xzjxQp7GzgjR1Kwa0b1tbH9tK5qpLluNC1CYsHjsUwMcenyaVLOJHlHwPUmt4DI1UKM8Y2PXPIYOFJft9ayVPPZ8b4L+PQUaOiPEMwaaoQAh8Xet4JKfsChP24typlbV43t/dYLGziixjI4RVVE1QRBIXCugmneYHqydkzLxTFQLLj/83CBHnsqSajHQTRUZSJy6TzXvLpLQ8r2AY89kl2RvWgp2NTSOZ8NzAg4/OcPIkTItq2Nz3q1nB5SzDlP9VeqlpcOeBx+bZmaojqKJBZR/Z+MHnxrghW+OzQoJXNDhhpChN2qN5vFrNtZIDjc/H1asD80gZ4UlhCJQYyZeqY41mscazVPcM4BfXXx9dCWCoUSou2FuUxU6GzO3oishpet0fYCJ2soMSM0rMljeR9poJW22L/pcEybtsfVEtCSDpb2UnCkMJcLa9I2cWXWmCp222HrieiMjlYOUnRlUodGTvIq16Rsp2OOU3ZlF45sxlXhaX9D7HU2GZkwzFGJpbVH70unPX2lc8F42rtP5pZ9OsmG9Trkc8C/3VfjBk3VcD952b4w33B1lbMLnTz5RAGD7Fp13/USc1as0fvvjWUpLEOJfKDrbVTRNMDbh4Z0jzP/yfodf+s1pYrGlJ6dMSqG1RWVoZN5IShl6aa4nqVYDCqWQRvDM4p/eVRq/8MEkf/wXeZxl+r5f2uvwgV+exFyBmOzZUJMpkldfi9m9iolagFy/F/bsXbJkNVcI+P0/yfOJv5v3aGZWaPx8P2yVef8vTZFIzB+350GpPD+W3tJKdN16SrueXXasSjXgTz+R59NfmKfhGhnzqVTDccyuHtzsDIG1cKITmkbqxpupHDqAXyys6PgvF3JyEp+V548cbHJyAhUNDw+PpW8O35XMDNYW0PRND9XYcFMj8QadN//mer70sQMUJmwUodGS3kAi0ookYDS3D8+ysIe6OLj/CACKUGlM9NKSuIrm1oCJ4UNUhn1aM9tZ2y7IlQcw9SSJaAsgKNXGqVlZUu465LDO6LERcuUBQBCPNBM32ykUjy59khLKM84c4UG8M0nL1R1M7h6lPlVl3Tu3EleLVHdfeI+pXfUZ2r90q1Dj9jbi7QmGHw3zQTIIw7TjfSsTjl7yVAIoTtorJpiYOFG9INH2vl0rz++fhleuU3h+aSk5eUbRWuD6uPkqgeVSOT6OV6yhxAykt/jZV4Qacn7PFQlJPBnmpHsSO7D92oqNKUgC6eEG9pLhRkONkjE7KdmTTNf78aVLDZio9dEcXT23nanGaYz0UHKmmK71z6VIRiuH6E5sozm6eklj+rYPr+J1P9u5cJ+RMJyx9dYMv/63WxYd1oUKIlwqLtiYDg67fOGrFT7080ke+WGdZ16wcGfnnyeetZDAT75lnofxxCmPb3ynxp//UeNsxejFG9MbrzVRFHjwUX+OlWYpFEsBew8uz3Jy1TaDNb06L+93KBQv3PDEYoItG/SQ9k1VMHt68KtVvOn5pv5iKWD3vvNTThkdHbjZLPJsqywE8W0dmIc0yv98P0AoFr5MrNV1uSxtLLW6ZP/hcx+3l8tRqe495za+D32nPPpOLW2UkjfdTOGJxxYZU+l5lPe+vOj9C0XSaGVb8+uxvDKWV2K4vH9RDud8WM4Inh8SFwf3Ir4/drTME58f4o2/tpbVO9O843c2883/cYRqVkHXouQqA1StGVy/jq5GaUj2MlkIjakQKpoWpVQbo1gdQwiF9Z130z/xNJ5vE0ifijWFlD4RI0WuPEDMbAABE/mDrO+8m1JtAikDmlLrMLQY+coQrn9+UgctohNrS6Ka4dQR70jiFC9flVzxRJbywLnDxf+/RiCpHB0l0t3I2t9+EygKxZdOMv39AwT2WfPBLLvc6fCqLz1OFXejCJWexI5X5PBUoWGoEWyrtqDSt+LmFuRBNcUgpqVJG210xOZ1bYUI29QiWnLJ8dt6o8vuO9mok2xcvpf4lcYFG1PbCUWlyxXJ9Oz/p1EuB+TOyitatiSbW2j8FCWsrv3guxP8+seydLar/PLPJPnmd2ukkoL/9OEGEnGBbUv+48ezDAx73HtPjI/+eppoVPCLP53iO9+v8k9fKuP78If/uYGxCZ9774mSywf8zT+VaGtR+KV/lySVUikWA375t2coFHxuuNbk9z7SwNpenbe+IcYTz1p86gsl2ttU/utHGshkVIZHXH7vT/OMT/is7tH4jV9JsWOLyZE+h1hUAQHJG2/Ey+VC4WxNQ43HEYqCX66gZdJI18UrhiowRmsrXqWCdF20hgb8ahWjsxOhavj1Ol524cpL6AbS93HzuQXeqNbYROu73sPYp/8eYZokdl6D2dFJUK9jdvdQO36M6Np1BLbN9De+Sua2O9EaG0FRCWo1tIYGcg8/SKR3DclrrgPAKxSY+dbXCSwLc9VqIqvXoDc2YrS1Uz/RR/6JxyAISF57PYlrrsOdmWbm/q8DkLrpZmKbtyBUDS3TQPnF5yk89UPUZJLMXfdgdvUgHYfCU4/jTk+TufNu4tt3YLS04lcrlF98ntqxI+jNLaRuupnI2nVMfeVLuFNTczdKfNsO0jffhnQdyntfpn6yj8ztd6FEomgNDQhVZfrrX0OUBDUnz6Hso3Qnt9NgdlH3igTyx5v6MfDhsX8aYNWOFFvuaGbrXc1oxlYe/MthtFKERLQ1FHkoDwCzXsYZ0FSTiJFCSomhxShUh6nb+QUTlhfY+IGLH4TGLpA+nu+gqiZSBqiKQcRIUqyOkoi2kK8MrvxEBKAIWnZ20H5zNwf+/kVaru0gtbqB4R+cpOvONTRvbyPemURPGOz7v7soDebZ9IGdxDuTRFsTjD5+ipPfOkL7a3pY85bNTO8d48jn9qBGNDpvW03nratRIxq+5XHwUy9SHSuz9eevJdGdJt6RwK26HPzHFyn0XV6BiFcL9lSRo7/7lSU/G/vKc4s8QDdfY+KbLzH5wMsASD9Auovvd196BEg0xTzjPYdAXqiYwsV4dAKWIHOQZ8W9Txv4mfogM9bZ952czcPO47n7pzj58srJ589E/SJVii4Ur3rOVFPDnk4IjatpClQFfuGnUvyffyjy9K46miawHYnnwf3fq9LWohAE8C9fr1CrS6QMW08yKYXmJpX3/dIk7ixTTjql8ORzFq4L//k30rzvHXH+9jMldr1k82d/XeAnXh/lf/9NkVw+wNDhHz/Rwn/8eJaZnM973p7gI7+a4WN/lOXe10aZmvZ5159N8PM/lWT9bE7RnZggsm49lZd3ozc1EV23HmHoSM8jqNYweropPv440Y0bEYpKvLEBZ2wMoevUT54EoaC1tpBYtYr8ww8T1Ga9ASmxR4aIbdhIy7veS2nXM9hjo+D7CEVBGOEDIYRAqCqKbuBXqxSffZqGu+9h/POfpePnfhElEgVVxRkfQ5gm0nWRnouaSFI7epjK3vABbHzt64lv2UZ5z26EomB291De/SIzD9wf9mzNGvPyyy/h5nMkr7tx7jcsPf8cpRd2oTU00vaeD1De8xIAfq1G/rFHkY5NbONmIl09OOPjzHzrG5id3Ux/46u4M9Nzk4M7M03uBw/Tkno3Z1aeaJkG0rfezsTnP4Maj5O45jqk52F2dlPa/QKV+/eSuv4G0rfdgfO9p5BIFKGiKyZuYCFlwNr0TWQiHWjCYKY+yKni80S0FGvS1xHTGnH8GicLu6h5eTY23E7SaEYRKlO1kwyW9qArEWJaGsevY/nlc1YXmmoCAdh+dUVViJ4d8KWPHeTn/89O1lyTCRVkaj4GAoGCKpbn9AUQqChCRVUNXK9+3j03JdfS2XQ1/RPP4AcOsUgjiUgLQkLVzl2wMW3Y3Ezn7avxLY94V4rC8SxCFShGeLyKqqDoCkJTaL2mg0P/tBuv7nLz/3gDU3vGSK9pQIvpvPg/fsi6d20jfzyLW3HmQrvpNfNyWmY6QmW0xOHPvszWX7yWVG8GK1ej89bVPP5r3ybRlWbTT111mQ3p6X6bWQNwdquCEAihhJzip6tjxWmJtNO5TZXTDG4hbZsy1wspz6b7kiwqHpr7aAkjCSA9fy6PuhycoIbllUjojehKBDdYhlcYSTBLXnJme0RUS7JSgxr2cjtoirmAISmiJRcUIPnSxQ3q1P0i49Vj52VGmuyvM9n/46mBfRo/8gKk05f3S1+v8NFfT3PTdQbf+G6NE6fmby4pQ1rYWYKQOdiu5OnnrTkpOCHghmtM3vUTcVQNNqzV+cGT9TPGCQ3x6Xu5d5XOul6Nv/vLZgI/JDR/aa9DMq4QjysMjnhUqpLnXrS469Zo2NM1PIxXKpG4+hrqJ/rwyyX8ep1I7xqEpuMXSwhVRW9pJajVCCwbhKDe14dfrYIA68QJhFBCfdDafGjNnZ5i+v77iG3YROMb3kzt6CFKzz/H4hD5bNimWsErFnHzoacc1OsoERN8DzefR4lGwzCPpiM0ldjGzUQ3bER6HnpTM26xeMa+J/Fy2VAZ5uwfaYnciBKJ0PjGNzPzvW/jV8J8lhqLk3rNLehNTajRGF6hGK6Yzrj+i8aSctHpmZ2dOOPjBLUa0naQto2WyeDXqtgjw+B72BPjxDZuwRUKjdEermt7B0V7gunaXiSS4fI+hsp7UVC4oeO9nCo+j6GEv+HR7GNYfnUuDNVffAlJgKFE2Nb8BgZLe4hpGeJaAxnDCMv/vTxxrQFfelh+mbjWgBPUsf0qujDwpIsQKkmtCU3RKbvT6EoEBZVA+tT8pXOE9ZLHP//2fm7/4CoOPzlNfsIh0mBTrk9SsaaR0g9pH4WKpkaQMggrjAMHyylSqI4QMxtob9hOttyPlD5+4C7yBACy5VPkyoP0tt1MtnSSTKybifwhgsBHU010LYbrnT/Umz86w75P7qIyXOSqX71pvv3tTJk+RUH6kkJfji0/ey0yCOj72oFwwVBxEEKw8zdvoTxYoDR4hhdy1r3gVh18x0f6AV7FQdFUpCfJHpzk2o/ejld3GXio77zHfMEQConWXqLN3UwfegqhaTT0XkVp5CieFeZNG9dfR6JtDZ5tUc+OoOgm8dZVBJ7LzOFnEKpG64678KwKlYlTVKeGaFi7k3hLDzIIKA0doTR6FN8NIwZCKIt/r9P8rEiEol4wC8+ZqHslctYIXYmt5O0xZqwhpAxQxMJp35MuTlAjrmeIqAmcoI4iVNrPCL8uODQEyuziQYiwCj4svpO4vk3ZmSFltJA0Wqi6OQQK7bF1C8aw/Rp5a5y00UHabKPszCCRc4tIJ7DCc0dBExoSiSc9Lmf7xqXQGy6FV9eYSvD80DtVBCQTShg+BZ54us4Luy3e+sY4f/vnzfzOf8/x/O7T4alwTj6b5EJKsM+Q0mpuVHj32+L887+Wee4lm9//aGbhAnDuoQ//d1zJ1LTPz3xoaq5yVVUhFg2rFQ09bF8wTHE6eoG5enUYsi2XkL6P1tSEGgTYI8OoiZDv1iuXqR46iNndTVCp4FerxHbswDpxMjQQvj/3/wIoCtJ1qR46gFcskLn7Hsq7X0L6PkINiwmEqqFGo2eckGTh/TD7EJ5eMZw+Z1UjecNNTH7xc/jVGk33vnnhtfSDMEd7ARCGSfqW26kdOYQ9OjJ37GZ3D1oqxdTXvkxs0xYiPfMFB8gAoVxYeClwHISuhz+Ups5dF+l5nF0mKWVArj7EUHkvzdE1GGoUSUBv+vpwjS0lujABQcWdYap2kp7UTtzAYqR8EF96rG+4GT+wEWhoijF7DSW2X6bk1IloSZJ6C5KAlN7MlDVAXGug6EyFTfBagkAGJGhAV6NkjHZKziSdsU2UnRymGmOkdphALp1PruZdHvpk6JWpiomiaLQ3bMPzbUayL+MHLpoaZU3brVhuicn8IRSh0pLeSCbew1h+PzU7T2/bLfi+w1TxKJX6FJ7v4HrhYtIPXByvRt3OU6lNkYx1oKkmo1N7URWNdLwHXY1ekDE9G1JKnLKNkYqQ6EmT6EqhJ0K1Fj1pMPbMIMVTOZASRVdQNAW37jL86EmckhWKWguINscxG6LoSZNoazx8X7KYkEIRGGmT/u8cpzYZ9qnOiWlfIlTdJNm5PtS1TDTg21WMRCNCOT1VCvRIknz/PjyrSrJjPYHnkD+5h+r0MIFrk2hfS31mlOyJF+m66a2Ux/qYPvQU/oYbkK6DXyoST3ZQyg8BkliqE6syTRC4IARSBkTjzQSBj2OVaGzbTG6Wvzw0quIMAxt6vcrp16e938DHlx6TtRMkjCY2ZG6hzVmP7VcxtSRuYIVFRIDtV8hZI6xK7kQVOnWvTEJvnE0tzF9TgUJMDxeZCb0RVTFIGW20xut4vkXZmcEOqkzVTrKx4VY2ZG6h6EwRUWPo6sJcpxtYjNeOhceWvoWSM4kvXQw1RlJvYc/0A7iBTUZvo8noouoXyDnjBNJHEQpu4KAIBQUVIQRuYBPgowkDVWh40iWQHroSCRef0iOQProSIZA+vnRpMrqo+2XqQQVfephKeIxOYF2Ukb1gY5pOKVy9w6C7S2XndpPBEY+xcZ9AwnVXm2zbrNPcpHLNDoPhUY9YTGH7ZoNMWuX6nSYDwy7HT3rMZH10XfD6u0K2oeamcIK96ToTXReMTnjsPeAsEOWenPLZud3g9tdEOHbCZXB46UkpkCFjUe9qHVUVbNlocPDofHFIebZC9Y6bIxw66jI67nH0hMu73hrnyPGQ0WlswqN/0GN41OeqrQavvT3C9i0Ghh4aKevkydDi+j5aUzP20BDWqVnh3jPCQc7wMM7IyNxrq78fpMSdClluakfO4qdUVYyWVrRMA9JzMdraccbHkb6PX60SOE6Yp1RUtMZmVrpCE6pKUK5gdHSB76E3t+Dmz1/oYXZ1Y7R1oCYSmF3duPkc8a3b0ZtbsEeGiaxajVcq4RXys8ZOElnVi9nVjWLO52qciXFi6zZgRaJ4uRn8SgU1kcBoa0eNxzE7OhGAMzmBMzoKO68jtmkzwjDCh2VqaqFxPgtlZ4a02UEm0knZmcZU44xVDiOlpC2xIbzEQiMgYKp2kvb4Jkw1PuuRxhisHEVTTNKRtvB6CYGuRFGFjhPUialJVBHB8qs4fo2U3kJCb6DsToMU6IpJ3SvTYHZR84oEMsCXATlnhAajK9z3Msb0TPiBzeDUYgX6vae+vOD1aHYvo9m9c69rVhYQs4Td4X1eqo1xOstUs7PU7DAUOjgdjl+YDesGvsdM6cK8O7fqUB4q4NVDr77Un6c+XaU8XKB4KkfvvRvwLI/80WnMTBTpBTRuaSGzsYn02kaOfGEPmqmhqAodt64i2hxjZv8EIz8coP2mHuLt4YK089bVjD0zRG2qglDDuaAyUqKerZHoSuGWHVqv6wwl7pImx/51H5XhS8upAahGBCPZQGVykGhTF5WxxdWuQlGINXbhObUwcqBqxJp7UHST8mi4vR5Pk2hfi1spLFg0x1PtOL6GXQufPVXRMaNpnHqBWKoNIRQcuxLqbEqJbsSIpzux6wU0LUIpP4gZzaAbcex6Ad+zicSbZo29JPA9ND1KMXsSpKTq5Tmef5a22FpSRhumGsf1a/QVdpGdzVUG0me8egw/cGmIdBHT0xTscUarR9jSeCeWPxt5EjpNZg9N0VUAFOxxNMWgI7YRKX2GKwexrSo5e4Rj+adpi60jrqUpO1mOF55lc8PtWN48WU/JmeJo7oe0xtaR1JvDcw/qDFcO4AY2mjCIq2nGrRME0kcTOo1mL7rQqfllVKGioIEQVP0CZXeGJqObmJrCCipknTF6olup+0XKXh4nsGgze5EEFNxJGvROomqFvDOGBNrMNfjSpeRlybkrV0C6YGOaTIRyXf2DHumUQkebxvikjwhg22adREJh916brZsNKtWA5iaV3lUaTz5bZ/1aHSHg+EmPkXGPr95fYed2k+FRj+8+XGc663PTdRHWrtYIJOw9aPP0rvn4/q7dFqmUwrZNBtWaZHjUQwbwzPMWJwfmJ6hsLuCB79e4ZodJOqnzxa9VcM+gRusf8njmeZstG3XqdcnouMef/GWBd7w5xg3XmLiuJJf3CQJ44pk6mgY7thqcOOVRr1fxTq98Zx8Ov1QiqJ+xkl8qhLncZ0tAMU3Mzi4QgqBeo/zSC0g3XAzkH38Us7sHv1KmdvQQQtPwCnn8apVa3zHwPaqHD+HXa1ijw/ilEmI2/OpXynjFIuW9uzHa2pGeS+mFXQSz8XGvVMIeGZ57PQchMFrbUQwDZ3QEo60d37IgCHCmJtFbWsLtxsbwclns0RH0hobQ6E5PYVsW0glXv8Vnnya+fQdmVxeBVcevVFBicfTm1lmvPone1IwzNYlfq1J85gli6zcifZ/6yRM4U5NoqRTBrBq9Xy5RO3oYx68xUx8kkB65+hARLYXtVchbI8T1RrzAZrC4BwBVGKSMViSSnDU0yy3qkbeGSRrNeIHLSPkQILH9GroSerlVr4DlV0lojSGdvfSouFl8GTIg+dJFkQpRLUXVy4fN52qUkjNFIH3qfrifVx7yvDJjl4raZIXa5HybysCD88bm2BcXyio2bG4BAfljM/iujx7TUQ2VWFsCK1ejcCJHsieN7/ggJf3fWdyeU5+a39fokwMAtN/UjWf7ZA9Nopoa6TUNFxz1OCeEwEy3IIMAPZpAKCpCXVwdKqXErZdw6xXMdAuKquLWSjjl3Fx0R48lSbT2Ui9MIs+g7atVppF2Fd1MoKg6QeATjTfh1PMkMj2hcLUehvPjyTY8uzqXa000rMK2iiQbVuHaVaLJNly7TCLTQzk3SFPHdnKTR0g29FAtjuK54bNi+SUGy3vPeepuYDFaPcxodeEif//MPGWgJ22GKvsYqiwtn3kagfTJWkNkrYXSmftnvr9o26pXoL+0e8lxxGztgBAKjXo7phLDlRYlL0tCawAJOXccV1q0Gb24gYWhRKl4eSJqHFWoaEJn1DqOQBBXG6j6BSJqAgWVul8i64xSC4qsju7ADqpYQY2IGoeLaJQQ8hxP36WQB1/BFfy/jKXkpxqMDkBgqFHy9hhO8ONdMPFKQ41oNO9oQ4vqgMCzXaZfHiPSGKVxS2soc+dLCn0z1KfPzet7JvS4Tuv13WFxjwA7Xyd3eOqSw7xC1WjfeQ/FocMgBNGGDurZEZo2vQarOIVv1ygMHqJ1662gqHj1MopmoOhhasAuzVAZO4GZaSHW2E1+YB8tW25l+vDTuLUijRtuQATg5qdpbN/K6MknAUHn2luplSYQqk45N4gRSaKoGoaZBgIi8WaGjj5CS/c1VArDxFMdYQ7RqePYZcxomuLMSbrX38Xw8cdo6b6awtRxHHuxQPi/JShoNBldGEoUXZh4OGhCx5MuVa9AWmtmyhkmkC7t5jom7FO0mD0I1JAa0c/THd3CiepLKKh0RjZgKnE86VJ0JzHVOAoKRW+amJoio7dS88uUvSxlb/mCtuVM5hVjegVXcJmgoGKoUQIZ4AQrzz1ewY8YQhBt7KSeC3t3tWgS6bsYyaa5IqF6bgwz0YgaiYW1D14YeVHNONL3sIrTKKqKakSxyzki6RbcWgnfqWMkGsLin0Ciqjq1yhSKohFNtOB7NoHv4bk1FCUMXQaBj2EmEEKhVp7EjGbwnBqqHkXTI7hOlcBzUTQ99FQTLdQrU5jRDK5duSQi+x8X6CJCVE0gpcSWNXRhIlBwZB1N6NhBHSkDImqcul8mosRRhYErbdzAJqomqPoFQBBVE+jCxJceTlBHoGCqMWy/ho9LXM3MfebK5XunrxjTK7iCK7iCK7iCS8RyJvMyJBqu4Aqu4Aqu4Ar+/40rxvQKruAKruAKruAScc5q3le6MvAKruAKruAKruD/BVzxTK/gCq7gCq7gCi4RV4zpFVzBFVzBFVzBJeKKMb2CK7iCK7iCK7hEXDGmV3AFV3AFV3AFl4grxvQKruAKruAKruASccWYXsEVXMEVXMEVXCL+Pz82r8hKjzeCAAAAAElFTkSuQmCC\\n\",\n         \"text/plain\": \"<Figure size 1080x360 with 1 Axes>\"\n        },\n        \"metadata\": {},\n        \"output_type\": \"display_data\"\n       }\n      ]\n     }\n    },\n    \"7d1b4a63fa924fa6b136204ce1e67a42\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"DropdownModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"DropdownModel\",\n      \"_options_labels\": [\n       \"computer-vision\",\n       \"graph-learning\",\n       \"reinforcement-learning\",\n       \"natural-language-processing\",\n       \"mlops\",\n       \"time-series\"\n      ],\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"DropdownView\",\n      \"description\": \"tag\",\n      \"description_tooltip\": null,\n      \"disabled\": false,\n      \"index\": 3,\n      \"layout\": \"IPY_MODEL_53f5b6e055864bb19eadba0aa640668d\",\n      \"style\": \"IPY_MODEL_8a9678ac8f3e4af49c02181ce0eb6241\"\n     }\n    },\n    \"8a9678ac8f3e4af49c02181ce0eb6241\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"DescriptionStyleModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"DescriptionStyleModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"StyleView\",\n      \"description_width\": \"\"\n     }\n    },\n    \"8c6ffc9537344c709b47a5acea0e3075\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"9219fbb6096645dfa09149c04481bcb0\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"DropdownModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"DropdownModel\",\n      \"_options_labels\": [\n       \"natural-language-processing\",\n       \"computer-vision\",\n       \"other\",\n       \"mlops\"\n      ],\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"DropdownView\",\n      \"description\": \"tag\",\n      \"description_tooltip\": null,\n      \"disabled\": false,\n      \"index\": 3,\n      \"layout\": \"IPY_MODEL_450f4ebef68f4c1c9a04c65396b6fb82\",\n      \"style\": \"IPY_MODEL_b43be8f44a7a4f73aa84da8eb992ce14\"\n     }\n    },\n    \"9417439d5b384121868a998180f5a5ea\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"96311b6f06dd43869c9363cb18cbce18\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"a12d66d6747f4e9f99e0a06dc83a2c52\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"a23177628b624969855185844d6e2648\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"SliderStyleModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"SliderStyleModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"StyleView\",\n      \"description_width\": \"\",\n      \"handle_color\": null\n     }\n    },\n    \"af9c5bab12c64dc396c28154ea13f516\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"VBoxModel\",\n     \"state\": {\n      \"_dom_classes\": [\n       \"widget-interact\"\n      ],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"VBoxModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"VBoxView\",\n      \"box_style\": \"\",\n      \"children\": [\n       \"IPY_MODEL_7d1b4a63fa924fa6b136204ce1e67a42\",\n       \"IPY_MODEL_795b443fc1834645937b199e1214fcc3\"\n      ],\n      \"layout\": \"IPY_MODEL_ccc7456ad5484dd2b7ccdd62bbc27d0c\"\n     }\n    },\n    \"b43be8f44a7a4f73aa84da8eb992ce14\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"DescriptionStyleModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"DescriptionStyleModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"StyleView\",\n      \"description_width\": \"\"\n     }\n    },\n    \"bb704b732e3b4db78ce1ed7b3ecb43e0\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"bdea131e25c5444a9af6a2a602a48e93\": {\n     \"model_module\": \"@jupyter-widgets/output\",\n     \"model_module_version\": \"1.0.0\",\n     \"model_name\": \"OutputModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/output\",\n      \"_model_module_version\": \"1.0.0\",\n      \"_model_name\": \"OutputModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/output\",\n      \"_view_module_version\": \"1.0.0\",\n      \"_view_name\": \"OutputView\",\n      \"layout\": \"IPY_MODEL_9417439d5b384121868a998180f5a5ea\",\n      \"msg_id\": \"\",\n      \"outputs\": [\n       {\n        \"name\": \"stdout\",\n        \"output_type\": \"stream\",\n        \"text\": [\n         \"conditional image generation using variational autoencoders gans\\n\"\n        ]\n       }\n      ]\n     }\n    },\n    \"c50ab4f050a447aeb6609bfabc57f0b3\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"VBoxModel\",\n     \"state\": {\n      \"_dom_classes\": [\n       \"widget-interact\"\n      ],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"VBoxModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"VBoxView\",\n      \"box_style\": \"\",\n      \"children\": [\n       \"IPY_MODEL_9219fbb6096645dfa09149c04481bcb0\",\n       \"IPY_MODEL_0668507328804600a511d7667b8f1796\"\n      ],\n      \"layout\": \"IPY_MODEL_430cdc93d426476e8d1c361e9a8f0928\"\n     }\n    },\n    \"cbbe9c30bd8641bfa9a4fdbc8d517e63\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"CheckboxModel\",\n     \"state\": {\n      \"_dom_classes\": [],\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"CheckboxModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/controls\",\n      \"_view_module_version\": \"1.5.0\",\n      \"_view_name\": \"CheckboxView\",\n      \"description\": \"stem\",\n      \"description_tooltip\": null,\n      \"disabled\": false,\n      \"indent\": true,\n      \"layout\": \"IPY_MODEL_96311b6f06dd43869c9363cb18cbce18\",\n      \"style\": \"IPY_MODEL_e8eb942fd1c4449f814fb9b14606035b\",\n      \"value\": false\n     }\n    },\n    \"ccc7456ad5484dd2b7ccdd62bbc27d0c\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"d196e549046e436d8b1de126740c57bb\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"DescriptionStyleModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"DescriptionStyleModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"StyleView\",\n      \"description_width\": \"\"\n     }\n    },\n    \"d9d89c0ae6704406a43a3d160b5cf83a\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"e8eb942fd1c4449f814fb9b14606035b\": {\n     \"model_module\": \"@jupyter-widgets/controls\",\n     \"model_module_version\": \"1.5.0\",\n     \"model_name\": \"DescriptionStyleModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/controls\",\n      \"_model_module_version\": \"1.5.0\",\n      \"_model_name\": \"DescriptionStyleModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"StyleView\",\n      \"description_width\": \"\"\n     }\n    },\n    \"f7059f0b23a34a2692ec7c0826e1617b\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    },\n    \"ff4494a494454ca5b23c93d599e5ef41\": {\n     \"model_module\": \"@jupyter-widgets/base\",\n     \"model_module_version\": \"1.2.0\",\n     \"model_name\": \"LayoutModel\",\n     \"state\": {\n      \"_model_module\": \"@jupyter-widgets/base\",\n      \"_model_module_version\": \"1.2.0\",\n      \"_model_name\": \"LayoutModel\",\n      \"_view_count\": null,\n      \"_view_module\": \"@jupyter-widgets/base\",\n      \"_view_module_version\": \"1.2.0\",\n      \"_view_name\": \"LayoutView\",\n      \"align_content\": null,\n      \"align_items\": null,\n      \"align_self\": null,\n      \"border\": null,\n      \"bottom\": null,\n      \"display\": null,\n      \"flex\": null,\n      \"flex_flow\": null,\n      \"grid_area\": null,\n      \"grid_auto_columns\": null,\n      \"grid_auto_flow\": null,\n      \"grid_auto_rows\": null,\n      \"grid_column\": null,\n      \"grid_gap\": null,\n      \"grid_row\": null,\n      \"grid_template_areas\": null,\n      \"grid_template_columns\": null,\n      \"grid_template_rows\": null,\n      \"height\": null,\n      \"justify_content\": null,\n      \"justify_items\": null,\n      \"left\": null,\n      \"margin\": null,\n      \"max_height\": null,\n      \"max_width\": null,\n      \"min_height\": null,\n      \"min_width\": null,\n      \"object_fit\": null,\n      \"object_position\": null,\n      \"order\": null,\n      \"overflow\": null,\n      \"overflow_x\": null,\n      \"overflow_y\": null,\n      \"padding\": null,\n      \"right\": null,\n      \"top\": null,\n      \"visibility\": null,\n      \"width\": null\n     }\n    }\n   }\n  }\n },\n \"nbformat\": 4,\n \"nbformat_minor\": 4\n}\n"
  },
  {
    "path": "pyproject.toml",
    "content": "# Black formatting\n[tool.black]\nline-length = 150\ninclude = '\\.pyi?$'\nexclude = '''\n/(\n      .eggs         # exclude a few common directories in the\n    | .git          # root of the project\n    | .hg\n    | .mypy_cache\n    | .tox\n    | venv\n    | _build\n    | buck-out\n    | build\n    | dist\n  )/\n'''\n\n# iSort\n[tool.isort]\nprofile = \"black\"\nline_length = 79\nmulti_line_output = 3\ninclude_trailing_comma = true\nvirtual_env = \"venv\"\n\n[tool.flake8]\nexclude = \"venv\"\nignore = [\"E501\", \"W503\", \"E226\"]\n# E501: Line too long\n# W503: Line break occurred before binary operator\n# E226: Missing white space around arithmetic operator\n\n[tool.pyupgrade]\npy39plus = true\n\n# Pytest\n[tool.pytest.ini_options]\ntestpaths = [\"tests\"]\npython_files = \"test_*.py\"\n\n# Pytest cov\n[tool.coverage.run]\nomit=[\"madewithml/evaluate.py\", \"madewithml/serve.py\"]\n"
  },
  {
    "path": "requirements.txt",
    "content": "# Default\nhyperopt==0.2.7\nipywidgets>=8\nmatplotlib==3.7.1\nmlflow==2.3.1\nnltk==3.8.1\nnumpy==1.24.3\nnumpyencoder==0.3.0\npandas==2.0.1\npython-dotenv==1.0.0\nray[air]==2.7.0\nscikit-learn==1.2.2\nsnorkel==0.9.9\nSQLAlchemy==1.4.48\ntorch==2.0.0\ntransformers==4.28.1\n\n# Notebook\ncleanlab==2.3.1\njupyterlab==3.6.3\nlime==0.2.0.1\nseaborn==0.12.2\nwordcloud==1.9.2\n\n# Documentation\nmkdocs==1.4.2\nmkdocstrings==0.21.2\nmkdocstrings[python]>=0.18\n\n# Styling\nblack==23.3.0\nflake8==6.0.0\nFlake8-pyproject==1.2.3\nisort==5.12.0\npyupgrade==3.3.2\n\n# Testing\ngreat-expectations==0.16.5\npytest==7.3.1\npytest-cov==4.0.0\n\n# Development\nfastapi==0.95.2\npre-commit==3.2.2\ntyper==0.9.0\n\n# Deployment\nanyscale==0.5.131\n"
  },
  {
    "path": "tests/code/conftest.py",
    "content": "import pytest\n\nfrom madewithml.data import CustomPreprocessor\n\n\n@pytest.fixture\ndef dataset_loc():\n    return \"https://raw.githubusercontent.com/GokuMohandas/Made-With-ML/main/datasets/dataset.csv\"\n\n\n@pytest.fixture\ndef preprocessor():\n    return CustomPreprocessor()\n"
  },
  {
    "path": "tests/code/test_data.py",
    "content": "import pandas as pd\nimport pytest\nimport ray\n\nfrom madewithml import data\n\n\n@pytest.fixture(scope=\"module\")\ndef df():\n    data = [{\"title\": \"a0\", \"description\": \"b0\", \"tag\": \"c0\"}]\n    df = pd.DataFrame(data)\n    return df\n\n\n@pytest.fixture(scope=\"module\")\ndef class_to_index():\n    class_to_index = {\"c0\": 0, \"c1\": 1}\n    return class_to_index\n\n\ndef test_load_data(dataset_loc):\n    num_samples = 10\n    ds = data.load_data(dataset_loc=dataset_loc, num_samples=num_samples)\n    assert ds.count() == num_samples\n\n\ndef test_stratify_split():\n    n_per_class = 10\n    targets = n_per_class * [\"c1\"] + n_per_class * [\"c2\"]\n    ds = ray.data.from_items([dict(target=t) for t in targets])\n    train_ds, test_ds = data.stratify_split(ds, stratify=\"target\", test_size=0.5)\n    train_target_counts = train_ds.to_pandas().target.value_counts().to_dict()\n    test_target_counts = test_ds.to_pandas().target.value_counts().to_dict()\n    assert train_target_counts == test_target_counts\n\n\n@pytest.mark.parametrize(\n    \"text, sw, clean_text\",\n    [\n        (\"hi\", [], \"hi\"),\n        (\"hi you\", [\"you\"], \"hi\"),\n        (\"hi yous\", [\"you\"], \"hi yous\"),\n    ],\n)\ndef test_clean_text(text, sw, clean_text):\n    assert data.clean_text(text=text, stopwords=sw) == clean_text\n\n\ndef test_preprocess(df, class_to_index):\n    assert \"text\" not in df.columns\n    outputs = data.preprocess(df, class_to_index=class_to_index)\n    assert set(outputs) == {\"ids\", \"masks\", \"targets\"}\n\n\ndef test_fit_transform(dataset_loc, preprocessor):\n    ds = data.load_data(dataset_loc=dataset_loc)\n    preprocessor = preprocessor.fit(ds)\n    preprocessed_ds = preprocessor.transform(ds)\n    assert len(preprocessor.class_to_index) == 4\n    assert ds.count() == preprocessed_ds.count()\n"
  },
  {
    "path": "tests/code/test_predict.py",
    "content": "from madewithml import predict\n\n\ndef test_decode():\n    decoded = predict.decode(indices=[0, 1, 1], index_to_class={0: \"x\", 1: \"y\"})\n    assert decoded == [\"x\", \"y\", \"y\"]\n\n\ndef test_format_prob():\n    d = predict.format_prob(prob=[0.1, 0.9], index_to_class={0: \"x\", 1: \"y\"})\n    assert d == {\"x\": 0.1, \"y\": 0.9}\n"
  },
  {
    "path": "tests/code/test_train.py",
    "content": "import json\n\nimport pytest\nimport utils\n\nfrom madewithml import train\n\n\n@pytest.mark.training\ndef test_train_model(dataset_loc):\n    experiment_name = utils.generate_experiment_name(prefix=\"test_train\")\n    train_loop_config = {\"dropout_p\": 0.5, \"lr\": 1e-4, \"lr_factor\": 0.8, \"lr_patience\": 3}\n    result = train.train_model(\n        experiment_name=experiment_name,\n        dataset_loc=dataset_loc,\n        train_loop_config=json.dumps(train_loop_config),\n        num_workers=6,\n        cpu_per_worker=1,\n        gpu_per_worker=0,\n        num_epochs=2,\n        num_samples=512,\n        batch_size=256,\n        results_fp=None,\n    )\n    utils.delete_experiment(experiment_name=experiment_name)\n    train_loss_list = result.metrics_dataframe.to_dict()[\"train_loss\"]\n    assert train_loss_list[0] > train_loss_list[1]  # loss decreased\n"
  },
  {
    "path": "tests/code/test_tune.py",
    "content": "import json\n\nimport pytest\nimport utils\n\nfrom madewithml import tune\n\n\n@pytest.mark.training\ndef test_tune_models(dataset_loc):\n    num_runs = 2\n    experiment_name = utils.generate_experiment_name(prefix=\"test_tune\")\n    initial_params = [\n        {\n            \"train_loop_config\": {\n                \"dropout_p\": 0.5,\n                \"lr\": 1e-4,\n                \"lr_factor\": 0.8,\n                \"lr_patience\": 3,\n            }\n        }\n    ]\n    results = tune.tune_models(\n        experiment_name=experiment_name,\n        dataset_loc=dataset_loc,\n        initial_params=json.dumps(initial_params),\n        num_workers=6,\n        cpu_per_worker=1,\n        gpu_per_worker=0,\n        num_runs=num_runs,\n        num_epochs=1,\n        num_samples=512,\n        batch_size=256,\n        results_fp=None,\n    )\n    utils.delete_experiment(experiment_name=experiment_name)\n    assert len(results.get_dataframe()) == num_runs\n"
  },
  {
    "path": "tests/code/test_utils.py",
    "content": "import tempfile\nfrom pathlib import Path\n\nimport numpy as np\nimport pytest\nimport torch\nfrom ray.train.torch import get_device\n\nfrom madewithml import utils\n\n\ndef test_set_seed():\n    utils.set_seeds()\n    a = np.random.randn(2, 3)\n    b = np.random.randn(2, 3)\n    utils.set_seeds()\n    x = np.random.randn(2, 3)\n    y = np.random.randn(2, 3)\n    assert np.array_equal(a, x)\n    assert np.array_equal(b, y)\n\n\ndef test_save_and_load_dict():\n    with tempfile.TemporaryDirectory() as dp:\n        d = {\"hello\": \"world\"}\n        fp = Path(dp, \"d.json\")\n        utils.save_dict(d=d, path=fp)\n        d = utils.load_dict(path=fp)\n        assert d[\"hello\"] == \"world\"\n\n\ndef test_pad_array():\n    arr = np.array([[1, 2], [1, 2, 3]], dtype=\"object\")\n    padded_arr = np.array([[1, 2, 0], [1, 2, 3]])\n    assert np.array_equal(utils.pad_array(arr), padded_arr)\n\n\ndef test_collate_fn():\n    batch = {\n        \"ids\": np.array([[1, 2], [1, 2, 3]], dtype=\"object\"),\n        \"masks\": np.array([[1, 1], [1, 1, 1]], dtype=\"object\"),\n        \"targets\": np.array([3, 1]),\n    }\n    processed_batch = utils.collate_fn(batch)\n    expected_batch = {\n        \"ids\": torch.as_tensor([[1, 2, 0], [1, 2, 3]], dtype=torch.int32, device=get_device()),\n        \"masks\": torch.as_tensor([[1, 1, 0], [1, 1, 1]], dtype=torch.int32, device=get_device()),\n        \"targets\": torch.as_tensor([3, 1], dtype=torch.int64, device=get_device()),\n    }\n    for k in batch:\n        assert torch.allclose(processed_batch[k], expected_batch[k])\n\n\n@pytest.mark.parametrize(\n    \"d, keys, list\",\n    [\n        ({\"a\": [1, 2], \"b\": [1, 2]}, [\"a\", \"b\"], [{\"a\": 1, \"b\": 1}, {\"a\": 2, \"b\": 2}]),\n        ({\"a\": [1, 2], \"b\": [1, 2]}, [\"a\"], [{\"a\": 1}, {\"a\": 2}]),\n    ],\n)\ndef test_dict_to_list(d, keys, list):\n    assert utils.dict_to_list(d, keys=keys) == list\n"
  },
  {
    "path": "tests/code/utils.py",
    "content": "import uuid\n\nfrom madewithml.config import mlflow\n\n\ndef generate_experiment_name(prefix: str = \"test\") -> str:\n    return f\"{prefix}-{uuid.uuid4().hex[:8]}\"\n\n\ndef delete_experiment(experiment_name: str) -> None:\n    client = mlflow.tracking.MlflowClient()\n    experiment_id = client.get_experiment_by_name(experiment_name).experiment_id\n    client.delete_experiment(experiment_id=experiment_id)\n"
  },
  {
    "path": "tests/data/conftest.py",
    "content": "import great_expectations as ge\nimport pandas as pd\nimport pytest\n\n\ndef pytest_addoption(parser):\n    \"\"\"Add option to specify dataset location when executing tests from CLI.\n    Ex: pytest --dataset-loc=$DATASET_LOC tests/data --verbose --disable-warnings\n    \"\"\"\n    parser.addoption(\"--dataset-loc\", action=\"store\", default=None, help=\"Dataset location.\")\n\n\n@pytest.fixture(scope=\"module\")\ndef df(request):\n    dataset_loc = request.config.getoption(\"--dataset-loc\")\n    df = ge.dataset.PandasDataset(pd.read_csv(dataset_loc))\n    return df\n"
  },
  {
    "path": "tests/data/test_dataset.py",
    "content": "def test_dataset(df):\n    \"\"\"Test dataset quality and integrity.\"\"\"\n    column_list = [\"id\", \"created_on\", \"title\", \"description\", \"tag\"]\n    df.expect_table_columns_to_match_ordered_list(column_list=column_list)  # schema adherence\n    tags = [\"computer-vision\", \"natural-language-processing\", \"mlops\", \"other\"]\n    df.expect_column_values_to_be_in_set(column=\"tag\", value_set=tags)  # expected labels\n    df.expect_compound_columns_to_be_unique(column_list=[\"title\", \"description\"])  # data leaks\n    df.expect_column_values_to_not_be_null(column=\"tag\")  # missing values\n    df.expect_column_values_to_be_unique(column=\"id\")  # unique values\n    df.expect_column_values_to_be_of_type(column=\"title\", type_=\"str\")  # type adherence\n\n    # Expectation suite\n    expectation_suite = df.get_expectation_suite(discard_failed_expectations=False)\n    results = df.validate(expectation_suite=expectation_suite, only_return_failures=True).to_json_dict()\n    assert results[\"success\"]\n"
  },
  {
    "path": "tests/model/conftest.py",
    "content": "import pytest\n\nfrom madewithml import predict\nfrom madewithml.predict import TorchPredictor\n\n\ndef pytest_addoption(parser):\n    parser.addoption(\"--run-id\", action=\"store\", default=None, help=\"Run ID of model to use.\")\n\n\n@pytest.fixture(scope=\"module\")\ndef run_id(request):\n    return request.config.getoption(\"--run-id\")\n\n\n@pytest.fixture(scope=\"module\")\ndef predictor(run_id):\n    best_checkpoint = predict.get_best_checkpoint(run_id=run_id)\n    predictor = TorchPredictor.from_checkpoint(best_checkpoint)\n    return predictor\n"
  },
  {
    "path": "tests/model/test_behavioral.py",
    "content": "import pytest\nimport utils\n\n\n@pytest.mark.parametrize(\n    \"input_a, input_b, label\",\n    [\n        (\n            \"Transformers applied to NLP have revolutionized machine learning.\",\n            \"Transformers applied to NLP have disrupted machine learning.\",\n            \"natural-language-processing\",\n        ),\n    ],\n)\ndef test_invariance(input_a, input_b, label, predictor):\n    \"\"\"INVariance via verb injection (changes should not affect outputs).\"\"\"\n    label_a = utils.get_label(text=input_a, predictor=predictor)\n    label_b = utils.get_label(text=input_b, predictor=predictor)\n    assert label_a == label_b == label\n\n\n@pytest.mark.parametrize(\n    \"input, label\",\n    [\n        (\n            \"ML applied to text classification.\",\n            \"natural-language-processing\",\n        ),\n        (\n            \"ML applied to image classification.\",\n            \"computer-vision\",\n        ),\n        (\n            \"CNNs for text classification.\",\n            \"natural-language-processing\",\n        ),\n    ],\n)\ndef test_directional(input, label, predictor):\n    \"\"\"DIRectional expectations (changes with known outputs).\"\"\"\n    prediction = utils.get_label(text=input, predictor=predictor)\n    assert label == prediction\n\n\n@pytest.mark.parametrize(\n    \"input, label\",\n    [\n        (\n            \"Natural language processing is the next big wave in machine learning.\",\n            \"natural-language-processing\",\n        ),\n        (\n            \"MLOps is the next big wave in machine learning.\",\n            \"mlops\",\n        ),\n        (\n            \"This is about graph neural networks.\",\n            \"other\",\n        ),\n    ],\n)\ndef test_mft(input, label, predictor):\n    \"\"\"Minimum Functionality Tests (simple input/output pairs).\"\"\"\n    prediction = utils.get_label(text=input, predictor=predictor)\n    assert label == prediction\n"
  },
  {
    "path": "tests/model/utils.py",
    "content": "import ray\n\nfrom madewithml import predict\n\n\ndef get_label(text, predictor):\n    sample_ds = ray.data.from_items([{\"title\": text, \"description\": \"\", \"tag\": \"other\"}])\n    results = predict.predict_proba(ds=sample_ds, predictor=predictor)\n    return results[0][\"prediction\"]\n"
  }
]