pax_global_header00006660000000000000000000000064152434231400014510gustar00rootroot0000000000000052 comment=3b6a3a714d86fc1d8d97efe52e7082bb26f352f8 bidict-0.24.1/000077500000000000000000000000001524342314000130325ustar00rootroot00000000000000bidict-0.24.1/.coveragerc000066400000000000000000000006231524342314000151540ustar00rootroot00000000000000[run] branch = True core = sysmon # Uncomment out the following once it's supported by the sysmon core (https://github.com/coveragepy/coveragepy/issues/2150): # dynamic_context = test_function parallel = True patch = subprocess source = bidict tests [report] precision = 1 show_missing = True # Don't show files in the report that are 100% covered: skip_covered = True exclude_also = @.*overload bidict-0.24.1/.editorconfig000066400000000000000000000002631524342314000155100ustar00rootroot00000000000000# http://EditorConfig.org # top-most EditorConfig file root = true [*] end_of_line = lf insert_final_newline = true indent_style = space indent_size = 2 [*.py] indent_size = 4 bidict-0.24.1/.envrc000066400000000000000000000000121524342314000141410ustar00rootroot00000000000000use flake bidict-0.24.1/.github/000077500000000000000000000000001524342314000143725ustar00rootroot00000000000000bidict-0.24.1/.github/FUNDING.yml000066400000000000000000000010401524342314000162020ustar00rootroot00000000000000# https://docs.github.com/en/repositories/managing-your-repositorys-settings-and-features/customizing-your-repository/displaying-a-sponsor-button-in-your-repository github: jab tidelift: pypi/bidict polar: jab ko_fi: joshbronson custom: - http://paypal.me/js3 - https://thanks.dev - https://gumroad.com/l/bidict community_bridge: # PROJECT-NAME issuehunt: # USERNAME liberapay: # Replace with a single Liberapay username open_collective: # Replace with a single Open Collective username patreon: # Replace with a single Patreon username bidict-0.24.1/.github/workflows/000077500000000000000000000000001524342314000164275ustar00rootroot00000000000000bidict-0.24.1/.github/workflows/benchmark.yml000066400000000000000000000256241524342314000211150ustar00rootroot00000000000000name: benchmark "on": push: branches: - main - dev - deps pull_request: branches: - main workflow_dispatch: inputs: ref: description: (optional) ref to benchmark env: FORCE_COLOR: "1" PYTHONHASHSEED: "42" BASELINE_RELEASE_TAG: microbenchmarks # Cachegrind counts instructions rather than measuring time, so comparing them is # reproducible and can be held to a tight bound. A change of more than this much in # either direction is called out. # # There is deliberately no wall-clock threshold. The timings pytest-benchmark reports # here are measured *under* Cachegrind, and vary far more between runs of identical code # than any change worth catching: revisions whose bidict/ was byte-identical have been # seen to differ by tens of percent, in both directions. They are still compared in the # run output, which is archived below for eyeballing, but nothing keys off them. INSTRUCTION_CHANGE_PCT: "1.0" jobs: benchmark: runs-on: ubuntu-24.04 steps: - name: install valgrind uses: awalsh128/cache-apt-pkgs-action@553a35bb8ebd9fcabcb1c9451aa4c98e1b4ca8a9 with: packages: valgrind - name: check out source uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 with: fetch-depth: 0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: resolve benchmark metadata id: metadata run: | mapfile -t python_info < <(nix develop .#benchmark --command bash -c "python - <<'PY' import platform print(platform.python_version()) print(platform.python_implementation()) PY") python_version=${python_info[0]} python_impl=${python_info[1]} python_series=${python_version%.*} arch=$(uname -m) baseline_asset_name="GHA-linux-cachegrind-${arch}-${python_impl}-${python_series}-baseline.json" baseline_url="https://github.com/${GITHUB_REPOSITORY}/releases/download/${BASELINE_RELEASE_TAG}/${baseline_asset_name}" instr_asset_name="GHA-linux-cachegrind-${arch}-${python_impl}-${python_series}-instructions.txt" instr_url="https://github.com/${GITHUB_REPOSITORY}/releases/download/${BASELINE_RELEASE_TAG}/${instr_asset_name}" { echo "python_version=$python_version" echo "python_series=$python_series" echo "baseline_asset_name=$baseline_asset_name" echo "baseline_url=$baseline_url" echo "instr_asset_name=$instr_asset_name" echo "instr_url=$instr_url" } >> "$GITHUB_OUTPUT" - name: benchmark and compare to baseline id: benchmark run: | set +e nix develop .#benchmark --command bash -c ' set -euo pipefail git checkout ${{ github.event.inputs.ref || github.sha }} # install a non-editable version of bidict at the revision under test uv pip install --python "$VIRTUAL_ENV/bin/python" --no-deps . # restore the current revision so we use its version of tests/microbenchmarks.py git checkout ${{ github.sha }} # move aside the '"'"'bidict'"'"' subdirectory to make sure we always import the installed version mv -v bidict src curl -L -s -o baseline.json "${{ steps.metadata.outputs.baseline_url }}" line1=$(head -n1 baseline.json) [ "$line1" = "{" ] ./cachegrind.py pytest -c /dev/null -n0 \ --benchmark-autosave \ --benchmark-columns=min,rounds,iterations \ --benchmark-disable-gc \ --benchmark-group-by=name \ --benchmark-compare=baseline.json \ microbenchmarks.py ' 2>&1 | tee benchmark-output.txt benchmark_status=${PIPESTATUS[0]} # Nothing here is allowed to fail the job except the run itself failing, which # means pytest could not benchmark the revision at all. if [ "$benchmark_status" -eq 0 ]; then result_state=ok result_message='benchmarks ran' else result_state=failed result_message='benchmark execution failed' fi { echo "exit_code=$benchmark_status" echo "result_state=$result_state" echo "result_message=$result_message" } >> "$GITHUB_OUTPUT" exit "$benchmark_status" env: CACHEGRIND_ESTIMATE_OUT: ${{ github.workspace }}/instructions.txt - name: compare instruction estimate to baseline id: instructions if: always() env: INSTR_URL: ${{ steps.metadata.outputs.instr_url }} run: | # This comparison is reproducible where a wall-clock one is not: two runs of the # same revision have been measured 0.13% apart, against swings of tens of percent # for the per-benchmark timings. state=unavailable delta= now= baseline= if [ ! -s instructions.txt ]; then # Distinct from a missing baseline: this means cachegrind.py did not honor # CACHEGRIND_ESTIMATE_OUT, i.e. something here is broken rather than unpublished. summary='cachegrind.py recorded no instruction estimate' elif ! curl -fL -s -o instructions-baseline.txt "$INSTR_URL" || [ ! -s instructions-baseline.txt ]; then summary="no instruction baseline published yet (${INSTR_URL##*/})" else now=$(cat instructions.txt) baseline=$(cat instructions-baseline.txt) delta=$(python -c "print(f'{($now - $baseline) / $baseline * 100:+.2f}')") state=$(python -c "d = $delta; p = $INSTRUCTION_CHANGE_PCT; print('regression' if d > p else 'improved' if d < -p else 'ok')") if [ "$state" = regression ]; then summary="${delta}% vs baseline, over the ${INSTRUCTION_CHANGE_PCT}% threshold" else summary="${delta}% vs baseline" fi fi { echo "state=$state" echo "summary=$summary" echo "delta=$delta" echo "now=$now" echo "baseline=$baseline" } >> "$GITHUB_OUTPUT" # Warn only on pull requests, matching the timing check: on a push the baseline is # whatever was last published, so drift since then is expected rather than notable. if [ "$state" = regression ] && [ "${{ github.event_name }}" = "pull_request" ]; then echo "::warning::Instruction count regressed by ${delta}% vs the baseline (threshold ${INSTRUCTION_CHANGE_PCT}%)." fi - name: summarize benchmark result if: always() run: | { echo '## Benchmark result' echo echo "- Baseline asset: \`${{ steps.metadata.outputs.baseline_asset_name }}\`" echo "- Benchmark run: [${GITHUB_SERVER_URL}/${GITHUB_REPOSITORY}/actions/runs/${GITHUB_RUN_ID}](${GITHUB_SERVER_URL}/${GITHUB_REPOSITORY}/actions/runs/${GITHUB_RUN_ID})" echo "- Instruction threshold: \`${INSTRUCTION_CHANGE_PCT}%\`" echo "- Result: ${{ steps.benchmark.outputs.result_message }}" echo "- Instruction count: ${{ steps.instructions.outputs.summary }}" } >> "$GITHUB_STEP_SUMMARY" - name: prepare PR benchmark comment if: always() && github.event_name == 'pull_request' env: BASELINE_ASSET_NAME: ${{ steps.metadata.outputs.baseline_asset_name }} PR_NUMBER: ${{ github.event.pull_request.number }} RESULT_MESSAGE: ${{ steps.benchmark.outputs.result_message }} RESULT_STATE: ${{ steps.benchmark.outputs.result_state }} INSTR_STATE: ${{ steps.instructions.outputs.state }} INSTR_SUMMARY: ${{ steps.instructions.outputs.summary }} INSTR_DELTA: ${{ steps.instructions.outputs.delta }} run: | mkdir -p benchmark-pr-comment run_url="${GITHUB_SERVER_URL}/${GITHUB_REPOSITORY}/actions/runs/${GITHUB_RUN_ID}" case "$INSTR_STATE" in improved) headline=":zap: Instruction count improved: ${INSTR_SUMMARY}." ;; regression) headline=":warning: Instruction count regressed: ${INSTR_SUMMARY}." ;; ok) headline=":white_check_mark: Instruction count within threshold: ${INSTR_SUMMARY}." ;; *) headline=":grey_question: Instruction count: ${INSTR_SUMMARY}." ;; esac if [ "$RESULT_STATE" != ok ]; then headline=":x: Benchmark execution failed, so there is nothing to compare." fi cat > benchmark-pr-comment/comment.md < ## Benchmark report ${headline} - Baseline asset: \`${BASELINE_ASSET_NAME}\` - Instruction threshold: \`${INSTRUCTION_CHANGE_PCT}%\` - Run: [benchmark workflow run](${run_url}) _Instruction counts are reported for information and do not block merging. Wall-clock timings are compared in the run output too, but they are measured under Cachegrind and vary too much between runs to report on._ EOF python - <<'PY' import json import os from pathlib import Path payload = { 'pr_number': os.environ['PR_NUMBER'], 'result_state': os.environ['RESULT_STATE'], 'result_message': os.environ['RESULT_MESSAGE'], 'baseline_asset_name': os.environ['BASELINE_ASSET_NAME'], 'instruction_threshold_pct': os.environ['INSTRUCTION_CHANGE_PCT'], 'instruction_state': os.environ['INSTR_STATE'], 'instruction_summary': os.environ['INSTR_SUMMARY'], 'instruction_delta_pct': os.environ['INSTR_DELTA'], 'run_url': f"{os.environ['GITHUB_SERVER_URL']}/{os.environ['GITHUB_REPOSITORY']}/actions/runs/{os.environ['GITHUB_RUN_ID']}", } Path('benchmark-pr-comment/result.json').write_text(json.dumps(payload, indent=2) + '\n') PY - name: archive PR benchmark comment if: always() && github.event_name == 'pull_request' uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a with: name: benchmark-pr-comment path: benchmark-pr-comment if-no-files-found: error - name: archive benchmark results if: always() uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a with: name: microbenchmark results (CPython ${{ steps.metadata.outputs.python_version }}) path: | .benchmarks benchmark-output.txt instructions.txt include-hidden-files: true if-no-files-found: error permissions: contents: read bidict-0.24.1/.github/workflows/benchmark_pr_comment.yml000066400000000000000000000067611524342314000233410ustar00rootroot00000000000000name: benchmark PR comment "on": workflow_run: workflows: - benchmark types: - completed jobs: comment: if: github.event.workflow_run.event == 'pull_request' runs-on: ubuntu-24.04 permissions: actions: read contents: read issues: write pull-requests: write steps: - name: download benchmark PR comment artifact env: FALLBACK_PR_NUMBER: ${{ github.event.workflow_run.pull_requests[0].number || '' }} GH_TOKEN: ${{ github.token }} REPOSITORY: ${{ github.repository }} RUN_ID: ${{ github.event.workflow_run.id }} RUN_URL: ${{ github.event.workflow_run.html_url }} run: | set -euo pipefail mkdir -p artifact gh api "repos/${REPOSITORY}/actions/runs/${RUN_ID}/artifacts" > artifacts.json artifact_url=$( python -c "import json; from pathlib import Path; artifacts = json.loads(Path('artifacts.json').read_text())['artifacts']; print(next((artifact['archive_download_url'] for artifact in artifacts if artifact['name'] == 'benchmark-pr-comment'), ''))" ) if [ -n "$artifact_url" ]; then curl -LfsS \ -H "Authorization: Bearer ${GH_TOKEN}" \ "$artifact_url" > artifact.zip python -c "from zipfile import ZipFile; ZipFile('artifact.zip').extractall('artifact')" else python -c "import json, os; from pathlib import Path; Path('artifact/comment.md').write_text('\\n## Benchmark report\\n\\n:warning: Benchmark comment artifact not found.\\n\\n- Run: [benchmark workflow run]({})\\n- Result: the benchmark workflow completed, but it did not upload the PR comment artifact.\\n\\n_This benchmark check is informational and does not block merging._\\n'.format(os.environ['RUN_URL'])); Path('artifact/result.json').write_text(json.dumps({'pr_number': os.environ['FALLBACK_PR_NUMBER']}) + '\\n')" fi - name: create or update sticky benchmark comment env: GH_TOKEN: ${{ github.token }} FALLBACK_PR_NUMBER: ${{ github.event.workflow_run.pull_requests[0].number || '' }} REPOSITORY: ${{ github.repository }} run: | set -euo pipefail PR_NUMBER=$( python -c "import json, os; from pathlib import Path; result_path = Path('artifact/result.json'); pr_number = str(json.loads(result_path.read_text()).get('pr_number', '')) if result_path.exists() else ''; print(pr_number or os.environ.get('FALLBACK_PR_NUMBER', ''))" ) [ -n "$PR_NUMBER" ] gh api "repos/${REPOSITORY}/issues/${PR_NUMBER}/comments?per_page=100" > comments.json comment_id=$( python -c "import json; marker = ''; comments = json.load(open('comments.json')); print(next((str(comment['id']) for comment in comments if marker in comment['body']), ''))" ) python -c "import json; from pathlib import Path; body = Path('artifact/comment.md').read_text(); Path('comment-payload.json').write_text(json.dumps({'body': body}))" if [ -n "$comment_id" ]; then gh api \ --method PATCH \ "repos/${REPOSITORY}/issues/comments/${comment_id}" \ --input comment-payload.json else gh api \ --method POST \ "repos/${REPOSITORY}/issues/${PR_NUMBER}/comments" \ --input comment-payload.json fi bidict-0.24.1/.github/workflows/lint.yml000066400000000000000000000041571524342314000201270ustar00rootroot00000000000000name: lint "on": workflow_dispatch: push: branches: - main - dev - deps pull_request: branches: - main env: PREK_HOME: ~/.cache/prek jobs: main: name: lint runs-on: ubuntu-24.04 steps: - name: check out code uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 with: fetch-depth: 0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: cache prek hook environments uses: actions/cache@55cc8345863c7cc4c66a329aec7e433d2d1c52a9 with: path: ${{ env.PREK_HOME }} key: prek|${{ runner.os }}|${{ hashFiles('.pre-commit-config.yaml') }} - name: lint changed files run: | if [[ "$GITHUB_EVENT_NAME" == 'pull_request' ]]; then from_ref='${{ github.event.pull_request.base.sha }}' to_ref='${{ github.event.pull_request.head.sha }}' elif [[ "$GITHUB_EVENT_NAME" == 'push' ]]; then from_ref='${{ github.event.before }}' to_ref='${{ github.sha }}' if [[ "$from_ref" == '0000000000000000000000000000000000000000' ]] || ! git cat-file -e "$from_ref^{commit}" 2>/dev/null; then # New branch, or from_ref no longer reachable (e.g. after a force-push): from_ref="$(git merge-base "origin/${{ github.event.repository.default_branch }}" "$to_ref")" fi else to_ref='${{ github.sha }}' from_ref="$(git merge-base "origin/${{ github.event.repository.default_branch }}" "$to_ref")" if [[ -z "$(git diff --name-only "$from_ref" "$to_ref")" ]]; then # No files changed between from_ref and to_ref -> run on all files: nix develop .#lint --command prek run --all-files --show-diff-on-failure --verbose exit 0 fi fi nix develop .#lint --command prek run \ --from-ref "$from_ref" \ --to-ref "$to_ref" \ --show-diff-on-failure \ --verbose permissions: contents: read bidict-0.24.1/.github/workflows/release-to-pypi.yml000066400000000000000000000021521524342314000221710ustar00rootroot00000000000000name: release to pypi.org "on": push: tags: - "v[0-9]+.[0-9]+.[0-9]+" workflow_dispatch: jobs: main: runs-on: ubuntu-24.04 steps: - name: check out source uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: build distributions # This uv is the flake's, which is also the build backend: uv build uses its own # built-in uv_build whenever that uv satisfies pyproject.toml's [build-system] # requires, and only fetches uv_build from PyPI otherwise. Either way, that floor # is what keeps a too-old backend from writing the wheel's RECORD (#406). run: nix develop .#build --command uv build - name: check distributions run: nix develop .#build --command ./check_dist - name: Publish uses: pypa/gh-action-pypi-publish@cef221092ed1bacb1cc03d23a2d87d1d172e277b with: user: __token__ password: ${{ secrets.PYPI_API_TOKEN }} permissions: contents: read bidict-0.24.1/.github/workflows/release-to-test-pypi.yml000066400000000000000000000033111524342314000231440ustar00rootroot00000000000000name: release to test.pypi.org "on": push: tags: # To publish a test release to test.pypi.org, # create and push a tag as follows: # git tag -a 0.21.3.rc1 -m "Tag 0.21.3.rc1 for release to test.pypi.org" # git push --tags # Go to https://github.com/jab/bidict/actions?query=workflow%3A%22Release+to+Test+PyPI%22 # and watch for a new run of this workflow to publish to test.pypi.org. # IMPORTANT: Run the following to clean up after: # git tag -d 0.21.3.rc1 # git push origin :0.21.3.rc1 - "[0-9]+.[0-9]+.[0-9]+.rc[0-9]+" workflow_dispatch: jobs: main: runs-on: ubuntu-24.04 steps: - name: check out source uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: build distributions # This uv is the flake's, which is also the build backend: uv build uses its own # built-in uv_build whenever that uv satisfies pyproject.toml's [build-system] # requires, and only fetches uv_build from PyPI otherwise. Either way, that floor # is what keeps a too-old backend from writing the wheel's RECORD (#406). run: nix develop .#build --command uv build - name: check distributions run: nix develop .#build --command ./check_dist - name: Publish uses: pypa/gh-action-pypi-publish@cef221092ed1bacb1cc03d23a2d87d1d172e277b with: user: __token__ password: ${{ secrets.TEST_PYPI_API_TOKEN }} repository_url: https://test.pypi.org/legacy/ verbose: true permissions: contents: read bidict-0.24.1/.github/workflows/test.yml000066400000000000000000000075251524342314000201420ustar00rootroot00000000000000# This name appears as the text in the build badge: https://github.com/jab/bidict/actions/workflows/test.yml/badge.svg name: tests "on": workflow_dispatch: inputs: hypothesis_profile: type: choice description: (optional) options: - less-examples - more-examples schedule: - cron: "15 16 * * *" push: branches: - main - dev - deps pull_request: branches: - main env: FORCE_COLOR: "1" jobs: test-all: name: ${{ matrix.python }} runs-on: ubuntu-24.04 continue-on-error: ${{ matrix.allow_failure || false }} strategy: fail-fast: false matrix: include: - python: "3.15" shell: test315 # TODO: Drop allow_failure once 3.15 is stable: allow_failure: true - python: "3.14" shell: test314 enable_coverage: true - python: "3.13" shell: test313 - python: "3.12" shell: test312 - python: "3.11" shell: test311 # bidict/_typing.py's `typing`/`typing_extensions` imports branch on python<3.12 enable_coverage: true - python: "pypy-3.11" shell: testPyPy311 steps: - name: check out source uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: cache the Nix store uses: DeterminateSystems/magic-nix-cache-action@908b263ff629f4cc17666315b7fd3ec127c6244d with: # Use only the GitHub Actions cache; we don't authenticate to FlakeHub, and leaving it # enabled makes the action log a noisy (non-fatal) "Cannot find netrc credentials for # https://api.flakehub.com/" error before falling back to the GHA cache. use-flakehub: false use-gha-cache: true - name: set hypothesis profile # Both choices are profiles bidict registers in tests/conftest.py, so no run lands on # hypothesis's built-in `default`, whose wall-clock deadline fails tests for being slow # on their first call. Using less-examples here also stops CI, which gates merges, from # generating fewer examples than a plain local `pytest` does. run: | hypothesis_profile=${{ github.event.inputs.hypothesis_profile || (github.event_name == 'schedule' && 'more-examples' || 'less-examples') }} echo PYTEST_ADDOPTS="$PYTEST_ADDOPTS --hypothesis-profile=$hypothesis_profile" >> "$GITHUB_ENV" - name: cache .hypothesis dir uses: actions/cache@55cc8345863c7cc4c66a329aec7e433d2d1c52a9 with: path: .hypothesis key: hypothesis|${{ runner.os }}|${{ matrix.python }} - name: maybe enable coverage if: matrix.enable_coverage run: | echo RUN_PYTEST_CMD="coverage run -m pytest" >> "$GITHUB_ENV" - name: run ty and pytest run: | nix develop .#${{ matrix.shell }} --command bash -c " set -euo pipefail ty check \${RUN_PYTEST_CMD:-pytest} " - name: combine and show any collected coverage if: matrix.enable_coverage run: | nix develop .#${{ matrix.shell }} --command bash -c ' coverage combine coverage debug data coverage report ' - name: maybe upload to Codecov # https://github.com/codecov/codecov-action if: matrix.enable_coverage uses: codecov/codecov-action@fb8b3582c8e4def4969c97caa2f19720cb33a72f env: CODECOV_TOKEN: ${{ secrets.CODECOV_TOKEN }} with: verbose: true fail_ci_if_error: false # https://github.com/codecov/codecov-action/issues/557 permissions: contents: read bidict-0.24.1/.github/workflows/update_actions.yml000066400000000000000000000014121524342314000221520ustar00rootroot00000000000000# https://github.com/marketplace/actions/github-actions-version-updater name: update GitHub Actions "on": workflow_dispatch: schedule: # Second day of every third month at noon - cron: "0 12 2 */3 *" jobs: main: runs-on: ubuntu-24.04 steps: - name: check out code uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 with: token: ${{ secrets.ACTIONS_VERSION_UPDATER_TOKEN }} - name: update GitHub Actions uses: saadmk11/github-actions-version-updater@v0.9.0 with: token: ${{ secrets.ACTIONS_VERSION_UPDATER_TOKEN }} update_version_with: release-commit-sha pull_request_labels: "automated, dependencies" permissions: contents: write pull-requests: write bidict-0.24.1/.github/workflows/update_benchmark_baselines.yml000066400000000000000000000141271524342314000245000ustar00rootroot00000000000000name: update benchmark baselines "on": push: branches: - main paths: - flake.lock - flake.nix workflow_dispatch: inputs: ref: description: (optional) ref to benchmark for the new baseline required: false env: FORCE_COLOR: "1" PYTHONHASHSEED: "42" BASELINE_RELEASE_TAG: microbenchmarks jobs: update-baselines: runs-on: ubuntu-24.04 steps: - name: install valgrind uses: awalsh128/cache-apt-pkgs-action@553a35bb8ebd9fcabcb1c9451aa4c98e1b4ca8a9 with: packages: valgrind - name: check out source uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 with: fetch-depth: 0 ref: ${{ github.event_name == 'workflow_dispatch' && github.event.inputs.ref || github.ref }} - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: resolve benchmark metadata id: metadata run: | mapfile -t python_info < <(nix develop .#benchmark --command bash -c "python - <<'PY' import platform print(platform.python_version()) print(platform.python_implementation()) PY") python_version=${python_info[0]} python_impl=${python_info[1]} python_series=${python_version%.*} arch=$(uname -m) versioned_asset_name="GHA-linux-cachegrind-${arch}-${python_impl}-${python_version}-baseline.json" series_asset_name="GHA-linux-cachegrind-${arch}-${python_impl}-${python_series}-baseline.json" versioned_instr_name="GHA-linux-cachegrind-${arch}-${python_impl}-${python_version}-instructions.txt" series_instr_name="GHA-linux-cachegrind-${arch}-${python_impl}-${python_series}-instructions.txt" { echo "python_version=$python_version" echo "python_series=$python_series" echo "versioned_asset_name=$versioned_asset_name" echo "series_asset_name=$series_asset_name" echo "versioned_instr_name=$versioned_instr_name" echo "series_instr_name=$series_instr_name" } >> "$GITHUB_OUTPUT" - name: benchmark env: # Have cachegrind.py record its instruction estimate, which unlike the wall-clock # figures is reproducible, so PR runs can compare against it without a noise allowance. CACHEGRIND_ESTIMATE_OUT: ${{ github.workspace }}/instructions.txt run: | nix develop .#benchmark --command bash -c ' uv pip install --python "$VIRTUAL_ENV/bin/python" --no-deps . # Move aside the working tree package so we always import the installed version. mv -v bidict src ./cachegrind.py pytest -c /dev/null -n0 \ --benchmark-autosave \ --benchmark-columns=min,rounds,iterations \ --benchmark-disable-gc \ --benchmark-group-by=name \ microbenchmarks.py ' - name: prepare baseline assets id: assets run: | benchmark_json=$(find .benchmarks -type f -name '*.json' | sort | tail -n1) [ -n "$benchmark_json" ] cp "$benchmark_json" '${{ steps.metadata.outputs.versioned_asset_name }}' cp "$benchmark_json" '${{ steps.metadata.outputs.series_asset_name }}' [ -s instructions.txt ] cp instructions.txt '${{ steps.metadata.outputs.versioned_instr_name }}' cp instructions.txt '${{ steps.metadata.outputs.series_instr_name }}' { echo "benchmark_json=$benchmark_json" echo "versioned_asset_path=${{ github.workspace }}/${{ steps.metadata.outputs.versioned_asset_name }}" echo "series_asset_path=${{ github.workspace }}/${{ steps.metadata.outputs.series_asset_name }}" echo "versioned_instr_path=${{ github.workspace }}/${{ steps.metadata.outputs.versioned_instr_name }}" echo "series_instr_path=${{ github.workspace }}/${{ steps.metadata.outputs.series_instr_name }}" } >> "$GITHUB_OUTPUT" - name: ensure baseline release exists env: GH_TOKEN: ${{ github.token }} run: | if gh release view "$BASELINE_RELEASE_TAG" --repo "$GITHUB_REPOSITORY" >/dev/null 2>&1; then exit 0 fi gh release create "$BASELINE_RELEASE_TAG" \ --repo "$GITHUB_REPOSITORY" \ --title 'baseline microbenchmarks' \ --notes 'This tag exists merely so we have somewhere we can store the attached baseline benchmark data.' - name: upload baseline assets env: GH_TOKEN: ${{ github.token }} run: | gh release upload "$BASELINE_RELEASE_TAG" \ '${{ steps.assets.outputs.versioned_asset_path }}' \ '${{ steps.assets.outputs.series_asset_path }}' \ '${{ steps.assets.outputs.versioned_instr_path }}' \ '${{ steps.assets.outputs.series_instr_path }}' \ --repo "$GITHUB_REPOSITORY" \ --clobber - name: write summary run: | { echo '### Uploaded benchmark baselines' echo echo '- Python: `${{ steps.metadata.outputs.python_version }}`' echo '- Versioned asset: `${{ steps.metadata.outputs.versioned_asset_name }}`' echo '- Series alias: `${{ steps.metadata.outputs.series_asset_name }}`' echo '- Source benchmark file: `${{ steps.assets.outputs.benchmark_json }}`' echo "- Instruction estimate: \`$(cat instructions.txt)\`" } >> "$GITHUB_STEP_SUMMARY" - name: archive benchmark results uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a with: name: microbenchmark baseline results (CPython ${{ steps.metadata.outputs.python_version }}) path: | .benchmarks ${{ steps.metadata.outputs.versioned_asset_name }} ${{ steps.metadata.outputs.series_asset_name }} include-hidden-files: true if-no-files-found: error permissions: contents: write bidict-0.24.1/.github/workflows/update_dev_deps.yml000066400000000000000000000017671524342314000223200ustar00rootroot00000000000000name: update dev deps "on": schedule: # First day of every third month at noon - cron: "0 12 1 */3 *" workflow_dispatch: jobs: main: runs-on: ubuntu-24.04 steps: - name: check out code uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 # - name: set up upterm session # uses: lhotari/action-upterm@v1 - name: update development dependencies run: nix develop .#update_deps --command bash -c './update_dev_dependencies' - name: create PR uses: peter-evans/create-pull-request@5f6978faf089d4d20b00c7766989d076bb2fc7f1 with: token: ${{ secrets.DEV_DEPS_UPDATE_TOKEN }} title: Update development dependencies labels: automated,dependencies commit-message: Update dev dependencies. branch: deps permissions: contents: read pull-requests: write bidict-0.24.1/.github/workflows/update_flake_lock.yml000066400000000000000000000014071524342314000226100ustar00rootroot00000000000000name: update flake.lock "on": workflow_dispatch: schedule: # Third day of every third month at noon - cron: "0 12 3 */3 *" jobs: main: runs-on: ubuntu-24.04 steps: - name: check out code uses: actions/checkout@9c091bb21b7c1c1d1991bb908d89e4e9dddfe3e0 - name: install Nix uses: DeterminateSystems/nix-installer-action@ef8a148080ab6020fd15196c2084a2eea5ff2d25 - name: update flake.lock uses: DeterminateSystems/update-flake-lock@834c491b2ece4de0bbd00d85214bb5e83b4da5c6 with: token: ${{ secrets.FLAKE_LOCK_UPDATE_ACTION_TOKEN }} pr-title: "Update flake.lock" pr-labels: | automated dependencies permissions: contents: read pull-requests: write bidict-0.24.1/.gitignore000066400000000000000000000003201524342314000150150ustar00rootroot00000000000000*.pyc *.so __pycache__ .DS_Store .benchmarks .cache .coverage* .direnv .eggs .hypothesis .idea .mypy_cache .tox .venv .venv-benchmark bidict.egg-info build _build coverage.xml dist htmlcov pip-wheel-metadata bidict-0.24.1/.pre-commit-config.yaml000066400000000000000000000025151524342314000173160ustar00rootroot00000000000000exclude: ^\.benchmarks repos: - repo: builtin hooks: - id: check-added-large-files - id: check-case-conflict - id: check-merge-conflict - id: check-symlinks - id: check-toml - id: check-yaml - id: end-of-file-fixer - id: mixed-line-ending - id: trailing-whitespace - repo: https://gitlab.com/bmares/check-json5 rev: v1.0.1 hooks: - id: check-json5 - repo: https://github.com/Lucas-C/pre-commit-hooks rev: v1.5.6 hooks: - id: forbid-crlf - id: remove-crlf - id: forbid-tabs - id: remove-tabs - repo: https://github.com/codespell-project/codespell rev: v2.4.3 hooks: - id: codespell args: ["--uri-ignore-words-list", "*"] # https://github.com/codespell-project/codespell/issues/2473 - repo: https://github.com/adhtruong/mirrors-typos rev: v1.49.0 hooks: - id: typos args: [--write-changes] - repo: https://github.com/astral-sh/ty-pre-commit rev: v0.0.74 hooks: - id: ty - repo: https://github.com/astral-sh/ruff-pre-commit rev: v0.16.4 hooks: - id: ruff-check args: [--fix, --unsafe-fixes] - id: ruff-format - repo: https://github.com/shellcheck-py/shellcheck-py rev: v0.11.0.1-1 hooks: - id: shellcheck exclude: ^.envrc$ bidict-0.24.1/.readthedocs.yml000066400000000000000000000004571524342314000161260ustar00rootroot00000000000000--- # https://docs.readthedocs.io/en/stable/config-file/v2.html version: 2 formats: - htmlzip sphinx: configuration: docs/conf.py fail_on_warning: true build: os: "ubuntu-24.04" tools: python: "3.12" python: install: - method: uv command: sync groups: - docs bidict-0.24.1/.vscode/000077500000000000000000000000001524342314000143735ustar00rootroot00000000000000bidict-0.24.1/.vscode/extensions.json000066400000000000000000000005421524342314000174660ustar00rootroot00000000000000// vim: set ft=json5 { // See https://go.microsoft.com/fwlink/?LinkId=827846 to learn about workspace recommendations. "recommendations": [ "astral-sh.ty", "charliermarsh.ruff", // "lextudio.restructuredtext", // "tamasfe.even-better-toml", // "trond-snekvik.simple-rst", ], "unwantedRecommendations": [], } bidict-0.24.1/.vscode/settings.json000066400000000000000000000004541524342314000171310ustar00rootroot00000000000000// vim: set ft=json5 { "editor.formatOnSaveMode": "modificationsIfAvailable", "files.insertFinalNewline": true, "files.trimFinalNewlines": true, "files.trimTrailingWhitespace": true, "python.defaultInterpreterPath": ".venv/bin/python", "python.testing.pytestEnabled": true, } bidict-0.24.1/.vscode/tasks.json000066400000000000000000000046761524342314000164300ustar00rootroot00000000000000{ "version": "2.0.0", "tasks": [ { "label": "Run tox (all targets)", "type": "process", "command": "tox", "group": "test", "presentation": { "echo": true, "reveal": "always", "focus": false, "panel": "dedicated", "showReuseMessage": false, "clear": false } }, { "label": "Lint", "type": "process", "command": "tox", "args": [ "-e", "lint" ], "group": "test", "presentation": { "echo": true, "reveal": "always", "focus": false, "panel": "dedicated", "showReuseMessage": false, "clear": false } }, { "label": "Run tests", "type": "process", "command": "pytest", "isTestCommand": true, "presentation": { "echo": true, "reveal": "always", "focus": false, "panel": "dedicated", "showReuseMessage": false, "clear": false } }, { "label": "Build docs", "type": "process", "command": "tox", "args": [ "-e", "docs" ], "group": "build", "presentation": { "echo": true, "reveal": "silent", "focus": false, "panel": "dedicated", "showReuseMessage": false, "clear": true } }, { "label": "Host docs", "type": "process", "command": "python", "args": [ "-m", "http.server" ], "isBackground": true, "options": { "cwd": "${workspaceFolder}/docs/_build/html" }, "dependsOn": "Build docs", "presentation": { "echo": true, "reveal": "silent", "focus": false, "panel": "dedicated", "showReuseMessage": false, "clear": true }, "problemMatcher": [] } ] } bidict-0.24.1/CHANGELOG.rst000066400000000000000000001044011524342314000150530ustar00rootroot00000000000000.. Forward declarations for all the custom interpreted text roles that Sphinx defines and that are used below. This helps Sphinx-unaware tools (e.g. rst2html, PyPI's and GitHub's renderers, etc.). .. role:: doc .. role:: ref Changelog ========= .. image:: https://img.shields.io/badge/GitHub-sponsor-ff69b4 :target: https://github.com/sponsors/jab :alt: Sponsor :sup:`If you or your organization depends on bidict, please consider sponsoring bidict on GitHub.` .. tip:: Watch `bidict releases on GitHub `__ to be notified when new versions of bidict are published. Click the "Watch" dropdown, choose "Custom", and then choose "Releases". 0.24.1 (2026-08-25) ------------------- - Fix the ``RECORD`` file in the published 0.24.0 wheel by upgrading to a fixed version of ``uv_build``. :issue:`406` - Fix a test failure on Python 3.15 caused by changes to :class:`~collections.UserDict`. :issue:`407` 0.24.0 (2026-08-24) ------------------- - Remove ``bidict.metadata`` and associated metadata from the :mod:`bidict` module (e.g. ``bidict.__version__``). Use e.g. :func:`importlib.metadata.metadata("bidict")["Version"] ` instead. - Fix a bug where pickling or :func:`~copy.deepcopy`\ing an instance of a dynamically-generated inverse class (see :ref:`extending:Dynamic Inverse Class Generation`) could change the order of its items. :issue:`398` Pickles written by bidict 0.23.1 and earlier can no longer be read. They call the private ``BidictBase._from_other()`` with an argument it no longer accepts, which was retained for no other purpose. Pickle compatibility across versions `has never been guaranteed `__, and dropping it here keeps :meth:`~bidict.BidictBase.__reduce__` free of special cases. - Fix a bug where a non-ordered bidict's :meth:`~bidict.BidictBase.values` view could yield its values in a different order than :meth:`~bidict.BidictBase.keys` yields the corresponding keys, so that e.g. ``zip(b.keys(), b.values())`` silently paired up the wrong keys and values. - Fix a bug where :meth:`~bidict.MutableBidict.putall` and :meth:`~bidict.MutableBidict.update` could leave earlier items inserted when a later item in a bulk update raised a non-duplication exception, rather than failing clean. :issue:`389` - Fix a bug where a bulk update did not fail clean at all when the :class:`~bidict.OnDup` in effect contained no :attr:`~bidict.RAISE` action – as with :meth:`~bidict.MutableBidict.forceupdate`, :meth:`~bidict.MutableBidict.putall` passed :attr:`~bidict.ON_DUP_DROP_OLD`, or :meth:`~bidict.MutableBidict.update` on a subclass that overrides :attr:`~bidict.BidictBase.on_dup` (e.g. the ``YoloBidict`` recipe in :doc:`extending`). Rollback was previously enabled only when a duplication error was possible, but a bulk update can also fail while unpacking an item, hashing a key or value, or writing to a backing mapping. Rollback is now always enabled for these methods. :issue:`392` - Fix a bug where a write or removal that a custom backing mapping refused could leave a custom bidict's two backing mappings out of sync, breaking the bidirectional invariant, rather than failing clean. :issue:`401` :issue:`403` - Fix a bug where mutating an :class:`~bidict.OrderedBidict` while iterating over it produced incorrect behavior rather than raising an error. :issue:`393` - A bidict and its inverse now always refer to the same object for each contained key and value, rather than possibly to equivalent but distinct ones, so that e.g. ``b.inverse[b[key]] is key`` always holds. Writing an item whose key or value is equal to a contained one now keeps the object already contained, as :class:`dict` does when a key is overwritten, instead of keeping one object in each direction. *See also* :ref:`addendum:Equivalent but distinct \:class\:\`~collections.abc.Hashable\`\\s` :issue:`396` - Fix a bug where setting an already-contained (key, value) pair spuriously raised :class:`~bidict.KeyAndValueDuplicationError` or ``AssertionError`` (rather than being a no-op, as documented) when the key or value has non-reflexive equality (e.g. *nan*) or asymmetric equality. :issue:`377` - Fix a bug where set operations between an :class:`~bidict.OrderedBidict`'s keys view and its items view (or vice versa) raised :class:`TypeError` (or, for ``==``, returned the wrong result) rather than behaving like the equivalent plain :class:`dict` views. :issue:`376` - Single-item writes such as :meth:`~bidict.MutableBidict.__setitem__`, :meth:`~bidict.MutableBidict.put`, and :meth:`~bidict.MutableBidict.forceput` are now ~6x faster: most of what they cost was never the write itself, but typing machinery being re-evaluated on every call. Iterating an :class:`~bidict.OrderedBidict` is also ~1.2x faster. Everything else is within a couple of percent of 0.23.1. - A bidict backed by a :class:`dict` *subclass* now gets that mapping's own views from :meth:`~bidict.BidictBase.keys` and :meth:`~bidict.BidictBase.items`, as a bidict backed by an exact :class:`dict` already did. Previously only an exact :class:`dict` qualified, so such a bidict got generic views instead, which were not :class:`~collections.abc.Reversible` (even when the bidict itself was), had no ``.mapping`` attribute, and performed their set operations in Python rather than in C. This affects every backing mapping used in the recipes in :doc:`extending`, since :class:`collections.OrderedDict`, :class:`collections.defaultdict`, and ``sortedcontainers.SortedDict`` are all :class:`dict` subclasses. - Fix a bug where a subclass of a bidict class whose backing mappings are not :class:`~collections.abc.Reversible` could not itself be reversible, even when it specified backing mappings that are. - Fix a bug where an :class:`~bidict.OrderedBidictBase` that is not an :class:`~bidict.OrderedBidict` could yield its items in the wrong order from :meth:`~bidict.OrderedBidictBase.keys`, :meth:`~bidict.OrderedBidictBase.items`, :meth:`~bidict.BidictBase.values`, :func:`repr`, and :meth:`~bidict.BidictBase.equals_order_sensitive`. 0.23.1 (2024-02-18) ------------------- Fix a regression in 0.23.0 that could defeat type inference of a bidict's key type and value type when running in Python 3.8 or 3.9. :issue:`310` 0.23.0 (2024-02-14) ------------------- Primarily, this release simplifies bidict by removing minor features that are no longer necessary or that have little to no apparent usage, and it also includes some performance optimizations. Specifically, initializing or updating a bidict is now up to 70% faster in microbenchmarks. The changes in this release will also make it easier to maintain and improve bidict in the future, including further potential performance optimizations. It also contains several other improvements. - Drop support for Python 3.7, which reached end of life on 2023-06-27, and take advantage of features available in Python 3.8+. - Remove ``FrozenOrderedBidict`` now that Python 3.7 is no longer supported. :class:`~bidict.frozenbidict` now provides everything that ``FrozenOrderedBidict`` provided (including :class:`reversibility `) on all supported Python versions, but with less space overhead. - Remove ``namedbidict`` due to low usage. - Remove the ``kv`` field of :class:`~bidict.OnDup` which specified the :class:`~bidict.OnDupAction` to take in the case of :ref:`basic-usage:key and value duplication`. The :attr:`~bidict.OnDup.val` field now specifies the action to take in the case of :ref:`basic-usage:key and value duplication` as well as :ref:`just value duplication `. - Improve type hints for the :attr:`~bidict.BidictBase.inv` shortcut alias for :attr:`~bidict.BidictBase.inverse`. - Fix a bug where calls like ``bidict(None)``, ``bi.update(False)``, etc. would fail to raise a :class:`TypeError`. - All :meth:`~bidict.BidictBase.__init__`, :meth:`~bidict.MutableBidict.update`, and related methods now handle `SupportsKeysAndGetItem `__ objects that are not :class:`~collections.abc.Mapping`\s the same way that `MutableMapping.update() `__ does, before falling back to handling the provided object as an iterable of pairs. - The :func:`repr` of ordered bidicts now matches that of regular bidicts, e.g. ``OrderedBidict({1: 1})`` rather than ``OrderedBidict([(1, 1)])``. (Accordingly, the ``bidict.__repr_delegate__`` field has been removed now that it's no longer needed.) This tracks with the change to :class:`collections.OrderedDict`\'s :func:`repr` `in Python 3.12 `__. - Test with Python 3.12 in CI. Note: Older versions of bidict also support Python 3.12, even though they don't explicitly declare support for it. - Drop use of `Trove classifiers `__ that declare support for specific Python versions in package metadata. 0.22.1 (2022-12-31) ------------------- - Only include the source code in the source distribution. This reduces the size of the source distribution from ~200kB to ~30kB. - Fix the return type hint of :func:`bidict.inverted` to return an :class:`~collections.abc.Iterator`, rather than an :class:`~collections.abc.Iterable`. 0.22.0 (2022-03-23) ------------------- - Drop support for Python 3.6, which reached end of life on 2021-12-23 and is no longer supported by pip as of pip version 22. Take advantage of this to reduce bidict's maintenance costs. - Use mypy-appeasing explicit re-exports in ``__init__.py`` (e.g. ``import x as x``) so that mypy no longer gives you an implicit re-export error if you run it with ``--no-implicit-reexport`` (or ``--strict``) against code that imports from :mod:`bidict`. - Update the implementations and type annotations of :meth:`bidict.BidictBase.keys` and :meth:`bidict.BidictBase.values` to make use of the new :class:`~bidict.BidictKeysView` type, which works a bit better with type checkers. - Inverse bidict instances are now computed lazily the first time the :attr:`~bidict.BidictBase.inverse` attribute is accessed rather than being computed eagerly during initialization. (A bidict's backing, inverse, one-way mapping is still kept in sync eagerly as any mutations are made, to preserve key- and value-uniqueness.) - Optimize initializing a bidict with another bidict. In a microbenchmark on Python 3.10, this now performs over **2x faster**. - Optimize updating an empty bidict with another bidict. In a microbenchmark on Python 3.10, this now performs **60-75% faster**. - Optimize :meth:`~bidict.BidictBase.copy`. In a microbenchmark on Python 3.10, this now performs **10-20x faster**. - Optimize rolling back :ref:`failed updates to a bidict ` in the case that the number of items passed to the update call can be determined to be larger than the bidict being updated. Previously this rollback was O(n) in the number of items passed. Now it is O(1), i.e. **unboundedly faster**. - Optimize :meth:`bidict.BidictBase.__contains__` (the method called when you run ``key in mybidict``). In a microbenchmark on Python 3.10, this now performs over **3-10x faster** in the False case, and at least **50% faster** in the True case. - Optimize :meth:`bidict.BidictBase.__eq__` (the method called when you run ``mybidict == other``). In a microbenchmark on Python 3.10, this now performs **15-25x faster** for ordered bidicts, and **7-12x faster** for unordered bidicts. - Optimize :meth:`~bidict.BidictBase.equals_order_sensitive`. In a microbenchmark on Python 3.10, this now performs **2x faster** for ordered bidicts and **60-90% faster** for unordered bidicts. - Optimize the :class:`~collections.abc.MappingView` objects returned by :meth:`bidict.OrderedBidict.keys `, :meth:`bidict.OrderedBidict.values `, and :meth:`bidict.OrderedBidict.items ` to delegate to backing ``dict_keys`` and ``dict_items`` objects if available, which are much faster in CPython. For example, in a microbenchmark on Python 3.10, ``orderedbi.items() == d.items()`` now performs **30-50x faster**. - Fix a bug where :meth:`bidict.BidictBase.__eq__` was always returning False rather than :obj:`NotImplemented` in the case that the argument was not a :class:`~collections.abc.Mapping`, defeating the argument's own ``__eq__()`` if implemented. As a notable example, bidicts now correctly compare equal to :obj:`unittest.mock.ANY`. - :class:`bidict.BidictBase` now adds a ``__reversed__`` implementation to subclasses that don't have an overridden implementation depending on whether both their backing mappings are :class:`~collections.abc.Reversible`. Previously, a ``__reversed__`` implementation was only added to :class:`~bidict.BidictBase` when ``BidictBase._fwdm_cls`` was :class:`~collections.abc.Reversible`. So if a :class:`~bidict.BidictBase` subclass set its ``_fwdm_cls`` to a non-reversible mutable mapping, it would also have to manually set its ``__reversed__`` attribute to None to override the implementation inherited from :class:`~bidict.BidictBase`. This is no longer necessary thanks to bidict's new :meth:`object.__init_subclass__` logic. - The :class:`~collections.abc.MappingView` objects returned by :meth:`bidict.OrderedBidict.keys `, :meth:`bidict.OrderedBidict.values `, and :meth:`bidict.OrderedBidict.items ` are now :class:`~collections.abc.Reversible`. (This was already the case for unordered bidicts when running on Python 3.8+.) - Add support for Python 3.9-style dict merge operators (`PEP 584 `__). See `the tests `__ for examples. - Update docstrings for :meth:`bidict.BidictBase.keys`, :meth:`bidict.BidictBase.values`, and :meth:`bidict.BidictBase.items` to include more details. - ``namedbidict`` now exposes the passed-in *keyname* and *valname* in the corresponding properties on the generated class. - ``namedbidict`` now requires *base_type* to be a subclass of :class:`~bidict.BidictBase`, but no longer requires *base_type* to provide an ``_isinv`` attribute, which :class:`~bidict.BidictBase` subclasses no longer provide. - When attempting to pickle a bidict's inverse whose class was :ref:`dynamically generated `, and no reference to the dynamically-generated class has been stored anywhere in :data:`sys.modules` where :mod:`pickle` can find it, the pickle call is now more likely to succeed rather than failing with a :class:`~pickle.PicklingError`. - Remove the use of slots from (non-ABC) bidict types. This better matches the mapping implementations in Python's standard library, and significantly reduces code complexity and maintenance burden. The memory savings conferred by using slots are not noticeable unless you're creating millions of bidict instances anyway, which is an extremely unusual usage pattern. Of course, bidicts can still contain millions (or more) items (which is not an unusual usage pattern) without using any more memory than before these changes. Notably, slots are still used in the internal linked list nodes of ordered bidicts to save memory, since as many node instances are created as there are items inserted. 0.21.4 (2021-10-23) ------------------- Explicitly declare support for Python 3.10 as well as some minor internal improvements. 0.21.3 (2021-09-05) ------------------- - All bidicts now provide the :meth:`~bidict.BidictBase.equals_order_sensitive` method, not just :class:`~bidict.OrderedBidict`\s. Since support for Python < 3.6 was dropped in v0.21.0, :class:`dict`\s provide a deterministic ordering on all supported Python versions, and as a result, all bidicts do too. So now even non-:class:`Ordered ` bidicts might as well provide :meth:`~bidict.BidictBase.equals_order_sensitive`. See the updated :ref:`other-bidict-types:What about order-preserving dicts?` docs for more info. - Take better advantage of the fact that dicts became :class:`reversible ` in Python 3.8. Specifically, now even non-:class:`Ordered ` bidicts provide a :meth:`~bidict.BidictBase.__reversed__` implementation on Python 3.8+ that calls :func:`reversed` on the backing ``_fwdm`` mapping. As a result, if you are using Python 3.8+, :class:`~bidict.frozenbidict` now gives you everything that ``FrozenOrderedBidict`` gives you, but with less space overhead. - Drop `setuptools_scm `__ as a ``setup_requires`` dependency. - Remove the ``bidict.__version_info__`` attribute. 0.21.2 (2020-09-07) ------------------- - Include `py.typed `__ file to mark :mod:`bidict` as type hinted. 0.21.1 (2020-09-07) ------------------- This release was yanked and replaced with the 0.21.2 release, which actually provides the intended changes. 0.21.0 (2020-08-22) ------------------- - :mod:`bidict` now provides `type hints `__! ⌨️ ✅ Adding type hints to :mod:`bidict` poses particularly interesting challenges due to the combination of generic types, dynamically-generated types (such as :ref:`inverse bidict classes ` and ``namedbidict``\s), and complicating optimizations such as the use of slots and weakrefs. It didn't take long to hit bugs and missing features in the state of the art for type hinting in Python today, e.g. missing higher-kinded types support (`python/typing#548 `__), too-narrow type hints for :class:`collections.abc.Mapping` (`python/typeshed#4435 `__), a :class:`typing.Generic` bug in Python 3.6 (`BPO-41451 `__), etc. That said, this release should provide a solid foundation for code using :mod:`bidict` that enables static type checking. As always, if you spot any opportunities to improve :mod:`bidict` (including its new type hints), please don't hesitate to submit a PR! - Add :class:`bidict.MutableBidirectionalMapping` ABC. The :ref:`other-bidict-types:Bidict Types Diagram` has been updated accordingly. - Drop support for Python 3.5, which reaches end of life on 2020-09-13, represents a tiny percentage of bidict downloads on `PyPI Stats `__, and lacks support for `variable type hint syntax `__, `ordered dicts `__, and :attr:`object.__init_subclass__`. - Remove the no-longer-needed ``bidict.compat`` module. - Move :ref:`inverse bidict class access ` from a property to an attribute set in :attr:`~bidict.BidictBase.__init_subclass__`, to save function call overhead on repeated access. - :meth:`bidict.OrderedBidictBase.__iter__` no longer accepts a ``reverse`` keyword argument so that it matches the signature of :meth:`container.__iter__`. - Set the ``__module__`` attribute of various :mod:`bidict` types (using :func:`sys._getframe` when necessary) so that private, internal modules are not exposed e.g. in classes' repr strings. - ``namedbidict`` now immediately raises :class:`TypeError` if the provided ``base_type`` does not provide ``_isinv`` or :meth:`~object.__getstate__`, rather than succeeding with a class whose instances may raise :class:`AttributeError` when these attributes are accessed. 0.20.0 (2020-07-23) ------------------- The following breaking changes are expected to affect few if any users. Remove APIs deprecated in the previous release: - ``bidict.OVERWRITE`` and ``bidict.IGNORE``. - The ``on_dup_key``, ``on_dup_val``, and ``on_dup_kv`` arguments of :meth:`~bidict.MutableBidict.put` and :meth:`~bidict.MutableBidict.putall`. - The ``on_dup_key``, ``on_dup_val``, and ``on_dup_kv`` :class:`~bidict.bidict` class attributes. - Remove ``bidict.BidirectionalMapping.__subclasshook__`` due to lack of use and maintenance cost. Fixes a bug introduced in 0.15.0 that caused any class with an ``inverse`` attribute to be incorrectly considered a subclass of :class:`collections.abc.Mapping`. :issue:`111` 0.19.0 (2020-01-09) ------------------- - Drop support for Python 2 :ref:`as promised in v0.18.2 `. The ``bidict.compat`` module has been pruned accordingly. This makes bidict more efficient on Python 3 and enables further improvement to bidict in the future. - Deprecate ``bidict.OVERWRITE`` and ``bidict.IGNORE``. A :class:`UserWarning` will now be emitted if these are used. :attr:`bidict.DROP_OLD` and :attr:`bidict.DROP_NEW` should be used instead. - Rename ``DuplicationPolicy`` to :class:`~bidict.OnDupAction` (and implement it via an :class:`~enum.Enum`). An :class:`~bidict.OnDupAction` may be one of :attr:`~bidict.RAISE`, :attr:`~bidict.DROP_OLD`, or :attr:`~bidict.DROP_NEW`. - Expose the new :class:`~bidict.OnDup` class to contain the three :class:`~bidict.OnDupAction`\s that should be taken upon encountering the three kinds of duplication that can occur (*key*, *val*, *kv*). - Provide the :attr:`~bidict.ON_DUP_DEFAULT`, :attr:`~bidict.ON_DUP_RAISE`, and :attr:`~bidict.ON_DUP_DROP_OLD` :class:`~bidict.OnDup` convenience instances. - Deprecate the ``on_dup_key``, ``on_dup_val``, and ``on_dup_kv`` arguments of :meth:`~bidict.MutableBidict.put` and :meth:`~bidict.MutableBidict.putall`. A :class:`UserWarning` will now be emitted if these are used. These have been subsumed by the new *on_dup* argument, which takes an :class:`~bidict.OnDup` instance. Use it like this: ``bi.put(1, 2, OnDup(key=RAISE, val=...))``. Or pass one of the instances already provided, such as :attr:`~bidict.ON_DUP_DROP_OLD`. Or just don't pass an *on_dup* argument to use the default value of :attr:`~bidict.ON_DUP_RAISE`. The :ref:`basic-usage:Values Must Be Unique` docs have been updated accordingly. - Deprecate the ``on_dup_key``, ``on_dup_val``, and ``on_dup_kv`` :class:`~bidict.bidict` class attributes. A :class:`UserWarning` will now be emitted if these are used. These have been subsumed by the new :attr:`~bidict.BidictBase.on_dup` class attribute, which takes an :class:`~bidict.OnDup` instance. See the updated :doc:`extending` docs for example usage. - Improve the more efficient implementations of ``bidict.BidirectionalMapping.keys``, ``bidict.BidirectionalMapping.values``, and ``bidict.BidirectionalMapping.items``, and now also provide a more efficient implementation of ``bidict.BidirectionalMapping.__iter__`` by delegating to backing :class:`dict`\s in the bidict types for which this is possible. - Move :meth:`bidict.BidictBase.values` to ``bidict.BidirectionalMapping.values``, since the implementation is generic. - No longer use ``__all__`` in :mod:`bidict`'s ``__init__.py``. 0.18.4 (2020-11-02) ------------------- - Backport fix from v0.20.0 that removes ``bidict.BidirectionalMapping.__subclasshook__`` due to lack of use and maintenance cost. 0.18.3 (2019-09-22) ------------------- - Improve validation of names passed to ``namedbidict``: Use :meth:`str.isidentifier` on Python 3, and a better regex on Python 2. - On Python 3, set :attr:`~definition.__qualname__` on ``namedbidict`` classes based on the provided ``typename`` argument. 0.18.2 (2019-09-08) ------------------- - Warn that Python 2 support will be dropped in a future release when Python 2 is detected. 0.18.1 (2019-09-03) ------------------- - Fix a regression introduced by the memory optimizations added in 0.15.0 which caused :func:`deepcopied ` and :func:`unpickled ` bidicts to have their inverses set incorrectly. :issue:`94` 0.18.0 (2019-02-14) ------------------- - Rename ``bidict.BidirectionalMapping.inv`` to :attr:`~bidict.BidirectionalMapping.inverse` and make :attr:`bidict.BidictBase.inv` an alias for :attr:`~bidict.BidictBase.inverse`. :issue:`86` - ``bidict.BidirectionalMapping.__subclasshook__`` now requires an ``inverse`` attribute rather than an ``inv`` attribute for a class to qualify as a virtual subclass. This breaking change is expected to affect few if any users. - Add Python 2/3-compatible ``bidict.compat.collections_abc`` alias. - Stop testing Python 3.4 on CI, and warn when Python 3 < 3.5 is detected rather than Python 3 < 3.3. Python 3.4 reaches `end of life `__ on 2019-03-18. As of January 2019, 3.4 represents only about 3% of bidict downloads on `PyPI Stats `__. 0.17.5 (2018-11-19) ------------------- Improvements to performance and delegation logic, with minor breaking changes to semi-private APIs. - Remove the ``__delegate__`` instance attribute added in the previous release. It was overly general and not worth the cost. Instead of checking ``self.__delegate__`` and delegating accordingly each time a possibly-delegating method is called, revert back to using "delegated-to-fwdm" mixin classes (now found in ``bidict._delegating_mixins``), and resurrect a mutable bidict parent class that omits the mixins as :class:`bidict.MutableBidict`. - Rename ``__repr_delegate__`` to ``_repr_delegate``. 0.17.4 (2018-11-14) ------------------- Minor code, interop, and (semi-)private API improvements. - :class:`~bidict.OrderedBidict` optimizations and code improvements. Use ``bidict``\s for the backing ``_fwdm`` and ``_invm`` mappings, obviating the need to store key and value data in linked list nodes. - Refactor proxied- (i.e. delegated-) to-``_fwdm`` logic for better composability and interoperability. Drop the ``_Proxied*`` mixin classes and instead move their methods into :class:`~bidict.BidictBase`, which now checks for an object defined by the ``BidictBase.__delegate__`` attribute. The ``BidictBase.__delegate__`` object will be delegated to if the method is available on it, otherwise a default implementation (e.g. inherited from :class:`~collections.abc.Mapping`) will be used otherwise. Subclasses may set ``__delegate__ = None`` to opt out. Consolidate ``_MutableBidict`` into :class:`bidict.bidict` now that the dropped mixin classes make it unnecessary. - Change ``__repr_delegate__`` to simply take a type like :class:`dict` or :class:`list`. - Upgrade to latest major `sortedcontainers `__ version (from v1 to v2) for the :ref:`extending:\`\`SortedBidict\`\` Recipes`. - ``bidict.compat.{view,iter}{keys,values,items}`` on Python 2 no longer assumes the target object implements these methods, as they're not actually part of the :class:`~collections.abc.Mapping` interface, and provides fallback implementations when the methods are unavailable. This allows the :ref:`extending:\`\`SortedBidict\`\` Recipes` to continue to work with sortedcontainers v2 on Python 2. 0.17.3 (2018-09-18) ------------------- - Improve packaging by adding a pyproject.toml and by including more supporting files in the distribution. `#81 `__ - Drop pytest-runner and support for running tests via ``python setup.py test`` in preference to ``pytest`` or ``python -m pytest``. 0.17.2 (2018-04-30) ------------------- **Memory usage improvements** - Use less memory in the linked lists that back :class:`~bidict.OrderedBidict`\s by storing node data unpacked rather than in (key, value) tuple objects. 0.17.1 (2018-04-28) ------------------- **Bugfix Release** Fix a regression in 0.17.0 that could cause erroneous behavior when updating items of an :class:`~bidict.OrderedBidict`'s inverse, e.g. ``some_ordered_bidict.inv[foo] = bar``. 0.17.0 (2018-04-25) ------------------- **Speedups and memory usage improvements** - Pass :meth:`~bidict.BidictBase.keys`, :meth:`~bidict.BidictBase.values`, and :meth:`~bidict.BidictBase.items` calls (as well as their ``iter*`` and ``view*`` counterparts on Python 2) through to the backing ``_fwdm`` and ``_invm`` dicts so that they run as fast as possible (i.e. at C speed on CPython), rather than using the slower implementations inherited from :class:`collections.abc.Mapping`. - Use weakrefs in the linked lists that back :class:`~bidict.OrderedBidict`\s to avoid creating strong reference cycles. Memory for an ordered bidict that you create can now be reclaimed in CPython as soon as you no longer hold any references to it, rather than having to wait until the next garbage collection. `#71 `__ **Misc** - Add ``bidict.__version_info__`` attribute to complement ``bidict.__version__``. 0.16.0 (2018-04-06) ------------------- Minor code and efficiency improvements to :func:`~bidict.inverted` and ``bidict._iter._iteritems_args_kw`` (formerly ``bidict.pairs()``). **Minor Breaking API Changes** The following breaking changes are expected to affect few if any users. - Rename ``bidict.pairs()`` → ``bidict._iter._iteritems_args_kw``. 0.15.0 (2018-03-29) ------------------- **Speedups and memory usage improvements** - Use :ref:`slots` to speed up bidict attribute access and reduce memory usage. On Python 3, instantiating a large number of bidicts now uses ~57% the amount of memory that it used before, and on Python 2 only ~33% the amount of memory that it used before, in a simple but representative `benchmark `__. - Use weakrefs to refer to a bidict's inverse internally, no longer creating a strong reference cycle. Memory for a bidict that you create can now be reclaimed in CPython as soon as you no longer hold any references to it, rather than having to wait for the next garbage collection. See the new :ref:`addendum:\`\`bidict\`\` Avoids Reference Cycles` documentation. :issue:`24` - Make :func:`bidict.BidictBase.__eq__` significantly more speed- and memory-efficient when comparing to a non-:class:`dict` :class:`~collections.abc.Mapping`. (``Mapping.__eq__()``\'s inefficient implementation will now never be used.) The implementation is now more reusable as well. - Make :func:`bidict.OrderedBidictBase.__iter__` as well as equality comparison slightly faster for ordered bidicts. **Minor Bugfixes** - ``namedbidict`` now verifies that the provided ``keyname`` and ``valname`` are distinct, raising :class:`ValueError` if they are equal. - ``namedbidict`` now raises :class:`TypeError` if the provided ``base_type`` is not a :class:`~bidict.BidirectionalMapping`. - If you create a custom bidict subclass whose ``_fwdm_cls`` differs from its ``_invm_cls`` (as in the ``FwdKeySortedBidict`` example from the :ref:`extending:\`\`SortedBidict\`\` Recipes`), the inverse bidirectional mapping type (with ``_fwdm_cls`` and ``_invm_cls`` swapped) is now correctly computed and used automatically for your custom bidict's :attr:`~bidict.BidictBase.inverse` bidict. **Misc** - Classes no longer have to provide an ``__inverted__`` attribute to be considered virtual subclasses of :class:`~bidict.BidirectionalMapping`. - If :func:`bidict.inverted` is passed an object with an ``__inverted__`` attribute, it now ensures it is :func:`callable` before returning the result of calling it. - :func:`~bidict.BidictBase.__repr__` no longer checks for a ``__reversed__`` method to determine whether to use an ordered or unordered-style repr. It now calls the new ``__repr_delegate__`` instead (which may be overridden if needed), for better composability. **Minor Breaking API Changes** The following breaking changes are expected to affect few if any users. - Split back out the :class:`~bidict.BidictBase` class from :class:`~bidict.frozenbidict` and :class:`~bidict.OrderedBidictBase` from ``FrozenOrderedBidict``, reverting the merging of these in 0.14.0. Having e.g. ``issubclass(bidict, frozenbidict) == True`` was confusing, so this change restores ``issubclass(bidict, frozenbidict) == False``. See the updated :ref:`other-bidict-types:Bidict Types Diagram` and :ref:`other-bidict-types:Polymorphism` documentation. - Rename: - ``bidict.BidictBase.fwdm`` → ``._fwdm`` - ``bidict.BidictBase.invm`` → ``._invm`` - ``bidict.BidictBase.fwd_cls`` → ``._fwdm_cls`` - ``bidict.BidictBase.inv_cls`` → ``._invm_cls`` - ``bidict.BidictBase.isinv`` → ``._isinv`` Though overriding ``_fwdm_cls`` and ``_invm_cls`` remains supported (see :doc:`extending`), this is not a common enough use case to warrant public names. Most users do not need to know or care about any of these. - The :attr:`~bidict.RAISE`, ``OVERWRITE``, and ``IGNORE`` duplication policies are no longer available as attributes of ``DuplicationPolicy``, and can now only be accessed as attributes of the :mod:`bidict` module namespace, which was the canonical way to refer to them anyway. It is now no longer possible to create an infinite chain like ``DuplicationPolicy.RAISE.RAISE.RAISE...`` - Make ``bidict.pairs()`` and :func:`bidict.inverted` no longer importable from ``bidict.util``, and now only importable from the top-level :mod:`bidict` module. (``bidict.util`` was renamed ``bidict._util``.) - Pickling ordered bidicts now requires at least version 2 of the pickle protocol. If you are using Python 3, :obj:`pickle.DEFAULT_PROTOCOL` is 3 anyway, so this will not affect you. However if you are using in Python 2, :obj:`~pickle.DEFAULT_PROTOCOL` is 0, so you must now explicitly specify the version in your :func:`pickle.dumps` calls, e.g. ``pickle.dumps(ob, 2)``. bidict-0.24.1/CLAUDE.md000066400000000000000000000066051524342314000143200ustar00rootroot00000000000000# CLAUDE.md This file provides guidance to Claude Code (claude.ai/code) when working with code in this repository. ## Orientation `bidict` is a mature, dependency-free bidirectional mapping library for Python (>=3.11, CPython + PyPy). The public API is small; the value is in the carefully-factored, fully type-hinted implementation. Optimize for correctness, API stability, and long-term maintainability over cleverness. There are **zero runtime dependencies** (standard library only) — do not add any. ## Canonical docs (imported so their content is in-session) These human-facing docs are the single source of truth. When the underlying facts change, update *them* rather than duplicating anything here: - Contributor workflow — dev environment, running tests and checks, single-test invocation, the property-based (Hypothesis) testing approach, code style and lint, commit conventions, the Semantic Line Breaks prose convention, and the fact that doctests in modules and `docs/*.rst` run as tests: @CONTRIBUTING.rst - Architecture, code structure, and the guided "code review nav" reading order through the source: @docs/learning-from-bidict.rst - Extending bidict — custom subclasses, `on_dup` policies, dynamic inverse-class generation: @docs/extending.rst ## Working in this codebase (Claude-specific notes) - Run dev tooling through the Nix dev shell, not the bare `.venv`: prefix commands with `nix develop --command bash -c '...'` (or work from within a `nix develop` shell). `prek`, `tox`, and the docs build are provided only by the Nix shell, so invoking them outside it fails with "command not found" — even though `pytest` and `ty` happen to also be in `.venv`, which makes it easy to forget. The committed `.envrc` (`use flake`) does not help here, because direnv has no hook in the non-interactive subshells spawned for these tool calls. - SemBr ([Semantic Line Breaks](https://sembr.org), see CONTRIBUTING.rst) applies to prose in Markdown and reStructuredText documents only (this file, `CONTRIBUTING.rst`, `docs/*.rst`): one sentence per line, breaking at clause boundaries, don't reflow paragraphs to fill columns. It does *not* apply to code, code comments, docstrings, or commit messages. - Follow the "Code review nav" banner comments at the top and bottom of each key file (start in `bidict/__init__.py`); they define the author's intended reading order. `_base.py`'s `BidictBase` is the heart of the library. - `_base.py` holds the subtle machinery, each piece explained in inline comments — **read those comments before editing** the relevant code. The landmarks to be careful around: - a bidict and its `.inverse` **share** the same two backing dicts (`_fwdm`/`_invm`, swapped), so mutations through either are visible in both; - the `inverse` property's strong-ref/weakref pair, which exposes the inverse without creating a reference cycle; - `_ensure_inv_cls`/`_make_inv_cls`, which synthesize a distinct inverse class when the forward and inverse backing types differ (intentionally corecursive with `__init_subclass__`); - the `_dedup` → `_write` mutation path, which records "unwrites" so a failing bulk `_update` rolls back atomically. - Every source file carries the MPL-2.0 header — include it on new files. Public API changes must be reflected in `CHANGELOG.rst` and the relevant `docs/*.rst`. bidict-0.24.1/CODE_OF_CONDUCT.md000066400000000000000000000002501524342314000156260ustar00rootroot00000000000000Please see [CODE_OF_CONDUCT.rst](CODE_OF_CONDUCT.rst) This file is here to work around the GitHub bug discussed in https://github.com/github/feedback/discussions/9442 bidict-0.24.1/CODE_OF_CONDUCT.rst000066400000000000000000000004301524342314000160360ustar00rootroot00000000000000Code of Conduct =============== All interaction in the bidict community should adhere to the `Python Community Code of Conduct `__. You can report any Code of Conduct issues via email to `jabronson@gmail.com `__. bidict-0.24.1/CONTRIBUTING.rst000066400000000000000000000232561524342314000155030ustar00rootroot00000000000000.. Forward declarations for all the custom interpreted text roles that Sphinx defines and that are used below. This helps Sphinx-unaware tools (e.g. rst2html, PyPI's and GitHub's renderers, etc.). .. role:: doc .. role:: ref Contributors' Guide =================== Bug reports, feature requests, patches, and other contributions are warmly welcomed. Contribution should be as easy and friendly as possible. Below are a few guidelines contributors should follow to facilitate the process. Getting Started --------------- - `Create a GitHub account `__ if you don't have one already. - Search through the `tracker `__ to see if an issue or pull request has already been created for what you're interested in. If so, feel free to add comments to it or just hit the "subscribe" button to follow progress. If not, you can post in the `GitHub Discussions forum `__, or go ahead and `create a new issue `__: - Clearly describe the issue giving as much relevant context as possible. - If it is a bug, include reproduction steps, all known environments in which the bug is exhibited, and ideally a failing test case. - If you would like to contribute a patch, make sure you've `created your own fork `__ and have cloned it to your computer. Making Changes -------------- - To set up a development environment: - If you have `Nix `__, run ``nix develop`` from within your clone to start a shell where all supported Python versions as well as ``prek`` are installed and added to your PATH. This also pins ``uv`` to the flake-provided default Python when initializing ``.venv``. - Otherwise, manually ensure you have `uv `__, `prek `__, and at least the latest `stable Python version `__ installed and on your PATH. - Run ``./init_dev_env`` This installs the ``prek``-based pre-commit hook in your clone, and creates a virtualenv with all the development dependencies installed. - Note that `prek `__ is used to help achieve uniform code style and quality standards at commit time. - Create a topic branch off of ``main`` for your changes: ``git checkout -b main`` - Make commits of logical units. - Match the existing code style and quality standards. If you're adding a feature, include accompanying tests and documentation demonstrating its correctness and usage. - Run the tests locally with `tox `__ to make sure they pass for all supported Python versions (see ``envlist`` in ``tox.ini`` for the complete list). If you do not have all the referenced Python versions available locally, you can also push the changes on your branch to GitHub to automatically trigger a new `GitHub Actions `__ build, which should run the tests for all supported Python versions. Testing your changes with GitHub Actions will require approval from a project admin the first time you submit a PR. - Create a concise but comprehensive commit message in the following style:: Include an example commit message in CONTRIBUTING guide #9999 Without this patch the CONTRIBUTING guide would contain no examples of a model commit message. This is a problem because the contributor is left to imagine what the commit message should look like and may not get it right. This patch fixes the problem by providing a concrete example. The first line is an imperative statement summarizing the changes with an issue number from the tracker. The body describes the behavior without the patch, why it's a problem, and how the patch fixes the problem. Running Tests and Checks ------------------------ The commands below assume you have an active development environment, set up per the steps above. Commands that run against the ``./init_dev_env`` virtualenv (such as ``pytest``) can be prefixed with ``uv run`` or run after activating ``.venv``. Note, however, that ``prek`` — used by the lint, format, and style hooks, including via ``tox -e lint`` — is provided by the ``nix develop`` shell (or your own PATH, if you installed it manually per the setup steps above), not by the ``./init_dev_env`` virtualenv, so run those from within ``nix develop`` (or otherwise ensure ``prek`` is on your PATH). - Run the test suite on your current Python: ``pytest`` - Run a single test: ``pytest tests/test_bidict.py::test_frozenbidicts_hashable`` - Run the tests for every supported Python version: ``tox`` (see ``envlist`` in ``tox.ini`` for the list). - Type-check the code: ``ty check`` - Run all the lint, format, and style hooks: ``prek run --all-files`` (equivalently, ``tox -e lint``). - Build the docs: ``tox -e docs``. Note that the test suite (configured under ``[tool.pytest]`` in ``pyproject.toml``) executes the doctests in every module's docstrings **as well as** the code blocks in ``docs/*.rst`` files. In other words, example code in docstrings and docs is run as part of the tests, so be sure to keep it correct and up to date. Most of bidict's tests are property-based, written using `Hypothesis `__. The bulk of the suite lives in ``tests/test_bidict.py``, centered on ``BidictStateMachine`` (a `stateful `__ ``RuleBasedStateMachine``) that checks bidict's invariants against a simpler reference model, with user-defined bidict subclass fixtures in ``tests/bidict_test_fixtures.py``. When adding behavior, prefer extending these properties and invariants (and adding doctests where they help document usage) over adding one-off, example-based tests. Documentation and Prose Style ----------------------------- Prose in bidict's Markdown and reStructuredText documents (this file, the ``*.rst`` files under ``docs/``, etc.) follows `Semantic Line Breaks `__ (SemBr): start a new line after each sentence, and optionally at other natural boundaries between clauses or phrases, rather than hard-wrapping at a fixed column width or placing an entire paragraph on a single line. Because both Markdown and reStructuredText collapse a single line break within a paragraph into a space, this keeps the rendered output unchanged while making diffs smaller and easier to review. This convention applies to these prose documents only, not to code, code comments, docstrings, or commit messages. Submitting Changes ------------------ - Push your changes to a topic branch in your fork of the repository: ``git push --set-upstream origin `` - Submit a pull request providing any additional relevant details necessary. - Acknowledgment should typically be fast but please allow 1-2 weeks for a full response / code review. - The code review process often involves some back-and-forth to get everything right before merging. This is typical of quality software projects that accept patches. - All communication should be supportive and appreciative of good faith efforts to contribute, creating a welcoming and inclusive community. Sponsoring ---------- .. Some of the following badges are duplicated on other pages. Would use `.. include::` but GitHub's renderer doesn't support it. .. image:: https://img.shields.io/badge/GitHub-sponsor-ff69b4 :target: https://github.com/sponsors/jab :alt: Sponsor through GitHub .. image:: https://img.shields.io/badge/PayPal-sponsor-blue.svg :target: https://www.paypal.com/cgi-bin/webscr?cmd=_xclick&business=jabronson%40gmail%2ecom&lc=US&item_name=Sponsor%20bidict :alt: Sponsor through PayPal Bidict is the product of thousands of hours of my unpaid work over the 20 years that I've been the sole maintainer. If bidict has helped you or your company accomplish your work, please sponsor my work through one of the following, and/or ask your company to do the same: - `GitHub `__ - `PayPal `__ - `Tidelift `__ - `thanks.dev `__ - `Gumroad `__ - `a support engagement with my LLC `__ If you're not sure which to use, GitHub is an easy option, especially if you already have a GitHub account. Just choose a monthly or one-time amount, and GitHub handles everything else. Your bidict sponsorship on GitHub will automatically go on the same regular bill as any other GitHub charges you pay for. PayPal is another easy option for one-time contributions. See the following for rationale and examples of companies supporting the open source projects they depend on in this manner: - ``__ - ``__ - ``__ .. - ``__ .. - ``__ .. - ``__ Code of Conduct --------------- All participation in this project should respect the :doc:`code-of-conduct`. [#fn-coc]_ By participating, you are expected to honor this code. .. [#fn-coc] ``__ | ``__ bidict-0.24.1/LICENSE000066400000000000000000000406201524342314000140410ustar00rootroot00000000000000Mozilla Public License Version 2.0 ================================== Copyright 2009-2026 Joshua Bronson. All rights reserved. 1. Definitions -------------- 1.1. "Contributor" means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software. 1.2. "Contributor Version" means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor's Contribution. 1.3. "Contribution" means Covered Software of a particular Contributor. 1.4. "Covered Software" means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof. 1.5. "Incompatible With Secondary Licenses" means (a) that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or (b) that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License. 1.6. "Executable Form" means any form of the work other than Source Code Form. 1.7. "Larger Work" means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software. 1.8. "License" means this document. 1.9. "Licensable" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License. 1.10. "Modifications" means any of the following: (a) any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or (b) any new file in Source Code Form that contains any Covered Software. 1.11. "Patent Claims" of a Contributor means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version. 1.12. "Secondary License" means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses. 1.13. "Source Code Form" means the form of the work preferred for making modifications. 1.14. "You" (or "Your") means an individual or a legal entity exercising rights under this License. For legal entities, "You" includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, "control" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity. 2. License Grants and Conditions -------------------------------- 2.1. Grants Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license: (a) under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and (b) under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version. 2.2. Effective Date The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution. 2.3. Limitations on Grant Scope The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor: (a) for any code that a Contributor has removed from Covered Software; or (b) for infringements caused by: (i) Your and any other third party's modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or (c) under Patent Claims infringed by Covered Software in the absence of its Contributions. This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4). 2.4. Subsequent Licenses No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3). 2.5. Representation Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License. 2.6. Fair Use This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents. 2.7. Conditions Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1. 3. Responsibilities ------------------- 3.1. Distribution of Source Form All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients' rights in the Source Code Form. 3.2. Distribution of Executable Form If You distribute Covered Software in Executable Form then: (a) such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and (b) You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients' rights in the Source Code Form under this License. 3.3. Distribution of a Larger Work You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s). 3.4. Notices You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies. 3.5. Application of Additional Terms You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction. 4. Inability to Comply Due to Statute or Regulation --------------------------------------------------- If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it. 5. Termination -------------- 5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice. 5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate. 5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination. ************************************************************************ * * * 6. Disclaimer of Warranty * * ------------------------- * * * * Covered Software is provided under this License on an "as is" * * basis, without warranty of any kind, either expressed, implied, or * * statutory, including, without limitation, warranties that the * * Covered Software is free of defects, merchantable, fit for a * * particular purpose or non-infringing. The entire risk as to the * * quality and performance of the Covered Software is with You. * * Should any Covered Software prove defective in any respect, You * * (not any Contributor) assume the cost of any necessary servicing, * * repair, or correction. This disclaimer of warranty constitutes an * * essential part of this License. No use of any Covered Software is * * authorized under this License except under this disclaimer. * * * ************************************************************************ ************************************************************************ * * * 7. Limitation of Liability * * -------------------------- * * * * Under no circumstances and under no legal theory, whether tort * * (including negligence), contract, or otherwise, shall any * * Contributor, or anyone who distributes Covered Software as * * permitted above, be liable to You for any direct, indirect, * * special, incidental, or consequential damages of any character * * including, without limitation, damages for lost profits, loss of * * goodwill, work stoppage, computer failure or malfunction, or any * * and all other commercial damages or losses, even if such party * * shall have been informed of the possibility of such damages. This * * limitation of liability shall not apply to liability for death or * * personal injury resulting from such party's negligence to the * * extent applicable law prohibits such limitation. Some * * jurisdictions do not allow the exclusion or limitation of * * incidental or consequential damages, so this exclusion and * * limitation may not apply to You. * * * ************************************************************************ 8. Litigation ------------- Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party's ability to bring cross-claims or counter-claims. 9. Miscellaneous ---------------- This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor. 10. Versions of the License --------------------------- 10.1. New Versions Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number. 10.2. Effect of New Versions You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward. 10.3. Modified Versions If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License). 10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached. Exhibit A - Source Code Form License Notice ------------------------------------------- This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/. If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice. You may add additional accurate notices of copyright ownership. Exhibit B - "Incompatible With Secondary Licenses" Notice --------------------------------------------------------- This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0. bidict-0.24.1/PYPI_DOWNLOAD_STATS.rst000066400000000000000000000003341524342314000166120ustar00rootroot00000000000000Retrieving PyPI Download Stats ------------------------------ * https://pepy.tech/project/bidict * https://pypi.org/project/pypistats/ * https://packaging.python.org/en/latest/guides/analyzing-pypi-package-downloads/ bidict-0.24.1/README.rst000066400000000000000000000172401524342314000145250ustar00rootroot00000000000000.. role:: doc .. (Forward declaration for the "doc" role that Sphinx defines for interop with renderers that are often used to show this doc and that are unaware of Sphinx (GitHub.com, PyPI.org, etc.). Use :doc: rather than :ref: here for better interop as well.) bidict ====== *The bidirectional mapping library for Python.* Status ------ .. image:: https://img.shields.io/pypi/v/bidict.svg :target: https://pypi.org/project/bidict :alt: Latest release .. image:: https://img.shields.io/readthedocs/bidict/main.svg :target: https://bidict.readthedocs.io/en/main/ :alt: Documentation .. image:: https://github.com/jab/bidict/actions/workflows/test.yml/badge.svg :target: https://github.com/jab/bidict/actions/workflows/test.yml?query=branch%3Amain :alt: GitHub Actions CI status .. image:: https://img.shields.io/pypi/l/bidict.svg :target: https://raw.githubusercontent.com/jab/bidict/main/LICENSE :alt: License .. image:: https://static.pepy.tech/badge/bidict :target: https://pepy.tech/project/bidict :alt: PyPI Downloads .. image:: https://img.shields.io/badge/GitHub-sponsor-ff69b4 :target: https://github.com/sponsors/jab :alt: Sponsor Features -------- - Mature: Depended on by Google, Venmo, CERN, Baidu, Tencent, and teams across the world since 2009 - Familiar, Pythonic APIs that are carefully designed for safety, simplicity, flexibility, and ergonomics - Lightweight, with no runtime dependencies outside Python's standard library - Implemented in concise, well-factored, fully type-hinted Python code that is optimized for running efficiently as well as for long-term maintenance and stability (as well as `joy <#learning-from-bidict>`__) - Extensively `documented `__ - 100% test coverage running continuously across all supported Python versions (including property-based tests and benchmarks) Installation ------------ ``pip install bidict`` Quick Start ----------- .. code:: python >>> from bidict import bidict >>> element_by_symbol = bidict({'H': 'hydrogen'}) >>> element_by_symbol['H'] 'hydrogen' >>> element_by_symbol.inverse['hydrogen'] 'H' For more usage documentation, head to the :doc:`intro` [#fn-intro]_ and proceed from there. Enterprise Support ------------------ Enterprise-level support for bidict can be obtained via the `Tidelift subscription `__ or by `contacting me directly `__. I have a US-based LLC set up for invoicing, and I have over 20 years of professional experience delivering software and support to companies successfully. You can also sponsor my work through several platforms, including GitHub Sponsors. See the `Sponsoring <#sponsoring>`__ section below for details, including rationale and examples of companies supporting the open source projects they depend on. Voluntary Community Support --------------------------- Please search through already-asked questions and answers in `GitHub Discussions `__ and the `issue tracker `__ in case your question has already been addressed. Otherwise, please feel free to `start a new discussion `__ or `create a new issue `__ on GitHub for voluntary community support. Notice of Usage --------------- If you use bidict, and especially if your usage or your organization is significant in some way, please let me know in any of the following ways: - `star bidict on GitHub `__ - post in `GitHub Discussions `__ - `email me `__ Changelog --------- For bidict release notes, see the :doc:`changelog`. [#fn-changelog]_ Release Notifications --------------------- .. duplicated in CHANGELOG.rst: (Would use `.. include::` but GitHub's renderer doesn't support it.) Watch `bidict releases on GitHub `__ to be notified when new versions of bidict are published. Click the "Watch" dropdown, choose "Custom", and then choose "Releases". Learning from bidict -------------------- One of the best things about bidict is that it touches a surprising number of interesting Python corners, especially given its small size and scope. Check out :doc:`learning-from-bidict` [#fn-learning]_ if you're interested in learning more. Contributing ------------ I have been bidict's sole maintainer and `active contributor `__ since I started the project ~15 years ago. Your help would be most welcome! See the :doc:`contributors-guide` [#fn-contributing]_ for more information. Sponsoring ---------- .. duplicated in CONTRIBUTING.rst (Would use `.. include::` but GitHub's renderer doesn't support it.) .. image:: https://img.shields.io/badge/GitHub-sponsor-ff69b4 :target: https://github.com/sponsors/jab :alt: Sponsor through GitHub Bidict is the product of thousands of hours of my unpaid work over the 15+ years that I've been the sole maintainer. If bidict has helped you or your company accomplish your work, please sponsor my work through one of the following, and/or ask your company to do the same: - `GitHub `__ - `PayPal `__ - `Tidelift `__ - `thanks.dev `__ - `Gumroad `__ - `a support engagement with my LLC <#enterprise-support>`__ If you're not sure which to use, GitHub is an easy option, especially if you already have a GitHub account. Just choose a monthly or one-time amount, and GitHub handles everything else. Your bidict sponsorship on GitHub will automatically go on the same regular bill as any other GitHub charges you pay for. PayPal is another easy option for one-time contributions. See the following for rationale and examples of companies supporting the open source projects they depend on in this manner: - ``__ - ``__ - ``__ .. - ``__ .. - ``__ .. - ``__ Finding Documentation --------------------- If you're viewing this on ``__, note that multiple versions of the documentation are available, and you can choose a different version using the popup menu at the bottom-right. Please make sure you're viewing the version of the documentation that corresponds to the version of bidict you'd like to use. If you're viewing this on GitHub, PyPI, or some other place that can't render and link this documentation properly and are seeing broken links, try these alternate links instead: .. [#fn-intro] ``__ | ``__ .. [#fn-changelog] ``__ | ``__ .. [#fn-learning] ``__ | ``__ .. [#fn-contributing] ``__ | ``__ bidict-0.24.1/SECURITY.rst000066400000000000000000000002061524342314000150310ustar00rootroot00000000000000Security ======== Please see `tidelift.com/security `__ for how to report a security issue in bidict. bidict-0.24.1/_typos.toml000066400000000000000000000001311524342314000152370ustar00rootroot00000000000000[default] locale = "en-us" [default.extend-words] bimap = "bimap" slicings = "slicings" bidict-0.24.1/bidict/000077500000000000000000000000001524342314000142705ustar00rootroot00000000000000bidict-0.24.1/bidict/__init__.py000066400000000000000000000100061524342314000163760ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # ============================================================================ # * Welcome to the bidict source code * # ============================================================================ # Reading through the code? You'll find a "Code review nav" comment like the one # below at the top and bottom of the key source files. Follow these cues to take # a path through the code that's optimized for familiarizing yourself with it. # # If you're not reading this on https://github.com/jab/bidict already, go there # to ensure you have the latest version of the code. While there, you can also # star the project, watch it for updates, fork the code, and submit an issue or # pull request with any proposed changes. More information can be found linked # from README.rst, which is also shown on https://github.com/jab/bidict. # * Code review nav * # ============================================================================ # Current: __init__.py Next: _abc.py → # ============================================================================ """The bidirectional mapping library for Python. ---- bidict by example: .. code-block:: python >>> from bidict import bidict >>> element_by_symbol = bidict({'H': 'hydrogen'}) >>> element_by_symbol['H'] 'hydrogen' >>> element_by_symbol.inverse['hydrogen'] 'H' Please see https://github.com/jab/bidict for the most up-to-date code and https://bidict.readthedocs.io for the most up-to-date documentation if you are reading this elsewhere. ---- .. :copyright: (c) 2009-2026 Joshua Bronson. .. :license: MPLv2. See LICENSE for details. """ # Use private aliases to not re-export these publicly (for Sphinx automodule with imported-members). from __future__ import annotations as _annotations from contextlib import suppress as _suppress from ._abc import BidirectionalMapping as BidirectionalMapping from ._abc import MutableBidirectionalMapping as MutableBidirectionalMapping from ._base import BidictBase as BidictBase from ._base import BidictKeysView as BidictKeysView from ._base import GeneratedBidictInverse as GeneratedBidictInverse from ._bidict import MutableBidict as MutableBidict from ._bidict import bidict as bidict from ._dup import DROP_NEW as DROP_NEW from ._dup import DROP_OLD as DROP_OLD from ._dup import ON_DUP_DEFAULT as ON_DUP_DEFAULT from ._dup import ON_DUP_DROP_OLD as ON_DUP_DROP_OLD from ._dup import ON_DUP_RAISE as ON_DUP_RAISE from ._dup import RAISE as RAISE from ._dup import OnDup as OnDup from ._dup import OnDupAction as OnDupAction from ._exc import BidictException as BidictException from ._exc import DuplicationError as DuplicationError from ._exc import KeyAndValueDuplicationError as KeyAndValueDuplicationError from ._exc import KeyDuplicationError as KeyDuplicationError from ._exc import ValueDuplicationError as ValueDuplicationError from ._frozen import frozenbidict as frozenbidict from ._iter import inverted as inverted from ._orderedbase import OrderedBidictBase as OrderedBidictBase from ._orderedbidict import OrderedBidict as OrderedBidict # Set __module__ of re-exported classes to the 'bidict' top-level module, so that e.g. # 'bidict.bidict' shows up as 'bidict.bidict` rather than 'bidict._bidict.bidict'. for _obj in tuple(locals().values()): # pragma: no cover if not getattr(_obj, '__module__', '').startswith('bidict.'): continue with _suppress(AttributeError): _obj.__module__ = 'bidict' # * Code review nav * # ============================================================================ # Current: __init__.py Next: _abc.py → # ============================================================================ bidict-0.24.1/bidict/_abc.py000066400000000000000000000062771524342314000155420ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # * Code review nav * # (see comments in __init__.py) # ============================================================================ # ← Prev: __init__.py Current: _abc.py Next: _base.py → # ============================================================================ """Provide the :class:`BidirectionalMapping` abstract base class.""" from __future__ import annotations from abc import abstractmethod from collections.abc import Iterator from collections.abc import Mapping from collections.abc import MutableMapping from ._typing import KT from ._typing import VT class BidirectionalMapping(Mapping[KT, VT]): """Abstract base class for bidirectional mapping types. Extends :class:`collections.abc.Mapping` primarily by adding the (abstract) :attr:`inverse` property, which implementers of :class:`BidirectionalMapping` should override to return a reference to the inverse :class:`BidirectionalMapping` instance. """ __slots__ = () @property @abstractmethod def inverse(self) -> BidirectionalMapping[VT, KT]: """The inverse of this bidirectional mapping instance. *See also* :attr:`bidict.BidictBase.inverse`, :attr:`bidict.BidictBase.inv` :raises NotImplementedError: Meant to be overridden in subclasses. """ # The @abstractmethod decorator prevents subclasses from being instantiated unless they # override this method. But an overriding implementation may merely return super().inverse, # in which case this implementation is used. Raise NotImplementedError to indicate that # subclasses must actually provide their own implementation. raise NotImplementedError def __inverted__(self) -> Iterator[tuple[VT, KT]]: """Get an iterator over the items in :attr:`inverse`. This is functionally equivalent to iterating over the items in the forward mapping and inverting each one on the fly, but this provides a more efficient implementation: Assuming the already-inverted items are stored in :attr:`inverse`, just return an iterator over them directly. Providing this default implementation enables external functions, particularly :func:`~bidict.inverted`, to use this optimized implementation when available, instead of having to invert on the fly. *See also* :func:`bidict.inverted` """ return iter(self.inverse.items()) class MutableBidirectionalMapping(BidirectionalMapping[KT, VT], MutableMapping[KT, VT]): """Abstract base class for mutable bidirectional mapping types.""" __slots__ = () # * Code review nav * # ============================================================================ # ← Prev: __init__.py Current: _abc.py Next: _base.py → # ============================================================================ bidict-0.24.1/bidict/_base.py000066400000000000000000000761721524342314000157300ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # * Code review nav * # (see comments in __init__.py) # ============================================================================ # ← Prev: _abc.py Current: _base.py Next: _frozen.py → # ============================================================================ """Provide :class:`BidictBase`.""" from __future__ import annotations import typing as t import weakref from collections.abc import ItemsView from collections.abc import Iterable from collections.abc import Iterator from collections.abc import KeysView from collections.abc import Mapping from collections.abc import MutableMapping from collections.abc import Reversible from collections.abc import Set from collections.abc import Sized from collections.abc import ValuesView from operator import eq from types import MappingProxyType from ._abc import BidirectionalMapping from ._dup import DROP_NEW from ._dup import DROP_OLD from ._dup import ON_DUP_DEFAULT from ._dup import RAISE from ._dup import OnDup from ._exc import KeyAndValueDuplicationError from ._exc import KeyDuplicationError from ._exc import ValueDuplicationError from ._iter import inverted from ._iter import iteritems from ._typing import KT from ._typing import MISSING from ._typing import OKT from ._typing import OVT from ._typing import VT from ._typing import Maplike from ._typing import MapOrItems from ._typing import override OldKV: t.TypeAlias = tuple[OKT[KT], OVT[VT]] DedupResult: t.TypeAlias = OldKV[KT, VT] | None Unwrites: t.TypeAlias = list[tuple[t.Any, ...]] ReversedIter: t.TypeAlias = t.Callable[['BidictBase[KT, t.Any]'], Iterator[KT]] class BidictKeysView(KeysView[KT], ValuesView[KT]): """Since the keys of a bidict are the values of its inverse (and vice versa), the :class:`~collections.abc.ValuesView` result of calling *bi.values()* is also a :class:`~collections.abc.KeysView` of *bi.inverse*. """ class ProxiedSetView: """Mixin for bidict views whose :class:`~collections.abc.Set` methods delegate to a backing dict view. See :func:`_override_set_methods_to_use_backing_dict`. *_viewname* names the view of *_mapping._fwdm* with the same elements as this view. """ _mapping: BidictBase[t.Any, t.Any] _viewname: t.ClassVar[str] __slots__ = () class BidictValuesView(ProxiedSetView, BidictKeysView[VT]): """The set-like view returned by *bi.values()* for a non-ordered bidict. A bidict's values are the keys of its inverse, so the fast, set-like operations are all provided by viewing the inverse's keys, which this does by taking the *inverse* as its *_mapping*: the inherited __contains__ and __len__ then already do the right thing, and _mapping._fwdm is the backing mapping whose keys are our elements, so the set-method proxy below works unmodified. Iteration is the exception. The inverse's key order is its own backing mapping's, which diverges from this bidict's key order as soon as an item is overwritten. So iterate *this* bidict's backing mapping instead (i.e. the inverse's _invm), to keep b.values() corresponding elementwise to b.keys(), as it does for a plain dict. """ _viewname: t.ClassVar[str] = 'keys' __slots__ = () @override def __iter__(self) -> Iterator[VT]: return iter(self._mapping._invm.values()) def __reversed__(self) -> Iterator[VT]: return reversed(t.cast('Reversible[VT]', self._mapping._invm.values())) class _NonReversibleBidictValuesView(BidictValuesView[VT]): """The values view of a bidict whose backing mappings are not reversible. Setting __reversed__ to None keeps issubclass(cls, Reversible) false, the same way BidictBase._set_reversed() does for the bidict itself, so that this view does not advertise support for reversed() that the backing mappings cannot deliver. """ __reversed__: t.ClassVar[None] = None # type: ignore[assignment] __slots__ = () class BidictBase(BidirectionalMapping[KT, VT]): """Base class implementing :class:`BidirectionalMapping`.""" #: The default :class:`~bidict.OnDup` #: that governs behavior when a provided item #: duplicates the key or value of other item(s). #: #: *See also* #: :ref:`basic-usage:Values Must Be Unique` (https://bidict.rtfd.io/basic-usage.html#values-must-be-unique), #: :doc:`extending` (https://bidict.rtfd.io/extending.html) on_dup = ON_DUP_DEFAULT _fwdm: MutableMapping[KT, VT] #: the backing forward mapping (*key* → *val*) _invm: MutableMapping[VT, KT] #: the backing inverse mapping (*val* → *key*) _fwdm_cls: t.ClassVar[type[MutableMapping[t.Any, t.Any]]] = dict #: class of the backing forward mapping _invm_cls: t.ClassVar[type[MutableMapping[t.Any, t.Any]]] = dict #: class of the backing inverse mapping _fwdm_is_dict: t.ClassVar[bool] = True # When a bidict's `.inverse` property is accessed for the first time, the inverse instance is computed on demand # and stored for subsequent use. A reference back to itself is also stored on the inverse instance at the same time. # A weakref is used in the inverse direction to avoid creating a reference cycle. See :meth:`inverse` _inv: BidictBase[VT, KT] | None _invweak: weakref.ReferenceType[BidictBase[VT, KT]] | None _inv_cls: t.ClassVar[type[BidictBase[t.Any, t.Any]]] # the inverse bidict's class, see :meth:`_ensure_inv_cls` _values_view_cls: t.ClassVar[type[BidictValuesView[t.Any]]] # see :meth:`_set_reversed` def __init_subclass__(cls) -> None: super().__init_subclass__() cls._init_class() @classmethod def _init_class(cls) -> None: cls._fwdm_is_dict = issubclass(cls._fwdm_cls, dict) cls._ensure_inv_cls() cls._set_reversed() __reversed__: t.ClassVar[ReversedIter[t.Any] | None] #: Whether __reversed__ was provided by a user rather than by :meth:`_set_reversed`. #: Inherited, so that a subclass of e.g. :class:`~bidict.OrderedBidictBase` keeps #: the implementation it inherits rather than computing one of its own. _reversed_is_user_provided: t.ClassVar[bool] = False @classmethod def _set_reversed(cls) -> None: """Set __reversed__ for subclasses that do not set it explicitly according to whether backing mappings are reversible. """ backing_reversible = all(issubclass(i, Reversible) for i in (cls._fwdm_cls, cls._invm_cls)) # Leave a user-provided __reversed__ alone, whether it is defined in this class's own # body (e.g. OrderedBidictBase's) or inherited from a base class that defined one # (e.g. OrderedBidict's). Crucially, a value *this* method assigned must not count as # user-provided: a subclass of a bidict whose backing mappings were not reversible # inherits the None assigned below, and must stay free to compute its own answer from # its own backing types, which may well be reversible. resolved = getattr(cls, '__reversed__', None) # Note Mapping.__reversed__ is None, which is what resolves here for BidictBase itself. user_impl = resolved is not None and resolved is not _fwdm_reversed # A user's explicit `__reversed__ = None` opt-out is indistinguishable by value from # the None assigned below, so look for it in the class's own namespace instead. Match # only that exact value: a bare membership test would also match a value assigned by a # previous call of this method, which would then be inherited as if a user had provided it. opted_out = getattr(cls, '__dict__', {}).get('__reversed__', MISSING) is None if user_impl or opted_out: cls._reversed_is_user_provided = True if not cls._reversed_is_user_provided: cls.__reversed__ = _fwdm_reversed if backing_reversible else None # values() iterates a backing mapping (see :meth:`values`), so its view can only # support reversed() if that mapping does, and should not offer it if this bidict # declines to offer reversed() itself. values_reversible = backing_reversible and cls.__reversed__ is not None cls._values_view_cls = BidictValuesView if values_reversible else _NonReversibleBidictValuesView @classmethod def _ensure_inv_cls(cls) -> None: """Ensure :attr:`_inv_cls` is set, computing it dynamically if necessary. All subclasses provided in :mod:`bidict` are their own inverse classes, i.e., their backing forward and inverse mappings are both the same type, but users may define subclasses where this is not the case. This method ensures that the inverse class is computed correctly regardless. See: :ref:`extending:Dynamic Inverse Class Generation` (https://bidict.rtfd.io/extending.html#dynamic-inverse-class-generation) """ # This _ensure_inv_cls() method is (indirectly) corecursive with _make_inv_cls() below # in the case that we need to dynamically generate the inverse class: # 1. _ensure_inv_cls() calls cls._make_inv_cls() # 2. cls._make_inv_cls() calls type(..., (cls, ...), ...) to dynamically generate inv_cls # 3. Our __init_subclass__ hook (see above) is automatically called on inv_cls # 4. inv_cls.__init_subclass__() calls inv_cls._ensure_inv_cls() # 5. inv_cls._ensure_inv_cls() resolves to this implementation # (inv_cls deliberately does not override this), so we're back where we started. # But since the _make_inv_cls() call will have set inv_cls.__dict__._inv_cls, # just check if it's already set before calling _make_inv_cls() to prevent infinite recursion. if getattr(cls, '__dict__', {}).get('_inv_cls'): # Don't assume cls.__dict__ return cls._inv_cls = cls._make_inv_cls() @classmethod def _make_inv_cls(cls) -> type[t.Self]: diff = cls._inv_cls_dict_diff() cls_is_own_inv = all(getattr(cls, k, MISSING) == v for (k, v) in diff.items()) if cls_is_own_inv: return cls # Suppress auto-calculation of _inv_cls's _inv_cls since we know it already. # Works with the guard in BidictBase._ensure_inv_cls() to prevent infinite recursion. diff['_inv_cls'] = cls inv_cls = type(f'{cls.__name__}Inv', (cls, GeneratedBidictInverse), diff) inv_cls.__module__ = cls.__module__ # Point __qualname__ at where this class actually lives, namely cls's _inv_cls attribute, # so that pickle can find it by reference like any other class. Without this it could not # be pickled at all, since nothing else refers to it by name. __name__ is left alone, so # repr() is unaffected. inv_cls.__qualname__ = f'{cls.__qualname__}._inv_cls' return t.cast('type[t.Self]', inv_cls) @classmethod def _inv_cls_dict_diff(cls) -> dict[str, t.Any]: return { '_fwdm_cls': cls._invm_cls, '_invm_cls': cls._fwdm_cls, } def __init__(self, arg: MapOrItems[KT, VT] = (), /, **kw: VT) -> None: """Make a new bidirectional mapping. The signature behaves like that of :class:`dict`. ktems passed via positional arg are processed first, followed by any items passed via keyword argument. Any duplication encountered along the way is handled as per :attr:`on_dup`. """ self._fwdm = self._fwdm_cls() self._invm = self._invm_cls() self._update(arg, kw, rollback=False) @property @override def inverse(self) -> BidictBase[VT, KT]: """The inverse of this bidirectional mapping instance.""" # First check if a strong reference is already stored. inv: BidictBase[VT, KT] | None = getattr(self, '_inv', None) if inv is not None: return inv # Next check if a weak reference is already stored. invweak = getattr(self, '_invweak', None) if invweak is not None: inv = invweak() # Try to resolve a strong reference and return it. if inv is not None: return inv # No luck. Compute the inverse reference and store it for subsequent use. inv = self._make_inverse() self._inv = inv self._invweak = None # Also store a weak reference back to `instance` on its inverse instance, so that # the second `.inverse` access in `bi.inverse.inverse` hits the cached weakref. inv._inv = None inv._invweak = weakref.ref(self) # In e.g. `bidict().inverse.inverse`, this design ensures that a strong reference # back to the original instance is retained before its refcount drops to zero, # avoiding an unintended potential deallocation. return inv def _make_inverse(self) -> BidictBase[VT, KT]: inv: BidictBase[VT, KT] = self._inv_cls() inv._fwdm = self._invm inv._invm = self._fwdm return inv @property def inv(self) -> BidictBase[VT, KT]: """Alias for :attr:`inverse`.""" return self.inverse @override def __repr__(self) -> str: """See :func:`repr`.""" clsname = self.__class__.__name__ items = dict(self.items()) if self else '' return f'{clsname}({items})' @override def values(self) -> BidictKeysView[VT]: """A set-like object providing a view on the contained values. Since the values of a bidict are equivalent to the keys of its inverse, this method returns a set-like object for this bidict's values rather than just a collections.abc.ValuesView. This object supports set operations like union and difference, and constant- rather than linear-time containment checks, and is no more expensive to provide than the less capable collections.abc.ValuesView would be. Like :class:`dict`, and unlike the inverse's :meth:`keys` view, it also yields this bidict's values in the same order as its keys, so that *zip(b.keys(), b.values())* corresponds elementwise to *b.items()*. See :meth:`keys` for more information. """ return self._values_view_cls(self.inverse) @override def keys(self) -> KeysView[KT]: """A set-like object providing a view on the contained keys. When *b._fwdm* is a :class:`dict`, *b.keys()* returns its *dict_keys*, which behaves exactly the same as *collections.abc.KeysView(b)*, except for - offering better performance - being reversible - having a .mapping attribute in Python 3.10+ that exposes a mappingproxy to *b._fwdm*. A :class:`dict` subclass gets the same treatment, via whatever view its own *keys()* returns. Only a backing mapping that is not a :class:`dict` at all falls back to a generic view over this bidict. """ return self._fwdm.keys() if self._fwdm_is_dict else BidictKeysView(self) @override def items(self) -> ItemsView[KT, VT]: """A set-like object providing a view on the contained items. When *b._fwdm* is a :class:`dict`, *b.items()* returns its *dict_items*, which behaves exactly the same as *collections.abc.ItemsView(b)*, except for: - offering better performance - being reversible - having a .mapping attribute in Python 3.10+ that exposes a mappingproxy to *b._fwdm*. See :meth:`keys` for how backing mappings that are not exactly dicts are handled. """ return self._fwdm.items() if self._fwdm_is_dict else super().items() # The inherited collections.abc.Mapping.__contains__() method is implemented by doing a `try` # `except KeyError` around `self[key]`. The following implementation is much faster, # especially in the missing case. @override def __contains__(self, key: t.Any) -> bool: """True if the mapping contains the specified key, else False.""" return key in self._fwdm # The inherited collections.abc.Mapping.__eq__() method is implemented in terms of an inefficient # `dict(self.items()) == dict(other.items())` comparison, so override it with a # more efficient implementation. @override def __eq__(self, other: object) -> bool: """*x.__eq__(other)　⟺　x == other* Equivalent to *dict(x.items()) == dict(other.items())* but more efficient. Note that :meth:`bidict's __eq__() ` implementation is inherited by subclasses, in particular by the ordered bidict subclasses, so even with ordered bidicts, :ref:`== comparison is order-insensitive ` (https://bidict.rtfd.io/other-bidict-types.html#eq-is-order-insensitive). *See also* :meth:`equals_order_sensitive` """ if isinstance(other, Mapping): return self._fwdm.items() == other.items() # Ref: https://docs.python.org/3/library/constants.html#NotImplemented return NotImplemented def equals_order_sensitive(self, other: object) -> bool: """Order-sensitive equality check. *See also* :ref:`eq-order-insensitive` (https://bidict.rtfd.io/other-bidict-types.html#eq-is-order-insensitive) """ if not isinstance(other, Mapping) or len(self) != len(other): return False return all(map(eq, self.items(), other.items())) def _dedup(self, key: KT, val: VT, on_dup: OnDup) -> DedupResult[KT, VT]: """Check *key* and *val* for any duplication in self. Handle any duplication as per the passed in *on_dup*. If (key, val) is already present, return None since writing (key, val) would be a no-op. If duplication is found and the corresponding :class:`~bidict.OnDupAction` is :attr:`~bidict.DROP_NEW`, return None. If duplication is found and the corresponding :class:`~bidict.OnDupAction` is :attr:`~bidict.RAISE`, raise the appropriate exception. If duplication is found and the corresponding :class:`~bidict.OnDupAction` is :attr:`~bidict.DROP_OLD`, or if no duplication is found, return *(oldkey, oldval)*. """ fwdm, invm = self._fwdm, self._invm oldval: OVT[VT] = fwdm.get(key, MISSING) oldkey: OKT[KT] = invm.get(val, MISSING) isdupkey = oldval is not MISSING isdupval = oldkey is not MISSING if isdupkey and isdupval: if fwdm[oldkey] is oldval: return None # (key, val) duplicates an existing item -> no-op # key and val each duplicate a different existing item. if on_dup.val is RAISE: raise KeyAndValueDuplicationError(key, val) if on_dup.val is DROP_NEW: return None assert on_dup.val is DROP_OLD # Fall through to the return statement on the last line. elif isdupkey: if on_dup.key is RAISE: raise KeyDuplicationError(key) if on_dup.key is DROP_NEW: return None assert on_dup.key is DROP_OLD # Fall through to the return statement on the last line. elif isdupval: if on_dup.val is RAISE: raise ValueDuplicationError(val) if on_dup.val is DROP_NEW: return None assert on_dup.val is DROP_OLD # Fall through to the return statement on the last line. # else no key or value duplication. return oldkey, oldval def _write(self, newkey: KT, newval: VT, oldkey: OKT[KT], oldval: OVT[VT], unwrites: Unwrites | None) -> None: """Insert (newkey, newval), extending *unwrites* with associated inverse operations if provided. *oldkey* and *oldval* are as returned by :meth:`_dedup`. If *unwrites* is not None, it is extended with the inverse operations necessary to undo the write. This design allows :meth:`_update` to roll back a partially applied update that fails part-way through when necessary. This design also allows subclasses that require additional operations to easily extend this implementation. For example, :class:`bidict.OrderedBidictBase` calls this inherited implementation, and then extends *unwrites* with additional operations needed to keep its internal linked list nodes consistent with its items' order as changes are made. """ fwdm, invm = self._fwdm, self._invm fwdm_set, invm_set = fwdm.__setitem__, invm.__setitem__ fwdm_del, invm_del = fwdm.__delitem__, invm.__delitem__ # When newkey or newval duplicates one already contained, adopt the object already # contained rather than the one passed in. Otherwise the two backing mappings would end # up referring to equal but distinct objects for the same item, since a dict keeps the # key object it already has when a key is overwritten but takes the new value object. # invm[oldval] is the contained key equal to newkey; fwdm[oldkey] the contained value # equal to newval. This also matches what a plain dict does on overwrite. if oldval is not MISSING: # newkey duplicates a contained key newkey = invm[oldval] if oldkey is not MISSING: # newval duplicates a contained value newval = fwdm[oldkey] # Record each unwrite as soon as its write succeeds, rather than all of them at the end: # a backing mapping is user-supplied (see _fwdm_cls/_invm_cls) and may reject a write, and # if it does, everything written before it still has to be undone. Note that the four # writes below touch four distinct slots, so the order they are undone in does not matter. fwdm_set(newkey, newval) if unwrites is not None: # {0: 1} | {2: 3} => del fwdm[2]; {0: 1} | {0: 3} => fwdm[0] = 1 unwrites.append((fwdm_del, newkey) if oldval is MISSING else (fwdm_set, newkey, oldval)) invm_set(newval, newkey) if unwrites is not None: # {0: 1} | {2: 3} => del invm[3]; {0: 1} | {2: 1} => invm[1] = 0 unwrites.append((invm_del, newval) if oldkey is MISSING else (invm_set, newval, oldkey)) if oldkey is not MISSING: # newval duplicates the value of the item keyed by oldkey # {0: 1, 2: 3} | {4: 3} => {0: 1, 4: 3} fwdm_del(oldkey) if unwrites is not None: unwrites.append((fwdm_set, oldkey, newval)) if oldval is not MISSING: # newkey duplicates the key of the item valued by oldval # {0: 1, 2: 3} | {2: 4} => {0: 1, 2: 4} invm_del(oldval) if unwrites is not None: unwrites.append((invm_set, oldval, newkey)) def _update( self, arg: MapOrItems[KT, VT], kw: Mapping[str, VT] = MappingProxyType({}), *, rollback: bool = True, on_dup: OnDup | None = None, ) -> None: """Update with the items from *arg* and *kw*, failing clean as per *rollback*. When *rollback* is true (the default), a failure part-way through leaves self exactly as it was before the update was attempted. Callers pass rollback=False only when self is a throwaway instance that is discarded if the update fails, and so has nothing to roll back to. """ # Note: We must process input in a single pass, since arg may be a generator. if not isinstance(arg, (Iterable, Maplike)): raise TypeError(f"'{arg.__class__.__name__}' object is not iterable") if not arg and not kw: return if on_dup is None: on_dup = self.on_dup # Fast path when we're empty and updating only from another bidict (i.e. no dup vals in new items). if not self and not kw and isinstance(arg, BidictBase): self._init_from(arg) return # Fast path when we're adding more items than we contain already and rollback is enabled: # Update a copy of self with rollback disabled. Fail if that fails, otherwise become the copy. if rollback and isinstance(arg, Sized) and len(arg) + len(kw) > len(self): tmp = self.copy() tmp._update(arg, kw, rollback=False, on_dup=on_dup) self._init_from(tmp) return # In all other cases, benchmarking has indicated that the update is best implemented as follows: # For each new item, perform a dup check (raising if necessary), and apply the associated writes we need to # perform on our backing _fwdm and _invm mappings. If rollback is enabled, also compute the associated unwrites # as we go. If item unpacking, duplication checking, or writing raises while rollback is enabled, apply the # accumulated unwrites before re-raising, to ensure that we fail clean. write = self._write unwrites: Unwrites | None = [] if rollback else None try: for key, val in iteritems(arg, **kw): dedup_result = self._dedup(key, val, on_dup) if dedup_result is not None: write(key, val, *dedup_result, unwrites=unwrites) except Exception: if unwrites is not None: for fn, *args in reversed(unwrites): fn(*args) raise def __copy__(self) -> t.Self: """Used for the copy protocol. See the :mod:`copy` module.""" return self.copy() def copy(self) -> t.Self: """Make a (shallow) copy of this bidict.""" # Could just `return self.__class__(self)` here, but the below is faster. The former # would copy this bidict's items into a new instance one at a time (checking for duplication # for each item), whereas the below copies from the backing mappings all at once, and foregoes # item-by-item duplication checking since the backing mappings have been checked already. return self._from_other(self) @classmethod def _from_other(cls, other: MapOrItems[KT, VT]) -> t.Self: """Fast, private constructor based on :meth:`_init_from`.""" inst = cls() inst._init_from(other) return inst def _init_from(self, other: MapOrItems[KT, VT]) -> None: """Fast init from *other*, bypassing item-by-item duplication checking.""" self._fwdm.clear() self._invm.clear() self._fwdm.update(other) # If other is a bidict, use its existing backing inverse mapping, otherwise # other could be a generator that's now exhausted, so invert self._fwdm on the fly. if isinstance(other, BidictBase): self._invm.update(t.cast('BidictBase[KT, VT]', other).inverse) else: self._invm.update(inverted(self._fwdm)) # other's type is Mapping rather than Maplike since bidict() | SupportsKeysAndGetItem({}) # raises a TypeError, just like dict() | SupportsKeysAndGetItem({}) does. def __or__(self, other: Mapping[KT, VT]) -> t.Self: """Return self|other.""" if not isinstance(other, Mapping): return NotImplemented new = self.copy() new._update(other, rollback=False) return new def __ror__(self, other: Mapping[KT, VT]) -> t.Self: """Return other|self.""" if not isinstance(other, Mapping): return NotImplemented # False positive in ty: https://github.com/astral-sh/ty/issues/4278 new = self.__class__(other) # ty: ignore[invalid-argument-type] new._update(self, rollback=False) return new @override def __len__(self) -> int: """The number of contained items.""" return len(self._fwdm) @override def __iter__(self) -> Iterator[KT]: """Iterator over the contained keys.""" return iter(self._fwdm) @override def __getitem__(self, key: KT) -> VT: """*x.__getitem__(key) ⟺ x[key]*""" return self._fwdm[key] @override def __reduce__(self) -> tuple[t.Any, ...]: """Return state information for pickling.""" return self.__class__._from_other, (dict(self),) # See BidictBase._set_reversed() above. def _fwdm_reversed(self: BidictBase[KT, t.Any]) -> Iterator[KT]: """Iterator over the contained keys in reverse order.""" return reversed(t.cast('Reversible[KT]', self._fwdm)) BidictBase._init_class() # For better performance, make ProxiedSetView subclasses delegate to backing dicts for the # methods they inherit from collections.abc.Set. (Cannot delegate for __iter__ and # __reversed__ since they are order-sensitive.) See also: https://bugs.python.org/issue46713 _setmethodnames: Iterable[str] = ( '__lt__', '__le__', '__gt__', '__ge__', '__eq__', '__ne__', '__sub__', '__rsub__', '__or__', '__ror__', '__xor__', '__rxor__', '__and__', '__rand__', 'isdisjoint', ) # fmt: skip def _override_set_methods_to_use_backing_dict(cls: type[ProxiedSetView]) -> None: def make_proxy_method(methodname: str) -> t.Any: def method(self: ProxiedSetView, *args: t.Any) -> t.Any: fwdm = self._mapping._fwdm if not isinstance(fwdm, dict): # dict view speedup not available, fall back to Set's implementation. return getattr(Set, methodname)(self, *args) fwdm_dict_view = getattr(fwdm, self._viewname)() fwdm_dict_view_method = getattr(fwdm_dict_view, methodname) # When the (single) arg is another ProxiedSetView backed by a dict, forward its # backing dict_keys/dict_items to the C-level method rather than the arg itself. C-level dict views # only interoperate with other C-level dict views, not with arbitrary Set subclasses, so e.g. # `dict_keys(ob1).__lt__(ob2.keys())` returns NotImplemented. With both sides returning # NotImplemented, Python either raises TypeError (for `<`, `<=`, `>`, `>=`) or falls back to the # wrong answer (e.g. identity-based `==`). Note arg's view may differ from self's (keys vs items), # so use arg._viewname; this also subsumes the same-type case, where it equals self._viewname. if len(args) == 1 and isinstance((arg := args[0]), ProxiedSetView) and isinstance(arg._mapping._fwdm, dict): arg_dict_view = getattr(arg._mapping._fwdm, arg._viewname)() return fwdm_dict_view_method(arg_dict_view) return fwdm_dict_view_method(*args) method.__name__ = methodname method.__qualname__ = f'{cls.__qualname__}.{methodname}' return method for name in _setmethodnames: setattr(cls, name, make_proxy_method(name)) _override_set_methods_to_use_backing_dict(BidictValuesView) class GeneratedBidictInverse: """Base class for dynamically-generated inverse bidict classes.""" # * Code review nav * # ============================================================================ # ← Prev: _abc.py Current: _base.py Next: _frozen.py → # ============================================================================ bidict-0.24.1/bidict/_bidict.py000066400000000000000000000202141524342314000162360ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # * Code review nav * # (see comments in __init__.py) # ============================================================================ # ← Prev: _frozen.py Current: _bidict.py Next: _orderedbase.py → # ============================================================================ """Provide :class:`MutableBidict` and :class:`bidict`.""" from __future__ import annotations import typing as t from collections.abc import Mapping from ._abc import MutableBidirectionalMapping from ._base import BidictBase from ._base import Unwrites from ._dup import ON_DUP_DROP_OLD from ._dup import ON_DUP_RAISE from ._dup import OnDup from ._typing import DT from ._typing import KT from ._typing import MISSING from ._typing import ODT from ._typing import VT from ._typing import MapOrItems from ._typing import override class MutableBidict(BidictBase[KT, VT], MutableBidirectionalMapping[KT, VT]): """Base class for mutable bidirectional mappings.""" if t.TYPE_CHECKING: @property @override def inverse(self) -> MutableBidict[VT, KT]: ... @property @override def inv(self) -> MutableBidict[VT, KT]: ... def _pop(self, key: KT) -> VT: return self._pop_invm(key, self._fwdm.pop(key)) def _pop_invm(self, key: KT, val: VT) -> VT: """Remove *val* from _invm, *key* having already been removed from _fwdm. Puts (key, val) back if _invm refuses the removal, so that a backing mapping rejecting one half of a removal cannot leave the two disagreeing. This is the removing counterpart of the unwrites that :meth:`BidictBase._write` records. """ try: del self._invm[val] except Exception: self._fwdm[key] = val raise return val @override def __delitem__(self, key: KT) -> None: """*x.__delitem__(y)　⟺　del x[y]*""" self._pop(key) @override def __setitem__(self, key: KT, val: VT) -> None: """Set the value for *key* to *val*. If *key* is already associated with *val*, this is a no-op. If *key* is already associated with a different value, the old value will be replaced with *val*, as with dict's :meth:`__setitem__`. If *val* is already associated with a different key, an exception is raised to protect against accidental removal of the key that's currently associated with *val*. Use :meth:`put` instead if you want to specify different behavior in the case that the provided key or value duplicates an existing one. Or use :meth:`forceput` to unconditionally associate *key* with *val*, replacing any existing items as necessary to preserve uniqueness. :raises bidict.ValueDuplicationError: if *val* duplicates that of an existing item. :raises bidict.KeyAndValueDuplicationError: if *key* duplicates the key of an existing item and *val* duplicates the value of a different existing item. """ self.put(key, val, on_dup=self.on_dup) def put(self, key: KT, val: VT, on_dup: OnDup = ON_DUP_RAISE) -> None: """Associate *key* with *val*, honoring the :class:`OnDup` given in *on_dup*. For example, if *on_dup* is :attr:`~bidict.ON_DUP_RAISE`, then *key* will be associated with *val* if and only if *key* is not already associated with an existing value and *val* is not already associated with an existing key, otherwise an exception will be raised. If *key* is already associated with *val*, this is a no-op. :raises bidict.KeyDuplicationError: if attempting to insert an item whose key only duplicates an existing item's, and *on_dup.key* is :attr:`~bidict.RAISE`. :raises bidict.ValueDuplicationError: if attempting to insert an item whose value only duplicates an existing item's, and *on_dup.val* is :attr:`~bidict.RAISE`. :raises bidict.KeyAndValueDuplicationError: if attempting to insert an item whose key duplicates one existing item's, and whose value duplicates another existing item's, and *on_dup.val* is :attr:`~bidict.RAISE`. """ # Rather than self._update(((key, val),), on_dup=on_dup): a single item needs none of # the argument-type dispatch, iteration, or bulk fast paths that _update() provides, and # they cost several times what writing the item does. Rollback is still required, since # OrderedBidictBase._write() can fail after the write it delegates to has succeeded. dedup_result = self._dedup(key, val, on_dup) if dedup_result is None: return unwrites: Unwrites = [] try: self._write(key, val, *dedup_result, unwrites=unwrites) except Exception: for fn, *args in reversed(unwrites): fn(*args) raise def forceput(self, key: KT, val: VT) -> None: """Associate *key* with *val* unconditionally. Replace any existing mappings containing key *key* or value *val* as necessary to preserve uniqueness. """ self.put(key, val, on_dup=ON_DUP_DROP_OLD) @override def clear(self) -> None: """Remove all items.""" self._fwdm.clear() self._invm.clear() @t.overload def pop(self, key: KT, /) -> VT: ... @t.overload def pop(self, key: KT, default: DT = ..., /) -> VT | DT: ... @override def pop(self, key: KT, default: ODT[DT] = MISSING, /) -> VT | DT: """*x.pop(k[, d]) → v* Remove specified key and return the corresponding value. :raises KeyError: if *key* is not found and no *default* is provided. """ try: return self._pop(key) except KeyError: if default is MISSING: raise return default @override def popitem(self) -> tuple[KT, VT]: """*x.popitem() → (k, v)* Remove and return some item as a (key, value) pair. :raises KeyError: if *x* is empty. """ key, val = self._fwdm.popitem() return key, self._pop_invm(key, val) @override def update(self, arg: MapOrItems[KT, VT] = (), /, **kw: VT) -> None: """Like calling :meth:`putall` with *self.on_dup* passed for *on_dup*.""" self._update(arg, kw=kw) def forceupdate(self, arg: MapOrItems[KT, VT] = (), /, **kw: VT) -> None: """Like a bulk :meth:`forceput`.""" self._update(arg, kw=kw, on_dup=ON_DUP_DROP_OLD) def putall(self, items: MapOrItems[KT, VT], on_dup: OnDup = ON_DUP_RAISE) -> None: """Like a bulk :meth:`put`. If one of the given items causes an exception to be raised, none of the items is inserted. """ self._update(items, on_dup=on_dup) # other's type is Mapping rather than Maplike since bidict() |= SupportsKeysAndGetItem({}) # raises a TypeError, just like dict() |= SupportsKeysAndGetItem({}) does. def __ior__(self, other: Mapping[KT, VT]) -> t.Self: """Return self|=other.""" self.update(other) return self class bidict(MutableBidict[KT, VT]): """The main bidirectional mapping type. See :ref:`intro:Introduction` and :ref:`basic-usage:Basic Usage` to get started (also available at https://bidict.rtfd.io). """ if t.TYPE_CHECKING: @property @override def inverse(self) -> bidict[VT, KT]: ... @property @override def inv(self) -> bidict[VT, KT]: ... # * Code review nav * # ============================================================================ # ← Prev: _frozen.py Current: _bidict.py Next: _orderedbase.py → # ============================================================================ bidict-0.24.1/bidict/_dup.py000066400000000000000000000041141524342314000155710ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. """Provide :class:`OnDup` and related functionality.""" from __future__ import annotations import typing as t from enum import Enum from ._typing import override class OnDupAction(Enum): """An action to take to prevent duplication from occurring.""" #: Raise a :class:`~bidict.DuplicationError`. RAISE = 'RAISE' #: Overwrite existing items with new items. DROP_OLD = 'DROP_OLD' #: Keep existing items and drop new items. DROP_NEW = 'DROP_NEW' @override def __repr__(self) -> str: return f'{self.__class__.__name__}.{self.name}' RAISE: t.Final[OnDupAction] = OnDupAction.RAISE DROP_OLD: t.Final[OnDupAction] = OnDupAction.DROP_OLD DROP_NEW: t.Final[OnDupAction] = OnDupAction.DROP_NEW class OnDup(t.NamedTuple): r"""A combination of :class:`~bidict.OnDupAction`\s specifying how to handle various types of duplication. The :attr:`~OnDup.key` field specifies what action to take when a duplicate key is encountered. The :attr:`~OnDup.val` field specifies what action to take when a duplicate value is encountered. In the case of both key and value duplication across two different items, only :attr:`~OnDup.val` is used. *See also* :ref:`basic-usage:Values Must Be Unique` (https://bidict.rtfd.io/basic-usage.html#values-must-be-unique) """ key: OnDupAction = DROP_OLD val: OnDupAction = RAISE #: Default :class:`OnDup` used for the #: :meth:`~bidict.bidict.__init__`, #: :meth:`~bidict.bidict.__setitem__`, and #: :meth:`~bidict.bidict.update` methods. ON_DUP_DEFAULT: t.Final[OnDup] = OnDup(key=DROP_OLD, val=RAISE) #: An :class:`OnDup` whose members are all :obj:`RAISE`. ON_DUP_RAISE: t.Final[OnDup] = OnDup(key=RAISE, val=RAISE) #: An :class:`OnDup` whose members are all :obj:`DROP_OLD`. ON_DUP_DROP_OLD: t.Final[OnDup] = OnDup(key=DROP_OLD, val=DROP_OLD) bidict-0.24.1/bidict/_exc.py000066400000000000000000000020521524342314000155570ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. """Provide all bidict exceptions.""" from __future__ import annotations class BidictException(Exception): """Base class for bidict exceptions.""" class DuplicationError(BidictException): """Base class for exceptions raised when uniqueness is violated as per the :attr:`~bidict.RAISE` :class:`~bidict.OnDupAction`. """ class KeyDuplicationError(DuplicationError): """Raised when a given key is not unique.""" class ValueDuplicationError(DuplicationError): """Raised when a given value is not unique.""" class KeyAndValueDuplicationError(KeyDuplicationError, ValueDuplicationError): """Raised when a given item's key and value are not unique. That is, its key duplicates that of another item, and its value duplicates that of a different other item. """ bidict-0.24.1/bidict/_frozen.py000066400000000000000000000035371524342314000163140ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # * Code review nav * # (see comments in __init__.py) # ============================================================================ # ← Prev: _base.py Current: _frozen.py Next: _bidict.py → # ============================================================================ """Provide :class:`frozenbidict`, an immutable, hashable bidirectional mapping type.""" from __future__ import annotations import typing as t from collections.abc import ItemsView from ._base import BidictBase from ._typing import KT from ._typing import VT from ._typing import override class frozenbidict(BidictBase[KT, VT]): """Immutable, hashable bidict type.""" _hash: int if t.TYPE_CHECKING: @property @override def inverse(self) -> frozenbidict[VT, KT]: ... @property @override def inv(self) -> frozenbidict[VT, KT]: ... @override def __hash__(self) -> int: """The hash of this bidict as determined by its items.""" if getattr(self, '_hash', None) is None: # The following is like hash(frozenset(self.items())) # but more memory efficient. See also: https://bugs.python.org/issue46684 self._hash = ItemsView(self)._hash() return self._hash # * Code review nav * # ============================================================================ # ← Prev: _base.py Current: _frozen.py Next: _bidict.py → # ============================================================================ bidict-0.24.1/bidict/_iter.py000066400000000000000000000037021524342314000157460ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. """Functions for iterating over items in a mapping.""" from __future__ import annotations import typing as t from collections.abc import Mapping from operator import itemgetter from ._typing import KT from ._typing import VT from ._typing import ItemsIter from ._typing import Maplike from ._typing import MapOrItems def iteritems(arg: MapOrItems[KT, VT] = (), /, **kw: VT) -> ItemsIter[KT, VT]: """Yield the items from *arg* and *kw* in the order given.""" if isinstance(arg, Mapping): yield from t.cast('Mapping[KT, VT]', arg).items() # isinstance() against a runtime-checkable Protocol is cheap when it succeeds but expensive # when it fails: it falls back to inspect.getattr_static() per member and caches nothing. # It fails for an iterable of items, which is what every single-item write passes, so screen # that case out first -- a Maplike has a keys attribute by definition. elif hasattr(arg, 'keys') and isinstance(arg, Maplike): yield from ((key, arg[key]) for key in arg.keys()) else: yield from arg yield from t.cast('ItemsIter[KT, VT]', kw.items()) swap: t.Final = itemgetter(1, 0) def inverted(arg: MapOrItems[KT, VT]) -> ItemsIter[VT, KT]: """Yield the inverse items of the provided object. If *arg* has a :func:`callable` ``__inverted__`` attribute, return the result of calling it. Otherwise, return an iterator over the items in `arg`, inverting each item on the fly. *See also* :attr:`bidict.BidirectionalMapping.__inverted__` """ invattr = getattr(arg, '__inverted__', None) if callable(invattr): inv: ItemsIter[VT, KT] = invattr() return inv return map(swap, iteritems(arg)) bidict-0.24.1/bidict/_orderedbase.py000066400000000000000000000346471524342314000172760ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # * Code review nav * # (see comments in __init__.py) # ============================================================================ # ← Prev: _bidict.py Current: _orderedbase.py Next: _orderedbidict.py → # ============================================================================ """Provide :class:`OrderedBidictBase`.""" from __future__ import annotations import typing as t from collections.abc import ItemsView from collections.abc import Iterator from collections.abc import KeysView from weakref import ref as weakref from ._base import BidictBase from ._base import BidictKeysView from ._base import ProxiedSetView from ._base import Unwrites from ._base import _override_set_methods_to_use_backing_dict from ._bidict import bidict from ._iter import iteritems from ._typing import KT from ._typing import MISSING from ._typing import OKT from ._typing import OVT from ._typing import VT from ._typing import MapOrItems from ._typing import override AT = t.TypeVar('AT') # attr type _MUTATED_DURING_ITERATION: t.Final = 'ordered bidict mutated during iteration' class WeakAttr(t.Generic[AT]): """Descriptor to automatically manage (de)referencing the given slot as a weakref. See https://docs.python.org/3/howto/descriptor.html#managed-attributes for an intro to using descriptors like this for managed attributes. """ def __init__(self, *, slot: str) -> None: self.slot = slot def __set__(self, instance: t.Any, value: AT) -> None: setattr(instance, self.slot, weakref(value)) @t.overload def __get__(self, instance: None, owner: type) -> t.Self: ... @t.overload def __get__(self, instance: object, owner: type) -> AT: ... def __get__(self, instance: object | None, owner: type) -> t.Self | AT: if instance is None: return self return getattr(instance, self.slot)() # deref the weakref stored in the slot; typed via the overloads above class Node: """A node in a circular doubly-linked list used to encode the order of items in an ordered bidict. A weak reference to the previous node is stored to avoid creating strong reference cycles. Referencing/dereferencing the weakref is handled automatically by :class:`WeakAttr`. """ prv: WeakAttr[Node] = WeakAttr(slot='_prv_weak') # nxt is a plain (strong-ref) slot on the base Node; SentinelNode overrides it # below with a WeakAttr to break the otherwise-strong cycle around the circular list. nxt: Node __slots__ = ('__weakref__', '_prv_weak', 'nxt') def __init__(self, prv: Node, nxt: Node) -> None: self.prv = prv self.nxt = nxt def unlink(self) -> None: """Remove self from in between prv and nxt. Self's references to prv and nxt are retained so it can be relinked (see below). """ self.prv.nxt = self.nxt self.nxt.prv = self.prv def relink(self) -> None: """Restore self between prv and nxt after unlinking (see above).""" self.prv.nxt = self.nxt.prv = self class SentinelNode(Node): """Special node in a circular doubly-linked list that links the first node with the last node. When its next and previous references point back to itself it represents an empty list. """ nxt: WeakAttr[Node] = WeakAttr(slot='_nxt_weak') # override base's plain slot with a weakref #: Snapshot token, bumped by :meth:`mutated` on every structural change to the list, so #: that iterators can detect one. Compared for equality only; its magnitude means nothing. #: Lives here rather than on the owning bidict because a bidict and its inverse share this #: sentinel, and so must invalidate each other's iterators. version: int __slots__ = ('_nxt_weak', 'version') def __init__(self) -> None: self.version = 0 super().__init__(self, self) def mutated(self) -> None: """Record a structural change to the list, invalidating any iterators over it.""" self.version += 1 def reset(self) -> None: """Empty the list.""" self.nxt = self.prv = self self.mutated() def iternodes(self, *, reverse: bool = False) -> Iterator[Node]: """Iterator yielding nodes in the requested order. Raises :class:`RuntimeError` if the list is structurally modified while iterating, as :class:`dict` and :class:`collections.OrderedDict` do. """ # Not a generator: the version is captured when the iterator is created rather than when it # is first advanced, so mutating in between is detected too, as OrderedDict does. return self._iternodes(self.version, reverse=reverse) def _iternodes(self, initial_version: int, *, reverse: bool) -> Iterator[Node]: # Advance via a literal attr name rather than getattr(node, 'prv' if reverse else 'nxt'): # the dynamic lookup the latter needs costs more per node than everything else in # this loop put together, since only a literal gets CPython's specialized LOAD_ATTR. # (operator.attrgetter does not help: it is a call, not a load.) node = self.prv if reverse else self.nxt while node is not self: if self.version != initial_version: raise RuntimeError(_MUTATED_DURING_ITERATION) yield node node = node.prv if reverse else node.nxt # Check on the step that finds the end too, so that a mutation which happens to leave the # iterator pointing at the sentinel is caught as well -- e.g. move_to_end() of the item # just yielded, which relinks it to exactly where iteration is about to stop. if self.version != initial_version: raise RuntimeError(_MUTATED_DURING_ITERATION) def new_last_node(self) -> Node: """Create and return a new terminal node.""" old_last = self.prv new_last = Node(old_last, self) old_last.nxt = self.prv = new_last self.mutated() return new_last class OrderedBidictBase(BidictBase[KT, VT]): """Base class implementing an ordered :class:`BidirectionalMapping`.""" _node_by_korv: bidict[t.Any, Node] _bykey: bool def __init__(self, arg: MapOrItems[KT, VT] = (), /, **kw: VT) -> None: """Make a new ordered bidirectional mapping. The signature behaves like that of :class:`dict`. Items passed in are added in the order they are passed, respecting the :attr:`~bidict.BidictBase.on_dup` class attribute in the process. The order in which items are inserted is remembered, similar to :class:`collections.OrderedDict`. """ self._sntl = SentinelNode() self._node_by_korv = bidict() self._bykey = True super().__init__(arg, **kw) if t.TYPE_CHECKING: @property @override def inverse(self) -> OrderedBidictBase[VT, KT]: ... @property @override def inv(self) -> OrderedBidictBase[VT, KT]: ... @override def _make_inverse(self) -> OrderedBidictBase[VT, KT]: inv = t.cast('OrderedBidictBase[VT, KT]', super()._make_inverse()) inv._sntl = self._sntl inv._node_by_korv = self._node_by_korv inv._bykey = not self._bykey return inv def _assoc_node(self, node: Node, key: KT, val: VT) -> None: korv = key if self._bykey else val self._node_by_korv.forceput(korv, node) def _dissoc_node(self, node: Node) -> None: del self._node_by_korv.inverse[node] node.unlink() self._sntl.mutated() def _relink_node(self, node: Node) -> None: """Undo a :meth:`_dissoc_node` (the linked list half of it). See :meth:`_write`.""" node.relink() self._sntl.mutated() @override def _init_from(self, other: MapOrItems[KT, VT]) -> None: """See :meth:`BidictBase._init_from`.""" super()._init_from(other) bykey = self._bykey korv_by_node = self._node_by_korv.inverse korv_by_node.clear() korv_by_node_set = korv_by_node.__setitem__ self._sntl.reset() new_node = self._sntl.new_last_node for k, v in iteritems(other): korv_by_node_set(new_node(), k if bykey else v) @override def _write(self, newkey: KT, newval: VT, oldkey: OKT[KT], oldval: OVT[VT], unwrites: Unwrites | None) -> None: super()._write(newkey, newval, oldkey, oldval, unwrites) assoc, dissoc, relink = self._assoc_node, self._dissoc_node, self._relink_node node_by_korv, bykey = self._node_by_korv, self._bykey if oldval is MISSING and oldkey is MISSING: # no key or value duplication # {0: 1, 2: 3} | {4: 5} => {0: 1, 2: 3, 4: 5} newnode = self._sntl.new_last_node() assoc(newnode, newkey, newval) if unwrites is not None: unwrites.append((dissoc, newnode)) elif oldval is not MISSING and oldkey is not MISSING: # key and value duplication across two different items # {0: 1, 2: 3} | {0: 3} => {0: 3} # n1, n2 => n1 (collapse n1 and n2 into n1) # oldkey: 2, oldval: 1, oldnode: n2, newkey: 0, newval: 3, newnode: n1 if bykey: oldnode = node_by_korv[oldkey] newnode = node_by_korv[newkey] else: oldnode = node_by_korv[newval] newnode = node_by_korv[oldval] dissoc(oldnode) assoc(newnode, newkey, newval) if unwrites is not None: unwrites.extend(( (assoc, newnode, newkey, oldval), (assoc, oldnode, oldkey, newval), (relink, oldnode), )) elif oldval is not MISSING: # just key duplication # {0: 1, 2: 3} | {2: 4} => {0: 1, 2: 4} # oldkey: MISSING, oldval: 3, newkey: 2, newval: 4 node = node_by_korv[newkey if bykey else oldval] assoc(node, newkey, newval) if unwrites is not None: unwrites.append((assoc, node, newkey, oldval)) else: assert oldkey is not MISSING # just value duplication # {0: 1, 2: 3} | {4: 3} => {0: 1, 4: 3} # oldkey: 2, oldval: MISSING, newkey: 4, newval: 3 node = node_by_korv[oldkey if bykey else newval] assoc(node, newkey, newval) if unwrites is not None: unwrites.append((assoc, node, oldkey, newval)) @override def __iter__(self) -> Iterator[KT]: """Iterator over the contained keys in insertion order.""" return self._iter(reverse=False) @override def __reversed__(self) -> Iterator[KT]: """Iterator over the contained keys in reverse insertion order.""" return self._iter(reverse=True) def _iter(self, *, reverse: bool = False) -> Iterator[KT]: # Not a generator, so that the version is captured now rather than on the first # next() call, and an iterator created before a mutation still detects it. Calls # _iternodes() directly rather than iternodes(), to skip a call on this hot path. sntl = self._sntl nodes = sntl._iternodes(sntl.version, reverse=reverse) korv_by_node = self._node_by_korv.inverse if self._bykey: return (korv_by_node[node] for node in nodes) key_by_val = self._invm return (key_by_val[korv_by_node[node]] for node in nodes) # Override the keys() and items() implementations inherited from BidictBase, which may # delegate to the backing _fwdm dict: an ordered bidict's order is encoded in its linked # list, not in _fwdm, and the two can disagree. That happens after any mutation that # changes an existing item, but also during __init__ itself, since a value-duplication # overwrite reuses the existing item's node (keeping its position) while _fwdm gets the # new key appended and the old one deleted. So these must be overridden here rather than # in OrderedBidict, to cover immutable ordered bidicts too. @override def keys(self) -> KeysView[KT]: """A set-like object providing a view on the contained keys.""" return _OrderedBidictKeysView(self) @override def items(self) -> ItemsView[KT, VT]: """A set-like object providing a view on the contained items.""" return _OrderedBidictItemsView(self) @override def values(self) -> BidictKeysView[VT]: """A set-like object providing a view on the contained values.""" # Unlike a non-ordered bidict, whose BidictValuesView has to iterate the backing # _fwdm to yield values in key order (see BidictBase.values()), an ordered bidict # gets that for free: the inverse shares this bidict's linked list, so its keys # view already yields the values in this bidict's order. return t.cast('BidictKeysView[VT]', self.inverse.keys()) # The following MappingView implementations use the __iter__ implementations # inherited from their superclass counterparts in collections.abc, so they # continue to yield items in the correct order even after an ordered bidict # is mutated. They also provide a __reversed__ implementation, which is not # provided by the collections.abc superclasses. class _OrderedBidictKeysView(ProxiedSetView, BidictKeysView[KT]): _mapping: OrderedBidictBase[KT, t.Any] _viewname: t.ClassVar[str] = 'keys' __slots__ = () def __reversed__(self) -> Iterator[KT]: return reversed(self._mapping) class _OrderedBidictItemsView(ProxiedSetView, ItemsView[KT, VT]): _mapping: OrderedBidictBase[KT, VT] _viewname: t.ClassVar[str] = 'items' __slots__ = () def __reversed__(self) -> Iterator[tuple[KT, VT]]: ob = self._mapping for key in reversed(ob): yield key, ob[key] _override_set_methods_to_use_backing_dict(_OrderedBidictKeysView) _override_set_methods_to_use_backing_dict(_OrderedBidictItemsView) # * Code review nav * # ============================================================================ # ← Prev: _bidict.py Current: _orderedbase.py Next: _orderedbidict.py → # ============================================================================ bidict-0.24.1/bidict/_orderedbidict.py000066400000000000000000000062321524342314000176070ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # * Code review nav * # (see comments in __init__.py) # ============================================================================ # ← Prev: _orderedbase.py Current: _orderedbidict.py # ============================================================================ """Provide :class:`OrderedBidict`.""" from __future__ import annotations import typing as t from ._bidict import MutableBidict from ._orderedbase import OrderedBidictBase from ._typing import KT from ._typing import VT from ._typing import override class OrderedBidict(OrderedBidictBase[KT, VT], MutableBidict[KT, VT]): """Mutable bidict type that maintains items in insertion order.""" if t.TYPE_CHECKING: @property @override def inverse(self) -> OrderedBidict[VT, KT]: ... @property @override def inv(self) -> OrderedBidict[VT, KT]: ... @override def clear(self) -> None: """Remove all items.""" super().clear() self._node_by_korv.clear() self._sntl.reset() @override def _pop(self, key: KT) -> VT: val = super()._pop(key) node = self._node_by_korv[key if self._bykey else val] self._dissoc_node(node) return val @override def popitem(self, last: bool = True) -> tuple[KT, VT]: """*b.popitem() → (k, v)* If *last* is true, remove and return the most recently added item as a (key, value) pair. Otherwise, remove and return the least recently added item. :raises KeyError: if *b* is empty. """ if not self: raise KeyError('OrderedBidict is empty') node = getattr(self._sntl, 'prv' if last else 'nxt') korv = self._node_by_korv.inverse[node] if self._bykey: return korv, self._pop(korv) return self.inverse._pop(korv), korv def move_to_end(self, key: KT, last: bool = True) -> None: """Move the item with the given key to the end if *last* is true, else to the beginning. :raises KeyError: if *key* is missing """ korv = key if self._bykey else self._fwdm[key] node = self._node_by_korv[korv] node.prv.nxt = node.nxt node.nxt.prv = node.prv sntl = self._sntl sntl.mutated() if last: lastnode = sntl.prv node.prv = lastnode node.nxt = sntl sntl.prv = lastnode.nxt = node else: firstnode = sntl.nxt node.prv = sntl node.nxt = firstnode sntl.nxt = firstnode.prv = node # * Code review nav * # ============================================================================ # ← Prev: _orderedbase.py Current: _orderedbidict.py # ============================================================================ bidict-0.24.1/bidict/_typing.py000066400000000000000000000026021524342314000163130ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. """Provide typing-related objects.""" from __future__ import annotations import sys import typing as t from collections.abc import Iterable from collections.abc import Iterator from enum import Enum if sys.version_info >= (3, 12): from typing import override as override else: from typing_extensions import override as override KT = t.TypeVar('KT') VT = t.TypeVar('VT') VT_co = t.TypeVar('VT_co', covariant=True) MissingT = Enum('MissingT', {'MISSING': 'MISSING'}) MISSING: t.Final[t.Literal[MissingT.MISSING]] = MissingT.MISSING OKT: t.TypeAlias = KT | MissingT #: optional key type OVT: t.TypeAlias = VT | MissingT #: optional value type DT = t.TypeVar('DT') #: for default arguments ODT: t.TypeAlias = DT | MissingT #: optional default arg type Items: t.TypeAlias = Iterable[tuple[KT, VT]] ItemsIter: t.TypeAlias = Iterator[tuple[KT, VT]] @t.runtime_checkable class Maplike(t.Protocol[KT, VT_co]): """Like typeshed's SupportsKeysAndGetItem, but usable at runtime.""" def keys(self) -> Iterable[KT]: ... def __getitem__(self, key: KT, /) -> VT_co: ... MapOrItems: t.TypeAlias = Maplike[KT, VT] | Items[KT, VT] bidict-0.24.1/bidict/py.typed000066400000000000000000000000201524342314000157570ustar00rootroot00000000000000PEP-561 marker. bidict-0.24.1/cachegrind.py000077500000000000000000000125061524342314000155020ustar00rootroot00000000000000#!/usr/bin/env python3 # Based on https://github.com/pythonspeed/cachegrind-benchmarking/blob/main/cachegrind.py """ Run a program under Cachegrind, combining various metrics into one single performance metric. License: https://opensource.org/licenses/MIT ## Features * Disables ASLR. * Sets consistent cache sizes. * Calculates a combined performance metric. For more information see the detailed write up at: https://pythonspeed.com/articles/consistent-benchmarking-in-ci/ ## Usage $ python3 cachegrind.py ./yourprogram --yourparam=yourvalues If you're benchmarking Python, make sure to set PYTHONHASHSEED to a fixed value (e.g. `export PYTHONHASHSEED=1234`). Other languages may have similar requirements to reduce variability. The last line printed will be a combined performance metric, but you can tweak the script to extract more info, or use it as a library. Copyright © 2020, Hyphenated Enterprises LLC. """ from __future__ import annotations import os import subprocess as sp import sys import typing as t from pathlib import Path from tempfile import NamedTemporaryFile try: sp.check_call(['setarch', '-h'], stdout=sp.DEVNULL, stderr=sp.DEVNULL) sp.check_call(['valgrind', '-h'], stdout=sp.DEVNULL, stderr=sp.DEVNULL) except FileNotFoundError as exc: # e.g. macOS raise SystemExit(f'Command not found: {exc.filename}') from None ARCH = sp.check_output(['uname', '-m'], text=True).strip() DISABLE_ASLR_CMD = ['setarch', ARCH, '-R'] def run_with_cachegrind(args_list: list[str]) -> tuple[int, dict[str, int]]: """ Run the the given program and arguments under Cachegrind, parse the Cachegrind specs. Return the program's exit status along with the parsed results. For now we just ignore program output, and in general this is not robust. """ # Deliberately not a context manager: this stays open across the run below, which writes to # it, and is read afterwards. temp_file = NamedTemporaryFile('r+', encoding='utf-8') # ruff: ignore[open-file-with-context-handler] # Don't raise if the program fails (to support e.g. `pytest --benchmark-compare-fail=...`), # but do return its status so that main() can exit with it. Callers such as the benchmark # workflow rely on it to tell a benchmark regression from a clean run. returncode = sp.call([ *DISABLE_ASLR_CMD, 'valgrind', '--tool=cachegrind', '--cache-sim=yes', # Set some reasonable L1 and LL values, based on Haswell. # Feel free to update, important part is that they are consistent across runs, # instead of the default of copying from the current machine. '--I1=32768,8,64', '--D1=32768,8,64', '--LL=8388608,16,64', '--cachegrind-out-file=' + temp_file.name, *args_list, ]) return returncode, parse_cachegrind_output(temp_file) def parse_cachegrind_output(temp_file: t.IO[str]) -> dict[str, int]: header = summary = '' for line in temp_file: if line.startswith('events: '): header = line[len('events: ') :].strip() elif line.startswith('summary: '): summary = line[len('summary:') :].strip() assert header assert summary return dict(zip(header.split(), (int(i) for i in summary.split()), strict=False)) def get_counts(cg_results: dict[str, int]) -> dict[str, int]: """ Given the result of run_with_cachegrind(), figure out the parameters we will use for final estimate. We pretend there's no L2 since Cachegrind doesn't currently support it. Caveats: we're not including time to process instructions, only time to access instruction cache(s), so we're assuming time to fetch and run_with_cachegrind instruction is the same as time to retrieve data if they're both to L1 cache. """ result = {} d = cg_results ram_hits = d['DLmr'] + d['DLmw'] + d['ILmr'] l3_hits = d['I1mr'] + d['D1mw'] + d['D1mr'] - ram_hits total_memory_rw = d['Ir'] + d['Dr'] + d['Dw'] l1_hits = total_memory_rw - l3_hits - ram_hits assert total_memory_rw == l1_hits + l3_hits + ram_hits result['l1'] = l1_hits result['l3'] = l3_hits result['ram'] = ram_hits return result def combined_instruction_estimate(counts: dict[str, int]) -> int: """ Given the result of run_with_cachegrind(), return estimate of total time to run_with_cachegrind. Multipliers were determined empirically, but some research suggests they're a reasonable approximation for cache time ratios. L3 is probably too low, but then we're not simulating L2... """ return counts['l1'] + (5 * counts['l3']) + (35 * counts['ram']) def main() -> None: returncode, results = run_with_cachegrind(sys.argv[1:]) counts = get_counts(results) estimate = combined_instruction_estimate(counts) print(f'{"*" * 80}\nCombined instruction estimate: {estimate:,}') # Unlike the wall-clock figures pytest-benchmark records, which vary with whatever else is # running on the machine, this estimate counts instructions and so is reproducible. Write it # out when asked, so a caller can compare it between revisions without a noise allowance. estimate_out = os.environ.get('CACHEGRIND_ESTIMATE_OUT') if estimate_out: Path(estimate_out).write_text(f'{estimate}\n', encoding='utf-8') sys.exit(returncode) if __name__ == '__main__': main() bidict-0.24.1/check_dist000077500000000000000000000051031524342314000150570ustar00rootroot00000000000000#!/usr/bin/env bash # # Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # # Inspect built distributions before they are published. Nothing else does: the tests import # from a wheel but never look inside one, and the release workflows went straight from `uv build` # to publishing. That is how 0.24.0 shipped a wheel whose RECORD listed hex-encoded hashes # instead of the urlsafe-base64 the spec requires (#406) with every check still green. # # Usage: ./check_dist [dist_dir] (dist_dir defaults to ./dist, where `uv build` writes) set -euo pipefail log() { >&2 printf "> %s\n" "$@" } main() { local dist_dir=${1:-dist} declare -r hint="Hint: Use 'nix develop' to bootstrap a development environment" if ! command -v uv >/dev/null 2>&1; then log "Error: No 'uv' on PATH. $hint" exit 1 fi shopt -s nullglob local -a wheels=("$dist_dir"/*.whl) local -a sdists=("$dist_dir"/*.tar.gz) # Guard against a false pass: with no artifacts to check, everything below trivially succeeds. if [[ ${#wheels[@]} -eq 0 || ${#sdists[@]} -eq 0 ]]; then log "Error: expected at least one wheel and one sdist in '$dist_dir'," \ " but found ${#wheels[@]} and ${#sdists[@]}. Run 'uv build' first?" exit 1 fi # The check that #406 needed. installer recomputes the hash and size of every file in the # wheel and compares them to what RECORD claims, so a RECORD that is malformed (not just # stale) fails here on every entry. log "Validating each wheel's RECORD..." uv run --no-project --with installer python - "${wheels[@]}" <<'PY' import sys from installer.sources import WheelFile for path in sys.argv[1:]: try: with WheelFile.open(path) as wheel: wheel.validate_record() except Exception as exc: # noqa: BLE001 (report the issues, not a traceback) print(f'RECORD INVALID: {path}', file=sys.stderr) for issue in getattr(exc, 'issues', None) or [exc]: print(f' {issue}', file=sys.stderr) sys.exit(1) print(f'RECORD ok: {path}') PY # Orthogonal to the above: catches metadata that PyPI would reject or render wrong, e.g. a # README that no longer parses as reStructuredText. log "Checking metadata renders..." uv run --no-project --with twine twine check "${wheels[@]}" "${sdists[@]}" log "Distributions OK: ${#wheels[@]} wheel(s), ${#sdists[@]} sdist(s) in '$dist_dir'" } main "$@" bidict-0.24.1/codecov.yml000066400000000000000000000001321524342314000151730ustar00rootroot00000000000000coverage: status: project: default: target: 99% threshold: 1% bidict-0.24.1/docs/000077500000000000000000000000001524342314000137625ustar00rootroot00000000000000bidict-0.24.1/docs/Makefile000066400000000000000000000151521524342314000154260ustar00rootroot00000000000000# Makefile for Sphinx documentation # # You can set these variables from the command line. SPHINXOPTS = SPHINXBUILD = sphinx-build PAPER = BUILDDIR = _build # User-friendly check for sphinx-build ifeq ($(shell which $(SPHINXBUILD) >/dev/null 2>&1; echo $$?), 1) $(error The '$(SPHINXBUILD)' command was not found. Make sure you have Sphinx installed, then set the SPHINXBUILD environment variable to point to the full path of the '$(SPHINXBUILD)' executable. Alternatively you can add the directory with the executable to your PATH. If you don't have Sphinx installed, grab it from http://sphinx-doc.org/) endif # Internal variables. PAPEROPT_a4 = -D latex_paper_size=a4 PAPEROPT_letter = -D latex_paper_size=letter ALLSPHINXOPTS = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) . # the i18n builder cannot share the environment and doctrees with the others I18NSPHINXOPTS = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) . .PHONY: help clean html dirhtml singlehtml pickle json htmlhelp qthelp devhelp epub latex latexpdf text man changes linkcheck doctest gettext help: @echo "Please use \`make ' where is one of" @echo " html to make standalone HTML files" @echo " dirhtml to make HTML files named index.html in directories" @echo " singlehtml to make a single large HTML file" @echo " pickle to make pickle files" @echo " json to make JSON files" @echo " htmlhelp to make HTML files and a HTML help project" @echo " qthelp to make HTML files and a qthelp project" @echo " devhelp to make HTML files and a Devhelp project" @echo " epub to make an epub" @echo " latex to make LaTeX files, you can set PAPER=a4 or PAPER=letter" @echo " latexpdf to make LaTeX files and run them through pdflatex" @echo " latexpdfja to make LaTeX files and run them through platex/dvipdfmx" @echo " text to make text files" @echo " man to make manual pages" @echo " texinfo to make Texinfo files" @echo " info to make Texinfo files and run them through makeinfo" @echo " gettext to make PO message catalogs" @echo " changes to make an overview of all changed/added/deprecated items" @echo " xml to make Docutils-native XML files" @echo " pseudoxml to make pseudoxml-XML files for display purposes" @echo " linkcheck to check all external links for integrity" @echo " doctest to run all doctests embedded in the documentation (if enabled)" clean: rm -rf $(BUILDDIR)/* html: $(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html @echo @echo "Build finished. The HTML pages are in $(BUILDDIR)/html." dirhtml: $(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml @echo @echo "Build finished. The HTML pages are in $(BUILDDIR)/dirhtml." singlehtml: $(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml @echo @echo "Build finished. The HTML page is in $(BUILDDIR)/singlehtml." pickle: $(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle @echo @echo "Build finished; now you can process the pickle files." json: $(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json @echo @echo "Build finished; now you can process the JSON files." htmlhelp: $(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp @echo @echo "Build finished; now you can run HTML Help Workshop with the" \ ".hhp project file in $(BUILDDIR)/htmlhelp." qthelp: $(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp @echo @echo "Build finished; now you can run "qcollectiongenerator" with the" \ ".qhcp project file in $(BUILDDIR)/qthelp, like this:" @echo "# qcollectiongenerator $(BUILDDIR)/qthelp/bidict.qhcp" @echo "To view the help file:" @echo "# assistant -collectionFile $(BUILDDIR)/qthelp/bidict.qhc" devhelp: $(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp @echo @echo "Build finished." @echo "To view the help file:" @echo "# mkdir -p $$HOME/.local/share/devhelp/bidict" @echo "# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/bidict" @echo "# devhelp" epub: $(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub @echo @echo "Build finished. The epub file is in $(BUILDDIR)/epub." latex: $(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex @echo @echo "Build finished; the LaTeX files are in $(BUILDDIR)/latex." @echo "Run \`make' in that directory to run these through (pdf)latex" \ "(use \`make latexpdf' here to do that automatically)." latexpdf: $(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex @echo "Running LaTeX files through pdflatex..." $(MAKE) -C $(BUILDDIR)/latex all-pdf @echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex." latexpdfja: $(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex @echo "Running LaTeX files through platex and dvipdfmx..." $(MAKE) -C $(BUILDDIR)/latex all-pdf-ja @echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex." text: $(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text @echo @echo "Build finished. The text files are in $(BUILDDIR)/text." man: $(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man @echo @echo "Build finished. The manual pages are in $(BUILDDIR)/man." texinfo: $(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo @echo @echo "Build finished. The Texinfo files are in $(BUILDDIR)/texinfo." @echo "Run \`make' in that directory to run these through makeinfo" \ "(use \`make info' here to do that automatically)." info: $(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo @echo "Running Texinfo files through makeinfo..." make -C $(BUILDDIR)/texinfo info @echo "makeinfo finished; the Info files are in $(BUILDDIR)/texinfo." gettext: $(SPHINXBUILD) -b gettext $(I18NSPHINXOPTS) $(BUILDDIR)/locale @echo @echo "Build finished. The message catalogs are in $(BUILDDIR)/locale." changes: $(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes @echo @echo "The overview file is in $(BUILDDIR)/changes." linkcheck: $(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck @echo @echo "Link check complete; look for any errors in the above output " \ "or in $(BUILDDIR)/linkcheck/output.txt." doctest: $(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest @echo "Testing of doctests in the sources finished, look at the " \ "results in $(BUILDDIR)/doctest/output.txt." xml: $(SPHINXBUILD) -b xml $(ALLSPHINXOPTS) $(BUILDDIR)/xml @echo @echo "Build finished. The XML files are in $(BUILDDIR)/xml." pseudoxml: $(SPHINXBUILD) -b pseudoxml $(ALLSPHINXOPTS) $(BUILDDIR)/pseudoxml @echo @echo "Build finished. The pseudo-XML files are in $(BUILDDIR)/pseudoxml." bidict-0.24.1/docs/__init__.py000066400000000000000000000000001524342314000160610ustar00rootroot00000000000000bidict-0.24.1/docs/_static/000077500000000000000000000000001524342314000154105ustar00rootroot00000000000000bidict-0.24.1/docs/_static/android-chrome-192x192.png000066400000000000000000001115061524342314000217520ustar00rootroot00000000000000PNG  IHDRݾP cHRMz&u0`:pQ<bKGD pHYsodtIME ;wb.nzTXtRaw profile type app11xGb\9EXE-,vRdI̮JkΙ.XLɞe/Ur/)?q1͎[{7|Q oyߞL {~gWBŗHKOX=Ҽ)WzI?Kúz?ȯfZdGg/dy{Z%g=aX5uu:&ߝ5ȤТGRC49ڲ݇g|cƭ'Ozi~0Vo9F1Ťыca~}%lo_Q+{ݵQM\gOێu32>>ߌ++MvϚNraxu;1-co9mW <^ixg18XJm[9>&3_q28ia ?tofv{ՍZBX>b1h֕>DYaXo3ɳwt<giˏF`;n3̴SeO+otqX(kسgrerΞbu+ѝU]Z W0]ye }@A \}m.7O@^lg=NfZ1T%`7 s|G+ԖV߳X]L.^Nҫ ]`ܞFJ #9wˎGKǜM̱&{q?|*鍅Vz:ױ{]6COWgur0?v1" H]Nѵ{<1{-yԙ3Nbz}}Ҽ_荏h:a\<#g>qdC1?mx fȿ"@H.tUb~;7oG \ oDCsC tB$gjE2 6{h6MzKuinw:>;3%,mWLaVx&j8ʙnv;Yu 5kP^VK駌P&g1#cG86R@uX9 n8̰W s\ՈwbOB0vW;[ usʭp386@&uaPǩkal9kB1n9E`Vɹѐ[`Vp ?P1Ɏǭoi1-q?CڦzIFn @tsHR@!N웾BoL!,}Wq>(bZ8ZdF<ȽA+ْ8^x<24_&Խ`(8)j. !VLB%hqL@, phQ(,B~P|A|N΢reBmd]ZT.sFu%~_NZ97c;Gg_/dt~qn>7o&L]tjͿ~o>'&N3yw;^3-0#ZP TmtAH."~tĬG@P;H>aa<Ӫ274N=֊XTTu`f.#qqu2X#K ;jVD3Zun`fo *esv4ZN*jyQζ%By@RE F4/W p 2肅sm00 &qYJsOurᡴ2y+*iA*;FQT. J9om\'h-:I[kd%,KXla8ڇ8/a6a9 !qp$&0r"hTfÆ3"d]eg\k=6,a k9-  SB 3t8jr1qd+WqwQ+5Wiabqv#aAd“m-UW10i{㇧ET#ɣB j^V O` LA#{71PM8aCWx㵷9|BؗfiW 2BZV{E"Jd8>_Ue F^2P^0qpè2KVTt[^3ahX̵x0+Y6 j]ZS)8[Qo9,0Z%:D@I='Pq9p. mݻp%жԫCں' = ^3BPюL DFwf y@ ɕsE^iMRR} g>D׸_5J{֚Fշd1 {dmoǃJhkZ4A4k>ǘ)e:ʘ E[;q&H%,oD+G}w~>SЏM8a >Zqirr0H+F[@d^Xæҭ&ý0g`ˁdot]2UZvrdXtFZ(Q)"oGHvd<+͌ t!*Z / ZSR>i5B%#Qt0- ЗwX.8Ƣ=~!TU>o7I '@@/v`[EWsM͟'U7>J ^ P5\I5@l.&)"&Yay;eb 3F.G  yjz#Xeg,D MBp B@_11!p0;^'t[Va:4'*ȵ-cŲ>pd nJ. !9" *F器 Dn!JLVRjKC}r_9LCB<@+ZrZ!紑f4Q!bP:6DG XXqU8U#3l`-3SՓ u)wW0gΞK Ϗl6p|_̶8hU[lzt y݆ɥDŽH BqxP0La2*UZ-8ܵ ,OK|Ҟ"2w-W/5yS Qb֦/N)#5plϤ`^Xa<W?֥>mTqVZݠyPa/_ ͿӭMNV_MJP/eyi#n_Iz x}^\S৏pHc0ߏ׃axrϣXձ_6a{f#n N)t FEJӖS+d^YޑBI:_*VbT_ NU8N;c]gxOa%X@@ՐfJA,;~9l:Wma3Q D=*h|Ø];>H@)6dVi(K!MȦ' whpH x:Y.>EZ]K:6Ÿ}/^'?$~+2O~/'vI Q5X+GTYnRTb W^!AL)j''}tpawv]>wO c(R'x+OՊAh1F,0vQ>u7m&W9S`]'˯HƼ/R${;X*5>~ -u,wbl-1Ư=ߌyϨf̫P5go <730Y,~@qS R8o8$17Nc] X0 V}hspK{FxD Kņ{Zfj,:X;R' `jBK |0ATh[:*U!Yt0ׂIyMh)'U8UjIfD{D'`B6HOEm *JU?0&-_by@:qlȵ|p{>hDWhx:"ƒ! bKYCsLoq2rP  10x^p". Nyg&^6.VIM9D>=mX, }0 ?qœ XŢJE&S- ޖJLj Pwt>ՅkAN}UhG=|uNgAK&oNh-mqyDYRr@.OuV,gNm]N %Z sVu*#xe#0c`'u@D *Z,Bm*hd@j3Z i 'qug9 ,[hje1ˬD?J HXj=}w?z7⇧2F;?{Y}}|T쯪'5wbpv/MS^߇ >;[̿7>5Ǿjk ";hNBD6ς2 3/B/X^M{9f'ړ49"vsx:MoRNRzE殳]0 ( m7Yrp0F#Q?ȪuLn`/>T0]$AZSG&>y?zA.@Q_o̮5f90a4jk$6ۍ(pc{#1!!suip6d+@3fG){ 4 ``V@" 6{%VG{#{0ﭘc@eajT$Ə7 Z5<I*TuE'M4"nm&TmBFKm0܉5bIWE4C+`Um1t+ 8·Ʈoʑ\M;>`&35Z-HpsiJDdu/l6p#$[Lo:+M [0h` ?E^1CPօU5eeUYMWaԘbe2UE Xu2\a>K^v!aw؅e "vE<[S"3?Om}}6}xgB1_גKF 3*`ZgSͿo|OX2;O{VU SreO;hd:YQu0pI˞,!ZHv`iSB;YW5vh?dgp7 lԢꢳ ׇ4IwMs=bRPK Zr5[YuМf:tTUMCxN J|ڱھ˗0&/@%- 2strKCFĪI˲jvcM:$K?*`xu[0QbXTYeMB9-wPSQBk4n[K IE./uTڂ$H1ZܨRTؾ&eYk1<ݰ*a] 4"eA)sTyyQ mq,Bh :bdEp2da ($;53{R:'mяaDNG0N'ܖN+mQ/݈HXvühy@ ̈ę쨽q$]I mYV]rHEty7p co9rCE؆BLRLPwÑ'I8>H|X2\sM(6tio ݧE>#Pw'ɒdOLw+0o\tǚgcf^6)rfGvÞW&< G&|RL#|8׽8z( '&F[ 3*$uȚ@ZpKݨPy&0҇?'J|y mLމ¶K}" S2O$vz]n5v%ƣ{bKwtf%I: 4$umP}[F:&ã}x6aIXCP:Dڛ1L4J:]*:Ӆeh^Wtv98oY!x7?ƛ|WYm}x"ڭ\KsQ_L*|wܧ2B#~Io'S!tS|L|P{Uu^MUbe 64U~7 g{YO?:+TWYı|zSX$D-b`x , p52[2mF>~gW[xX^ ­55LemEIU.t_*B-x4bN-Q1n axD j7,Hn4 sEO"3u nLQɉĦpU|7ٯfGAhht,:"IqPBO^^EJiFIch\dxCKD" Um^OpUYlfW\v':*^0Ng@'Z- Y!! ¬{pP*e'Rlµ$ϙA|:xX$3T7 ]41NF˶ҽlNW#wƵ( `qS]T /«DGfQ$l)յC=a Hڑ;3C/c>:M'TW& D} G۾Vp</|%,ԙ{nawMc: Y8ȣ}//TU:2xRt "cb[*%#%4cp2!sēlT`l]άUGzF0e] Z?c#ŏ7kM_֨S$}M(Ne Zv=ގYA!'h6u(8s*NrZMᗱnUA ӱ7$ؿ@\QcȤNM]ZudZwv3UQ)Z#2'-հ`뻶]u 5#0nNۀ8ġ#vq $.VcsSk~5'g1{k{-[%MAMBAR⚮#3 ­W&Df`$: Tnk_zTXtRaw profile type exifJLRS3.Ss 3K33 0I1I100J4 6654 b0P2sA #d 4CbIDATxw]u']k[^OOU 1blpqIff~efIs^DZۉMܰ1`@]zOr^skN?t߽瞳k^^864$L^(` T5"PDpފtO?l@NR5j.4_.`/:}(L/ hA@nw!"$ swC'够[ϊm/k }cL5/6%4ť B):w j}- #h' `+g:iu gGRojF9,%m<ÁIwppQ׳P[R;X#`O@E47Yԍ95kG/V7 2<.A$m֔߬3l#s!!uJJ>XU|҇S?XÚa>YȔŸsz|}tMz0#?N Q .nJgVrÅD[@SyS֣~=5v$M( t;2yf?'.stx]%vE:S hp}f#|DGKl"m3GW:oÖp؉8AjMk="~j^0<Mϝu t߿F#5B͸Ys\,-7py/:uzHLGu89Zhs'sY?bY#Cfڱ-k?b &H ]F+~jp3w sCl;VQ[8(f6v~1^f5;lnCN~BE?qt^]-Ah3+|!Pې渇_5gK`,̖N_ʹ˼򚳰lQ1͋/ܩCsE9hN-gcC?^h1GjD| Tc+Q Ę0;?8rֈa"+2 ʡǙoݎ9g~.K3fH ?{ڱ11?Ј 33Yb_ȇc8BG Nlf,9d86H 8p G!e!eØajZFk>8H#[/l^sLl?|.5B7:|nl#8E 4Լkw9TF8*G %?Fhm֑596^z؁|4l>Lev)޴|KDεռhrԑ.LD)(W{P5B].]u9e_r|'[XUTV'&LCxLDb(B" *pOOP*&([f1UEQ%ӕZ-V\'03 &NSdhlCb5Jho +N>_[>:GۭRdh{i+>M]n٢E]aW"cA$LHUJe/rhoꮑX- گw53P Y =3C=+Ty٪eg^K:V-CoO `KRC{҈У(Ŷ~xŧuC{v2EiphUPAHE8S6κ7rPؕR :MZi x 0Cm?wOt@U!6-JH)+q'@ @ V,D]/;,O)`ZMxHF {L E0:Xm~71Yg8 H -DR% ]s}⟼u+ &VDJ4XM(;Mx}BH8S"36[߾屧7U4zG@M7Pw xٗxM* |IVi+(*Ѥeq}-|>{(6ZG@aqW6XX lWs QT@,|)@((d*,;"CU+eIR vatIl#\}yޞ۸u65ʶ(BbmDcY@tA͟FX71' ގb޲?~Ӻ9QDN,BTE,J!QfxF[j* Ac->u-A449b꿬&E`u;%CUU rMj&#U4w<Sr}yrz?m%`Z2C=՟WF`Z4Bܺ=aN_钋ٟ5 )  WW_C?u5]@Bjn&E>3L bB]W}󏏌(V%`R@ Һ]?ᆋ2p=]5:(&j@T#A1N@Ë 5$s?ݼ=ʃ { /[\!O5˜ YS3 3T{n",O{òjUDURUǟ9P.r˖}P$@B@S @'KM'l8uŶ{$s6KCW8S- c}q\uPFbuBLAVQjSͿw O}.e _~AL\WX Q&&-\6rc{|O[޹CPKBW*G%$$bzꆞK.YgGL10'Qҵ_U"V*&T 5Ak@J*j jPu/hZ%`rd]=X[>ʽ]{irZ5:a V.9[L`d ݋ DN\~M:qr}k@8 K~éK 5$~QP(D J,W^P!M P@?a%=+6]pj=ܲI 5hCchnE]2CjPt >?#X0 &"rv6'78JFsQ\ʹ=1&ç pUi(TB)Z}MArTP.zoo޹|Wmrz7 D`~`#S>D$ W*yٜȮW/~s7':Duq/>q,ߺ}bԲ|8 b[=]8q%T8F(H $vr<߻}wz?1 `Pi'z ʽiPJHU._|vwOs8A0YmqH5S 7^mXu&3GX윙v(2" Y&_ocaxO~dgI(J*O%&8@eZ zO\e) ZF* /UDX^U(NsN`(vwN^[ D}QuJEpY|7o}O~ O>weueljJ1rfm2P?<|iŶ>RP_q/omXRe::Hp t^rB%)>F(Zª\X&|Gmry뻮j%!#%IZH4|܍o'UI6}Y@bKO+Gdb"8Q<ص;yuob6*@LJ)kD%mbOdQ@sE|Q!~fy#HmbOJflL[mz@F3I1'8xv7vBI ):?m*(+?tq aRecX9LQIu$ JkKEz+!#xP)`p194vIAbWU%\ %2*wo KFGoWM/\yX{&Ro Ov A"5KNfpdm+ت]<,bXjs4S"beEL<=)2Ƌsq@my*`.tzj+i [( fp-sxl"UR%+dIHKRSv%"babrD=cPU.zF$ U*q-Łǀ,gO%C1(;!0sjݰZ:h<h|ԢTU4R4 hФ36ր98D4f=oI:RrScEy?՞ިPRqijTYa hƶ@AfQf0w+@0<_ї(/?|:אWy;$!` +F+ll(1FR\$`"3oժӸ|#Ei'zm-jcuWIDL>R3okefЄoŚ 6 ɕƛd5zO:a{}TWk0Y.1j Ĕ5o 6(9}8@!A=h4{'ьRX je?_:r.[㵫ED P"e 0I vnxZ_hԽj這:ּ4 .&YU!x_wR~}vԴMwT@yDyTW{J T1Jx{U(uroRZs˶h0%PSU'*G!ܵ?Uxi[#QvTIn- sA@G)TQ8 Wd;&΂hyI6Z_bfQ1Չ®7}A^~B\,@5 M2]/>LNJ.bIAȯrP[_w}A Z}UU42P&c] WYYޡ=ZmMZO+]trъHjpRک0*Nءq1;(i0km:BD`'Wr\-nTi;*]Ȧ3yB:J07?_/v=IkˆRQdQ*ӮD@<0˗$CX)&u!uKlXmv !P|ʡǞ>H(ęZSRlakJsҺت2DJ'4c/ TAvETDY)YcD4>H8Njd"dOnjَ;# iBy;k?[}j{6;Y7KD=7 _9R՘m k fҌ{"妧yga1K:'"LOE+NR0µq""~cvj⨵w<> >|YBDqWuB)GDa}l.-uvA:SR\6jIBjI,%RoD_]0Yq}vcc# )Uby4[8\، @%I)u3zOTE3>%ccDbȹ~GAⶍyjScckIXUDs= (R !.2" q{ 4b@I]pH#&jj<6t8D l|>Z(iމy2YRNм%EZb۠uFA(4R("#XvYKG"rdx3gr&6Y6c>F5F" 9fPP:94P^^4;S:ۜ>F-1[;h6s|1:]sP:_[awX6* ՁH)&?݆YתR 3 oy(V;tr ,Io')KUr>UUIWt)D OM!`yyh~;_FP$W`"ejc` 'D'!DIfj%dT&(H\huXBV*B)gԯE29m7&SN;DȰ-"p1 npqYU man qp(j`&?}:vr:.g+oLQ,YRNU:Pv0G swP`IUH0j͗4GK0%0)BKN*ġZj?K) 0X. Ϋ*"@#(|RY͸M`7#a "Co?aYA%!# }10O 3!o;e#kVB4W}Vuny?i>= ΀]W|[=IXQT.ᏈN׫o}[?FL 1ڴvpW@PC$\.Y@n)h㿹4`U0Uq1T׾g3¬Zcd\̝M_V(2 H\zzk564'Oh5C;;8#쏹BŻ57XI\d@.3K\Q$'Fp{r#E["[n[HPxƕdxڤ* Ɨ34jQL+r7\pƟ_LOKT֟|*!D^L]#4I jK ޫB'7}3s̍euQ6 -,!ETk[7o|GG⵰ٰG(_(UkeH=S+PE)rɽzRw[Pq_z#ܵ -)[L_'vAc0#ZqE?qIo4^|4rx@VBhyZX!(HȨfU?OqeCPhE'[qh߁.CKB?JYLui=R%K;k_Lg?}ِDJv,'VJ6};m5P,Ye+_ꡝU,=K.աwZ0D5:5b<[nw0ѡ6k69;U!@!ު] ID]tFQj̧_oQ2\pNG'2񲢚}}~QIik.\룓NIzM wUg`R}HRP*{lޛ};B=i7V{&'|%cUqV1bD0p\&S$SDdLr?|q`*t\v#=Oܥ1C,NW^F6RCm\Rjfx)#4U5%ĵ-OzJM(8CJ]͙hRcni4!OM _%HZ=Ti .NIJJ$B×; g~E0 A) {Q1J Eg..Mc߶Wn>1Du_{yn4Yܳlic&xBRhZe˺~Ւ+߷$rUr+c$|^wU'w ^[f[ʕl /2_#fFI㘬x#YPͷ1fזbnN4x5j+^4L>;v5 @jz3?ӷKQT |7J& gpB)DpɠA|ӎy;ؓ`ˡFڔVW'v v 4D&b2lpť?iŘ;ʢ7|RRDDi |hw@O}[÷>R.ET4lhow,>a5ϧ(%?Œt(`5Mޣ Dle i$luN@)uq B @"j5i!*% E0W'ޯ)ARR>o.鋕+U.z`"Pj;I@ uz+?ӕ]P=)l3g/2_.*$+p!DIQ..VE3p.pݓNlV7|oyx"&j#-ᲁިIZ؂S/r;VԛYT}|k޲W]|zƹ:̩_Xe;UK 6D`HXINvVdC)6`bbs`E"7T K0ܵv, D~F =r,-3Nl saLy 7[!YA)8ރ^w鮾Q=~m}k(i"r/K:hJ>Bd9<~w|O?dC99^2DY+OYtĉ˼ JN+r<]ɶ|yTi1X-J'ouKhbXbgHi1!99KӖ[W//jm?&T 53y "aP_d#[QS48_QẆrB\c*]mf ?ד%QN@key3 V8(Rt ]^]R]4v.ARDLCrOfI n~BN~XAJ}a0uɚԧӴ6Uti{M/ \*]#(HW }4$I_Vɪ;]L( ʛ-4*EjXu%U)2dG%HNፀ^?zӜ0mLYLb>_?Ai (L\s`=yy|;^&AQXD5/BVS+-wzc\`E)ZKz?P2oTMwb6Sl1o>Pشnm ,ZG/^Y1tsۣ"aꢋ..,漨d! ԥs/EW{?[Ndf-!U+8t }Ḙ0t3\;8 kzWVD&M*Y]6DHhd5:w$[~V K(W\]}\L\B.LIheLTfT7jhZ@ʇ)fJ(W4zթ[=4_B>BSυIHtqjIs?wƚ)1Sdɺ\)Ç*>ukO'k%f"(E8O[.ZW AԁF$5A So'ionejT5YXd\Z7tsi}eWnA0 k>WdM} @xRp&?DI4Dڨ:|ɝEqk ڱ]땣-C & S'4K^ۆ@qh(b#*Jv-%~{+$Ą̆dW a9\Fu<'w듋b-+' a9,"v4cVqȈBϽ0Zl8^(Y 6-Q fa(fA|P1 У<@H ~$/:*S}hH@)<\iO^4gի $ULN`tW |ޥpGq۾>a -_V{~'" @f 9IEae% F˯v]G=%B옰6Y@$>\ LC)%v#ң%%":7pZRb$W3dΜz"8Wp{!Y]$8/QݪFbQƢ6f;kY&gLp6{j4P>:󭇆?u;cdhQrU{lb(q 3 iR8izi HRLZc~S;b1 b߄:3l@F~扆)>0bURaYk,ζ.!c/ܔ%nh9Gy>XFDby[m[ut7*L(,۠KO=\,`5*vZ=<{p| Ĥ;o{lc׌Z3̨T?ϕ&qdckzzj_s_~9)NEb$纂R3NRN4K8e9 F &Xpv_.pGAaP.n8pu8ZHiԨK3L3Op֮r1fn'Gh*DJܿ\Zu~lEw>72Ŋz8su+w@WG(*Y%KTFkZkAFN[[ؕo}KtM d`1xqmN}ʱ3VQe8DZ*71%5@T@dN'J^ y"PPU YֆH t<0,IR]1դ͒?id )] ŤE@']!W2#5`-(+)-"2ULBdS|+^O&;:WGDB}_xڥVQ)049 (A C6~ҷ;4e ]N8cN]|ҁA]w/A2RIܘ]#CompR)6$.ćcN>3/%C vFdעɓ࠴kNA T!j k|ēreVUbW猻W+ s%((a0@!"[|>WkE Dno灟T.Z@iy'M)n4Jm}w5@FQ~IՏ^;vcåIQR$LTXE:ev'h#?/إƇ$#C ۉ0ë#99qJj"ro? LCMuF ԧ vS+@Z^k.D()i$K\K^L +JFU$}IJ (p.\ܛlX__.@4QLJ,|pҔ TzU{?ݮgu)Mtªڇ{I|PYvuE hTPd>Tͤ#C vb놟]ycx$B=Μ3 rGKPCVo%O=1%5@|^wm2|P7*QL=$Yz䔒HI4U-H/>ɫ[# -HΝP=FߕgP JZh[Hw>=ꩍ#Tc5s=42yI×n\6ZTO֞2\dGh*_mM#c)R g󮄍@5H45 OIӢw d{-}ߑѽ1TtGNoKΨ^%M\))qWMV`H^HEvS4k>~}?j1 %˦ￖ8)ȤmYds HTcNvwxx M+W;;d/UE,2N ~DY9Gdrwy>t[3n$ 0Q L,,/gK 9%7]ů { ;R( {MW uMAyoy4|mn0[_ 2cs%@cOjhCȵu»N}^=*"4onv>c'vFYӮ_ -*'NɋySE9aԑra"j<*2 -ɋJBitΩ7o"ipo"$C]毡Dϫ7>b{Yg\QS .q@de%= "]shKxꑽ11T/n pniN@%}`e"}y +"h# NvЮ=q#"1zD=NR$86H^CXdEYu 0ӥgD58w$ªoo! Vժ&}m _vw2}>_H6OwŪqi\KiyF%z\ :'XyЗf+l ηp̞]1%>j4b^̜,.-?h& 1`3/Yz, "^KZ/uM +HL>^GIA,nNJɤ̜257fFʏ7q{(rw3*4]g(ԕV(Ŏ#4UFOxJ9^'9n~$8r>~YSs.9)o',Cھ&,Vm C/ "84XI3p$! |QM<Ϛ/O\nb.k*1n'*EjI'^MN$Ԓtq)_uƫQS 6g٩("HScODԧy߫Xyf; b!tkПt`S& q0!gh(D@|ɡ6̾ž|e4s|iTg@`\MͶ␯B_(D[SIl$Qk l;ՋĢ2Fi\q(-m@M`,,ȿ葈$ GXmNS@vk gʫɌk`(.`\C̡`CВfʘ`-c-2s;v, pWTȫP=DgD]PnZHa㥿PuY^r 84/ykM.t KqnrYPڛ=3ڟNQvb8J&̪"pXLZ(!HS),]C.f@[ 䢥ZXOU +iVjn&xEv-5D.xRm=rEP2m Fk;K|W\s3ƯJ-U')8ަ]e~ )h]Z e26,VQWs*M\jL궐MY6bXʧ\:C3`@ `F28 "Mi"_4ٸ>*[@  L`X+UvŒ 8ffAO[A)KRc2Imu*.SΚ.5 ;ajy a!nq~f%M(Fxj`maWH߭b)onHQ= 9}.6=',l| 歅cnI}5ؼрzX:ʛ/o\r(”RNq˹rȪP|bHcK 3#PfD-`ZL%Rg#Y`D1ի*.)LBGĤQQ *4m27MM}BReg&zE^:p<4DեfX:9oS[:|剉J1HyfC %*QUuy5=ΔLIJ }mxF}');rg }:Lὰy#msF 5]@ f) YL . 2,:< yG驭ఊdY\<VM?oAX-2;5O(@w "s4RH͈ Wd=t`5mvBt@iM&ŻxY4H(]ͨMmC.SM<ژ)lAAzW#@q{/97|>er3RPZ*?F(6QF[An)GWn(٥#`ȉy2ڳBzsy܌^N-# Ӛ,!;z4d sTᗰ| eC^YJ)nRfFMG^-jcj.ܤņ˳`P@(PЖCL`iA3cR !N,墯 r (;Rdѧ9dC_JY2H};A#m}ҟj u j*@SvFΪFTxW'lqdj e 1Rp$VDܡ)˚Ցr4g$_}sUaONms xPnƷet-V.)* v'hHD{ʢ,`MxjA^UFo;QadnHde =L[ҪR.4,:3pjP3i J$vKi{'?k}v X١иkKVtA R!J`{ Zy uY`,BoCDSB!c9ە 9sc \~6|njp}jLƢG.!2qŲ'۞;(~֦6hɯ}Aā*Yme!D(SJ;za*HԓPыY]}m vxyXci\ՉW;"*4Y%V/:F̺ JxX/3N-^pF̓'mwtΉ*dR3w_*!+Bep}/?>DeHd|Clҭ2#D .e4鮓 0@!)DW7r4x%;ZxBmb,A:Zؘ }-TBUp9n-Ҿ\gyLdSɅZ5!R1?&Qֹ E #F*=T}x[g|dO^NdlMmo>@P#qrJ̯=nJB}?;4K|EPOwΜ֧eFJ]-DLui9n#81gZ,m\iٹMM[0%tPVaCD9Yy޸`DN7㴙&,L3#jҿmNL' =1:6: aNFBF4pkXq#9>r!chǰ4RuRm`\:6V8F|\bec;[#EF1W\ƿ1SOq ,ăbF`Cq yv!톯1euL0w>f@3K>G#}l؏cámپOC 8ƏHKA:_LW4_u.( qBp_G&L7hYZk./|\lpJf,Dmc.^3 SY_ 5 0 H{1?Axk0a0\xm"-'Ӏ/:S#;\dR|bQ;)Mj{cdp*M57]W;D9,l>sB;;-ŹSw&Hnֆͥ#r׼nh?+[2ۺ)  2׼ƕK7%tEXtdate:create2024-01-25T21:10:59+00:00 $%tEXtdate:modify2024-01-25T21:10:59+00:00x tEXtexif:PixelPerUnitX08*tEXtexif:PixelPerUnitY09I@tEXtexif:PixelUnit1eWzTXtRaw profile type iptcx qV((OIR# .c #K D4d#T ˀHJ.tB5IENDB`bidict-0.24.1/docs/_static/android-chrome-512x512.png000066400000000000000000003633431524342314000217520ustar00rootroot00000000000000PNG  IHDR{C cHRMz&u0`:pQ<bKGD pHYsodtIME ;wb.nzTXtRaw profile type app11xGb\9EXE-,vRdI̮JkΙ.XLɞe/Ur/)?q1͎[{7|Q oyߞL {~gWBŗHKOX=Ҽ)WzI?Kúz?ȯfZdGg/dy{Z%g=aX5uu:&ߝ5ȤТGRC49ڲ݇g|cƭ'Ozi~0Vo9F1Ťыca~}%lo_Q+{ݵQM\gOێu32>>ߌ++MvϚNraxu;1-co9mW <^ixg18XJm[9>&3_q28ia ?tofv{ՍZBX>b1h֕>DYaXo3ɳwt<giˏF`;n3̴SeO+otqX(kسgrerΞbu+ѝU]Z W0]ye }@A \}m.7O@^lg=NfZ1T%`7 s|G+ԖV߳X]L.^Nҫ ]`ܞFJ #9wˎGKǜM̱&{q?|*鍅Vz:ױ{]6COWgur0?v1" H]Nѵ{<1{-yԙ3Nbz}}Ҽ_荏h:a\<#g>qdC1?mx fȿ"@H.tUb~;7oG \ oDCsC tB$gjE2 6{h6MzKuinw:>;3%,mWLaVx&j8ʙnv;Yu 5kP^VK駌P&g1#cG86R@uX9 n8̰W s\ՈwbOB0vW;[ usʭp386@&uaPǩkal9kB1n9E`Vɹѐ[`Vp ?P1Ɏǭoi1-q?CڦzIFn @tsHR@!N웾BoL!,}Wq>(bZ8ZdF<ȽA+ْ8^x<24_&Խ`(8)j. !VLB%hqL@, phQ(,B~P|A|N΢reBmd]ZT.sFu%~_NZ97c;Gg_/dt~qn>7o&L]tjͿ~o>'&N3yw;^3-0#ZP TmtAH."~tĬG@P;H>aa<Ӫ274N=֊XTTu`f.#qqu2X#K ;jVD3Zun`fo *esv4ZN*jyQζ%By@RE F4/W p 2肅sm00 &qYJsOurᡴ2y+*iA*;FQT. J9om\'h-:I[kd%,KXla8ڇ8/a6a9 !qp$&0r"hTfÆ3"d]eg\k=6,a k9-  SB 3t8jr1qd+WqwQ+5Wiabqv#aAd“m-UW10i{㇧ET#ɣB j^V O` LA#{71PM8aCWx㵷9|BؗfiW 2BZV{E"Jd8>_Ue F^2P^0qpè2KVTt[^3ahX̵x0+Y6 j]ZS)8[Qo9,0Z%:D@I='Pq9p. mݻp%жԫCں' = ^3BPюL DFwf y@ ɕsE^iMRR} g>D׸_5J{֚Fշd1 {dmoǃJhkZ4A4k>ǘ)e:ʘ E[;q&H%,oD+G}w~>SЏM8a >Zqirr0H+F[@d^Xæҭ&ý0g`ˁdot]2UZvrdXtFZ(Q)"oGHvd<+͌ t!*Z / ZSR>i5B%#Qt0- ЗwX.8Ƣ=~!TU>o7I '@@/v`[EWsM͟'U7>J ^ P5\I5@l.&)"&Yay;eb 3F.G  yjz#Xeg,D MBp B@_11!p0;^'t[Va:4'*ȵ-cŲ>pd nJ. !9" *F器 Dn!JLVRjKC}r_9LCB<@+ZrZ!紑f4Q!bP:6DG XXqU8U#3l`-3SՓ u)wW0gΞK Ϗl6p|_̶8hU[lzt y݆ɥDŽH BqxP0La2*UZ-8ܵ ,OK|Ҟ"2w-W/5yS Qb֦/N)#5plϤ`^Xa<W?֥>mTqVZݠyPa/_ ͿӭMNV_MJP/eyi#n_Iz x}^\S৏pHc0ߏ׃axrϣXձ_6a{f#n N)t FEJӖS+d^YޑBI:_*VbT_ NU8N;c]gxOa%X@@ՐfJA,;~9l:Wma3Q D=*h|Ø];>H@)6dVi(K!MȦ' whpH x:Y.>EZ]K:6Ÿ}/^'?$~+2O~/'vI Q5X+GTYnRTb W^!AL)j''}tpawv]>wO c(R'x+OՊAh1F,0vQ>u7m&W9S`]'˯HƼ/R${;X*5>~ -u,wbl-1Ư=ߌyϨf̫P5go <730Y,~@qS R8o8$17Nc] X0 V}hspK{FxD Kņ{Zfj,:X;R' `jBK |0ATh[:*U!Yt0ׂIyMh)'U8UjIfD{D'`B6HOEm *JU?0&-_by@:qlȵ|p{>hDWhx:"ƒ! bKYCsLoq2rP  10x^p". Nyg&^6.VIM9D>=mX, }0 ?qœ XŢJE&S- ޖJLj Pwt>ՅkAN}UhG=|uNgAK&oNh-mqyDYRr@.OuV,gNm]N %Z sVu*#xe#0c`'u@D *Z,Bm*hd@j3Z i 'qug9 ,[hje1ˬD?J HXj=}w?z7⇧2F;?{Y}}|T쯪'5wbpv/MS^߇ >;[̿7>5Ǿjk ";hNBD6ς2 3/B/X^M{9f'ړ49"vsx:MoRNRzE殳]0 ( m7Yrp0F#Q?ȪuLn`/>T0]$AZSG&>y?zA.@Q_o̮5f90a4jk$6ۍ(pc{#1!!suip6d+@3fG){ 4 ``V@" 6{%VG{#{0ﭘc@eajT$Ə7 Z5<I*TuE'M4"nm&TmBFKm0܉5bIWE4C+`Um1t+ 8·Ʈoʑ\M;>`&35Z-HpsiJDdu/l6p#$[Lo:+M [0h` ?E^1CPօU5eeUYMWaԘbe2UE Xu2\a>K^v!aw؅e "vE<[S"3?Om}}6}xgB1_גKF 3*`ZgSͿo|OX2;O{VU SreO;hd:YQu0pI˞,!ZHv`iSB;YW5vh?dgp7 lԢꢳ ׇ4IwMs=bRPK Zr5[YuМf:tTUMCxN J|ڱھ˗0&/@%- 2strKCFĪI˲jvcM:$K?*`xu[0QbXTYeMB9-wPSQBk4n[K IE./uTڂ$H1ZܨRTؾ&eYk1<ݰ*a] 4"eA)sTyyQ mq,Bh :bdEp2da ($;53{R:'mяaDNG0N'ܖN+mQ/݈HXvühy@ ̈ę쨽q$]I mYV]rHEty7p co9rCE؆BLRLPwÑ'I8>H|X2\sM(6tio ݧE>#Pw'ɒdOLw+0o\tǚgcf^6)rfGvÞW&< G&|RL#|8׽8z( '&F[ 3*$uȚ@ZpKݨPy&0҇?'J|y mLމ¶K}" S2O$vz]n5v%ƣ{bKwtf%I: 4$umP}[F:&ã}x6aIXCP:Dڛ1L4J:]*:Ӆeh^Wtv98oY!x7?ƛ|WYm}x"ڭ\KsQ_L*|wܧ2B#~Io'S!tS|L|P{Uu^MUbe 64U~7 g{YO?:+TWYı|zSX$D-b`x , p52[2mF>~gW[xX^ ­55LemEIU.t_*B-x4bN-Q1n axD j7,Hn4 sEO"3u nLQɉĦpU|7ٯfGAhht,:"IqPBO^^EJiFIch\dxCKD" Um^OpUYlfW\v':*^0Ng@'Z- Y!! ¬{pP*e'Rlµ$ϙA|:xX$3T7 ]41NF˶ҽlNW#wƵ( `qS]T /«DGfQ$l)յC=a Hڑ;3C/c>:M'TW& D} G۾Vp</|%,ԙ{nawMc: Y8ȣ}//TU:2xRt "cb[*%#%4cp2!sēlT`l]άUGzF0e] Z?c#ŏ7kM_֨S$}M(Ne Zv=ގYA!'h6u(8s*NrZMᗱnUA ӱ7$ؿ@\QcȤNM]ZudZwv3UQ)Z#2'-հ`뻶]u 5#0nNۀ8ġ#vq $.VcsSk~5'g1{k{-[%MAMBAR⚮#3 ­W&Df`$: Tnk_zTXtRaw profile type exifJLRS3.Ss 3K33 0I1I100J4 6654 b0P2sA #d 4CIDATxw%u~߉{o3=`=@CA(R4dH+Z(V{z?RJɕ- H3 0wϴ2e9H{fuUwUwt~yfFDFsXb@ ТEIhy k[OA-Zh@$}_J-ZhDȉ ԟܠE-Z@@2S >]WkZ\ o|p-P7nL`;o[hⅉr -ZhF[hBi6pfyT{l Mom-5?eRQryk;lJ13miamni?7bViQpUάȼQf{^ԟ\h[=Y5ްv$Mmdf.v2ʅ6 {nC'6aٖtF;%x!Qm$cؒEY[\(:C5J]IlqcP]ӯkqmvnDol3khЋo9Aoԇ/XۚY؊n=|Y]*rz^k"a=qbֵH68>՗-э~}:t\|p>j]^4xSγsp+q_^r l蹛 jswntݜ6xYhiJ|ve_vnʻ>ۤ>!Ec5ydЦȳ ,jsgts wsژ딪˚yx[>Ib f+ئ['3/y/u=M8wwDmsQ=VF76V՗Mc~Sstnj0~Mz ʼn9|>|_:=aޮWhqijmh͑q[hѢŅv!ZТZGZPz1\BnvK1f66+Fghj^S1^$R-ZB3jZТEv@xRZh⢃eYmտ“6nZ#em̍<6د6U):ڿ.:HFm C{6/K^!἞&ZܕE'K:hѢ aaojb3^|9,=Z7-.iXS/tlJRhq)c{ؔ=%5-/dӽs^ņrſmެǶIDm;d~톳]cFZyMr/[l]xf2-ZZoXZ\.x!iZ\ZذbBᒴTє~= 7Y/|YE7m[=W7+`97lqqᅴi;V6lUl n@-dMGZ40Zl:.yڂŵTUߺp- msKD{Q8hѢehѢťMz G0i29댪?yշ6y S7v ʹbmQ]bۭ&f_H"E]|ƊuwV sle7yQ 癏ClZd- _-.u0ږ8?[d2 /WjRVWo[qbmq>1yrm\G6֔nBmIA+ehq6lQtQ;K 6[hqJx>Uhqм/`;"ElVƭւhsQ-+ZUv-)R9mS1=vF}rQA`f͏i!g߆FP5.[@ٴ-u\X}lfc1E $kkتv9cXeYZ~sΈʉs9BUfjkcUh"bf-,hf) ruX-ES-\=1V]gtzdt5n,H-;I3a~5 l:$K3HTXA)ooBu* `w/l:.N=Ϛm ~@‘-BB@)i6/s-\βU_FVi5BWRlF)Qxf3XWh8m4ix/V6֩dW}A˨g&N͓F 9aR(WwϞL< -T4YB5ыґl1+f̾2dDFe| WѶ>}U(g(2 ΰ$I3SCW s̈paa3e2 HgMC*\.{Q\$"y}X*4!LC薆 D,A& >$$@jTWx3oJf6'Z Jg B"P΁FPU2uB"f@3,xĩSN8~G>'G+Dt5FAith5 wOw,n]=bPLDfԐvfk]}n[w3f hL¦,w V^Eh!"L= !#t|zGv|NX,tdtai}VVZm|h ZYF"XD WIo]//nk횝튃Z:Aaʩ:ʠ(PZѺ`$t#HgOc2\쏏9O<_G8|34u`1Miah|6{w*<v-u hJE/Ew|uw.D #TSXBmez >5K@KҜHЙ:Q,Nc_W̧{g7CCڰcnń4$!:Jۡk/7կvzJ Χǫ`PxC4NtRAf-2#[_Hg rqrG{xȑ3cSP h9RaRLYW]w/y+^|MW޵F6 &Hy!*2SBTeweDmZ.m@ *XF3Ut:D׹%g{p䊠ڸZp1$S߹Wo}7!u, R@KMFhC5g'&]P@Lg YgyOc?{3'O.zGtbXd 6d'm-8Gl7z 8d0 .s&SyFo楯Ɨ/溫Fx^SZJIPe4{L(sӪT=j60NT/h{ji\ g`}{8@ңOo{>{ial i3S!}_uwo"= L 73&29%5Dns%!`0kpd/UZ|ӟԽO~+89Hǎ2hQ9UZ ekc 1\Xy‡_%LD o<t~/5wox 襰tClٶW$7pUJ7mT'.;O<'&an]Yrk|G(ɘjQPM\qۮAaU8S3DW~wyKﺦկ!*$s̓=qWelЄd{& y͔4z_4,@epNᢪEcFb]:_c~=}Yf^`eRe)߰c؜:"[˘@ ϳx 'jb҃_o|ݛMw#աOTmlSTRN%B,4:'WE.(?xg_%+cYD#YN`sde¯_G"f 4j ']G'2^a1[&cfnox/ïzmhh~Yt4,v8 .A>l(|8m}aOU OLu3c=ٿ>?Ǿύ8G΀e"ʪ|<2{1U@ 3*S׋o7w_}Zt@6B#='5N CMe-.SӴDO3fS! ۃռXI87-la,x~s{]4a=hA" 2,lSο=e)ȫPZhLh +~ni~ۿ]޹}LĜB,o06$٨M3iXURStS'ß{dd,d@Kt:iY{Q@аKN 2-q0fƗ~ 7  &" (*9Rrh|#Jl녙RvfѐMl `} a6EB95]yq{xGʇ{ cYZ([) S@gA-A=|~XSHR( >0Ԡ >yv#T/4xp}C [ 7SFfg/αÏ˿[O~̢78s ]60`5VXq@P@ip jJus_~yC-IMSыtJ*Ofzw+>dM[ת`גyO0Sq9fůvhUB/͌f-E ~?oόg04O@'Դ  "A6K#(j]̧'O=Œb<g j58\:M y41ؚm"QcJl1-2Raްi|S~sRX,Ueib>lP`mm6@a&T™8|[ݷsIu`>NTB|۬xepJ9u73~Hȩ;f@?9T^3T/e Y`[ݾ;"1 093h|ۿ]߲p%bHNc9!]9+հ\K::Z6.Yuf^3HV? pNk+405-c{<jnA?r飑DJ-zdK_{?)Woyۋt]$2l#uT0$G3+L0Ʀ@!5b7غhmv(-.eh cQ `Y13OKO=͸hY ʪ[>v:qwN`y"1 E]MxϷe؊iH\Щr;A13C\Mor2k0Uʏ*r1~CSHĆ1KTaP0 X8hFo),О=ۥ>?܉XjMjU @ #iFQ;_{-ιL!x PZD `i (,)LM=S4˳VS-ߜc?U_M+Ӿ;Unt}=eY8Qsi()j81{/'LZY0K2s^A[뛌bS!i^<,zӻo{k^2S^yd$ho[Y7=uMԢrTBw`w VǞ|ƚtkٹ620OiFH퇪)f"c_{C|rr%3'&nt8HFj}N6?T IA'BlO.Xg~4ĈNL<({(p_+ctDHdv0Ӈ>2Lܝw\wW]yN$2t0A $h]XLWiEFa~ z [ X(庂ItwGWznHBH}L̬zʽՌ/$l`EPbSn=?=/盱wQ' \*3d3gMǧTNs f~xhh_~ϝ^=Kn}o|xGRQH}fJd]~<0L?We 0JR1)p 5bQI☑s_oէ=כdy h3$ ,  cpŬo6}̣[}s)ţ9=wwkp1C D\kEXCbW7+mY,M0v<<+"4^~H {6  f '; 1DA)3|_ͯ9=㎦ȹԉ˕s撾Ioٷ x˨rJՇ]i_}6_YaҪ/Y>+??!`%MOy>ҡw b0 Rd ͽ&=WFo& O+[g)<*^Շ,26vӗ׼}v4g)82$3w֞[;*fq܋Fx-}o{ٿ7xGanfCzcSWFcS/zez̧OsLc`,ƻ߰{>|Ԣ0fE{Y<7Cv2M0q50 8 > FD Л_"1. z6T.S̎Jz BsrK^4] Dlh&]Q1 FBI0a8ė7a%gYŁzm]smJ%Es}BIDȝ]׈?Չ`H(az AHDW'O>:[\<ұΠ;*uQ20'~Ofz CN5W?sX0eowaz"cO˜GHasG#>:p箟?Mo{p&s8}hox+\4 qY\jpneex@PWpiPB ˑ,^7U?#RCTo*ga\U²s%-WK`GXߙYF[-ƺN5>=ݲ)uEfu"hYtgO?IGE7tG]xK|c>y8r?]WcgѼGE=Ze],%VHS4Zj6uO?wW;C5͟e~tQei6dķe7A7zg~'v֍#o$ PB bw/?OY<>xo{ŽrhK}9:=z-ڽ\fn!>C =PBꟾK1I04c"yyĘ8zlcG7t~G_y@EBm0K#.?39*z/Έ$%HH4}.g냥&Rs7x+?L J?k.=GJ )6LX/c%2Gz|wcOS.dEWG0 $)!2RVГC:H:Q gFHةP'GA6@F:tS/NF 3DAyObj¥v\]~hP _v qFCATRPaZlCCptO,/c .?sEA%}{t׿s=3'z]κf4a^obWmAz5e7L+-F^Tѩ|uvOw,x:C""PؘRbC. BCi))0 YnoxOw};έFXKx^-H򽥭ѫy]zYT5J5&ZXș34>BQrıC47jY5$LbVPI%xϽn왵j{oF' 0ɫd ; #a-7^"O}j!;K1 txiuvF:yv!=UR5_MVH>)-PQ[-ư0g<*ZӐk H.+M!d$f:x,=B%:)EpǏ'i)Q߀}֙ɗ?NYHf!=rYW6FPl97^'s,'ŶfWNH"ʮ-~'YvDf~J9V!¬dVQTf GW__FΏ2=gNɫRBM XZZ|q #X?4r c5S3؈L Պ%{DO2z9ήP^#S@dSj3IHC5 1nv/㯼C{Lǟ;?a G383kOؑ:TA')wyihS rv'fЌ ha|^i-!S>2Y-033H ۚiglu%۽E?+; Fz%JA+2ۤ } h7읮hBX\uz&4ucglt >k_kw"'=|??4Kz1! dJ8D(l,^*p(PkHHbjF%;'sž(?vW?)YQ*(+^|&݁WWF˿QsN2(RKXip6E aԫ̠L#=wá 脾B/.jHL9ۉr_s$|%o|ɍ!ES>ȃE!t"YUg6u4 PoXCj*Y]JUbP=`" _}u::m1Z ;w? )jo6w-o^Y%;pP ;.)?/3?a|Yux dafQ  L E?O9N LV5NY ،iC[BBGj~>aK\Cs7w|qf&Zs0 /oQ_!矉?+>EFPWC[ʞMś&~Q2gfD( Ek+^w~9Tb-EdD,wq(5NAu'[~0"3HXAG~m-oY>mD[mn0ieH@{}q3En'"B-Zx=YG* ˉ@L\w-/yѾ{<?FOv@0{>[TB,Y:9>}b 8Q^{[^qҲ"Il\00ZZJ7u:Jb6sLf4)t| iIFH3i.__0}K_z}?Ȭ'JA<8 H"1!@lq'zWig=dǙx2ulVfAn4O!09f_}IE~I\7vێ:N!8zH)=rOg(3 gdȘ T<3,6%iMmm=ya7)3 lgM<ة&@ojGb4&w$hfFoR4\rY;р54DEiRrͤ)|25-j"{i&&I #ʒWg/e*(Ůe=1r`.*94M>Tt.I]Xe+&~K_;Hx(f]v]_7vR˜OR!.+C !It*.c8@f c\[+וV % d?ŊJ˩[J䴗^N}gO'%5R?}~,d0k+y` Ͽvx܁ﬤ՟&|b~>ҁ%C}KW,CӾ}$+H˓IyHHDQƔY%5Kl1l!| i݌|׊">[,${‹_|c?SSΘDH8D^z %3yϫ~|Uź"(ۙ 6L7?j]CU̅sAF0ccʌь02,hq"6\7XNЌFL"QvE?>L#QW)wyDKμݝe}hgWV:|\Co4TTk'1嶊hXtw/~@ ̘:U w}gn;;*E<2]8Xߐxjnυ ^b|*i"$رܷۧe"mP1`UlEUXV-Әy -A +N' DZF]{em,=RW|pfEw?i]s=缺q}{! Xϻ,귓Ԫg%aZzs=pc+'踸vy\DU2kju{qϸSO8%T_+~ޙ8}1ͤ*"z9@vg'[\YZ Bx]Hz/~2oZ^[QV\ Pf;1:f$T9EnE̾w:yQCŜ[| ]u0E a\V\]x?]BL޼QS(lajg|z0Mo)}_CgNz{nn5/w7]4I\/5.0^ 21ڔFKbFƣXYƱꌦjnL͉0JrҥQ#yu x餌cX\:{?+*T|hze[8f^tOEB'z1S@"Gԅd|ɕY lol@l)i_/";n5A<B1X߰ZfTD]]2П|_zc{Co|ݝoxWM\zXғt LHyˌ65Ve#k'ŀīaLjݡ_N/fKrK}Z##3lQ/w,v;֍`+TLUy;j>OluT.9ԝ`,vp}j{`/ 3LߏԜv;ӣiX""Q())>:re[`B=m\(/.?~oWc/Bj%rtQvV)3maJMEUHH:Sgځ{~>/%cjS1/lQ)^x3οǻi_812*$pif.%]0P 6dݹK8"ȌQ ҄`0I4[*tUvx9{eÑbQGg-ll_B6l\6`JL.~9H&t1``R]_OuG(`{0*-S23>b ֽ~Jwq'2F q!(wZК>&bXeN9P*l|/}`qD iG䔸"Ϙ>2?<>mqv$$5:^c%b$$_QռYh4>g,=Bg ܧscF^ Uө8gΙ(iP`Yf, -*NCܜz^Ogrw7Rxҥ Ć'xvϮ}WqJȢĩ("J.LT:GLTLB/E "f>"fN_bGCS˲Ufz48}bΙNd GƔb%eiG-pJ.r!Oe׫}ZjJS'ce7SjJ*M ngnc?xUOtElLiP=_`OM8E_[N\FQ(^VB6ZsKe`oN/\eհYI7!0' |e(% LOQI2coy'Y"wLT =RTX4?rçӧ?h\H74V))`TJM~JiLM+GQ]Μ>O?z?<(|uljI ?}SOw;{'đ $:bC$c! r(pHDD}x{RUڊ$I6K_R6l&<0VےUB홈1Gcvneë^2FHl^N{k(?OT5 pm\M7몞0WJ5{)TD^,+)cY0.t J҄03RPq{Q:jRDt凒__/;ÌF"t~t:L\-13",c!*^LesYjXֆH4E2+ѩSgM~?$R57M 5J+3Qg֟ڿp;wnmpAZ'D*})yV9dYK*]DGQw:<6_Jdݝ׹7C)@o5Oʼ*kY!l$["d6%&)!s@X敱p `=h}5(sybAq+vxW*M`ύdL J:1ݽ]D Yf|Swzz_l# ihىT\&&PWt%[!W9dYڵlooYzNmۛdL𪻤X31ʒ?ЙG:wJd<\/ŋϙYP(WA{PeXh%8S5S't0ԕ VZJ7%YhF#$.Mك-8]3鎞Z8ed $̪; nmYVvbBQuWQ.PZƐÐ:%*fSKX^9k}2ZceJ•w)'PIEihi} zE_}?ϧoi9㽀 P G%O&/ X{R~o99ˇ]&YO _3dpU=&Y_siՖ0U7W>1y*|KkH %3,ZΈB 3E"F=ӣ$R:O|j/>s|5Li[R]Yoo d+ױQKS(f@S` Q=ՖK0Q*\̓ rKH_w:K?znIlΥ09{uPw% V!5E|RZ\HW/hRZx Chi#<3kΣXak1h haŽO~Q4Ṕa#h٤:S//^$VxA%iw7}߷;Tҿ_T\!oFW3t.h,kY.YX|Td(,t.4|`XNNO-8YTMTz~$O>2z^D9gХzyQ'6mZu3snUl`\aUi#3W^ڙ)s#SjFQOsxi:"F42":jX%(DA#\]5TJ/4sn%s1d* N[X}Vy|dLyݵ?{S##Ԩd^/j.lbg=ozՎve`N ZQQyLٿ,s'^M\иJŠ[YfRxnɟbF *ۂ}%%Y@Oɉcxt8^y'hpMA$G~q33@zSSa/kohM|#M F4J#{tO>w(,zD/j!q^IӋ;LU4`j~C* S=f&hgU]XOSk5){>\ 9ҭLv&9H ? c4ܕnvő c`m'P8V YфTm5XÑyM&Ԑv=;eRQT+GL̜fozj^ F"1GQ8gwKёGO?4:s~Хvb ٗ`TLJ?L(Y%պ5ru)´Ypvgύ"%|mHKJсB)Bv~/ΦjYz`q+Den+ 1?DdtB\cIm׋A(@^:1{“}vf]C$X'l4Wq:Xk[h\ ^Sd/}O؛n(kin**LOj5 ZDJXl!}AUi6)EPW7F1Hje/DCPd<åN2PUFP!Arip*#~f}FAbgV s.:Ϋ035b/CO-S_}<Կv<a1%`TRw H |rQ"e'v͹hn2GAbPjuCc}iV雦zg>dxRXC*rvXE("j< 0,"188 UiMsSr_xg'6NX41ZǢ&iIVxiMYeAebLi)y{n~X7B &`%8Rej1?wTg l s#elҥI7QgD]0`D Q*$ o=!џˈTʻ;q~?IT^{85@TN:Qډ9z[3%2sQ(BrT] &&jT^a3lB8$NƶtJϜHMFgb? [F[;^|4hUMfAVISJ!6 ģ3R?;n5vc UQC C}>Ql:] ]šQMWqN B=BxjLgyz_s6/b Q#T@,߫.Y4MzZϰU{ٔ|=-Yyb)1ժ wb 2q0E}'?fI(UQ9cOF].5:^?UINi˓f~yeeĢ`Z}j%~U ;K7ۏlTaR6wIJKu}Ro{b3TJ(#$1Qi\hژ`@ #Z)OSGDBhajYRNV`ip?{xx Fnl7x02!|7u:tX`d֣A*%'$8G΂0Vh,(C{_⩅=f~FΆOû4М4?|P8gk2l?ġ~e4^5ׁAQhLsմ0`, 1[ٿ=У'5 q!ōnP|Iǎd_u~⢂W(BJ"f[]#N(M${dEIgÃGgQE M OY)TQwx/+ ZN??]P}wBzYfQ!PR,-b-?W>GC4:✰Y `=1[X( aĻD;əO|%pucgIO#QE+f0=\\`rڕkBWR)r:\FD.N*zj牼ՒX#"V]ߺZ!]m^27 >vϗz Ma"0zqu&3E> UeMȆ\7Y6PTVp3DfL3G#Gt&T `6` ibH3}__sJ-"4uPG9jQ|S+QctXJ6b1mφ4y*JMRK1/yu#ѼM84 系hT"B 1t<.5?l:o Y|zTa scꑣ^97,^ T:kv$UTX-3amW yVzAGHcO=2K#2-E8#-lP|lFNf]R@ucy3sǞH8=xXxx8 o^ ,hdŷ.hTpL&i:|*?w/Z7P;t*$@ERUdz,`Nt9-CS#H/+.8t&4)/U[Ȃ*HK լ8s?}0osNRymB^Zd^Ԃy3I-,E֫[ >ˇ_CΏܱ'[c" ]f-ep$ȅfbИΜ饐p٨H+i8fNyxǗ?͟Q7ӎgLFb qN@XPQ>#QϋL͆dey =賟>{O?57͹n⮑4Ϸ^XJ7nwmdI%.>[/P(Λ405 uDU8|ҧY@dt5hPtUYG b*ag{5Q18ŝ;&YXјah3jd\W%!2az׋7ۋ2j?>+|Q| dԓ)Ҽ O<5X<`ܕTPb/4h] ҁrPzԄ"E wMfWÕJc*:ȏd(!NKO1qgtQY* kTհj<Տuy~1Xi~5Jh(&p3 38%Uŏi<6^dD;E[D wBV^< Lъ"tUGB¯TT |U0nYʒV)H"s3yu-[4ML$C1ZӚs>8 , 9/N\sNmJ3mӟjQ2+F2}²l (&رK=z ҵ0yY.܅28cÄ82ML͢)j^:վqI) 2P[ heWdyQNԣ'OOeh_Pǀ) b42\y2yZ(iS6yBFbp&S%}]ҝ ko?t-btAbg2c'vL2G !).hQ ԫ a[ !҃*B$:]FH($"%UC,$Z"Z%X&bLKg,\w,N$WC,BSULDZ{jT`o~˾Gtas Aԥs_={b^ W K7*YnF)C)sO "'B !ܺʫ`QBA(DNੇ$1wgڍݮu:(ELTER5k{FOƲ+2kՐ?̌;o|v-S!!Fc/B@D)9j.!Ntǻ|$Wv)8^PNXW3 N>j^l-jYEe >fU/yZ-ᵌhoSONf6kyNˤbu`Yj)EӥM{)ܡҌ꜒b$҈Ig0>wTzbGң_+'08&R7!i V>Rt޶bˊP̨ P1UZ*G3Z 098G<8E#̉аS"[Se@pƈf@!OF=3=K|޵=ITīҔcT`(M2bB/GمDĦz*ݵJɾ)|\sd߃̛ L[شLx Pf\CNxyPdq{s+˼flvmʓe13MO3ϧH&&$B构[n5x#|W:{E}<8 R$w)@5Sغ˝V h*CpS8%i-AWݸYפ#nq.*%SQJh,کymY]$% &#g GϤ_|8sǡ;oF3lI0r$4T8OGeGs9M" [SVfdZ!R5Wf}Ugd,h( tk\_*{`ܭ7 Q*^"Puic&Ζf<4 ^s47ɣCc(Trfy/ ;HQE <c{?3;O9TQB`1L<22 bi_en홼He^ М'UdJapjIŠEȖo epJLcOEf3G1UVD +FX59_w I̜xiGF=~Է~n:;Lw2r)OQ+zu|T :8g⸋.NeJyʢTTztԿMjpЁ^}_<lű{n!ݽ`FsןvK>kmV0`Wjj'!; 5T*#μ^$5j ?k)N[ܟy=]M<蘊H9 B5l&4ngid2 ѩ)C q F'̡[T:6\ K7j,Lc>o31;LS'r@Xa~6Fb)c Iu2ѥO~jw_zۋxv.0G5bHǓto]ˍlNAU ,8" NjUJ+9|8r]T{2(x@6:7ҙ5:5Jݴq]}⚦ jߠ\(/`>UB6ZSrM ɤ!TVwp(g??> ^#XCEM<*:UKC2ZՁUжfUT*FyD2mO`YKfvE0`dd L"MUNʵ6on# cTu9&MBt9]_xjÿwڡ;uwTBd1^ƈցE(H%3(ĺ~ 8ׁyvWrF3 布q8vscg7BV4!b5C'<*'9<}& b&`ji%W\Xyk_ u6V^Txp ZTctFtT8v{'州'z35$85Ҳd1Aj?h:PkB0 c*vv{ x!s;sHJOq ``j$bG}rxH) 3f(-ң=b$%]\<oo[\ʐՇ)`%"ief{~wds!"X @#KVJaվ&@ TP >? /0@tOO7sbL ȓa4E+JY0/E^H ª[0tde,"OAs IJCdݕy6F:(S/,?Q3\ %6#:G_^C*@09# , 6["%n[UW}n+fڟƠ ΋hIcP F3ͳ3w͈6eeU.Y98%3IUK4J3͍EEFh%U >?.x5%87M5_U%,+ $д3-~ -o¨&crD(+N ؘ< '\7Xv8kX^a!?LcG>i*CVm嬴uϥ-3N/;.:c̺Ȭz²Yf3$n¤b BVWq@TQmՌ z̐ݵ3kV~y @ST E,TD"G(K`>珯rьUn 'C*},[aXH]\L0TDmlI_6 Qѹ lEI3땕%_O1+8Tek cj* BDdy _{(9q[բE"$P)GNv>/}op,ue&GS_@y+~ۋLd# P={Ȃj@lA:Jh9%匓YԳ^.ʔCmz2-`6 J,TV4O5ZZS*I:h1Z|m2-5.TSH 1ᕽ3{-NIyI@bPX LxS,X YL^VD4*:1sw15q@3[n /ͼ[nU?(sˣNE%2%!T ΌT,<$uM+ޢEc9(~S'DXdH34yI3l.@p\ Q,Xv4d^7E$XX-sEՀQ1 dsM+)ش3,sy\a2gհ0OgNAӢEfL88=O)'O'LJ]X\իf|PugPZ5t SB)~^;(q[2PEt,WMz]̯Z݁,fn˪xfگ9(T](T6B{Ռ L`_͹D*PF2R}1ˋgc +2C9u W-Z\X"fF*-MZo$ L+֑NrGG @IH*[5O0@6s|>Ӌe>*[s]W}5q\_&'Oߓ):!Ιz zh}1nv! ?-6 K 7m} {b߰$XuMRg$-KѢEs Pj s T0(dsݒLotqMIuj`um8w\/+ԳHGvUBPaW^uXD[0l2,4fPhQA0hX ܈t 9[MP%9S9_-U ‰c&M:6PꬢpzS1ӌJ J^~X,TcL9?-IӪ|p "I  K>\ "#\W))qEy :77>ahqM~5fm~{Ϧ6@lcS)B/o_'qe8I+Fe(2Sgm+0AQkg.X/!ZsபP_4 `hA6SM#/a ݄a\eiEO^@k)UlwvZ0Ñv+gfGCi%u s/Wkp 1;o T(A.9V8Opc^zL aG ƀxRCր2s݁fj Oe/et.XgXd)5jr Weiu J$ r+hbݠ0V8ʁ͔ L%? ]'JnJ?oF4A&"D{R9dqI:_L}2Lꬄ)}&Fh*&,dy#cC]σӄWIv/vxdf:-Zl&0H]/sž5yjECP`f:Pf|I j@vՄ>>%Gr Pl];si0OQK Mg,Fif몄toɳ~fY&R(Qx{ B;1UkZWϚ~Mݡ~q7a _]o ۭD-6L`Q)u7uS:̛p8*&캆u$UmtNO ĤDh6!La[cNmѹ@xU9 ]Pf )-.-R3;4OIKBPƩ[~S|_gf;:n8hiڤ4]/ k5x^IcVUϊ[jL:G,R(A(e,w3F'N0wfeB φʲ: yHf:Ln"Ev|E'=ASQƱ_oQ&wwirIPPzOk4W׷{~ys ewh5ג,I&z9<VSCBj<ڑ#@{\Og 4 u/  Btv{9񔺶p^lӊ9OX3,jN'jKLdz3/}1C:`S dbF1Y{ :j uatWgn4p+ZTRDtxՎfɎ\6M\ kIDAT87t>#rg`QM Fr3 ?l8^u$":I R%KŝxB/&0(ͭDh73kA,'O%(oN-@1T kp ⍠&ˋx8CRz,+m+x e)jπ¢ȲsJֈ-3f vq0>5q.+QH%* HZLsY241Ah=$bB.qFSۿaow|Z 'G&+Syʉ&MtQZ i0"3@ /||trQRj,P21Z>p.vA"Qq X+dL٫6eV몣hWMIF2_gbMwW}heQjN1"$ ()a4a_ OJ>T'`D"ʄF jDt Q.d9V `.*|Ij /΂+9a}8_V6eh֘lC sʂ+ȉGMU^.$Ǖ*<+Ou(*.&MZ`ERbky-Q)~$YɕRtJv"22glPY^1 "yo9tU-lp@ZiUtig&-ĆG=sMLM 'z>P!h<{΄)6j֊B"{d!z>DKhcQBF*īb`#y~UױZpQENJ,#[<<^U)ſe5;JxckFJ4)NK0Mʛ1$+=h2FGu>0O{GC`^[A JyےQEbHlxʟy;xYU)eI \G8kB];^u啻wv]qND2S$WFW\UBcf,PO$Oћq%cz*_=CTUUFI?q'NXcseHٺD*ɬ"*bC:;wE]$ڄP^y] 3PQnqϻ˷j8_0WVeULW0z՚%3X ;^}jF&է0&Cqn2A42 Q$rNTxq݋nv3…ͬYjYy뇕 $l 9(PnM0,I#$3\r<֘iu' 6|'VlY/0v~7}(d"y.>tC_3wh0*gf])XDD'G|ڎ?@ F04|MwMoxnsȏgL-w*;Q.Fˍ7F_Ub>`*!`aTZՌ}"\wޫw雿/~Dǒ%K$Kt o敷EQNIm*XDNh'rLZqʨ۴i6Xmh]_M 5YFsU{hsqdIlt Cr:zzix7pXLD }7z<8~ӓ s8S?6P^ĨB"tTLjc S>uSky;"wݩmy jL9~u0Ѻ)u*QyӜ 9tXrֱ_s[UbJh& {͛o\)\&S10:(O|OtIrPj|Nf89y/?H'k! Q)n}v mKܷ|~ ֆ7j, %C4lfOk{=Jj"Hs,3ͪp7 ؁dT%N,8_k "DfVrSWg['<ۤ‰؈i3cCPjҭz{}7|⃱aA: x?+102L06(4Mh!@hz Z]נ2NG`w_=g9KlB>"E+WzOy?f)v|zh :nd \Y8n\r䂟' w̉eDyʾʷD Ciq~,`>x;c'J ` 3,] qJeL ^r]3Wա`xB7ABA[]IapM5*m0o;ԱNyyfEuFƱT9O/FzWᩍҎ[WkOÂ]F'RQюe;V7vsk?}O+%Ě=3YD\vئ=yƇǫqA 5 TX랟$x®%#(ԮhjmǪuc]_r_ bE3̓%A2B'>wpzœD*@+ª!):3\{[{KlL4Z08cf]ʦŽ~\;DT Q ,&w 'HC@3ů nMA˓uyaS&f 'rBv֥m?mOԩև$.!Wwv7HSf Um;_sWJK "&Y4|5WNl?tlr6Ejf&zj'JG?W e5+ŧr+Mc ߨ.Ш!#aM|KZgJq/QSC)b`<{1uVuysYѱt~q_`Pg7}n,~kN { C]D #UTo͑lms:m 5ʱ0@<n]/ cc[ u)\m m1UOdX&jcnUq=]p@ H]'N~Wek4jOJ CcWGRHk>JVC}>?\Y],d4yVר/%B7O=)\)kH؝Y16LIrY6^V;5]:Y|ۙn{Tf* 6ԣYoa7=)hˌδ+!xzcqd|OςTqM>!2Ho~[;rbvAgȝbuNkw@.|xUw|`kԥ QZ\`5^~ lBT3xjkUյ".0Fb9\Om펪X5sEy[]K2CP>iAO̧kcʠ04Mݮ!3ċ3<I`LM%و`cz\UD JmZ+N`d^C䩣?ߊuQAbڵ2G˱zu{Ҫ0Hbc d$|lW'wrx>tNI/QI6٬S)' ӽ;~2)Ul/Zxw P`u4_>?;x.ɠxi#-MJπ@33VϲEG}G3M-D1э*[82/#t. ˣy#sV:yA$b4zMNϙ9U+}ӻn~_:GQܖn*eSSjgbm# ɝ$63nOMQ0j: 04XbMnE4_BT ģk*^4`CL7 F8Tc4Ʃy}f!s &-D 㦯Ӏ1e*|4Ei"۵r{tv}1{It:m'a%QG,ڳvJìt&~它R  JW) ,z:g}K⟾[eճ޺B@JF'[lȬ۸_u eb1\xGؓQd(x;_\RA@h:=¾%rJCl;aGb kـ: =>M^rjGL,+UuW_~?];575+)bSoBW5bgz:C3D{TB%%^ĐF !tοcx^Qufd[tw+huY4h3ڸjfQ5ld&—[8_=h N?uo!Bp gq~bC{ܣ0F`|ŽӃdW[Fpm–tH"{5J+wɅ䳤~ Vl”>'6KH|^ vYi=6<*"qtzJ6h YC./O_Y|^ռ:2  = r~Mū=-fNt2u=z?'@;кٳQ;n;n "_Ɯ`{pC{nTn ASy<_>11v&w|1afbp9MUv>?)(%qm"f!r9n~3+_[GOSG 8QM,ҥJ3D,uxn_7`]8Y@sM !b HQvtQ{~&H1Ve#SA3F"g#4 V E,j4 HGb [R瞖TsS B9 ,cC "I0㋧=暽 bkU&JWmm*s֞)Ty "G ĩ(^) tBґ<i 0&QO[ m3v{,r&;Q"#`5bmK]p/#[rD{%uQL-6ԯe'y6rM/ߩvڛ5o~(89i%K6b>t᩵@R1Vj98 /POb 0Q"1(sʼbW2ubsx\y(*Re9#~7{ /Rȝ:3 v^_u`wɍd$ZCf+R"AFښ9 :NW4yĞۀv;׺H>pT+CnUv, CV#2X .'vMY"K(Z/NJh4zӬ,?|ꩇz:4L))\?7֯+h(ESpؑUV5I BJ^LOzx8t.C)0d%h$^5J%{nt8ըԬ,ԍUW$ӛ>pUeDiQ4u= O}#w B5pVs2ql z69\AɤlP #u 8\S![ԵR7GYլąXGw}6Nb@3D{'#Qß<|e׽(5oql YpP/T * jbĠt Gedt*Q8O(CA|RC&${4Jx?hWPe)L1LTDe踉bV7tmF.q{}޿կ7uu:fFWg &t%z/_?쮰,=IN!M76v voRSI]s*ӻaJYBGsEc淭X[Z.ȴLEX/բ)YT$T!&lȔcdIeW.yݿvW釩E]hf;[D_=oFuOyTCI`fH<sNsη/Ȝ +($u `0+(PJ[꺭[;<Ї[V?̩B3jl" ,"g~c[ͯrTHtk-xTr5lSKL̜Ua?-2vy ߆Kvrf`zglżD M>.,UC&vLr-Fq3VC(xCFҬ*=yxy3B'EHq c@mӹ(4T%bo~uosYQJwMB]pCQ{u8+noC@B=Rںllq4t:WgX.f(|J5O& KM̩5Wm5?\/}؟a?7yiZOykoj(ę/i,sv/UQpWqR=fHYl63u~9ko*mFw D"Ql\ ]G#C1ksq~^s߶o7:90uy*>-NS]ՄTcc)omS9u1@ydsh8nqJY͟ B+p0q߶wq 'Dˣ9'DJ#k-dfu$Zgt\MH2LJ+='k0J b#Xb;n +  !;Ga?;;/{ p+B. JH|Z[/v28$Pj Fغ^<+Ax|8IΔZ|*٨[?#;$;j?9)x 2Q" ߻7gG/ l@IY P-t^ϱ=voZ'=Vi+ީm 8T/ <{>)N K ߝE;u4 M(]}ѻ߽曆zpu(!%[ǒ *Ibcdo&Pڤ΀giOlJQE %|vW}`)+]t?piD*fIawҢ"t)aJ4Oh:w @Ue}?[ p^i%Uj: 05ѢfThz=ԏ-ό}<32lzT Q Tøjkk6zO?_WOG#U˃di@#r5]+,|/uVѮ0/A$b)/:}`g >6i~  b7GqtW60CBI=ZڹZɁv;pkoW'7͡F1ZVEe.X|">yxnw4ۖGBiNՁJNž5]SG.8$Iv#"HLoIF0W'^My߀qr9j:2Hut{B4£qU?p;zooУZ1uOS}kQ}*s IvQb-r{A",`1jdwS'ҦP8!W/=??w]ϹNDCPõ bi6ģ8B$[[?=S<?M`a-ʚloBr>׃O}-/% J\ *7/c̍]X&Aoٿ mPhwhmyz }w*YM8+$m|ڦ"[>Kbۚ$ڭ1%j*uX Fʙ'﫞_V049@B TsYTE$ypu{n_z…N梖DhqڂLaIL'6i&r#(0y[d5!)҂hWy7`9T䨼7ߔۿGU1wkBkq$sAwsRpz3g]Ѯ?SY?yߛaI6P%!jVjdmǚݤ)کظdrNU!%eȸm6,EBtd~%_'}t^22qdp@\5' ۋ yӵLOKU |ldƠjubvp^?S#Р@,ш(Y|g Zz!TwK'wkM:tkpeNG|0(gp<ӏi_0k2HI֮rJ٧[8X^?]T+Ŭk?]<;ڱ P8WCRXjR|tY~÷"^͆NDW< 1@M]h\nNvpK`=fVwk}6@=RD۶!5ѵL 1X{+o\=:nWԨ5Rvß{ElAb.~P9Ø| 2 EcBi "Pz\vNU7 ő|kG;u}\Rz~|2JTX7\w,Νr,wuXNd@cV˨- J"XG%EW2!תO1: Ɋ8%/Y0zYz 8w9,N͈*ջͦ_f盠v&ɆO0Yr~˟/ -QLsfb&S "qf}| r 8L@MU(65[;흢M'f 3eLxcZdƫ6~qOKzi4QA-RQ֗C8NF]8 !f+j@ Q QAKI-˴곷%\]4^v=M3Zf͚q[L@ DU Z us2QA_e ɿ?{fp.2OjU,qȁчU˯.^uAt-+rq  SbcMYۆyL@  mR;>ub|\~gO3%מ_8zh}n47Sitv`hj^<i49oiVl(+X֧ķxF(J2Ul( 1A*b>3x"ޛ_s]oުSGG xĉN1fsLqS-=9ۤ l*T4FV&Bvȑɀ `aj.6}_;0g3x4mߐDBp&f[}3R A pVN{i?+8̲30nnJid3+ `5²HJP3P(R*1&E1ByZe?g=2_M?gEUfVM6KW. a[`#. s^l`#*i"vW?~yۙ:yki3*F?RWA,#@x [d]/ nY-IմIh%.Xmzău/{j%*ֆFTQL#,WYWE 9Dc!4Avj2̤rnkCNKfQ r1ebyj^t;F~0;w.*N14޼ߝGSP*lȭ,._rՃ&K8*QF&E ALgE.~ Y@74 K1c;|h9Zzo1׺#n.oN9ʇ*G.Gõl^fe5_ DFc>$ijjݡ:/x .C̜Uʍօ>݂>CXrU,-}œy$?F:E^RN2)X?6|T Z-W:#64AMz٥W햅n\x|'<2ԨCLVo,55ȩ Df*҉8 h TĜ*L[bp3~p  hP꼳\T{fy޻LZ4FSF55-`+dY09'Q5:A_&-.ZȠvy{w9{˃9ǃB U]VMat! +?KxqW EԪh[-vIǤwYޝ;R &DM4pP*lY/ ?[,Os0^y*j>ڨ:} a۹DUԝ1[ RIP֍ QNȨ7CW|Oe5YDf2XXf,P,+rwo}ҭGЩ $+!Q 6be8)91EB8|f^m2S˄M,Bn4fڍht)mbg{~eE|%&-aޥ`_]p7?|bI 's T&( $ Y` !2A56Et PuSqu"Cvds\ҷOq%hKHkT"uMx1zwƽ٩,helw|ۤ؏c Ύf_^,Ӓ"VRH _~xa99 l.{4}B?!+)}=}`𑾋XW+tf0%)2xU ޶mpzdE7_)}pķm:ΰA赼7 .g=e︹[*z0D!f2vN !VzBќ%ZWOys5OϏHgihjJ^.lɎ 办$Afy (i9k3V/|'*T/hN]3?^ d-13WgH *keÜ%i/1ßRQA| 4X<EM;+7i;w˞COfe!zt{c,:v̲k 1YI ڨuX! "8ԸZIT}޹;>u̅eGl>K5wE1t)z~`W8#LGͣPz 2|z\"#ME]l:HN_AU `E\~X2g/3FMD 2Q44Pu{3p*O95]cM.g(hFDe0)q+7o{P8屝#6* L))9[vI`Hmvg$ D3. `i{닟^:1~-vlV`ni.Lajs[NdXyST<7w{g.E,7ʠȡ9֏/L,5`Y,%ȳ-|/MGlh`~{CD$TQ p05SJtЍXva'ũ'ⱯUgJ2* 1u>A/v\7w`RIId'(D;j#DoS>W@C.5s9c* +ecBZ$u(iV\aID.P&4+*Gu]OS'D "H3BvW|ug XK FY- f6m:sOǮg-[oy((3JlTpΚүU1ӓV[q]ll`+2Jo=\pC?֗g}3gBQHLhit~h7>| mg`jdl(i+>Q=ǻ1znYjl.42MД Ju F]瓫l\"bRO*4yPQs"ǢOX|S *u$L)@!j&_P+},0[}bųXPaQR7RR"bi^0]\oˮU&j ^lz)6``~du|Ss:ڐg߆^'G&*5U' %R M!3/~?7.J]]^fn5f.{s@$m fy;¡'.:(t0ifۈ8&jEd(AXFq0%!/hH }0.:c 2*ij*U &=< 7u*RPe 5jfܻܦnIAm*ژO멩D" f#3A.íjykBεL{:<9;[/{>I /T0*3ZovRLty$ohVji $DTb# /C>,.nAa1榹H$Acr(3Bgmo:~zpaYSJNjP3s9?/['@L߸ZҌh`KN5-t~=}?9]:^͒dS^4ϧ 7̍|, j({o}Q\Ub/:-5  x懣'mF J#J6@ZZ_r{ . ;E6v1[]WD ih?۬FR_0}.`@J8? Zds(*bƉem!hև SVwa6Wʫow7k,9JPʯk.Gp ʜLfu f`i2+z6m8;&fTd/=uz9:u\b3Ā0c$yhМF͸o;[sAjL D ΂n5>oڷwL)5[ &H3_ xfS6+s\0rs߾y_j`VYF:N`cdWgjȨ.hV߱hv//-|ܬں+xʓjH-+V&5\UŪ",Ȫl]vmoxŧA$IsQNT373w999Dj|}m:lKYO)BfI/zŨ$I09E ;uc03,XaNZׇYy)7Ծܵ7 |]?ZG!zUōWg;,Uh'.F31sfB큮m?B11z/=6?[=vUȍnVh4ԫi<܂_}膋z2+y'hfFn΂bfd=LL6u|PKud"T 0Fբm"2Br֑?~~*2D3C#)rS}e@@F ,e،ߵ=X;x׬ng6sœwF躰$`I$0A^}Vuz҃ouM7_rB7 S, JgF8Lz½#^}>?;2 G SA2!jYL: 0n4ۤp t5,׭WyF\stvF> ۛt[%bmsgJkcF5Jw#qsA <˅/}u g"-'ALl #s%ǘ{Dѕg_7]|$0m@gG3u|γj3ha0qkPfªێ|Kob}eh~Y%+$}Z fࢳGU>V级zç釲m=R y'΂-$H A/d-ox]xJo>Zm#.i.r0 ogkQ5sgA#ԜlbbyҖ=uK^9(u^HYE(뉟׃w%g̢BMͥ-fkܶXuT.3[UTy]ǶU!s@rB\dh0tDPƖ ST}P~>XRϺAeP:f=&f$2a Eq~^?s9+6d03P`>FMϛ7VX_첄vL^c%bj@oUq~H5#=ϯ~Ϝ,4JT` φ^&eB6$b^#b(̈td G,FUQz"͌b"QOjV<{nmo)/t7WQrnU$8*FWt(t=tYlv&ns1*oƍcÿDwVVo(C;M {P"l@*z.[n AۃXh'|'1d'_ӏ;[Y'`He:K! DaPbPaϢty!1`xb茶onbMJBl  }(`Xnĺ+ᫌȋOTtWfhe^FJA9p)koϨC,0{_ ~MS{s4DQ|\YWm U4=( 1F5ZH$]pnYv+IS$A@/ATJ$~2M>tNuaΎYcg `<6?mϫciL HĨLRd5,Gl{( Zbp#kP6ќ{-(I*>-ӡKS*48*$)HĿ_֘u<`&.Ƨ\5\\4'D ][Gl{F`aþmY>('֏~+ŧGO.siSyQAiZ$3/Kl/-{n{-,v0>C%󩳘H%C$[IrpK41a+-.*Q9k*HFpnEgaknFEU3_|ѧ^qTou ].L &=Ӵ˚&Iv ĐZ(Fy}-^~|e*XYa{3hyJ`~l|^yӻb4FRH"4SZjg GE,np2e+ I2AcD#,57Qxc,tE:KoPZ^d*#MLM} aUt֥ Z"I*_n|\2+BԌBz(<}W|Ά]|ҮH(I ,*̙fq[(V_{oxܣ.%Bgt$<fr;L}gCW_*JKF)ggK,+62Trӹ?14sJ5'uC!F1Ҭ?4q؋˥X0бҙ{[Qb.DgBc+aM}~?iTXӐB$WtlaW-r{Cdu";O@qhϥR8 !;tKۿ=͙dgsSo;d.6( iY8N,TJ-LakV֟M Iq=nQ-P\ey4&&p 5B)>JK'G'~8j.哎z2(zgc︠c'0t+"bBB)o4+ߺ/\cIn 23DKwX |ï\yEef%)CǰǞ|d[s̒rqC? M?h.A(]A.G6l[ s!TJR df~xTJ $ťW][ƛ{f$3+)]YVdaEumO4ډrS8hp&Mab4BˍYLG ;ǟ;N>[(- hHU0H ts88ʹWaP:3 F5jD2hEeӿz, >]{5ֻ D4` sAެS#-}[Qg(NˌIɑfPzceAWP.=g_\ve1NuʘY f: e+cIFarL5g?݌t Ħ"Ajwkt "̀l6ln3J՜G6?_鏏.(9%FZM*heD觽+.Ԅ>::7߽ 6ő*JqBeo#Y )5Ӹh3wrRIh9NV~oxh>FR$F@Y䙋?S_:𲌲 l5nu.ff[BW8/yU׼=;zǂ7!5P^sن'7c5ՁkCԂH1 o4jj@@.S~3.u [V2)#-E8/^vc,!/[|d3IPڛ_ַ̽y]4Fo,a9m5PvVM4眣ɹS}kp ܝ+:5 mȪMWŞǖ{uca :JAs(!wy-`FQffs_pѫ.Hj1J=-;3?Xk"ۄt%Ryx2Fh&"r)7#=6p8b.ΏSRYO`4[Y_yێ|c{8-$*r(R&6`ZZg}[w3=.YRܘ=o3rc6Ny6ڪV6=h( 5ڰЍA,1Oϗ~ }JO*$2K",`氌3|#]ݶn7WGBQomd`(, {ne£BD)3KNQ%Wey$%5M=k)?Vr~0nn/[;8v}Gv؄IXnA-mo?zh;F= 2CPUkPJ \ND%L ˴$dG,\$p;ÉL+3 wmcsAL\rs߬>·ndJ_E/ѹYFŦb HH'F3J g 3m}j8)Sos4P8j^Y{ַK.)::tֈ'U==:ȍϘY'mm}M&RkRŗ#*4:ssm}ocƠ4cIQlgT0mQD ۼ)sssٛ//9' 656AAM@kȟ}zyMZ*(izΉElС+=1:"ALL,8uF q1踭_yFm:z@R`HШ`NM1xϹ?㛵fXk[!B*V$;yf?+-lz>]GO}i{O[ғ͉}C$t蝙!Df,;}OۮN7'ٞ2.T.WD*!ՙGf3)MJH-o&p34NbBep­tzKuEDaf&d85Bg;ϻ_󘒙5;tpZ 30e!4%"޴5ߓapHODiQ?j5L|1&waRV+l*C y=":^ԭ<.y^Je'*W\/\z%8MHj/cVyDܞ񓶋~[z56 DHwaɒԭ۞aeTdKU߼3~smF~)d@,HLenjwxI65<<{|c03fbtͤz"Km9 @et)I!˸tp5{mڕ^o輋&&dz53 y;ڹNxEh3Au $ER1rJq׼ ()0,홓wY-[_r-X!uH@F } UAc( 5HiT~5h r @L2AQA"3\#0ZT 6F1l;7̹ ¥?s_{븵V<>U*`i:Z|Z73qd0E3m]NM{|-0$ڙ,6ب6Gؠ.lcDzʗoD۫0Ȗp jbJUAt>\_}w_ɲ AitYwoT:! D T`f M6!0bP%4[winG| ޠy^+FY]$KJb=Zv{`b<+*~v?ѩ$tFsb(>]s]Y؀&ZӊS|2=9W]qM#TK)6@uq:;]p4lݏJs9݅@SihA tMS{ObE]Zt"<@55n93}!#HZDʍM~Ĵ6p ¶ET C~ Ew|9:3$4W5yff:֮w{s~amfy\5^g߶3?#3r:&5=bk55EbcPOw޹|3MFg@HMJ`"*4$%  \Œb)MS!i %q~R9oK)|n  5sFH &%N͑B!b[K{Gy7/֤r"0<)iRT֧z:ʙ=/Ƌ9l†1hoH+1y`X(ۥ @-G}̞ cTubE3Qz3?BaCLJR(D0,Sq{npmQ組`tb `hŽOo_;_˛=`1:\ewÙrށֽ {þ1kp ~f?#IYH;&!i)RTYMv, u}$2 6 U#$֖-/Wm6P f]d-:,:+b}_X5_CKKYRV 13S" t&Mn&~~w߈QrESeBgHGCEhIDpnc}+ޜ?g)ݴZB*iQ:c6nrCIje0< Lc2TAhz /T,WE4TЗۺyZ}*='m!jKSH47lRII3U y'Dh&CqfVt:[_?.;w-dV$OVhF* J`,"[sR?65ƢcKÔ:L bfEPH "5 l 9Rmoxo_.R!uL40MJBE;2ԡwk^K?}ߨG Tv,JDIUOqW?Vx$.JzPQF1L^Kb;қ,揾*?r-n{*J*{ &!b&`7v;OlwG`,I(Ts]j* EF x3$: 1h*AE`Γq/^~vnfP%5A] 64 `T! q<]"ׇTc0#2'._O\}zmqċ󀂕 w,@"R0vHݼpignu}k3Q`DLݒ?i\;CYGeKgo̩(%d١ ~VS3^NhѼyn߹ {{ݛi zxs?rPϘ|9}ޱRjc@h+v&~w~':} *8>LEMo d.|Y弊ӺHh$S'I&(+C^ԓ}2}w9zQ 6%Y,ZSRM `-&U9nRsspg?t?tɫ#q%  Wn{9Όv~l&'LICp:7DF*&QF;?Z?/~ noCUg#2ɌP?[ r׮Ե^PJՑ4MUhiHNd ӆh@tѹw`_//uNW^#$^o&/v}.eEMu{|מ9ڳoI̻(yxGD5m7ͺljfƟ3}riɬIlФiޭ]D0 kj^g7VNuZ9\^"7̩d`'!R[LZ(DTĄ J1X'}ֹe} Dr 3g߻g펿y_7V7S(\gx~+0mg: Y&Cj%n[}W:]әbjotuG5mGeaɄ׿<6m~К\_f c ZѫwzOhCUb(z껉ću, չ0 -Mo M{ތP% nl1f:_ޣO1`ToQXDt~<"_eߥ!3p7qϴ(ѫdj4Uu&s:^qi7);!cjN& (rӹGaIDATa?Ze4hM~11" Ѣ"ʼ]9mWK:Ќ`3gXęKUULт#EL4Eb~>ޢSVw](OG$.Fh:rhvXAxcȲY[.-o;})oC&iy'^msZmπbfgN@:~YbL}`T}lEQ$7?ջÁ$@5hR܂zsKlҥ'˵N棯b6pysj.rrL$8g s~^A:fsc|/{z)b\ uua~A ԯ$pxu,HdG@ *ٝc 6ۄ ϳ_O蔘s]T-+sTŹ=w5|<ÀZT3Dx%S'| ˹ V'Ȏ *OR`DlJu%|̺9ՂY$!Fs 2UܹԙnUDe)#1p u [7nxu7סNvq$P#ؠf1:V3@w }jк4v&MXNj2npf9pp~?\zi$u~߹c{k{P})H)SOVk1Mh{Lf4=jYGER"]   P*^_̏/̗UYc×w=w㌑%s5N-SMN-m{}Km$鐋7*[6H]Y2I0X떖dq2#ڂ`?~ŗce beMM]$I6eվރ?oV-HPsJFhRJ|/_Ǯ$q~U2{R+U)Wͫe6[_*W.}Po" (5 S 4>gȽ޾閕maKA)HPZBb%ĕ`N[2'9 uي@PXp,mqۗO~ro@ sQG7K.(Iۆz/?:|iSZ5qyyl0Œ挝:ԪN}Mh*LQP .,'xho V@Wλ#W]{82gz%(B4-yJX/pTV%,.%vڥUZ hppq>^/^!- =oJI#v~V>:E;SY,0Jx RxTI٤z mCh2@A&$;ㅋ_r?_nz"EkV̍Vx3Ue1 4DTҝÝ|t==p=LUd5&~m&FD`ɩ'@4F`-,U(pAjD4Lj!fN.Agn峟s;"P4WV No mk 4Fe,\ʇ_kC+D"D b_.L19]֞ E|(s$Gu 4YFi2vI0Dve[@9W7?Xe|Q뙵m/ !̫TH2 E_xS?t=\/=h3 a`4<ɥk(e$(;]{=/h!"ˁ!k6- Һ=r?}BʘM>FeKW-e0 h4+|۲B}nG]wH3Ki" Wұ%>$߼lF }!'ښ& PVV(6ȠB- ]8'68"9PALE)% Ad:psc|g- &;j4ѡ̩GYbٖoE*XcIndLfe2dcӫ{׿\ɥ2A,rlVJ* \փl:2t}aKQkʃ?wDr/3Vt6Rghn P ,vR %j[Ό梁}dExeOc7oy~}wX}x"呌m1 G!.osm7~cGvw61f( # %EQ!^9敠T..gՒrR&fu ?yn3tA(5i@: \юF YC~][K!K&ֿ2:66/U^gfpV@5O?u<ˆ"ZbEz Vl+''OWe,hJ9` 5bY"B􎶏=:~,2CfbeԘ;sGŌQ]!hrkrDA1#Pтҙ ^8XCȽ󷿃GC b!D%jYo,UTEG-;mn)|^GyVhD$R+텥#7u voΒ¹*|fr 8luzoGsHnh0_ 6 15a{*t_=2MBEU P\-E~pv5Cv[hwcm0lYS44ZEJ׽O۝) $ ݶ?2fd $S/~<=Ͽ_4S VqZ1f/74G[!;\BKF@磻L푌#Zklՠv^L:{BNX~q op˟}1>_q_Qhw)l)P)TBT?o{?z_h h93K[HT2u*6a珴1O4rDSs8?vDSN镀Dap9ZgЧEpeĽ4՝p!2u o}p[ϷzKh̢Op-{z:|sVr:?M@pIO$0 A *v;-g.xؤmnf9XKE`TQݗ}8t67E"5%$`JZkSu >[v.iw( vQ()rYF~1IB]?A֙M dna+LF&L\;/O\=t=QŒO*{Ԏ M8*7% kW)eGSV[އqsPiHla.:EY>E'Ӕ̕:pitSE3op@*X K>fg4'b!5\BvPpob>h_>%()g$jA D_mL[i8іV}ҷZ6|\m(DʧRJ@=Z, M)L>T\J"+"4 ~\`lw~FvmAL4 HE${x^=sxmn E"^0Q"- @)H2:li:$%&9Rw6]F_ܸO\q٤xS7PgvD߳rt`E &ń XbE=ӵlc{s f 5cZlO=O͊-[17%A*FxHs *;=HC;ND1NS@D,KT@h+rldK.v4f!RIȒJbH쒍uGWp@S KW@QSUnOefP$nx_J~Ihw;/{>*U \bB($2 S\jD@bS=f5*Np8`faz?\`̽=7Ϋ^PQAAD R͙yͲ(v~G8y:yюs`&pd20´L;IHW\ġ͖]G"ْF< 5m.A[4XzogN}gSV<|BMP1i6__ⷾڸ}4!U:. Q4J-T(=δwꝺpB3 B .aiaa4gm 1p&n',v`gf&QePTL() r4 @')1SR 1_sO8hUWB5c(`K[Z5j.6ct\ރ~]/dzӛ-=>5mjڥ P/0LpMZv5ʐ*F@U  -QCmek} ~?VoB;'. ^{@Xː%.ԽwG3T! E$qgP0TJpP4q-G% ¢vkiIzt*I Ntd0UcR'l 6V 1SWz#4UΙíSfe.Gfpe70ML ة@"]miYlD/:-*o5>:_-yjiw?!,?#e~˥qmj/4pBhȒTg&fPUL-ߢ?so{s(Ts(0al0E'U@4iE 3{=fM*tܰbkGƘV %c~Vi|.|>]|Vs@;;k/E*.+\D(ܧ?}/eakrJFCVHMX G3?-,6qLBVmD+GV#8M %aő'. d!dX#3tJ kb@`*HZę#zΒ2-(Z M(crȦ{KCČgShiSqCLvʖe߰4D ų[_~b+_W]Xf"-1E+sh]kkḳu b,*&DFRummle3@bZo˥JL+F2q䮲D#y }6"x9F *EE ( \>W>X>oLZIH$Z}vQjV[G ĥ2jXeS lzc@}խs/;[mXS#,i ;B{v6@Wyv7m|AE|3 .$1q(iݞ:@2Xw}k|N;:,;`ح I_r()8ef`~JA,/gGL5F6-5մ q-E (\S:ru9kW\ASӴJ&72AK&G=Ǻ z[Z4%"7Ҝ9 ):rAb]W>k(I5)&'O^,W*EUؑz <m]]liNaPQh@ bbPUfY+x\#^ ϐF)w^ף56TΟV>WtLRM V.qALaeS/ђBmħϿpC-5$q$;aBzqQ;r~36Zy]q@sP˜8\G"ׁ/ 6qlbC4gv;?_ǗWbMs bAp@P3 l}DxJ{!JMTLi&$p p툷؃w Sc<̍]̰yfs+>cpd<f0u{ (^c4qdt=_8R:IN}DPb @C4dܜ+Q̜E4 ݠTnT9&~NW5O".@ egG]yAva.!8jP@h^z}?{ċYlaKHRʲVJ7x³镩F5 &À5(EV:uC n?y+#4870`,FIBըHUƮ`@e¥|W/}Olt/1FfiS6. ɄDme~a[+SXhTix]'#fBEm?#o6͵w?.kHf[|⑾k`R&o[=8Q# T MTwsH1kW{ p0âC![W??\.;E 4$% O$\UΉu<ސyʪ(22"jɪԠV4q19)xweх(j%uf t8&-GӢAiѕ$WEP?ȁiqA[AFa¯' V~qB}Z T[t;N7ݾ-W}qdhS5؝j.T 9R@ bNՖcofhf,~2DW6H3lZnPzZh5(yWq}}Q,&bwկ~TXQC2F\2JlKsx{%\9kzҠk5n&^DgYh0G}Ke2(=58ȭX,680Wt}#_ϐ6`;:P,:8 dfh=t{+߻o͎V%jY jBW|e5F^wklw‚t;^1 š.NҼOk4-cLlڇ?^_޶2x4k R:G>};K i-@Dq>p%y:+{$;J@\" 3SH*F|kowUC;"*̂ceLm谳;N 4B]I*h%aFHb-hCv8!S)ʏ6 ꬄ{jkhZ/Z@S(MI.n]]^^n_~ΓZWʀ &y˝O?m/ 2Z&>OL܋f+5?UT5D"vt5+lf;xg~K?}mǢ[:52ڡvi%(s%ϜݽҁbS8`>D+q ac fupn2*dq~Id(-al}RVftq_o>1S2Ku-! P*ȝsќ*M#%ܥZ5dW5g)feb1 ݺ?{;a6F`I4ffjeO?*ěS`*hy!d']RIL3 ف;p;$QEQmdއߡ& toy2E$\iEDm>q>|n C`B*Y% %i:E} 0s' ԧShiӚQ5o [0oOT謿_!ݾ;~7/W [ B©0z5S-7)=?CNђu_ЗRRH^!IBa9|6|'ba 9,aє~.[dj.щIBP6(W.GY 0fw_G^%Q_ ؏R#_z.4q6 'V3O)`kE0 ?N@(Ado|w+jmp4T QH:u]lzxvLE54*I4 XxS9A츃]`LPzɂdHPiiݴ6j+tXV+F{ WF;?[dPcbD:d،9M:HLR[fmxuo;} s:BdO6 c<F0UiT!$50T͠Wl#{i/޹.#p#2SlUA mKGN-e PRQ=2"HZiϳ݅8$7kf- QnUО'vʾDgMnOV$z uc١EQ%0yZ%oz Hxeg@ϨfYyvV1W&,w,AcЫ9GasWpS_wK/ ǃ?(%c1#:II<'~??S}GWaŅhΑ1<#RSP5ĢHkeu2>Uxo.?#X[#~l?ȁl|Nċ6-c/ޙ9{\lv^qOrhLCK-0HPAt5^D `b70w{{;i7S/}#\dZau\G4Png0ԫI1p5)k+A.x֜5/)辴fԘ;Q1?_~kg UZ$M; dڇw%HѶ+y]9qxۧVxSkCLtj b9A2W<ʑo_2ډ&ɐvf3RDCG'0J޹<ߊgY;ebX֘rhs@p$n6?̛匝G׭ރ[ap}d ,l@8v<"D ν;fiJX4vn\^Ol|nDL׬$'QfmwٔcT!8!AF@ԜE(=.dy5[;Q M_<[o=`p:Qg/|x1(xsJzk;~?yܫά*2né.;`@GYlxȬDE6H:*s6U{>o[ Vt)+TF%[.ƶ?r?ɻgzEy+lSS&eg76HT`ڭەn 3h_c3<`s${ܛ}-^mJ?"lC4-}Fg>30Njf2,;q\)iuSR)pR\,Hg>/1AۂW(]D'ʢ?l 3h @]A* JU5~.0d(SQ& W.9;}zHYYw_ܓ72/)d*\8{9˓H19GtDQN![;7}|XpQ\Youˆdm;6亍+~18aU7`T"@dJ? nv4zC?xbR\n+PΔF3iWr>#yrσg' gbGip\,yE-:"^Gzzq%K(tȉM;'؀$O_ȇn#Ӓzq'ZntN߽)'Jf ;J1 &.b6GpWTT"WKauK[k$cKen\d;OGWc(^A7U#F (]vuR8UI^0xZ*iѻv '̏tzeWDim0Dj `|{}ߕ]|[bJ$ ֝b 'jvX ϊ̓]ub9i5i VlniEӑ*M0:kZBBW ˛b_y/jbi+3  EL+2䞱+߿Sn^Aމې "^s*ZFVQщ^GJXWb=2fRFPS:z95r\_\U{Ƿ7g*"g.w߷[9`M%͇ d5j`aMNR [;>:v|K_k :+`PPLe^'|v{ְh@Mכdh40F8b쭍-PHhEU a#N$9\;j?6óG ;'51HJ@h>eÏkUr@"irCv6%MrRyu/[-'E!}`ͼh}RwB~J)phZ}=3W^7W=dN.WZS:rr-+}tO-U)i"HIԦ. UrL] |O Wߡ|u_qc0fRB{޶m3Jj{4&&ܺ ׆S5j/UҴ :̜2`XRA"xh'ܷWSzbU H*Z΢k)9p܉p`e7 7d1YU3,UXo#0Ϣ2Bg¹@h^!#qcҢ9Xίz„YTu6w6uߧ) @EБ#^d֎mJÕ!$mokЅc cf^h KS+/SP^i JTGb#w~gf1,fElC2 I08wc}pe-,oD0gT\@WHVPĢ\)dli^zmxgpA4ԒaJ~;`ҁ7̬\2.tV=G~SW#+@N|Mho@)2LwLq6T0!cR_Y}٪ӪƕCL_d]1jJylą/|Ͻ|S؏L$ (aLa9E=H[:w} |h- i`4 : LT -AP:cM1@2ڈpUFU l=֠.|2H (UD8 jծ?7 h8L3^M{2ŏȏ*[oy–V:>"y1IXIh6u(N~^T&=&R DY䪋+ۃ~矸ڑւː[ <)I$[ }?#>/S7ZޑPDj2j~0t򘌁i2%ד^= 3((1])Vۛ ,#l花^TSu$P<yt#>g<ýT+&;o@:2?"GmcưӦHF$RF 76gB)Y_r9$\Qf޾tv-,u485gpK3>Fcn3|(9K@}"ie\utc 1XFmݘnEC|2lZ޴8L1iiIU3_ɂw %]97J/q->\ 5& $kEi0G+Zq`FFSB?k_:۟ڈMz>PKyHuز{cq}Ӌ]\tPDцk4x+WzpQ^L&Iы˜HN@BbH5k;_XMUQHƐ8on$G7R I* ȸp<;q׆P`Š&M4 dۡC I͈0_o7D0 H%#)j0zYǑ6Rhf,@UELJ@׹KؑH,IQO$CpӔ8eKYIdĒiqO7͘Apx_>Lr޲V 4"AHnZ!2O7߽?\PD2BR:ܛ2QMFfnTsFO)!= :867no _xУ]{?zҜӶy{~Redd~ |@T1%LHF+a92kG/ G{YnxjR,hSVwQPm#>Ao0$&:rW\:!4c<0MØ&+դQD,^gy`f%foK#ْ(-R@S)\Y[3Q K%]T)fZ2FPC2 ,[ZFxܞǵ:QJ #b#}{}y 3 X&Ï=cmżXl G L@SN+i{^4H&*C]U !}xcOuM{CӟexJlӭ32t8|e._=qS C.bTKCD첽4:>TL38%@ CU7#]ˤY7f()F5 T}ʾ(FD͓3Ŧ<~NniUBEdAoXGNʄO}ԱŕVTa27 &7> &k~tm+PXεB+¿gխc`Y{ ԒTufG~=Ͼb#`>7[I ',M4ϭ!2{ݖﵰԕˉPX׹  !Nb&1Vdф[c]quqK4rK`SnW6L ,n\ec{nHiBwSwQ}sb4)Uk2 _\XUA\,-2#^HӍK/ճ  0W Ab-dV1JG kw9d9aGpnOWX(uUSj|zT6Y]rW94.b Soq')V^؂ QTUF@f=Љ32dBxB]nM4I ` fz :2ʕ6yq@~UczG33KWg10(^fH!]ʀ$'v$l>пsOv[jwM6 x%o.^2f 5TSQwN9|y~; # "؜kR qց#[` fPBe:vJo42hnzB2bk_ /ynfYh gZqDHY Ӕ`NDM5GMc 3+`r^ g z"FEr6ݑz>wҦem)nZRLHICg4IC{oX=!1Ar- O\l8pUc0-8lqfD}{@U14'DC\]8wW~7xLC Ma)kSY/oi2J}bC S>Xe=,%pRSl/og۟X]G>v.W5JbDOyfQ3fHC,:ahI; jDE cE#L1sbB;mbݩ6[E'ԭ% b9 r淞dLYR}%gG)A1 9C` '|0"JC$ѤvzU%ьh$s/7Ntz{OeM}20PǴj#Qwn1Z&uq@iZp}۝rh|}"}ޭ&LDu[{%Wq2 X!vLihZ}ĪL@ipԛ"V^ok[zUO+38%mHވ62`6,ȁ! p_ Л fAuqe#׷_7kG9ay1 R$:YfۯeкYJaAc?t_:!H#8z'6 R8} /z$gF8KKN~_X=9gb ։ oU_`"SzsaXw_S_n+ I^eP UtWE=8 h Xf85k^{ GDˈ(n ( YǠV/ƪ9_J2Iq%ifuH8.ւruP(C">hbAa-'6_;q*$ 5e6Hm<55,yhj 4J疬%)v bŋ&>ЛmM wz:H@42%kEU#@U#80 bpek ۢ,y*ɗo;0/>i(E3:QV2eÎ/ RvIr9~# F(+nj}sg d a7͇}1DyyXd8qW0)s`@T 0O+ S'*Tbō/~GC|sBE@r[חa|yxEeYnB42d6_;o[\D4heEÉip ԤRK.7TwVDQӹry7RE0E& "e-|WG?6׎+N;L)1@jLL',#$Bti :)4._9tu8]b jUю#?CmJe~UᚌXn"*Τ}{:5IB͠m@MxLQݺDS_LkҦӏ7>Y0LOw|g'q@mؿ@H\ئCjʐ懶,m'Je$hXk&0~G V@Tj¶m'=#_aG7UOXwT UJ&oUdXZ =yrkP.RDafy﯊.zW7dyєtyDA KVqw~_m_ٺo"7*yZ:63kyK2FFRm`sՋ#7J2L5 TgN;ja F 0@08=Wh)v?LR/wb 9Uv΁=4i#mxq 2@hiXua0¼BvDOm8""H\sgv-8|xac6 S9cH0I\}me埿WV'5HI-U-Q Wfof[.kZDTZWPqLڥɤv#NN;X0A99!KsfA'a+xn~VJ2bP+ ,m:ף3} M|*hJmrŬAoZ1UY$so8ڝߖL!M?hN $ja5%2%΂!yE歸OʓW?D.\}CK" QYeyI]SOhJ>e#7s$() p>?). f)f72/ML]>/Kw9$9Ĩβ5I:7"ME8~byh^(pD%z?N[JaJf2"w:&Eۺ -v?@ֲŒL<DZt7/c)Әs*tb@Eo:Ͽx~;z{B+W*-kzU Fj%LZԼ]хų=maaѬgܡUBoͬ-%6r%b?ҳ 82Tܨ7ZWMB0VwRJ2=PR!K\jP$B[ Z!R^eTf9,wW(8ƹ+O>WD҆q5fc;?6`gx.dH R:R1PJU ^1qHS,[+OK$2D;?MѧvH_11(؍ű_է_Z҉PED4Feֻx1{=aN3>v~iƉf!Zhl ߍ(LEd];4Z5S8D=&fDD'%V w8C)_<؊Q\+ZDs.:S9lO9M}K)>jW 2Vƕomv ڋRt:XQsC^~n'}j`#xoڥ.N}FiJ4T~XD}afRw$TD*D IH#CK[V}31tUx:/BZ¸b0 MK 9>jk uP~+yq Ef"`0!|ZlP-igwx<%gfPC &8& SlW=Rn3&@N4TfÙC0)qV~3)zkwJskPifjPڇmǪ4rOZ^QKag7bU`@hjNXm>qXJ fu͍uo[vqU^QdCs0a2NtF|uIvlWpA$|zh-\Ht43W6|UZ*wiM3r&L m)9in VRO$LkˤO& VLmħRͩbc0 [:Jr$1-//=ηYs#=|S$R@EK;̐gghtÖbZY8~$XUUlkn*3d 8z94g;y%w*K@͆[44'"_$&ͨ5=N.)4;?)EO͗S dv(D.kB2HQRdPd6osuȌi% b@Z7%%0ۯ\w1%l^roKJlկaԌɣjF-RpmBaB p McaZ@F1Uu~kζNV}(nMTf%Fɟn^\Y YX[p x,4V a`_ӫ+G!R86kE隑g$ Uc ݮ2~}54AV3 h5>7@XV"4#h1:ᛱ1\x&HÂz.Sl" fFR܂D&vk`4,yŀ0ަ(;~$8C,帨Xꆦ: qs-B)m89%[ޓ\+x:b5d$. Rx Zf}B3; kQ@r.!)@Ԅ+diȻD / iwN<BR4?DwzNZ]w()M|;"9EۛTdSƂsڑ2L"5Qd[Hߚ[di+@J_oicy!-(YAkjmCS:oo&]|esl4uIZxG@%z(&ツkg9JZVVzxXY3vok{Me5Aeuhg_7,vZQM+ tf'K7.f<Nr33- :y(pb\*oܘ!0$#咆08!.) Up\6qPtڑVTLSjega.z75OFEڭ7)WIo²'8S F_^y桛VQÖv;c<;{i(k>>BSp|fO7 ).x  0g$o*8 Z1~IE6UٲIOP5P ̆)JS2PW-1/uZrLo7t(J$c0X<"#29@lo"ϤӰDa&jX}`R 2xq8e .\oΌԨj~߆J^R;Ֆ #`ނE^"Q;P 1r}_o7Dk%FY=kkF9銢f @ zٱVW4mSޓ0KUoeUZn;v\b`$e[l 0#i "+i:p礕]1dh+ɵQ'(l Z&fǴbm;/4*OISnXwfrm< l{+}[eZ !8hjpyeؤFԎ_jjlYQIђE'Ɣ/hh:}T:,]Uɴ n4hGb f& %nu^KM-0梁oq9vjUJ# RpLn{` fWhkn jrRzS1aƷ*4zy&g9cx34T*AfKٰ5nkڋsݹ_ūda*QbyizIHpNUҘ]*1VMs`6W}s(0X⑵)bu| A' GBwķ )J@4jVPenKxg#TTySGpS7?v\O.@(iΖ`P6p1xJj>Zu&1VkCuhm8ϋM1>x1tP\߁7O-ĸxHKJuSz6x&畬' MBڎ*CM }hi<XKbؒD%4 A-:Jp_[tyASRr 3t R_aˢ"cExZ1*<Ѩ;LP&[>s_93?ާKz:vĉ|LvDEZ*@Cu16[9\G0j ݇)c0c3 0L4SMҤe;Ѱkbg듎`txj-6K=ƶItQ(︝N䀎VϚ-ŋU0Pnm"Ө[7B,F7)jAag𴝚/L [f"9heO9Lh(I-PQ!V໱M17C5ؓe~㔺[mT6 `0R0} SN8dz㚽*tYhj+OT %ido;v`z7#mWťZV&g\jD fhs lZf*z¿1EQF&KI[8y:\tioN]`So gGn˥ea'ڴ}~.7 ?zV+]كJ-jp^G a?~BZ Hә %':UTf0bpc&HaK0҃&}pzp_\ZDڀ.5䱄9/m;T@f{CRFO r˭" !5v-!lT~r A+N-[˞3YJ^ U &c|*%z%`;s@x#'ܤoTF ϴyfv җM g@/i*SNQ`;2/9I6!5hn}#lz%%Xl}н}okR۟X+ot}' 9^=JرC,Do}fz h.W_+3Cf&o&*^JVlQN˞PMfymT3*4+O{4CĦ/*ymf:?59 zlQcɭanoG'Pz@1.4X)M*fO^YZ譐V_C8G)qzN73\Eh{g5{Fw/pee*m5FC1b%S~UkF**%tU`.F볻pCًoY~UoL7Q* L4 ͹wv|tsF*-ҚywxÔ;F -XAO:U7aONE eWW Bu˭FX/s>{ۊ"-%S\k?*4s P q@'~ޥ޷|ܤ1~ȭgZeTLu!.-'^u} `nPmpbA,lb,0`f`fth)e.)Lhgk8;NJa@ȂYC߻zWt( &mҾG:%M%v#cM2YӘy0P(Tc߻qZ"x'߈aM;y+J̜Zh9"8+Nm\P3gfM@5bAb}zBY,$#sH#k\;FfVG+V*Oup?RB!$d>UD=8m`K)*p\ɘx/}މF@F^g v#eOrXFLvϝu[bY!c\)El/м_ʛ\bteU3jg/H/F @*ab .yh  DID}y;IQiEX`}{;ZhFXZ. 2n>Cw8GA`&1WMIY1)W4H`ЩzKkư[/m/j aJ5v5}9{XJ9SEk;urRzp.p>#G܋-l0knolC&z!yT>  (ui!y qӻJ|S0Ѻma즣 V҆XP/Ck𚏃B|!HNTgThYn`1bE$ݺ=s/@ 5J:L+\}ا63Ԓ 3Dy?noJvly²hم+E@b8_b$%l4CK!tx'?0z?K!e] VsYl9M"%ﺸ, w˿~׉I@}300g .`^F6G 2weq˷.M,i*M֮%Ǚ Wx^dJ\s}ݹ{ EY4EaFFlFFfFP/ w(;C6@tfa᜙=ް/na"b6,GJ?+3?<-tw]X_0H獹`J45 SW{%B9uN_^~WhB@MTXN`tzMm^yuŹg@ϩOhġ}5_`&PFQ `jl/ϥmz <w>1;3h% v8垻0R1|c4鶀:Gg<"3 ~>fQjs3 \E3;޽>1G_|.6[SOjѡaFs@>kWs *hՊW׼}C>Ex5䦗qpҌ|.|#g3 PZ2'ZHѳ/0wmSx`u.Bp01BD%z ;l=Ds9D;[(lT5z+bi%mSٰ>v4Ӷ:6h"[Nށ[$j;[72"(Z{|w7;'s.GJEK`PQAR.mt"b|@߶j=tךpp"q)OJVQxϝMt|mǚaZIhRV̉Vۭ?tρ{oKV^6s 6}6DZ4@!BǘW/?ѷ-η`pfbJK{0r%} |Z}a_.9c'Sp S$KQٔRb=-<-ģp#A0XOhx&myVjd[<:DfE `E&V\Fnʇ$p0T9ޡo{#z-8H!0СBL1#*%X|X/T RMIǢvv]JVdzhH7]gMv>#!i^TSw6|{O̩90q;0ʎ혶QߟD Y)lÓA103q0z+=<_mWa5#̲I$؋f/kuF R9@.'?ՕeiQ7OV -=6arZj;R:#G鱏Կ>ĹW. J "QDM` P<uȍ\{wV1$U)F d+ skycs=ƆJaCr!1`9M_L CSv>܎0k> /r}ԬG*/}uVZj~e9 f<-7;C)4m@_9&o ߾JrYkҿL+lHu]mB6j29gZMd'X,b^f5gZluqO}Y@2^D!Ts1k؂(Ԣ싫;p-\Un'ƥ$awJyn|G>g髗{>l2Te R6Vmr^\_dk<"T jbDky$<ӌ߬V$cwTry敗 %pexIy=]NBhEcg 7{iI{ϽsxƩ:?unۃ{B:JFt7N4N::qBﹳ}n&v>j!2=r0jJŴ&ׂL\qG]w.z[R8yM\Z;MK%] I-MjoCxۭb1J$Рt[Soi))dJ@etnkOg^eڒ0JrC.Yu{"sJͰS7^pP3x_"XՐ@.$>1VJYD/!|P5htJVUgH̙!3vZi +{@)MMᵟV.j|cd?o ^8xϜmL 5'teXzd"b5@,=W( {@>6!p3R3 (%i+]#W ʵэ\; wS ^, 8ϯn-m%LVi؍ 7WPHtNo.N[Pxb6zW/H^8(M=#LhU ^ !C6tNT)I$Fʅt~L\8\CλFBk=hT&!U\qiMn󻇚Hi+W־d|Γ^LַLwN`@xcD +gUCN2pj+ (6^|>bvmdyǧ5VS6i3ccUЀj)b PX %;SKV6io7(k/ZPA,_.La3yX H R ţ`4<-&CҩR{31R EOm^+r~|Q7D%&ik>`||.vۄZ4:lp101rgUO{So(ШAݑOAsc ZA2X6¾ 13 6XxRe.r/\Rz}N #H9\ XP2*u&MӪ:10+u*LB)(D A6ܓ[zC=벧U*9*RO_5[oZ@Hm}k;>2tÐV5ե k&4L,;$楴ބWfr* @?IbJ>)äP>ԻVL,E V׻ɳ}E207O>&ӼZ^ ;etZ080| k",SkcUK9Dp\Xt2d"qLdJ9:_)icRP1~R07}W ]SF=Q vE&>%}e@Ѣz>EFqknagk(ȥS?ڔiu}XQ,aΌgKƷ[6gD<qhB o)!0:&P+W [+CsJ=|MR\I!W{NMVg,JտSI闯j)[W5"Q/"q0}#h8'^9{iA㜃@j8]OZ)K-RlRz,oj j8ߥz#-.3M+i,1?)NDHqXDf Gܷ.?^]6;n:hVo^ 6H=3jhWԓTͻ8h .mu+V\;ZPDhF?/|u?aN t)3|X^L+Ia"~)Jˌ,\ 0A`Z/gZ߬}nĔd42Mt`ם+ romۮvX5bޑP+$9?Ӿ8ƀHW0U ss~?V$qI| ]ifz#ʛef'uihԿW.l-}qLTeo(.SJ(iu|ߵMs. Ģf m ka6Ўvl7юfzܯo-~!$)zX5m#WfJˍ F?\P (6ȥ)bp >봇͠ 3kxtIQ3j ˋ4M#43aN-4vOꧾ|>vmSkՄ멙pM@x7=`xr4s( ĬN>i\7d:=[kjMX=b乇#;ƈyM"l_FN2R; lgQ-&7.3aت G1wAkJT ;]4axk׿簹;?5eڧ!]w43d7΢&@$:^\y{7q`V kt#`}cM^_d9dsfT"E Z$y6IDAT~s+9O1f"萒w7wp Vz{H6w& `bYMF#cVڽܳI R\5CDFA"Ej)hIy iJbh^{m}•̮2D#~8>k~hJ-!ff.o ` P! DfYGܓo sC1f͎} Yq]/4hE.aPei 6fKf@4dMn}7!f慬]b "Zf<4> STV:;vV\xdHm*JzQT/y¤\˲`:ThA<b@lK.閻bq[5'41/ܫ-Ӏ( &}̶~=_|mX:k7w\MU9zx|ps"Q뚈I!Ql?Y\=sU h<2 -m~y.@@` gٚg4F!Ml66ظ Sb}&8Zkl9uIn[Mh&Mt*F3%#Ro+ŵg7Y!lCt+٧=UYcl *1Q;S;ҟ<֟fJ Pv3sYü~zҀfSh6/^rNՏ|ZR'AwO}~_V13; ,A\$AH!#gt#va٢NK2H &q,wfg=UU=U];=`b1S]]/fX|jW-M LpFe=Nڇ?7_i{OHd0Чj0XԹ^s7@ l]rFԩd==G&+҈Z@b׉l;n4϶mt´v,Fʏ_D>ϤfF"LB/g&O,󤑀whlq`{K? !4ݷzg~'O ,v's&bT'%mZ;;jq"MGM[s0^Ҽ [{l//Ͼ9s2ăPnmܞGk已@@ iv~n}j2>T{WJ?A .?mX唿mݳ\UD$|{' מ-.'c=i"AޱKh76n(H3z7P%޹4ޝO?OUlLXRWn0VŹͭ޺Muh6wmr[4| wFUf뉇u~wggO1TG"'!x3 @'r7Kɉ4R03s}U}JQ%ˎ7lv{lc  "%0Km͗b%Ջ{PH*PQ$+y>~OM"%Q.RE6 _nayES B kވxxo|O'Ss$0<>Y`ll|cm^z>{& 22 z'`F'yRn;X a۬[g`L]+}`'Pq5Y?oÏc/ͷ&RJlFZ+uPxt $ɩȳɍ,럺OIC"%@*F!ş*,7s4}S7]tk71TQ}FKo_āR] 1i4G߸r?:y:sItTxNOۦN?m"e8Lյȭzםg2Ya7\Doh|Y/'rhLc`NcX sa?-Bnkm4t~"^Z ih)*[Z.x*/<_A51BtJ/f^B GȪ-M꣗%ڌXda (5SW]zzc/ىP B3w0Wln6O*jѠ]Cզ!=unO닱ֶ%ٲTb6a2ZYΊ'OXéS~^}W~wn4(T:6NY8d-o$Py ˋxoe;;>S9{F¼3uJX2H]жT;B#sr.Ku|PŴ--CC;o0ff*omsY ~B$By^~}'?w|29A b'̗5f>AEw|) 缰RZÔf&k<{}k^(TdAwuzY|oFO%΁L = TSYNտzlEA^-n~e-&E,Oǽ/z᫃zuc`6 jC<Ko_#xd}cjFĄ&մRS:Z?B7 D,9¼)'yڧ__7xrT=g$*$߹{גzlyExW rztHߎ~rH/R T&F1Fk/ҳ=)ެp֍fwʖ4'4ŗ/m]ǞԠc"|EL?O#Qr&Fa]Q,}Ąa05]dp&cGhšPuPoNgt"Xl5mzJ$ <n{39zxkY_0{FAJFUQO斾Ww?ni/ɰ~ };V{~볨.)'?1@tc3 ܋<˟d郙*cSCcpjz:6$"ILwmu5em])Hh)F'unP{iIwrXQW6b Mav^\~.MT h 7t\2P$.<@d`T! /^yO|'Ny/--hS`9FZv:UZEԀr-"Af~p97;/'/׿4OOxAMVmz#x@b4ͷ8,iqV2?-~(kXgԱ\OEYU25 VUV?-^Hmq07/F0%&= ysremSAc l>n x# μ+/=tC IÏL,l#)OK4zkځvzʞڐYY{,O??;ϼqL.'AC,ؗv7`"˫^('7VJ )m`{~s{ ;Az?VTcWZ5Ws$oUQռjBHhŶneX8Cl<7_;y/qM.r(oPDI+ٍ̳A:H\ RIOcፃ16 4%I4>>;nZNmYtJVMw [ڍb4%{kW.)sgJOX5Z"8ݱ#011IUN\>{y'?uIoz+rJ2ѐUT~xn 9UPw uHlœNٓ)Y}ɫ?>gr*M}M_{JV=izup7$ 3GTSITFmb@|:i3eN:Ѵ=FqT4݌l1kO5]x*G8_T)UiBl4~K׿̛G%3 _DQnXv0ULgXF+.gkޕo?ɳII7&fL4ncAۭ bҵ&s[5 ZR*]HN?7Jo長{@R` 7h΍ ζhjJ\E0g 3OdOzoYnl_7ۀW&TQIJ?w d4k1SЃj0K2||KG>fmDg'\)hA um ZXs2bN;ŵr=.|wL5)?:CkCtA<"Z= x›hNB_W/.~Kw߳kbҷg H2(*ߦ;.U.5Q}eœz2Y.v~oFBܦ|w -'HH2B=j{ˌ \ܗye;{䡧76~*$'r Ԃ3Az2Y{=CO^ȟ~Ͼ}ikܦQVx@ԟX'vGGP߹LTxʦ 0b9`b"TD槟v?yZև!3§A)Mok.O6Dku>ލt! ϟzyjcaf޷ΪGWv I7W'S+"&R)MЃS#ei&Umeo9A]}[T?@s$w3Ϧ? W'{P'HrnSQs[c?+C !Bb]jo[MO2ˁ)x[Y?  =} i GEBM`-4 *lLuh%500QbWȆ2:b[@dE|ws1Qzb4WtߕT;3зҜϯm&k E䠘́;QAzu/>αo77+[GPYf!DEs=#Vsg%[?vŃw Mq4b (0gT2+$sl3 Sə\|=;\vc3#D!p5зq@"It~o՝쇓A/!A0IlD$\eHPC?Wr/G):h^ R<< @5VUPrd"50G; n;嗳K/o߂Ljzw.@[?yim??>c\d,hK%$7x d^ɶ ,$18䞭MpY3V*mlWg]l.n7DvAE SqCO"0OLܛ?{yk'_7J- zGVAyWQĤ~YT]d\PƮ4?(2-YIkT,fU,I+Mb-UɈBZy9sﰗp;\޻q!]ySG^I`bk%Q4TUFfdh hv'?vɣ6{N$2f˶oϯ4s6qڴXj3X ,x)+%9ރ O7 ,Zݺn>kܥgߴߴoL._Z6Z TQs̼$>=rqw#\{sw֛Lid`8s65Sb4y5:VMm1+k5+i0R D"IӍ^r|o]5]Dkj}LDҽMK~LGa`fࣛx/}?g=Ol>t'Uw5۲lG?0E,N`UE{Nn֜Vq0<(:Eq&"II_dMz떬y37_?_w\`hfa0BZxrVQP)A0Շ̠KN|o>n>c]e@$YGF E}wt=-Yfop-L ` ESAG L,ٵ7Kw-ёC:48{TA/޻ iD[j3@C $,x:0䣔Oԏ}g>?n2o:9E=,7Mf 4K4lCIFh3w޹W.[ne92x˚r*f)B$9ǐzd=$\OgBu=MzW6/[>k=EvZ6`+eb`,ɴ/M@qzŅB*@:SD]OktGdp&11*.y~SFPn3dEf*)3!!,/%SB A0UhF9Hlsgӧ{ y3'ᚦ }LCܧBg&h١Zݪ;HV9ӱRUh\-ܷu 0y")=^掿\+W^yc/^{5MD )c: C(aMc4q1e;`Aé–TYQ8OL!w*[KNgUt,~EO(f66E "z;TUW<\lG'ȶltMG[G9N8~P7  qʊmȗǍ*ba8SvNk,'r̓V뾜fzG7a~l`:2FD %U,Nb!\J_"-=.Pn)lkLu巙ynѼ5kfxCX ?83f4u<ܦA1SO: 5 v$l =ҩt-ʫ0 heV[܊X*͙wVYumK"h53N’E r#ʝnH'U(( ԩPӤ7 (ʤiڊ:h(R畫QQ[ôH>4v{YS[H)ހ]Jp(оaa']͚l%H{4F4˪T˾ow[m<MWn cY#֭߫n9[>ۈ5 7;;< ?Ș;ۘVe^"+W.nC۶+vMi~^r wK!nAr_PȌw2cir7aɹ3#hyHb޵QD"rXȡHɴbH$9tg?JǬUD";B#{5 1 "HdE DV("HdEnhGnhY5zYG4|D7sZNqCD=]m?eI|nwJuyY[(DQ (DV("HdEI:}@TE"q!"HdE DV("HdEİTИկv{p/뾫^n?QV#D"w7$H$j$ >fv{hD"ID"Ȋ@$(QD"ȊҞqz`D"ǑD"% H$YQD"% H$YQp4"H$rl+H$YQD"}@|կִI1'p$G DV("HdE DVXm "HWH$DD"+?D""7q4D"CTE"Ȋ@$(QD"Ȋ@$(QD"Ȋ@$(QD"Ȋ2,?D"WH$DD"+JH$I>~9׌H$9H$rW]ā>D nC4Zr"H䮣 ?#Ru»֦iX/Bc;tV$ܞўLӎvtaCk7'1YJzL"˛~.Wm{-+Q> Z}K֙;n-}@&R|F4nGGyob XѼk7."u9D+'\߅[?ǹ/,omBklBJ0.-t{wXҢ/Bvn96_ff˂4 *Η~iiiK-|r8pmv?hE/pjVά$ǭ*:^4P@o2/=Z/iM qY5kSo5}w9+?=U.Fѹuf}mz_ηI[]h|&-y_ZBjIoq[6H pGw}Ƚ'˹*tgW/qg!Pq r4u v.uٷy{ ѽ>$7r7ߞL {~gWBŗHKOX=Ҽ)WzI?Kúz?ȯfZdGg/dy{Z%g=aX5uu:&ߝ5ȤТGRC49ڲ݇g|cƭ'Ozi~0Vo9F1Ťыca~}%lo_Q+{ݵQM\gOێu32>>ߌ++MvϚNraxu;1-co9mW <^ixg18XJm[9>&3_q28ia ?tofv{ՍZBX>b1h֕>DYaXo3ɳwt<giˏF`;n3̴SeO+otqX(kسgrerΞbu+ѝU]Z W0]ye }@A \}m.7O@^lg=NfZ1T%`7 s|G+ԖV߳X]L.^Nҫ ]`ܞFJ #9wˎGKǜM̱&{q?|*鍅Vz:ױ{]6COWgur0?v1" H]Nѵ{<1{-yԙ3Nbz}}Ҽ_荏h:a\<#g>qdC1?mx fȿ"@H.tUb~;7oG \ oDCsC tB$gjE2 6{h6MzKuinw:>;3%,mWLaVx&j8ʙnv;Yu 5kP^VK駌P&g1#cG86R@uX9 n8̰W s\ՈwbOB0vW;[ usʭp386@&uaPǩkal9kB1n9E`Vɹѐ[`Vp ?P1Ɏǭoi1-q?CڦzIFn @tsHR@!N웾BoL!,}Wq>(bZ8ZdF<ȽA+ْ8^x<24_&Խ`(8)j. !VLB%hqL@, phQ(,B~P|A|N΢reBmd]ZT.sFu%~_NZ97c;Gg_/dt~qn>7o&L]tjͿ~o>'&N3yw;^3-0#ZP TmtAH."~tĬG@P;H>aa<Ӫ274N=֊XTTu`f.#qqu2X#K ;jVD3Zun`fo *esv4ZN*jyQζ%By@RE F4/W p 2肅sm00 &qYJsOurᡴ2y+*iA*;FQT. J9om\'h-:I[kd%,KXla8ڇ8/a6a9 !qp$&0r"hTfÆ3"d]eg\k=6,a k9-  SB 3t8jr1qd+WqwQ+5Wiabqv#aAd“m-UW10i{㇧ET#ɣB j^V O` LA#{71PM8aCWx㵷9|BؗfiW 2BZV{E"Jd8>_Ue F^2P^0qpè2KVTt[^3ahX̵x0+Y6 j]ZS)8[Qo9,0Z%:D@I='Pq9p. mݻp%жԫCں' = ^3BPюL DFwf y@ ɕsE^iMRR} g>D׸_5J{֚Fշd1 {dmoǃJhkZ4A4k>ǘ)e:ʘ E[;q&H%,oD+G}w~>SЏM8a >Zqirr0H+F[@d^Xæҭ&ý0g`ˁdot]2UZvrdXtFZ(Q)"oGHvd<+͌ t!*Z / ZSR>i5B%#Qt0- ЗwX.8Ƣ=~!TU>o7I '@@/v`[EWsM͟'U7>J ^ P5\I5@l.&)"&Yay;eb 3F.G  yjz#Xeg,D MBp B@_11!p0;^'t[Va:4'*ȵ-cŲ>pd nJ. !9" *F器 Dn!JLVRjKC}r_9LCB<@+ZrZ!紑f4Q!bP:6DG XXqU8U#3l`-3SՓ u)wW0gΞK Ϗl6p|_̶8hU[lzt y݆ɥDŽH BqxP0La2*UZ-8ܵ ,OK|Ҟ"2w-W/5yS Qb֦/N)#5plϤ`^Xa<W?֥>mTqVZݠyPa/_ ͿӭMNV_MJP/eyi#n_Iz x}^\S৏pHc0ߏ׃axrϣXձ_6a{f#n N)t FEJӖS+d^YޑBI:_*VbT_ NU8N;c]gxOa%X@@ՐfJA,;~9l:Wma3Q D=*h|Ø];>H@)6dVi(K!MȦ' whpH x:Y.>EZ]K:6Ÿ}/^'?$~+2O~/'vI Q5X+GTYnRTb W^!AL)j''}tpawv]>wO c(R'x+OՊAh1F,0vQ>u7m&W9S`]'˯HƼ/R${;X*5>~ -u,wbl-1Ư=ߌyϨf̫P5go <730Y,~@qS R8o8$17Nc] X0 V}hspK{FxD Kņ{Zfj,:X;R' `jBK |0ATh[:*U!Yt0ׂIyMh)'U8UjIfD{D'`B6HOEm *JU?0&-_by@:qlȵ|p{>hDWhx:"ƒ! bKYCsLoq2rP  10x^p". Nyg&^6.VIM9D>=mX, }0 ?qœ XŢJE&S- ޖJLj Pwt>ՅkAN}UhG=|uNgAK&oNh-mqyDYRr@.OuV,gNm]N %Z sVu*#xe#0c`'u@D *Z,Bm*hd@j3Z i 'qug9 ,[hje1ˬD?J HXj=}w?z7⇧2F;?{Y}}|T쯪'5wbpv/MS^߇ >;[̿7>5Ǿjk ";hNBD6ς2 3/B/X^M{9f'ړ49"vsx:MoRNRzE殳]0 ( m7Yrp0F#Q?ȪuLn`/>T0]$AZSG&>y?zA.@Q_o̮5f90a4jk$6ۍ(pc{#1!!suip6d+@3fG){ 4 ``V@" 6{%VG{#{0ﭘc@eajT$Ə7 Z5<I*TuE'M4"nm&TmBFKm0܉5bIWE4C+`Um1t+ 8·Ʈoʑ\M;>`&35Z-HpsiJDdu/l6p#$[Lo:+M [0h` ?E^1CPօU5eeUYMWaԘbe2UE Xu2\a>K^v!aw؅e "vE<[S"3?Om}}6}xgB1_גKF 3*`ZgSͿo|OX2;O{VU SreO;hd:YQu0pI˞,!ZHv`iSB;YW5vh?dgp7 lԢꢳ ׇ4IwMs=bRPK Zr5[YuМf:tTUMCxN J|ڱھ˗0&/@%- 2strKCFĪI˲jvcM:$K?*`xu[0QbXTYeMB9-wPSQBk4n[K IE./uTڂ$H1ZܨRTؾ&eYk1<ݰ*a] 4"eA)sTyyQ mq,Bh :bdEp2da ($;53{R:'mяaDNG0N'ܖN+mQ/݈HXvühy@ ̈ę쨽q$]I mYV]rHEty7p co9rCE؆BLRLPwÑ'I8>H|X2\sM(6tio ݧE>#Pw'ɒdOLw+0o\tǚgcf^6)rfGvÞW&< G&|RL#|8׽8z( '&F[ 3*$uȚ@ZpKݨPy&0҇?'J|y mLމ¶K}" S2O$vz]n5v%ƣ{bKwtf%I: 4$umP}[F:&ã}x6aIXCP:Dڛ1L4J:]*:Ӆeh^Wtv98oY!x7?ƛ|WYm}x"ڭ\KsQ_L*|wܧ2B#~Io'S!tS|L|P{Uu^MUbe 64U~7 g{YO?:+TWYı|zSX$D-b`x , p52[2mF>~gW[xX^ ­55LemEIU.t_*B-x4bN-Q1n axD j7,Hn4 sEO"3u nLQɉĦpU|7ٯfGAhht,:"IqPBO^^EJiFIch\dxCKD" Um^OpUYlfW\v':*^0Ng@'Z- Y!! ¬{pP*e'Rlµ$ϙA|:xX$3T7 ]41NF˶ҽlNW#wƵ( `qS]T /«DGfQ$l)յC=a Hڑ;3C/c>:M'TW& D} G۾Vp</|%,ԙ{nawMc: Y8ȣ}//TU:2xRt "cb[*%#%4cp2!sēlT`l]άUGzF0e] Z?c#ŏ7kM_֨S$}M(Ne Zv=ގYA!'h6u(8s*NrZMᗱnUA ӱ7$ؿ@\QcȤNM]ZudZwv3UQ)Z#2'-հ`뻶]u 5#0nNۀ8ġ#vq $.VcsSk~5'g1{k{-[%MAMBAR⚮#3 ­W&Df`$: Tnk_zTXtRaw profile type exifJLRS3.Ss 3K33 0I1I100J4 6654 b0P2sA #d 4CYIDATxw\q'337fREJs(ZTWlْl9^{w{ViK@R")sA 2.n3sNW? 7 М{>Օ"CUq56X(ԏK+L- T5"DPJH>rMN!G S#"Yɏ픏Lk nJF6̅漍ɏZHAPjH@'R  D-Pff1:,vdGbojk7D%ScohF(gj5 +͘9S;@<V!5aᇞ~ =L4 `8o_H @i)˭] f,d=BJ917̨y o lqZED6ѡ7|o¨4-MU˷/lgzzqRśߚyp/4 Y[=Bը;CLw"s&G#C;~:^9 *6I (/CnG? X0h~6cn~R7 -6Z}s^i`n4ͬfPh'Ifm O-dE#A9<#§ GԱvh:Lh,pp8(ZkÛw{T7BcZ84"(x )R-{/!uD <z*%\mją 507I[Y({[F9r/i+J,hVCs٘ڴ9қ7Z`Txݑ*99%E7TxZƇTKRTJ߀(>drchE9Ua95Aa!Vr; +q:rlt851+?lHP*|4 s^h[lkM  $ %TE@h¯d#i=lSBJ)?vDy]I6HZ~*Gۢ"6jnV 򪬶PUVX9j2oQbp!9|>tNtQ< ҄af+ЖVGۏD;,[%H_ȑpRcSʊKژh?64߳-V]D#?9J#( Qt'ſ)MV@#Q7%_@as_̱pņhGmO~?|d}94xS'.yCUw.X U (cJJpQ$YUlTŪX "&HWx*UtBBD*!_ҀEUU DFr#*@E 8A QՔ ÜNB{Y@ދ tvw,_9zk-[lhВ% +]* #"8Sxuۮ/ګ&fb60Eb2|Yƍ+Ob 왪V:H;"RVU_nXo,@ 5mKld6a=X߽nyb#6{=6brHE#QK Xj˝g^~o3˖Nj KY1.@Ɖ I))Hհ җ_-߹GbkWKlDgm"rxjyhw*Fr{>yK-KX!L0}f)`0Tsɰ1u, POx]\֤ȱ a q@qPVY,JbC*WkT*ZWX@ CUvCPRRaʎ]__۶2GPRFK©`})PV`|"[ﴟyotY@T@\ԫ- ھkWo֞KOe=Cւ%`V73{_I6׎mVutXPX rE}vFE5A@ `A{W}utWr j_9'(5a:(Q{v۶jڦ= A帖 y;#8brI_U*PuPT'5ԁP#15(Ŋcrwm}馻NPZzh)bԿ}w=6{`?.H}h|Jfy ̀OoSZs|={9ST' $M[,H!֏YQKv=Ԟɉ:I9|ERsGlʴ#8Kd8K(& u!M OC&: Q v~ۿ/g?_?έeqD9QJ@u.kЅ̎~{BB$JąB~f hj]ud'Ғ'4C< w~?_S'y]?8%1 Z@ȡ$ A ,4"I*g-9U>w*q;V2Z׊ B U%IKOoӯ~?(D% ifE*K0d&K;UFz;7tN75[R)!/WHK :b)c T=-@L R뗿^{eݟ$*d0Oe׾Ԅ*¢ dlY qA-jD$сZT^1?4ܰL%__Y0(`]4_߾ 7hZ%6{iT.OخYj8C侃kuј"쒤vh V_EFSZ*uo|bFww< +&%oO[ !ˉ8$#!)z{FeԂ_n^GrB(;y _yX-;]n)$6V&dܭ:rL=O4Գ}<>60 qjhĆT]wt)*S G|)켞y3k [^+=\55.YUU k#/ŽJA>׿ *Ӗ#׾6ԉ(9wO~}KNA8^"C08+'Ȅ,=v *, c,TLXR/U FR "(R>>~;Rϱ,u5M͋ـhT"H =q[/keɛYh⌃s4@YKwX1)W Ȥx 6d˗JK$*-xvcdt̎&'~CFX 8@@ @,ݣ9-ASʖ#14\^G]б.(O1ZA9^D  XմQgP,?+[Ĕ۷ [5m6ҩNs+'qKKT,v 3LsRU;z"P\T6Iʤ%Eډ_(>ι6/o7M72HyX;?tT&"MmE#A#8Pt]CnNBdPӋ|ǰUS7*ʈd929=߂GGG: kjCqd/h.pypV L] @Dd 5}BJtTȘjNrBx1%<(T4FeXވ35k̦*l*j >x VRV;+#[%"akTH&u<=|4,4`ɴBDbNkՉx-1̳ߐɮԵ`O˜"bS-"&t˦5+>7T%$NTl0CY&ȸXU/Ll>d-r 3ۚ'@}}:{`hax UKN”D"5\>~㷒ԩa%e&HvNy6;EET T?/}aMi #5PR=I<"(hd;$w<77~zQ .)b:7::Dz9s Ո9Ďubo1(o$JF00)E_6[H&P+\= NڔV¨2abc*Ծ׵/)X'uvɢ @vq ۼ휌-Gd\J [OO9_n#%yvR$JF#"Q.KS# r&ߖGNE=2sS0DabaJXXq!Vm I (1v&wln͜K[j=]%$}$v9U]M3wWoep/VIgQ MHUZ }mj[$7,TgގvHazzd)%Ԓ %+MԠ52 *UPPUF4;[:fz(5.Pkr_YO<,;#S\DvdN:O?-K&*p4_16J"Ǭ0eLWOvg&P(#*{~!$BzV%Zw`2dKGQZ&:eq Da(C !3DW?γ xSUBi:;)i(ĪB5Qob7{xS"ՏZS;c{D.wNFvD"V`Sjw7:Nl #5 ^iJb!ý=JB g@f4&1XWL2!zOxjFgT!㕑&Q9Tr3m4G` bjKA_ATL"!h\4)2)E ([@HB=?Uqk/ Zl5~$P9lW `4D`eK~*EjXMbJuA^FCGˤ^(lv/nC!?|)ܿ]J:)CR*r ̑ `+~p5Ag0ʆBVeUQ-Z X'm2w6w5ݙ @@mLs-K)0H Ԕ1TUB.uIӸ?Y,Zb瞗gAj9b:(d.tBKZGcY/[Fu|!)ܼ Q0\TΪxVrl4M8tGhFoEP  +=v5]>QܨCY5/eWZDUh(gkDR];q)Ty X>VQ:-Z}Po5gY fr&H}=vz'y,]>pN:mAEP% UUهnSn1|6\&{ sC;N%̷=',JX0$Aa(X3QZ]@&yPUUTTT!3c#͗Vذ~='+C-q=ufT23Vy慺1!o-_IĪJ_Tr`@ IIwgm۱J&Ghfd#f&Wo{c*d 9qWmku _uC06#NF+?~egiR⋎?cK"_+Im͹:M[+fe2p22WNLEDVMYEVIH3Sܐi)eےϿl*2@j4FX_TX%Oο,\W]䨋R(HN:OJ/UbB2ï>&O}/ bV_뫏yP U5C# IAB$"qQRPUrlݧg}=hP*G.ngB4+y[y%F#+WB.I G ِ+DY S1K_~VXA_^sNWiUQUvZ"UYt{)c,qݲ~udIm:_ a䊎gnTǞgS:tp=y>G>Pc\}ԚcńĂ\J;3(#"c QX~UvlT'PԮҾW4ǒ+9 ( o'U)e!(.4<3{́m;sKTRVr_̊\eFƶE9JiɆ$Ĥ!ԆnHcِ@Q<1J?CnHizsd(UK|{6u$BJn3Z&y)A)J1K]}q<9nfeezdt)( ;3 +8ڌ֦PBjYAJK}qPr?wvԙ>JT'-pAp/!ۗl8)&yZԢ܍q5]?zq_W2t"%6hdis ax1$[vq?YK̈́LmFqٷݮr9񺬫eH! W}꧗t[:| ]AZC"RB'il~m;}ƾkoyuo/ŊnX e]F -V2r KJp _ ,ѢEk5} TgjR:ZWxMl`0C ը}vβ}^Vrvu']a&))Rc-R+]o^@T4Ai\dG%5"3gV֡u`jCujU%t*,)C#{>zTl$Wʷ%/SJ@VChga1ٻ?PbDIѸj4QG;~Z:'V+9oa bn$~eʝ:} ^]]9[&DuJPVo @@ di JDlkc]ٽ/+CX4\H|u˜#@bE?%V,pF>tj@3p ~?~/_ U[fCN,?}eײn@mhV+) ٟҀDVa3&06ռM_@|$R4ceLԱ R"*[#?0z_^]OtMb(jf %?MkXD`[}+'=#Cgkӽb\pZHѨ݋oq'ʷN Y'w^`h˻SwحR%r ݗ^Vyy2*`]d|)F|jV8!'d`BTBmLg"NsBvGPЄ;(3bs+̥P(v f:Fct}cst0 ZZ:$3 )(X: vgJ$M )#W+*&4oE3_Vj K/${sZl96I Խ:R7`)[qEߝ S'U"kDq4=o)X@Χ*P%_D[gWQ`T ny-1$3fz;g%u Di9werOmM+ޮ5Dvw}K;ՁY+!H80'"2vX/$4<=ϗ=((JWX }߂c6e5Jf5o+örUbT ;7DJuљm\{k?prF9ΟK-/鬉65uJUN/\(jֲdond5`$FW\'N?)T9pe[V;]{[$SJPbV| .еkc\Nj\ [j(iPԙd5O!(AIJ""j 2gjcV5X] "s!p KyHyleƍ%SR5ETd ޽;˾rs*Lq|ƙ_xU-YT,uHӢ@AW.🫂*MоOޗ޽]{A@7;76D4ogj[ӷG%2BPҥwyɥvq֔! UٜRd(P$p8/t/)y_R[2{#h"O~so?M]q, "בT1>Ic,[K\+'l(5sPB⬶Lq1xD9Q6I'v}W8$B9Z$Ub_+>|9p@vݏ@FUNifen3zY%Q[z9EcIIbD(`WՃR ".S. .Te0)ZU$Jب#!cQp5ZjRC@<~1;fkjkSvw:nyv^^j $˗W|Co٘8 (N=EfڢTBsND2\ꅞks;: ɣbvyֆ"Q5tW)g&R)|ڼBPOΌXJm%g{؊郪ʕ~^z\阷`&L[l=yAM,4&>\]9rja^z7 |ݓ ė;TfTX)&4'D'Tm U ':YLN~Wo=;K v.yW:Wjr'¾\Z,xr&$L,YCiHvECF\QZ/<_Scb+JwѲf;̲M/]RSeln͈7ZD~q_DD/~·:} URz Z(0~UAKuDgw\;=%KeRڡXg by$ݺUwK\l8!JrvOZ-CQ0o|QbuL$旷ŷܘ<~_25{Mv%UpTc[' ".bg:YETؒCuH=%~UҤ ;g#%Iucdoy+";kSıu>ۑhE܏,rC E6b9= h:Wɹ 78JBd"|qS[ذ+)r{@xFS!cM&rH&e(Lb9ikz?rI%uv: 9&Uɑyryl$p=#᱉=|_]/V[WS:y3^pXw}{# 'a!U#` (uvNJ?4:7\C%2zDAy.ڽ;,+yf^srOcbx^ -##!ȕ IĤo?+{61bR(uXP!C0tWUU,*4=97y/ܸ'+ed%ܥcWety4)2VyCCV<2pjhB9R:MI]5 ]__? W?v=~pH°̂D@dX;=zY"C*^ԎHE'eә,b/B)rCkIf`U%Ԕ>h| v3ATKZ8K*Jʾ@.$41 H$WmOjN:4 "O"V3[g?6qfUb޴`𫁴6*É:bzF'7ۇUaD~`cV4q%<…Ihr[B·ߝ}Y"#驶Yƅ"GP+ b֟T&Nt~OTJꃟ,ũ.NP&F=6)T6}xevC2XXWyJ#d`PSGU&PamnPʆο9-Zgv#Wiރ)ZRJa,x k{_yW<̮LdE/}&7VTX RG)_^g37mȑ*U#ՕOjriF- P \xcAqd^ݪw<}LBu`{HlI@D{kTz`;dDK&8߹vd9oT5WMkE+Y)~Ut @XԸ>ىz}K{]5 cAə>se/L(!&{)i._FۇiT~?GJ6l9(9~sjODKf_/8育KP0fN{2~4U]zEIz(Q]@ hx9Z} %lL]C|Tzo!؄ȇA:f槺zbKwj㍳;Ij4>]ۭ>o|w"My/cuO -I0oݼt)؝:;HfRiDIkA*^'eHgQ@eRKWtuDYFkl␃ȨxUu%#aL)FMߖWQ3(*-;.;Śn2Q,@ &) Q'řbIr|{;FfﺎE|gJ*Jk?iuJH2GijGPzF3K(bWiuڷ@Tؤ{Mҥg;36ǧZ6:Ї@50FY׬O>LE )Tνl 2!s:5ptPo=LEa$SPEl^'> !Cϲt)lD'283Є=s=\hkgk֍$$Wg>_J-ny4 (r_3U=wij|pvu{}eVhRfO_:uI=n݄U<Գx6g|oݜ1s:Dr]dyw $e;!< F!ĥzõGnR)3+й^B/M:Wsrb%kw~ bU/&a%e]٩Du(_W_(D2:y+8J l$Tᩁ#MNPwmc˻'#G6x DV(c{6XVk#;- %߫2QBq-rT(:Z[mH6l,K_p|3Ǯ+gO"6 rWIbUվ3N*2C̑H 2]3$VVx'<{6Hũ#3N*cٻUZڱO^`)457𲊂#4<{;n1?cl}Z|Bsfe$q?>8Up(y` AW&kOv?͙6M 'f2t^ !K0D:H[NwDI+,e{q{M`>}8|} +D{_ ~!ED(ܟw]GH Y"%0RXHUtPY ]KbAVlXl>nZ1+9m_hxBd(=b=7d͍vΟM%I$ĒAχ6vuZmK;+BU5QMTD5qJuK_>m))hΏsM Ldn}wDUIAPezp%E\Kl_]*gDDJ`JՆcx|@T¾r(I6(<`rKKl3o E- %*j,=&$:=~ j G՟uFEܔV/!U[љ o9jdlwo'zW! dYH{'9b3DuUrqZQ(sD{朱fH#ҭ{mѱ+ŋ4a[V AkTʶ#T#mxk}pICzaP9WS+<Iw b!!r ݩv:i0p8#2,/Vɧ!c[I c4J@4^Ug;+F )(lU^ ")Zp0oE]u2ovE-6yH z,a&dkpP.,Juh84RBPK7Qb A tUV5Ŏ[!vVxc5|  ĮJK_<h#OB+* ̙ U.׾_[n]$q~{a$gܜU\9#L$+UUAD ܝ|Α/ڡ]#aK/\Ui9 fv9[z/̮bY~medhEEAAmT,x""'gL6);yBOOaE* E_5_EVT!,Zg%yB)<2j;JqUUp{\UCH[7Y>]aEW_,(:;?qcRZ̵n$ZcO2*|2KZ &DˏUڎ5 /(soL b&i[M ҙqϨ،eBmQ7oSq_]IJE 8ۈ2CJSXk:Hu1w_Z鑀 woL;&$z-R~/}x>q`ݒ$HtWS6IwDD%;WMB4qS,h;{/>J rXFRYjXiٺEݣq-;It'f֡09:F4JOcjZ榍7S2-hGkݺmGЀg֒n7nF +Sǻ^Va 5L8}SfOX9ى 8tRcrk &bz^-G֦&%: oU[H:]qd:Ќ0TKӵty)M=XWNwsu#hGw"XYL$(G scg \vV0qֺ֗DDJELo$E8<j4ق vY[S`WuBKs6ECX*f*q^eP*S͊T jV[Դ,++g']W[O_588BKSÎJ"jP:$eLmo>!D$?h)QwQu7ngȖwE9-SVepv“@!H'W_S\,A= >gUW,z|DCަOZDy:6TI$cfxrh䪨8(JYt+ Nmd& k( R"ti{^|)BX+I `>cPgx#j0c O=5z&k7HDqztUi;d*SJS,}i.vQ$)iehd;"9}n[3jL&QlꫵsY5x2RtT,kx9)?q.!l&H}PW1^KD&YKW҂UmtUI`j{i۱D$r7d$.܀z@nyTg(+#O'_ܔGd*]dx>9wUogsm͚_+ C"?6L+w_OS+5!h#MV~8QKWP"n^mT2 7 ( E!,),zpfZ Bqr;_ǿ$/h!-OQTfL߶@Z4h{Fh4œh[ *юcnx1lDNkjF1fv0/( @E >o43h{C'E&3u!6ކ'l<Z.ɜ[#GᘠY[޲, PNq:rãRB4!Rp#LjHI;W̉31+4G WZ#G:lI\fAhefOeaOSmǞѧx"gW n|\ 6hd>ILs÷; #V cWLy]+|p*Bij( *X2;k Uyln}+2UH8Z>-/.G5V<̾]ftj¡PdMsOZkmn]Q( Cfw$Ҹ@ XP*BfspmĎ>w&J AkI4~Mӷ,15)2GԚu^)r 0*[S/՟zNV;nNI՘|,AԖ,#c9Fl6dJڵgU1\ѡTph=kRIϾL2ctGڱD$U< ?t}1(".s J6Jia}w" 糄硨5}%5Bxmi|æz[%)53Q@U+VEj]mZB4 ϏY3\ E4tDNYY`ZP OZ0}@WSODIg{Gqg5XԼJ,n:*Da gPԇ{n{pTL4 <a &kodRjf\<6sʂ;ß־qZ< J R/7ӊ/ Hr!nYY>׹ד26K{{O'4pa3T-_\TȞrե]rŠ]1g&!<-=5-̽%~P+EtC>VƍOW 8/H5 RH7mk(b*u %'Sq(wGIő5/7 l<%:Ftj<'#.>/9pgP՘IW/wy+gcLkgASd`)J2YK y+EDV{kd| yq'Xx]%o"9-bR#UTa"9(XH"*Sys9u2uJ`O9}AV+YRp8AmXf^ݯ1HUAE4X=8EC5hNܦ cw RCaMtq]י@/ˆ9eلSZ1"X=?wpWNNaug«tρZSa\0(,a! oxF=i@6\MGb*zYK. !ERWA5"Tnm J ]+'U+P5@ki%:И\y*B~yyD@(wm9;T%y#2~ -.IX|Ɨ #|G ev1v 0SU.NTP+F(`eiun yyؚro-a0v Ak0py m>EzE5y\D]:zy\c9 (f6Wۗ YG܉QGvKيf >vm@ԪOtVD@V;/y+_kb4iU9#󆽹1[B<Iר/5.ܝvVn9x..M|s 7BiUbI&Bi5vPuwS0 _־$JʲO:GQe-kq=⛐xD+Moo~XP˯!!ekdpw|%tEXtdate:create2024-01-25T21:10:58+00:00ú%tEXtdate:modify2024-01-25T21:10:58+00:00ޞ,tEXtexif:PixelPerUnitX08*tEXtexif:PixelPerUnitY09I@tEXtexif:PixelUnit1eWzTXtRaw profile type iptcx qV((OIR# .c #K D4d#T ˀHJ.tB5IENDB`bidict-0.24.1/docs/_static/bidict-types-diagram.dot000066400000000000000000000030521524342314000221220ustar00rootroot00000000000000// Copyright 2009-2026 Joshua Bronson. All rights reserved. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at http://mozilla.org/MPL/2.0/. // See build-bidict-types-diagram for how to generate a PNG from this file. digraph G { dpi=300 node [fontsize="12", shape="box"] subgraph bidicts { node [fontname="Operator Mono SSm Lig Book"] bidict [label="bidict.bidict"] frozenbidict [label="bidict.frozenbidict"] OrderedBidict [label="bidict.OrderedBidict"] { rank=same bidict frozenbidict OrderedBidict } } subgraph ABCs { node [fillcolor="#EFEFEF", color="#666666", fontcolor="#333333", style="filled,rounded", fontname="Operator Mono SSm Lig Book Italic", fontsize="10"] Mapping [label="collections.abc.Mapping"] MutableMapping [label="collections.abc.MutableMapping"] Hashable [label="collections.abc.Hashable"] MutableMapping -> Mapping { rank=same Mapping MutableMapping Hashable } BidirectionalMapping [label="bidict.BidirectionalMapping"] MutableBidirectionalMapping [label="bidict.MutableBidirectionalMapping"] { rank=same BidirectionalMapping MutableBidirectionalMapping } BidirectionalMapping -> Mapping MutableBidirectionalMapping -> BidirectionalMapping MutableBidirectionalMapping -> MutableMapping } bidict -> { MutableBidirectionalMapping } OrderedBidict -> { MutableBidirectionalMapping } frozenbidict -> { BidirectionalMapping, Hashable } } bidict-0.24.1/docs/_static/bidict-types-diagram.png000066400000000000000000001154541524342314000221320ustar00rootroot00000000000000PNG  IHDRbKGD̿IDATxgڀ{.ZUkZQJ/" "RDtHHgY) 9''df23L{Λ>D7‘/1@V"+v{:2H/Tf8=ɐ}[}֘0 }pGJJGҭNWF͋O{aJRd%nOy>#*2SVdJ>\>0)d8-XzGiFg6G/Ğ@V"+v{3x祾|e7Vk$CVႨpA\$+No#e%AsSYv٠2[V$-˼@V"+v{J3PT޵qhdYއ;K~/F8RVR87BlxYq}YSmȯ|Ĺ ;d])'IVg޺ʠŷldNؖi=$EVO~)ٰCVd%seeQ[Ǿ9)~#2RVΛ4cOd<#O'w M߻_-qᾭ+OV2i-MU]6Xođ9}i1b=%+Wzf zYI@Vғ6efMH_Bӎsc~d3>h,!+Z6jl 7`}}AwX`{]s"W{/-.H8!hv|\ f/.([ )r^>뵽W/S{,+{U/zY[VLgO5Y;[aePl!;O}xww_ܝU;dEҮy?r/|k'޶=a>z}vpEd4"M⌠ Ԇ?_M?xF(j#}N qYf4ȊvFݵ%zYSVM+eO^kɲA?'K r߷OŹٴCVTuVQ.>lG!e%&YqFCp|K\B`Y*羨Fe~Beꊢ d%NY7S+/K2夐/]h3(fYGEMKd6m.8}Yh6־Wfިdv#$+Z?_} -֌;XQ!x1J7,{*+oɿn,ΰ@V{0'ˏ^8Ƴ!a"+Y#k~ɢsw/OO|eք?9F/>:a}TCo>[{5JJf6"uV8:Zbn >rxeQ'b5 g,{f$+[ɓ+qPO +qJ0U\ɲ^kϩ33"6 3KY[+KdY b|>lm!Jf6"E8:^;g ]>oV{Ŭ峆N/tz4iДQ +W['؜貢,j*)ڴ_[;,z:zLQl>?Vx$}!.Le&.+وtJGǫej7(}:5W7G]LVnn,؛貢,л?W:P,{hasV!!^þ8=}`}1"5,Ndd#^n?A͏e^hVs+3a3m򏦁Ϫs-{A 6U=XG؛貢,Zxa*RzZOU^3Yڇj,/~V_kpJ&6"Z토k5}ϴjdWC?Sr{2;g޿Q=$,+&`=&VJeNjmص"н,fY,6iGsd%7wJh6T#}T6ЇC˽&GV2i-?9|m#6a3kDa)1{G[̃dۼuYU-|J²bkߣˊn|k 'CifYЊW;d%[OBϿBOᐐILlDe%A/P N j}Ϭ[іi=ߺmmkEqfؚ貢,^.لPԊ_S`9˼5"[L!+}<@a_*EdЇ$WV2i-Z-sR2\ۂ>R]pWɻ,}ܩg_tŵ~CO<782;gТpԛ7gVO + ˊ ~.+8|U?򥺛ֳxzk%Yڇ=;/G1[6ЇB'l'GV2i-/0yNGTþgm]C&?L-TV[N.ά@V[0U]Vtm*6O|*,+%tƚdY CUKcԾ7ZCmRhLlDe%Apc[Vt+¾g2;g0Yy*Pؚ貢,]ժ;ʸ/T5'eb>d%7wJHUuڇ-m5^ĖH?hqtV_X2Sw8R9{P]S _̃&+u#/;'DeLUGdBC>?e)3_COJFn>Xu]ح=[6NݖQBQ' u JF6"ݲC++SEEl*}ϴZq˪GQe}68R*tדV懍H+BZH͹efd#(+Z_|zgDN{Xt}\3jk CL-TV9'Ȋ *+ɢ=ϻCdwEU"kY6qƊ7~LndAA]|-]Zj~%{Ϭ;/o8RL]z_i=SrޔWm_1:tswnO +ʊ f⡥x tچD{~ɍp8)hwcP*[^V lhM!CVi=ߋ,_ns{YUVMgBJ[/Ͻmo!VίבL!+V2 r} 韗vO+:;=fS? gJ{Gζ2PڤUnbe&3Yn{YIؑ)@=Yn)Y^ }Mg!4Yؒ8{sDϘRG҅ڻ{=8Ϳ'qt [,.F8QV;^&_ζ2A4iedJRdŞLyʏ֒M5=Q?B 9YqYcuC }#oj,y?jXdz;kw.CF8CV;^1_mIʖS ᳋/_ԿIem3 Y)uuȊMLy&2&7N5ldY1`>?ЭvzI{y 71ݣg# 軫d4"ؠ9V~8lw# Na3n`~O]s8C{YYVҘg`ym|ߎ5;3~s#H   +    + +    +    + +    +      + + +  + + +  + + + +  + + +  + +   + + +  + +   + + +  + + + + + + + + + + + + + + + +  + + + + + + + + + + + + + + + + + + +d\2vR=J!v4e2 d +YH +   + 7!οI+tк$uaSE)Yԧ.uM)*W]"R*QV *?ڤHd,eH*pp+WlYGL}Hd(y<'"`?3Q쾔+dPt!H]+Dv1]>Fl\vޅ~DV(=-@' +ceB>vHdd]H΢K,HO]j݀ ɔ?0V/;MDvbtM;|f(򞿉Df)DnUxAmA:IeDDnVKJ-i\@0?,3=D"sSuYU7ҢT/! PE$2i]un [b'Lz<*VY\w[u }L3o*XGse^%L UDfW6?1AV Fn!G{HStn䍬Z6 ӫ4tH-ZNo*WTA\"h>TlIspÒIt lBfŔow2%tf:ud"vz0j"X(Wy@؋ֆI>S DwL׳ gR*V1' 'WYH *8k)p"_T G@;q`p&+BVVT2DY0y"`#N,Z!Y}!EdG$ dO\H؈3ֆX{,dLlJD",?WիB$éEk)VBVt!dn'آuXtf|nG eTE$Eké)qz YS:nI eTC$lEk'AӐ0NS{&좵b-9Yh-D:{*Q}8hmʾH!+JĮWD$R0uCD6_6buO/22k!)gJF g<=CV #4SKu`P6X&QYVJ*nz@XUU'.|wꦔǘ<:r ^2hm8Z/5'~nKIE ]qk~Xt q"?R*! ۶aS6b¬dWH$ϫ{+y5mT6rWЉ XG[(t>\e0*ZaZu^DVy^9_  C׿Xt#X|wdN'6qEkÙ"m#ʔ>H$? 'L%Ek)=Jd,|u", n>u.,ZswЗ X%L6䐧X@$!3ֆ3F4(i#+`?.I.Hۮ=W"` Z6OD"+`Wܿx-H ^\M$l!sֆhCt(_vV]Z#Ek,q^Y]'eD^~?O` ]6Ѣ)TdbH/;dvdgUdb|uiܳb# !c-dzp>5 ү Ÿ7j ]Tωe7/ZζҢ=XdbbrKpt"aԖVi `YP6JAZdbC{ S;VO$l +ֆQ`:B"+P㴤 (+cCDhm8kdxrau[X"(}hӅD qhm׊VF"++?A>UR6=Eki#u9@o?H$BGimXD$'ֆH6b a+S2HOimI 'F yߖNFV MC#e(ݏHU%eEki*v@<;[>R݉D|kׅH$h,mLٺ\Yxh6nh?'uEk9"㰭EV >rL;32&hm8/VƇV诈@depgb G'l%EQ=΢8Y/@|*F 1= @dmpFV ^>SEXQ2U)s@dopgcw 2rcQɻ^봟@dqpg.GV nFM>uR" ]6DSӑeIl.:w9H,/ZN_ wCD"K  $e+cQXqU@d}D#+O{&g(]H$FI(ZN3ڎ@B:In:E$t#w>HQ6?dEt> ,e09*TJHQ6D $Buޠ."4u:6%hm8mE/& q'Cc^f$F)Z2Edse.]Ϝ ThsH$D *Zm $Jug?%SHeKPp^MA@h5ϮL$B]'$N +Z< dT\"L'53 dgrcr16- @B@@V]#'&>*Sֆ3Y@V[ EQSR@"Ȣ:MSvPPAnSZJ$_RҝH$B -Zγ"w2Mrr"Q|9u}H[6" e  Ÿ7 ˩J| -ˎbH$@-ZξD3"MˉKxꢃߺC0ՅFߐOK5j⎬MN'r}r1}lqn֚^Aj2U\dV6vqBZ3p Yi+STW oYOՊ76X=qBZsʉ' ͧj\ sY+/Кqkc)#W:@P6 MDt܄YSZn{wݬnf\ҰOr%vHhL03̮S|;yWLޫ}7x>SVl!= {"^hmt)"|dui_z+@&ZԎ|ڞzW=,"‹Q /U' $jv+g򬕽! yﾧl+aKķ:‬@N%BRCRc= y"AP"Nm'fcCw{jeYa-Q.,Չs_hed]:d{z)Ť7k4&Mu|R*e< O"+fʥy_g괥 'fS_hWN)Z {d='!+_w6"3^Sn8xm|b="XOdkv2ʟz mԵ>r"2H] ƼmЖ :KNhmɫh(oS+S= BEkc N] ȸִ6nG5@:dEkcB>0q@V^U3޽gީ'7TzUE&Ekcc l‬}ˌ֜f)=0-isΟ%6-֌0 +`'3uL;ik|I]/m}%Y;]~W2J(9I/<"6ʠ-! ơL:h9n`YHCΕJ@VNAԠW7Ĺ;.ln"fdgE߻_9V69_<[O3Lꅄ'Ș" ƁAWeѩQr|t:.dNKGevոec̖[p}Fz!Ẍ́Y{]>~pm L>ׄOd LW94BVn:*Ol8l[Dkcr^_u?!фMf.0Ứ^"HyZn€@ؑ󏌾!hቕcjNO,3Jīlq@V  >҄Qmqe>yg!+$ &SOџuS^ SKY<2x=JHEmj0ZVQ{Wq/ e@YXLZYybTqt&X0s(;i,q@V irlZy2ʵ~#0LtSYMb6e[ΩaV]ҡ{rMt"%\T."w:H6a9},d]/`VftP6.69ӈ? yȡO, >A<,)kh*Un&>RAD1a@V ?;2(-kDWnn1.s{Uwqn$[@VfVLx܉+t1r>o&Uz)mT^2o7h*GT 8b#[.RwyIwpЖMZyh7=&4s'>Cķ;MnAvfG]_YC:%\:[魨qSkV d6YBF+-s>y4훚yw:a)>>3׼WG9&w#+GZ[v;BU4=GͥCfo o/'VH%YzJ :W`RS,w !c6b$/|wc6,w~δU»oJ@J/Wrc`JB+]sNtܛڀo<%}*:{O =vnl]eNDy't\ALviz)d=V`'ycW84BV6;,!ϡĐ?v|J:nZu.t6_=Mo!+Dx٠o>Ŏ+jR'zAvh'=(l{ia+d%Ni'zl&DfKNRT_]Ibvm^lnR @Vr>H+ȓ+#Me졒RcvyM=]JVM6L~V3WJܭ eR}Uvc7Isd%vtQg$G{ߧ*vSv4l5W 3:!+-d%ffIj(t|Wٛ."|6*o)Xٯ+Ii(Tm*Σ\97,CJHtJ}:RDYC0nfJ<ߪi)(w[HRtް:}_*dDY#ꖄ7֑?{Ibdҽ|vHygv Y7"@u2 H5% d::LYr7YN*HFFB imӿt Yi +QȑeZ4zV!z0tVMN dŔUY ` MOrj 馠8`BtY131X* kX*wCNXqUBVZȊ-ߒƼcN)?+u3Sl[ Y@VX"Ś&L%+%qތG4yꌁ:J|Y1a0'|:ےNϓhx0 | +&cuDC2]Iw!W)l/Fi6R@V !cag9 9_6 Ҿ#"dFY1zޚ|0EN{#֑3F vi!lB"Q҇|0%_+ϵ)>AL,XN9!+w Ȋ!X6rMIR,k!gMߒ=!+GcȊb. _̑7x'ɝ yA leF/n"]̑L>'VTYU 1>,d!Y1`V(=II$S%@VY&iK ?LiaOzS-d =G [ +琭QM^'LD)c ,J#K-@DaUhKɺ=(8ib@wS!+ ]&aڅlf)+{lI/#(8b@}V&Ȋ.iV(l%醋%  ;JBV 8UV: Y9R + Cee<YAVJ5BV^G dYpr9R + See +@VdR\NJ[YAV엕Ïޏ8M܀ +'k[P[-Mk=7)X>v؈% Ya"+.)Jؓt͹8S7Ly(-@Vnw[Fowx: {&="x؈% Ya.+.]VI\)Iid9"J"Hﵖ 4N\Dku& R߭Q?ޅ;6bCFDAֿ++6%]js4ARȣjh̗IP[5Y~mφ1[\ٷ\Weڐ.wW"fCc1+":gbSINNJ#$+߉$* /@V2I򍏗xφeP3F;"herنi&ԇ*hTD,~c!b}$e*UG]bONNN#$+N9/@V$O5]J/k[f =p{J|sJ͖_ &Lb[a Y߇sWP箤G, YIieYg-bOY`lgh'N'D݇ + ʳ"6ku/snKG5l<:|\[cvFA# FQHʏ,^4"Y[sоeŞNNN#%+_9f7b-+;+IRƑ?ko_|ߔPYw+ٖ5׊nw_ψ0^ 뭜ѶN` :!@2ٲ867کY1%++r Y[Vˬ'&':+/ȝ㆐W/eWmykԕJ;>nWf'y(y~:p3G.K򼴻]ےsCΫ>c>d_2^X Z~nXPr7kmۙ-ˊc.Yc;桝vv' Y[VFt;<;>$lPzoֽ/8?>whs\/}/|f ͧTt2Y rf|>|mّ*jT[m#<"dޕnXgG #ra?z<+!M3ϗ͖UsQvzw73 x>|E}J|E71ڴ}6?޼ʞ /2Y5u]l+Wv6;oy.=6~t{M?sAG溯4`uW lfɔۙJIgф.Ic;턱m}h;{l;LVt95@Vⓕڠd͹YؽsZYa2Cjԝ*3dN>DN2QOnzZX1y渽ebbɤG:4&%_PѸZHuFxKQElc"[9d^lGF˥6rՉ^O?4jӊe8LȈ;_5hny]NI5V?6t;UYI4 >x%il21-mmDD d5sfIfSo4?rSWk0%+oL0f[]ہ=9];3XnoYju7k*E7{~ CWծPˏ̮,xldzXN!tϧVC <9Movݷa`Gݐk/g~W<}l*mUVK=z,s~8lYVI&tIև#ƶ0Y)AdJSYOV> :$Y2syrAV>!o& \lU*Xmo=x!@qDn!+7i]ЎV)P5 i]#M4'0AFVTrO$bqV[]ΕL!޺-V-͙?c7nt{`m]Xn~tWw]Mwߺ\eɱ(+$]D<NmCcvvirqn%+r{SO&(jvmfam>[ŠF~fv ָݭ :+6Uzc_eF|Y`Uvת箺Q/w,>/xde:Gb{;܀&723ߓS،{=1u?(w:O{pUwfq n,`Ym(U鮮DеKfrL8gŞGIm}h;cl[ڎێD\ +ʄ;!N rг&}va&7[nwy jHrRA]ô*GݵS 0Ʒl=v.k,32y<+k_bG7]j,(R"M2^3X: oU?bw2Dlǂ$z7ؚ#ZȞ Im}h;dl[ڎێ2[V"J=xLĬ?A'-3&D~5WPB)7VZ -e -@n\>v`-J8/Gz.]Y3; ڠ3'1ϲ?nEXhG7n ۃ4MN= !5t #M2~UOv9$SVGEY'x%il01mmJ"a:"J8h#+�w#TY? .C' ot/jSҞlX]5crUv6k Z'_6h=跠kmr#b[vW8Nlbnm;JTeGݐM2UF诮@ϝՂvɒU?oQVlIx$t۱ mgmCcqR\_L%YCV 9!r}4w_)J糝 Z!Oiv" x7hRoMVIx$tI1 mGmCcyr49bJ̲2%0|#AӷwNXߒWg?;r8|G/<^7WV*MU6ԃƪ7+US{݃o.3ն;2Cэ1=XZĭ}[5~z`TG䘼ԕ|vUB$r^ّŭɊ=Iē.c;vض>?'+ϊ;@Vb1C^!HF+@T|rtOTc\Z{_ZӠbxִ.xO6^FifGM}z\Og=M|%f;}&͖Yakt#Llow |YqquCk ?_G>H{ɫ]]OMyCKŤʩ>͚ؒtH8>m'mCcہ2ZOYUV O0t\/@ ,QK{vnUߐ+Y{gzgߩ;oj?o>Q!P+_YaGf_O.Cvgk4Uormbe͛ߥ }_ZU]jt;}GnVnzm= w1?C[umBou1?*1j*et+Gj7nt{`BM{~7s/oW{7畆o]V)/+$J4>- mmCcہxCCd%VYy0bAYu滯QRyH5쯷>W i{TU(A_Mr[Wm ^E;|h#^ 6E,tR:]#'+hGݐ ^[_mz&U4K^Y ܦؒt:h%}l[VǶe!FJ5x{$r1!SbV>TBq!W[6Ӛy]o|wA)V쭝(;w\>6ߤTn{ Wl1}ϋSX0uf}:]V`M^4gRL8Lt,}t_oz<+:;k3l{4M:KbS錠.cvض8?(+D&?@VbM?T~ur{Vo8߉ceY&ڒ+; s9QlPi,5Dco1o&qoϭ$|8Oeꀷb!A'W~QhUmZF-5b>&2ZXc߈-Y-o|8̠0~0Z YQ;.-ɊMIש%]Ƕ팱mqh;}l;QV? +cۡZ +N:rYAVJq9!+QdY@V*+MQd% +]V+-I7Y'1O 7o.ȊbQX/e-IXRo" Namo<|n8Nݖl"SSj"3ILw/ YG@VK @ D4'l" Na=sVJH"Y-d+@LimO-!N98IJ?$Yl'wOoO&ՔS-;>.d&H q+ `N?>wʹ)81g:r8\1{dE"+9D'犚e' v6q#{2K@V$}8HRX$];e! nu;sxdE"½OƾpZ ۞քr4YN0cȓJ ]AOYСeL@Fb aH SW,m1A'KNѩǪBVj Ȋ' .-ډ '~SV! [CNC/DYln=e"A:؛t+L"^r=#|BxM$.X,9:e'VC9WJ'LYl: #qt|~VIZ8 d]d]!+7c Ȋb,yd OCw6^H#V&{$dVTY.;29ٟtȩb/5s["&l7(FA= FtɤO!]ln&F|Zݨ8Z@2A*d$_jWAHʱQBV Ȋb"1JN Y;N_b a}2`xa+CqdEC D;a+t]eM&ʐ4SwgN!+ ȊR @/CtMRO^9fNr! ȊZ$1:m&-;Zn!Аrd):2c'(a+cdrl%4~R#I'UC BJv2d/ydK\}y (IwL<RzDR=V Y9[@V[.l8+|&IyM}xJf2uf^rs)a+Ӱdeu셭x)u%96)%\B~UȠdy!+dWIi.U8['o *f+WI_. +~֫ gjB gQ RtK4:vtH =hugnrtY Ys# %9Ԕv/'! :24 Yi. +A+A-PrcԱGzRuz%drvI+d%-jm15P|=SWb+ \VU'iOL* uL~kmSYi(R%#)Lj:oAL\d2:yɢ / +!6gP֛Tҽd5^-wT0.鱉bbp.Bp~фP0U>?#wSڈ0 +3aJ@ b}M;NCUl>r`?Kswufhg[0 +.yc*ŪqaN GҒt[6?+`/+i◌S d6YdޫږL@Fڈ=]9wdJcmcY/MUܛ{ʱBVc J${j:M!!)ץ6ڛLOg :-FA;=O2c@VXw0n5IYJCZzGzÑ{Ҝt{WGrH>{;O)]BV}~{7Xɹi2-Ic7 9W?>s5Iq+drc Ȋswb;6z$gA}>nu~猤;ӇAհ]~ÿHe1ׇ Vfϣ|2 +ݼ@,'yn*]P#YK3(bBҡ-Iyޭy񛝖t aٲ%d唃8b=Z0סrv{~s!ft$K [3 +{͌oGK=yALφ`O]9mܗ>-u%Vc&/ɾ$7-c]Y0Y:ġI dUdYJr2S‬v(_ <'Yd P #QYd P16d4CZ0a18" +i``18K@V kF88 +ׂ w,a@VYH+>ԃYd PLVZYd PL$G}€F(_ t @|-FzG@Vk! ׈:a@VYH(Cr€6(_ QX$-# +irb% +ib@@Vk!*3d@Zʑs(B@Vk/QR0 +ׂä6‬(_ 8p'} @|-X 1N# +i`/@M@VRk+FYd P,r)OdCZH_1RNO@VR k"eXO@VR k*2a@VYH1|,Yd P,G)1ZfdBZ b4% +)mh8 +B ,3dTBZ+xiC@VRk!&^Z€B(_ 11WUYd uPb1b:dAZbT" +)&‬*(_ 1r41f>% ++ϊ1s'a@VYH-L‬(_ 1x1jd@ZŨy0 +B Yd PSV 1Yd P1n# +=ĸ9q@VYH>\J )Yd P⣢9  @|-rYD@V k!NV ?ddCZ95 €l(_ Z+ @|-Byh9q@VYH.)'O{€\(_ D7a@VYH..ddBZHgӍ8 +$B"O[  @2|-$81~  +ɃNq@VYHx\Yd yPc8`'kk!A#Ȑ 6jH`@V;gaB#S?sqAVY.E&j/PC' j=G\HB_z|-Q,b5l-|-$2bMThK\h{(A6qT.SI*Q5\:hp5&, ơ3+ S",FQa5‚}ԏ&+?#*΋GiWt6odcVWAVq@wMRdsYiC p_Rg1o\SGYy\V~#B]b6ޏXeO0K=6U'@e#΄eR_b\codEn,(i1BVNښ[w15RHI&)w lD񚹬#B JEt@lS)b*+0ێ#:m]tI|2L $@ VI::_*">`(@긝Prc{9q5X0 +`/} aƻDblJƒxO' d]Gp FLP\YyP?پ!2}L1ڹ\@O[Np/tsTY<}KY&DBN[dlfz,dcBq`8me?AVn˵){(qa4mAVnڹ d!;t,gm#2Sw1Y)<+2ךF-Omti+'d>PW%qE\Yv!;љN^ aћraAV GZɹeWHi+Wd1 v9m:@XiR߭@<`V5b,Cɿ`hNhRfXŻr}Hs~Z(7saW8`PR|q iJ\;[n/?)~ti$b9|ީi r3Фuݐf1 9WlZ[c/~W\"TLڌ@Jyb{6+-rC)8JBɾS#,s6 u:GDAΕtM-=ƕfiZ[4p 7\e|vhXB:~(SS\D~8f[ a1\Y^lBK8D{1mr+E! t)UK\y@Fߔ*h"P:G)iYulg" _Z) 7'i\{1+Q-lGb#idD\8*Adi0ߢx5-$rng!6֖hџ0 T.iE-; }qYYIn!]p贻^`Fκ6tYH(pک i)z A]4ZJ*&I7oVhF8TGKcub%H59-0A#f=Np|4b`خvꮙѵ ipulic# n_$JU4 l`ҀEЦªc!nNHI/H;jtYp 'Aq&v!TI6i:܂h/kV>աF ZC\"db$St ) ^\.5Yna$bAt9),#Ad6~ဤi5+27F#3 D2$TrZ\M)p6T@oH0O:*D&n9լ|-5~ \E7$f (y!$ V1LTTB-Ek`}'8R uɝ6 @[AwY!53$a7Y;R 1ҙ @ YSJ !p !qf.#r ,G@h̍N5+iڙ劰eV 5Ztk&u@@h'5N5+˥F{H|9>݂:s 1ܩfD{!I8C~!p^dVP =>Yf Yf`V`VY0+0+ff`VYf Ƭ_X`V J$K[5I1)}+ W80K2E1+CzOŬW(( \>^|NHsMfEA!UFe3tbtY$0k2E5+70^<aspbVFq^R M]G&B,zKh *NZWfEs͊Ձ980+#xq 95M(\(\+nݏDa3aKfH_bhV,G| ftL% O̊5/S<cQ-(zy<5rHgL7R%68AG?$1;QhL6qiIҌ:T̊EՁ:k+N`I Ӥ&mf:\ڼɣ>C[_~xĪKz Q@czQ00l$ͰY*baV,G0͊JдN0Vu2O )(.6t~`V4Ȕ:![Þ[75bԪifN9y =T^7h&8Ƈ5I1+:fŢ@qċ߬Mknd/𞡹Wfk:?0+y~zGjEԣ<|􇃬te 5LWy;-" 3 ftf̊Eaeqt:. \Zdi=Cg(3\I(>=W<4BeW%/u}є򩆻$;7Lfوwkx^i 7:O:A .?pH:!j >MQ~;J 6p&7,jaN<7ۧH鹹fEw:3Y1Xb0UVyDhF13+JЬ풠y N v%ة[?~L?ӓft@tsұgǨdtVP.zTlvSԋ<=ޞXNWS>Ua9M|wY7Z kS H(l~:܄qLޔ5bZ&c?N!_tVΆ΄vtFY|pOvtS=2▫-1+әẙP갨8x4!BAYUF54Fj2hn:k_LCN RukIpRD8jLQSY OQs_bG"K ]߉V.z+Z((2]-|3T|[ELMΔ\OGrOEa30n ?ݧwP/iz9> ⎟[eVh:sڱ!:l.saQqphG4 b j0>$hZ'4ꦪf}Qyﾢ산S!tvͣ[/F2Zx΃g+svVzu[mЈWuXtB+yޗ]i ?Mtf3p, |Hi(5# ӹZIrf6Y݃:INOsҏiHZnw[lVә 0]v갨8x4#BA߬*A [YReD_LA רoc[;= nVckpM}^$(9MQ,TW{\*P~U؈S:ǡέG}Ut6A~1ؠ<>@eC%.v"Zy;Mh>Wū~[v:J2]KKt)/ITh́֯ W| \>9"|WsQo3iYgUb}cΩqdBa:WKnTuNNvznH_+T::oyn0]갨8x4#BAݬ*An V5Ⱦ* Hb%kC[3NO+UooIݦwiS!~z*g)Aƴ!h}W1cV[S|i[gaX+|:AH? [Yʺ7Rdjl`eEknՍOx20K1yP3i:y_JfE7ta:.aQqhC4hYUMk\Þ|n~lk',q^TJ{(φ^Q:Qx*24^,zcrˆ]RRN~| r2{)jne3loEEt7љzX:f# BBdBa:Wc{]t[߳EvҴS!VRe!>FzVlu\Ú Einb5c ֎f(l.{s4<,ݚǶvzݬ0btпh`gH}U5Q^-zCVble4_#Nk +(QG7zHeJEw(/uoB138ӯ-_HK3v4KnƓ ͆\zrbzS5>Yyr&%3k}Ǭp갷8LWEAҠfV rk049t!3b3/ܽʸpQʭ~l'y!ԣBJSi Ey<#18JC_,0o3l( ]||z: wTIs%` 0OlOTj2$ =OPoe׶3eFa|5Dh36+~盨M? ?yx=/E 7a*N oыWx20 0,wAͤj-OENƬc+r갷8W5AҠfV rk04AUq_Lυ(fD7+h^f Zp =sB};U[QUoQg~WV .6W~_| 6Q> ~HK6Mno/t3:Ea/=%sOy0֛8,ϢeXڔϙ>x@▞^-Y7yFw?l׫ޞpmxTi@h5m}qv?G&UyQjG&s5㱏2ɥʽug}6Iwěyr Gq{luXT<0 ڽΊ`%ȭd/?)&ԷfD7+\O^b)[}hPHE?6==#O^ CePyWawzT|W% kA xX-y/OEy?UoW>$>ʟ n陦τNô6HφA;N^zk|C4ef8Va:* rP6+JS1 ;v'4J>Q.\vk{;ݚǶvzݬ?IByYߖ#naߌG hScUY:<`)݆ǧ(?؂1Me0V_KGy<Z/i]DL뼣կtO(ب,ypNf8: ӼZ=!<4+| RI4+}ate0[갬8kG4hFJS1 i MҿvsnMc[;=nVo}_vM5S~Rˇ==8NWGO g_oyz0G̎4)JֆXW~~ix $̧=0 vu@:e?sU2 ƢQ^Ȭ׍_ÌfBaZW;K<4flASwQF _q;duXW5#Bqݬ+A> TtZJy`ˏֿvsnMc[;=nV(l+8y|ofΊN|Xwn[jb~kWu$Ò' ZB 8#|Wi(o}rYGeU,YJAA$R y&Dҩ"@qϩf%0Vj1d% n\R^I7sHG7QZ!XBKnA[+lM8y &\p [t}!l&NE* 8d*G+]E),nggkZOd; ^L2 EL`kT~Y|A38F/ m`x  pY ԰no&8(&u?Z及bxy/0V e9FtTM40f%͐a TͽŶWlj06Ue'FL +,>ph/pZ]wBu $v۰m";< Ma&<_ `VJ~s17=eu!&C|хMHFrb,XHHKvU sseaWJNsŻ4΃8axY/Ǭ:ȝ+qEwt,m1]yxwXzW@bYFtY j2N)49'_y6?aq5凭$5;vٻ1?$+}0+[O]%zA̿6Tdҧu1UI~ íKS_ dBiLHpjKV* e3+WoRƶPWJ֍U]Rqsi=cו\כ媣y3B9D߆d9W;w ʍ 廓wG<rY  67s]^blh5ӓ*Lɺ/WǬHU)1e_wœ#-&OYygW\eVJ {WYqW#1 uęk%!1 o?;ޝ\fVhJ%3f4iu4d"ɮoR>; JXd{E7KϬ0WJvm^VtOq^? #da532c bidict-0.24.1/docs/_static/build-bidict-types-diagram000077500000000000000000000024101524342314000224320ustar00rootroot00000000000000#!/bin/bash # # Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. set -euo pipefail log() { echo >&2 " *" "$@" } # Generate a new graph image from its source file if it's been modified. main() { local -r graph_src="bidict-types-diagram.dot" local -r graph_dst="${graph_src%.*}.png" if [[ ! "$(git diff --name-only -- "$graph_src")" ]] && [[ ! "$(git diff --name-only --cached -- "$graph_src")" ]]; then log "$graph_src not modified -> skipping graph update." return 0 fi if ! command -v dot &>/dev/null; then log "'dot' not found -> skipping graph update. Hint: brew install graphviz" return 1 fi if ! dot -v -Tpng -o "$graph_dst" <"$graph_src"; then log "dot exited nonzero." return 1 fi # return 0 if any of the below fail because running dot succeeded, which is the main thing. if ! command -v optipng &>/dev/null; then log "'optipng' not found -> skipping png optimization. Hint: brew install optipng" return 0 fi if ! optipng "$graph_dst"; then log "optipng exited nonzero." return 0 fi } main bidict-0.24.1/docs/_static/custom.js000066400000000000000000000015111524342314000172560ustar00rootroot00000000000000'use strict'; document.addEventListener('DOMContentLoaded', function() { var sidebarUl = document.querySelector('.sidebar-tree > ul'); sidebarUl.insertAdjacentHTML('beforeend', ''); }); document.head.insertAdjacentHTML('beforeend', ` `); bidict-0.24.1/docs/_static/favicon-16x16.png000066400000000000000000000316561524342314000203410ustar00rootroot00000000000000PNG  IHDR(-S cHRMz&u0`:pQ< PLTEA A A@B @ > > A ? ? @1]4hGo8B?8Z ._'/BXYJoz݄HOR ?B uA~3oHB@ =<=5SO26_Z@D M *` [&a;j5C '[!(?BKJH=^[9 ?;voTD@sk9;9˲.!XR5 @R}V=5yAA6*(ka/w ֽ!!'9 ^qz0}QWCmb&9OJ. 463HHf]Wca%u<80ۯ <?U5CD?'~C@QG/t $&9EF ? A@@ A@9bKGD b pHYsodtIME ;wb.nzTXtRaw profile type app11xGb\9EXE-,vRdI̮JkΙ.XLɞe/Ur/)?q1͎[{7|Q oyߞL {~gWBŗHKOX=Ҽ)WzI?Kúz?ȯfZdGg/dy{Z%g=aX5uu:&ߝ5ȤТGRC49ڲ݇g|cƭ'Ozi~0Vo9F1Ťыca~}%lo_Q+{ݵQM\gOێu32>>ߌ++MvϚNraxu;1-co9mW <^ixg18XJm[9>&3_q28ia ?tofv{ՍZBX>b1h֕>DYaXo3ɳwt<giˏF`;n3̴SeO+otqX(kسgrerΞbu+ѝU]Z W0]ye }@A \}m.7O@^lg=NfZ1T%`7 s|G+ԖV߳X]L.^Nҫ ]`ܞFJ #9wˎGKǜM̱&{q?|*鍅Vz:ױ{]6COWgur0?v1" H]Nѵ{<1{-yԙ3Nbz}}Ҽ_荏h:a\<#g>qdC1?mx fȿ"@H.tUb~;7oG \ oDCsC tB$gjE2 6{h6MzKuinw:>;3%,mWLaVx&j8ʙnv;Yu 5kP^VK駌P&g1#cG86R@uX9 n8̰W s\ՈwbOB0vW;[ usʭp386@&uaPǩkal9kB1n9E`Vɹѐ[`Vp ?P1Ɏǭoi1-q?CڦzIFn @tsHR@!N웾BoL!,}Wq>(bZ8ZdF<ȽA+ْ8^x<24_&Խ`(8)j. !VLB%hqL@, phQ(,B~P|A|N΢reBmd]ZT.sFu%~_NZ97c;Gg_/dt~qn>7o&L]tjͿ~o>'&N3yw;^3-0#ZP TmtAH."~tĬG@P;H>aa<Ӫ274N=֊XTTu`f.#qqu2X#K ;jVD3Zun`fo *esv4ZN*jyQζ%By@RE F4/W p 2肅sm00 &qYJsOurᡴ2y+*iA*;FQT. J9om\'h-:I[kd%,KXla8ڇ8/a6a9 !qp$&0r"hTfÆ3"d]eg\k=6,a k9-  SB 3t8jr1qd+WqwQ+5Wiabqv#aAd“m-UW10i{㇧ET#ɣB j^V O` LA#{71PM8aCWx㵷9|BؗfiW 2BZV{E"Jd8>_Ue F^2P^0qpè2KVTt[^3ahX̵x0+Y6 j]ZS)8[Qo9,0Z%:D@I='Pq9p. mݻp%жԫCں' = ^3BPюL DFwf y@ ɕsE^iMRR} g>D׸_5J{֚Fշd1 {dmoǃJhkZ4A4k>ǘ)e:ʘ E[;q&H%,oD+G}w~>SЏM8a >Zqirr0H+F[@d^Xæҭ&ý0g`ˁdot]2UZvrdXtFZ(Q)"oGHvd<+͌ t!*Z / ZSR>i5B%#Qt0- ЗwX.8Ƣ=~!TU>o7I '@@/v`[EWsM͟'U7>J ^ P5\I5@l.&)"&Yay;eb 3F.G  yjz#Xeg,D MBp B@_11!p0;^'t[Va:4'*ȵ-cŲ>pd nJ. !9" *F器 Dn!JLVRjKC}r_9LCB<@+ZrZ!紑f4Q!bP:6DG XXqU8U#3l`-3SՓ u)wW0gΞK Ϗl6p|_̶8hU[lzt y݆ɥDŽH BqxP0La2*UZ-8ܵ ,OK|Ҟ"2w-W/5yS Qb֦/N)#5plϤ`^Xa<W?֥>mTqVZݠyPa/_ ͿӭMNV_MJP/eyi#n_Iz x}^\S৏pHc0ߏ׃axrϣXձ_6a{f#n N)t FEJӖS+d^YޑBI:_*VbT_ NU8N;c]gxOa%X@@ՐfJA,;~9l:Wma3Q D=*h|Ø];>H@)6dVi(K!MȦ' whpH x:Y.>EZ]K:6Ÿ}/^'?$~+2O~/'vI Q5X+GTYnRTb W^!AL)j''}tpawv]>wO c(R'x+OՊAh1F,0vQ>u7m&W9S`]'˯HƼ/R${;X*5>~ -u,wbl-1Ư=ߌyϨf̫P5go <730Y,~@qS R8o8$17Nc] X0 V}hspK{FxD Kņ{Zfj,:X;R' `jBK |0ATh[:*U!Yt0ׂIyMh)'U8UjIfD{D'`B6HOEm *JU?0&-_by@:qlȵ|p{>hDWhx:"ƒ! bKYCsLoq2rP  10x^p". Nyg&^6.VIM9D>=mX, }0 ?qœ XŢJE&S- ޖJLj Pwt>ՅkAN}UhG=|uNgAK&oNh-mqyDYRr@.OuV,gNm]N %Z sVu*#xe#0c`'u@D *Z,Bm*hd@j3Z i 'qug9 ,[hje1ˬD?J HXj=}w?z7⇧2F;?{Y}}|T쯪'5wbpv/MS^߇ >;[̿7>5Ǿjk ";hNBD6ς2 3/B/X^M{9f'ړ49"vsx:MoRNRzE殳]0 ( m7Yrp0F#Q?ȪuLn`/>T0]$AZSG&>y?zA.@Q_o̮5f90a4jk$6ۍ(pc{#1!!suip6d+@3fG){ 4 ``V@" 6{%VG{#{0ﭘc@eajT$Ə7 Z5<I*TuE'M4"nm&TmBFKm0܉5bIWE4C+`Um1t+ 8·Ʈoʑ\M;>`&35Z-HpsiJDdu/l6p#$[Lo:+M [0h` ?E^1CPօU5eeUYMWaԘbe2UE Xu2\a>K^v!aw؅e "vE<[S"3?Om}}6}xgB1_גKF 3*`ZgSͿo|OX2;O{VU SreO;hd:YQu0pI˞,!ZHv`iSB;YW5vh?dgp7 lԢꢳ ׇ4IwMs=bRPK Zr5[YuМf:tTUMCxN J|ڱھ˗0&/@%- 2strKCFĪI˲jvcM:$K?*`xu[0QbXTYeMB9-wPSQBk4n[K IE./uTڂ$H1ZܨRTؾ&eYk1<ݰ*a] 4"eA)sTyyQ mq,Bh :bdEp2da ($;53{R:'mяaDNG0N'ܖN+mQ/݈HXvühy@ ̈ę쨽q$]I mYV]rHEty7p co9rCE؆BLRLPwÑ'I8>H|X2\sM(6tio ݧE>#Pw'ɒdOLw+0o\tǚgcf^6)rfGvÞW&< G&|RL#|8׽8z( '&F[ 3*$uȚ@ZpKݨPy&0҇?'J|y mLމ¶K}" S2O$vz]n5v%ƣ{bKwtf%I: 4$umP}[F:&ã}x6aIXCP:Dڛ1L4J:]*:Ӆeh^Wtv98oY!x7?ƛ|WYm}x"ڭ\KsQ_L*|wܧ2B#~Io'S!tS|L|P{Uu^MUbe 64U~7 g{YO?:+TWYı|zSX$D-b`x , p52[2mF>~gW[xX^ ­55LemEIU.t_*B-x4bN-Q1n axD j7,Hn4 sEO"3u nLQɉĦpU|7ٯfGAhht,:"IqPBO^^EJiFIch\dxCKD" Um^OpUYlfW\v':*^0Ng@'Z- Y!! ¬{pP*e'Rlµ$ϙA|:xX$3T7 ]41NF˶ҽlNW#wƵ( `qS]T /«DGfQ$l)յC=a Hڑ;3C/c>:M'TW& D} G۾Vp</|%,ԙ{nawMc: Y8ȣ}//TU:2xRt "cb[*%#%4cp2!sēlT`l]άUGzF0e] Z?c#ŏ7kM_֨S$}M(Ne Zv=ގYA!'h6u(8s*NrZMᗱnUA ӱ7$ؿ@\QcȤNM]ZudZwv3UQ)Z#2'-հ`뻶]u 5#0nNۀ8ġ#vq $.VcsSk~5'g1{k{-[%MAMBAR⚮#3 ­W&Df`$: Tnk_zTXtRaw profile type exifJLRS3.Ss 3K33 0I1I100J4 6654 b0P2sA #d 4CIDATc````dd`dbbbb&fL&V66v (/"($,"* .!)%-#+'Ơo`hdlbj`naiemckgʐ_PXT\RPV^QYU]S[W?aS2L>csΛ`K8RS.iUVs΄ 01"S_=C%tEXtdate:create2024-01-25T21:10:59+00:00 $%tEXtdate:modify2024-01-25T21:10:59+00:00x tEXtexif:PixelPerUnitX08*tEXtexif:PixelPerUnitY09I@tEXtexif:PixelUnit1eWzTXtRaw profile type iptcx qV((OIR# .c #K D4d#T ˀHJ.tB5IENDB`bidict-0.24.1/docs/_static/favicon-32x32.png000066400000000000000000000335571524342314000203370ustar00rootroot00000000000000PNG  IHDR  cHRMz&u0`:pQ<bKGD pHYsodtIME ;wb.nzTXtRaw profile type app11xGb\9EXE-,vRdI̮JkΙ.XLɞe/Ur/)?q1͎[{7|Q oyߞL {~gWBŗHKOX=Ҽ)WzI?Kúz?ȯfZdGg/dy{Z%g=aX5uu:&ߝ5ȤТGRC49ڲ݇g|cƭ'Ozi~0Vo9F1Ťыca~}%lo_Q+{ݵQM\gOێu32>>ߌ++MvϚNraxu;1-co9mW <^ixg18XJm[9>&3_q28ia ?tofv{ՍZBX>b1h֕>DYaXo3ɳwt<giˏF`;n3̴SeO+otqX(kسgrerΞbu+ѝU]Z W0]ye }@A \}m.7O@^lg=NfZ1T%`7 s|G+ԖV߳X]L.^Nҫ ]`ܞFJ #9wˎGKǜM̱&{q?|*鍅Vz:ױ{]6COWgur0?v1" H]Nѵ{<1{-yԙ3Nbz}}Ҽ_荏h:a\<#g>qdC1?mx fȿ"@H.tUb~;7oG \ oDCsC tB$gjE2 6{h6MzKuinw:>;3%,mWLaVx&j8ʙnv;Yu 5kP^VK駌P&g1#cG86R@uX9 n8̰W s\ՈwbOB0vW;[ usʭp386@&uaPǩkal9kB1n9E`Vɹѐ[`Vp ?P1Ɏǭoi1-q?CڦzIFn @tsHR@!N웾BoL!,}Wq>(bZ8ZdF<ȽA+ْ8^x<24_&Խ`(8)j. !VLB%hqL@, phQ(,B~P|A|N΢reBmd]ZT.sFu%~_NZ97c;Gg_/dt~qn>7o&L]tjͿ~o>'&N3yw;^3-0#ZP TmtAH."~tĬG@P;H>aa<Ӫ274N=֊XTTu`f.#qqu2X#K ;jVD3Zun`fo *esv4ZN*jyQζ%By@RE F4/W p 2肅sm00 &qYJsOurᡴ2y+*iA*;FQT. J9om\'h-:I[kd%,KXla8ڇ8/a6a9 !qp$&0r"hTfÆ3"d]eg\k=6,a k9-  SB 3t8jr1qd+WqwQ+5Wiabqv#aAd“m-UW10i{㇧ET#ɣB j^V O` LA#{71PM8aCWx㵷9|BؗfiW 2BZV{E"Jd8>_Ue F^2P^0qpè2KVTt[^3ahX̵x0+Y6 j]ZS)8[Qo9,0Z%:D@I='Pq9p. mݻp%жԫCں' = ^3BPюL DFwf y@ ɕsE^iMRR} g>D׸_5J{֚Fշd1 {dmoǃJhkZ4A4k>ǘ)e:ʘ E[;q&H%,oD+G}w~>SЏM8a >Zqirr0H+F[@d^Xæҭ&ý0g`ˁdot]2UZvrdXtFZ(Q)"oGHvd<+͌ t!*Z / ZSR>i5B%#Qt0- ЗwX.8Ƣ=~!TU>o7I '@@/v`[EWsM͟'U7>J ^ P5\I5@l.&)"&Yay;eb 3F.G  yjz#Xeg,D MBp B@_11!p0;^'t[Va:4'*ȵ-cŲ>pd nJ. !9" *F器 Dn!JLVRjKC}r_9LCB<@+ZrZ!紑f4Q!bP:6DG XXqU8U#3l`-3SՓ u)wW0gΞK Ϗl6p|_̶8hU[lzt y݆ɥDŽH BqxP0La2*UZ-8ܵ ,OK|Ҟ"2w-W/5yS Qb֦/N)#5plϤ`^Xa<W?֥>mTqVZݠyPa/_ ͿӭMNV_MJP/eyi#n_Iz x}^\S৏pHc0ߏ׃axrϣXձ_6a{f#n N)t FEJӖS+d^YޑBI:_*VbT_ NU8N;c]gxOa%X@@ՐfJA,;~9l:Wma3Q D=*h|Ø];>H@)6dVi(K!MȦ' whpH x:Y.>EZ]K:6Ÿ}/^'?$~+2O~/'vI Q5X+GTYnRTb W^!AL)j''}tpawv]>wO c(R'x+OՊAh1F,0vQ>u7m&W9S`]'˯HƼ/R${;X*5>~ -u,wbl-1Ư=ߌyϨf̫P5go <730Y,~@qS R8o8$17Nc] X0 V}hspK{FxD Kņ{Zfj,:X;R' `jBK |0ATh[:*U!Yt0ׂIyMh)'U8UjIfD{D'`B6HOEm *JU?0&-_by@:qlȵ|p{>hDWhx:"ƒ! bKYCsLoq2rP  10x^p". Nyg&^6.VIM9D>=mX, }0 ?qœ XŢJE&S- ޖJLj Pwt>ՅkAN}UhG=|uNgAK&oNh-mqyDYRr@.OuV,gNm]N %Z sVu*#xe#0c`'u@D *Z,Bm*hd@j3Z i 'qug9 ,[hje1ˬD?J HXj=}w?z7⇧2F;?{Y}}|T쯪'5wbpv/MS^߇ >;[̿7>5Ǿjk ";hNBD6ς2 3/B/X^M{9f'ړ49"vsx:MoRNRzE殳]0 ( m7Yrp0F#Q?ȪuLn`/>T0]$AZSG&>y?zA.@Q_o̮5f90a4jk$6ۍ(pc{#1!!suip6d+@3fG){ 4 ``V@" 6{%VG{#{0ﭘc@eajT$Ə7 Z5<I*TuE'M4"nm&TmBFKm0܉5bIWE4C+`Um1t+ 8·Ʈoʑ\M;>`&35Z-HpsiJDdu/l6p#$[Lo:+M [0h` ?E^1CPօU5eeUYMWaԘbe2UE Xu2\a>K^v!aw؅e "vE<[S"3?Om}}6}xgB1_גKF 3*`ZgSͿo|OX2;O{VU SreO;hd:YQu0pI˞,!ZHv`iSB;YW5vh?dgp7 lԢꢳ ׇ4IwMs=bRPK Zr5[YuМf:tTUMCxN J|ڱھ˗0&/@%- 2strKCFĪI˲jvcM:$K?*`xu[0QbXTYeMB9-wPSQBk4n[K IE./uTڂ$H1ZܨRTؾ&eYk1<ݰ*a] 4"eA)sTyyQ mq,Bh :bdEp2da ($;53{R:'mяaDNG0N'ܖN+mQ/݈HXvühy@ ̈ę쨽q$]I mYV]rHEty7p co9rCE؆BLRLPwÑ'I8>H|X2\sM(6tio ݧE>#Pw'ɒdOLw+0o\tǚgcf^6)rfGvÞW&< G&|RL#|8׽8z( '&F[ 3*$uȚ@ZpKݨPy&0҇?'J|y mLމ¶K}" S2O$vz]n5v%ƣ{bKwtf%I: 4$umP}[F:&ã}x6aIXCP:Dڛ1L4J:]*:Ӆeh^Wtv98oY!x7?ƛ|WYm}x"ڭ\KsQ_L*|wܧ2B#~Io'S!tS|L|P{Uu^MUbe 64U~7 g{YO?:+TWYı|zSX$D-b`x , p52[2mF>~gW[xX^ ­55LemEIU.t_*B-x4bN-Q1n axD j7,Hn4 sEO"3u nLQɉĦpU|7ٯfGAhht,:"IqPBO^^EJiFIch\dxCKD" Um^OpUYlfW\v':*^0Ng@'Z- Y!! ¬{pP*e'Rlµ$ϙA|:xX$3T7 ]41NF˶ҽlNW#wƵ( `qS]T /«DGfQ$l)յC=a Hڑ;3C/c>:M'TW& D} G۾Vp</|%,ԙ{nawMc: Y8ȣ}//TU:2xRt "cb[*%#%4cp2!sēlT`l]άUGzF0e] Z?c#ŏ7kM_֨S$}M(Ne Zv=ގYA!'h6u(8s*NrZMᗱnUA ӱ7$ؿ@\QcȤNM]ZudZwv3UQ)Z#2'-հ`뻶]u 5#0nNۀ8ġ#vq $.VcsSk~5'g1{k{-[%MAMBAR⚮#3 ­W&Df`$: Tnk_zTXtRaw profile type exifJLRS3.Ss 3K33 0I1I100J4 6654 b0P2sA #d 4CIDATHǵVklT}ך58$S84M򀤐UڪUҦ$?*IRURT%QD -J Uy`ڰݻ]lU%z{{c朏^0 |}}KKUa ՟+̘E:s"".ӜLD _=l8ՐTsSѻk+K `{}L39ʮTAM-r"@\*3jP݈86\.*tyj 0!lC߭k/-|rʅ@ p\G6ěѨJOsz"HtXׂ?{onvf[&n0RݢuG#kOLJs:͊w5'&JВ.fXhO@2SL2yxiN^Oϑeq}c15Uo ZTGKoD:&ơ=%}W4J ]wyS1wY!15*d=ؒ_J!1h{wj3l})H@ "B,3xuV b0kbcoljA4?|{͞"h9"dNBid;Jm{z^z&e\Gu|!`L1#VJ aۧpGJt/ <_>a5IH2o)ep\ C>0p81ft4R{]S.&Ry/L^}7;OjG_Gc["";SI tj~k~KY=.\0I /?vJNMZ ޷79vGFM].=Y+'CNTLcϏ:&=3$2A} џ Q)Whs.7RNN7"ȶzyo@9$OC=f%rdOR kwlz8UqA>|[<׶g_VwwXB@R%ަVk!.fwaK6u+MWL7%Kb"ɳ`vRﲢ"kA&SmMVn $Inhl5OC@~ `(94trc = < = = < < < < > ? @ A A A A A A A A @ ? > > ? ? @ @ @ @ ? ? ? ? @@A A A ? @@@A@? < D\u"%&%&~&|%lR? > @ A A A A A @ ? > = ; 8>B6Q[7T^6T^6T^6S^5S^6NW;77=? ? ? @ A A ? @@AA> Ar"<LQRRRRRRPH3Y= ? A A A A @ > ;".l 3Ub>> ? @ A ? @@A ? G5TYXXXXXYXXXYYMr#= ? A A @ > 933&= ? ? A ? @@@ B8]^^__________^_Vi!< @ @ > ;%"#=? @ ? @@> w'`dddeefggggfeeeefNI> ? >&t(_p> ? ? @?FOmkllllbSQQUgmmmmmks)< ? 9%" 9? ? @?\ittttudk%EEEH1mvuuuwA= @ 1EI%k{:;;=8)$/AE@ ? ?= l'w}}}|}E< ? A A @ EZ~~~M= ? -U[:> ? ? ? @ .MS(Zc@ ? @= m*A< ? @ ? > CaM= ? 1OR9> ? ? ? ?/QX )\c@ ? @>`#^AMTSTB~9< ? 93.!+jv= ;6 5279!0GJ? ? @?Jut5s"IazՀQ> ? >4*((&#'p5''%^q!:% ? ? @@> GCy'Cc@> @ @ @ >50:630.+$#/NW,FR ))(4}> ? ? @@?Jlvy9,Lo KA@ A A A @ ?>:C?;973.''0BH(Qb+7>%> @ ? @@A? Nap t4/CJb+> ? @ A A A @ > >"ClmGE@>;91()|0>E"^y >0,@ @ A ? @@A A ? @h2t  l :CR X= @ A A @? <"t%i9??Gz|KHDB?;2(*l}09A;? ?A A ? AAA A > y8f:r=  g'= @A A @ ? :+/*-`m=B?KOMHDA;/%0DO? ? A A ? @@A > e+o z8wE L : = ? @ ? ?5DJ6II=12W]AIEPRKGE@7(3?D? @ A ? @@@Cq  b T|OĤ -'! "#l~=x8L< /BG-OU2lwLWZ\ZK64NQC\[ROJHD;/<> @ ? A@> [&  V :Ml/ ]#ʷDX^a^URHp9<'"Yosz~gKosFNKUOMJE;;B?> @ ? @@= t?   Ɛ Ja l'[? J c;%hB+hA+hA*hB)iB)e<%HAT5*[A6\A6\A6[A7ZA6Z@6Z@6Z@6Z@6YA8P80?KOPOLE?ln? @ ? @@= O  o < > ? ? A @ ? > > ? > > ? A @ ? > > > > > > > > > = > > AZ[ESVUOC> @? @@= }M B= ? ? ? ? @ @ A A A A A A A A A A A A @ ? ? ? ? ? ? = 8v7[`_ZIyz> @? @@> f7  SYRRRRH> ? A A A A A A A @ @ @? > : 76665#*W`?kjhbIWT? @ ? @@@I˰ '##$ ߂r@D< = = > ?@@ @ ? ? = *IO5lvusgC'? A ? @@@> |X1/,,..++,//(Z p;p<p;`+A>7'#3??3@?3?=/\c3Q`a_`al}~Zvt? @ A ? @@@@C$DA<::;:955=:3555._- =EQTT_ÃxvpC? A A ? @@@@?Fz/[`ZVTSRAAUVs'? @AN GAH!BBA _RJwF? @ A A ? A@@A A@Af?Sx}II ? A A @ @ A @ A A A CtibͺۑbQHB? @ A A A ? @@@AA A A ? @R%gA,tP9uR;tR;uS @ A A A A A ? @@AA A A A A A @ > = = = = > ? A A A A A A A A A A A A A A @ > > > > > > @ @ A A A A A A A ? @@A A A BA A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A BBA A A ? @ABA A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A BBAAA ? @AAA A BA A A A BA A A A A A A A A A A A A A A A A A A A A A A A BA A A A A BBBAA A ? AAABBBBBA BBA A A A A A A A A A A A A A A A A A A A A A A A A A A A A A AABB A A ? AABBBBBBBA BBA A BBAAA A BA A A A A A A A A A A A A A A A BBBA ABBBBA ? @ABBBBAAAA BBBA BBBBBA A A A A A A A A A A A A A A A A A BA A A A BA BBA ? @AABBBABBBBBBA BBBBBBBBAA A A A BA A A ABBA A A A A A A A BA AAA @ AAAABBA BBBBBBA AABBBBBAAA A A A AA AA@ABA A BBBA A A BA A@@A A A A A A A A A A A A A A A A A A A A A A A A A A A @ @ A A A @ A A A A A A A A A A A A A @ @ A ( @ ? @ A A A A A A A A A A A A A A A A A A A A A A A A A A A A A @ @A A A AA A A A A A A A A A A A A A A A A A A A A A A A A A @ @@A A AA A A A A A A A A A A A A A A A A A A A A A A A A A @ @@A A A A A A A A A A A A A A A A A A A A A A A A A A A A A @ AAA A A A A A A A A A A A A A A A A A A A A A A A A A A A A @ @AA A ? = > > > > = = ? A A A A A A @ ? ? @ A A @ @ @ @ A A @ @@@> P~%13331'S> @ A A @ ? ; 0O[(n(t(t's(p/Ve;&"? @ A @ @@? t#HUWXXXWVKz&? @ A ? 5@F0Q]?@ @ @> m"W``abbba`aZq%= @ 701 0KU? @ ?GNkjjhYUWfkklPE? {:? >]lwvvJMIK;uxxlW; w:; <%ix1:;@ = d%|{2; = : g&~xX: /MT?? @3?B /GI@ >XQS}*9irH>, $8#3+,(J[553? ?CgL<c?> @ =?=51-(&*dsr #&-= ? @? ]&ͅzFHsՈ KB@ A @ @IFA>:4.+(bt+=?<@ @ @A ? Scߡ y FFd#= A A @ 7&%.fv?yGE@:1,%^u5/3@ A @ @A @ ?lR t  R ; ? @ ?4S]236qzEMJC:.2S\? A @ @? [%u F ## #r8U;6AB r WA H@ AEFFFCBEEEDDDDABMLKTQF?@ @> sjD@ @ @ = @ A A A A A @ @ ? > = > <1muDc`N? @ @= xN$!xghc=D> > ? @ ? > <,IN +csnOec? @ @@ I%500.-..$tWV[(<"\^?v}PacgjzpD @ @ @@> W, G> ? @ A @ @ Cqd\Ť”pldI!? A A @ @@A A A > BH I I F? @ A A A A A A A @ EH H G B? @ A A A @ @AA A A A A A A A A A A A A A A A A A A A A A A A A A BAA @ @AA A A A A A A A A A A A A A A A A A A A A A A A A A BBA @ AABBBABA A A A A A A A A A A A A A A A A A A A A BBA @ ABBBAABBA BBBA A A A A A A A A A A A A BA A BBB@ @ABBBBBBBBBBBBAAA A A A AAA A A A A A B AA@ AA A A A A A A A A A A A A A A A A A A AAA A A A A A A A @@ ( HQu%Uؑ 364wog_5v;A DROH!I]1G``9B> ? j;> ? A CB['EFE T wJ<58Vq2OSH؎08<> o<zZKH`* ~A} F?C@@oGD !.JO_. a&߳T5+R(MovS*? @ A @9[^C= MJYXCa9ks 9&$?(!=~'?}0@A B5=<\id@</GQȓh4?Zy5[ AB@φ9JeOEco35RXH&bmfWd`> ڻ8? W@ ^ A @WBD 6AA.u ] tTUO=9'!qkc;B/'? @ */akA 6@oz? Qcd!"TP>xx a <q`Tm:S]3Z-v\il)0bW8k{DAeI6o(_~zsJ%B ,L$[.YyGn ^2|+RO@7K4tF&hV9wC 5=Ug*rj?';1EX Ncp/Mfu#}HdOOfdfdfdfdddddcbidict-0.24.1/docs/_static/mstile-150x150.png000066400000000000000000000406071524342314000203430ustar00rootroot00000000000000PNG  IHDRxgAMA a cHRMz&u0`:pQ<bKGDtIME ;wb@(IDATxyeUy{(F@!JcPTc4&w%{Gxt&:bLA$HSPP@}k1WާFꜽW3:k~70 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 xvgud2-?%U}^"<nQ{'}}DU-^44{o &8MU~ruiGv4qiT!tN "z>yC[Ծ=!YKhWu P&4 1cLXCY%~~(w#99q8gy7 +,q鹎* ɂUÿQ|1y׾6Aka؃Ǐ7-:5;J˨gsY/pwmO*X,Y>*q/qYT9m7L8X=>e9Lp$Rg)u3KTΖW<#1=[U&\7&8|XJiw DG.G5;,poO*3=J{Ω9\?&8$0永6 GEBQC\~ w. q;AՃDNq!_$CT7UӶIDZ+ؓ Y;C˜Xx٩;I劔4 9a|0ǞN?u'͊+XbF=\kVHs S&ql|r;XܑrNL 㼗^Vרg7XbUhڵ3yͬlZ1Z? # ÍTA zK00u=ӳ(ul' >~-\STcp^HI܎/mXa/q|_Gw·b]<y,hdj6tszS;T^+?񯹈dtWE ywGP˧x]w?غU8tZDjZ7k4Ucs׳R,=~."sYyKւ ix?`;Ga` J+)[3ՉTH ?}ggϞ:#T8Ǣh K{TaSFxϽ|֮"Q%!Th-GPq _1Rg>N[8W1+§fWǯ%؁v j}Hc:[5'7 4woC}'o5wnu4"NJ{z1p0s ^AjWnz?w]Hn i&8El79O K}Z=9˜wњcFYfD70Kycww>4'y+bUl4h)Th2_>]|;6 _uƣ֌366ԁ|αL0==KGRXz\~Z~CgWD~` dhOǃGO.\a@@疙21J mkqik,RU"$$)i(Z;6n_'yiԙV+xUNU;%崙hz;yOc|3n3 i x}an'ȆpԲA~7^q I4[,]z&7{($p1<sv"Nr6 1zVfYQN{_RQݟg\ B貀{)k9 KU=ܻM[ZWЖ"<;=[$C0-Bҙd InxDVm~띻檝Xሢ:"ŕC{N-?\4صo Mx[ӦThQL} \J|ED$NBfe(33 6);$ķYuP69m )t3ɽ[LԫSY1Rl? ёcW|hkOY4V+l! pdtwhjZdOxjlʲjg?LΆ,>䠘3Ux n8~VBysqR .[˒(e7of=~1uuv| Oږ84GHZdd/:jmd~@C_׾)z&8@1#srbW &ЀRDgsV rބ]{&7>L .~;~d#Lٷ\b9-{"oW5~m8)4m/}VnrH߇n}0rϢr"g,[C9?} _0a0&8Utz=c%qAPd,TUqD.ajg =p dn #bڡNKb^8ɻ7?fOd7#}hVյ"mkW\p4'et(AsBj"Lmm<A݂O!/GĥGo}(n/3Mg隔88Lp,J5.}/ wq$pp/MP̟HI;?MMpƋjdtê/hV/G68lƂ!j'd:Fѧ:wo!캄-[lh%HR]kYyJ)\@| #ApC৑d6I'&滴9ḈZLPq,|!D1xQ'l4aA=>V! SމW)+',Ylɢ(౧{WOBHbm"4 ݡrj8e o(~V?٘8D9qH/O B+❠3IvmN(4zQ+7ZŸ"tm kV1W BçieCpOS^$az4I\ 4^:<8ȩr% Cġx4"XDQ|p &8@t5gi82TôyG*`2C}]rBaؾ:ׂw%X|wFA*9NծeQyB^ߦ m"J)kn@,×Vɂ!*3I0Sǡ`c ]93 :΃Hҗ!y{84${P;T']3PNL|C4 ?زsL._~N.f1T͉y; Eߗϕq)<6w`^0c'ei8صKh6-&pX9/fǷ*B{.t^/L$R[FӜE.ڭ·Ѩ4F,%Np>qUCCCDQT$oR APMYe-ShǞSQ/B_@=j1-7 ۬2RS^;FU>МMmǨW^vVsNK hZX2y& Y 6zZm)Ж1pDHF <2,AM'GgS?~Oww6T!Tjs NJuy/gkjy{!t*ef@ܑj5 O| xU>{Ss5Be&R,H%4Thiw-O=كH9HD $F}wΙj&i ؍=NH~r#z)*iU\h_ Z[G{&LD={#ٿ AYq*^K9孯v)!=Gݠ%^6't|wsDh=B4|P(à6ǑAA -ƶG/ xGy%PЪ *hUEDEIٹC!;+9 K[`E. ځfAʲ 1's~I>~q_ ;7Dq&,P(5Qs>v Z̈́v|CIeǃJ2S2<ȮD? Å$qu5xj%fR(Ȭ~Gţ$;#;Ghre|Ch2gF^9Ric^x|cJt- `, !Z4Qve 1k֑~YJ)*k&E~9}W$a797Sc970p<] cB^oT Bәv.Q<3O|d[waoZM[7=&ʡ$>LG .dj:vRcld ZVy^~t/i6?^W_YcE/o??6S kNTH;*>ڸE3i_6||ZzCxx+hdH zbYɠ4wO魍U87 C$y8͏Ѹ嫸yOxADkP|JԚ< 5yCoc4Hii6),3RS۩tٿQj Cˡy8T&Svs )і'+AibE#'EvO`,;ZE3"&4*3>Gi3:kNg_;JMk'ƒG߽qdxQ8ZnVk{h=w+n/> Ϻcj\QaN;Vi>DOD_L *WaĄ 0o?ZFui %PtT1POu ׽'SOm4wӺFrO!QS jz%bEHej+ZZIEΊ:ħbYIuha`jotv_-#=~&rr%1oz}1!h>PݾGPQ>1ՇG9jW)5B}L B ds)ed~ 4`ٿH\=OueBP0{wBU˽8ǩCpܩy 3@{?DB.]X-^zUO.BKAHHgO"UH<6ʞnʣ>];PbE.5R߅25=sV(" )t.Y 7O~/8^wxScL6iV>h͢&B5ZH}o;[Y8tLp,dnd{'/jg4?}hqиr^]GKM4HP~tY.UΊ' p4AaA]'{2ؾ~Nq!MUAWZG[{T|{O޸{6ъ_7lPIR1lvYBBteӣ1raOu0FJaTNH?N|gx2ec H2 yR 03?򘫤+i@SXѵ@Hcdt28Ltm伃ˮ}Q=bf;GGFN#%GKW3-*TVhiމF<0 ,_w(wm:pgi4&8D> n|+.½ SHZZăΪW")wipDqlx-_y'H}xܺg#NI`Ӓ)"[Gy˹Խ^aJBZ:ŷǿ<7fLA%/c: :K4 ܫ-:(L8dtz/]3ϥ@Gc^\LڌTFj(Ѷ`I?̕e!C3Hv?߷12X~r` VqyɞI}1s3=KƘVIHO+.}kWplyx.:{7'?#![\*8`$&UqϙxHZ?HWD2>UdzwY!݃q -7oz"s/C^;reB4KDcꏐ|Is*F ?,Yi٠$q5] ^~Wk :RZPWit4nkg!NZ佗]S856qc̗^,i[L8d}s_oѭ}xZKwr}he&FG+Vvd?P=Ƌ 9~60&UqAD/' }4^o$B lQ&tD0t|uU&H<|EGL7WGfAQ8\@n>Go'Y$ߪ/?ǯgTg(R;|"MZFytj(ꚸIllFWG!q6=|n. c'PY'$Ɔ1\>lMǎvkr|oqǏj!ʕYr_``6θvJf!r4g;<8!(RV_ h1!,yVdC ZQE]Mi}r.)[LW4C|K^z)zC>̱91Y"sϒ2KZlZNM#BHe/O :C\fd`d+YA$[|d%>PO+mmB%O Cm.8{ӛo3r,3\p4d!h C@&AH|GdS?Ohrډ{ 8k.<3"3ket8al1Aޡ &hº kHm;4NٽWdg{li]=71Į(򝭵^3lXJ5L۠#+eg=e]@hm ڠ1m1>&ac r`)$T{n%BS~dk1L$ [LLj-Kv* #1# oU!4DW*ΝK?~:L (/#m M? S8s)%en Sʣj +fBI@j5i(_R(Vsl]-ڝx lfAv\$JH=Z@_X0*U)M+q/`y-:4- Jgv ])Rg| [q#%"JJv}m?H|YvL7芴( Yo()Se⒉&,FYBJ .K,@DZ'QkTD hzN9h(*}a ";a!" >Ds!N$5 RjKg:0>SB Qg6>Ҧt9= ś)I IcLp,\XT<2/LW<gU~Wtܲ[E]3DէFB%%(NqIKz(8K-P<;MU$u*k9mTq>70I5 9׎$Q$D+d?{FN .csꑱ5S^zɖ/]=`洦*w*e  g٨i!aÖ]WNQs"$V TRU^rJ7@pzEŎwڜ)w6uul4ͪġ{6!9&i~;%CD/I_$3S!K(LW"/x$]ޣϛ nv?,2Hɭ ⶣF-kHsInTF(>dԅ53,SYvht"ZD0V A4BbR^vZ 5˩GO1֘Fb#:gv Q'E9HLp,)fw/p֓JeTBᵆk) tH,(2QJ)Mw&Cwco`瞶;$v,uzLEhT~ԘU-NZ'gU? B/V?x\.2r9Ttd烸g~>Ԏ]%_PSMBU42 Z>O)p#:3Hc/:¶cAKIa]hIױŲ1mc4ے'A}'"۽$)ڔ =hrSc8x DIy^sI-I'/lTH$IM-H= mO28PE+-" ^K[~, [>!NktnfT&%RێSH+kc{, % WJӰG;略P 3ɴTkc/OΕ-3U:bv>i*"[/uݙm!.툰896RIYd?DcÖ&mv-g, PI.VǷIh&f,H<*\&nӹ_DZ=LMN}(w/4Uu=[0*T=c>kM˹f."ϵ]즙d 3AT17$Юta*Q5eQXU?\)g'V%˗˓ IJ6GvhT%L.D:7slq} ˍdC)z ՗-n&MmōGlŽ,#We+9Ut: W4B+;:kF; .#qZ*L ySVsI$I;2y{n)_[{R#$'oz0٤tFz?d?yXE "Mȁc,i5!!"9¢%j  ~!P2AQ>oKkq~7Ii},C{ ӉIO\G"TPvpf%H SLty:7]jLZ>O {&I Wkj&8 2燊ތ1B!E*ѱIkeB9wQ4!s?'H|OeY})߫ص?{[}}\dhV:6Ɨ| hƜt \seodSVlԇc+H=JIxQ!&u{(AnrYs?ǂY^g#U6iv1#q0p\Xq:r"R@]޹#s͑^qFa}n|Xc虧 % ٚŵ'HXq}\ya9'Njh?,"3EBe=J5'~dpۃ\f^FLp,=%8:u,1U%1EM D %2x4n`ڿ !,ERr3U][܁NmOmAgwE sPJM;ښ}'0]~֭N?ƋvUȠ[O'>X+Ni'ʞ'6 = >mg8̒N"ϫVBY@A;}3œQ WRD'˻FY u*mJ{,/8-DKP- UeK4O=wAUևp&8͎=m7 :7|e\GsԊçe  6s{/Z]PJ|7=v@>z̢I# ߨfdcQt\cl鵸gqJv{Hcc!-*߁,BkudϟUգ,I@  (7E]yqrO̽0XhKJ2j^4Y4sVa0cHY`eK0^`ƱhzIAlnㅅi W鍚a0cAL(F'&8Bݼ 3_3&8 Created by potrace 1.14, written by Peter Selinger 2001-2017 bidict-0.24.1/docs/_static/site.webmanifest000066400000000000000000000006521524342314000206050ustar00rootroot00000000000000{ "name": "", "short_name": "", "icons": [ { "src": "/android-chrome-192x192.png", "sizes": "192x192", "type": "image/png" }, { "src": "/android-chrome-512x512.png", "sizes": "512x512", "type": "image/png" } ], "theme_color": "#ffffff", "background_color": "#ffffff", "display": "standalone" } bidict-0.24.1/docs/addendum.rst000066400000000000000000000207361524342314000163050ustar00rootroot00000000000000Addendum ======== Performance ----------- Bidict is written to be as performant as possible without sacrificing other important goals, such as safety, portability, and maintainability. In general, using a bidict to maintain a bidirectional mapping should exhibit about the same performance as keeping two mutually-inverse one-directional mappings in sync manually. The test suite includes benchmarks so that bidict's performance can be continuously measured and improved. If you spot an opportunity to improve bidict's performance further, please don't hesitate to :doc:`file an issue or submit a pull request `. ``bidict`` Avoids Reference Cycles ---------------------------------- A careful reader might notice the following... .. doctest:: >>> fwd = bidict(one=1) >>> inv = fwd.inverse >>> inv.inverse is fwd True ...and worry that a :class:`~bidict.bidict` and its inverse create a reference cycle. If this were true, in CPython this would mean that the memory for a :class:`~bidict.bidict` could not be immediately reclaimed when you retained no more references to it, but rather would have to wait for the next garbage collection to kick in before it could be reclaimed. However, :class:`~bidict.bidict`\s use a :class:`weakref.ref` to store the inverse reference in one direction, avoiding the strong reference cycle. As a result, when you no longer retain any references to a :class:`~bidict.bidict` you create, you can be sure that its refcount in CPython drops to zero, and that its memory will therefore be reclaimed immediately. .. note:: In PyPy this does not occur, as PyPy doesn't use reference counts. The memory for unreferenced objects in PyPy is only reclaimed when GC kicks in, which is unpredictable. Terminology ----------- - It's intentional that the term "inverse" is used rather than "reverse". Consider a collection of *(k, v)* pairs. Taking the reverse of the collection can only be done if it is ordered, and (as you'd expect) reverses the order of the pairs in the collection. But each original *(k, v)* pair remains in the resulting collection. By contrast, taking the inverse of such a collection neither requires the collection to be ordered nor guarantees any ordering in the result, but rather just replaces every *(k, v)* pair with the inverse pair *(v, k)*. - "keys" and "values" could perhaps more properly be called "primary keys" and "secondary keys" (as in a database), or even "forward keys" and "inverse keys", respectively. :mod:`bidict` sticks with the terms "keys" and "values" for the sake of familiarity and to avoid potential confusion, but technically values are also keys themselves. Concretely, this allows :class:`~bidict.bidict`\s to return a set-like (*dict_keys*) object for :meth:`~bidict.BidictBase.values`, rather than a non-set-like *dict_values* object. Missing ``bidict``\s in the Standard Library -------------------------------------------- The Python standard library actually contains some examples where :class:`~bidict.bidict`\s could be used for fun and profit (depending on your ideas of fun and profit): - The :mod:`logging` module contains a private ``_levelToName`` dict which maps integer levels like *10* to their string names like *DEBUG*. If I had a nickel for every time I wanted that exposed in a bidirectional map (and as a public attribute, no less), I bet I could afford some better turns of phrase. - The :mod:`dis` module maintains a mapping from opnames to opcodes ``dis.opmap`` and a separate list of opnames indexed by opcode ``dis.opnames``. These could be combined into a single bidict. - The :mod:`html.entities` module maintains separate ``html.entities.name2codepoint`` and ``html.entities.codepoint2name`` dicts. These could be combined into a single bidict. Caveats ------- Non-Atomic Mutation ^^^^^^^^^^^^^^^^^^^ As with built-in dicts, mutating operations on a :class:`~bidict.bidict` are not atomic. If you need to mutate the same :class:`~bidict.bidict` from different threads, use a `synchronization primitive `__ to coordinate access. [#]_ .. [#] *See also:* [`2 `__], [`3 `__] Equivalent but distinct :class:`~collections.abc.Hashable`\s ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Consider the following: .. doctest:: >>> d = {1: int, 1.0: float} How many items do you expect *d* to contain? The actual result might surprise you: .. doctest:: >>> len(d) 1 And similarly, .. doctest:: >>> {1: int, 1.0: float, 1+0j: complex, True: bool} {1: } >>> 1+0j in {True} True (Note that ``1 == 1.0 == 1+0j == True``.) This illustrates that a mapping cannot contain two items with equivalent but distinct keys (and likewise a set cannot contain two equivalent but distinct elements). If an object that is being looked up in a set or mapping is equal to a contained object, the contained object will be found, even if it is distinct. With a :class:`~bidict.bidict`, since values function as keys in the inverse mapping, this behavior occurs in the inverse direction too. That puts a :class:`~bidict.bidict` between two of :class:`dict`'s conventions, which conflict once a value is also a key: overwriting a :class:`dict` key keeps the key object already contained, but replaces the value object with the one passed in. A :class:`~bidict.bidict` resolves this by keeping the object already contained in both directions, so that a single item is never represented by two equivalent but distinct objects: .. doctest:: >>> b = bidict({'false': 0}) >>> b.forceput('FALSE', False) >>> b # the contained 0 is kept, rather than the equivalent False passed in bidict({'FALSE': 0}) >>> b.inverse bidict({0: 'FALSE'}) >>> b.inverse[b['FALSE']] is next(iter(b)) # one object per item, in both directions True *nan* as a Key ^^^^^^^^^^^^^^ In CPython, *nan* is especially tricky when used as a dictionary key: .. doctest:: >>> d = {float('nan'): 'nan'} >>> d {nan: 'nan'} >>> d[float('nan')] # doctest: +SKIP Traceback (most recent call last): ... KeyError: nan >>> d[float('nan')] = 'not overwritten' >>> d # doctest: +SKIP {nan: 'nan', nan: 'not overwritten'} In other Python implementations such as PyPy, *nan* behaves just like any other dictionary key. But in CPython, beware of this unexpected behavior, which applies to :class:`~bidict.bidict`\s too. :mod:`bidict` contains no special-case logic for dealing with *nan* as a key, so bidict's behavior will match :class:`dict`'s on whatever runtime you're using. Note that even though *nan* is not equal to itself, re-inserting an already-contained item using the same *nan* object is still construed as a no-op (see :ref:`basic-usage:Key and Value Duplication`): .. doctest:: >>> b = bidict() >>> nan = float('nan') >>> b[nan] = 'nan' >>> b[nan] = 'nan' # no-op >>> b bidict({nan: 'nan'}) See e.g. `these docs `__ for more info (search the page for "nan"). Simultaneous Assignment ^^^^^^^^^^^^^^^^^^^^^^^ :class:`~bidict.bidict`\s may behave differently from dicts with respect to so-called "simultaneous assignment". Consider the following: .. doctest:: >>> m = {'a': 'a', 'b': 'b'} >>> m['a'], m['b'] = m['b'], m['a'] # swap two values >>> m {'a': 'b', 'b': 'a'} With a :class:`~bidict.bidict`, simultaneous assignment cannot be used to swap two values in this way: .. doctest:: >>> m = bidict({'a': 'a', 'b': 'b'}) >>> m['a'], m['b'] = m['b'], m['a'] Traceback (most recent call last): ... bidict.KeyAndValueDuplicationError: ('a', 'b') This is because "simultaneous" assignments like the above are `by definition `__ just syntax sugar for: .. code-block:: python # desugaring: m['a'], m['b'] = m['b'], m['a'] tmp = (m['b'], m['a']) m['a'] = tmp[0] m['b'] = tmp[1] and so the intermediate ``m['a'] = tmp[0]`` assignment raises :class:`~bidict.KeyAndValueDuplicationError` before the second half of the swap assignment has a chance to run. For a working alternative, you can write: .. doctest:: >>> m.forceupdate({m['a']: m['b'], m['b']: m['a']}) >>> m bidict({'a': 'b', 'b': 'a'}) ---- For more in this vein, check out :doc:`learning-from-bidict`. bidict-0.24.1/docs/api.rst000066400000000000000000000010331524342314000152620ustar00rootroot00000000000000API === This page contains auto-generated documentation from the bidict source code. bidict ------ .. automodule:: bidict :members: :imported-members: :member-order: bysource :special-members: :show-inheritance: :undoc-members: .. autoattribute:: bidict.BidictBase._fwdm_cls .. autoattribute:: bidict.BidictBase._invm_cls .. autodata:: bidict.RAISE .. autodata:: bidict.DROP_OLD .. autodata:: bidict.DROP_NEW .. autodata:: bidict.ON_DUP_DEFAULT .. autodata:: bidict.ON_DUP_RAISE .. autodata:: bidict.ON_DUP_DROP_OLD bidict-0.24.1/docs/basic-usage.rst000066400000000000000000000312471524342314000167060ustar00rootroot00000000000000Basic Usage ----------- Let's return to the example from the :doc:`intro`: .. doctest:: >>> element_by_symbol = bidict(H='hydrogen') As we saw, this behaves just like a dict, but maintains a special :attr:`~bidict.BidictBase.inverse` attribute giving access to inverse items: .. doctest:: >>> element_by_symbol.inverse bidict({'hydrogen': 'H'}) >>> element_by_symbol.inverse['helium'] = 'He' >>> element_by_symbol bidict({'H': 'hydrogen', 'He': 'helium'}) >>> del element_by_symbol.inverse['hydrogen'] >>> element_by_symbol bidict({'He': 'helium'}) Note you can also use :attr:`~bidict.BidictBase.inv` as a shortcut for :attr:`~bidict.BidictBase.inverse`: .. doctest:: >>> element_by_symbol.inv bidict({'helium': 'He'}) Both a :class:`bidict.bidict` and its inverse support the entire :class:`collections.abc.MutableMapping` interface: .. doctest:: >>> 'C' in element_by_symbol False >>> element_by_symbol.get('C', 'missing') 'missing' >>> element_by_symbol.pop('He') 'helium' >>> element_by_symbol bidict() >>> element_by_symbol.update(Hg='mercury') >>> element_by_symbol bidict({'Hg': 'mercury'}) >>> 'mercury' in element_by_symbol.inverse True >>> element_by_symbol.inverse.pop('mercury') 'Hg' The inverse is automatically kept up-to-date. Referencing a :class:`~bidict.bidict`'s inverse is always a constant-time operation; the inverse is not computed on demand. Values Must Be Hashable +++++++++++++++++++++++ Because you must be able to look up keys by value as well as values by key, values must also be hashable. Attempting to insert an unhashable value will result in an error: .. doctest:: >>> anagrams_by_alphagram = dict(opt=['opt', 'pot', 'top']) >>> bidict(anagrams_by_alphagram) Traceback (most recent call last): ... TypeError: ... So in this example, using a tuple or a frozenset instead of a list would do the trick: .. doctest:: >>> bidict(opt=('opt', 'pot', 'top')) bidict({'opt': ('opt', 'pot', 'top')}) Values Must Be Unique +++++++++++++++++++++ As we know, in a bidirectional map, not only must keys be unique, but values must be unique as well. This has immediate implications for :mod:`bidict`'s API. Consider the following: .. doctest:: >>> b = bidict({'one': 1}) >>> b['two'] = 1 # doctest: +SKIP What should happen next? If the bidict allowed this to succeed, because of the uniqueness-of-values constraint, it would silently clobber the existing item, resulting in: .. doctest:: >>> b # doctest: +SKIP bidict({'two': 1}) This could result in surprises or problems down the line. Instead, bidict raises a :class:`~bidict.ValueDuplicationError` so you have an opportunity to catch this early and resolve the conflict before it causes problems later on: .. doctest:: >>> b['two'] = 1 Traceback (most recent call last): ... bidict.ValueDuplicationError: 1 The purpose of this is to be more in line with the `Zen of Python `__, which advises, | *Errors should never pass silently.* | *Unless explicitly silenced.* So if you really just want to clobber any existing items, all you have to do is say so explicitly: .. doctest:: >>> b.forceput('two', 1) >>> b bidict({'two': 1}) Similarly, initializations and :meth:`~bidict.MutableBidict.update` calls that would overwrite the key of an existing value raise an exception too: .. doctest:: >>> bidict({'one': 1, 'uno': 1}) Traceback (most recent call last): ... bidict.ValueDuplicationError: 1 >>> b = bidict({'one': 1}) >>> b.update({'uno': 1}) Traceback (most recent call last): ... bidict.ValueDuplicationError: 1 >>> b bidict({'one': 1}) Setting an existing key to a new value does *not* cause an error, and is considered an intentional overwrite of the value associated with the existing key, in keeping with dict's behavior: .. doctest:: >>> b = bidict({'one': 1}) >>> b['one'] = 2 # succeeds >>> b bidict({'one': 2}) >>> b.update([('one', 3), ('one', 4), ('one', 5)]) >>> b bidict({'one': 5}) In summary, when attempting to insert an item whose key duplicates an existing item's, :class:`~bidict.bidict`'s default behavior is to allow the insertion, overwriting the existing item with the new one. When attempting to insert an item whose value duplicates an existing item's, :class:`~bidict.bidict`'s default behavior is to raise. This design naturally falls out of the behavior of Python's built-in dict, and protects against unexpected data loss. One set of alternatives to this behavior is provided by :meth:`~bidict.MutableBidict.forceput` (mentioned above) and :meth:`~bidict.MutableBidict.forceupdate`, which allow you to explicitly overwrite existing keys and values: .. doctest:: >>> b = bidict({'one': 1}) >>> b.forceput('two', 1) >>> b bidict({'two': 1}) >>> b.forceupdate([('three', 1), ('four', 1)]) >>> b bidict({'four': 1}) For even more control, you can use :meth:`~bidict.MutableBidict.put` and :meth:`~bidict.MutableBidict.putall`. These variants allow you to pass an :class:`~bidict.OnDup` instance to specify custom :class:`~bidict.OnDupAction`\s for each type of duplication that can occur. .. doctest:: >>> b = bidict({1: 'one'}) >>> b.put(1, 'uno', OnDup(key=RAISE)) Traceback (most recent call last): ... bidict.KeyDuplicationError: 1 >>> b bidict({1: 'one'}) :mod:`bidict` provides the :attr:`~bidict.ON_DUP_DEFAULT`, :attr:`~bidict.ON_DUP_RAISE`, and :attr:`~bidict.ON_DUP_DROP_OLD` :class:`~bidict.OnDup` instances for convenience. If no *on_dup* argument is passed, :meth:`~bidict.MutableBidict.put` and :meth:`~bidict.MutableBidict.putall` will use :attr:`~bidict.ON_DUP_RAISE`, providing stricter-by-default alternatives to :meth:`~bidict.MutableBidict.__setitem__` and :meth:`~bidict.MutableBidict.update`. (These defaults complement the looser alternatives provided by :meth:`~bidict.MutableBidict.forceput` and :meth:`~bidict.MutableBidict.forceupdate`.) Key and Value Duplication +++++++++++++++++++++++++ Note that it's possible for a given item to duplicate the key of one existing item, and the value of another existing item. For example: .. code-block:: python b.putall([(1, -1), (2, -2), (1, -2)], on_dup=OnDup(...)) Here, the third item we're trying to insert, (1, -2), duplicates the key of the first item we're passing, (1, -1), and the value of the second item we're passing, (2, -2). Keep in mind, the :class:`~bidict.OnDup` may specify one :class:`~bidict.OnDupAction` for :attr:`key duplication ` and a different :class:`~bidict.OnDupAction` for :attr:`value duplication `. In the case of a key and value duplication, the :class:`~bidict.OnDupAction` for :attr:`value duplication ` takes precedence: .. doctest:: >>> on_dup = OnDup(key=DROP_OLD, val=RAISE) >>> b.putall([(1, -1), (2, -2), (1, -2)], on_dup=on_dup) Traceback (most recent call last): ... bidict.KeyAndValueDuplicationError: (1, -2) Note that repeated insertions of the same item are construed as a no-op and will not raise, no matter what :class:`~bidict.OnDup` is: .. doctest:: >>> b = bidict({1: 'one'}) >>> b.put(1, 'one') # no-op, not a DuplicationError >>> b.putall([(2, 'two'), (2, 'two')]) # The repeat (2, 'two') is also a no-op. >>> b bidict({1: 'one', 2: 'two'}) See the :ref:`extending:\`\`YoloBidict\`\` Recipe` for another way to customize this behavior. Collapsing Overwrites +++++++++++++++++++++ When setting an item whose key duplicates that of an existing item, and whose value duplicates that of a *different* existing item, the existing item whose *value* is duplicated will be dropped, and the existing item whose *key* is duplicated will have its value overwritten in place: .. doctest:: >>> b = bidict({1: -1, 2: -2, 3: -3, 4: -4}) >>> b.forceput(2, -4) # item with duplicated value, namely (4, -4), is dropped >>> b # and the item with duplicated key, (2, -2), is updated in place: bidict({1: -1, 2: -4, 3: -3}) >>> # (2, -4) took the place of (2, -2), not (4, -4) >>> # Another example: >>> b = bidict({1: -1, 2: -2, 3: -3, 4: -4}) # as before >>> b.forceput(3, -1) >>> b bidict({2: -2, 3: -1, 4: -4}) >>> # (3, -1) took the place of (3, -3), not (1, -1) Updates Fail Clean ++++++++++++++++++ If an update to a :class:`~bidict.bidict` fails, you can be sure that it fails clean. In other words, a :class:`~bidict.bidict` will never apply only part of an update that ultimately fails, without restoring itself to the state it was in before processing the update: .. doctest:: >>> b = bidict({1: 'one', 2: 'two'}) >>> b.putall({3: 'three', 1: 'uno'}) Traceback (most recent call last): ... bidict.KeyDuplicationError: 1 >>> # (1, 'uno') was the problem... >>> b # ...but (3, 'three') was not added either: bidict({1: 'one', 2: 'two'}) This holds no matter why the update failed – not just for a :class:`~bidict.DuplicationError`, but also for e.g. an unhashable key or a malformed item. What is restored is the bidict's *contents*. For an :class:`~bidict.OrderedBidict`, the order of its items is restored as well. For other bidict types, it may not be: rolling back an overwrite reinserts the overwritten item, which puts it back at the end of the backing mapping rather than in its original position. So a failed update can leave a non-ordered bidict holding exactly the items it held before, but iterating them in a different order: .. doctest:: >>> b = bidict({1: 'one', 2: 'two'}) >>> b.update({1: 'uno', 3: 'two'}) # (1, 'uno') is applied, then (3, 'two') fails Traceback (most recent call last): ... bidict.ValueDuplicationError: two >>> b # the contents are restored... bidict({1: 'one', 2: 'two'}) >>> b.inverse # ...but the inverse is no longer in its original order: bidict({'two': 2, 'one': 1}) This is the same caveat described in :ref:`other-bidict-types:Order consistency between bidicts and their inverses`, applied to updates that fail rather than updates that succeed: if you need a bidict whose order is meaningful, use an :class:`~bidict.OrderedBidict`. Order Matters +++++++++++++ Performing a bulk insert operation – i.e. passing multiple items to :meth:`~bidict.BidictBase.__init__`, :meth:`~bidict.MutableBidict.update`, :meth:`~bidict.MutableBidict.forceupdate`, or :meth:`~bidict.MutableBidict.putall` – is like inserting each of those items individually in sequence. [#fn-fail-clean]_ Therefore, the order of the items provided to the bulk insert operation is significant to the result. For example, let's try calling `~bidict.MutableBidict.forceupdate` with a list of three items that duplicate some keys and values already in an initial bidict: .. doctest:: >>> b = bidict({0: 0, 1: 2}) >>> b.forceupdate({ ... 2: 0, # (2, 0) overwrites (0, 0) -> bidict({2: 0, 1: 2}) ... 0: 1, # (0, 1) is added -> bidict({2: 0, 1: 2, 0: 1}) ... 0: 0, # (0, 0) overwrites (0, 1) and (2, 0) -> bidict({1: 2, 0: 0}) ... }) >>> b bidict({1: 2, 0: 0}) Now let's do the exact same thing, but with a different order of the items that we pass to :meth:`~bidict.MutableBidict.forceupdate`: .. doctest:: >>> b = bidict({0: 0, 1: 2}) # as above >>> b.forceupdate({ ... # same items as above, different order: ... 0: 1, # (0, 1) overwrites (0, 0) -> bidict({0: 1, 1: 2}) ... 0: 0, # (0, 0) overwrites (0, 1) -> bidict({0: 0, 1: 2}) ... 2: 0, # (2, 0) overwrites (0, 0) -> bidict({1: 2, 2: 0}) ... }) >>> b # different items! bidict({1: 2, 2: 0}) Of course, if you try to initialize or update a bidict with an iterable that yields items in a nondeterministic order, the results will vary accordingly. .. [#fn-fail-clean] Albeit with the extremely important advantage of :ref:`failing clean `. Interop +++++++ :class:`~bidict.bidict`\s interoperate well with other types of mappings. For example, they support efficient polymorphic equality testing: .. doctest:: >>> bidict(a=1) == dict(a=1) True And converting back and forth works as expected: .. doctest:: >>> dict(bidict(a=1)) {'a': 1} >>> bidict(dict(a=1)) bidict({'a': 1}) (Just remember that if there were any :ref:`duplicate values ` in the dict passed to :class:`~bidict.bidict`, it would trigger a :class:`~bidict.ValueDuplicationError`.) See the :ref:`other-bidict-types:Polymorphism` section for more interoperability documentation. ---- Proceed to :doc:`other-bidict-types` for documentation on the remaining bidict variants. bidict-0.24.1/docs/changelog.rst000077700000000000000000000000001524342314000206722../CHANGELOG.rstustar00rootroot00000000000000bidict-0.24.1/docs/code-of-conduct.rst000077700000000000000000000000001524342314000227022../CODE_OF_CONDUCT.rstustar00rootroot00000000000000bidict-0.24.1/docs/conf.py000066400000000000000000000210731524342314000152640ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # bidict documentation build configuration file, created by # sphinx-quickstart on Fri Aug 29 11:38:22 2014. # # This file is execfile()d with the current directory set to its # containing dir. # # Note that not all possible configuration values are present in this # autogenerated file. # # All configuration values have a default; values that are commented out # serve to show the default. """Sphinx configuration.""" import importlib.util from importlib.metadata import metadata # -- General configuration ------------------------------------------------ # suppress_warnings = [ # ] # If your documentation needs a minimal Sphinx version, state it here. # needs_sphinx = '1.0' # Add any Sphinx extension module names here, as strings. They can be # extensions coming with Sphinx (named 'sphinx.ext.*') or custom ones. extensions = [ 'sphinx.ext.autodoc', 'sphinx.ext.autosectionlabel', 'sphinx.ext.coverage', 'sphinx.ext.doctest', 'sphinx.ext.extlinks', 'sphinx.ext.intersphinx', 'sphinx.ext.viewcode', ] if importlib.util.find_spec('sphinx_copybutton'): extensions.append('sphinx_copybutton') intersphinx_mapping = {'python': ('https://docs.python.org/3', None)} # Add any paths that contain templates here, relative to this directory. # templates_path = ['_templates'] # The suffix of source filenames. source_suffix = '.rst' # The encoding of source files. # source_encoding = 'utf-8-sig' # The master toctree document. master_doc = 'index' bidict_metadata = metadata('bidict') # bidict must be on PYTHONPATH (e.g. installed) project = bidict_metadata['Name'] # Extract author name from "Name " format author_email = bidict_metadata['Author-email'] author = author_email.split('<')[0].strip() if author_email else 'Joshua Bronson' copyright = f'2009-2026 {author}' # ruff: ignore[builtin-variable-shadowing] # Sphinx requires this name # The version info for the project you're documenting, acts as replacement for # |version| and |release|, also used in various other places throughout the # built documents. # The full version, including alpha/beta/rc tags. release = bidict_metadata['Version'] # The short X.Y version. version = '.'.join(release.split('.')[:2]) # The language for content autogenerated by Sphinx. Refer to documentation # for a list of supported languages. # language = None # There are two options for replacing |today|: either, you set today to some # non-false value, then it is used: # today = '' # Else, today_fmt is used as the format for a strftime call. # today_fmt = '%B %d, %Y' # List of patterns, relative to source directory, that match files and # directories to ignore when looking for source files. exclude_patterns = ['_build'] # The reST default role (used for this markup: `text`) to use for all # documents. # default_role = None # If true, '()' will be appended to :func: etc. cross-reference text. # add_function_parentheses = True # If true, the current module name will be prepended to all description # unit titles (such as .. function::). # add_module_names = True # If true, sectionauthor and moduleauthor directives will be shown in the # output. They are ignored by default. # show_authors = False # The name of the Pygments (syntax highlighting) style to use. # pygments_style = 'colorful' # A list of ignored prefixes for module index sorting. modindex_common_prefix = ['bidict.'] # If true, keep warnings as "system message" paragraphs in the built documents. # keep_warnings = False # -- Options for HTML output ---------------------------------------------- # The theme to use for HTML and HTML Help pages. See the documentation for # a list of builtin themes. html_theme = 'furo' # Theme options are theme-specific and customize the look and feel of a theme # further. For a list of options available for each theme, see the # documentation. # https://pradyunsg.me/furo/customisation/#theme-options # html_theme_options = dict( # ) # Add any paths that contain custom themes here, relative to this directory. # html_theme_path = [] # The name for this set of Sphinx documents. If None, it defaults to # " v documentation". html_title = 'bidict' # A shorter title for the navigation bar. Default is the same as html_title. # html_short_title = 'bidict' # The name of an image file (relative to this directory) to place at the top # of the sidebar. # html_logo = '_static/logo-256.png' # The name of an image file (within the static path) to use as favicon of the # docs. This file should be a Windows icon file (.ico) being 16x16 or 32x32 # pixels large. html_favicon = '_static/favicon.ico' # Add any paths that contain custom static files (such as style sheets) here, # relative to this directory. They are copied after the builtin static files, # so a file named "default.css" will overwrite the builtin "default.css". html_static_path = ['_static'] # Add any extra paths that contain custom files (such as robots.txt or # .htaccess) here, relative to this directory. These files are copied # directly to the root of the documentation. # html_extra_path = [] # https://docs.readthedocs.io/en/stable/guides/adding-custom-css.html#adding-custom-css-or-javascript-to-sphinx-documentation # html_css_files = ['custom.css'] html_js_files = ['custom.js'] # If not '', a 'Last updated on:' timestamp is inserted at every page bottom, # using the given strftime format. html_last_updated_fmt = '%b %d, %Y' # If true, SmartyPants will be used to convert quotes and dashes to # typographically correct entities. # html_use_smartypants = True # Custom sidebar templates, maps document names to template names. # https://pradyunsg.me/furo/customisation/sidebar/#using-html-sidebars html_sidebars = { '**': [ 'sidebar/brand.html', 'sidebar/search.html', 'sidebar/scroll-start.html', 'sidebar/navigation.html', 'sidebar/scroll-end.html', ], } # Additional templates that should be rendered to pages, maps page names to # template names. # html_additional_pages = {} # If false, no module index is generated. # html_domain_indices = True # If false, no index is generated. # html_use_index = True # If true, the index is split into individual pages for each letter. html_split_index = True # If true, links to the reST sources are added to the pages. html_show_sourcelink = False # If true, "Created using Sphinx" is shown in the HTML footer. Default is True. html_show_sphinx = False # If true, "(C) Copyright ..." is shown in the HTML footer. Default is True. html_show_copyright = True # If true, an OpenSearch description file will be output, and all pages will # contain a tag referring to it. The value of this option must be the # base URL from which the finished HTML is served. # html_use_opensearch = '' # This is the file name suffix for HTML files (e.g. ".xhtml"). # html_file_suffix = None # Output file base name for HTML help builder. htmlhelp_basename = 'bidictdoc' # https://www.sphinx-doc.org/en/master/usage/extensions/extlinks.html extlinks = { 'issue': ('https://github.com/jab/bidict/issues/%s', '#%s'), } # Ignore urls matching these regex strings when doing "make linkcheck" linkcheck_ignore = [ r'https://codecov\.io/.*', # gives 405 for HEAD requests r'https://pypistats\.org/.*', # unreliable # alternative links for readers on GitHub (which don't work on readthedocs.io): r'docs/learning-from-bidict\.rst', r'CHANGELOG\.rst', r'docs/intro\.rst', r'CONTRIBUTING\.rst', r'CODE_OF_CONDUCT\.rst', ] linkcheck_timeout = 10 # 5s default too low nitpicky = True nitpick_ignore_regex = [ # work around https://github.com/sphinx-doc/sphinx/issues/10974 ('py:(class|obj)', r'(bidict\._typing\.)?(KT|VT|DT|Maplike|MapOrItems|MissingT)'), ('py:class', r'(bidict\._base\.)?BT'), ('py:class', r't\.(Any|ClassVar|MutableMapping)'), ] # http://www.sphinx-doc.org/en/stable/ext/autosectionlabel.html#configuration autosectionlabel_prefix_document = True # https://www.sphinx-doc.org/en/3.x/usage/extensions/autodoc.html#confval-autodoc_typehints autodoc_typehints = 'description' # pytest-sphinx does not support doctest_global_setup. We use conftest.py instead. # Ref: https://github.com/thisch/pytest-sphinx/issues/5#issuecomment-618072237 # doctest_global_setup = """""" # https://sphinx-copybutton.readthedocs.io/en/latest/#strip-and-configure-input-prompts-for-code-cells copybutton_prompt_text = '>>> ' bidict-0.24.1/docs/conftest.py000066400000000000000000000016221524342314000161620ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. from __future__ import annotations import sys import typing as t from collections.abc import Mapping from collections.abc import MutableMapping import pytest import bidict # https://github.com/thisch/pytest-sphinx/issues/5#issuecomment-618072237 @pytest.fixture(autouse=True) def _add_doctest_globals(doctest_namespace: MutableMapping[str, t.Any]) -> None: doctest_namespace['Mapping'] = Mapping doctest_namespace['MutableMapping'] = MutableMapping doctest_namespace['pypy'] = sys.implementation.name == 'pypy' doctest_namespace['sys'] = sys doctest_namespace.update(i for i in vars(bidict).items() if not i[0].startswith('_')) bidict-0.24.1/docs/contributors-guide.rst000077700000000000000000000000001524342314000232132../CONTRIBUTING.rstustar00rootroot00000000000000bidict-0.24.1/docs/extending.rst000066400000000000000000000213741524342314000165100ustar00rootroot00000000000000Extending ``bidict`` -------------------- Bidict was written with extensibility in mind. Let's look at some examples. ``YoloBidict`` Recipe ##################### If you'd like :attr:`~bidict.ON_DUP_DROP_OLD` to be the default :class:`~bidict.BidictBase.on_dup` behavior (for :meth:`~bidict.BidictBase.__init__`, :meth:`~bidict.MutableBidict.__setitem__`, and :meth:`~bidict.MutableBidict.update`), you can use the following recipe: .. doctest:: >>> from bidict import bidict, ON_DUP_DROP_OLD >>> class YoloBidict(bidict): ... on_dup = ON_DUP_DROP_OLD >>> b = YoloBidict({'one': 1}) >>> b['two'] = 1 # succeeds, no ValueDuplicationError >>> b YoloBidict({'two': 1}) >>> b.update({'three': 1}) # ditto >>> b YoloBidict({'three': 1}) Of course, ``YoloBidict``'s inherited :meth:`~bidict.MutableBidict.put` and :meth:`~bidict.MutableBidict.putall` methods still allow specifying a custom :class:`~bidict.OnDup` per call via the *on_dup* argument, and will both still default to raising for all duplication types. Further demonstrating :mod:`bidict`'s extensibility, to make an ``OrderedYoloBidict``, the class above can simply inherit from :class:`bidict.OrderedBidict` rather than :class:`bidict.bidict`. Beware of ``ON_DUP_DROP_OLD`` ::::::::::::::::::::::::::::: There's a good reason that :mod:`bidict` does not provide a ``YoloBidict`` out of the box. Before you decide to use a ``YoloBidict`` in your own code, beware of the following potentially unexpected, dangerous behavior: .. doctest:: >>> b = YoloBidict({'one': 1, 'two': 2}) # b contains two items >>> b['one'] = 2 # update one of the items >>> b # now b only has one item! YoloBidict({'one': 2}) As covered in :ref:`basic-usage:collapsing overwrites`, setting an existing key to the value of a different existing item causes both existing items to quietly collapse into a single new item. The opposite customization would look something like: .. doctest:: >>> from bidict import ON_DUP_RAISE >>> class YodoBidict(bidict): # yodo: you only die once! ... on_dup = ON_DUP_RAISE >>> b = YodoBidict({'one': 1}) >>> b['one'] = 2 # Unlike a regular bidict, YodoBidict won't allow this. Traceback (most recent call last): ... bidict.KeyDuplicationError: one >>> b YodoBidict({'one': 1}) >>> b.forceput('one', 2) # Any type of overwrite requires more force. >>> b YodoBidict({'one': 2}) ``WeakrefBidict`` Recipe ######################## Suppose you need to store some objects in a bidict without incrementing their refcounts. With :class:`~bidict.BidictBase`\'s :attr:`~bidict.BidictBase._fwdm_cls` (forward mapping class) and :attr:`~bidict.BidictBase._invm_cls` (inverse mapping class) attributes, accomplishing this is as simple as: .. doctest:: >>> from bidict import MutableBidict >>> from weakref import WeakKeyDictionary, WeakValueDictionary >>> class WeakrefBidict(MutableBidict): ... _fwdm_cls = WeakKeyDictionary ... _invm_cls = WeakValueDictionary Now you can insert items into *WeakrefBidict* without incrementing their refcounts: .. doctest:: >>> b = WeakrefBidict() >>> o1, o2 = frozenset({1}), frozenset({2}) >>> b[o1] = o2 Since o1 and o2 are the only strong references to these objects, if you delete these references, the refcounts will go to zero and the objects will immediately be deallocated on CPython, since the *WeakrefBidict* isn't holding on to them: .. use `:skipif: pypy` for the test below once https://github.com/thisch/pytest-sphinx/issues/9 is fixed .. doctest:: >>> del o1, o2 # after this, b immediately becomes empty on CPython: >>> if sys.implementation.name == 'cpython': ... assert not b ``SortedBidict`` Recipes ######################## Suppose you need a bidict that maintains its items in sorted order. The Python standard library does not include any sorted dict types, but the excellent `sortedcontainers `__ and `sortedcollections `__ libraries do. Using these, along with :class:`~bidict.BidictBase`'s :attr:`~bidict.BidictBase._fwdm_cls` (forward mapping class) and :attr:`~bidict.BidictBase._invm_cls` (inverse mapping class) attributes, creating a sorted bidict is simple: .. doctest:: >>> from sortedcontainers import SortedDict >>> class SortedBidict(MutableBidict): ... """A sorted bidict whose forward items stay sorted by their keys, ... and whose inverse items stay sorted by *their* keys. ... Note: As a result, an instance and its inverse yield their items ... in different orders. ... """ ... _fwdm_cls = SortedDict ... _invm_cls = SortedDict >>> b = SortedBidict({'Tokyo': 'Japan', 'Cairo': 'Egypt'}) >>> b SortedBidict({'Cairo': 'Egypt', 'Tokyo': 'Japan'}) >>> b['Lima'] = 'Peru' >>> list(b.items()) # stays sorted by key [('Cairo', 'Egypt'), ('Lima', 'Peru'), ('Tokyo', 'Japan')] >>> list(b.inverse.items()) # .inverse stays sorted by *its* keys (b's values) [('Egypt', 'Cairo'), ('Japan', 'Tokyo'), ('Peru', 'Lima')] Here's a recipe for a sorted bidict whose forward items stay sorted by their keys, and whose inverse items stay sorted by their values. i.e. An instance and its inverse will yield their items in *the same* order: .. doctest:: >>> from sortedcollections import ValueSortedDict >>> class KeySortedBidict(MutableBidict): ... _fwdm_cls = SortedDict ... _invm_cls = ValueSortedDict >>> elem_by_atomicnum = KeySortedBidict({ ... 6: 'carbon', 1: 'hydrogen', 2: 'helium'}) >>> list(elem_by_atomicnum.items()) # stays sorted by key [(1, 'hydrogen'), (2, 'helium'), (6, 'carbon')] >>> list(elem_by_atomicnum.inverse.items()) # .inverse stays sorted by value [('hydrogen', 1), ('helium', 2), ('carbon', 6)] >>> elem_by_atomicnum[4] = 'beryllium' >>> list(elem_by_atomicnum.inverse.items()) [('hydrogen', 1), ('helium', 2), ('beryllium', 4), ('carbon', 6)] Automatic "Get Attribute" Pass-Through ###################################### Python makes it easy to customize a class's "get attribute" behavior. You can take advantage of this to pass attribute access through to the backing ``_fwdm`` mapping when an attribute is not provided by the bidict class itself: >>> def __getattribute__(self, name): ... try: ... return object.__getattribute__(self, name) ... except AttributeError: ... return getattr(self._fwdm, name) >>> KeySortedBidict.__getattribute__ = __getattribute__ Now, even though this ``KeySortedBidict`` itself provides no ``peekitem`` attribute, you can still call ``peekitem`` on it and it will return the result of calling ``peekitem`` on the backing ``SortedDict``: >>> elem_by_atomicnum.peekitem() (6, 'carbon') Dynamic Inverse Class Generation ################################ When a bidict class's :attr:`~bidict.BidictBase._fwdm_cls` and :attr:`~bidict.BidictBase._invm_cls` are the same, the bidict class is its own inverse class. (This is the case for all the :ref:`bidict classes ` that come with :mod:`bidict`.) However, when a bidict's :attr:`~bidict.BidictBase._fwdm_cls` and :attr:`~bidict.BidictBase._invm_cls` differ, as in the ``KeySortedBidict`` and ``WeakrefBidict`` recipes above, the inverse class of the bidict needs to have its :attr:`~bidict.BidictBase._fwdm_cls` and :attr:`~bidict.BidictBase._invm_cls` swapped. :class:`~bidict.BidictBase` detects this and dynamically computes the correct inverse class for you automatically. You can see this if you inspect ``KeySortedBidict``'s inverse bidict: >>> elem_by_atomicnum.inverse.__class__.__name__ 'KeySortedBidictInv' Notice that :class:`~bidict.BidictBase` automatically created a ``KeySortedBidictInv`` class and used it for the inverse bidict. As expected, ``KeySortedBidictInv``'s :attr:`~bidict.BidictBase._fwdm_cls` and :attr:`~bidict.BidictBase._invm_cls` are the opposite of ``KeySortedBidict``'s: >>> elem_by_atomicnum.inverse._fwdm_cls.__name__ 'ValueSortedDict' >>> elem_by_atomicnum.inverse._invm_cls.__name__ 'SortedDict' :class:`~bidict.BidictBase` also ensures that round trips work as expected: >>> KeySortedBidictInv = elem_by_atomicnum.inverse.__class__ # i.e. a value-sorted bidict >>> atomicnum_by_elem = KeySortedBidictInv(elem_by_atomicnum.inverse) >>> atomicnum_by_elem KeySortedBidictInv({'hydrogen': 1, 'helium': 2, 'beryllium': 4, 'carbon': 6}) >>> KeySortedBidict(atomicnum_by_elem.inverse) == elem_by_atomicnum True ----- This all goes to show how simple it can be to compose your own bidirectional mapping types out of the building blocks that :mod:`bidict` provides. bidict-0.24.1/docs/index.rst000066400000000000000000000003631524342314000156250ustar00rootroot00000000000000.. toctree:: :hidden: intro basic-usage other-bidict-types extending other-functionality addendum changelog api learning-from-bidict contributors-guide thanks code-of-conduct .. include:: ../README.rst bidict-0.24.1/docs/intro.rst000066400000000000000000000123131524342314000156470ustar00rootroot00000000000000Introduction ============ The :mod:`bidict` library provides several friendly, efficient data structures for working with `bidirectional mappings `__ in Python. bidict.bidict ------------- :class:`bidict.bidict` is the main bidirectional mapping data structure provided. It allows looking up the value associated with a key, just like a :class:`dict`: .. doctest:: >>> element_by_symbol = bidict({'H': 'hydrogen'}) >>> element_by_symbol['H'] 'hydrogen' But it also allows looking up the key associated with a value, via the special :attr:`~bidict.BidictBase.inverse` attribute: .. doctest:: >>> element_by_symbol.inverse['hydrogen'] 'H' The :attr:`~bidict.BidictBase.inverse` attribute actually references the entire inverse bidirectional mapping: .. doctest:: >>> element_by_symbol bidict({'H': 'hydrogen'}) >>> element_by_symbol.inverse bidict({'hydrogen': 'H'}) ...which is automatically kept in sync as the original mapping is updated: .. doctest:: >>> element_by_symbol['H'] = 'hydrogène' >>> element_by_symbol.inverse bidict({'hydrogène': 'H'}) If you're used to working with :class:`dict`\s, you'll feel right at home using :mod:`bidict`: >>> dir(element_by_symbol) [..., '__getitem__', ..., '__setitem__', ..., 'items', 'keys', ...] Familiar, concise, Pythonic. Why can't I just use a dict? ---------------------------- A skeptic writes: If I want a mapping associating *a* → *b* and *b* → *a*, I can just create the dict ``{a: b, b: a}``. Why bother using :mod:`bidict`? One answer is better ergonomics for maintaining a correct representation. For example, to get the correct length, you'd have to take the number reported by :func:`len` and cut it in half. But now consider what happens when we need to store a new association, and we try to do so naively: .. code-block:: python el_by_sym = {'H': 'hydrogen', 'hydrogen': 'H'} # Later we need to associate 'H' with a different value el_by_sym.update({'H': 'hydrogène', 'hydrogène': 'H'} # Too naive Here is what we're left with: .. code-block:: python # el_by_sym: {'H': 'hydrogène', 'hydrogène': 'H', 'hydrogen': 'H'} Oops. We forgot to look up whether the key and value we wanted to set already had any previous associations and remove them as necessary. In general, if we want to store the association *k* ⟷ *v*, but we may have already stored the associations *k* ⟷ *v′* or *k′* ⟷ *v*, a correct implementation using the single-dict approach would require code like this: .. doctest:: >>> d = {'H': 'hydrogen', 'hydrogen': 'H'} >>> def update(d, key, val): ... oldval = d.pop(key, object()) ... d.pop(oldval, None) ... oldkey = d.pop(val, object()) ... d.pop(oldkey, None) ... d.update({key: val, val: key}) >>> update(d, 'H', 'hydrogène') >>> d == {'H': 'hydrogène', 'hydrogène': 'H'} True With :mod:`bidict`, we can instead just write: .. doctest:: >>> b = bidict({'H': 'hydrogen'}) >>> b['H'] = 'hydrogène' And :mod:`bidict` takes care of all the fussy details, leaving us with just what we wanted: .. doctest:: >>> b bidict({'H': 'hydrogène'}) >>> b.inverse bidict({'hydrogène': 'H'}) Even more important... ++++++++++++++++++++++ Beyond this, consider what would happen if we needed to work with just the keys, values, or items that we have associated. Since the single-dict approach inserts values as keys into the same dict that it inserts keys into, we'd never be able to tell our keys and values apart. So iterating over the keys would also yield the values (and vice versa), with no way to tell which was which. Iterating over the items would yield twice as many as we wanted, with a *(v, k)* item that we'd have to ignore for each *(k, v)* item that we expect, and no way to tell which was which. .. doctest:: >>> # Compare the single-dict approach: >>> set(d.keys()) == {'H', 'hydrogène'} # .keys() also gives values True >>> set(d.values()) == {'H', 'hydrogène'} # .values() also gives keys True >>> # ...to using a bidict: >>> b.keys() == {'H'} # just the keys True >>> b.values() == {'hydrogène'} # just the values True In short, to model a bidirectional mapping correctly and unambiguously, we need two separate one-directional mappings, one for the forward associations and one for the inverse, that are kept in sync as the associations change. This is exactly what :mod:`bidict` does under the hood, abstracting it into a clean and ergonomic interface. :mod:`bidict`'s APIs also provide power, flexibility, and safety, making sure the one-to-one invariant is maintained and inverse mappings are kept consistent, while also helping make sure you don't accidentally :ref:`shoot yourself in the foot `. Additional Functionality ------------------------ Besides the standard :class:`bidict.bidict` type, the :mod:`bidict` module provides other bidirectional mapping variants: :class:`~bidict.frozenbidict` and :class:`~bidict.OrderedBidict`. These and :mod:`bidict`'s other functionality will be covered in later sections. But first, let's look at a few more details of :doc:`basic-usage`. bidict-0.24.1/docs/learning-from-bidict.rst000066400000000000000000000447031524342314000205200ustar00rootroot00000000000000Learning from ``bidict`` ------------------------ Working on bidict has taken me to some of the most interesting and unexpected places I've gotten to visit in many years of programming. (When I started this project 20 years ago, I'd never heard of things like higher-kinded types. Thanks to bidict, I not only learned about them, I got to `share a practical example with Guido `__ where they would be beneficial for Python.) The problem space that bidict inhabits is abundant with beautiful symmetries, delightful surprises, and rich opportunities to come up with elegant solutions. You can check out bidict's source to see for yourself. I've sought to optimize the code not just for correctness and performance, but also for clarity, maintainability, and to make for an enjoyable read. See below for more, and feel free to let me know what you think. I hope reading bidict's code brings you some of the `joy `__ that bidict has brought me. Code structure ============== :class:`~bidict.bidict`\s come in mutable, immutable, and ordered variants, implementing Python's various :class:`relevant ` :class:`collections ` :class:`interfaces ` as appropriate. Factoring the code to maximize reuse, modularity, and adherence to `SOLID `__ design principles (while not missing any chances for specialized optimizations) has been one of the most fun parts of working on bidict. To see how this is done, check out the code starting with `__init__.py `__, and then follow the path suggested in the "code review nav" comments at the top of the file: - `_base.py `__ - `_frozen.py `__ - `_bidict.py `__ - `_orderedbase.py `__ - `_orderedbidict.py `__ Data structures are amazing =========================== Data structures are one of the most fascinating and important building blocks of programming and computer science. It's all too easy to lose sight of the magic when having to implement them for computer science courses or job interview questions. Part of this is because many of the most interesting real-world details get left out, and you miss all the value that comes from ongoing, direct practical application. Bidict shows how fundamental data structures can be implemented in Python for real-world usage, with practical concerns at top of mind. ``OrderedBidict``\'s design =========================== A regular :class:`~bidict.bidict` encapsulates two regular dicts, keeping them in sync to preserve the bidirectional mapping invariants. How should we extend this to implement :class:`~bidict.OrderedBidict`? From :class:`~bidict.BidictBase`, :class:`~bidict.OrderedBidictBase` inherits the use of two regular dicts to store the contents of the forward and inverse items. To store the *ordering* of the items, we use a doubly-linked list (much like :class:`~collections.OrderedDict`), allowing us to e.g. move any item to the front of the bidict in constant time. Interestingly, the nodes of the linked list encode only the ordering of the items; the nodes themselves contain no key or value data. An additional backing mapping associates the key/value data with the nodes, providing the final piece of the puzzle. And since the implementation needs to not only look up nodes by key/value, but also key/value by node, we use a :class:`~bidict.bidict` for this internally. Bidicts all the way down! Python syntax hacks =================== bidict :issue:`used to <19>` support a specialized form of Python's :ref:`slice ` syntax for getting and setting keys by value: .. code-block:: python element_by_symbol = bidict(H='hydrogen') # [normal] syntax for the forward mapping lookup: element_by_symbol['H'] # ==> 'hydrogen' # [:slice] syntax for the inverse lookup (no longer supported): element_by_symbol[:'hydrogen'] # ==> 'H' See `this code `__ for how this was implemented. It's super cool when you find a way to bend Python's syntax to support new use cases like this that still feel like they fit well into the language, especially given that Python (wisely) limits how much you can customize its syntax. Property-based testing is incredible ==================================== When your automated tests run, are they only checking the test cases that you happened to think of when writing your tests? How do you know you aren't missing some important edge cases? With property-based testing, you describe the _types_ of the test case inputs that your APIs accept, along with the properties that should hold for all valid inputs. Rather than having to think of your test case inputs manually and hard-code them into your test suite, they get generated for you dynamically, in much greater quantity and diversity than you would typically come up with by hand. This dramatically increases test coverage and confidence that your code is correct with much less actual test code. Bidict never would have survived so many refactorings with so few bugs if it weren't for property-based testing, enabled by the amazing `Hypothesis `__ library. Check out `bidict's property-based tests `__ to see this in action. Python surprises ================ - What should happen when checking equality of several ordered mappings that contain the same items but in a different order? First let's see how :class:`collections.OrderedDict` works. The results may surprise you: .. doctest:: >>> from collections import OrderedDict >>> x = OrderedDict({1: 1, 2: 2}) >>> y = {1: 1, 2: 2} >>> z = OrderedDict({2: 2, 1: 1}) >>> x == y True >>> y == z True >>> x == z # !!! False So :class:`collections.OrderedDict` violates the `transitive property of equality `__. This can lead to some even more unusual behavior than the above. As an example, let's see what would happen if ``bidict.frozenbidict.__eq__()`` behaved this way: .. doctest:: >>> class BadFrozenBidict(BidictBase): ... __hash__ = frozenbidict.__hash__ ... ... def __eq__(self, other): # (deliberately simplified) ... # Override to be order-sensitive, like collections.OrderedDict: ... return all(i == j for (i, j) in zip(self.items(), other.items())) >>> x = BadFrozenBidict({1: 1, 2: 2}) >>> y = frozenbidict({1: 1, 2: 2}) >>> z = BadFrozenBidict({2: 2, 1: 1}) >>> x == y True >>> y == z True >>> x == z # !!! False >>> set1 = {x, y, z} >>> len(set1) 2 >>> set2 = {y, x, z} >>> len(set2) # !!! 1 According to Raymond Hettinger, the Python core developer who built Python's collections foundation, :class:`collections.OrderedDict`\'s ``__eq__()`` implementation should have been order-insensitive. Making it order-sensitive violates the transitive property of equality as well as the `Liskov substitution principle `__. It's too late now to change this for :class:`collections.OrderedDict`. But at least it's not too late to learn from this. Hence :ref:`eq-order-insensitive`, even for ordered bidicts. For an order-sensitive equality check, bidict provides the separate :meth:`~bidict.BidictBase.equals_order_sensitive` method, thanks to Raymond's advice. - See :ref:`addendum:\*nan\* as a Key`. - See :ref:`addendum:Equivalent but distinct \:class\:\`~collections.abc.Hashable\`\\s`. Better memory usage through ``__slots__`` ========================================= Using :ref:`slots` speeds up attribute access, and can dramatically reduce memory usage in CPython when creating many instances of the same class. As an example, the ``Node`` class used internally (in the linked list that backs :class:`~bidict.OrderedBidictBase`) uses slots for better performance at scale, since there are as many node instances kept in memory as there are items in every ordered bidict in memory. *See:* `_orderedbase.py `__ Note that extra care must be taken when using slots with pickling and weakrefs; see the code for more. Better memory usage through ``weakref`` ======================================= A :class:`~bidict.bidict` and its inverse use :mod:`weakref` to :ref:`avoid creating a reference cycle `. As a result, when you drop your last reference to a bidict, its memory is reclaimed immediately in CPython rather than having to wait for the next garbage collection. *See:* `_base.py `__ As another example, the ``Node`` class used internally by :class:`~bidict.OrderedBidictBase` uses weakrefs to avoid creating reference cycles in the doubly-linked lists used to encode the ordering of inserted items. *See:* `_orderedbase.py `__ Using descriptors for managed attributes ======================================== To abstract the details of creating and dereferencing the weakrefs that :class:`~bidict.OrderedBidictBase`\'s aforementioned doubly-linked list nodes use to refer to their neighbor nodes, a ``WeakAttr`` descriptor is used to `manage access to these attributes automatically `__. *See:* `_orderedbase.py `__ The implicit ``__class__`` reference ==================================== Anytime you have to reference the exact class of an instance (and not a potential subclass) from within a method body, you can use the implicit, lexically-scoped ``__class__`` reference rather than hard-coding the current class's name. *See:* https://docs.python.org/3/reference/datamodel.html#executing-the-class-body Subclassing ``namedtuple`` classes ================================== To get the performance benefits, intrinsic sortability, etc. of :class:`~typing.NamedTuple` (or :func:`~collections.namedtuple`) while customizing behavior, API, etc., you can subclass. See the *OnDup* class in `_dup.py `__ for an example. Here's another example: .. doctest:: >>> from collections import namedtuple >>> from itertools import count >>> class Node(namedtuple('_Node', 'cost tiebreaker data parent depth')): ... """Represent nodes in a graph traversal. Suitable for use with e.g. heapq.""" ... ... __slots__ = () ... _counter = count() # break ties between equal-cost nodes, avoid comparing data ... ... # Give call sites a cleaner API for creating new Nodes ... def __new__(cls, cost, data, parent=None): ... tiebreaker = next(cls._counter) ... depth = parent.depth + 1 if parent else 0 ... return super().__new__(cls, cost, tiebreaker, data, parent, depth) ... ... def __repr__(self): ... return 'Node(cost={cost}, data={data!r})'.format(**self._asdict()) >>> start = Node(cost=0, data='foo') >>> child = Node(cost=5, data='bar', parent=start) >>> child Node(cost=5, data='bar') >>> child.parent Node(cost=0, data='foo') >>> child.depth 1 ``namedtuple``-style dynamic class generation ============================================= See the `implementation `__ of ``namedbidict`` (it was since removed due to low usage). API Design ========== How to deeply integrate with Python's :mod:`collections` and other built-in APIs? - Beyond implementing :class:`collections.abc.Mapping`, bidicts implement additional APIs that :class:`dict` and :class:`~collections.OrderedDict` implement (e.g. ``setdefault()``, ``popitem()``, etc.). - When creating a new API, making it familiar, memorable, and intuitive is hugely important to a good user experience. - Thanks to :class:`~collections.abc.Hashable`'s implementing :meth:`abc.ABCMeta.__subclasshook__`, any class that implements the required methods of the :class:`~collections.abc.Hashable` interface (namely, ``__hash__()``) makes it a virtual subclass already, no need to explicitly extend. I.e. As long as ``Foo`` implements a ``__hash__()`` method, ``issubclass(Foo, Hashable)`` will always be True, no need to explicitly subclass via ``class Foo(Hashable): ...`` - How to make your own open ABC like :class:`~collections.abc.Hashable`? - Override :meth:`~abc.ABCMeta.__subclasshook__` to check for the interface you require. - Interesting consequence of the ``__subclasshook__()`` design: the "subclass" relation becomes intransitive. e.g. :class:`object` is a subclass of :class:`~collections.abc.Hashable`, :class:`list` is a subclass of :class:`object`, but :class:`list` is not a subclass of :class:`~collections.abc.Hashable`. - What if you needed to derive from a second metaclass? Be careful to avoid "TypeError: metaclass conflict: the metaclass of a derived class must be a (non-strict) subclass of the metaclasses of all its bases". See the great write-up in https://blog.ionelmc.ro/2015/02/09/understanding-python-metaclasses/. - :class:`collections.abc.Mapping` and :class:`collections.abc.MutableMapping` don't implement :meth:`~abc.ABCMeta.__subclasshook__`, so you must either explicitly subclass them (in which case you inherit their concrete method implementations) or use :meth:`abc.ABCMeta.register` (to register as a virtual subclass without inheriting any of the implementation). - Notice that Python provides :class:`collections.abc.Reversible` but no ``collections.abc.Ordered`` or ``collections.abc.OrderedMapping``. *See:* ``__ - See the `Zen of Python `__ for how to make APIs Pythonic. The following Zen of Python guidelines have been particularly influential for bidict: - "Errors should never pass silently. Unless explicitly silenced. - "In the face of ambiguity, refuse the temptation to guess." - "Readability counts." - "There should be one – and preferably only one – obvious way to do it." Python's data model =================== - What happens when you implement a custom :meth:`~object.__eq__`? e.g. What's the difference between ``a == b`` and ``b == a`` when only ``a`` is an instance of your class? See the great write-up in https://eev.ee/blog/2012/03/24/python-faq-equality/ for the answer. - Making an immutable type hashable (so it can be inserted into :class:`dict`\s and :class:`set`\s): Must implement :meth:`~object.__hash__` such that ``a == b ⇒ hash(a) == hash(b)``. See the :meth:`object.__hash__` and :meth:`object.__eq__` docs, and the `implementation `__ of :class:`~bidict.frozenbidict`. - Consider :class:`~bidict.frozenbidict`: its ``__eq__()`` is :ref:`order-insensitive `. So all contained items must participate in the hash order-insensitively. - Can use `collections.abc.Set._hash `__ which provides a pure Python implementation of the same hash algorithm used to hash :class:`frozenset`\s. (Since :class:`~collections.abc.ItemsView` extends :class:`~collections.abc.Set`, :meth:`bidict.frozenbidict.__hash__` just calls ``ItemsView(self)._hash()``.) - See also ``__ - Unlike other attributes, if a class implements ``__hash__()``, any subclasses of that class will not inherit it. It's like Python implicitly adds ``__hash__ = None`` to the body of every class that doesn't explicitly define ``__hash__``. So if you do want a subclass to inherit a base class's ``__hash__()`` implementation, you have to set that manually, e.g. by adding ``__hash__ = BaseClass.__hash__`` in the class body. This is consistent with the fact that :class:`object` implements ``__hash__()``, but subclasses of :class:`object` that override :meth:`~object.__eq__` are not hashable by default. - Overriding :meth:`object.__getattribute__` for custom attribute lookup. See :ref:`extending:\`\`SortedBidict\`\` Recipes`. - Using :meth:`object.__getstate__`, :meth:`object.__setstate__`, and :meth:`object.__reduce__` to make an object pickleable that otherwise wouldn't be, due to e.g. using weakrefs, as bidicts do (covered further below). Portability =========== - CPython vs. PyPy (and other Python implementations) - See https://doc.pypy.org/en/latest/cpython_differences.html - gc / weakref - Hence ``test_bidicts_freed_on_zero_refcount()`` in `test_properties.py `__ is skipped outside CPython. - primitives' identities, nan, etc. - Python 2 vs. Python 3 - As affects bidict, mostly :class:`dict` API changes, but also functions like :func:`zip`, :func:`map`, :func:`filter`, etc. - :meth:`~object.__ne__` fixed in Python 3 - Borrowing methods from other classes: In Python 2, must grab the ``.im_func`` / ``__func__`` attribute off the borrowed method to avoid getting ``TypeError: unbound method ...() must be called with ... instance as first argument`` Other interesting stuff in the standard library =============================================== - :mod:`reprlib` and :func:`reprlib.recursive_repr` (but not needed for bidict because there's no way to insert a bidict into itself) - :func:`operator.methodcaller` - See :ref:`addendum:Missing \`\`bidict\`\`\\s in the Standard Library` Tools ===== See the :ref:`Thanks ` page for some of the fantastic tools for software verification, performance, code quality, etc. that bidict has provided a great opportunity to learn and use. bidict-0.24.1/docs/other-bidict-types.rst000066400000000000000000000243521524342314000202410ustar00rootroot00000000000000Other ``bidict`` Types ====================== Now that we've covered :doc:`basic-usage` with the :class:`bidict.bidict` type, let's look at some other bidirectional mapping types. Bidict Types Diagram -------------------- .. image:: _static/bidict-types-diagram.png :target: _static/bidict-types-diagram.png :alt: bidict types diagram All bidirectional mapping types that :mod:`bidict` provides are subclasses of :class:`bidict.BidirectionalMapping`. This abstract base class extends :class:`collections.abc.Mapping` by adding the ":attr:`~bidict.BidirectionalMapping.inverse`" :obj:`~abc.abstractproperty`. As you can see above, :class:`bidict.bidict` is also a :class:`collections.abc.MutableMapping`. But :mod:`bidict` provides immutable bidirectional mapping types as well. :class:`~bidict.frozenbidict` ----------------------------- :class:`~bidict.frozenbidict` is an immutable, hashable bidirectional mapping type. As you would expect, attempting to mutate a :class:`~bidict.frozenbidict` causes an error: .. doctest:: >>> from bidict import frozenbidict >>> f = frozenbidict({'H': 'hydrogen'}) >>> f['C'] = 'carbon' Traceback (most recent call last): ... TypeError: 'frozenbidict' object does not support item assignment :class:`~bidict.frozenbidict` also implements :class:`collections.abc.Hashable`, so it's suitable for insertion into sets or other mappings: .. doctest:: >>> my_set = {f} # not an error >>> my_dict = {f: 1} # also not an error :class:`~bidict.OrderedBidict` ------------------------------ :class:`bidict.OrderedBidict` is a :class:`~bidict.MutableBidirectionalMapping` that preserves the insertion order of its items, and offers some additional ordering-related APIs not offered by the plain bidict type. It's like a bidirectional version of :class:`collections.OrderedDict`. .. doctest:: >>> from bidict import OrderedBidict >>> element_by_symbol = OrderedBidict({'H': 'hydrogen', 'He': 'helium', 'Li': 'lithium'}) >>> element_by_symbol.inverse OrderedBidict({'hydrogen': 'H', 'helium': 'He', 'lithium': 'Li'}) >>> first, second, third = element_by_symbol.values() >>> first, second, third ('hydrogen', 'helium', 'lithium') >>> # Insert an additional item and verify it now comes last: >>> element_by_symbol['Be'] = 'beryllium' >>> *_, last_item = element_by_symbol.items() >>> last_item ('Be', 'beryllium') .. _extra-order-sensitive-apis: Extra order-sensitive APIs ++++++++++++++++++++++++++ Additional, efficiently-implemented, order-sensitive APIs are provided as well, following the example of :class:`~collections.OrderedDict`. Namely, :class:`~bidict.OrderedBidict` provides constant-time implementations of :meth:`popitem(last: bool) ` and :meth:`move_to_end(last: bool) `, which make ordered bidicts suitable to use for things like FIFO queues and LRU caches. .. doctest:: >>> element_by_symbol.popitem(last=True) # Remove the last item ('Be', 'beryllium') >>> element_by_symbol.popitem(last=False) # Remove the first item ('H', 'hydrogen') >>> # Re-adding hydrogen after it's been removed moves it to the end: >>> element_by_symbol['H'] = 'hydrogen' >>> element_by_symbol OrderedBidict({'He': 'helium', 'Li': 'lithium', 'H': 'hydrogen'}) >>> # But there's also a `move_to_end` method just for this purpose: >>> element_by_symbol.move_to_end('Li') >>> element_by_symbol OrderedBidict({'He': 'helium', 'H': 'hydrogen', 'Li': 'lithium'}) >>> element_by_symbol.move_to_end('H', last=False) # move to front >>> element_by_symbol OrderedBidict({'H': 'hydrogen', 'He': 'helium', 'Li': 'lithium'}) .. _eq-order-insensitive: :meth:`~bidict.OrderedBidict`\'s ``__eq__()`` is order-insensitive ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ To ensure that ``==`` comparison for any bidict always upholds the `transitive property of equality `__ and the `Liskov substitution principle `__, equality tests between a bidict and another mapping are always order-insensitive, even for ordered bidicts: .. doctest:: >>> o1 = OrderedBidict({1: 1, 2: 2}) >>> o2 = OrderedBidict({2: 2, 1: 1}) >>> o1 == o2 True For order-sensitive equality tests, use :meth:`~bidict.BidictBase.equals_order_sensitive`: .. doctest:: >>> o1.equals_order_sensitive(o2) False (Note that this improves on the behavior of ``collections.OrderedDict.__eq__()``. For more about this, see :ref:`learning-from-bidict:Python surprises`.) What about order-preserving dicts? ++++++++++++++++++++++++++++++++++ In CPython 3.6+ and all versions of PyPy, :class:`dict` preserves insertion order. Since bidicts are built on top of dicts, can we get away with using a plain bidict in places where you need an order-preserving bidirectional mapping? (Assuming we don't need the :ref:`extra-order-sensitive-apis`.) Let's look at some examples. Order consistency between bidicts and their inverses ++++++++++++++++++++++++++++++++++++++++++++++++++++ Consider the following: .. doctest:: >>> b = bidict({1: -1, 2: -2, 3: -3}) >>> b[2] = 'UPDATED' >>> b bidict({1: -1, 2: 'UPDATED', 3: -3}) So far so good, but look what happens to the inverse: .. doctest:: >>> b.inverse bidict({-1: 1, -3: 3, 'UPDATED': 2}) After the mutation, the ordering of the items in the plain bidict is no longer consistent with its inverse. To ensure that ordering is kept consistent between a bidict and its inverse, no matter how it's mutated, you have to use an ordered bidict: .. doctest:: >>> ob = OrderedBidict({1: -1, 2: -2, 3: -3}) >>> ob[2] = 'UPDATED' >>> ob OrderedBidict({1: -1, 2: 'UPDATED', 3: -3}) >>> ob.inverse # better: OrderedBidict({-1: 1, 'UPDATED': 2, -3: 3}) Preserving insertion order of items even after key changes ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Another way that ordered bidicts differ from plain bidicts is that you can change the *key* of an existing item, and its order will still be preserved. Let's look at an example: .. doctest:: >>> bi = bidict({1: -1}) >>> ob = OrderedBidict({1: -1}) >>> bi.forceupdate({2: -2, 3: -1}) >>> ob.forceupdate({2: -2, 3: -1}) This update changes the key of the existing item with value -1. In the ordered bidict, this change is performed in-place, preserving the insertion order. The item with value -1 was the first item inserted, and it remains the first item even after the update: >>> ob OrderedBidict({3: -1, 2: -2}) In the plain bidict, however, the changed item has now been moved to the end: >>> bi bidict({2: -2, 3: -1}) Note that if you insert an item that changes the key of one existing item and the value of another existing item, the behavior described in :ref:`basic-usage:collapsing overwrites` still applies. Trade-offs ++++++++++ Like plain bidicts (and plain dicts too, for that matter), ordered bidicts take *O(n)* space. But to preserve insertion order, as well as implement the :ref:`extra-order-sensitive-apis` in constant time, it costs :class:`~bidict.OrderedBidict` a higher constant factor in its *O(n)* space complexity. If you depend on preserving insertion order, an unordered bidict may be sufficient if: * you'll never mutate it (in which case, use a :class:`~bidict.frozenbidict`), or: * you only mutate by removing and/or adding whole new items, never changing just the key or value of an existing item, or: * you are okay with inconsistent ordering between a bidict and its inverse after changing the key or value of an existing item, as well as with items moving to the end when you change their key rather than being changed in place. That said, if your code depends on the ordering, using an :class:`~bidict.OrderedBidict` makes for clearer code, and ensures that insertion order will be preserved no matter what mutations you perform. The :ref:`extra-order-sensitive-apis` that :class:`~bidict.OrderedBidict` gives you also expand the range of use cases where your bidict would be suitable, as mentioned above. Reversing a bidict ------------------ All provided bidict types are reversible (since they are backed by dicts, which are themselves reversible on all supported Python versions as of CPython 3.8+). .. doctest:: >>> b = bidict({1: 'one', 2: 'two', 3: 'three'}) >>> list(reversed(b)) [3, 2, 1] >>> list(reversed(b.items())) # keys/values/items views are reversible too [(3, 'three'), (2, 'two'), (1, 'one')] Polymorphism ------------ Code that needs to check only whether an object is *dict-like* should not use ``isinstance(obj, dict)``. This check is too specific, because dict-like objects need not actually be instances of dict or a dict subclass. You can see this for many dict-like objects in the standard library: .. doctest:: >>> from collections import ChainMap >>> chainmap = ChainMap() >>> isinstance(chainmap, dict) False The same is true for all the bidict types: .. doctest:: >>> bi = bidict() >>> isinstance(bi, dict) False A better way to check whether an object is dict-like is to use the :class:`~collections.abc.Mapping` abstract base class (ABC) from the :mod:`collections.abc` module, which provides a number of ABCs intended for this purpose: .. doctest:: >>> isinstance(chainmap, Mapping) True >>> isinstance(bi, Mapping) True Also note that the proper way to check whether an object is a mutable mapping is to use the :class:`~collections.abc.MutableMapping` ABC: .. doctest:: >>> isinstance(chainmap, MutableMapping) True >>> isinstance(bi, MutableMapping) True To illustrate this, here's an example of how you can combine the above with bidict's own :class:`~bidict.BidirectionalMapping` ABC to implement your own check for whether an object is an immutable bidirectional mapping: .. doctest:: >>> def is_immutable_bimap(obj): ... return ( ... isinstance(obj, BidirectionalMapping) ... and not isinstance(obj, MutableMapping)) >>> is_immutable_bimap(bidict()) False >>> is_immutable_bimap(frozenbidict()) True For more you can do with :mod:`bidict`, check out :doc:`extending` next. bidict-0.24.1/docs/other-functionality.rst000066400000000000000000000016071524342314000205270ustar00rootroot00000000000000Other Functionality =================== :func:`bidict.inverted` ----------------------- Bidict provides the :class:`~bidict.inverted` iterator to help you get inverse items from various types of objects. Pass in a mapping to get the inverse mapping: .. doctest:: >>> from bidict import inverted >>> it = inverted({1: 'one'}) >>> {k: v for (k, v) in it} {'one': 1} ...an iterable of pairs to get the pairs' inverses: .. doctest:: >>> list(inverted([(1, 'one'), (2, 'two')])) [('one', 1), ('two', 2)] >>> list(inverted((i*i, i) for i in range(2, 5))) [(2, 4), (3, 9), (4, 16)] ...or any object implementing an ``__inverted__`` method, which objects that already know their own inverses (such as bidicts) can implement themselves: .. doctest:: >>> dict(inverted(bidict({1: 'one'}))) {'one': 1} >>> list(inverted(OrderedBidict({2: 4, 3: 9}))) [(4, 2), (9, 3)] bidict-0.24.1/docs/thanks.rst000066400000000000000000000037571524342314000160200ustar00rootroot00000000000000Thanks ------ Bidict has benefited from the assistance of many people and projects. People ====== - Gregory Ewing for the name. - Terry Reedy for suggesting the slice syntax (it was fun while it lasted). - Raymond Hettinger for providing feedback on the design and implementation, and (most of all) for the amazing work on Python's built-in collections that made bidict possible. - Francis Carr for the idea of storing the inverse bidict. - Adopt Pytest Month 2015 for choosing bidict, Tom Viner for being bidict's Adopt Pytest helper for the month, and Brianna Laugher for coordinating. - Zac Hatfield-Dodds for the amazing work (as well as soliciting feedback) on `Hypothesis `__, `Hypofuzz `__, and `Pytest `__. - Harrison Goldstein for building `Tyche `__ and showing me how to use it. - Daniel Pope, Leif Walsh, David Turner, Itamar Turner-Trauring, and Michael Arntzenius for suggestions, code reviews, and design discussion. - Jozef Knaperek for the bugfix. - Igor Nehoroshev for contributing the py.typed marker. - Bernát Gábor for pyproject.toml support. - Richard Sanger, Zeyi Wang, Brian Maissy, and Amol Sahsrabudhe for reporting bugs. Projects ======== - `Python `__ - `GitHub `__ - `Tidelift `__ - `Pytest `__ - `Hypothesis `__ - `Tyche `__ - `Pytest-Benchmark `__ - `Coverage `__ - `Codecov `__ - `Sphinx `__ - `Readthedocs `__ - `ty `__ - `ruff `__ - `prek `__ bidict-0.24.1/flake.lock000066400000000000000000000026701524342314000147730ustar00rootroot00000000000000{ "nodes": { "flake-utils": { "inputs": { "systems": "systems" }, "locked": { "lastModified": 1731533236, "narHash": "sha256-l0KFg5HjrsfsO/JpG+r7fRrqm12kzFHyUHqHCVpMMbI=", "owner": "numtide", "repo": "flake-utils", "rev": "11707dc2f618dd54ca8739b309ec4fc024de578b", "type": "github" }, "original": { "owner": "numtide", "repo": "flake-utils", "type": "github" } }, "nixpkgs": { "locked": { "lastModified": 1783081925, "narHash": "sha256-CtXGh9RHsbGiXDljN3C8hOA18phgOJx3ZIQqmPSMHIE=", "owner": "NixOS", "repo": "nixpkgs", "rev": "d1143607239da8ffdee02379643f74cd3e4733c5", "type": "github" }, "original": { "owner": "NixOS", "repo": "nixpkgs", "type": "github" } }, "root": { "inputs": { "flake-utils": "flake-utils", "nixpkgs": "nixpkgs" } }, "systems": { "locked": { "lastModified": 1681028828, "narHash": "sha256-Vy1rq5AaRuLzOxct8nz4T6wlgyUR7zLU309k9mBC768=", "owner": "nix-systems", "repo": "default", "rev": "da67096a3b9bf56a91d16901293e51ba5b49a27e", "type": "github" }, "original": { "owner": "nix-systems", "repo": "default", "type": "github" } } }, "root": "root", "version": 7 } bidict-0.24.1/flake.nix000066400000000000000000000075631524342314000146470ustar00rootroot00000000000000{ description = "bidict"; inputs = { flake-utils.url = "github:numtide/flake-utils"; nixpkgs.url = "github:NixOS/nixpkgs"; }; outputs = { self, flake-utils, nixpkgs }: flake-utils.lib.eachDefaultSystem (system: let pkgs = import nixpkgs { inherit system; }; lib = pkgs.lib; # TODO: Change to pkgs.python315 once we pick up a stable release: latestPython = pkgs.python314; commonTools = with pkgs; [prek uv]; supportedPythons = with pkgs; [ python315 python314 python313 python312 python311 pypy3 ]; mkPathPrefix = packages: ''export PATH="${lib.makeBinPath packages}:$PATH"''; mkUvShellHook = { packages, python ? null, projectEnv ? null, syncArgs ? null, activate ? false, extraShellHook ? "", }: lib.concatStringsSep "\n" ( lib.filter (line: line != "") [ (mkPathPrefix packages) (if projectEnv != null then ''export UV_PROJECT_ENVIRONMENT="${projectEnv}"'' else "") (if python != null then ''export UV_PYTHON="${python.interpreter}"'' else "") (if python != null then ''export UV_PYTHON_DOWNLOADS=never'' else "") (if syncArgs != null then "uv sync ${syncArgs}" else "") extraShellHook (if activate && projectEnv != null then ''source "$UV_PROJECT_ENVIRONMENT/bin/activate"'' else "") ] ); mkUvShell = { python, projectEnv ? null, syncArgs ? null, activate ? false, extraPackages ? [], extraShellHook ? "", }: let packages = commonTools ++ [python] ++ extraPackages; in pkgs.mkShell { inherit packages; shellHook = mkUvShellHook { inherit packages python projectEnv syncArgs activate extraShellHook; }; }; mkTestShell = { python, projectEnv }: mkUvShell { inherit python projectEnv; syncArgs = "--only-group=test"; activate = true; extraShellHook = '' uv pip install --python "$UV_PROJECT_ENVIRONMENT/bin/python" --no-deps -e . ''; }; in { devShells = { default = let packages = commonTools ++ supportedPythons; in pkgs.mkShell { inherit packages; shellHook = mkUvShellHook { inherit packages; python = latestPython; projectEnv = ".venv"; activate = true; extraShellHook = '' ./init_dev_env ''; }; }; benchmark = mkUvShell { python = latestPython; projectEnv = ".venv-benchmark"; syncArgs = "--only-group=test"; activate = true; }; build = mkUvShell { python = pkgs.python313; }; lint = pkgs.mkShell { packages = with pkgs; [prek]; shellHook = mkPathPrefix [pkgs.prek]; }; test311 = mkTestShell { python = pkgs.python311; projectEnv = ".venv-test-3.11"; }; test312 = mkTestShell { python = pkgs.python312; projectEnv = ".venv-test-3.12"; }; test313 = mkTestShell { python = pkgs.python313; projectEnv = ".venv-test-3.13"; }; test314 = mkTestShell { python = pkgs.python314; projectEnv = ".venv-test-3.14"; }; test315 = mkTestShell { python = pkgs.python315; projectEnv = ".venv-test-3.15"; }; testPyPy311 = mkTestShell { python = pkgs.pypy3; projectEnv = ".venv-test-pypy3.11"; }; update_deps = mkUvShell { python = latestPython; }; }; }); } bidict-0.24.1/init_dev_env000077500000000000000000000011671524342314000154360ustar00rootroot00000000000000#!/usr/bin/env bash # # Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. # shellcheck disable=SC1091 set -euo pipefail declare -r hint="Hint: Use 'nix develop' to bootstrap a development environment" for cmd in uv prek; do if ! command -v "$cmd" >/dev/null 2>&1; then >&2 echo "Error: No '$cmd' on PATH. $hint" exit 1 fi done prek install -f uv sync --all-groups echo "Development virtualenv initialized" bidict-0.24.1/microbenchmarks.py000066400000000000000000000403771524342314000165660ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. """Microbenchmarks. Uses https://pytest-benchmark.readthedocs.io/en/v4.0.0/pedantic.html which pairs well with ../cachegrind.py (as used by ../.github/workflows/benchmark.yml). """ from __future__ import annotations import pickle import typing as t from collections import deque from functools import partial import pytest import bidict consume: t.Any = partial(deque, maxlen=0) #: Rounds per benchmark. The reported figure is the min over these, so that one unlucky #: sample cannot dominate a result. pedantic() defaults to a single round, i.e. no filtering. ROUNDS = 5 #: Iterations per round for an operation too cheap to time on its own. Running this suite #: under Cachegrind puts a fixed floor of roughly 25us on a single timed call -- three orders #: of magnitude more than e.g. a lookup costs -- so unless the operation is repeated within #: the round, the result is nearly all floor and carries no signal. Only valid for operations #: that can be repeated without fresh setup. CHEAP_ITERATIONS = 1000 #: Roughly how many items a single round should process, for operations whose cost scales #: with the number of items. See :func:`scaled_iterations`. TARGET_ITEMS_PER_ROUND = 20_000 def scaled_iterations(n: int) -> int: """Iterations per round for an operation whose cost scales with *n*. Keeps the work done per round roughly constant across sizes, so that the smallest sizes clear the measurement floor described above without making the largest ones slow. """ return max(1, TARGET_ITEMS_PER_ROUND // n) #: Writes performed per timed call by the single-item write benchmarks below. #: #: Those benchmarks cannot use `iterations`: each needs a bidict in a known state, setup runs #: once per round rather than once per iteration, and repeating a write would not exercise the #: same path the second time. That left one write per timed call, which at roughly a microsecond #: is far under the floor above, so the reported figure was nearly all floor. Batching this many #: writes into a single timed call lifts them clear of it, at a fraction of what raising `rounds` #: to the same effect would cost, since the per-round setup copies the whole bidict. #: #: They therefore measure the cost of a run of writes rather than of one in isolation. For the #: smaller sizes the batch consumes most of the contained items, so the bidict grows or shrinks #: appreciably during it -- which is representative, and identical across the revisions being #: compared, so it does not affect what the comparison means. WRITES_PER_ROUND = 1_000 def scaled_writes(n: int) -> int: """How many writes the single-item write benchmarks perform per timed call, for size *n*. Capped by *n*, since some of them consume a distinct contained item per write. """ return min(n, WRITES_PER_ROUND) LENS = (100, 1_000, 10_000) DATASET_NAMES = ('int', 'str') INT_DICTS_BY_LEN: dict[int, dict[int, int]] = {n: {i: i for i in range(n)} for n in LENS} STR_DICTS_BY_LEN: dict[int, dict[str, str]] = {n: {f'key{i}': f'value{i}' for i in range(n)} for n in LENS} DICTS_BY_KIND_AND_LEN: dict[str, dict[int, dict[t.Any, t.Any]]] = { 'int': INT_DICTS_BY_LEN, 'str': STR_DICTS_BY_LEN, } BIDICTS_BY_KIND_AND_LEN: dict[str, dict[int, bidict.bidict[t.Any, t.Any]]] = { kind: {n: bidict.bidict(other) for n, other in dicts_by_len.items()} for kind, dicts_by_len in DICTS_BY_KIND_AND_LEN.items() } LOOKUP_ITEMS_BY_KIND_AND_LEN: dict[str, dict[int, tuple[t.Any, t.Any]]] = { kind: {n: next(iter(other.items())) for n, other in dicts_by_len.items()} for kind, dicts_by_len in DICTS_BY_KIND_AND_LEN.items() } INT_BIDICTS_BY_LEN: dict[int, bidict.bidict[int, int]] = t.cast( 'dict[int, bidict.bidict[int, int]]', BIDICTS_BY_KIND_AND_LEN['int'], ) ORDERED_BIDICTS_BY_LEN: dict[int, bidict.OrderedBidict[int, int]] = { n: bidict.OrderedBidict(INT_DICTS_BY_LEN[n]) for n in LENS } INT_DICTS_BY_LEN_DUPVAL_EARLY: dict[int, dict[int, int]] = { n: dict([(0, 0), (1, 0), *((i, i) for i in range(2, n))]) for n in LENS } INT_DICTS_BY_LEN_DUPVAL_LATE: dict[int, dict[int, int]] = {n: {**INT_DICTS_BY_LEN[n], n - 1: 0} for n in LENS} # One batch of items per single-item write benchmark, sized by scaled_writes(). Every item in # a batch takes the same path through the code as the others, so the batch measures that path. #: New keys and new values: no duplication. SETITEM_NEW_ITEMS_BY_LEN: dict[int, list[tuple[int, int]]] = { n: [(-i, -i) for i in range(1, scaled_writes(n) + 1)] for n in LENS } SETITEM_NEW_RESULTS_BY_LEN: dict[int, dict[int, int]] = { n: INT_DICTS_BY_LEN[n] | dict(SETITEM_NEW_ITEMS_BY_LEN[n]) for n in LENS } #: Contained keys paired with new values: key duplication. SETITEM_REPLACE_ITEMS_BY_LEN: dict[int, list[tuple[int, int]]] = { n: [(n - i, -i) for i in range(1, scaled_writes(n) + 1)] for n in LENS } SETITEM_REPLACE_RESULTS_BY_LEN: dict[int, dict[int, int]] = { n: INT_DICTS_BY_LEN[n] | dict(SETITEM_REPLACE_ITEMS_BY_LEN[n]) for n in LENS } #: New keys paired with contained values: value duplication, collapsing an item each time. FORCEPUT_ITEMS_BY_LEN: dict[int, list[tuple[int, int]]] = { n: [(-i, i - 1) for i in range(1, scaled_writes(n) + 1)] for n in LENS } FORCEPUT_RESULTS_BY_LEN: dict[int, dict[int, int]] = { n: {k: v for k, v in INT_DICTS_BY_LEN[n].items() if k >= scaled_writes(n)} | dict(FORCEPUT_ITEMS_BY_LEN[n]) for n in LENS } POP_KEYS_BY_LEN: dict[int, list[int]] = {n: [n - i for i in range(1, scaled_writes(n) + 1)] for n in LENS} POP_RESULTS_BY_LEN: dict[int, dict[int, int]] = { n: {k: v for k, v in INT_DICTS_BY_LEN[n].items() if k not in set(POP_KEYS_BY_LEN[n])} for n in LENS } PARTIAL_OVERLAP_UPDATES_BY_LEN: dict[int, dict[int, int]] = { n: {i: i for i in range(n // 2, n + (n // 2))} for n in LENS } PARTIAL_OVERLAP_RESULTS_BY_LEN: dict[int, dict[int, int]] = { n: (INT_DICTS_BY_LEN[n] | PARTIAL_OVERLAP_UPDATES_BY_LEN[n]) for n in LENS } BIDICT_AND_DICT_LAST_TWO_ITEMS_DIFFERENT_ORDER: dict[int, tuple[bidict.bidict[int, int], dict[int, int]]] = {} ORDERED_BIDICT_AND_DICT_LAST_TWO_ITEMS_DIFFERENT_ORDER: dict[ int, tuple[bidict.OrderedBidict[int, int], dict[int, int]] ] = {} for _i in LENS: _bi = INT_BIDICTS_BY_LEN[_i] _d = dict(_bi) _last, _secondlast = _d.popitem(), _d.popitem() _d[_last[0]] = _last[1] # new second-last _d[_secondlast[0]] = _secondlast[1] # new last BIDICT_AND_DICT_LAST_TWO_ITEMS_DIFFERENT_ORDER[_i] = (_bi, _d) ORDERED_BIDICT_AND_DICT_LAST_TWO_ITEMS_DIFFERENT_ORDER[_i] = ( bidict.OrderedBidict(_bi), _d, ) def _setitem(bi: bidict.bidict[int, int], items: list[tuple[int, int]], _expected: dict[int, int]) -> None: for key, val in items: bi[key] = val def _forceput(bi: bidict.bidict[int, int], items: list[tuple[int, int]], _expected: dict[int, int]) -> None: for key, val in items: bi.forceput(key, val) def _update(bi: bidict.bidict[int, int], other: dict[int, int], _expected: dict[int, int]) -> None: bi.update(other) def _failing_update(bi: bidict.bidict[int, int], other: dict[int, int], _expected: dict[int, int]) -> None: with pytest.raises(bidict.DuplicationError): bi.update(other) def _pop(bi: bidict.bidict[int, int], keys: list[int], _expected: dict[int, int]) -> None: for key in keys: bi.pop(key) def _assert_mapping_matches(*args: t.Any) -> None: assert dict(args[0]) == args[-1] def _setup_setitem_new(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ((INT_BIDICTS_BY_LEN[n].copy(), SETITEM_NEW_ITEMS_BY_LEN[n], SETITEM_NEW_RESULTS_BY_LEN[n]), {}) def _setup_setitem_replace_existing_key(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ((INT_BIDICTS_BY_LEN[n].copy(), SETITEM_REPLACE_ITEMS_BY_LEN[n], SETITEM_REPLACE_RESULTS_BY_LEN[n]), {}) def _setup_forceput_existing_value(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ((INT_BIDICTS_BY_LEN[n].copy(), FORCEPUT_ITEMS_BY_LEN[n], FORCEPUT_RESULTS_BY_LEN[n]), {}) def _setup_pop(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ((INT_BIDICTS_BY_LEN[n].copy(), POP_KEYS_BY_LEN[n], POP_RESULTS_BY_LEN[n]), {}) def _setup_update_partial_overlap(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ( ( INT_BIDICTS_BY_LEN[n].copy(), PARTIAL_OVERLAP_UPDATES_BY_LEN[n], PARTIAL_OVERLAP_RESULTS_BY_LEN[n], ), {}, ) def _setup_failing_update_early(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ( ( INT_BIDICTS_BY_LEN[n].copy(), INT_DICTS_BY_LEN_DUPVAL_EARLY[n], INT_DICTS_BY_LEN[n], ), {}, ) def _setup_failing_update_late(n: int) -> tuple[tuple[t.Any, ...], dict[str, t.Any]]: return ( ( INT_BIDICTS_BY_LEN[n].copy(), INT_DICTS_BY_LEN_DUPVAL_LATE[n], INT_DICTS_BY_LEN[n], ), {}, ) @pytest.mark.parametrize('kind', DATASET_NAMES) @pytest.mark.parametrize('n', LENS) def test_bi_init_from_dict(kind: str, n: int, benchmark: t.Any) -> None: """Benchmark initializing a new bidict from a dict.""" other = DICTS_BY_KIND_AND_LEN[kind][n] benchmark.pedantic(bidict.bidict, args=(other,), rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_bi_init_from_bi(n: int, benchmark: t.Any) -> None: """Benchmark initializing a bidict from another bidict.""" other = INT_BIDICTS_BY_LEN[n] benchmark.pedantic(bidict.bidict, args=(other,), rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_bi_init_fail_early_dupval(n: int, benchmark: t.Any) -> None: """Benchmark failing initialization when a duplicate value appears near the start.""" other = INT_DICTS_BY_LEN_DUPVAL_EARLY[n] def failing_init() -> None: with pytest.raises(bidict.DuplicationError): bidict.bidict(other) benchmark.pedantic(failing_init, rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_bi_init_fail_late_dupval(n: int, benchmark: t.Any) -> None: """Benchmark failing initialization when a duplicate value appears at the end.""" other = INT_DICTS_BY_LEN_DUPVAL_LATE[n] def failing_init() -> None: with pytest.raises(bidict.DuplicationError): bidict.bidict(other) benchmark.pedantic(failing_init, rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('kind', DATASET_NAMES) @pytest.mark.parametrize('n', LENS) def test_bi_getitem_present(kind: str, n: int, benchmark: t.Any) -> None: """Benchmark forward lookup of an existing key.""" bi = BIDICTS_BY_KIND_AND_LEN[kind][n] key, val = LOOKUP_ITEMS_BY_KIND_AND_LEN[kind][n] result = benchmark.pedantic(bi.__getitem__, args=(key,), rounds=ROUNDS, iterations=CHEAP_ITERATIONS) assert result == val @pytest.mark.parametrize('kind', DATASET_NAMES) @pytest.mark.parametrize('n', LENS) def test_bi_inverse_getitem_present(kind: str, n: int, benchmark: t.Any) -> None: """Benchmark inverse lookup of an existing value.""" bi = BIDICTS_BY_KIND_AND_LEN[kind][n] key, val = LOOKUP_ITEMS_BY_KIND_AND_LEN[kind][n] result = benchmark.pedantic(bi.inverse.__getitem__, args=(val,), rounds=ROUNDS, iterations=CHEAP_ITERATIONS) assert result == key @pytest.mark.parametrize('n', LENS) def test_bi_setitem_new_item(n: int, benchmark: t.Any) -> None: """Benchmark inserting new items into an existing bidict.""" benchmark.pedantic( _setitem, setup=lambda n=n: _setup_setitem_new(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_setitem_replace_existing_key(n: int, benchmark: t.Any) -> None: """Benchmark replacing the values of existing keys with new unique values.""" benchmark.pedantic( _setitem, setup=lambda n=n: _setup_setitem_replace_existing_key(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_forceput_existing_value(n: int, benchmark: t.Any) -> None: """Benchmark forceput when each provided value is already associated with another key.""" benchmark.pedantic( _forceput, setup=lambda n=n: _setup_forceput_existing_value(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_pop_existing_key(n: int, benchmark: t.Any) -> None: """Benchmark popping existing keys.""" benchmark.pedantic( _pop, setup=lambda n=n: _setup_pop(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_update_partial_overlap(n: int, benchmark: t.Any) -> None: """Benchmark updating from a mapping with a mix of overlapping and new items.""" benchmark.pedantic( _update, setup=lambda n=n: _setup_update_partial_overlap(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_update_fail_early_dupval(n: int, benchmark: t.Any) -> None: """Benchmark a bulk update that fails near the start and rolls back.""" benchmark.pedantic( _failing_update, setup=lambda n=n: _setup_failing_update_early(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_update_fail_late_dupval(n: int, benchmark: t.Any) -> None: """Benchmark a bulk update that fails at the end and rolls back.""" benchmark.pedantic( _failing_update, setup=lambda n=n: _setup_failing_update_late(n), teardown=_assert_mapping_matches, rounds=ROUNDS, ) @pytest.mark.parametrize('n', LENS) def test_bi_iter(n: int, benchmark: t.Any) -> None: """Benchmark iterating over a bidict.""" bi = INT_BIDICTS_BY_LEN[n] # Build the iterator inside the timed callable: one pre-built and passed via args # would already be exhausted by the second of the repeated calls below. benchmark.pedantic(lambda: consume(iter(bi)), rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_orderedbi_iter(n: int, benchmark: t.Any) -> None: """Benchmark iterating over an OrderedBidict.""" ob = ORDERED_BIDICTS_BY_LEN[n] # Build the iterator inside the timed callable: one pre-built and passed via args # would already be exhausted by the second of the repeated calls below. benchmark.pedantic(lambda: consume(iter(ob)), rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_bi_equals_with_equal_dict(n: int, benchmark: t.Any) -> None: """Benchmark bidict.__eq__ with an equivalent dict.""" bi, d = BIDICT_AND_DICT_LAST_TWO_ITEMS_DIFFERENT_ORDER[n] result = benchmark.pedantic(bi.__eq__, args=(d,), rounds=ROUNDS, iterations=scaled_iterations(n)) assert result @pytest.mark.parametrize('n', LENS) def test_orderedbi_items_equals_with_equal_dict_items(n: int, benchmark: t.Any) -> None: """Benchmark OrderedBidict.items().__eq__ with equivalent dict_items.""" ob, d = ORDERED_BIDICT_AND_DICT_LAST_TWO_ITEMS_DIFFERENT_ORDER[n] result = benchmark.pedantic(ob.items().__eq__, args=(d.items(),), rounds=ROUNDS, iterations=scaled_iterations(n)) assert result @pytest.mark.parametrize('n', LENS) def test_copy(n: int, benchmark: t.Any) -> None: """Benchmark creating a copy of a bidict.""" bi = INT_BIDICTS_BY_LEN[n] benchmark.pedantic(bi.copy, rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_pickle(n: int, benchmark: t.Any) -> None: """Benchmark pickling a bidict.""" bi = INT_BIDICTS_BY_LEN[n] benchmark.pedantic(pickle.dumps, args=(bi,), rounds=ROUNDS, iterations=scaled_iterations(n)) @pytest.mark.parametrize('n', LENS) def test_unpickle(n: int, benchmark: t.Any) -> None: """Benchmark unpickling a bidict.""" bp = pickle.dumps(INT_BIDICTS_BY_LEN[n]) benchmark.pedantic(pickle.loads, args=(bp,), rounds=ROUNDS, iterations=scaled_iterations(n)) bidict-0.24.1/pyproject.toml000066400000000000000000000134051524342314000157510ustar00rootroot00000000000000[project] name = "bidict" version = "0.24.1" description = "The bidirectional mapping library for Python." authors = [{ name = "Joshua Bronson", email = "jabronson@gmail.com" }] license = "MPL-2.0" license-files = ["LICENSE"] dependencies = [ # bidict/_typing.py's `typing`/`typing_extensions` imports branch on python<3.12 "typing_extensions>=4.0; python_version<'3.12'", ] requires-python = ">=3.11" readme = "README.rst" keywords = [ "bidict", "bimap", "bidirectional", "dict", "dictionary", "mapping", "collections", ] classifiers = [ "Operating System :: OS Independent", "Programming Language :: Python :: Implementation :: CPython", "Programming Language :: Python :: Implementation :: PyPy", "Typing :: Typed", ] [project.urls] # https://github.com/pypi/warehouse/blob/main/warehouse/templates/packaging/detail.html#L20-L62 Changelog = "https://bidict.readthedocs.io/changelog.html" Documentation = "https://bidict.readthedocs.io" Sponsor = "https://bidict.readthedocs.io/#sponsoring" Repository = "https://github.com/jab/bidict" [dependency-groups] test = [ "coverage", "hypothesis", "pytest", "pytest-benchmark", "pytest-sphinx", "pytest-xdist", "sortedcollections", "sortedcontainers", "ty>=0.0.72", "typing_extensions", ] dev = [ "pytest-clarity", "pytest-icdiff", "pytest-sugar", "tox", "tox-uv", ] docs = [ "sphinx", "sphinx-copybutton", "furo", ] [tool.uv] default-groups = ["test", "dev", "docs"] [tool.uv.build-backend] module-root = "" source-exclude = [".mypy_cache"] [build-system] # uv_build, not the uv on PATH, is what writes the wheel's RECORD, and it comes from this pin. # The floor is load-bearing: 0.24.0 shipped hex-encoded RECORD hashes (#406) because the pin # read >=0.7.13,<0.8.0, so it kept resolving uv_build to 0.7.22 long after 0.8.13 fixed them to # be urlsafe-base64 as the spec requires, and 0.7.x got no backport. Keeping the floor at that # fix, rather than raising it in lockstep with the ceiling, means every version this admits # writes a valid RECORD even if the ceiling goes stale again, and leaves distro packagers a # wide range to build the sdist against whatever uv_build they ship. # The ceiling is only change control, and is what uv recommends (it warns without one). Keep it # covering the uv in uv.lock, so `uv build` keeps using that uv's built-in uv_build rather than # downloading one; update_dev_dependencies checks this. requires = ["uv_build>=0.8.13,<0.12"] build-backend = "uv_build" [tool.ty.src] include = ["bidict", "tests"] [tool.ty.terminal] error-on-warning = true [tool.ty.rules] # ty has no `strict`-mode bundle like mypy's; instead, ratchet up the rules that # default to `warn`/`ignore` but that we want enforced as errors. `error-on-warning` # above already makes the `warn`-level rules fatal; the following promote rules that # default to `ignore` (so are otherwise silent even under `error-on-warning`). missing-type-argument = "error" # analogous to mypy's disallow_any_generics missing-override-decorator = "error" # require @override on overriding methods [tool.ruff] preview = true line-length = 121 # Ruff's default rule set grows between minor versions, so an older ruff than the one pinned in # .pre-commit-config.yaml lints with fewer rules and passes code that CI rejects. Fail on that # rather than let it be discovered in CI. ./update_dev_dependencies checks these two stay in step. required-version = ">=0.16.4" [tool.ruff.lint] # https://docs.astral.sh/ruff/rules/ # Whole linters, selected by prefix. Individual rules are selected by name below, since # a name says what it checks where a code does not. extend-select = [ "A", "ARG", "B", "BLE", "E", "F", "FA", "FLY", "FURB", "G", "I", "ICN", "PERF", "PGH", "PIE", "PT", "PTH", "RET", "RSE", "RUF", "SLOT", "T20", "TID", "UP", "W", "YTT", # Individual rules, from linters whose other rules do not suit this codebase: "debugger", "runtime-cast-value", # keeps cast()'s type expression from being evaluated at runtime "unspecified-encoding", # text I/O should not depend on the machine's locale ] ignore = [ "in-dict-keys", # https://github.com/astral-sh/ruff/issues/4481 "non-empty-init-module", # Allow __init__.py to set __module__ on re-exported classes "unaliased-collections-abc-set-import", # Prefer `Set` over `AbstractSet` for readability "useless-import-alias", # Allow explicit re-exports (import X as X) ] # Rules that know about typing should treat what bidict._typing re-exports the same way. typing-modules = ["bidict._typing"] [tool.ruff.lint.per-file-ignores] "cachegrind.py" = ["print"] # printing its results is what this script is for [tool.ruff.lint.isort] force-single-line = true lines-after-imports = 2 [tool.ruff.format] docstring-code-format = true docstring-code-line-length = "dynamic" preview = true quote-style = "single" # Keep the code (especially in the docs' doctests) matching Python's output [tool.pytest] addopts = [ "-vv", "--doctest-modules", "--doctest-glob=docs/*.rst", "--durations=5", "--hypothesis-profile=less-examples", "--numprocesses=auto", # Benchmarks are run separately (see the benchmark tox env and workflow, which # invoke pytest with `-c /dev/null` to bypass this config), so unload # pytest-benchmark here. Otherwise, being installed, it loads on every run and # warns under xdist (which addopts enables above) that it is auto-disabling itself. "-p", "no:benchmark", ] doctest_optionflags = ["ELLIPSIS"] # Treat warnings as errors so deprecations etc. fail the suite instead of going # unnoticed. (The benchmark plugin is unloaded above so its xdist warning # doesn't trip this.) filterwarnings = ["error"] strict = true testpaths = ["bidict", "tests", "docs"] bidict-0.24.1/tests/000077500000000000000000000000001524342314000141745ustar00rootroot00000000000000bidict-0.24.1/tests/bidict_test_fixtures.py000066400000000000000000000272261524342314000210050ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. from __future__ import annotations import operator import pickle import typing as t from collections import OrderedDict from collections import UserDict from collections.abc import Iterable from collections.abc import KeysView from collections.abc import Mapping from collections.abc import MutableMapping from collections.abc import Reversible from dataclasses import dataclass from itertools import chain from itertools import combinations from bidict import DROP_NEW from bidict import DROP_OLD from bidict import ON_DUP_DROP_OLD from bidict import RAISE from bidict import BidictBase from bidict import DuplicationError from bidict import KeyAndValueDuplicationError from bidict import KeyDuplicationError from bidict import MutableBidirectionalMapping from bidict import OnDup from bidict import OrderedBidict from bidict import OrderedBidictBase from bidict import ValueDuplicationError from bidict import bidict from bidict import frozenbidict from bidict._typing import Maplike from bidict._typing import MapOrItems from bidict._typing import override KT = t.TypeVar('KT') VT = t.TypeVar('VT') class SupportsKeysAndGetItem(t.Generic[KT, VT]): def __init__(self, *args: t.Any, **kw: t.Any) -> None: # This fixture trusts its *args/**kw (typed Any); dict(**kw) yields str keys, so cast to the declared type. self._mapping = t.cast('Mapping[KT, VT]', dict(*args, **kw)) def keys(self) -> KeysView[KT]: return self._mapping.keys() def __getitem__(self, key: KT) -> VT: return self._mapping[key] BB = BidictBase[KT, VT] BT = type[BidictBase[KT, VT]] user_bidict_types: list[BT[t.Any, t.Any]] = [] _B = t.TypeVar('_B', bound=BidictBase[t.Any, t.Any]) _BT = t.TypeVar('_BT', bound=type[BidictBase[t.Any, t.Any]]) def pickle_copy(b: _B, protocol: int | None = None) -> _B: return pickle.loads(pickle.dumps(b, protocol)) def user_bidict(cls: _BT) -> _BT: # Preserve the exact decorated class type (a plain `BT[KT, VT]` return would widen it to BidictBase). user_bidict_types.append(cls) return cls @user_bidict class UserBi(bidict[KT, VT]): _fwdm_cls = UserDict _invm_cls = UserDict @user_bidict class UserOrderedBi(OrderedBidict[KT, VT]): _fwdm_cls = UserDict _invm_cls = UserDict @user_bidict class UserBiNotOwnInv(bidict[KT, VT]): """A custom bidict whose inverse class is not itself.""" _fwdm_cls = dict _invm_cls = UserDict @user_bidict class UserBiBackedByDictSub(bidict[KT, VT]): """A bidict backed by a dict *subclass*, which gets the same native views as a dict.""" _fwdm_cls = OrderedDict _invm_cls = OrderedDict @user_bidict class UserOrderedBiBase(OrderedBidictBase[KT, VT]): """An immutable ordered bidict, i.e. an OrderedBidictBase that is not an OrderedBidict. Uses a permissive on_dup so that even a bulk __init__ can overwrite an existing item. That is what makes the backing mappings' order diverge from the bidict's own order, which is otherwise only reachable by mutating an OrderedBidict. """ on_dup = ON_DUP_DROP_OLD UserBiNotOwnInvInv = UserBiNotOwnInv._inv_cls assert UserBiNotOwnInvInv is not UserBiNotOwnInv BTs = tuple[BT[t.Any, t.Any], ...] builtin_bidict_types: BTs = (bidict, frozenbidict, OrderedBidict) bidict_types: BTs = (*builtin_bidict_types, *user_bidict_types) update_arg_types = (*bidict_types, list, dict, iter, SupportsKeysAndGetItem) mutable_bidict_types: BTs = tuple(t for t in bidict_types if issubclass(t, MutableBidirectionalMapping)) assert frozenbidict not in mutable_bidict_types MBT = type[bidict[KT, VT]] | type[OrderedBidict[KT, VT]] def should_be_reversible(bi_t: BT[KT, VT]) -> bool: # Every ordered bidict is reversible regardless of its backing mappings, since it # iterates its linked list rather than them. Any other bidict is reversible exactly # when both its backing mappings are. if bi_t in builtin_bidict_types or issubclass(bi_t, OrderedBidictBase): return True return all(issubclass(i, Reversible) for i in (bi_t._fwdm_cls, bi_t._invm_cls)) assert all(not should_be_reversible(bi_t) or issubclass(bi_t, Reversible) for bi_t in bidict_types) def powerset(iterable: Iterable[t.Any]) -> Iterable[tuple[t.Any, ...]]: iterable = tuple(iterable) return chain.from_iterable(combinations(iterable, r) for r in range(len(iterable) + 1)) SET_OPS: t.Any = ( operator.le, operator.lt, operator.gt, operator.ge, operator.eq, operator.ne, operator.and_, operator.or_, operator.sub, operator.xor, (lambda x, y: x.isdisjoint(y)), ) DEFAULT_ON_DUP = OnDup(DROP_OLD, RAISE) @dataclass class Oracle(t.Generic[KT, VT]): data: dict[KT, VT] ordered: bool @property def data_inv(self) -> dict[VT, KT]: return {v: k for (k, v) in self.data.items()} def assert_match(self, bi: BidictBase[KT, VT]) -> None: assert dict(bi) == self.data assert dict(bi.inv) == self.data_inv self.assert_items_match(bi) def assert_items_match(self, bi: BidictBase[KT, VT]) -> None: if self.ordered: assert zip_equal(bi.items(), self.data.items()) else: assert bi.items() == self.data.items() def clear(self) -> None: self.data.clear() def pop(self, key: KT) -> VT: return self.data.pop(key) def popitem(self, last: bool = True) -> tuple[KT, VT]: if last: return self.data.popitem() key = next(iter(self.data)) return key, self.data.pop(key) def put(self, key: KT, val: VT, on_dup: OnDup = DEFAULT_ON_DUP) -> None: oldval = self.data.get(key) oldkey = self.data_inv.get(val) isdupkey = oldval is not None isdupval = oldkey is not None if isdupkey and isdupval: if key == oldkey: # (key, val) duplicates an existing item -> no-op assert val == oldval return # key and val each duplicate a different existing item. if on_dup.val is RAISE: raise KeyAndValueDuplicationError(key, val) if on_dup.val is DROP_NEW: return assert on_dup.val is DROP_OLD elif isdupkey: if on_dup.key is RAISE: raise KeyDuplicationError(key) if on_dup.key is DROP_NEW: return assert on_dup.key is DROP_OLD elif isdupval: if on_dup.val is RAISE: raise ValueDuplicationError(val) if on_dup.val is DROP_NEW: return assert on_dup.val is DROP_OLD if not self.ordered: self.data[key] = val self.data.pop(oldkey, None) return # Ensure insertion order is preserved in the case of a sequence of overwriting updates. updated = {} for k, v in self.data.items(): if k == oldkey or v == oldval: if k == oldkey and isdupkey and isdupval: continue updated[key] = val else: updated[k] = v updated[key] = val self.data = updated def putall(self, updates: MapOrItems[KT, VT], on_dup: OnDup = DEFAULT_ON_DUP) -> None: # https://bidict.readthedocs.io/en/main/basic-usage.html#order-matters tmp = self.data.copy() items: Iterable[tuple[KT, VT]] if isinstance(updates, Mapping): items = t.cast('Mapping[KT, VT]', updates).items() elif isinstance(updates, Maplike): items = [(key, updates[key]) for key in updates.keys()] else: items = updates try: for key, val in items: self.put(key, val, on_dup) except DuplicationError: self.data = tmp # fail clean (no partially-applied updates) raise def __ior__(self, other: Mapping[KT, VT]) -> dict[KT, VT]: self.putall(other) return self.data def __or__(self, other: Mapping[KT, VT]) -> dict[KT, VT]: before = self.data.copy() self.putall(other) after = self.data self.data = before return after def __ror__(self, other: Mapping[KT, VT]) -> dict[KT, VT]: before = self.data.copy() self.data = {} try: self.putall(other) self.putall(before) except DuplicationError: self.data = before raise after = self.data self.data = before return after def move_to_end(self, key: KT, last: bool = True) -> None: val = self.pop(key) if last: self.put(key, val) else: self.data = {key: val, **self.data} def zip_equal(i1: Iterable[t.Any], i2: Iterable[t.Any]) -> bool: return all(map(operator.eq, i1, i2)) def invdict(d: dict[KT, VT]) -> dict[VT, KT]: return {v: k for (k, v) in d.items()} def dedup(x: MapOrItems[KT, VT]) -> dict[KT, VT]: return invdict(invdict(dict(x))) @dataclass(frozen=True) class Tagged: """Equal whenever *n* is equal, but each instance is distinguishable by its *tag*. Stands in for the realistic case of value-equal objects that carry distinct state, e.g. a dataclass whose __eq__ covers only some of its fields. """ n: int tag: str = '' @override def __eq__(self, other: object) -> bool: return isinstance(other, Tagged) and self.n == other.n @override def __hash__(self) -> int: return hash(self.n) class HashRaises: @override def __hash__(self) -> int: raise RuntimeError('boom!') bomb = HashRaises() BAD_ITEMS = ( (RuntimeError, (bomb, 0)), # hashing the key raises (RuntimeError, (0, bomb)), # hashing the value raises (TypeError, (['unhashable'], 0)), (ValueError, (1, 2, 'bad len')), ) class WriteRefused(Exception): """Raised by the backing mappings that :func:`bidict_refusing_nth_write` provides.""" def bidict_refusing_nth_write(bi_t: BT[t.Any, t.Any], init: Mapping[t.Any, t.Any], n: int) -> BB[t.Any, t.Any]: """Return a *bi_t* containing *init* whose nth write from now on raises :class:`WriteRefused`. Stands in for a custom bidict's backing mapping that may raise on a write it will not accept, e.g. SortedDict's TypeError when a key is not orderable with the keys already contained. Both backing mappings are given the same class, so the count spans them the way a single _write() does. """ counting = False counter = iter(range(1, 1000)) def tick() -> None: if counting and next(counter) == n: raise WriteRefused class RefusingDict(UserDict[t.Any, t.Any]): @override def __setitem__(self, key: t.Any, item: t.Any) -> None: tick() super().__setitem__(key, item) @override def __delitem__(self, key: t.Any) -> None: tick() super().__delitem__(key) @override def popitem(self) -> tuple[t.Any, t.Any]: # Python 3.15 gave UserDict a popitem() of its own that goes straight to self.data, # bypassing __delitem__ and so escaping the count above. Take MutableMapping's # implementation, which removes via __delitem__ on every supported Python. return MutableMapping.popitem(self) bi_t_refusing = type(f'Refusing{bi_t.__name__}', (bi_t,), {'_fwdm_cls': RefusingDict, '_invm_cls': RefusingDict}) bi = bi_t_refusing(init) counting = True # writing init above must not count return bi bidict-0.24.1/tests/conftest.py000066400000000000000000000013221524342314000163710ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. from hypothesis import settings # deadline=None because hypothesis times each call in wall-clock, and the first call of any test # can spend a few hundred ms on warm-up that later calls do not, which can trip the 200ms default # when the machine is loaded. settings.register_profile('less-examples', deadline=None, max_examples=200, stateful_step_count=100) settings.register_profile('more-examples', deadline=None, max_examples=500, stateful_step_count=200) bidict-0.24.1/tests/test_bidict.py000066400000000000000000001452071524342314000170540ustar00rootroot00000000000000# Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. """Tests for :mod:`bidict`. Mainly these are property-based tests implemented via https://hypothesis.works. """ from __future__ import annotations import gc import pickle import sys import typing as t import weakref from collections import UserDict from collections.abc import Callable from collections.abc import Mapping from collections.abc import Reversible from collections.abc import Sequence from copy import copy from copy import deepcopy from functools import partial from functools import reduce from itertools import product from itertools import starmap from random import Random from typing import assert_type from unittest.mock import ANY import pytest from bidict_test_fixtures import BAD_ITEMS from bidict_test_fixtures import BB from bidict_test_fixtures import BT from bidict_test_fixtures import KT from bidict_test_fixtures import MBT from bidict_test_fixtures import SET_OPS from bidict_test_fixtures import VT from bidict_test_fixtures import Oracle from bidict_test_fixtures import SupportsKeysAndGetItem from bidict_test_fixtures import Tagged from bidict_test_fixtures import UserBi from bidict_test_fixtures import UserBiBackedByDictSub from bidict_test_fixtures import UserBiNotOwnInv from bidict_test_fixtures import UserOrderedBi from bidict_test_fixtures import UserOrderedBiBase from bidict_test_fixtures import WriteRefused from bidict_test_fixtures import bidict_refusing_nth_write from bidict_test_fixtures import bidict_types from bidict_test_fixtures import bomb from bidict_test_fixtures import dedup from bidict_test_fixtures import invdict from bidict_test_fixtures import mutable_bidict_types from bidict_test_fixtures import pickle_copy from bidict_test_fixtures import powerset from bidict_test_fixtures import should_be_reversible from bidict_test_fixtures import update_arg_types from bidict_test_fixtures import zip_equal from hypothesis import assume from hypothesis import example from hypothesis import given from hypothesis import note from hypothesis.stateful import RuleBasedStateMachine from hypothesis.stateful import initialize from hypothesis.stateful import invariant from hypothesis.stateful import precondition from hypothesis.stateful import rule from hypothesis.strategies import booleans from hypothesis.strategies import randoms from hypothesis.strategies import sampled_from from typing_extensions import TypeIs from bidict import BidictKeysView from bidict import BidirectionalMapping from bidict import DuplicationError from bidict import KeyAndValueDuplicationError from bidict import MutableBidict from bidict import MutableBidirectionalMapping from bidict import OnDup from bidict import OnDupAction from bidict import OrderedBidict from bidict import OrderedBidictBase from bidict import ValueDuplicationError from bidict import bidict from bidict import frozenbidict from bidict import inverted from bidict._orderedbase import Node as OrderedBidictNode from bidict._orderedbase import WeakAttr from bidict._typing import MapOrItems from bidict._typing import override Items = Sequence[tuple[int, int]] Items121 = dict[t.Any, t.Any] ks = tuple(range(1, 5)) vs = tuple(range(-1, -5, -1)) keys = sampled_from(ks) vals = sampled_from(vs) items = sampled_from(list(powerset(product(ks, vs)))) items121 = items.map(dedup) # Items that can never duplicate anything in a bidict under test: their keys and values are # disjoint from ks and vs, and they are 1:1 among themselves. fresh_items = sampled_from(list(powerset((k, -k) for k in range(5, 9)))) bidict_t = sampled_from(bidict_types) mut_bidict_t = sampled_from(mutable_bidict_types) updates_t = sampled_from(update_arg_types) on_dups = tuple(starmap(OnDup, product(OnDupAction, repeat=2))) on_dup = sampled_from(on_dups) def is_ordered(bi: BidirectionalMapping[int, int]) -> TypeIs[OrderedBidict[int, int]]: return isinstance(bi, OrderedBidict) class BidictStateMachine(RuleBasedStateMachine): bi: MutableBidict[int, int] oracle: Oracle[int, int] @initialize(mut_bidict_t=mut_bidict_t, items121=items121) def init(self, mut_bidict_t: type[MutableBidict[int, int]], items121: Items121) -> None: self.bi = mut_bidict_t(items121) self.oracle = Oracle(items121, ordered=self.is_ordered()) def is_ordered(self) -> bool: return is_ordered(self.bi) @invariant() def assert_match_oracle(self) -> None: note(f'> {self.bi=}\n> {self.oracle.data=}') self.oracle.assert_match(self.bi) viewnames = sampled_from(('keys', 'values', 'items')) # TODO: Try @invariant rather than @rule now that hypothesis is faster / it might not slow down the tests too much. @rule(rand=randoms(), viewname=viewnames, set_op=sampled_from(SET_OPS), other_set=items.map(frozenset)) def assert_views_match_oracle(self, rand: Random, viewname: str, set_op: t.Any, other_set: t.Any) -> None: check = getattr(self.bi, viewname)() expect = getattr(self.oracle.data, viewname)() if viewname != 'values' else self.oracle.data_inv.keys() assert len(check) == len(expect) if self.is_ordered(): assert zip_equal(check, expect) else: assert check == frozenset(expect) missing = ('foo', 'bar') if viewname == 'items' else 'foo' assert missing not in check if self.oracle.data: contained = rand.choice(tuple(expect)) assert contained in check if viewname != 'items': other_set = {k for (k, _) in other_set} assert_calls_match( partial(set_op, check, other_set), partial(set_op, expect, other_set), ) if viewname == 'items': other_set = self.bi.__class__(dedup(other_set)).items() assert_calls_match( partial(set_op, check, other_set), partial(set_op, expect, other_set), ) @invariant() def assert_bi_and_inv_are_inverse(self) -> None: assert_bi_and_inv_are_inverse(self.bi) @invariant() def assert_values_correspond_to_keys(self) -> None: """values() must correspond elementwise to keys(), as a plain dict's does. Overwriting an item reorders a non-ordered bidict's backing _invm relative to its _fwdm, so a values() view sourced from _invm's keys would silently mispair here. Only reachable by mutating: a bulk __init__ that would cause it raises instead. """ for b in (self.bi, self.bi.inv): assert list(b.values()) == [b[k] for k in b] @precondition(lambda self: should_be_reversible(self.bi.__class__)) @invariant() def assert_reversed_works(self) -> None: assert list(reversed(self.bi)) == list(self.bi)[::-1] items = self.bi.items() assert isinstance(items, Reversible) assert list(reversed(items)) == list(items)[::-1] if self.is_ordered(): assert zip_equal(reversed(self.bi), reversed(self.oracle.data)) assert zip_equal(reversed(items), reversed(self.oracle.data.items())) values = self.bi.values() assert isinstance(values, Reversible) assert zip_equal(reversed(values), reversed(self.oracle.data.values())) @rule() def copy(self) -> None: for cp in (copy(self.bi), deepcopy(self.bi)): assert_bi_and_inv_are_inverse(cp) assert_bidicts_equal(cp, self.bi) @rule() def pickle(self) -> None: for b in (self.bi, self.bi.inv): roundtripped = pickle_copy(b) assert_bi_and_inv_are_inverse(roundtripped) assert_bidicts_equal(roundtripped, b) @rule() def clear(self) -> None: self.bi.clear() self.oracle.clear() @rule(key=keys, val=vals, on_dup=on_dup) def put(self, key: int, val: int, on_dup: OnDup) -> None: assert_calls_match( partial(self.bi.put, key, val, on_dup), partial(self.oracle.put, key, val, on_dup), ) @rule(updates=items, updates_t=updates_t, on_dup=on_dup) def putall(self, updates: MapOrItems[int, int], updates_t: t.Any, on_dup: OnDup) -> None: # Don't let the updates_t(updates) calls below raise a DuplicationError. if isinstance(updates_t, type) and issubclass(updates_t, BidirectionalMapping): updates = dedup(updates) # Since updates_t can be iter, can't extract the two updates_t(updates) calls below into a single value. assert_calls_match( partial(self.bi.putall, updates_t(updates), on_dup), partial(self.oracle.putall, updates_t(updates), on_dup), ) @rule(new=fresh_items, on_dup=on_dup) def putall_with_bad_item(self, new: Items, on_dup: OnDup) -> None: """A bulk update whose last item raises must apply none of it, whatever the on_dup. The preceding items are fresh, so the only thing that can fail is the bad item. Pass an iterator so this always takes the incremental rollback path. """ assert_update_fails_clean(self.bi, iter([*new, (bomb, 0)]), RuntimeError, on_dup) @precondition(is_ordered) @rule(updates=items, on_dup=on_dup) def putall_with_bad_item_after_overwrites(self, updates: Items, on_dup: OnDup) -> None: """An ordered bidict must restore its *order* too, not just its contents. Unlike the rule above this lets the preceding items overwrite existing ones, which is what makes the linked list's order diverge from the backing mappings'. Only ordered bidicts guarantee this: rolling back an overwrite reinserts the overwritten item at the end of a backing mapping rather than in its original position, so a non-ordered bidict is restored contents-only. See "Updates Fail Clean" in the docs. """ arg = iter([*updates, (bomb, 0)]) assert_update_fails_clean(self.bi, arg, (RuntimeError, DuplicationError), on_dup) @rule(other=items121) def __ior__(self, other: Mapping[int, int]) -> None: assert_calls_match( partial(self.bi.__ior__, other), partial(self.oracle.__ior__, other), ) @rule(other=items121) def __or__(self, other: Mapping[int, int]) -> None: assert_calls_match( partial(self.bi.__or__, other), partial(self.oracle.__or__, other), ) # https://bidict.rtfd.io/basic-usage.html#order-matters @precondition(lambda self: zip_equal(self.bi, self.oracle.data)) @rule(other=items121) def __ror__(self, other: Mapping[int, int]) -> None: assert_calls_match( partial(self.bi.__ror__, other), partial(self.oracle.__ror__, other), ) @precondition(lambda self: len(self.bi) >= 2) @rule(random=randoms()) def update_with_dup(self, random: Random) -> None: # Covered nondeterministically by the more general "putall" rule above, but this ensures that basic duplication # scenarios are deterministically covered. # Choose two existing items at random. (k1, v1), (k2, v2) = random.sample(tuple(self.oracle.data.items()), 2) # Inserting (new_key, dup_val) should raise ValueDuplicationError. assert_update_fails_clean(self.bi, [('foo', 'foo'), ('bar', v1)], ValueDuplicationError) # key and value duplication across two different items should raise KeyAndValueDuplicationError. for key, val in ((k1, v2), (k2, v1)): assert_update_fails_clean(self.bi, [('foo', 'foo'), (key, val)], KeyAndValueDuplicationError) # Inserting already-present items should be a no-op. before = self.bi.copy() self.bi.update([(k1, v1), (k2, v2)]) assert self.bi.equals_order_sensitive(before) assert self.bi.inv.equals_order_sensitive(before.inv) def is_empty(self) -> bool: return not self.bi @precondition(is_empty) @rule() def popitem_empty(self) -> None: with pytest.raises(KeyError): self.bi.popitem() def is_nonempty(self) -> bool: return bool(self.bi) @precondition(is_nonempty) @rule(last=booleans(), flip=booleans(), inv=booleans()) def popitem(self, last: bool, inv: bool, flip: bool) -> None: bi, oracle = self.bi, self.oracle if is_ordered(bi): if not inv: expect = oracle.popitem(last=last) check = bi.popitem(last=last) else: expect = oracle.popitem(last=last)[::-1] check = bi.inv.popitem(last=last) assert check == expect assert check not in bi.items() else: fst, snd = (bi, oracle) if flip else (oracle, bi) k, v = fst.popitem() assert snd.pop(k) == v assert (k, v) not in bi.items() @precondition(is_nonempty) @rule(random=randoms()) def pop_randkey(self, random: Random) -> None: key = random.choice(tuple(self.oracle.data)) expect = self.oracle.pop(key) check = self.bi.pop(key) assert check == expect @precondition(is_ordered) @precondition(is_nonempty) @rule(random=randoms(), last=booleans()) def move_to_end_randkey(self, random: Random, last: bool) -> None: assert is_ordered(self.bi) key, val = random.choice(tuple(self.oracle.data.items())) self.bi.move_to_end(key, last=last) self.oracle.move_to_end(key, last=last) it: t.Any = reversed if last else iter assert (key, val) == next(it(self.bi.items())) assert (val, key) == next(it(self.bi.inv.items())) assert (key, val) == next(it(self.oracle.data.items())) assert (val, key) == next(it(self.oracle.data_inv.items())) BidictStateMachineTest = BidictStateMachine.TestCase @pytest.mark.parametrize('bi_t', bidict_types) def test_init_and_update_with_bad_args(bi_t: BT[KT, VT]) -> None: bad_args: t.Any for bad_args in ((None,), (0,), (False,), (True,), ({}, {})): # ty raises on unpacking an `Any`/unknown-length arg into a call; see # https://github.com/astral-sh/ty/issues/3649 with pytest.raises(TypeError): bi_t(*bad_args) # ty: ignore[invalid-argument-type, too-many-positional-arguments] if not issubclass(bi_t, MutableBidict): continue bi = bi_t() with pytest.raises(TypeError): bi.update(*bad_args) # ty: ignore[invalid-argument-type, too-many-positional-arguments] # https://github.com/astral-sh/ty/issues/3649 @pytest.mark.parametrize('bi_t', bidict_types) def test_inv_attrs_readonly(bi_t: BT[KT, VT]) -> None: """Attempting to set .inverse or .inv should raise AttributeError.""" bi: t.Any = bi_t() with pytest.raises(AttributeError): bi.inverse = 'foo' with pytest.raises(AttributeError): bi.inv = 'foo' @pytest.mark.parametrize('bi_t', mutable_bidict_types) def test_pop_missing_key(bi_t: MBT[t.Any, t.Any]) -> None: bi = bi_t() with pytest.raises(KeyError): bi.pop('foo') assert bi.pop('foo', 'bar') == 'bar' @pytest.mark.parametrize('bi_t', [OrderedBidict, UserOrderedBi]) def test_move_to_end_missing_key(bi_t: type[OrderedBidict[KT, VT]]) -> None: bi = bi_t() with pytest.raises(KeyError): bi.move_to_end('foo') # ty: ignore[invalid-argument-type] @pytest.mark.parametrize('bi_t', bidict_types) def test_eq_defers_to_other_eq(bi_t: BT[KT, VT]) -> None: """bidict.__eq__(other) should defer to other.__eq__ when other is not a mapping.""" # ANY.__eq__ always returns true, so this test will fail if bi_t.__eq__ fails to defer. assert bi_t() == ANY @pytest.mark.parametrize(('bi_t', 'non_mapping'), list(product(bidict_types, (None, 1, [], SupportsKeysAndGetItem({}))))) def test_eq_and_or_with_non_mapping(bi_t: BT[KT, VT], non_mapping: t.Any) -> None: bi = bi_t() assert bi != non_mapping assert not bi.equals_order_sensitive(non_mapping) with pytest.raises(TypeError): bi | non_mapping with pytest.raises(TypeError): non_mapping | bi @given(items121=items121, bidict_t=bidict_t, rand=randoms()) def test_equals_order_sensitive(items121: Items121, bidict_t: BT[KT, VT], rand: Random) -> None: # Ensure there are at least 3 items in items121. items121.update({5: -5, 6: -6, 7: -7}) bi = bidict_t(items121) items_shuf = list(items121.items()) rand.shuffle(items_shuf) assume(not zip_equal(items_shuf, items121.items())) map_shuf = dict(items_shuf) assert bi == map_shuf assert not bi.equals_order_sensitive(map_shuf) @given(items=items, bidict_t=bidict_t) def test_inverted(items: Items, bidict_t: BT[int, int]) -> None: check = tuple(inverted(inverted(items))) expect = items assert check == expect items_nodup = dedup(items) check_bi = bidict_t(inverted(bidict_t(items_nodup))) expect_bi = bidict_t({v: k for (k, v) in items_nodup.items()}) assert_bidicts_equal(check_bi, expect_bi) @given(items=items, bidict_t=bidict_t) # Pin the case that actually exercises the divergence, rather than relying on it being # generated: (3, -1) overwrites (1, -1) in place, so an ordered bidict keeps the item's # original position while its backing mappings append the new key and drop the old one. @example(items=((1, -1), (2, -2), (3, -1)), bidict_t=UserOrderedBiBase) def test_views_agree_with_iteration_order(items: Items, bidict_t: BT[int, int]) -> None: """Every order-sensitive API must agree with the bidict's own iteration order. For ordered bidicts the order lives in the linked list, not in the backing mappings, and the two diverge as soon as an item is overwritten -- including during __init__, for a type whose on_dup permits it. So the views must not delegate to _fwdm. """ try: bi = bidict_t(items) except DuplicationError: # this type's on_dup rejects these items; settle for a 1:1 init bi = bidict_t(dedup(items)) expect = [(k, bi[k]) for k in bi] # the items in iteration order, without using items() assert list(bi.keys()) == list(bi) assert list(bi.items()) == expect assert list(dict(bi)) == list(bi) # dict(mapping) goes through keys() assert bi.equals_order_sensitive(bidict_t(expect)) assert list(bi.values()) == [v for (_, v) in expect] assert list(bi.items()) == list(zip(bi.keys(), bi.values(), strict=True)) if should_be_reversible(bidict_t): keysview, itemsview = bi.keys(), bi.items() assert isinstance(keysview, Reversible) assert isinstance(itemsview, Reversible) assert list(reversed(keysview)) == list(bi)[::-1] assert list(reversed(itemsview)) == expect[::-1] @given(items121=items121) def test_frozenbidicts_hashable(items121: Items121) -> None: """Frozen bidicts can be hashed (and therefore inserted into sets and mappings).""" bi = frozenbidict(items121) h1 = hash(bi) h2 = hash(bi) assert h1 == h2 assert {bi} assert {bi: bi} bi2 = frozenbidict(items121) assert bi2 == bi assert hash(bi2) == h1 # These test cases ensure coverage of all branches in [Ordered]BidictBase._undo_write. # (Hypothesis doesn't always generate examples that cover all the branches otherwise.) @pytest.mark.parametrize(('bi_t', 'on_dup'), list(product(mutable_bidict_types, on_dups))) def test_putall_matches_bulk_put(bi_t: type[MutableBidict[int, int]], on_dup: OnDup) -> None: bi = bi_t({0: 0, 1: 1}) for k1, v1, k2, v2 in product(range(4), repeat=4): for b in bi, bi.inv: assert_putall_matches_bulk_put(b, [(k1, v1), (k2, v2)], on_dup) def assert_putall_matches_bulk_put(bi: MutableBidict[int, int], new_items: Items, on_dup: OnDup) -> None: tmp = bi.copy() checkexc = None expectexc = None try: for key, val in new_items: tmp.put(key, val, on_dup) except DuplicationError as exc: expectexc = type(exc) tmp = bi # Since bulk updates fail clean, expect no changes (i.e. revert to bi). try: bi.putall(new_items, on_dup) except DuplicationError as exc: checkexc = type(exc) assert checkexc == expectexc assert bi == tmp assert bi.inv == tmp.inv def assert_update_fails_clean( bi: MutableBidict[t.Any, t.Any], updates: t.Any, exc_t: type[Exception] | tuple[type[Exception], ...], on_dup: OnDup | None = None, ) -> None: """Check that a bulk update that raises *exc_t* leaves *bi* exactly as it was. Exercises update() (i.e. bi's own on_dup) when *on_dup* is None, else putall(). """ before = bi.copy() do_update = partial(bi.update, updates) if on_dup is None else partial(bi.putall, updates, on_dup) with pytest.raises(exc_t): do_update() assert bi.equals_order_sensitive(before) assert bi.inv.equals_order_sensitive(before.inv) # A RAISE-free on_dup must fail clean too: a bulk update can raise for reasons that have # nothing to do with duplication, so rollback cannot be conditioned on on_dup. @pytest.mark.parametrize(('bi_t', 'on_dup'), list(product(mutable_bidict_types, (None, *on_dups)))) def test_update_with_bad_last_item_fails_clean(bi_t: MBT[t.Any, t.Any], on_dup: OnDup | None) -> None: # Keep self at least as large as updates so this sized arg takes the # in-place rollback path rather than the copy fast path. bi = bi_t({ 0: 0, 1: 1, 2: 2, }) for b in (bi, bi.inv): for exc, bad in BAD_ITEMS: # The items before the bad one are all new, so the update fails for the # bad item's reason regardless of the on_dup. updates = [(3, 3), (4, 4), bad] assert_update_fails_clean(b, updates, exc, on_dup) @pytest.mark.parametrize('bi_t', [bidict, OrderedBidict]) @pytest.mark.parametrize( ('init', 'write', 'nwrites'), [ # One case per kind of duplication BidictBase._write() handles, with the number of writes # to the backing mappings it performs: two to insert the new item, plus one to remove each # item that the new one displaces. ({1: 'a'}, lambda b: b.__setitem__(2, 'b'), 2), ({1: 'a'}, lambda b: b.__setitem__(1, 'z'), 3), ({1: 'a'}, lambda b: b.forceput(9, 'a'), 3), ({1: 'a', 2: 'b'}, lambda b: b.forceput(1, 'b'), 4), ], ids=['no-dup', 'dup-key', 'dup-val', 'dup-key-and-val'], ) def test_write_fails_clean_when_a_backing_mapping_refuses( bi_t: MBT[t.Any, t.Any], init: dict[t.Any, t.Any], write: t.Any, nwrites: int ) -> None: """Writing one item must fail clean when a backing mapping refuses part-way through. _write() sets both backing mappings, and for some kinds of duplication deletes from them too. Backing mappings are user-supplied (see _fwdm_cls and _invm_cls), so any one of those writes can be refused, and everything already written must then be undone. """ unchanged = dict(init), invdict(init) refused = 0 for n in range(1, nwrites + 2): # one past the last, which must find nothing left to refuse bi = bidict_refusing_nth_write(bi_t, init, n) try: write(bi) except WriteRefused: refused += 1 assert (dict(bi._fwdm), dict(bi._invm)) == unchanged, f'refusing write #{n} left bi changed' else: break assert refused == nwrites @pytest.mark.parametrize('bi_t', [bidict, OrderedBidict]) @pytest.mark.parametrize( ('remove', 'nwrites'), [ # Removing an item takes two writes whichever way it is asked for: one to each # backing mapping. (lambda b: b.__delitem__(1), 2), (lambda b: b.pop(1), 2), (lambda b: b.popitem(), 2), ], ids=['delitem', 'pop', 'popitem'], ) def test_remove_fails_clean_when_a_backing_mapping_refuses(bi_t: MBT[t.Any, t.Any], remove: t.Any, nwrites: int) -> None: """Removing an item must fail clean when a backing mapping refuses part-way through. The removing counterpart of test_write_fails_clean_when_a_backing_mapping_refuses: removing from one backing mapping and then being refused by the other must not leave the two disagreeing. """ init = {1: 'a', 2: 'b'} unchanged = dict(init), invdict(init) refused = 0 for n in range(1, nwrites + 2): # one past the last, which must find nothing left to refuse bi = bidict_refusing_nth_write(bi_t, init, n) try: remove(bi) except WriteRefused: refused += 1 assert (dict(bi._fwdm), dict(bi._invm)) == unchanged, f'refusing write #{n} left bi changed' else: break assert refused == nwrites @pytest.mark.parametrize('bi_t', mutable_bidict_types) @pytest.mark.parametrize('roundtrip', [copy, deepcopy, pickle_copy], ids=['copy', 'deepcopy', 'pickle']) def test_roundtrip_preserves_iteration_order(bi_t: MBT[t.Any, t.Any], roundtrip: t.Any) -> None: """Duplicating a bidict must preserve its own iteration order. An ordered bidict preserves its inverse's order too, since both read the same linked list. A non-ordered one does not: its inverse gets rebuilt by inverting the forward mapping, which leaves it in the forward mapping's order -- the same thing that happens whenever a bidict is built from items, and the reason to reach for an OrderedBidict when order matters. """ bi = bi_t({1: -1, 2: -2, 3: -3}) bi.forceput(4, -2) # a value-duplicating overwrite, which skews the inverse's order cp = roundtrip(bi) assert cp.equals_order_sensitive(bi) if isinstance(bi, OrderedBidictBase): assert cp.inv.equals_order_sensitive(bi.inv) def test_pickle_preserves_order_of_generated_inverse_class() -> None: """An instance of a dynamically-generated inverse class keeps its own order. Such a class used to have no name pickle could reference it by, so __reduce__ pickled an instance of the class it was generated from and reconstructed this one by inverting, which left the order of the object being pickled derived rather than recorded. It is now pickled by reference like any other class (see _make_inv_cls), so the items are this object's own. """ b: MutableBidict[t.Any, t.Any] = UserBiNotOwnInv() b.forceupdate([(1, 'a'), (2, 'b'), (3, 'a')]) # the last item skews the inverse's order inv = b.inverse assert list(inv.items()) == [('a', 3), ('b', 2)] roundtripped = pickle_copy(inv) assert type(roundtripped) is type(inv) assert roundtripped.equals_order_sensitive(inv) def test_pickling_costs_no_extra_space() -> None: """Preserving the order must not have made pickles bigger. Recording the inverse's key order alongside the forward mapping would: measured at up to 150% more space, or ~10% more time once conditioned on actually being needed. Making the generated class referenceable instead costs neither, since only the forward items are ever written. """ bi = bidict({i: -i for i in range(1000)}) assert len(pickle.dumps(bi)) < len(pickle.dumps(dict(bi))) * 1.1 def test_pickle_orderedbi_whose_order_disagrees_with_fwdm() -> None: """An OrderedBidict whose order does not match its _fwdm's should pickle with the correct order.""" ob = OrderedBidict({0: 1, 2: 3}) # First get ob._fwdm's order to disagree with ob's: ob.inv[1] = 4 assert list(ob.items()) == [(4, 1), (2, 3)] assert list(ob._fwdm.items()) == [(2, 3), (4, 1)] # Now check that its order is preserved after pickling and unpickling: roundtripped = pickle_copy(ob) assert list(roundtripped.items()) == [(4, 1), (2, 3)] assert roundtripped.equals_order_sensitive(ob) def test_pickle_dynamically_generated_inverse_bidict() -> None: """Instances of dynamically-generated inverse bidict classes should be pickleable.""" ub: MutableBidict[str, int] = UserBiNotOwnInv(one=1, two=2) roundtripped = pickle_copy(ub) assert roundtripped == ub == UserBiNotOwnInv({'one': 1, 'two': 2}) assert dict(roundtripped) == dict(ub) # Now for the inverse: assert repr(ub.inverse) == "UserBiNotOwnInvInv({1: 'one', 2: 'two'})" # We can still pickle the inverse, even though its class, UserBiNotOwnInvInv, was # dynamically generated, and we didn't save a reference to it named "UserBiNotOwnInvInv" # anywhere that pickle could find it in sys.modules: for protocol in range(2, pickle.HIGHEST_PROTOCOL + 1): ubinv = pickle_copy(ub.inverse, protocol) assert repr(ubinv) == "UserBiNotOwnInvInv({1: 'one', 2: 'two'})" assert ub._inv_cls.__name__ not in (name for m in sys.modules for name in dir(m)) # What pickle finds it by instead is its __qualname__, which spells out the attribute of # UserBiNotOwnInv that it is reachable through. Check that that lookup resolves back to it. assert ub._inv_cls.__qualname__ == 'UserBiNotOwnInv._inv_cls' module = sys.modules[ub._inv_cls.__module__] assert reduce(getattr, ub._inv_cls.__qualname__.split('.'), module) is ub._inv_cls def test_abstract_bimap_init_fails() -> None: class AbstractBimap(BidirectionalMapping[t.Any, t.Any]): """Does not override `inverse` and therefore should not be instantiable.""" for bi_t in (BidirectionalMapping, MutableBidirectionalMapping, AbstractBimap): with pytest.raises(TypeError, match="Can't instantiate abstract class"): bi_t() def test_bimap_bad_inverse() -> None: # Overrides `inverse`, but merely calls the abstract superclass implementation. class BimapBadInverse(BidirectionalMapping[t.Any, t.Any]): __getitem__ = __iter__ = __len__ = ... @property @override def inverse(self) -> t.Any: return super().inverse bi = BimapBadInverse() with pytest.raises(NotImplementedError): bi.inverse # ruff: ignore[useless-expression] # evaluating it is the point: it must raise skip_if_pypy = pytest.mark.skipif( sys.implementation.name == 'pypy', reason='Requires CPython refcounting behavior', ) @skip_if_pypy @given(bidict_t=bidict_t) def test_bidicts_freed_on_zero_refcount(bidict_t: BT[KT, VT]) -> None: """On CPython, the moment you have no more (strong) references to a bidict, there are no remaining (internal) strong references to it (i.e. no reference cycle was created between it and its inverse), allowing the memory to be reclaimed immediately, even with GC disabled. """ gc.disable() try: bi = bidict_t() weak = weakref.ref(bi) assert weak() is not None del bi assert weak() is None finally: gc.enable() @skip_if_pypy @given(items121=items121) def test_orderedbidict_nodes_freed_on_zero_refcount(items121: Items121) -> None: """On CPython, the moment you have no more references to an ordered bidict, the refcount of each of its internal nodes drops to 0 (i.e. the linked list of nodes does not create a reference cycle), allowing the memory to be reclaimed immediately. """ gc.disable() try: ob = OrderedBidict(items121) nodes = weakref.WeakSet(ob._sntl.iternodes()) assert len(nodes) == len(ob) del ob assert len(nodes) == 0 finally: gc.enable() @given(items121=items121) def test_orderedbidict_nodes_consistent(items121: Items121) -> None: """The nodes in an ordered bidict's backing linked list should be the same as those in its backing mapping.""" ob = OrderedBidict(items121) mapnodes = set(ob._node_by_korv.inverse) linkedlistnodes = set(ob._sntl.iternodes()) assert mapnodes == linkedlistnodes def test_dict_subclass_backing_gets_native_views() -> None: """A backing mapping that is a dict subclass should get the same views a dict would. keys()/items() dispatch on isinstance(fwdm, dict) rather than `fwdm_cls is dict`, so a dict subclass -- which is what every backing in the docs' recipes actually is, e.g. sortedcontainers.SortedDict -- gets its own native views. Those are reversible, carry a .mapping attribute, and implement their set operations in C, none of which a generic view over the bidict provides. """ b = UserBiBackedByDictSub({1: 'one', 2: 'two'}) # backed by OrderedDict keysview, itemsview = b.keys(), b.items() assert not isinstance(keysview, BidictKeysView) # the backing's own view, not a fallback assert isinstance(keysview, Reversible) assert isinstance(itemsview, Reversible) assert hasattr(keysview, 'mapping') assert hasattr(itemsview, 'mapping') assert list(reversed(keysview)) == [2, 1] assert list(reversed(itemsview)) == [(2, 'two'), (1, 'one')] # ...and the views still agree with the bidict itself. assert list(keysview) == list(b) == [1, 2] assert list(itemsview) == [(1, 'one'), (2, 'two')] assert keysview == {1, 2} assert list(b.values()) == ['one', 'two'] def test_non_dict_backing_falls_back_to_generic_views() -> None: """A backing mapping that is not a dict at all still gets a view over the bidict.""" b = UserBi({1: 'one', 2: 'two'}) # backed by UserDict assert isinstance(b.keys(), BidictKeysView) assert list(b.keys()) == [1, 2] assert b.keys() == {1, 2} assert list(b.items()) == [(1, 'one'), (2, 'two')] def test_subclass_can_regain_reversibility() -> None: """A subclass whose backing mappings are reversible must be reversible. Regression test: _set_reversed() decided whether __reversed__ had been overridden by comparing the resolved value to BidictBase's. A class whose backing mappings are not reversible has __reversed__ set to None by _set_reversed() itself, and a subclass of it inherits that None, which compared unequal to BidictBase's and so was misread as a deliberate override -- leaving the subclass non-reversible no matter its own backings. """ class NotReversible(bidict[t.Any, t.Any]): _fwdm_cls = UserDict _invm_cls = UserDict class ReversibleAgain(NotReversible): _fwdm_cls = dict _invm_cls = dict assert not issubclass(NotReversible, Reversible) # UserDict is not reversible assert issubclass(ReversibleAgain, Reversible) # but dict is bi = ReversibleAgain({1: 'one', 2: 'two'}) assert list(reversed(bi)) == [2, 1] assert list(reversed(bi.keys())) == [2, 1] assert list(reversed(bi.values())) == ['two', 'one'] def test_user_provided_reversed_is_honored_and_inherited() -> None: """_set_reversed() must never clobber a __reversed__ that a user provided. This is what keeps OrderedBidict, which does not define __reversed__ itself, from computing one from its backing mappings and losing OrderedBidictBase's. """ class CustomReversed(bidict[t.Any, t.Any]): @override def __reversed__(self) -> t.Any: return iter(['custom']) class SubCustom(CustomReversed): # even with backings that are not reversible _fwdm_cls = UserDict _invm_cls = UserDict for bi_t in (CustomReversed, SubCustom): assert issubclass(bi_t, Reversible) assert list(reversed(bi_t())) == ['custom'], bi_t def test_set_reversed_is_idempotent() -> None: """Running _set_reversed() again must not make a computed __reversed__ look user-provided. It only runs once per class today, but were a repeat ever to mark the class as having a user-provided __reversed__, subclasses would inherit that and stop computing their own, which is exactly the bug that test_subclass_can_regain_reversibility covers. """ class Computed(bidict[t.Any, t.Any]): pass Computed._set_reversed() assert not Computed._reversed_is_user_provided class SubComputed(Computed): _fwdm_cls = UserDict _invm_cls = UserDict assert not issubclass(SubComputed, Reversible) # still free to compute its own answer def test_reversed_opt_out_is_honored_and_inherited() -> None: """Setting __reversed__ to None opts out of reversed(), for subclasses too. Unnecessary as of v0.22 for the usual case of non-reversible backing mappings, which _set_reversed() now detects, but still the way to opt out deliberately. """ class OptedOut(bidict[t.Any, t.Any]): __reversed__ = None class SubOptedOut(OptedOut): pass for bi_t in (OptedOut, SubOptedOut): bi: t.Any = bi_t({1: 'one'}) assert not isinstance(bi, Reversible), bi_t with pytest.raises(TypeError): reversed(bi) # The values view must not offer what the bidict itself declines to. assert not isinstance(bi.values(), Reversible), bi_t #: Ways to mutate an ordered bidict, keyed by name. Each takes the bidict and the key #: just yielded by the iteration in progress. _MUTATIONS_DURING_ITERATION: t.Any = { 'insert': lambda ob, key: ob.__setitem__(f'new{key}', f'new{key}'), 'delete': lambda ob, key: ob.pop(next(k for k in ob if k != key), None), 'clear': lambda ob, _key: ob.clear(), 'move_to_end': lambda ob, key: ob.move_to_end(key), 'collapse_to_fewer_items': lambda ob, key: ob.forceput(key, next(iter(ob.inv))), 'insert_via_the_inverse': lambda ob, key: ob.inv.__setitem__(f'new{key}', f'new{key}'), } def _iterate_while_mutating(ob: OrderedBidict[t.Any, t.Any], iterate: t.Any, mutate: t.Any) -> None: """Iterate *ob* via *iterate*, applying *mutate* to it on each step. Bounded, so that a failure to detect the mutation fails the test rather than hanging it: inserting during iteration used to grow the linked list ahead of the iterator forever. """ for i, key in enumerate(iterate(ob)): assert i < 100, 'iteration did not terminate after mutation' mutate(ob, key) @pytest.mark.parametrize('mutate', _MUTATIONS_DURING_ITERATION.values(), ids=list(_MUTATIONS_DURING_ITERATION)) @pytest.mark.parametrize('iterate', [iter, reversed], ids=['forward', 'reverse']) def test_orderedbidict_mutation_during_iteration_raises(mutate: t.Any, iterate: t.Any) -> None: """Mutating an ordered bidict while iterating it must raise RuntimeError. dict and OrderedDict both do this. Without it, inserting during iteration looped forever, clear() raised a KeyError naming an internal Node, and deleting silently skipped items. Note the last mutation goes through the inverse, which shares the linked list, so it must invalidate this iterator too. """ ob: OrderedBidict[t.Any, t.Any] = OrderedBidict({1: 'one', 2: 'two', 3: 'three'}) with pytest.raises(RuntimeError): _iterate_while_mutating(ob, iterate, mutate) def test_orderedbidict_mutation_on_final_item_raises() -> None: """Mutating while the last item is being visited raises, unlike OrderedDict. dict raises here and OrderedDict does not, so the two disagree and we cannot match both. Raising is the safer of the two, keeps OrderedBidict consistent with plain bidict (which is backed by a dict and so already raises), and avoids code that works or not depending on which iteration the mutating branch happens to be taken on. """ ob = OrderedBidict({1: 'one', 2: 'two'}) with pytest.raises(RuntimeError): _iterate_while_mutating(ob, iter, lambda o, key: o.__setitem__(3, 'three') if key == 2 else None) def test_orderedbidict_iteration_allows_value_only_update() -> None: """Updating an existing key's value does not restructure the list, so it must not raise. dict and OrderedDict both permit this, and an ordered bidict's iteration order is unaffected by it: the item keeps its node, and so its position. """ ob = OrderedBidict({1: 'one', 2: 'two'}) for key in ob: ob[key] = f'updated{key}' assert list(ob.items()) == [(1, 'updated1'), (2, 'updated2')] def test_orderedbidict_iterator_created_before_mutation_raises() -> None: """The check must catch a mutation made after the iterator was created but before it ran. OrderedDict does this too, which is why iternodes() captures the version eagerly rather than on the first next() call. """ ob = OrderedBidict({1: 'one', 2: 'two'}) it = iter(ob) ob[3] = 'three' with pytest.raises(RuntimeError): list(it) def test_orderedbidict_iteration_unaffected_by_unrelated_bidict() -> None: """Only mutations to *this* bidict's linked list invalidate its iterators.""" ob, other = OrderedBidict({1: 'one', 2: 'two'}), OrderedBidict({3: 'three'}) keys = [] for key in ob: other[key] = f'x{key}' # a different bidict, so a different linked list keys.append(key) assert keys == [1, 2] #: (label, mutation) pairs, each writing an item that duplicates a contained key, a contained #: value, or both, using an object that is equal to the contained one but not identical to it. _DUPLICATING_WRITES: t.Any = { 'key_duplication': lambda b: b.__setitem__(Tagged(1, 'new'), 'other'), 'value_duplication': lambda b: b.forceput(Tagged(9, 'new'), Tagged(2, 'new')), 'collapse': lambda b: b.forceput(Tagged(1, 'new'), Tagged(2, 'new')), } @pytest.mark.parametrize('mutate', _DUPLICATING_WRITES.values(), ids=list(_DUPLICATING_WRITES)) @pytest.mark.parametrize('bi_t', mutable_bidict_types) def test_one_object_per_item_in_both_directions(bi_t: MBT[t.Any, t.Any], mutate: t.Any) -> None: """A bidict and its inverse must hold the same object for each item, not equal copies. dict keeps the key object it already has when a key is overwritten, but takes the new value object. In a bidict a value is also a key of the inverse, so those two conventions conflict; applying each to its own backing mapping left the two holding equal but distinct objects for one item, and so left b.inverse[b[key]] not identical to key. """ bi = bi_t({Tagged(1, 'orig'): Tagged(2, 'orig')}) mutate(bi) for key in bi: val = bi[key] assert bi.inverse[val] is key, 'key differs between a bidict and its inverse' inv_key = next(k for k in bi.inverse if k == val) assert inv_key is val, 'value differs between a bidict and its inverse' @pytest.mark.parametrize('bi_t', mutable_bidict_types) def test_duplicating_write_keeps_the_contained_object(bi_t: MBT[t.Any, t.Any]) -> None: """Of two equal objects, the one already contained is the one kept. That is what a dict does for keys, and it is the only self-consistent choice here: adopting the incoming key object instead would mean deleting and reinserting it, which would move the item to the end and so silently reorder the bidict. """ bi = bi_t({Tagged(1, 'orig'): Tagged(2, 'orig')}) bi[Tagged(1, 'new')] = Tagged(3, 'new') # key duplicates the contained Tagged(1) (key,) = bi assert key.tag == 'orig' assert bi.inverse[bi[key]].tag == 'orig' @pytest.mark.parametrize('bi_t', mutable_bidict_types) def test_duplicating_write_does_not_reorder(bi_t: MBT[t.Any, t.Any]) -> None: """Keeping the contained key object also keeps the item in place.""" bi = bi_t({Tagged(1): 'one', Tagged(2): 'two'}) bi[Tagged(1, 'new')] = 'uno' assert [k.n for k in bi] == [1, 2] def test_orderedbidict_weakattr_class_access() -> None: """Accessing a WeakAttr descriptor from the Node class should return the descriptor itself.""" descriptor = OrderedBidictNode.prv assert isinstance(descriptor, WeakAttr) def test_orderedbidictbase_order_diverges_from_backing_mappings() -> None: """Spell out the scenario behind test_views_agree_with_iteration_order's @example. That test checks the views against the bidict's own iteration order, so on its own it could not tell you whether the two orders ever actually differ. This pins that they do, with absolute expectations, and covers repr() (which goes through items()) besides. Regression test: the keys()/items() overrides used to live on OrderedBidict, justified by a *mutable* ordered bidict getting out of sync with its backing mappings after mutation. But an overwrite during __init__ suffices, so OrderedBidictBase needs them too. """ ob = UserOrderedBiBase([(1, 'a'), (2, 'b'), (3, 'a')]) # (3, 'a') overwrites (1, 'a') in place assert list(ob) == [3, 2] # the item formerly keyed 1 is now keyed 3, in its original position assert list(ob._fwdm) == [2, 3] # whereas the backing dict appended 3 and dropped 1 assert repr(ob) == "UserOrderedBiBase({3: 'a', 2: 'b'})" def test_orderedbidict_cross_view_set_operations() -> None: """Set operations between an OrderedBidict keys view and an items view (or vice versa) should behave like the equivalent plain dict views rather than raising TypeError or giving a wrong result. Regression test: the set-operation proxy methods in _OrderedBidictKeysView and _OrderedBidictItemsView previously passed the opposing custom view type directly to the C-level dict_keys/dict_items methods, which returned NotImplemented (they only recognize dict_keys and dict_items). With both sides returning NotImplemented, Python raised TypeError (for the ordering comparisons) or fell back to the wrong answer (e.g. identity-based __eq__). The fix extracts the backing dict view from a cross-type _OView arg before forwarding. """ ob1 = OrderedBidict({'a': 1, 'b': 2}) ob2 = OrderedBidict({'a': 1}) d1 = {'a': 1, 'b': 2} d2 = {'a': 1} # The comparison operators return bools; the set-algebra operators return sets/bools. In every # case the OrderedBidict view result must match the equivalent plain dict view result exactly. # fmt: off ops = ( '__lt__', '__le__', '__gt__', '__ge__', '__eq__', '__ne__', # comparisons '__sub__', '__or__', '__xor__', '__and__', 'isdisjoint', # set algebra ) # fmt: on for op in ops: assert getattr(ob1.keys(), op)(ob2.items()) == getattr(d1.keys(), op)(d2.items()), op assert getattr(ob1.items(), op)(ob2.keys()) == getattr(d1.items(), op)(d2.keys()), op def test_abc_slots() -> None: """Bidict ABCs should define __slots__. Ref: https://docs.python.org/3/reference/datamodel.html#notes-on-using-slots Note: non-abstract bidict types do not define __slots__ as of v0.22.0. """ assert BidirectionalMapping.__dict__['__slots__'] == () assert MutableBidirectionalMapping.__dict__['__slots__'] == () @pytest.mark.parametrize('bi_t', bidict_types) def test_values_view_reversibility_matches_bidict(bi_t: BT[t.Any, t.Any]) -> None: """values() iterates the backing forward mapping, so it must be reversible exactly when the bidict itself is -- never advertising a reversed() that raises. """ bi = bi_t({1: -1, 2: -2}) values = bi.values() if isinstance(bi, Reversible): assert isinstance(values, Reversible) assert list(reversed(values)) == list(bi.values())[::-1] else: assert not isinstance(values, Reversible) with pytest.raises(TypeError): # and the claim is not a lie reversed(t.cast('t.Any', values)) @pytest.mark.parametrize('bi_t', bidict_types) def test_inv_aliases_inverse(bi_t: BT[KT, VT]) -> None: """bi.inv should alias bi.inverse.""" bi = bi_t() assert bi.inverse is bi.inv assert bi.inv.inverse is bi.inverse.inv def test_static_types() -> None: d = {'1': 1} fb = frozenbidict(d) assert_type(fb, frozenbidict[str, int]) assert_type(fb.inv, frozenbidict[int, str]) @pytest.mark.parametrize('bi_t', mutable_bidict_types) def test_setitem_existing_is_noop_with_nonreflexive_eq(bi_t: MBT[t.Any, t.Any]) -> None: """Setting an existing (key, val) pair should be a no-op even when key == key is False. Float NaN has non-reflexive equality (nan != nan), so it exercises the identity-based same-item check in _dedup. (Previously, _dedup used an equality-based same-item check that caused spurious KeyAndValueDuplicationErrors and AssertionErrors. See #377.) """ nan = float('nan') # NaN as key: b[nan] = 'a' again must not raise b1 = bi_t() b1[nan] = 'a' b1[nan] = 'a' assert len(b1) == 1 assert b1[nan] == 'a' # NaN as value: b['x'] = nan again must not raise b2 = bi_t() b2['x'] = nan b2['x'] = nan assert len(b2) == 1 assert b2['x'] is nan # A key or value that duplicates an existing item's key and an existing # *different* item's value must still raise, even when it's the same NaN object: b3 = bi_t() b3[nan] = 'a' b3['x'] = nan with pytest.raises(KeyAndValueDuplicationError): b3[nan] = nan class _AsymStored: """Pathological type equal to _AsymLookup instances, but only when on the left-hand side.""" @override def __hash__(self) -> int: return 1 @override def __eq__(self, other: object) -> bool: return isinstance(other, _AsymLookup) class _AsymLookup: """Pathological type that is never equal to anything, even when an _AsymStored equals it.""" @override def __hash__(self) -> int: return 1 @override def __eq__(self, other: object) -> bool: return False @pytest.mark.parametrize('bi_t', mutable_bidict_types) def test_setitem_existing_is_noop_with_asymmetric_eq(bi_t: MBT[t.Any, t.Any]) -> None: """Setting an existing (key, val) pair should be a no-op even when __eq__ is asymmetric. dict lookup compares stored == lookup, so a lookup key that a stored key compares equal to hits the stored key's item even when lookup == stored is False. _dedup must agree with the dict lookups rather than re-checking equality itself (with operands in the opposite order) and wrongly concluding the items differ. See #382. """ stored, lookup = _AsymStored(), _AsymLookup() probe: dict[t.Any, str] = {stored: 'hit'} if probe.get(lookup) != 'hit': pytest.skip('dict lookup on this runtime does not compare stored == lookup') # Asymmetric key: dict considers *lookup* the same key as *stored* -> no-op b1 = bi_t() b1[stored] = 'v' b1[lookup] = 'v' assert len(b1) == 1 assert next(iter(b1)) is stored # Asymmetric value -> no-op b2 = bi_t() b2['x'] = stored b2['x'] = lookup assert len(b2) == 1 assert b2['x'] is stored def assert_calls_match(call1: Callable[..., t.Any], call2: Callable[..., t.Any]) -> None: results: dict[t.Any, t.Any] = {call1: None, call2: None} for call in results: try: results[call] = call() except Exception as exc: # ruff: ignore[blind-except] results[call] = exc.__class__ assert results[call1] == results[call2] def assert_mappings_are_inverse(m1: Mapping[KT, VT], m2: Mapping[VT, KT]) -> None: assert len(m1) == len(m2) assert all(k == m2[v] for (k, v) in m1.items()) assert m1.keys() == frozenset(m2.values()) assert frozenset(m1.values()) == m2.keys() def assert_bi_and_inv_are_inverse(bi: BB[KT, VT]) -> None: assert_mappings_are_inverse(bi, bi.inv) assert bi is bi.inv.inv assert bi.inv is bi.inv.inv.inv def assert_bidicts_equal(b1: BB[KT, VT], b2: BB[KT, VT]) -> None: assert b1 == b2 assert b1.inv == b2.inv assert_mappings_are_inverse(b1, b2.inv) assert_mappings_are_inverse(b1.inv, b2) bidict-0.24.1/tox.ini000066400000000000000000000023431524342314000143470ustar00rootroot00000000000000[tox] download = true envlist = py3{15,14,13,12,11} pypy3.11 # Do not include the following so they only run when explicitly requested: # benchmark # coverage # docs # lint skip_missing_interpreters = true # https://hynek.me/articles/turbo-charge-tox/ package = wheel wheel_build_env = .pkg [testenv] runner = uv-venv-lock-runner passenv = # https://docs.pytest.org/en/stable/example/simple.html PYTEST_ADDOPTS # https://docs.pytest.org/en/7.1.x/reference/reference.html#envvar-FORCE_COLOR FORCE_COLOR # https://hypothesis.readthedocs.io/en/latest/settings.html#hypothesis.settings.print_blob # https://docs.github.com/en/actions/learn-github-actions/environment-variables#default-environment-variables CI allowlist_externals = bash commands = ty check pytest [testenv:benchmark] commands = pytest -c /dev/null -n0 --benchmark-autosave microbenchmarks.py [testenv:coverage] commands = coverage run -m pytest coverage combine coverage report [testenv:docs] dependency_groups = docs commands = sphinx-build -TWn --keep-going -b html -d {envtmpdir}/doctrees docs {envtmpdir}/html [testenv:lint] deps = skip_install = true allowlist_externals = prek commands = prek --all-files --verbose --show-diff-on-failure bidict-0.24.1/update_dev_dependencies000077500000000000000000000107031524342314000176070ustar00rootroot00000000000000#!/usr/bin/env bash # # Copyright 2009-2026 Joshua Bronson. All rights reserved. # # This Source Code Form is subject to the terms of the Mozilla Public # License, v. 2.0. If a copy of the MPL was not distributed with this # file, You can obtain one at http://mozilla.org/MPL/2.0/. set -euo pipefail log() { >&2 printf "> %s\n" "$@" } # prek auto-update moves the ruff pin in .pre-commit-config.yaml but knows nothing about # pyproject.toml's required-version, which exists to reject a local ruff older than that pin. # Left to drift, the floor keeps passing versions that lint with fewer rules than CI uses. check_ruff_required_version() { local pinned required pinned=$(grep -A1 'astral-sh/ruff-pre-commit' .pre-commit-config.yaml | sed -n 's/^ *rev: v//p') required=$(sed -n 's/^required-version = ">=\(.*\)"$/\1/p' pyproject.toml) if [[ -z $pinned || -z $required ]]; then log "Warning: could not compare ruff's pinned version to pyproject.toml's required-version." log " Check by hand that they agree, and fix this check if its parsing has gone stale." return fi if [[ $pinned != "$required" ]]; then log "Action needed: ruff is pinned to v$pinned, but required-version says >=$required." log " Set required-version = \">=$pinned\" in pyproject.toml, so that a ruff" log " older than the pinned one fails instead of linting with fewer rules." log fi } # Zero-pad a version into a fixed-width string, so that two of them compare correctly with the # lexicographic [[ < ]], which is available everywhere `sort -V` is not (e.g. BSD/macOS sort). version_key() { local major minor patch IFS=. read -r major minor patch <<<"$1" printf '%05d%05d%05d' "${major:-0}" "${minor:-0}" "${patch:-0}" } # The wheel's RECORD is written by uv_build, whose version comes from pyproject.toml's # [build-system] requires -- not from the uv on PATH, and not from uv.lock. Nothing else here # touches that pin, and left to drift it is what shipped 0.24.0 with hex RECORD hashes (#406). # The pin's floor guards correctness on its own; what needs watching is its ceiling, which # should keep covering the uv in uv.lock, so that building a release goes on using that uv's # built-in uv_build rather than quietly downloading a different version to build with. check_uv_build_pin() { local locked floor ceiling locked=$(sed -n '/^name = "uv"$/{n;s/^version = "\(.*\)"$/\1/p;}' uv.lock) floor=$(sed -n 's/^requires = \["uv_build>=\([^,"]*\),.*$/\1/p' pyproject.toml) ceiling=$(sed -n 's/^requires = \["uv_build>=[^,]*,<\([^"]*\)"\].*$/\1/p' pyproject.toml) if [[ -z $locked || -z $floor || -z $ceiling ]]; then log "Warning: could not compare uv.lock's uv version to pyproject.toml's uv_build pin." log " Check by hand that they agree, and fix this check if its parsing has gone stale." return fi if [[ ! $(version_key "$locked") < $(version_key "$ceiling") ]]; then log "Action needed: uv.lock has uv $locked, past uv_build>=$floor,<$ceiling's ceiling." log " Raise that ceiling in pyproject.toml to cover $locked, so that building a" log " release keeps using uv's own uv_build instead of downloading another." log " Leave the floor alone: it is what keeps #406 from recurring." log elif [[ $(version_key "$locked") < $(version_key "$floor") ]]; then log "Action needed: uv.lock has uv $locked, below uv_build>=$floor,<$ceiling's floor, so a" log " release would be built by a downloaded uv_build rather than this uv's own." log " Upgrade uv rather than lowering the floor, which guards against #406." log fi } main() { declare -r hint="Hint: Use 'nix develop' to bootstrap a development environment" for cmd in uv prek; do if ! command -v "$cmd" >/dev/null 2>&1; then log "Error: No '$cmd' on PATH. $hint" exit 1 fi done log "Upgrading PyPI dependencies..." uv lock --upgrade && uv sync log "Upgrading PyPI dependencies: Done" log log "Upgrading pre-commit hooks..." prek auto-update log "Upgrading pre-commit hooks: Done" log check_ruff_required_version check_uv_build_pin log "Reminders:" log " - Check release notes of upgraded packages for anything that affects bidict." log " - Ensure tests pass for all supported Python versions." log " - Check output for any new warnings, not just test failures." log " - Ensure 'prek run --all-files' still succeeds." } main bidict-0.24.1/uv.lock000066400000000000000000004526611524342314000143540ustar00rootroot00000000000000version = 1 revision = 3 requires-python = ">=3.11" resolution-markers = [ "python_full_version >= '3.15'", "python_full_version >= '3.12' and python_full_version < '3.15'", "python_full_version < '3.12'", ] [[package]] name = "accessible-pygments" version = "0.0.5" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "pygments" }, ] sdist = { url = "https://files.pythonhosted.org/packages/bc/c1/bbac6a50d02774f91572938964c582fff4270eee73ab822a4aeea4d8b11b/accessible_pygments-0.0.5.tar.gz", hash = "sha256:40918d3e6a2b619ad424cb91e556bd3bd8865443d9f22f1dcdf79e33c8046872", size = 1377899, upload-time = "2024-05-10T11:23:10.216Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/8d/3f/95338030883d8c8b91223b4e21744b04d11b161a3ef117295d8241f50ab4/accessible_pygments-0.0.5-py3-none-any.whl", hash = "sha256:88ae3211e68a1d0b011504b2ffc1691feafce124b845bd072ab6f9f66f34d4b7", size = 1395903, upload-time = "2024-05-10T11:23:08.421Z" }, ] [[package]] name = "alabaster" version = "1.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/a6/f8/d9c74d0daf3f742840fd818d69cfae176fa332022fd44e3469487d5a9420/alabaster-1.0.0.tar.gz", hash = "sha256:c00dca57bca26fa62a6d7d0a9fcce65f3e026e9bfe33e9c538fd3fbb2144fd9e", size = 24210, upload-time = "2024-07-26T18:15:03.762Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/7e/b3/6b4067be973ae96ba0d615946e314c5ae35f9f993eca561b356540bb0c2b/alabaster-1.0.0-py3-none-any.whl", hash = "sha256:fc6786402dc3fcb2de3cabd5fe455a2db534b371124f1f21de8731783dec828b", size = 13929, upload-time = "2024-07-26T18:15:02.05Z" }, ] [[package]] name = "babel" version = "2.18.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/7d/b2/51899539b6ceeeb420d40ed3cd4b7a40519404f9baf3d4ac99dc413a834b/babel-2.18.0.tar.gz", hash = "sha256:b80b99a14bd085fcacfa15c9165f651fbb3406e66cc603abf11c5750937c992d", size = 9959554, upload-time = "2026-02-01T12:30:56.078Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/77/f5/21d2de20e8b8b0408f0681956ca2c69f1320a3848ac50e6e7f39c6159675/babel-2.18.0-py3-none-any.whl", hash = "sha256:e2b422b277c2b9a9630c1d7903c2a00d0830c409c59ac8cae9081c92f1aeba35", size = 10196845, upload-time = "2026-02-01T12:30:53.445Z" }, ] [[package]] name = "beautifulsoup4" version = "4.15.0" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "soupsieve" }, { name = "typing-extensions" }, ] sdist = { url = "https://files.pythonhosted.org/packages/43/65/318323f98dbee45d42dff61d8f047181bc6f2268a9068cfad035a46be5af/beautifulsoup4-4.15.0.tar.gz", hash = "sha256:288e3ca7d54b06f2ac191970bc275c1939cb46d450b255bf6718b04aa37ab4f7", size = 632571, upload-time = "2026-06-07T16:44:20.453Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/88/c6/92fcd42f1ba33e1184263f25bfabf3d27c383410470f169e4b8163bf9c17/beautifulsoup4-4.15.0-py3-none-any.whl", hash = "sha256:d6f88de62e1d4e38ecb1077eb9724cd0eff29d2a08ca16a401e9b9e93f117cf9", size = 109924, upload-time = "2026-06-07T16:44:21.566Z" }, ] [[package]] name = "bidict" version = "0.24.1" source = { editable = "." } dependencies = [ { name = "typing-extensions", marker = "python_full_version < '3.12'" }, ] [package.dev-dependencies] dev = [ { name = "pytest-clarity" }, { name = "pytest-icdiff" }, { name = "pytest-sugar" }, { name = "tox" }, { name = "tox-uv" }, ] docs = [ { name = "furo" }, { name = "sphinx", version = "9.0.4", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version < '3.12'" }, { name = "sphinx", version = "9.1.0", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version >= '3.12'" }, { name = "sphinx-copybutton" }, ] test = [ { name = "coverage" }, { name = "hypothesis" }, { name = "pytest" }, { name = "pytest-benchmark" }, { name = "pytest-sphinx" }, { name = "pytest-xdist" }, { name = "sortedcollections" }, { name = "sortedcontainers" }, { name = "ty" }, { name = "typing-extensions" }, ] [package.metadata] requires-dist = [{ name = "typing-extensions", marker = "python_full_version < '3.12'", specifier = ">=4.0" }] [package.metadata.requires-dev] dev = [ { name = "pytest-clarity" }, { name = "pytest-icdiff" }, { name = "pytest-sugar" }, { name = "tox" }, { name = "tox-uv" }, ] docs = [ { name = "furo" }, { name = "sphinx" }, { name = "sphinx-copybutton" }, ] test = [ { name = "coverage" }, { name = "hypothesis" }, { name = "pytest" }, { name = "pytest-benchmark" }, { name = "pytest-sphinx" }, { name = "pytest-xdist" }, { name = "sortedcollections" }, { name = "sortedcontainers" }, { name = "ty", specifier = ">=0.0.72" }, { name = "typing-extensions" }, ] [[package]] name = "cachetools" version = "7.1.4" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/f4/8b/0d3945a13955303b81272f759a0331e54c5c793da455e6f5706b89d2639c/cachetools-7.1.4.tar.gz", hash = "sha256:437f55a4e0c1b01a4f3077cc470e6991d47430970e36fbcb77e2be0df4fc1cd6", size = 40085, upload-time = "2026-05-21T22:40:43.376Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/8c/7b/1fc1c09cc0756cf25861a3be10565915953876da48bb228fb9a672b20a42/cachetools-7.1.4-py3-none-any.whl", hash = "sha256:323dc4127934744db5b54eb4924482d7edafbf9554e820d1531c2e08c0e4ef54", size = 16761, upload-time = "2026-05-21T22:40:41.845Z" }, ] [[package]] name = "certifi" version = "2026.6.17" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/c9/c7/424b75da314c1045981bd9777432fad05a9e0c69daa4ed7e308bbaffe405/certifi-2026.6.17.tar.gz", hash = "sha256:024c88eeec92ca068db80f02b8b07c9cef7b9fe261d1d535abfd5abd6f6af432", size = 134594, upload-time = "2026-06-17T10:31:07.894Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/ef/2f/c5464532e965badff2f4c4c1a3a83f5697f0d7c407ed0cda44aaa99bb451/certifi-2026.6.17-py3-none-any.whl", hash = "sha256:2227dcbaafe0d2f59279d1762ddddc37783ed4354594f194ffc31d20f41fc3db", size = 133289, upload-time = "2026-06-17T10:31:06.348Z" }, ] [[package]] name = "charset-normalizer" version = "3.4.8" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/20/56/10a88e00039537d74bd420f0457c52ab8f58a1af56126e3b9f1b1c8c4724/charset_normalizer-3.4.8.tar.gz", hash = "sha256:d9bf144d6faf12c70d58e47f7512992ae2882b820031d6cef68152deb645bf2d", size = 151790, upload-time = "2026-07-06T15:27:58.477Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/94/b5/7f10929c45e2d0d0dc78bead98458c271af3e028e66b16441de88829a8b7/charset_normalizer-3.4.8-cp311-cp311-macosx_10_9_universal2.whl", hash = "sha256:ca832d525a2a52542048111cb44e0dea595b9ad53ad542020aa770f308427b92", size = 316812, upload-time = "2026-07-06T15:25:58.71Z" }, { url = "https://files.pythonhosted.org/packages/2a/b4/8e936a5e19d7e7b19db29aeed0988b481dc745eed3437829780f6ec98ce9/charset_normalizer-3.4.8-cp311-cp311-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:ab07eb7b564635602734c3ef0e8d2db9d59cbbce54f5dc42b8f11aa1f56ce364", size = 213580, upload-time = "2026-07-06T15:26:00.121Z" }, { url = "https://files.pythonhosted.org/packages/27/b8/dbc3b3c4796e4e29e193c5d7e100bb8ebfa66267994c01ba1eaaa3ebc474/charset_normalizer-3.4.8-cp311-cp311-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:6e88da593ea098194ea08f58924b716a9ae0c39058edad8c5c9b0bafa39fbd56", size = 235244, upload-time = "2026-07-06T15:26:01.402Z" }, { url = "https://files.pythonhosted.org/packages/93/22/808ff7eb8d344a174b89a388a4540fb86e486f608c16b9a2a023ddf6c9c6/charset_normalizer-3.4.8-cp311-cp311-manylinux2014_s390x.manylinux_2_17_s390x.manylinux_2_28_s390x.whl", hash = "sha256:8ca83574f63f71b485da1c50d4e17bcef7375a56b459a861562554f1fbaac1a4", size = 229678, upload-time = "2026-07-06T15:26:02.62Z" }, { url = "https://files.pythonhosted.org/packages/c2/35/525d3e86af55a66073c02dbf9b6a720c74601489e4b4cb391cad0a4cb620/charset_normalizer-3.4.8-cp311-cp311-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:9840cca6969a7e35498f1ce6fc32b7842500783d303b5ab254679a0f591093c4", size = 221015, upload-time = "2026-07-06T15:26:03.888Z" }, { url = "https://files.pythonhosted.org/packages/e1/63/10f18541380f2d1c40ffda42835661aa9f88a1333e586d7b0f1d29869113/charset_normalizer-3.4.8-cp311-cp311-manylinux_2_31_armv7l.whl", hash = "sha256:ca8776b012d464136c239f51133120db94397bc69f3faee404ff8c99827f8192", size = 205002, upload-time = "2026-07-06T15:26:05.32Z" }, { url = "https://files.pythonhosted.org/packages/1e/0b/28168f20737bb7d7d40d29cb82d2084cb3a8c19a4e1fef18f07069a24338/charset_normalizer-3.4.8-cp311-cp311-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:23c40d25fe581d34ff0ef7ff1ca1527f5c51c5c6edf0b8384eeafac4a0438469", size = 217527, upload-time = "2026-07-06T15:26:06.47Z" }, { url = "https://files.pythonhosted.org/packages/8a/41/bc39417675dcca7151be665ec20f4b1b25ff3486d8eb2f3d7662ebc56082/charset_normalizer-3.4.8-cp311-cp311-musllinux_1_2_aarch64.whl", hash = "sha256:6809e40a8876eb4742676fbbb57056c0344ef2555e5597d4343f0b365953afdd", size = 216538, upload-time = "2026-07-06T15:26:07.836Z" }, { url = "https://files.pythonhosted.org/packages/76/7f/e322a4f060a32aa9510d3c76689be7d58c62653b09fe156912471e17a7bc/charset_normalizer-3.4.8-cp311-cp311-musllinux_1_2_armv7l.whl", hash = "sha256:1bfd4bf262d6f26805cc6a32dae2554db66ef7533e6c62cc12644d3882be05e5", size = 206170, upload-time = "2026-07-06T15:26:09.269Z" }, { url = "https://files.pythonhosted.org/packages/5d/64/07d0a02c401433ba18d57f55a96ffe7c701a11eac57c74bae0e1506cfa40/charset_normalizer-3.4.8-cp311-cp311-musllinux_1_2_x86_64.whl", hash = "sha256:9421549d803f0f712aa6e1496d15ff5ac510fc4c7104e7e299ea1d498d582d59", size = 222807, upload-time = "2026-07-06T15:26:10.476Z" }, { url = "https://files.pythonhosted.org/packages/e1/84/2d132bdad9cadc3251bbad2813d29642c068855ad0394234f76845672100/charset_normalizer-3.4.8-cp311-cp311-win32.whl", hash = "sha256:9a2748f7588b0c1e5166db3a9448fe86e392479aded89b0c86382d41cade91a2", size = 150195, upload-time = "2026-07-06T15:26:11.654Z" }, { url = "https://files.pythonhosted.org/packages/8d/5f/c46567479049f46929d8ed9e628990c2419f369c5ea5797add417808d37b/charset_normalizer-3.4.8-cp311-cp311-win_amd64.whl", hash = "sha256:2e9f0db12ea28a3349e514443fc56d4b1fb3c81d0f9c0e33dacfdfc2ac63f774", size = 161151, upload-time = "2026-07-06T15:26:13.111Z" }, { url = "https://files.pythonhosted.org/packages/d1/ac/39a8bc03f7550f86f8c43205f2c97bc3a4cea775e5a0c0317917679cdef5/charset_normalizer-3.4.8-cp311-cp311-win_arm64.whl", hash = "sha256:4b1f25c6e376033f31463d66f8bb01ae77a128ca11c6677c69ed8e9ce913bbf9", size = 152392, upload-time = "2026-07-06T15:26:14.335Z" }, { url = "https://files.pythonhosted.org/packages/59/c2/39de60ef5687662f467bed3d1e6944c67a4f0d057141d0404002b8f405ae/charset_normalizer-3.4.8-cp312-cp312-macosx_10_13_universal2.whl", hash = "sha256:faac37c4904598daa00cb4c9b32f3b4cc814fb5f145d7a531ceb4a70f2114132", size = 319040, upload-time = "2026-07-06T15:26:15.854Z" }, { url = "https://files.pythonhosted.org/packages/a7/57/a9474c3aeaa337c8a330c0dc5df266527d56da3b189c029529f6b08af2a4/charset_normalizer-3.4.8-cp312-cp312-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:f191c19a32dc6cec0fb8079789d786254653a9ce906fcab04ccd2eed07bba233", size = 215541, upload-time = "2026-07-06T15:26:17.265Z" }, { url = "https://files.pythonhosted.org/packages/13/a9/be1ff7e81f6e086dced2a7a7a28b789be351d9796084ccaf6136a4ffafb3/charset_normalizer-3.4.8-cp312-cp312-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:05811b76943d477bb90822dedb5c4565cef70148847a59d574e2b35043aeb563", size = 236913, upload-time = "2026-07-06T15:26:18.482Z" }, { url = "https://files.pythonhosted.org/packages/8f/75/d8c5eae93da26d463f9ebe46a4937ca44434dc2937a565b92437befb3d94/charset_normalizer-3.4.8-cp312-cp312-manylinux2014_s390x.manylinux_2_17_s390x.manylinux_2_28_s390x.whl", hash = "sha256:3868a3e4ec1e40b419e060d063f93eac6f046fa21426c4816421223ae7dc8ab8", size = 232815, upload-time = "2026-07-06T15:26:19.734Z" }, { url = "https://files.pythonhosted.org/packages/27/0d/98e301ca944bcca5e6bc312406b579c8a6d81546c1b494afb3a9478495d6/charset_normalizer-3.4.8-cp312-cp312-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:25f93d194eb6264c64416cabff46a91f6d99b97e7525a1b4f35c77a99e75cc68", size = 223995, upload-time = "2026-07-06T15:26:20.931Z" }, { url = "https://files.pythonhosted.org/packages/fa/df/f5222366b76dcb31453a9bd922610c893540d0e729fd390439b0d3e972ee/charset_normalizer-3.4.8-cp312-cp312-manylinux_2_31_armv7l.whl", hash = "sha256:ee6a62492f18d432cca031fabd158f400a8c25bf7b9458f50953393a2a23d97a", size = 208522, upload-time = "2026-07-06T15:26:22.214Z" }, { url = "https://files.pythonhosted.org/packages/74/52/293220d59d8ddfb8aa56836b33bd6df58e70795d8a102a858c2984480f00/charset_normalizer-3.4.8-cp312-cp312-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:1c16cb4fc35e4b064f5ee78d849f15a550ada1729c3372916672e38f1f01d1d4", size = 219660, upload-time = "2026-07-06T15:26:23.493Z" }, { url = "https://files.pythonhosted.org/packages/c3/2c/81a298e66f3d01e61bfc6f7064bbb553b067a9f1d979e5962bf00733069b/charset_normalizer-3.4.8-cp312-cp312-musllinux_1_2_aarch64.whl", hash = "sha256:2fbd0edb0426ab28e70fac9d1d4ef549eb5a64a2521f0428c441d75e4387e6c2", size = 218230, upload-time = "2026-07-06T15:26:24.629Z" }, { url = "https://files.pythonhosted.org/packages/0d/45/f1dd2328cbc3340705f82072c09bd4c68d6e079191cde05810c1eac77eee/charset_normalizer-3.4.8-cp312-cp312-musllinux_1_2_armv7l.whl", hash = "sha256:ccb9052771216170015f810b88065fd9e13b1e0b391f92abb9b47e0919a42aad", size = 210006, upload-time = "2026-07-06T15:26:25.837Z" }, { url = "https://files.pythonhosted.org/packages/38/63/28697000620e117eb413424caaf60b6f98ddb1b09b2c11f7c0038d9936a7/charset_normalizer-3.4.8-cp312-cp312-musllinux_1_2_x86_64.whl", hash = "sha256:3809ba5d3cd02aca0894597f2669a825bdfe2229061515c128b0f4e5533b4ab5", size = 225771, upload-time = "2026-07-06T15:26:27.079Z" }, { url = "https://files.pythonhosted.org/packages/12/a7/d5844e315f5f35e7938c415f07a1df144eed1cf993f1b43cc16c980c5b46/charset_normalizer-3.4.8-cp312-cp312-win32.whl", hash = "sha256:de63c31666a049f653ada24e800192e3c019e96bc7d70fb449a000bccf26a36f", size = 150922, upload-time = "2026-07-06T15:26:28.514Z" }, { url = "https://files.pythonhosted.org/packages/9b/82/eb8b72f184b1e4986dd9daec15d7f6d9285a6728d2b07b7f04656829f473/charset_normalizer-3.4.8-cp312-cp312-win_amd64.whl", hash = "sha256:14a4bbe066f3fb05c6ba70e9cf9d34614b57a2fd70ea8c27cc30f34155e16a58", size = 162294, upload-time = "2026-07-06T15:26:29.745Z" }, { url = "https://files.pythonhosted.org/packages/09/5a/ab810134aa41034a08ffe94c058102016e6ad9bce62f3cdba547b4723385/charset_normalizer-3.4.8-cp312-cp312-win_arm64.whl", hash = "sha256:2b5b0c0dca0a02c3f816f89abf18af3d20416dedbc3d3aa5f3981045f88ae7b0", size = 152409, upload-time = "2026-07-06T15:26:31.034Z" }, { url = "https://files.pythonhosted.org/packages/11/49/fe5a8572a70cd9cba79f80af9388ac8c5c914ed4459b956f940244e499a5/charset_normalizer-3.4.8-cp313-cp313-macosx_10_13_universal2.whl", hash = "sha256:057f8609f7341618c98e5aa9a6109fa116acff2a658497d47ab3325b5e8f2b08", size = 317424, upload-time = "2026-07-06T15:26:32.23Z" }, { url = "https://files.pythonhosted.org/packages/e5/59/d71c96616b6825425a876f79f38fa440db30b32cc1166179a839f6259150/charset_normalizer-3.4.8-cp313-cp313-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:c591f9a82adc5b89a039b90df74e43de2b9177fb46771172bed7b80722a70db0", size = 214723, upload-time = "2026-07-06T15:26:33.635Z" }, { url = "https://files.pythonhosted.org/packages/c6/35/dc9eeb297f19b7b6ada39709ccb74937e6c51f0947958ae601a977cedd5d/charset_normalizer-3.4.8-cp313-cp313-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:5b56f449132d9adefe55b87635d05177a914ed5d070438a74725e1d77a280002", size = 236200, upload-time = "2026-07-06T15:26:34.99Z" }, { url = "https://files.pythonhosted.org/packages/0a/37/6775fe852b4acad8bf7e0575fbe8aa9f41b546e33251acbded3c04a6b0d9/charset_normalizer-3.4.8-cp313-cp313-manylinux2014_s390x.manylinux_2_17_s390x.manylinux_2_28_s390x.whl", hash = "sha256:1004c3b5831a301dadfb9e916f38e78e2ff3e08db24a1ad7c354db8ee3dea9c3", size = 231740, upload-time = "2026-07-06T15:26:36.498Z" }, { url = "https://files.pythonhosted.org/packages/e4/28/1bcc3f5f3bac81532384adcfcdd9362c7f46a188a19deacc1ddaf7bdaa00/charset_normalizer-3.4.8-cp313-cp313-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:60883e22821d17c9e5b4f3ca1ef8074f766e3db28791f851b665929c515635c0", size = 222888, upload-time = "2026-07-06T15:26:38.161Z" }, { url = "https://files.pythonhosted.org/packages/47/81/9f3993ca62ef090c58059da641e49e3129e74700a6a3beb58436cdb8d4b9/charset_normalizer-3.4.8-cp313-cp313-manylinux_2_31_armv7l.whl", hash = "sha256:21e4dbb942c8a6342e2685f232dd2a7bc73465697bd26ead4f118271d28be383", size = 207649, upload-time = "2026-07-06T15:26:39.628Z" }, { url = "https://files.pythonhosted.org/packages/11/f4/679f636bcbdc2d53d06b1f4039be310450dca95a9f76bbf22f09985556e8/charset_normalizer-3.4.8-cp313-cp313-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:84bcae14c65e645ca66b661339183d32b8c846a17c96e3e81ab3d346e1c498d4", size = 218908, upload-time = "2026-07-06T15:26:40.911Z" }, { url = "https://files.pythonhosted.org/packages/7e/44/96e8c81867ba8a45ff893c8e7474c2d6b9633f7aa663da7901d040214d3e/charset_normalizer-3.4.8-cp313-cp313-musllinux_1_2_aarch64.whl", hash = "sha256:b4e4d44b8287aa13a25e16e29393d494b0643b24894f7c8266c6f6788dd36337", size = 217096, upload-time = "2026-07-06T15:26:42.148Z" }, { url = "https://files.pythonhosted.org/packages/a5/bf/4d53f04f29bdb22601701f4f9f4d038edfb27976c296fcb7400c02736a6e/charset_normalizer-3.4.8-cp313-cp313-musllinux_1_2_armv7l.whl", hash = "sha256:f68545d1b267dbfafd5d253b6d1cb161562c4e61ab25b5c4cdb7d9e5923e441e", size = 209355, upload-time = "2026-07-06T15:26:43.557Z" }, { url = "https://files.pythonhosted.org/packages/ad/60/92b3f630798d777fa880ad289a3f9f2fc663e4b4beb24783c53318820254/charset_normalizer-3.4.8-cp313-cp313-musllinux_1_2_x86_64.whl", hash = "sha256:1936e48214adea74922a20c8ab41b1393ae27cc9e329eb1f0b937d3416824f36", size = 224732, upload-time = "2026-07-06T15:26:44.892Z" }, { url = "https://files.pythonhosted.org/packages/bd/85/eafa0a3c7bb6fe9f02f4c7901f02071933cac85ee634197e17280818c6de/charset_normalizer-3.4.8-cp313-cp313-win32.whl", hash = "sha256:1f8e3521860187d597f3867d8466da225b9179ea2833bb26de1bb026144d07c3", size = 150358, upload-time = "2026-07-06T15:26:46.153Z" }, { url = "https://files.pythonhosted.org/packages/f5/8c/879fafff7b47bb1166d289f2d2472cb31b9922f9f4ca1f392edf85ec16be/charset_normalizer-3.4.8-cp313-cp313-win_amd64.whl", hash = "sha256:8b654b6f52a0a9a6be38e88f3e1dc68f1093ebeb2abbadafc7c82da0786a34be", size = 161685, upload-time = "2026-07-06T15:26:47.423Z" }, { url = "https://files.pythonhosted.org/packages/c3/46/b57c7e778a7b578f28d35fd38544687d4f8d9c019585eebc5ad936073fad/charset_normalizer-3.4.8-cp313-cp313-win_arm64.whl", hash = "sha256:d2d5a250ee26e29468b7607d97479221b069fa8aaf6f929ac84ec0e962e15154", size = 152333, upload-time = "2026-07-06T15:26:48.689Z" }, { url = "https://files.pythonhosted.org/packages/1c/bc/0a8540b8cd494951cca1428606373942803f5ffcec40fe798f819c5a8adb/charset_normalizer-3.4.8-cp314-cp314-macosx_10_15_universal2.whl", hash = "sha256:77e993ecf65f21ab1f82266ff5e84a7de2c879e7d9b8bc006009df83f22a1d5e", size = 316993, upload-time = "2026-07-06T15:26:49.962Z" }, { url = "https://files.pythonhosted.org/packages/0e/99/a0868f0a1f0a045fd374d1f2cf7042d8ad5d7fb4dd1f4ac7365e319f7e32/charset_normalizer-3.4.8-cp314-cp314-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:524939917f17f6de502dfda30b472550965740d7f126659d4c4f8dd1569cce22", size = 215638, upload-time = "2026-07-06T15:26:51.338Z" }, { url = "https://files.pythonhosted.org/packages/e8/e9/43c4d09a09b5557cc5fe1d87c9d96f86a3942aec0517d2b5408cef87ca75/charset_normalizer-3.4.8-cp314-cp314-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:a4508989ba8e2ce43ef989453d18188b261546e8188cbdd4ef451fb9e4c3b467", size = 236456, upload-time = "2026-07-06T15:26:52.531Z" }, { url = "https://files.pythonhosted.org/packages/e2/67/492ca98b3ab785b736b5da10c1bc233e1c8fec6c0cdb29b482c38bfc52a2/charset_normalizer-3.4.8-cp314-cp314-manylinux2014_s390x.manylinux_2_17_s390x.manylinux_2_28_s390x.whl", hash = "sha256:9e44127f7d11eee4548ad2cdf1f4e1b6eaaddd5cb92d15ad65f6ecc9bcf403ab", size = 232253, upload-time = "2026-07-06T15:26:53.838Z" }, { url = "https://files.pythonhosted.org/packages/2d/fd/1e6eff58c14f1aace1e26d80defbeaea2d35e075dbe4b611111ee4b47fa8/charset_normalizer-3.4.8-cp314-cp314-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:bb90317359f7e67bb6df615999a95e0980877468e617ddce8b6c2f8e7fe60d95", size = 222886, upload-time = "2026-07-06T15:26:55.009Z" }, { url = "https://files.pythonhosted.org/packages/40/7a/90056a5326b0c4b9a3f924d337729c344c11542e5bc7191e50410db61587/charset_normalizer-3.4.8-cp314-cp314-manylinux_2_31_armv7l.whl", hash = "sha256:35d9e7a9c960520ae89d1f4e305d1c047a74dea2e0f73a0e84f879356c2e8776", size = 206482, upload-time = "2026-07-06T15:26:56.306Z" }, { url = "https://files.pythonhosted.org/packages/18/ff/94761d31a33878dbb5008ddbd918615061fcf5c0a612aa3075450e60f628/charset_normalizer-3.4.8-cp314-cp314-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:92e322b054c7ff886f78feab7360736bb45de2e18cf4a0ee84e8fc5a08d53a19", size = 218929, upload-time = "2026-07-06T15:26:57.422Z" }, { url = "https://files.pythonhosted.org/packages/2b/dc/00b9675acd7c4b926b9102ee3f0d1a570ce943901be73b87485001393fe1/charset_normalizer-3.4.8-cp314-cp314-musllinux_1_2_aarch64.whl", hash = "sha256:3c0086d97094363556206dc3bcf43f7edcfc043ea7a568a46f45efea74858bd1", size = 218069, upload-time = "2026-07-06T15:26:58.719Z" }, { url = "https://files.pythonhosted.org/packages/04/11/94ada5a0482ee4bf688d04be4c7d6fd945d37370d04a95671040dfe2b416/charset_normalizer-3.4.8-cp314-cp314-musllinux_1_2_armv7l.whl", hash = "sha256:0752c849b51198267df2aba013c4de3a2955bd014a4fd70828809946c1acbc0c", size = 207146, upload-time = "2026-07-06T15:27:00.058Z" }, { url = "https://files.pythonhosted.org/packages/7c/f7/246bd36762207ab4752cd436b64e5d81a1668b15ddea7b5b2d0e8545e727/charset_normalizer-3.4.8-cp314-cp314-musllinux_1_2_x86_64.whl", hash = "sha256:2a4707e09eca11e81ece4fced600c5a0a801f568b962244f6f517bc274745fc9", size = 224896, upload-time = "2026-07-06T15:27:01.599Z" }, { url = "https://files.pythonhosted.org/packages/6f/f7/3510622d1fbe13b0ebf827c475e40a27e2be427140d792878b63ab6425cc/charset_normalizer-3.4.8-cp314-cp314-win32.whl", hash = "sha256:8ea67f427c073ae3da0923aa55f3715131fa613a61a7f2f8d762bde75eaf00ae", size = 150851, upload-time = "2026-07-06T15:27:02.964Z" }, { url = "https://files.pythonhosted.org/packages/32/2b/9ce65dd21672b55cf800cca5f4433afa1586fda1d78731067ec9ec544c62/charset_normalizer-3.4.8-cp314-cp314-win_amd64.whl", hash = "sha256:ff71018850863362e5c7533769d0a9f77715c31af1502d523630ce822922f5c9", size = 162549, upload-time = "2026-07-06T15:27:04.249Z" }, { url = "https://files.pythonhosted.org/packages/2f/34/9a5967eed666a88f31a0866884606d9ec3c2cd6091e2ccd7e0b4c4176c35/charset_normalizer-3.4.8-cp314-cp314-win_arm64.whl", hash = "sha256:44464e66f4da2f21dea7145c7693f9f60717ca4794a954dea5bf8c2c932678bd", size = 153079, upload-time = "2026-07-06T15:27:05.608Z" }, { url = "https://files.pythonhosted.org/packages/02/4f/aa44cc81d8987f105352c74c0bf919007f8b80e9880d28bcf0393c1a816e/charset_normalizer-3.4.8-cp314-cp314t-macosx_10_15_universal2.whl", hash = "sha256:50a0c2e58ad2c203adb616fef28941b7e13716adbc25e0dfaeec29f5afe6382f", size = 338586, upload-time = "2026-07-06T15:27:06.86Z" }, { url = "https://files.pythonhosted.org/packages/1d/2b/b0392e2b235c08ff0623d905c2ee8ac820620544043c1ce92ce0b3d64c55/charset_normalizer-3.4.8-cp314-cp314t-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:8a1e589fdb95c76f08288bbb346230cdd8994db74903db6637b380f7b5fc9336", size = 222764, upload-time = "2026-07-06T15:27:08.23Z" }, { url = "https://files.pythonhosted.org/packages/a2/a1/7d466879190731f5559662c22232646f2ae2dace2323c3e5aefcf78d458a/charset_normalizer-3.4.8-cp314-cp314t-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:b3d7c887444c5a7ef0d68d358d81e758a850bc626f8e639e2ca5667153272b20", size = 241331, upload-time = "2026-07-06T15:27:09.512Z" }, { url = "https://files.pythonhosted.org/packages/70/17/8b89e797137aa28c8fb0bafbafc243246a7afe21620a13b00e37624ece1d/charset_normalizer-3.4.8-cp314-cp314t-manylinux2014_s390x.manylinux_2_17_s390x.manylinux_2_28_s390x.whl", hash = "sha256:65c389b96c0cfff3a3f0458fa1c7ce554a30e23101a88a49f03997afce6a929f", size = 239323, upload-time = "2026-07-06T15:27:10.86Z" }, { url = "https://files.pythonhosted.org/packages/d7/98/1c1940730ed22d50983be4e243c722c89d5136d6f073bd840d1128bfddcb/charset_normalizer-3.4.8-cp314-cp314t-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:593403fc47dcdf55e2987b2e3cc2e064127e2b908929f1f18b2e4a4652cbd780", size = 229964, upload-time = "2026-07-06T15:27:12.113Z" }, { url = "https://files.pythonhosted.org/packages/53/2d/bb8e81b7ff603d3f77e9a8a5d1ad34fcabbf3c54d300c29d99fba581fa23/charset_normalizer-3.4.8-cp314-cp314t-manylinux_2_31_armv7l.whl", hash = "sha256:606088e9fa2b7469ab9c42d4da8e05a415622a07714edd2fcd8fed48dda4c853", size = 212405, upload-time = "2026-07-06T15:27:13.447Z" }, { url = "https://files.pythonhosted.org/packages/ce/1f/e52a3a53b13da591bb8f21d29e63877268eadf20686b7762351d4b89062c/charset_normalizer-3.4.8-cp314-cp314t-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:0317406326fed512f42a1632ad91a96228a7616c06547666a6dd79967f1bd6ca", size = 226918, upload-time = "2026-07-06T15:27:14.89Z" }, { url = "https://files.pythonhosted.org/packages/e8/f9/32996d79c57189af9722fe618f46d8a86b7be035ca98887b8d0c3821f141/charset_normalizer-3.4.8-cp314-cp314t-musllinux_1_2_aarch64.whl", hash = "sha256:b67d50ee47e5c57a0064a9cb575b963a7125819dfd1fd094d44d378fff94659b", size = 225113, upload-time = "2026-07-06T15:27:16.125Z" }, { url = "https://files.pythonhosted.org/packages/d6/d2/9248c18e695696513774523a794cfb8b677521ce9ad7554d301cb10a9b20/charset_normalizer-3.4.8-cp314-cp314t-musllinux_1_2_armv7l.whl", hash = "sha256:79e402b869f270140afa5e2b0e2ac100585358d812fe3dd093d424f7a72964e0", size = 214966, upload-time = "2026-07-06T15:27:17.418Z" }, { url = "https://files.pythonhosted.org/packages/1e/9d/4b19432d406179a40f924691906ee5b15ac664b408971c973295192444ea/charset_normalizer-3.4.8-cp314-cp314t-musllinux_1_2_x86_64.whl", hash = "sha256:2970b9f7ab69ec3a0423ec6b6ac718e79fbf4a282c0bc103ef88c1ef50dfa15a", size = 231699, upload-time = "2026-07-06T15:27:19.131Z" }, { url = "https://files.pythonhosted.org/packages/be/41/bdbdf71e8c3ccff10ef3cc2bb9467a7fdb3dc94b9a406d1a3c44afd39632/charset_normalizer-3.4.8-cp314-cp314t-win32.whl", hash = "sha256:458c2972a78043b7261c9726670029f15f722e70669bcbe961153a01968f589f", size = 155333, upload-time = "2026-07-06T15:27:20.681Z" }, { url = "https://files.pythonhosted.org/packages/bd/f8/e05c69323bd50091ec39f5f885385b884624b0131a6885a0c83a6217ba7a/charset_normalizer-3.4.8-cp314-cp314t-win_amd64.whl", hash = "sha256:0c926329a1df7cd56d7d8349fe354460d20aefd2e394c9e159e479d018b2b359", size = 167378, upload-time = "2026-07-06T15:27:22.042Z" }, { url = "https://files.pythonhosted.org/packages/c2/04/cbaf1a2f5e2bbf70760e774380cbf052b10849fc35e770905df31af5cf00/charset_normalizer-3.4.8-cp314-cp314t-win_arm64.whl", hash = "sha256:2232baea80a2b01783679fed4e625ccdb19a974f44c9cf0fba21a777a4c8179c", size = 157782, upload-time = "2026-07-06T15:27:23.312Z" }, { url = "https://files.pythonhosted.org/packages/23/52/d5bee5b6ea81882d549b566d2545b044bbcbc33fe5fbe001008a7e745a21/charset_normalizer-3.4.8-py3-none-any.whl", hash = "sha256:b7c1fb310df524e01fbe84d43b7f95aa4f808f8eaa0dafc185f64ba395e37d54", size = 64279, upload-time = "2026-07-06T15:27:57.043Z" }, ] [[package]] name = "colorama" version = "0.4.6" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/d8/53/6f443c9a4a8358a93a6792e2acffb9d9d5cb0a5cfd8802644b7b1c9a02e4/colorama-0.4.6.tar.gz", hash = "sha256:08695f5cb7ed6e0531a20572697297273c47b8cae5a63ffc6d6ed5c201be6e44", size = 27697, upload-time = "2022-10-25T02:36:22.414Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/d1/d6/3965ed04c63042e047cb6a3e6ed1a63a35087b6a609aa3a15ed8ac56c221/colorama-0.4.6-py2.py3-none-any.whl", hash = "sha256:4f1d9991f5acc0ca119f9d443620b77f9d6b33703e51011c16baf57afb285fc6", size = 25335, upload-time = "2022-10-25T02:36:20.889Z" }, ] [[package]] name = "coverage" version = "7.15.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/cc/8b/adeb62ea8951f13c4c7fef2e7a85e1a06b499c8d8237ea589d496029e53f/coverage-7.15.0.tar.gz", hash = "sha256:9ac3fe7a1435986463eaa8ee253ae2f2a268709ba4ae5c7dd1f52a05391ad78f", size = 925362, upload-time = "2026-07-02T13:10:50.535Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/ae/23/82e910835ef4b8391047025e1d53aa48d66029f444eb8b25373c849bf503/coverage-7.15.0-cp311-cp311-macosx_10_9_x86_64.whl", hash = "sha256:003fff99412ea848c0aaebcc78ed2b6ce7d8a1227ed17e68470672770b78a02a", size = 220662, upload-time = "2026-07-02T13:08:39.205Z" }, { url = "https://files.pythonhosted.org/packages/6d/0d/c7b213dde2f1579de5231062b386d8413f79c11667eb58c39319b25991da/coverage-7.15.0-cp311-cp311-macosx_11_0_arm64.whl", hash = "sha256:5cbd804bf2784ce7b45114516050f346ecd50f960c4bb630a7ee9e1d78fa2118", size = 221168, upload-time = "2026-07-02T13:08:40.471Z" }, { url = "https://files.pythonhosted.org/packages/33/77/d000aeedfac085088337b3c7becdad328474b1f8a9e4c9368a0c99605d68/coverage-7.15.0-cp311-cp311-manylinux1_i686.manylinux_2_28_i686.manylinux_2_5_i686.whl", hash = "sha256:8773e15c23305b58882a4611fb9b2755977eae0dc2e515366a1b6c98866cc4c2", size = 251587, upload-time = "2026-07-02T13:08:42.033Z" }, { url = "https://files.pythonhosted.org/packages/cc/e0/86787c56b9df17afd370d5e293515dd4d9a107a561d13054873eefad8ecc/coverage-7.15.0-cp311-cp311-manylinux1_x86_64.manylinux_2_28_x86_64.manylinux_2_5_x86_64.whl", hash = "sha256:f50e40081494c1dc4239ebb202014cbcc3306ea96fb6302a34c8cc0967fc5ae8", size = 253497, upload-time = "2026-07-02T13:08:43.387Z" }, { url = "https://files.pythonhosted.org/packages/3f/02/181bc917359299c07dead6270f94e411151c8b60cec905c33499da69afe6/coverage-7.15.0-cp311-cp311-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:daf96f37f5fc3a7b6c6da862eb4aee61c426bd63da236ed4a73ef0e503b4bca5", size = 255607, upload-time = "2026-07-02T13:08:44.897Z" }, { url = "https://files.pythonhosted.org/packages/b9/35/ca5e7427699913da6788c4f910e73ab16c5f4b59ec5d3a999dce2a45112f/coverage-7.15.0-cp311-cp311-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:51aa20f6ae2788fd197747766edf4cd8234fd9423309b934257fa6b21a592723", size = 257563, upload-time = "2026-07-02T13:08:46.334Z" }, { url = "https://files.pythonhosted.org/packages/0b/4d/b8220bacc2fc3c4e9078e27c32e99fb411479a4718a72bdd00036a9891c8/coverage-7.15.0-cp311-cp311-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:03d1f922757662eb7af586e77834792274cff776bc7b1d1a0b66a49ea9d84735", size = 251726, upload-time = "2026-07-02T13:08:47.941Z" }, { url = "https://files.pythonhosted.org/packages/c4/e4/2e145da1991d72189b9c3cf7eca05c716ee7080d099aaea6757cfc7df008/coverage-7.15.0-cp311-cp311-musllinux_1_2_aarch64.whl", hash = "sha256:a6d6acc9a7666245e6133dd15144ca038a85a9cd5026bb06d6bbae9e77440dc9", size = 253301, upload-time = "2026-07-02T13:08:49.5Z" }, { url = "https://files.pythonhosted.org/packages/72/28/d2c841d698bf762e481f08bd4839d370246b6d9b61dab085a7b20b201a08/coverage-7.15.0-cp311-cp311-musllinux_1_2_i686.whl", hash = "sha256:1ac2c4c27c7df851dc9a017c2d7de00b69147e84ba3d96f37a530b0b6fb51035", size = 251361, upload-time = "2026-07-02T13:08:51.304Z" }, { url = "https://files.pythonhosted.org/packages/9d/ed/55d9ffde994fba3897c0c783f77a7d053b0c18787f6892ed5b0aed73f469/coverage-7.15.0-cp311-cp311-musllinux_1_2_ppc64le.whl", hash = "sha256:b761a1d504fd4bd1f20f418753964dca9f5862a511fc854dac58296b3b223671", size = 255129, upload-time = "2026-07-02T13:08:52.661Z" }, { url = "https://files.pythonhosted.org/packages/1d/c0/ecbf33b8c460ea2718aeb813e2df8140d0370e5f67261c31524ceb0a2a8d/coverage-7.15.0-cp311-cp311-musllinux_1_2_riscv64.whl", hash = "sha256:e43b045e11c16e897895758ae90e4a90cf99e93d58549e2f90c0e2272e155695", size = 251081, upload-time = "2026-07-02T13:08:54.188Z" }, { url = "https://files.pythonhosted.org/packages/a9/de/fb87b4261f54448dd2b9504ef19a58be42cef0d9520595fbfe1219b15234/coverage-7.15.0-cp311-cp311-musllinux_1_2_x86_64.whl", hash = "sha256:589b54513e901739f4b4582c705ce96b80c96f57641b1464607e2367a270e540", size = 251988, upload-time = "2026-07-02T13:08:55.726Z" }, { url = "https://files.pythonhosted.org/packages/df/27/3494d5f291b9a4cb868f73c11221a8bd2d5bd761a8f9acea61ff57128dd1/coverage-7.15.0-cp311-cp311-win32.whl", hash = "sha256:106781b8482749162d0b47056937ba0933508e5d9447f65a5e7d5c422f0d6bb4", size = 222754, upload-time = "2026-07-02T13:08:57.091Z" }, { url = "https://files.pythonhosted.org/packages/2a/ee/cd4847ebc9be6a9c0123d763645a6f1f3be6b8c58c962706368b79cbac07/coverage-7.15.0-cp311-cp311-win_amd64.whl", hash = "sha256:821e92b3631d762a339695824cadbbc73020354eba2a23a551a99ad34938fbe6", size = 223225, upload-time = "2026-07-02T13:08:58.594Z" }, { url = "https://files.pythonhosted.org/packages/57/37/5011581aa7f2be498b97dcc7c9902192442a42f4f9a748aeadb3d6506b42/coverage-7.15.0-cp311-cp311-win_arm64.whl", hash = "sha256:309990eb5fb8014b9f67cb211f7fd41876ec8a88a88d3ae76de0ed1d611e3640", size = 222774, upload-time = "2026-07-02T13:09:00.074Z" }, { url = "https://files.pythonhosted.org/packages/2a/74/fd4c0901137c4f8d81a76ada99e43c65163b4c94a02ece107a4ec0c6b615/coverage-7.15.0-cp312-cp312-macosx_10_13_x86_64.whl", hash = "sha256:b75ee5e8cb7575636ac598719b4307ac529ec8fcd79608a35c3cd4d4dada812d", size = 220838, upload-time = "2026-07-02T13:09:02.084Z" }, { url = "https://files.pythonhosted.org/packages/0f/2e/2347583467bd7f0402635101a916961915cc68fce652cd0db5f173ea04fc/coverage-7.15.0-cp312-cp312-macosx_11_0_arm64.whl", hash = "sha256:ffb31267816b93b075302248cc1737506081b4f163df4401e9df1a6424aafabe", size = 221197, upload-time = "2026-07-02T13:09:03.617Z" }, { url = "https://files.pythonhosted.org/packages/f0/17/99fa688541ae1d6e84543a0e544f83de0c944815b63e9e7b1ed411d15036/coverage-7.15.0-cp312-cp312-manylinux1_i686.manylinux_2_28_i686.manylinux_2_5_i686.whl", hash = "sha256:e4d0bb73455bf97ab243a8f12c37c686ccf1c13bb614b7b85f1d062f06f42b2c", size = 252705, upload-time = "2026-07-02T13:09:05.059Z" }, { url = "https://files.pythonhosted.org/packages/fb/02/6a95a5cd83b74839017ef9cf48d2d8c9ae60af919e17a3f336e6f9f1b7bd/coverage-7.15.0-cp312-cp312-manylinux1_x86_64.manylinux_2_28_x86_64.manylinux_2_5_x86_64.whl", hash = "sha256:20d9ccc4ebd0edc434d86dfd2a1dd2a8efa6b6b3073d0485a394fee86459ebb4", size = 255441, upload-time = "2026-07-02T13:09:06.559Z" }, { url = "https://files.pythonhosted.org/packages/67/f2/406f6c57d600f68185942422c4c00f1a3255d60aee6e5fd961425cd9987e/coverage-7.15.0-cp312-cp312-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:20c8a976c365c8cb12f0cbd099508772ea41fb5fa80657a8506df0e11bd278c5", size = 256556, upload-time = "2026-07-02T13:09:08.197Z" }, { url = "https://files.pythonhosted.org/packages/74/8e/d3fa48489c15ecdec1ba48fd61f68798555dddd2f6716f9ad42adeb1a2a9/coverage-7.15.0-cp312-cp312-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:f948fd5ba1b9cbca91f0ae08b4c1ce2b139509149a435e2585d056d57d70bf01", size = 258815, upload-time = "2026-07-02T13:09:09.691Z" }, { url = "https://files.pythonhosted.org/packages/47/2e/2d40ddd110462c6a2769677cf7f1c119a52b45f568978fc6c98e4cc0dd0f/coverage-7.15.0-cp312-cp312-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:f58185f06edf6ad68ec9fb155d63ef650c82f3fbd7e1770e2867751fb13158f4", size = 253117, upload-time = "2026-07-02T13:09:11.212Z" }, { url = "https://files.pythonhosted.org/packages/51/c0/310782f0d7c3cb2b5ac05ba8d205fe91f24a36f6bf3256098f1782181c38/coverage-7.15.0-cp312-cp312-musllinux_1_2_aarch64.whl", hash = "sha256:02adc79a920c73c647c5d117f55747df7f2de94571884758ce8bc58e04f0a796", size = 254475, upload-time = "2026-07-02T13:09:13.029Z" }, { url = "https://files.pythonhosted.org/packages/86/f7/702da6c275f8ae6ade423d2877243122932c9b27f5403003b9ef8c927d12/coverage-7.15.0-cp312-cp312-musllinux_1_2_i686.whl", hash = "sha256:6eb7c300fbed667fd6e3588eba71c1904cdb06110ca6fdf908c26bdd88b8e382", size = 252619, upload-time = "2026-07-02T13:09:14.699Z" }, { url = "https://files.pythonhosted.org/packages/fb/84/c5b15a7e5ecba4e56218d772d99fe80a63e63f8d11f12783723a6005ab45/coverage-7.15.0-cp312-cp312-musllinux_1_2_ppc64le.whl", hash = "sha256:b5fb23fa2de9dce1f5c36c09066d8fcda16cd96e8e26686caa2d7cb9b567d65c", size = 256689, upload-time = "2026-07-02T13:09:16.103Z" }, { url = "https://files.pythonhosted.org/packages/95/2f/c8b07559b57701230c61b23a953858c052890c12ef568d81780c6c46e92e/coverage-7.15.0-cp312-cp312-musllinux_1_2_riscv64.whl", hash = "sha256:cec79341dbe6281484024979976d0c7f22beae08b4a254655decd25d42cbe766", size = 252189, upload-time = "2026-07-02T13:09:17.828Z" }, { url = "https://files.pythonhosted.org/packages/6b/80/6d2f049dd3fd3dbfd60b62ba6b2162a04009e2c002ce70b24cf3878dec7a/coverage-7.15.0-cp312-cp312-musllinux_1_2_x86_64.whl", hash = "sha256:6c664c5444b1d970b1b2a450e21fb19ee5c9cfdf151ded2dda37260031cca0da", size = 254059, upload-time = "2026-07-02T13:09:19.304Z" }, { url = "https://files.pythonhosted.org/packages/ce/92/b0287a2c42031d25c628f815f89a3cd9f8268ee78bb1252c9356cda1c689/coverage-7.15.0-cp312-cp312-win32.whl", hash = "sha256:5f764a3fa339bde6b3aa97657f5a6a3a9451e4a5b4ea98a2892c773a43525f77", size = 222893, upload-time = "2026-07-02T13:09:20.812Z" }, { url = "https://files.pythonhosted.org/packages/a9/69/e34c481915fecb499b3146975061dac528752e37706edc1804f32c822469/coverage-7.15.0-cp312-cp312-win_amd64.whl", hash = "sha256:52f9a4d2c4c56c8848bc2f524916698354b0211488b38c49ad9ae54f6cafbff6", size = 223429, upload-time = "2026-07-02T13:09:22.315Z" }, { url = "https://files.pythonhosted.org/packages/fe/98/6e878f0b571d32684ef3f38d7c03db241ca5b82a5da8a5391596a8f209c4/coverage-7.15.0-cp312-cp312-win_arm64.whl", hash = "sha256:31e5c3e70c85307ea35a12964e2e40f56ca2ee4b1c8c721ccf4609d17071080b", size = 222810, upload-time = "2026-07-02T13:09:23.812Z" }, { url = "https://files.pythonhosted.org/packages/76/04/145a3748098bcc86b631a85408d2c3dc5c104e0bd86d605468239b25b6c4/coverage-7.15.0-cp313-cp313-macosx_10_13_x86_64.whl", hash = "sha256:5be4caf3b28836f078abe700f8944dac4a65d78f16d6c600c89cb624e5535782", size = 220863, upload-time = "2026-07-02T13:09:25.371Z" }, { url = "https://files.pythonhosted.org/packages/a4/5c/4ed55708fed2c64b63c9bc5715daef670872202101938869b7fe5d5fbb8f/coverage-7.15.0-cp313-cp313-macosx_11_0_arm64.whl", hash = "sha256:dd58ad1404704303ca8d4f4b8a1095e7cbc7040ef17a66df1e6619aa10176430", size = 221230, upload-time = "2026-07-02T13:09:26.897Z" }, { url = "https://files.pythonhosted.org/packages/7b/19/3a80b97d3b2a5c77a01ae359c6bed20c13738fe3d9380f08616d4fec0281/coverage-7.15.0-cp313-cp313-manylinux1_i686.manylinux_2_28_i686.manylinux_2_5_i686.whl", hash = "sha256:bbcbb317c2e5ded5b21104af81c29f391be2af98d065693ffbe8d23949b948e5", size = 252227, upload-time = "2026-07-02T13:09:28.543Z" }, { url = "https://files.pythonhosted.org/packages/a1/fa/b70062750686bd7da454da27927622f48bbac6990ac7a4c4a4653e7b0036/coverage-7.15.0-cp313-cp313-manylinux1_x86_64.manylinux_2_28_x86_64.manylinux_2_5_x86_64.whl", hash = "sha256:27f31ecb458da3f859aab3f15ada871eb7a7768807d88df4a9f186bb17737970", size = 254823, upload-time = "2026-07-02T13:09:30.177Z" }, { url = "https://files.pythonhosted.org/packages/a9/09/dad6a75a2e561b9dc5086a8c5257a7591d584246f67e23e70d2995b89ab6/coverage-7.15.0-cp313-cp313-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:13fb759be317fdc62e0f56bffdf61cfcb45c7761ad6b71e3e583e71a67ae753c", size = 256059, upload-time = "2026-07-02T13:09:31.979Z" }, { url = "https://files.pythonhosted.org/packages/e6/e7/b5d2941fa9564573d44b693a871ff3156f0c42cbefe977a09fa7fdc59971/coverage-7.15.0-cp313-cp313-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:d5cf007add5ab4bb8fa9f4c77e3732127c9e6cad501d7db43355fbfafca0be84", size = 258190, upload-time = "2026-07-02T13:09:34.035Z" }, { url = "https://files.pythonhosted.org/packages/7c/1d/8e895bcde3c57ccd46d896dda5f2b3d5df761a1b0c6c9d450d175dedc632/coverage-7.15.0-cp313-cp313-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:cc78d9843bd576fbe2118248258d485e968dc535f95ed504a7b0867ba9b51389", size = 252456, upload-time = "2026-07-02T13:09:35.765Z" }, { url = "https://files.pythonhosted.org/packages/14/4c/f6997da343ddeb959be82c3b05322793f92c071ad45f7cb8a96336e2dd5f/coverage-7.15.0-cp313-cp313-musllinux_1_2_aarch64.whl", hash = "sha256:a263060f1de0b4b74b4e089c2a70b8003b3781c733329a9c8fd54995328f9950", size = 254192, upload-time = "2026-07-02T13:09:37.445Z" }, { url = "https://files.pythonhosted.org/packages/17/27/a0bc09d032267b9da89d95a2d874cfbef2a5aebbf0e87cf7aba221d79a99/coverage-7.15.0-cp313-cp313-musllinux_1_2_i686.whl", hash = "sha256:c48decf16e0dfd5b049c7d5e82200c23c08126719142998d4f172444e3d0529e", size = 252153, upload-time = "2026-07-02T13:09:39.422Z" }, { url = "https://files.pythonhosted.org/packages/54/c0/77fc233d9fba07b244c40948c53fe27308b8f21732fb3417f87fbd6fd992/coverage-7.15.0-cp313-cp313-musllinux_1_2_ppc64le.whl", hash = "sha256:08fb028000ed0aaa0a4cbdfbb98be7cb42f370db973fbbb469733505ab20e13e", size = 256310, upload-time = "2026-07-02T13:09:41.006Z" }, { url = "https://files.pythonhosted.org/packages/d5/24/601cecfb5825becacb8d45219a018a3b55b9dbaec624efdb0ea249d08be2/coverage-7.15.0-cp313-cp313-musllinux_1_2_riscv64.whl", hash = "sha256:fb7dc0c3b7d8a1077abea0b8546ebc5e26d6ef6ecefc2f0f5ad2b8a53bdad837", size = 251974, upload-time = "2026-07-02T13:09:42.733Z" }, { url = "https://files.pythonhosted.org/packages/47/1e/6f45e5a5b3d5484318d368702af6716b5ab8913b0428bec981a562fcf296/coverage-7.15.0-cp313-cp313-musllinux_1_2_x86_64.whl", hash = "sha256:6cb3602054ccbe9f0d8c2dc04bbeba90d5719236e2cd06e042ddd6d3fc7b6e37", size = 253745, upload-time = "2026-07-02T13:09:44.376Z" }, { url = "https://files.pythonhosted.org/packages/8e/db/4df027a77bd11d0e527f44c53557c76e54ad027413d0304252ea3a78d67e/coverage-7.15.0-cp313-cp313-win32.whl", hash = "sha256:0bf781da64326b677be344df505171435b6f58716108606621d5d27d964fff8b", size = 222902, upload-time = "2026-07-02T13:09:46.122Z" }, { url = "https://files.pythonhosted.org/packages/a0/10/0355894d34e231f2c5449e71287e81a50793a325df2e2b027b7bcd9dfd19/coverage-7.15.0-cp313-cp313-win_amd64.whl", hash = "sha256:2c57a275078ee3fa185f83e400f765bc764a549de66d99b47881645cbd4ea629", size = 223444, upload-time = "2026-07-02T13:09:47.687Z" }, { url = "https://files.pythonhosted.org/packages/06/ef/bb725f263befaaff851203ab338e68af15e195d7f7b5f323162532d9b6a8/coverage-7.15.0-cp313-cp313-win_arm64.whl", hash = "sha256:3812c61afc6685c7999b39320779ab8f43b7a3081fdb0def39976e56fbdb9a21", size = 222839, upload-time = "2026-07-02T13:09:49.717Z" }, { url = "https://files.pythonhosted.org/packages/4f/9c/1e3ca54f72a3185ece06c58d871099898c48f0ed6430d17b6ab75f0d180a/coverage-7.15.0-cp314-cp314-macosx_10_15_x86_64.whl", hash = "sha256:41cb79af843222e11da87127ad0ecbfa878abadd0f770a4a99391a27d3887324", size = 220906, upload-time = "2026-07-02T13:09:51.339Z" }, { url = "https://files.pythonhosted.org/packages/09/37/f718613d83b274880382f6b67e78f3802549ae39b0b3e65ae5b5974df56e/coverage-7.15.0-cp314-cp314-macosx_11_0_arm64.whl", hash = "sha256:7d2008989ef8fe54188d3f3bfa2e3099b025af11e90a6a1b9e7dc433d04263d8", size = 221239, upload-time = "2026-07-02T13:09:53.138Z" }, { url = "https://files.pythonhosted.org/packages/a7/ce/22bae91e0b75445f68d365c7643ed0aa4880bbf77450ee74ca65bdae53a7/coverage-7.15.0-cp314-cp314-manylinux1_i686.manylinux_2_28_i686.manylinux_2_5_i686.whl", hash = "sha256:769e8ece11a596315ebf5aa7ec383aeeed016c091d2bf6363ffb996d41529092", size = 252286, upload-time = "2026-07-02T13:09:54.996Z" }, { url = "https://files.pythonhosted.org/packages/dd/1e/bec5e32aa508615d9d7a2790effb25fb4dc28606e995816afe400b25ece3/coverage-7.15.0-cp314-cp314-manylinux1_x86_64.manylinux_2_28_x86_64.manylinux_2_5_x86_64.whl", hash = "sha256:65a6b6164ee5c39e2f3803f314292d6c61a607ba7fee253d1e03c42dc3903502", size = 254789, upload-time = "2026-07-02T13:09:56.678Z" }, { url = "https://files.pythonhosted.org/packages/17/29/0e865435b4354e4a7c03b1b7920046d31d0a273d55decefea27e011cb9bf/coverage-7.15.0-cp314-cp314-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:75128817f95a5c45bb01d65fd2d8b9cb54bbe03d81608fb70e3e14b437ad56c2", size = 256135, upload-time = "2026-07-02T13:09:58.343Z" }, { url = "https://files.pythonhosted.org/packages/84/ff/33a870b58a13325d62fc0a6c8f01fa0ff667cef60c7498e2382a147dfa18/coverage-7.15.0-cp314-cp314-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:9887bb428fe2d4cd4bee89bac1a6c9932f484afd5b36fbd4ff6ea5f825bb1f5e", size = 258449, upload-time = "2026-07-02T13:10:00.057Z" }, { url = "https://files.pythonhosted.org/packages/18/7b/6fffe596bf3ddba8462758d02c5dad730fd91055a6634aa2e4226229181a/coverage-7.15.0-cp314-cp314-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:0bfc0be1f702042207a93a00523b1065ee1fe951e96edf311581c0bbc2e34888", size = 252313, upload-time = "2026-07-02T13:10:01.946Z" }, { url = "https://files.pythonhosted.org/packages/58/1b/11468dd6c1676ab831a70cb9a8d4e198e8607fa0b7220ab918b73fe9bfbd/coverage-7.15.0-cp314-cp314-musllinux_1_2_aarch64.whl", hash = "sha256:f64627d55def5a43282d70e08396672692f77e4da610a5bb8bb4060b432b6859", size = 254142, upload-time = "2026-07-02T13:10:04.065Z" }, { url = "https://files.pythonhosted.org/packages/79/41/29328e21d16b1b95092c30dd700e08cf915bd3734f836df8f3bdb0e8fa9f/coverage-7.15.0-cp314-cp314-musllinux_1_2_i686.whl", hash = "sha256:2c6f0fa473003905c6d5bac328ee4eba9fbea654f15bc24b8a3274b23363fa99", size = 252108, upload-time = "2026-07-02T13:10:06.11Z" }, { url = "https://files.pythonhosted.org/packages/9b/de/05ccfb990439655b35afbfd8e0d13fe66677565a7d4eb38c3f5ef2635e1c/coverage-7.15.0-cp314-cp314-musllinux_1_2_ppc64le.whl", hash = "sha256:2bcf9afaf064172c6ec3c58a325a9957ad1178c05dd934e25f253321776e0676", size = 256385, upload-time = "2026-07-02T13:10:08.141Z" }, { url = "https://files.pythonhosted.org/packages/51/0e/486828a3d2695ea7a2609f17ff572f6b01905e608379440a11da4b8dffbe/coverage-7.15.0-cp314-cp314-musllinux_1_2_riscv64.whl", hash = "sha256:baf06bc987115d6fb938d403f7eab684a057766c490367999a2b71a6883110c6", size = 251923, upload-time = "2026-07-02T13:10:10.179Z" }, { url = "https://files.pythonhosted.org/packages/18/c7/03582b6715f078e5e558354c87616d945b9894cda2dace8e4009b17035e4/coverage-7.15.0-cp314-cp314-musllinux_1_2_x86_64.whl", hash = "sha256:f0405f2ff97b1c4c0e782cb32e02f32369bcf2e6b618b591d67e1ea754575dfe", size = 253580, upload-time = "2026-07-02T13:10:12.052Z" }, { url = "https://files.pythonhosted.org/packages/db/dc/9e578bbaf2ecb4959a81b7e7601ad8cca772cba2892e8d144cb749b4a71a/coverage-7.15.0-cp314-cp314-win32.whl", hash = "sha256:ab282853ed5fbd64bbb162f19cb8fcb7087187508a6374b4f9c34ec1577c4e8f", size = 223107, upload-time = "2026-07-02T13:10:13.994Z" }, { url = "https://files.pythonhosted.org/packages/ae/3e/c8c3b75d8dbe0e35f7b0cc3ff5e949fc59500f70b21d0398813f66740664/coverage-7.15.0-cp314-cp314-win_amd64.whl", hash = "sha256:3bb3040e9f4bbe26fcb0cd7cc85ac63e630d3f3a9c74f027abf4caa27e706663", size = 223597, upload-time = "2026-07-02T13:10:15.906Z" }, { url = "https://files.pythonhosted.org/packages/cd/bc/3cbc9fb036eb388519bccd521f783499c39b64256013fbc362782f196fe1/coverage-7.15.0-cp314-cp314-win_arm64.whl", hash = "sha256:346771144d34f7fa84ec28386f78e0f31653f33cf35e19d253d5b35f9e8201da", size = 223020, upload-time = "2026-07-02T13:10:17.844Z" }, { url = "https://files.pythonhosted.org/packages/28/00/199c4a8d656dff63102577a056c0fce2ff6a79e40adac092fc986c49cbf1/coverage-7.15.0-cp314-cp314t-macosx_10_15_x86_64.whl", hash = "sha256:d34a010905fb6401324ba016b5da03d574967f7b21ce48ea41e66f0f1f95f641", size = 221638, upload-time = "2026-07-02T13:10:19.703Z" }, { url = "https://files.pythonhosted.org/packages/ba/8e/9d0092c96a3d3a26951ecc7020826aa57bcb1b119ca81acbba996884ab13/coverage-7.15.0-cp314-cp314t-macosx_11_0_arm64.whl", hash = "sha256:bb25d825d885ca8036795dacfc3924d33091fc76d71ebc99420c6b79e77d96fa", size = 221903, upload-time = "2026-07-02T13:10:21.514Z" }, { url = "https://files.pythonhosted.org/packages/6d/b4/c0ca3028f42c9a08e51feb4561ef1192e5de99797cd1db5b04590c215bda/coverage-7.15.0-cp314-cp314t-manylinux1_i686.manylinux_2_28_i686.manylinux_2_5_i686.whl", hash = "sha256:94c9686bfe8a9a6810297aecbd99beaa3445f9e8dc2f80b1382cca0d86b64461", size = 263267, upload-time = "2026-07-02T13:10:23.261Z" }, { url = "https://files.pythonhosted.org/packages/5f/aa/a375e3846e5d3c013dc600b2a3231089055c73d77f5393dd2192a8d64da6/coverage-7.15.0-cp314-cp314t-manylinux1_x86_64.manylinux_2_28_x86_64.manylinux_2_5_x86_64.whl", hash = "sha256:9bd671c25f9d85f09d7ec481d0e43d5139f486c06a37139847a7ce569788af72", size = 265390, upload-time = "2026-07-02T13:10:25.152Z" }, { url = "https://files.pythonhosted.org/packages/92/e1/5783cdabb797305e1c9e4809fea496d31834c51fa772514f73dc148bcfc9/coverage-7.15.0-cp314-cp314t-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:110cbdf8d2e216577312cf06ccf85539c0e5a5420ef747e4a4719b5e483c88cd", size = 267811, upload-time = "2026-07-02T13:10:27.249Z" }, { url = "https://files.pythonhosted.org/packages/85/31/96d8bbf58b8e9193bc8389574a91a0db48355ee98feb66aa6bf8d1b32eea/coverage-7.15.0-cp314-cp314t-manylinux2014_ppc64le.manylinux_2_17_ppc64le.manylinux_2_28_ppc64le.whl", hash = "sha256:2c5d4619214f1d9993e7b00a8600d14614b7e9d84e89507460b126aa5e6559e5", size = 268928, upload-time = "2026-07-02T13:10:29.242Z" }, { url = "https://files.pythonhosted.org/packages/5e/7a/5294567e811a1cb7eda93140c628fa050d66189da28da320f93d1d815c73/coverage-7.15.0-cp314-cp314t-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:781a704516e2d8346fbbd5be6c6f3412dd824785146528b3a01816f26c081007", size = 262378, upload-time = "2026-07-02T13:10:31.107Z" }, { url = "https://files.pythonhosted.org/packages/69/3f/3f48538421f899f28946f90a3d272136a4686e1abf461cc9249a783ee0f3/coverage-7.15.0-cp314-cp314t-musllinux_1_2_aarch64.whl", hash = "sha256:bd4a1b44bcb65ee29e947ac92bbee04956df3a6bfc6143641bb6cae7ede00fc9", size = 265263, upload-time = "2026-07-02T13:10:32.942Z" }, { url = "https://files.pythonhosted.org/packages/ce/d3/092df15efcab8a9c1467ee960eb8019bbad3f9300d115d89ea6195f369ff/coverage-7.15.0-cp314-cp314t-musllinux_1_2_i686.whl", hash = "sha256:0e4950c9d6d3e39c64c991814ff315e2d0b9cb8152363594212c9e55208c0a8f", size = 262866, upload-time = "2026-07-02T13:10:35.104Z" }, { url = "https://files.pythonhosted.org/packages/e5/ab/0254d2b88665efb2c57ad368cc77ab5de3435bd8d5add4729c1b0e79431e/coverage-7.15.0-cp314-cp314t-musllinux_1_2_ppc64le.whl", hash = "sha256:fe9c87ff42e5472d80d21704972e1f96e104a0a599d77c5e35db5a3c562e2571", size = 266599, upload-time = "2026-07-02T13:10:37.05Z" }, { url = "https://files.pythonhosted.org/packages/a8/79/1cfa4023e489ce6fbc7be4a5d442dbc375edb4f4fda39a352cedb53263c2/coverage-7.15.0-cp314-cp314t-musllinux_1_2_riscv64.whl", hash = "sha256:f00d5ae1dd2fe13fb8186e3e7d37bcbd8b25c0d764ff7d1b32cef9be058510a8", size = 261714, upload-time = "2026-07-02T13:10:38.966Z" }, { url = "https://files.pythonhosted.org/packages/b7/eb/fee5c8665656be63f497418d410484637c438172568688e8ac92e06574e7/coverage-7.15.0-cp314-cp314t-musllinux_1_2_x86_64.whl", hash = "sha256:363ab38cc78b615f11c9cac3cf1d7eef950c18b9fdedfb9066f59461dcf84d68", size = 264025, upload-time = "2026-07-02T13:10:40.789Z" }, { url = "https://files.pythonhosted.org/packages/ab/99/63005db722f91edc81abc16302f9cc2f6228c1679e46e15be9ae144b14d0/coverage-7.15.0-cp314-cp314t-win32.whl", hash = "sha256:54fd9c53a5fafff509195f1b6a3f9be615d8e8362a3629ff1de23d270c03c86b", size = 223413, upload-time = "2026-07-02T13:10:42.597Z" }, { url = "https://files.pythonhosted.org/packages/c1/e8/2bc6181c4fb06f1a6b981eb85330cc57bfad7e3f710fc9c9d350013ba228/coverage-7.15.0-cp314-cp314t-win_amd64.whl", hash = "sha256:87b47553097ba185ed964866078e7e63adea9f5f51b5f39691c34f30afd21080", size = 224245, upload-time = "2026-07-02T13:10:44.47Z" }, { url = "https://files.pythonhosted.org/packages/79/b8/4d959bf9cc45d0cfed2f4d35cafcab978cdb6ea02eb5100009cd740632a3/coverage-7.15.0-cp314-cp314t-win_arm64.whl", hash = "sha256:aeefb2dd178fe7eee79f0ad25d75855cb35ee9ed472db2c5ea06f5b4fd00cec5", size = 223558, upload-time = "2026-07-02T13:10:46.368Z" }, { url = "https://files.pythonhosted.org/packages/52/30/21b2ad45959cd50e909e02ebac1e30b4ceb7162e91c11d4c570223a458b7/coverage-7.15.0-py3-none-any.whl", hash = "sha256:56da6a4cbe8f7e9e80bd072ca9cefe67d7106a440a7ec06519ec6507ac94ad19", size = 212632, upload-time = "2026-07-02T13:10:48.641Z" }, ] [[package]] name = "distlib" version = "0.4.3" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/c9/02/bd72be9134d25ed783ecbbc38a539ffaefbf90c78418c7fb7229600dbac7/distlib-0.4.3.tar.gz", hash = "sha256:f152097224a0ae24be5a0f6bae1b9359af82133bce63f98a95f86cae1aede9ed", size = 615141, upload-time = "2026-06-12T08:04:52.847Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/02/08/9c41fb51ab5b43eb21674aff13df270e8ba6c4b29c8624e328dc7a9482af/distlib-0.4.3-py2.py3-none-any.whl", hash = "sha256:4b0ce306c966eb73bc3a7b6abad017c556dadd92c44701562cd528ac7fde4d5b", size = 470628, upload-time = "2026-06-12T08:04:50.506Z" }, ] [[package]] name = "docutils" version = "0.22.4" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/ae/b6/03bb70946330e88ffec97aefd3ea75ba575cb2e762061e0e62a213befee8/docutils-0.22.4.tar.gz", hash = "sha256:4db53b1fde9abecbb74d91230d32ab626d94f6badfc575d6db9194a49df29968", size = 2291750, upload-time = "2025-12-18T19:00:26.443Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/02/10/5da547df7a391dcde17f59520a231527b8571e6f46fc8efb02ccb370ab12/docutils-0.22.4-py3-none-any.whl", hash = "sha256:d0013f540772d1420576855455d050a2180186c91c15779301ac2ccb3eeb68de", size = 633196, upload-time = "2025-12-18T19:00:18.077Z" }, ] [[package]] name = "execnet" version = "2.1.2" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/bf/89/780e11f9588d9e7128a3f87788354c7946a9cbb1401ad38a48c4db9a4f07/execnet-2.1.2.tar.gz", hash = "sha256:63d83bfdd9a23e35b9c6a3261412324f964c2ec8dcd8d3c6916ee9373e0befcd", size = 166622, upload-time = "2025-11-12T09:56:37.75Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/ab/84/02fc1827e8cdded4aa65baef11296a9bbe595c474f0d6d758af082d849fd/execnet-2.1.2-py3-none-any.whl", hash = "sha256:67fba928dd5a544b783f6056f449e5e3931a5c378b128bc18501f7ea79e296ec", size = 40708, upload-time = "2025-11-12T09:56:36.333Z" }, ] [[package]] name = "filelock" version = "3.29.6" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/e0/c8/35bdf04fb30755e2ed758f877edf3eb4a243c2463d3a258cc28b18b7a6e2/filelock-3.29.6.tar.gz", hash = "sha256:895c532ef3f4ef04972b9446a8c4e2931a5c399ff3c4be4c9369f2639b80f793", size = 70301, upload-time = "2026-07-06T23:08:08.577Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/bb/49/7467c2946ccd9617f7da38187071bdc45bb9a95df51f4d63d6622432ce4e/filelock-3.29.6-py3-none-any.whl", hash = "sha256:14d5f5597d2e0c4dbd774cfb6d8132da1db44da83732aab679d54f7dcf97ab65", size = 45478, upload-time = "2026-07-06T23:08:07.197Z" }, ] [[package]] name = "furo" version = "2025.12.19" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "accessible-pygments" }, { name = "beautifulsoup4" }, { name = "pygments" }, { name = "sphinx", version = "9.0.4", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version < '3.12'" }, { name = "sphinx", version = "9.1.0", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version >= '3.12'" }, { name = "sphinx-basic-ng" }, ] sdist = { url = "https://files.pythonhosted.org/packages/ec/20/5f5ad4da6a5a27c80f2ed2ee9aee3f9e36c66e56e21c00fde467b2f8f88f/furo-2025.12.19.tar.gz", hash = "sha256:188d1f942037d8b37cd3985b955839fea62baa1730087dc29d157677c857e2a7", size = 1661473, upload-time = "2025-12-19T17:34:40.889Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/f4/b2/50e9b292b5cac13e9e81272c7171301abc753a60460d21505b606e15cf21/furo-2025.12.19-py3-none-any.whl", hash = "sha256:bb0ead5309f9500130665a26bee87693c41ce4dbdff864dbfb6b0dae4673d24f", size = 339262, upload-time = "2025-12-19T17:34:38.905Z" }, ] [[package]] name = "hypothesis" version = "6.165.10" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "sortedcontainers" }, ] sdist = { url = "https://files.pythonhosted.org/packages/5c/e2/0fad246d2b6330e1f78479bfc566b5c22be82aee8a865cde9a08f648487d/hypothesis-6.165.10.tar.gz", hash = "sha256:68b45e09834cd80523cb1eb274463073c7a9af4e4ef7cff34d9615f355572d32", size = 503703, upload-time = "2026-08-16T22:56:15.404Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/05/c1/9a9538e6d185baf5cc7f15bc3b76e08efbb3de4b3c782f234356449c0dd7/hypothesis-6.165.10-cp310-abi3-macosx_10_12_x86_64.whl", hash = "sha256:f839d29d0cc12048cf073d88ca4fdf94d420bc2b8afd69641ff6d496422ccd4f", size = 783243, upload-time = "2026-08-16T22:55:44.058Z" }, { url = "https://files.pythonhosted.org/packages/a1/30/b70d9d79e871a75cbdeccd9067f20ecdb9eb2a1dfa03c630be3ad13b8b30/hypothesis-6.165.10-cp310-abi3-macosx_11_0_arm64.whl", hash = "sha256:e10858f57ed0e74baa04393845f469fe8ad502c16ece4499bef7700c575611bd", size = 778815, upload-time = "2026-08-16T22:55:46.948Z" }, { url = "https://files.pythonhosted.org/packages/db/52/6f0a9b7aab24b0635e2238f3fbddea5b54b17879ac813df42a3cc3384c5c/hypothesis-6.165.10-cp310-abi3-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:76a7be86d986223b9f1bdb7e7cbcdb048649901fdb956c598ef73bdab1786cd5", size = 1108009, upload-time = "2026-08-16T22:54:53.082Z" }, { url = "https://files.pythonhosted.org/packages/f6/06/8d0d4e11ff02350d09ec9f9e90af354158e59e16a8907ba5199a4ff2d7e8/hypothesis-6.165.10-cp310-abi3-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:717aea574e0e5edba2868aa66b1caae335d8f1ad3fb29f01dd6502953fa823a1", size = 1136596, upload-time = "2026-08-16T22:54:54.443Z" }, { url = "https://files.pythonhosted.org/packages/59/dd/01a1e440f2e38dc1ccf5d597af5b8a0bee5f21b674c99c123b5554de9690/hypothesis-6.165.10-cp310-abi3-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:4334058033e0214475f019e15492a50f3854fe8728cf51fe25c6191a2c3f8e52", size = 1135234, upload-time = "2026-08-16T22:55:08.911Z" }, { url = "https://files.pythonhosted.org/packages/7d/18/8a26c24d3d9db20265f39df341ab265858c094e209571e3179cf237935f4/hypothesis-6.165.10-cp310-abi3-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:2abb50cf1cf77d721de0a24c3f99d9c4ffdeb2cbd1e12aebb5a7a93e2b6b6d1f", size = 1157528, upload-time = "2026-08-16T22:56:02.159Z" }, { url = "https://files.pythonhosted.org/packages/ea/8e/ce3c829b1937402d7944420ca26a05a0c8563e894dcff03d34ffa279d306/hypothesis-6.165.10-cp310-abi3-manylinux_2_31_riscv64.whl", hash = "sha256:3de69aa8b924b400291a3cc42aaf78e6ab65c905a3e7e1a5dc39d95ef1b428cb", size = 1112870, upload-time = "2026-08-16T22:54:55.919Z" }, { url = "https://files.pythonhosted.org/packages/f2/1b/4c4926d6c9a2b5d7cc090cc1e91219d6796102aa2a2c4b8f961c939e60b5/hypothesis-6.165.10-cp310-abi3-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:5841331c504e02d7c334591681cb8587cdd59dee7e149db6d3db8e3f9e9f02eb", size = 1149683, upload-time = "2026-08-16T22:55:30.567Z" }, { url = "https://files.pythonhosted.org/packages/cb/f9/df24eb28412f82465e2b7707f0ff1ec274d580bce389d4d9156617dc7bba/hypothesis-6.165.10-cp310-abi3-musllinux_1_2_aarch64.whl", hash = "sha256:2d0e0f8263d34dd8fa3b39eaa9a50bba56a8470b3dd9ebf6672d10840abe063e", size = 1283402, upload-time = "2026-08-16T22:54:18.054Z" }, { url = "https://files.pythonhosted.org/packages/4d/07/c2b2a761300cf60b90ccebba4328175331e67d34f4fbd39429a7ddcdce49/hypothesis-6.165.10-cp310-abi3-musllinux_1_2_armv7l.whl", hash = "sha256:0c4e6869817c3cfdf5a2b4d348497b95159bdecb3365be732c9b8570e36a4eef", size = 1409948, upload-time = "2026-08-16T22:54:22.343Z" }, { url = "https://files.pythonhosted.org/packages/f4/ec/1c2bf1acdd0e273d81f833f85caf0ae5423db68a783554992fca36e6c541/hypothesis-6.165.10-cp310-abi3-musllinux_1_2_ppc64le.whl", hash = "sha256:9f07ae36c3b093e13687a894e79fe69e98a94c0b67fef656c575247682218143", size = 1265023, upload-time = "2026-08-16T22:54:41.402Z" }, { url = "https://files.pythonhosted.org/packages/3d/a8/7f984908b7391160c7801b84e51ca8e4ba88c89e8d8811aa1aa7c03de73c/hypothesis-6.165.10-cp310-abi3-musllinux_1_2_riscv64.whl", hash = "sha256:aff1f584c9538e8979cd180b1d70bf99bc16be19d4666414f49e5942b21a4f2c", size = 1282698, upload-time = "2026-08-16T22:56:06.998Z" }, { url = "https://files.pythonhosted.org/packages/48/78/3a5d91c2d0250521736c42dfa2402b75049bc5fe2fb716c10bc84bb91ed1/hypothesis-6.165.10-cp310-abi3-musllinux_1_2_x86_64.whl", hash = "sha256:1f2c4db25fb8ec1a16a8dba580666337b8ffb1887c4cf1750cc954313897cef7", size = 1324816, upload-time = "2026-08-16T22:54:46.675Z" }, { url = "https://files.pythonhosted.org/packages/6f/99/27450763853a034bca1574d3e0a315164b33ff49c3862df6872dda45e25e/hypothesis-6.165.10-cp310-abi3-win32.whl", hash = "sha256:b33dc30170a7402e03c180f2c5ef69dc077152f35b91621e9cebcde9c7d71746", size = 669039, upload-time = "2026-08-16T22:55:11.962Z" }, { url = "https://files.pythonhosted.org/packages/2c/fc/ff2988b72b5705ad9ca500444bf3f43e3c2f41edfa034bbfeb23b215791a/hypothesis-6.165.10-cp310-abi3-win_amd64.whl", hash = "sha256:e9f924aa610c0618445e1e8738c822c3190ce2a2699a0cb48ec3a351a96761f2", size = 675213, upload-time = "2026-08-16T22:55:01.697Z" }, { url = "https://files.pythonhosted.org/packages/c5/8b/821810d36f78d9d9421cd2c5d9d36983b45bb3575c3086276cc5c76f9f73/hypothesis-6.165.10-cp310-abi3-win_arm64.whl", hash = "sha256:1d305448e9bd8e2f4f3cea0eafd809efdaab4e998a0019bc615650c8463e42f1", size = 673537, upload-time = "2026-08-16T22:54:47.898Z" }, { url = "https://files.pythonhosted.org/packages/ed/c2/b9546ace11f241c9c02d389f258cb80c14447a8c885771c9f1f0bc1d85ca/hypothesis-6.165.10-cp311-cp311-macosx_10_12_x86_64.whl", hash = "sha256:592107a0faf6c9c3a63a8dbf13dfb1cbda1cf599b0bc11c953221b00204b9ce1", size = 783716, upload-time = "2026-08-16T22:55:36.624Z" }, { url = "https://files.pythonhosted.org/packages/37/10/27c2fdd574fd798caf5e91eb51f7834b098f5d840ce733efb3fba79ef86e/hypothesis-6.165.10-cp311-cp311-macosx_11_0_arm64.whl", hash = "sha256:f9180c362bde06fd05380298ded4e234fbc0d6ede0a864835bfd91c1e24283d5", size = 779507, upload-time = "2026-08-16T22:55:07.633Z" }, { url = "https://files.pythonhosted.org/packages/5e/b6/70bc23695f3783c4b0486b6cad47b08a20f791db4a3c1b25250add9659fa/hypothesis-6.165.10-cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:d623801ae3dcd97b77b983400ef3d48bf976648e4efff19929175322eaae074d", size = 1108406, upload-time = "2026-08-16T22:55:39.653Z" }, { url = "https://files.pythonhosted.org/packages/71/4c/32e200bd7a352af4b7f4e3729aaa4cd002cb5fe8c4c6aef5599d0019f152/hypothesis-6.165.10-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:20f6236cfb90b7817bb1a6a087589ca4aa46d73170f0dd62963952ed5dadc589", size = 1157850, upload-time = "2026-08-16T22:55:24.394Z" }, { url = "https://files.pythonhosted.org/packages/03/a5/8efc2a9a484822efc0d0da466f50094e0f2c068187faaf33831fc905873e/hypothesis-6.165.10-cp311-cp311-musllinux_1_2_aarch64.whl", hash = "sha256:ad0764730e8e3421601c2cc7e1f054a9206c60ea0917165d8d9193dc453f34f1", size = 1283704, upload-time = "2026-08-16T22:54:27.279Z" }, { url = "https://files.pythonhosted.org/packages/46/2a/90cc8d7463929c04786f29600de45f3227c12fa9bed1d5b7ce319b05e1c9/hypothesis-6.165.10-cp311-cp311-musllinux_1_2_x86_64.whl", hash = "sha256:10d9a650a4666b0914831f769703d36140ed8039fd19bf9b71f615b8541eccf2", size = 1325077, upload-time = "2026-08-16T22:55:16.561Z" }, { url = "https://files.pythonhosted.org/packages/82/ac/bc16faba4b42883e3d290bfaceff51e258b63fbbdf789bf9fe88df1ce537/hypothesis-6.165.10-cp311-cp311-win_amd64.whl", hash = "sha256:5671d2b2bf83bd4b6f02e55b32d432506eff5358c82f39b460a849ce19a2666e", size = 674920, upload-time = "2026-08-16T22:55:42.613Z" }, { url = "https://files.pythonhosted.org/packages/e9/45/cde4f78afe2b9e29caecf38319eedc1deb76aebcacbdd128e03cbb2511c3/hypothesis-6.165.10-cp312-cp312-macosx_10_12_x86_64.whl", hash = "sha256:637445c1593a2a9d1024fda50082f07bb56baedda78d90a25f64b8111727ef94", size = 784835, upload-time = "2026-08-16T22:54:45.429Z" }, { url = "https://files.pythonhosted.org/packages/7f/81/847f30b81cbfd07607296b3ce43067cf4f80799bd9244167f587de9c8081/hypothesis-6.165.10-cp312-cp312-macosx_11_0_arm64.whl", hash = "sha256:713f4ce4e82c26b53031f139de959bc9e8b54d3995aa824b89bbdf8229df2a45", size = 776419, upload-time = "2026-08-16T22:55:33.633Z" }, { url = "https://files.pythonhosted.org/packages/04/66/4c71c5be7a49d84b8c3a9278c1807c4c81181ab5474beb27df9d4c40dc0e/hypothesis-6.165.10-cp312-cp312-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:f9ff356e97e3ab09db07c8b675efa67340103874a0bae7465acb83dad7a35f7f", size = 1106830, upload-time = "2026-08-16T22:55:10.389Z" }, { url = "https://files.pythonhosted.org/packages/e3/c4/e2cbd2810e79f7a452a8ea9f6c6438ee718ce938d8cc12252cf0b36a81d3/hypothesis-6.165.10-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:1a380bc99aa3b035e6a95a2201bf792d4082a04ca75babcc21849c2d0914bb28", size = 1156952, upload-time = "2026-08-16T22:55:53.35Z" }, { url = "https://files.pythonhosted.org/packages/a8/8b/794ced36864825492ac3712d5acab5a257b4601e6a9dc2ccdd3937198f87/hypothesis-6.165.10-cp312-cp312-musllinux_1_2_aarch64.whl", hash = "sha256:e9acb2c4d9cb532c3fedea74159f7b923c8c036328c9239b4049e7aa073bdd81", size = 1280780, upload-time = "2026-08-16T22:54:34.983Z" }, { url = "https://files.pythonhosted.org/packages/5d/2d/550525442cdbcc2daf1f9bdd8ba35bcbde63db7c7a22f2ef137fbb49df2f/hypothesis-6.165.10-cp312-cp312-musllinux_1_2_x86_64.whl", hash = "sha256:8660572b2d424bf5369ea8990985225f70bd1615b76ecd9c25588a3b9307009f", size = 1324130, upload-time = "2026-08-16T22:55:48.659Z" }, { url = "https://files.pythonhosted.org/packages/74/59/6caf69dd5fe03499ada94c9cec016bffcc164511c6b93fe680f01209b9ff/hypothesis-6.165.10-cp312-cp312-win_amd64.whl", hash = "sha256:3376f2594763aef14faa519b0fb27cae7ce9eeaab4c69efa07777499110306c9", size = 672337, upload-time = "2026-08-16T22:54:49.11Z" }, { url = "https://files.pythonhosted.org/packages/b1/fb/c82c5bd92864ffcf319772fedc8c9bf2dbe4ca14baa0fee6e49e67b5ba1c/hypothesis-6.165.10-cp313-cp313-macosx_10_12_x86_64.whl", hash = "sha256:9d77c3be7b429875036ad0f0597c6e5cc6bb17894a4da005e3807de64d2673ad", size = 784726, upload-time = "2026-08-16T22:54:32.371Z" }, { url = "https://files.pythonhosted.org/packages/0e/b9/3d7acd08506da85557e65147b7f3fca8c47684e33be90bee0acb523920db/hypothesis-6.165.10-cp313-cp313-macosx_11_0_arm64.whl", hash = "sha256:490c56b830772b0eca3b4b2cecb3741a1ed26b1d7206a279e1525dbf0aa95ee4", size = 776375, upload-time = "2026-08-16T22:55:13.303Z" }, { url = "https://files.pythonhosted.org/packages/38/6b/922e8b3f9a706dd89d440b9545d2c6231c65e74da1c1fee3ff36c251b9c4/hypothesis-6.165.10-cp313-cp313-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:ed68e27b8a61e57a3ccdc7c5a14499e00b54dfe223087204d5d40b3b5ef58b6d", size = 1106763, upload-time = "2026-08-16T22:55:06.129Z" }, { url = "https://files.pythonhosted.org/packages/01/39/f5b9a5d390d4edd1ad472334493ac442963ebeb4daaa74ff4bdac6ef292f/hypothesis-6.165.10-cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:6caadcd1afb62630ff5c5ff353626eaa616553a5971295ad6dc2b19ca8a39620", size = 1156778, upload-time = "2026-08-16T22:54:33.824Z" }, { url = "https://files.pythonhosted.org/packages/b5/5f/5fbe1be4326337fd6acefe2d18ed44007ee1dc1f98fe5b3c0eb22942364d/hypothesis-6.165.10-cp313-cp313-musllinux_1_2_aarch64.whl", hash = "sha256:d9145fe43ebb22e66672967c3fab411793b226ed776e4fe282271bca6ad3c0bb", size = 1280756, upload-time = "2026-08-16T22:55:54.834Z" }, { url = "https://files.pythonhosted.org/packages/25/c0/cf6f9e1ef632a1a75694eed0db3a02e6fc75c367a363e94acee52f043c64/hypothesis-6.165.10-cp313-cp313-musllinux_1_2_x86_64.whl", hash = "sha256:79900a9920a0b1d3a626c03a90ac6bf7042e78d46906a565b86a0dbe926f1d96", size = 1323889, upload-time = "2026-08-16T22:55:56.567Z" }, { url = "https://files.pythonhosted.org/packages/cc/cc/662b94880f260b0a88de1fdcf60fc9984f6e2a796da549542adc10a7bc83/hypothesis-6.165.10-cp313-cp313-win_amd64.whl", hash = "sha256:c01dd04044c472e47193b54f68e84e08d6ebf4f29551885aa959b015f7cd9747", size = 672346, upload-time = "2026-08-16T22:56:03.792Z" }, { url = "https://files.pythonhosted.org/packages/3f/77/55e020c9c576532ff7d20bf8b1dfa052ecbd5ada1949b02f76c44c966f7e/hypothesis-6.165.10-cp314-cp314-macosx_10_12_x86_64.whl", hash = "sha256:9ccac776b2ca93b324806facd526ccb45da0fd035001c899a35b02c44431e209", size = 784833, upload-time = "2026-08-16T22:55:21.255Z" }, { url = "https://files.pythonhosted.org/packages/4f/f2/01da2adf829cf549eaddcabb8e8072077fb3d26da4275f4c1e89b2c0af74/hypothesis-6.165.10-cp314-cp314-macosx_11_0_arm64.whl", hash = "sha256:e5f95f7b622e4171096d92175dda0a560f0955ade9b8a3a07bdcf151f7359611", size = 776545, upload-time = "2026-08-16T22:56:10.159Z" }, { url = "https://files.pythonhosted.org/packages/cf/8e/58d4f842895220b793c53fc94a6489705b3665bb4d0ae4d338ce03fdf9fb/hypothesis-6.165.10-cp314-cp314-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:f76d1562643693b8a40066f1f96af795b93fd9bcfc9690a1af2ff4c5867ee29e", size = 1107271, upload-time = "2026-08-16T22:54:50.266Z" }, { url = "https://files.pythonhosted.org/packages/8f/b8/206468912d2153306bb8a41afdfc59e45b7a73a0495bbe4b9cb4f0e79c1d/hypothesis-6.165.10-cp314-cp314-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:60cab3ab4ea468d31a33739ffd7e94ec3e37dea891d65a6582ecc8a477175191", size = 1156915, upload-time = "2026-08-16T22:54:25.89Z" }, { url = "https://files.pythonhosted.org/packages/fb/d3/bf5a22929b70a4cfd3edf69c5642b029b27ddb5cfda48fa295d384b01abb/hypothesis-6.165.10-cp314-cp314-musllinux_1_2_aarch64.whl", hash = "sha256:22cf19388f0ff6ced8eb3e49c903d14938e4ed909d93bf28383eef451511e424", size = 1281205, upload-time = "2026-08-16T22:54:44.083Z" }, { url = "https://files.pythonhosted.org/packages/07/a2/d7b2ba444d36fc84d4779f4431e74dd9b023dc63bcf282199f6e48ad39f4/hypothesis-6.165.10-cp314-cp314-musllinux_1_2_x86_64.whl", hash = "sha256:057d0232f1224dcd0b7698902551a4341a7399f90670b036db6c4376715fe889", size = 1324243, upload-time = "2026-08-16T22:55:41.123Z" }, { url = "https://files.pythonhosted.org/packages/d1/95/afe6b531fd01928c6f63d394ee413fa2338d088b2b44efcc23596b54477e/hypothesis-6.165.10-cp314-cp314-pyemscripten_2026_0_wasm32.whl", hash = "sha256:ab0f2e9d7d7d4db257f7cf53de3706c2baf124269571f20ffc2bcd6781f03063", size = 616382, upload-time = "2026-08-16T22:55:18.449Z" }, { url = "https://files.pythonhosted.org/packages/48/86/9b4fb75f520a028edec50ffc904a94d724180395d71feb6d7a0ce7bb6f00/hypothesis-6.165.10-cp314-cp314-win_amd64.whl", hash = "sha256:d1ea02fa8ab3d33eb1125eade81f7136341eb429152c6dbe2ae6f8bc33b3fbdd", size = 672145, upload-time = "2026-08-16T22:54:24.831Z" }, { url = "https://files.pythonhosted.org/packages/f9/ba/f7bbaae0c789bab7ddb764d2056ee1a463cc95a8acbccc90d4184e48b242/hypothesis-6.165.10-cp314-cp314t-macosx_10_12_x86_64.whl", hash = "sha256:ed1a5891e59472884a03cb9875483e8fc131c80a275c60967f8afc5458a0c8ff", size = 783287, upload-time = "2026-08-16T22:54:23.751Z" }, { url = "https://files.pythonhosted.org/packages/3a/83/01ef80772b4abd335c49405576dc503cede94fb5da30ba2643a119013aea/hypothesis-6.165.10-cp314-cp314t-macosx_11_0_arm64.whl", hash = "sha256:09772e328a26e50486ac572be34f9887f9aa185efe7ebb16bde4e8f6038db1f4", size = 774991, upload-time = "2026-08-16T22:55:25.987Z" }, { url = "https://files.pythonhosted.org/packages/a3/0b/f47506241f9d5a5a2efe4c65b6bf4830e9d9576e5d3779007a260699e608/hypothesis-6.165.10-cp314-cp314t-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:5cf3b612542ba174c9da4000b59a4f4c81e8d66f87509be85d3a1b71b5c36413", size = 1105499, upload-time = "2026-08-16T22:54:51.864Z" }, { url = "https://files.pythonhosted.org/packages/84/fe/abb3909b7089835112fbe75bf00d817d733b3a8032759783db0a24ff1e56/hypothesis-6.165.10-cp314-cp314t-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:f69ec5be85ef508e206153bed8eafd03f7995dc464356c8bbb279a1e2b7d56f3", size = 1155685, upload-time = "2026-08-16T22:54:30.94Z" }, { url = "https://files.pythonhosted.org/packages/73/2f/1964738921640184067121ae77414522fc3f0463fc26c6e25a4f3b8e42ca/hypothesis-6.165.10-cp314-cp314t-musllinux_1_2_aarch64.whl", hash = "sha256:dd207497bb985918409a1bb5db85d1875f74e1269487332113b73d1ee7c77647", size = 1279177, upload-time = "2026-08-16T22:54:40.179Z" }, { url = "https://files.pythonhosted.org/packages/34/c5/312af8ae038d3af9cf3f7f1021c1abfe31c0d9035e4cf63519e0a7dc983e/hypothesis-6.165.10-cp314-cp314t-musllinux_1_2_x86_64.whl", hash = "sha256:00de0abdcf8c05c9d0eab735a3c49a276376b55151e6fcb903c2b39a90e5e5c3", size = 1322921, upload-time = "2026-08-16T22:54:42.7Z" }, { url = "https://files.pythonhosted.org/packages/9e/e7/b0a2fde7570c090a1b914026266a421c751ef10138fffe37fe0ef9e675c0/hypothesis-6.165.10-cp314-cp314t-win_amd64.whl", hash = "sha256:cc2da5aa4edf14743fa9257e5ba3513963999f01211635702479d8e92b8207c8", size = 672147, upload-time = "2026-08-16T22:55:27.527Z" }, { url = "https://files.pythonhosted.org/packages/47/fd/985aa564d6ffd06483d45a62b40d319df0a703cd8bc1d041de17d102fbaa/hypothesis-6.165.10-cp315-abi3.abi3t-macosx_10_12_x86_64.whl", hash = "sha256:eeab73050ea58c13dd56e329f594c1dfe32ebd7bb169bbdf4f8ceefbc31ec6b5", size = 782882, upload-time = "2026-08-16T22:55:37.93Z" }, { url = "https://files.pythonhosted.org/packages/f8/2c/6cc11151e450f72353a490940cd0db704680d07b78dc75dcc9f480e0d0e1/hypothesis-6.165.10-cp315-abi3.abi3t-macosx_11_0_arm64.whl", hash = "sha256:4c68e983d0007d014bb01ad4bcbba78bc432c73a1755ff36d5102ceefa18299a", size = 774584, upload-time = "2026-08-16T22:55:51.822Z" }, { url = "https://files.pythonhosted.org/packages/10/39/ef26fa79c1738dfe9cdb1a3584fb6717d26429ca6c9d011cc4fdf08130c2/hypothesis-6.165.10-cp315-abi3.abi3t-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:7730d8197086f65d8969a991d6728a1d420a51b19fea06535c896cb43a1e05d0", size = 1104876, upload-time = "2026-08-16T22:54:58.937Z" }, { url = "https://files.pythonhosted.org/packages/4e/f4/3fcc84e7637f42bf00d987093b9418083ac8db81b87392608a60f4b7c5fd/hypothesis-6.165.10-cp315-abi3.abi3t-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:7a7980a898a3e6ebe4de1896a0507e3d519edb53fb9b4bda478c9fbeb6514558", size = 1133353, upload-time = "2026-08-16T22:54:28.635Z" }, { url = "https://files.pythonhosted.org/packages/35/59/21c5c14179c38f8d0de3560e7f1825c083311b3013b63f817d7dc78dfcbd/hypothesis-6.165.10-cp315-abi3.abi3t-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:b5820d009aedb7ae9cfd32f98b1ab0c0bbd6268379c4fab042218b6b655c63f8", size = 1132300, upload-time = "2026-08-16T22:56:08.539Z" }, { url = "https://files.pythonhosted.org/packages/14/af/fbb56059961e416b2de7b9dc5352db2e8572bd5ea46892957e4c1e5548ab/hypothesis-6.165.10-cp315-abi3.abi3t-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:37a7ac3d34220800e1107871cc391bca1b00439875925d7d821878b8b791f245", size = 1155175, upload-time = "2026-08-16T22:55:19.824Z" }, { url = "https://files.pythonhosted.org/packages/0f/53/77fb0c2dad445858555429c4e06cf94a59ae8d2407dd6426b5af97c84828/hypothesis-6.165.10-cp315-abi3.abi3t-manylinux_2_31_riscv64.whl", hash = "sha256:dafa7c9dbe3d802f9bcdf261b29c8a70700fb22839947f06e471f62c46b6257f", size = 1109881, upload-time = "2026-08-16T22:55:32.029Z" }, { url = "https://files.pythonhosted.org/packages/a8/7b/d187f673ff30e6ada640953636f978ffe64a6332f756b64163c2277f8d0c/hypothesis-6.165.10-cp315-abi3.abi3t-manylinux_2_5_i686.manylinux1_i686.whl", hash = "sha256:90915635b9648071129b0f72c0673cf8eac9eb84cfd445c5bedef30c714b1ec2", size = 1144963, upload-time = "2026-08-16T22:56:13.428Z" }, { url = "https://files.pythonhosted.org/packages/e0/60/31d504e364134d60af23e5f6365db0da3cf4a51b3ed3d4836e5a2cff12cf/hypothesis-6.165.10-cp315-abi3.abi3t-musllinux_1_2_aarch64.whl", hash = "sha256:e1bbeb7c506b07ee0422cf9b2f7212fefa4240957f03526d38d27bc6743a0a48", size = 1278684, upload-time = "2026-08-16T22:55:22.971Z" }, { url = "https://files.pythonhosted.org/packages/ef/e6/89d26834a08c02f8da149e541dd40d7a96f68d9722f43146e69a77436ed7/hypothesis-6.165.10-cp315-abi3.abi3t-musllinux_1_2_armv7l.whl", hash = "sha256:2b36aaffc88625a44f91074c5bbedfdefb9b376c38d1b3c342edcd2e4c8ed16c", size = 1407202, upload-time = "2026-08-16T22:55:14.949Z" }, { url = "https://files.pythonhosted.org/packages/dc/61/20d1e72246867ea195440092e8bb422c7ddc2f271b87b5b65679d5532719/hypothesis-6.165.10-cp315-abi3.abi3t-musllinux_1_2_ppc64le.whl", hash = "sha256:18a3ea838ddea183388f8788750afa8494d79abb5358823be9782585f34445d3", size = 1261395, upload-time = "2026-08-16T22:56:05.448Z" }, { url = "https://files.pythonhosted.org/packages/2a/9b/ebab6c3c2b90a16abb4119198178652d12aff83cc8ec2cfde5276c69fb1e/hypothesis-6.165.10-cp315-abi3.abi3t-musllinux_1_2_riscv64.whl", hash = "sha256:2a2567b3a03a4a5a7c575c191cfcce321a967df3727803817e75bffbbeaecabe", size = 1279213, upload-time = "2026-08-16T22:55:35.066Z" }, { url = "https://files.pythonhosted.org/packages/23/78/69b219b524231d36eb20c792e1f01e7cb037e02bd0af1c29f77ed9a969c0/hypothesis-6.165.10-cp315-abi3.abi3t-musllinux_1_2_x86_64.whl", hash = "sha256:8001925fa3dde51cb574e4c9de4c7efe77c4e4d64bd2fd2ef61d5651f9d04f3d", size = 1322367, upload-time = "2026-08-16T22:54:21.279Z" }, { url = "https://files.pythonhosted.org/packages/55/63/ad5cc153dcc72ae5e7905fb9b3585f3e48ce892a2d6366f90163e867a69d/hypothesis-6.165.10-cp315-abi3.abi3t-win32.whl", hash = "sha256:c6559380469295c4009215fe1cab561301591a3bee2e2fb3f4f96d2273a3affc", size = 666038, upload-time = "2026-08-16T22:56:11.797Z" }, { url = "https://files.pythonhosted.org/packages/80/32/b62307b73fbc99f0a4381d6f9456df76fbcbb7a27ef7256e26f0376f48ea/hypothesis-6.165.10-cp315-abi3.abi3t-win_amd64.whl", hash = "sha256:30797f20ca45e57f526d2df872f63ba453cb4e1091ad542184a7a951af8da79d", size = 671941, upload-time = "2026-08-16T22:55:00.235Z" }, { url = "https://files.pythonhosted.org/packages/c2/dd/e0f98add0548ef73ea7afac45da1fb8efc854d7f9931db568754d0f963f3/hypothesis-6.165.10-cp315-abi3.abi3t-win_arm64.whl", hash = "sha256:c53e9b1c36350df9965ec44d6c0d4e0bbbb38f720dd2b0e1256dc6524d411015", size = 669931, upload-time = "2026-08-16T22:55:50.205Z" }, { url = "https://files.pythonhosted.org/packages/0b/6a/880d6eeed5c451fb40a66733dadec4a5d498628a4a7f6a8a5f633f4c6dcb/hypothesis-6.165.10-pp311-pypy311_pp73-macosx_10_12_x86_64.whl", hash = "sha256:34ee6402df6f31274d89119f1561b5f7489c97866afc5b7a3ed3a13d7e762802", size = 784644, upload-time = "2026-08-16T22:54:20.127Z" }, { url = "https://files.pythonhosted.org/packages/27/e0/9e942bd3c3cf5ea0d5c0fd0905893bbfb6cefb7284c70fcc8033f8fdec38/hypothesis-6.165.10-pp311-pypy311_pp73-macosx_11_0_arm64.whl", hash = "sha256:277f41801e88dad2eba082f91a75632b7584ff64044ba2cf9dadf511b0d19cd0", size = 780515, upload-time = "2026-08-16T22:55:04.676Z" }, { url = "https://files.pythonhosted.org/packages/19/32/f11a618415dc5fa9cdde41fea56c489f0814759527ae1ecd11a75a4558b9/hypothesis-6.165.10-pp311-pypy311_pp73-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:72df95fb1db41755b155c5f02106e0036a339250555c8d351d488704fd112cf9", size = 1109374, upload-time = "2026-08-16T22:56:00.241Z" }, { url = "https://files.pythonhosted.org/packages/5e/6f/db49b719842297c2b71e0d81e5b8967d31215fb7389421abcb465ce7ed3f/hypothesis-6.165.10-pp311-pypy311_pp73-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:6e20a02775eb3cf0ffb4f0219b6d7c1f240336663d4e5d7028675ec247c790c4", size = 1159092, upload-time = "2026-08-16T22:55:58.57Z" }, { url = "https://files.pythonhosted.org/packages/b2/2a/bf0bae84ba1cb3923d295973f1fe38ee867eaf90119e0d559116083be300/hypothesis-6.165.10-pp311-pypy311_pp73-win_amd64.whl", hash = "sha256:1ec53f08732e3cfd0342cbbd75dbd1b193c8f19390660466e536a748bb81f757", size = 676045, upload-time = "2026-08-16T22:55:45.514Z" }, ] [[package]] name = "icdiff" version = "2.0.10" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/5b/6d/41c8ff13b67c30ceb9325398ff6bb9fc4b77208c6c1d79db8d5913840bc6/icdiff-2.0.10.tar.gz", hash = "sha256:75a3de5c9af35ab45fb0504df59770c514a12c0d2b2c99e5f9c5c2429957e133", size = 16378, upload-time = "2026-02-08T15:03:26.76Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/85/4b/bb94514476624bfff977599e5ef3ac9aea603abb693639ed305b22ed1b35/icdiff-2.0.10-py3-none-any.whl", hash = "sha256:fd8ce592d94261c435e2a410f668a41ec3be4527878f8df01100797021d8edb0", size = 17103, upload-time = "2026-02-08T15:03:25.723Z" }, ] [[package]] name = "idna" version = "3.18" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/cd/63/9496c57188a2ee585e0f1db071d75089a11e98aa86eb99d9d7618fc1edce/idna-3.18.tar.gz", hash = "sha256:ffb385a7e039654cef1ab9ef32c6fafe283c0c0467bba1d9029738ce4a14a848", size = 196711, upload-time = "2026-06-02T14:34:07.794Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/1e/5e/d4e9f1a599fb8e573b7b87160658329fbf28d19eac2718f51fc3def3aa5a/idna-3.18-py3-none-any.whl", hash = "sha256:7f952cbe720b688055e3f87de14f5c3e5fdaa8bc3928985c4077ca689de849a2", size = 65455, upload-time = "2026-06-02T14:34:06.319Z" }, ] [[package]] name = "imagesize" version = "2.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/6c/e6/7bf14eeb8f8b7251141944835abd42eb20a658d89084b7e1f3e5fe394090/imagesize-2.0.0.tar.gz", hash = "sha256:8e8358c4a05c304f1fccf7ff96f036e7243a189e9e42e90851993c558cfe9ee3", size = 1773045, upload-time = "2026-03-03T14:18:29.941Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/5f/53/fb7122b71361a0d121b669dcf3d31244ef75badbbb724af388948de543e2/imagesize-2.0.0-py2.py3-none-any.whl", hash = "sha256:5667c5bbb57ab3f1fa4bc366f4fbc971db3d5ed011fd2715fd8001f782718d96", size = 9441, upload-time = "2026-03-03T14:18:27.892Z" }, ] [[package]] name = "iniconfig" version = "2.3.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/72/34/14ca021ce8e5dfedc35312d08ba8bf51fdd999c576889fc2c24cb97f4f10/iniconfig-2.3.0.tar.gz", hash = "sha256:c76315c77db068650d49c5b56314774a7804df16fee4402c1f19d6d15d8c4730", size = 20503, upload-time = "2025-10-18T21:55:43.219Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/cb/b1/3846dd7f199d53cb17f49cba7e651e9ce294d8497c8c150530ed11865bb8/iniconfig-2.3.0-py3-none-any.whl", hash = "sha256:f631c04d2c48c52b84d0d0549c99ff3859c98df65b3101406327ecc7d53fbf12", size = 7484, upload-time = "2025-10-18T21:55:41.639Z" }, ] [[package]] name = "jinja2" version = "3.1.6" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "markupsafe" }, ] sdist = { url = "https://files.pythonhosted.org/packages/df/bf/f7da0350254c0ed7c72f3e33cef02e048281fec7ecec5f032d4aac52226b/jinja2-3.1.6.tar.gz", hash = "sha256:0137fb05990d35f1275a587e9aee6d56da821fc83491a0fb838183be43f66d6d", size = 245115, upload-time = "2025-03-05T20:05:02.478Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/62/a1/3d680cbfd5f4b8f15abc1d571870c5fc3e594bb582bc3b64ea099db13e56/jinja2-3.1.6-py3-none-any.whl", hash = "sha256:85ece4451f492d0c13c5dd7c13a64681a86afae63a5f347908daf103ce6d2f67", size = 134899, upload-time = "2025-03-05T20:05:00.369Z" }, ] [[package]] name = "markdown-it-py" version = "4.2.0" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "mdurl" }, ] sdist = { url = "https://files.pythonhosted.org/packages/06/ff/7841249c247aa650a76b9ee4bbaeae59370dc8bfd2f6c01f3630c35eb134/markdown_it_py-4.2.0.tar.gz", hash = "sha256:04a21681d6fbb623de53f6f364d352309d4094dd4194040a10fd51833e418d49", size = 82454, upload-time = "2026-05-07T12:08:28.36Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/b3/81/4da04ced5a082363ecfa159c010d200ecbd959ae410c10c0264a38cac0f5/markdown_it_py-4.2.0-py3-none-any.whl", hash = "sha256:9f7ebbcd14fe59494226453aed97c1070d83f8d24b6fc3a3bcf9a38092641c4a", size = 91687, upload-time = "2026-05-07T12:08:27.182Z" }, ] [[package]] name = "markupsafe" version = "3.0.3" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/7e/99/7690b6d4034fffd95959cbe0c02de8deb3098cc577c67bb6a24fe5d7caa7/markupsafe-3.0.3.tar.gz", hash = "sha256:722695808f4b6457b320fdc131280796bdceb04ab50fe1795cd540799ebe1698", size = 80313, upload-time = "2025-09-27T18:37:40.426Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/08/db/fefacb2136439fc8dd20e797950e749aa1f4997ed584c62cfb8ef7c2be0e/markupsafe-3.0.3-cp311-cp311-macosx_10_9_x86_64.whl", hash = "sha256:1cc7ea17a6824959616c525620e387f6dd30fec8cb44f649e31712db02123dad", size = 11631, upload-time = "2025-09-27T18:36:18.185Z" }, { url = "https://files.pythonhosted.org/packages/e1/2e/5898933336b61975ce9dc04decbc0a7f2fee78c30353c5efba7f2d6ff27a/markupsafe-3.0.3-cp311-cp311-macosx_11_0_arm64.whl", hash = "sha256:4bd4cd07944443f5a265608cc6aab442e4f74dff8088b0dfc8238647b8f6ae9a", size = 12058, upload-time = "2025-09-27T18:36:19.444Z" }, { url = "https://files.pythonhosted.org/packages/1d/09/adf2df3699d87d1d8184038df46a9c80d78c0148492323f4693df54e17bb/markupsafe-3.0.3-cp311-cp311-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:6b5420a1d9450023228968e7e6a9ce57f65d148ab56d2313fcd589eee96a7a50", size = 24287, upload-time = "2025-09-27T18:36:20.768Z" }, { url = "https://files.pythonhosted.org/packages/30/ac/0273f6fcb5f42e314c6d8cd99effae6a5354604d461b8d392b5ec9530a54/markupsafe-3.0.3-cp311-cp311-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:0bf2a864d67e76e5c9a34dc26ec616a66b9888e25e7b9460e1c76d3293bd9dbf", size = 22940, upload-time = "2025-09-27T18:36:22.249Z" }, { url = "https://files.pythonhosted.org/packages/19/ae/31c1be199ef767124c042c6c3e904da327a2f7f0cd63a0337e1eca2967a8/markupsafe-3.0.3-cp311-cp311-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:bc51efed119bc9cfdf792cdeaa4d67e8f6fcccab66ed4bfdd6bde3e59bfcbb2f", size = 21887, upload-time = "2025-09-27T18:36:23.535Z" }, { url = "https://files.pythonhosted.org/packages/b2/76/7edcab99d5349a4532a459e1fe64f0b0467a3365056ae550d3bcf3f79e1e/markupsafe-3.0.3-cp311-cp311-musllinux_1_2_aarch64.whl", hash = "sha256:068f375c472b3e7acbe2d5318dea141359e6900156b5b2ba06a30b169086b91a", size = 23692, upload-time = "2025-09-27T18:36:24.823Z" }, { url = "https://files.pythonhosted.org/packages/a4/28/6e74cdd26d7514849143d69f0bf2399f929c37dc2b31e6829fd2045b2765/markupsafe-3.0.3-cp311-cp311-musllinux_1_2_riscv64.whl", hash = "sha256:7be7b61bb172e1ed687f1754f8e7484f1c8019780f6f6b0786e76bb01c2ae115", size = 21471, upload-time = "2025-09-27T18:36:25.95Z" }, { url = "https://files.pythonhosted.org/packages/62/7e/a145f36a5c2945673e590850a6f8014318d5577ed7e5920a4b3448e0865d/markupsafe-3.0.3-cp311-cp311-musllinux_1_2_x86_64.whl", hash = "sha256:f9e130248f4462aaa8e2552d547f36ddadbeaa573879158d721bbd33dfe4743a", size = 22923, upload-time = "2025-09-27T18:36:27.109Z" }, { url = "https://files.pythonhosted.org/packages/0f/62/d9c46a7f5c9adbeeeda52f5b8d802e1094e9717705a645efc71b0913a0a8/markupsafe-3.0.3-cp311-cp311-win32.whl", hash = "sha256:0db14f5dafddbb6d9208827849fad01f1a2609380add406671a26386cdf15a19", size = 14572, upload-time = "2025-09-27T18:36:28.045Z" }, { url = "https://files.pythonhosted.org/packages/83/8a/4414c03d3f891739326e1783338e48fb49781cc915b2e0ee052aa490d586/markupsafe-3.0.3-cp311-cp311-win_amd64.whl", hash = "sha256:de8a88e63464af587c950061a5e6a67d3632e36df62b986892331d4620a35c01", size = 15077, upload-time = "2025-09-27T18:36:29.025Z" }, { url = "https://files.pythonhosted.org/packages/35/73/893072b42e6862f319b5207adc9ae06070f095b358655f077f69a35601f0/markupsafe-3.0.3-cp311-cp311-win_arm64.whl", hash = "sha256:3b562dd9e9ea93f13d53989d23a7e775fdfd1066c33494ff43f5418bc8c58a5c", size = 13876, upload-time = "2025-09-27T18:36:29.954Z" }, { url = "https://files.pythonhosted.org/packages/5a/72/147da192e38635ada20e0a2e1a51cf8823d2119ce8883f7053879c2199b5/markupsafe-3.0.3-cp312-cp312-macosx_10_13_x86_64.whl", hash = "sha256:d53197da72cc091b024dd97249dfc7794d6a56530370992a5e1a08983ad9230e", size = 11615, upload-time = "2025-09-27T18:36:30.854Z" }, { url = "https://files.pythonhosted.org/packages/9a/81/7e4e08678a1f98521201c3079f77db69fb552acd56067661f8c2f534a718/markupsafe-3.0.3-cp312-cp312-macosx_11_0_arm64.whl", hash = "sha256:1872df69a4de6aead3491198eaf13810b565bdbeec3ae2dc8780f14458ec73ce", size = 12020, upload-time = "2025-09-27T18:36:31.971Z" }, { url = "https://files.pythonhosted.org/packages/1e/2c/799f4742efc39633a1b54a92eec4082e4f815314869865d876824c257c1e/markupsafe-3.0.3-cp312-cp312-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:3a7e8ae81ae39e62a41ec302f972ba6ae23a5c5396c8e60113e9066ef893da0d", size = 24332, upload-time = "2025-09-27T18:36:32.813Z" }, { url = "https://files.pythonhosted.org/packages/3c/2e/8d0c2ab90a8c1d9a24f0399058ab8519a3279d1bd4289511d74e909f060e/markupsafe-3.0.3-cp312-cp312-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:d6dd0be5b5b189d31db7cda48b91d7e0a9795f31430b7f271219ab30f1d3ac9d", size = 22947, upload-time = "2025-09-27T18:36:33.86Z" }, { url = "https://files.pythonhosted.org/packages/2c/54/887f3092a85238093a0b2154bd629c89444f395618842e8b0c41783898ea/markupsafe-3.0.3-cp312-cp312-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:94c6f0bb423f739146aec64595853541634bde58b2135f27f61c1ffd1cd4d16a", size = 21962, upload-time = "2025-09-27T18:36:35.099Z" }, { url = "https://files.pythonhosted.org/packages/c9/2f/336b8c7b6f4a4d95e91119dc8521402461b74a485558d8f238a68312f11c/markupsafe-3.0.3-cp312-cp312-musllinux_1_2_aarch64.whl", hash = "sha256:be8813b57049a7dc738189df53d69395eba14fb99345e0a5994914a3864c8a4b", size = 23760, upload-time = "2025-09-27T18:36:36.001Z" }, { url = "https://files.pythonhosted.org/packages/32/43/67935f2b7e4982ffb50a4d169b724d74b62a3964bc1a9a527f5ac4f1ee2b/markupsafe-3.0.3-cp312-cp312-musllinux_1_2_riscv64.whl", hash = "sha256:83891d0e9fb81a825d9a6d61e3f07550ca70a076484292a70fde82c4b807286f", size = 21529, upload-time = "2025-09-27T18:36:36.906Z" }, { url = "https://files.pythonhosted.org/packages/89/e0/4486f11e51bbba8b0c041098859e869e304d1c261e59244baa3d295d47b7/markupsafe-3.0.3-cp312-cp312-musllinux_1_2_x86_64.whl", hash = "sha256:77f0643abe7495da77fb436f50f8dab76dbc6e5fd25d39589a0f1fe6548bfa2b", size = 23015, upload-time = "2025-09-27T18:36:37.868Z" }, { url = "https://files.pythonhosted.org/packages/2f/e1/78ee7a023dac597a5825441ebd17170785a9dab23de95d2c7508ade94e0e/markupsafe-3.0.3-cp312-cp312-win32.whl", hash = "sha256:d88b440e37a16e651bda4c7c2b930eb586fd15ca7406cb39e211fcff3bf3017d", size = 14540, upload-time = "2025-09-27T18:36:38.761Z" }, { url = "https://files.pythonhosted.org/packages/aa/5b/bec5aa9bbbb2c946ca2733ef9c4ca91c91b6a24580193e891b5f7dbe8e1e/markupsafe-3.0.3-cp312-cp312-win_amd64.whl", hash = "sha256:26a5784ded40c9e318cfc2bdb30fe164bdb8665ded9cd64d500a34fb42067b1c", size = 15105, upload-time = "2025-09-27T18:36:39.701Z" }, { url = "https://files.pythonhosted.org/packages/e5/f1/216fc1bbfd74011693a4fd837e7026152e89c4bcf3e77b6692fba9923123/markupsafe-3.0.3-cp312-cp312-win_arm64.whl", hash = "sha256:35add3b638a5d900e807944a078b51922212fb3dedb01633a8defc4b01a3c85f", size = 13906, upload-time = "2025-09-27T18:36:40.689Z" }, { url = "https://files.pythonhosted.org/packages/38/2f/907b9c7bbba283e68f20259574b13d005c121a0fa4c175f9bed27c4597ff/markupsafe-3.0.3-cp313-cp313-macosx_10_13_x86_64.whl", hash = "sha256:e1cf1972137e83c5d4c136c43ced9ac51d0e124706ee1c8aa8532c1287fa8795", size = 11622, upload-time = "2025-09-27T18:36:41.777Z" }, { url = "https://files.pythonhosted.org/packages/9c/d9/5f7756922cdd676869eca1c4e3c0cd0df60ed30199ffd775e319089cb3ed/markupsafe-3.0.3-cp313-cp313-macosx_11_0_arm64.whl", hash = "sha256:116bb52f642a37c115f517494ea5feb03889e04df47eeff5b130b1808ce7c219", size = 12029, upload-time = "2025-09-27T18:36:43.257Z" }, { url = "https://files.pythonhosted.org/packages/00/07/575a68c754943058c78f30db02ee03a64b3c638586fba6a6dd56830b30a3/markupsafe-3.0.3-cp313-cp313-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:133a43e73a802c5562be9bbcd03d090aa5a1fe899db609c29e8c8d815c5f6de6", size = 24374, upload-time = "2025-09-27T18:36:44.508Z" }, { url = "https://files.pythonhosted.org/packages/a9/21/9b05698b46f218fc0e118e1f8168395c65c8a2c750ae2bab54fc4bd4e0e8/markupsafe-3.0.3-cp313-cp313-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:ccfcd093f13f0f0b7fdd0f198b90053bf7b2f02a3927a30e63f3ccc9df56b676", size = 22980, upload-time = "2025-09-27T18:36:45.385Z" }, { url = "https://files.pythonhosted.org/packages/7f/71/544260864f893f18b6827315b988c146b559391e6e7e8f7252839b1b846a/markupsafe-3.0.3-cp313-cp313-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:509fa21c6deb7a7a273d629cf5ec029bc209d1a51178615ddf718f5918992ab9", size = 21990, upload-time = "2025-09-27T18:36:46.916Z" }, { url = "https://files.pythonhosted.org/packages/c2/28/b50fc2f74d1ad761af2f5dcce7492648b983d00a65b8c0e0cb457c82ebbe/markupsafe-3.0.3-cp313-cp313-musllinux_1_2_aarch64.whl", hash = "sha256:a4afe79fb3de0b7097d81da19090f4df4f8d3a2b3adaa8764138aac2e44f3af1", size = 23784, upload-time = "2025-09-27T18:36:47.884Z" }, { url = "https://files.pythonhosted.org/packages/ed/76/104b2aa106a208da8b17a2fb72e033a5a9d7073c68f7e508b94916ed47a9/markupsafe-3.0.3-cp313-cp313-musllinux_1_2_riscv64.whl", hash = "sha256:795e7751525cae078558e679d646ae45574b47ed6e7771863fcc079a6171a0fc", size = 21588, upload-time = "2025-09-27T18:36:48.82Z" }, { url = "https://files.pythonhosted.org/packages/b5/99/16a5eb2d140087ebd97180d95249b00a03aa87e29cc224056274f2e45fd6/markupsafe-3.0.3-cp313-cp313-musllinux_1_2_x86_64.whl", hash = "sha256:8485f406a96febb5140bfeca44a73e3ce5116b2501ac54fe953e488fb1d03b12", size = 23041, upload-time = "2025-09-27T18:36:49.797Z" }, { url = "https://files.pythonhosted.org/packages/19/bc/e7140ed90c5d61d77cea142eed9f9c303f4c4806f60a1044c13e3f1471d0/markupsafe-3.0.3-cp313-cp313-win32.whl", hash = "sha256:bdd37121970bfd8be76c5fb069c7751683bdf373db1ed6c010162b2a130248ed", size = 14543, upload-time = "2025-09-27T18:36:51.584Z" }, { url = "https://files.pythonhosted.org/packages/05/73/c4abe620b841b6b791f2edc248f556900667a5a1cf023a6646967ae98335/markupsafe-3.0.3-cp313-cp313-win_amd64.whl", hash = "sha256:9a1abfdc021a164803f4d485104931fb8f8c1efd55bc6b748d2f5774e78b62c5", size = 15113, upload-time = "2025-09-27T18:36:52.537Z" }, { url = "https://files.pythonhosted.org/packages/f0/3a/fa34a0f7cfef23cf9500d68cb7c32dd64ffd58a12b09225fb03dd37d5b80/markupsafe-3.0.3-cp313-cp313-win_arm64.whl", hash = "sha256:7e68f88e5b8799aa49c85cd116c932a1ac15caaa3f5db09087854d218359e485", size = 13911, upload-time = "2025-09-27T18:36:53.513Z" }, { url = "https://files.pythonhosted.org/packages/e4/d7/e05cd7efe43a88a17a37b3ae96e79a19e846f3f456fe79c57ca61356ef01/markupsafe-3.0.3-cp313-cp313t-macosx_10_13_x86_64.whl", hash = "sha256:218551f6df4868a8d527e3062d0fb968682fe92054e89978594c28e642c43a73", size = 11658, upload-time = "2025-09-27T18:36:54.819Z" }, { url = "https://files.pythonhosted.org/packages/99/9e/e412117548182ce2148bdeacdda3bb494260c0b0184360fe0d56389b523b/markupsafe-3.0.3-cp313-cp313t-macosx_11_0_arm64.whl", hash = "sha256:3524b778fe5cfb3452a09d31e7b5adefeea8c5be1d43c4f810ba09f2ceb29d37", size = 12066, upload-time = "2025-09-27T18:36:55.714Z" }, { url = "https://files.pythonhosted.org/packages/bc/e6/fa0ffcda717ef64a5108eaa7b4f5ed28d56122c9a6d70ab8b72f9f715c80/markupsafe-3.0.3-cp313-cp313t-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:4e885a3d1efa2eadc93c894a21770e4bc67899e3543680313b09f139e149ab19", size = 25639, upload-time = "2025-09-27T18:36:56.908Z" }, { url = "https://files.pythonhosted.org/packages/96/ec/2102e881fe9d25fc16cb4b25d5f5cde50970967ffa5dddafdb771237062d/markupsafe-3.0.3-cp313-cp313t-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:8709b08f4a89aa7586de0aadc8da56180242ee0ada3999749b183aa23df95025", size = 23569, upload-time = "2025-09-27T18:36:57.913Z" }, { url = "https://files.pythonhosted.org/packages/4b/30/6f2fce1f1f205fc9323255b216ca8a235b15860c34b6798f810f05828e32/markupsafe-3.0.3-cp313-cp313t-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:b8512a91625c9b3da6f127803b166b629725e68af71f8184ae7e7d54686a56d6", size = 23284, upload-time = "2025-09-27T18:36:58.833Z" }, { url = "https://files.pythonhosted.org/packages/58/47/4a0ccea4ab9f5dcb6f79c0236d954acb382202721e704223a8aafa38b5c8/markupsafe-3.0.3-cp313-cp313t-musllinux_1_2_aarch64.whl", hash = "sha256:9b79b7a16f7fedff2495d684f2b59b0457c3b493778c9eed31111be64d58279f", size = 24801, upload-time = "2025-09-27T18:36:59.739Z" }, { url = "https://files.pythonhosted.org/packages/6a/70/3780e9b72180b6fecb83a4814d84c3bf4b4ae4bf0b19c27196104149734c/markupsafe-3.0.3-cp313-cp313t-musllinux_1_2_riscv64.whl", hash = "sha256:12c63dfb4a98206f045aa9563db46507995f7ef6d83b2f68eda65c307c6829eb", size = 22769, upload-time = "2025-09-27T18:37:00.719Z" }, { url = "https://files.pythonhosted.org/packages/98/c5/c03c7f4125180fc215220c035beac6b9cb684bc7a067c84fc69414d315f5/markupsafe-3.0.3-cp313-cp313t-musllinux_1_2_x86_64.whl", hash = "sha256:8f71bc33915be5186016f675cd83a1e08523649b0e33efdb898db577ef5bb009", size = 23642, upload-time = "2025-09-27T18:37:01.673Z" }, { url = "https://files.pythonhosted.org/packages/80/d6/2d1b89f6ca4bff1036499b1e29a1d02d282259f3681540e16563f27ebc23/markupsafe-3.0.3-cp313-cp313t-win32.whl", hash = "sha256:69c0b73548bc525c8cb9a251cddf1931d1db4d2258e9599c28c07ef3580ef354", size = 14612, upload-time = "2025-09-27T18:37:02.639Z" }, { url = "https://files.pythonhosted.org/packages/2b/98/e48a4bfba0a0ffcf9925fe2d69240bfaa19c6f7507b8cd09c70684a53c1e/markupsafe-3.0.3-cp313-cp313t-win_amd64.whl", hash = "sha256:1b4b79e8ebf6b55351f0d91fe80f893b4743f104bff22e90697db1590e47a218", size = 15200, upload-time = "2025-09-27T18:37:03.582Z" }, { url = "https://files.pythonhosted.org/packages/0e/72/e3cc540f351f316e9ed0f092757459afbc595824ca724cbc5a5d4263713f/markupsafe-3.0.3-cp313-cp313t-win_arm64.whl", hash = "sha256:ad2cf8aa28b8c020ab2fc8287b0f823d0a7d8630784c31e9ee5edea20f406287", size = 13973, upload-time = "2025-09-27T18:37:04.929Z" }, { url = "https://files.pythonhosted.org/packages/33/8a/8e42d4838cd89b7dde187011e97fe6c3af66d8c044997d2183fbd6d31352/markupsafe-3.0.3-cp314-cp314-macosx_10_13_x86_64.whl", hash = "sha256:eaa9599de571d72e2daf60164784109f19978b327a3910d3e9de8c97b5b70cfe", size = 11619, upload-time = "2025-09-27T18:37:06.342Z" }, { url = "https://files.pythonhosted.org/packages/b5/64/7660f8a4a8e53c924d0fa05dc3a55c9cee10bbd82b11c5afb27d44b096ce/markupsafe-3.0.3-cp314-cp314-macosx_11_0_arm64.whl", hash = "sha256:c47a551199eb8eb2121d4f0f15ae0f923d31350ab9280078d1e5f12b249e0026", size = 12029, upload-time = "2025-09-27T18:37:07.213Z" }, { url = "https://files.pythonhosted.org/packages/da/ef/e648bfd021127bef5fa12e1720ffed0c6cbb8310c8d9bea7266337ff06de/markupsafe-3.0.3-cp314-cp314-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:f34c41761022dd093b4b6896d4810782ffbabe30f2d443ff5f083e0cbbb8c737", size = 24408, upload-time = "2025-09-27T18:37:09.572Z" }, { url = "https://files.pythonhosted.org/packages/41/3c/a36c2450754618e62008bf7435ccb0f88053e07592e6028a34776213d877/markupsafe-3.0.3-cp314-cp314-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:457a69a9577064c05a97c41f4e65148652db078a3a509039e64d3467b9e7ef97", size = 23005, upload-time = "2025-09-27T18:37:10.58Z" }, { url = "https://files.pythonhosted.org/packages/bc/20/b7fdf89a8456b099837cd1dc21974632a02a999ec9bf7ca3e490aacd98e7/markupsafe-3.0.3-cp314-cp314-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:e8afc3f2ccfa24215f8cb28dcf43f0113ac3c37c2f0f0806d8c70e4228c5cf4d", size = 22048, upload-time = "2025-09-27T18:37:11.547Z" }, { url = "https://files.pythonhosted.org/packages/9a/a7/591f592afdc734f47db08a75793a55d7fbcc6902a723ae4cfbab61010cc5/markupsafe-3.0.3-cp314-cp314-musllinux_1_2_aarch64.whl", hash = "sha256:ec15a59cf5af7be74194f7ab02d0f59a62bdcf1a537677ce67a2537c9b87fcda", size = 23821, upload-time = "2025-09-27T18:37:12.48Z" }, { url = "https://files.pythonhosted.org/packages/7d/33/45b24e4f44195b26521bc6f1a82197118f74df348556594bd2262bda1038/markupsafe-3.0.3-cp314-cp314-musllinux_1_2_riscv64.whl", hash = "sha256:0eb9ff8191e8498cca014656ae6b8d61f39da5f95b488805da4bb029cccbfbaf", size = 21606, upload-time = "2025-09-27T18:37:13.485Z" }, { url = "https://files.pythonhosted.org/packages/ff/0e/53dfaca23a69fbfbbf17a4b64072090e70717344c52eaaaa9c5ddff1e5f0/markupsafe-3.0.3-cp314-cp314-musllinux_1_2_x86_64.whl", hash = "sha256:2713baf880df847f2bece4230d4d094280f4e67b1e813eec43b4c0e144a34ffe", size = 23043, upload-time = "2025-09-27T18:37:14.408Z" }, { url = "https://files.pythonhosted.org/packages/46/11/f333a06fc16236d5238bfe74daccbca41459dcd8d1fa952e8fbd5dccfb70/markupsafe-3.0.3-cp314-cp314-win32.whl", hash = "sha256:729586769a26dbceff69f7a7dbbf59ab6572b99d94576a5592625d5b411576b9", size = 14747, upload-time = "2025-09-27T18:37:15.36Z" }, { url = "https://files.pythonhosted.org/packages/28/52/182836104b33b444e400b14f797212f720cbc9ed6ba34c800639d154e821/markupsafe-3.0.3-cp314-cp314-win_amd64.whl", hash = "sha256:bdc919ead48f234740ad807933cdf545180bfbe9342c2bb451556db2ed958581", size = 15341, upload-time = "2025-09-27T18:37:16.496Z" }, { url = "https://files.pythonhosted.org/packages/6f/18/acf23e91bd94fd7b3031558b1f013adfa21a8e407a3fdb32745538730382/markupsafe-3.0.3-cp314-cp314-win_arm64.whl", hash = "sha256:5a7d5dc5140555cf21a6fefbdbf8723f06fcd2f63ef108f2854de715e4422cb4", size = 14073, upload-time = "2025-09-27T18:37:17.476Z" }, { url = "https://files.pythonhosted.org/packages/3c/f0/57689aa4076e1b43b15fdfa646b04653969d50cf30c32a102762be2485da/markupsafe-3.0.3-cp314-cp314t-macosx_10_13_x86_64.whl", hash = "sha256:1353ef0c1b138e1907ae78e2f6c63ff67501122006b0f9abad68fda5f4ffc6ab", size = 11661, upload-time = "2025-09-27T18:37:18.453Z" }, { url = "https://files.pythonhosted.org/packages/89/c3/2e67a7ca217c6912985ec766c6393b636fb0c2344443ff9d91404dc4c79f/markupsafe-3.0.3-cp314-cp314t-macosx_11_0_arm64.whl", hash = "sha256:1085e7fbddd3be5f89cc898938f42c0b3c711fdcb37d75221de2666af647c175", size = 12069, upload-time = "2025-09-27T18:37:19.332Z" }, { url = "https://files.pythonhosted.org/packages/f0/00/be561dce4e6ca66b15276e184ce4b8aec61fe83662cce2f7d72bd3249d28/markupsafe-3.0.3-cp314-cp314t-manylinux2014_aarch64.manylinux_2_17_aarch64.manylinux_2_28_aarch64.whl", hash = "sha256:1b52b4fb9df4eb9ae465f8d0c228a00624de2334f216f178a995ccdcf82c4634", size = 25670, upload-time = "2025-09-27T18:37:20.245Z" }, { url = "https://files.pythonhosted.org/packages/50/09/c419f6f5a92e5fadde27efd190eca90f05e1261b10dbd8cbcb39cd8ea1dc/markupsafe-3.0.3-cp314-cp314t-manylinux2014_x86_64.manylinux_2_17_x86_64.manylinux_2_28_x86_64.whl", hash = "sha256:fed51ac40f757d41b7c48425901843666a6677e3e8eb0abcff09e4ba6e664f50", size = 23598, upload-time = "2025-09-27T18:37:21.177Z" }, { url = "https://files.pythonhosted.org/packages/22/44/a0681611106e0b2921b3033fc19bc53323e0b50bc70cffdd19f7d679bb66/markupsafe-3.0.3-cp314-cp314t-manylinux_2_31_riscv64.manylinux_2_39_riscv64.whl", hash = "sha256:f190daf01f13c72eac4efd5c430a8de82489d9cff23c364c3ea822545032993e", size = 23261, upload-time = "2025-09-27T18:37:22.167Z" }, { url = "https://files.pythonhosted.org/packages/5f/57/1b0b3f100259dc9fffe780cfb60d4be71375510e435efec3d116b6436d43/markupsafe-3.0.3-cp314-cp314t-musllinux_1_2_aarch64.whl", hash = "sha256:e56b7d45a839a697b5eb268c82a71bd8c7f6c94d6fd50c3d577fa39a9f1409f5", size = 24835, upload-time = "2025-09-27T18:37:23.296Z" }, { url = "https://files.pythonhosted.org/packages/26/6a/4bf6d0c97c4920f1597cc14dd720705eca0bf7c787aebc6bb4d1bead5388/markupsafe-3.0.3-cp314-cp314t-musllinux_1_2_riscv64.whl", hash = "sha256:f3e98bb3798ead92273dc0e5fd0f31ade220f59a266ffd8a4f6065e0a3ce0523", size = 22733, upload-time = "2025-09-27T18:37:24.237Z" }, { url = "https://files.pythonhosted.org/packages/14/c7/ca723101509b518797fedc2fdf79ba57f886b4aca8a7d31857ba3ee8281f/markupsafe-3.0.3-cp314-cp314t-musllinux_1_2_x86_64.whl", hash = "sha256:5678211cb9333a6468fb8d8be0305520aa073f50d17f089b5b4b477ea6e67fdc", size = 23672, upload-time = "2025-09-27T18:37:25.271Z" }, { url = "https://files.pythonhosted.org/packages/fb/df/5bd7a48c256faecd1d36edc13133e51397e41b73bb77e1a69deab746ebac/markupsafe-3.0.3-cp314-cp314t-win32.whl", hash = "sha256:915c04ba3851909ce68ccc2b8e2cd691618c4dc4c4232fb7982bca3f41fd8c3d", size = 14819, upload-time = "2025-09-27T18:37:26.285Z" }, { url = "https://files.pythonhosted.org/packages/1a/8a/0402ba61a2f16038b48b39bccca271134be00c5c9f0f623208399333c448/markupsafe-3.0.3-cp314-cp314t-win_amd64.whl", hash = "sha256:4faffd047e07c38848ce017e8725090413cd80cbc23d86e55c587bf979e579c9", size = 15426, upload-time = "2025-09-27T18:37:27.316Z" }, { url = "https://files.pythonhosted.org/packages/70/bc/6f1c2f612465f5fa89b95bead1f44dcb607670fd42891d8fdcd5d039f4f4/markupsafe-3.0.3-cp314-cp314t-win_arm64.whl", hash = "sha256:32001d6a8fc98c8cb5c947787c5d08b0a50663d139f1305bac5885d98d9b40fa", size = 14146, upload-time = "2025-09-27T18:37:28.327Z" }, ] [[package]] name = "mdurl" version = "0.1.2" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/d6/54/cfe61301667036ec958cb99bd3efefba235e65cdeb9c84d24a8293ba1d90/mdurl-0.1.2.tar.gz", hash = "sha256:bb413d29f5eea38f31dd4754dd7377d4465116fb207585f97bf925588687c1ba", size = 8729, upload-time = "2022-08-14T12:40:10.846Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/b3/38/89ba8ad64ae25be8de66a6d463314cf1eb366222074cfda9ee839c56a4b4/mdurl-0.1.2-py3-none-any.whl", hash = "sha256:84008a41e51615a49fc9966191ff91509e3c40b939176e643fd50a5c2196b8f8", size = 9979, upload-time = "2022-08-14T12:40:09.779Z" }, ] [[package]] name = "packaging" version = "26.2" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/d7/f1/e7a6dd94a8d4a5626c03e4e99c87f241ba9e350cd9e6d75123f992427270/packaging-26.2.tar.gz", hash = "sha256:ff452ff5a3e828ce110190feff1178bb1f2ea2281fa2075aadb987c2fb221661", size = 228134, upload-time = "2026-04-24T20:15:23.917Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/df/b2/87e62e8c3e2f4b32e5fe99e0b86d576da1312593b39f47d8ceef365e95ed/packaging-26.2-py3-none-any.whl", hash = "sha256:5fc45236b9446107ff2415ce77c807cee2862cb6fac22b8a73826d0693b0980e", size = 100195, upload-time = "2026-04-24T20:15:22.081Z" }, ] [[package]] name = "platformdirs" version = "4.10.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/d7/47/e4501f49c178ae1d9f4a75073fda4204f52647993f075a9db4d14930e0c5/platformdirs-4.10.0.tar.gz", hash = "sha256:31e761a6a0ca04faf7353ea759bdba55652be214725111e5aac52dfa29d4bef7", size = 31224, upload-time = "2026-05-28T03:32:53.587Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/81/e6/cd9575ac904136b3cbf7aa7ee819ef86eedb7274e46f230e94ea4342e729/platformdirs-4.10.0-py3-none-any.whl", hash = "sha256:fb516cdb12eb0d857d0cd85a7c57cea4d060bee4578d6cf5a14dfdf8cbf8784a", size = 22743, upload-time = "2026-05-28T03:32:52.175Z" }, ] [[package]] name = "pluggy" version = "1.6.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/f9/e2/3e91f31a7d2b083fe6ef3fa267035b518369d9511ffab804f839851d2779/pluggy-1.6.0.tar.gz", hash = "sha256:7dcc130b76258d33b90f61b658791dede3486c3e6bfb003ee5c9bfb396dd22f3", size = 69412, upload-time = "2025-05-15T12:30:07.975Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/54/20/4d324d65cc6d9205fabedc306948156824eb9f0ee1633355a8f7ec5c66bf/pluggy-1.6.0-py3-none-any.whl", hash = "sha256:e920276dd6813095e9377c0bc5566d94c932c33b27a3e3945d8389c374dd4746", size = 20538, upload-time = "2025-05-15T12:30:06.134Z" }, ] [[package]] name = "pprintpp" version = "0.4.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/06/1a/7737e7a0774da3c3824d654993cf57adc915cb04660212f03406334d8c0b/pprintpp-0.4.0.tar.gz", hash = "sha256:ea826108e2c7f49dc6d66c752973c3fc9749142a798d6b254e1e301cfdbc6403", size = 17995, upload-time = "2018-07-01T01:42:34.87Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/4e/d1/e4ed95fdd3ef13b78630280d9e9e240aeb65cc7c544ec57106149c3942fb/pprintpp-0.4.0-py2.py3-none-any.whl", hash = "sha256:b6b4dcdd0c0c0d75e4d7b2f21a9e933e5b2ce62b26e1a54537f9651ae5a5c01d", size = 16952, upload-time = "2018-07-01T01:42:36.496Z" }, ] [[package]] name = "py-cpuinfo" version = "9.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/37/a8/d832f7293ebb21690860d2e01d8115e5ff6f2ae8bbdc953f0eb0fa4bd2c7/py-cpuinfo-9.0.0.tar.gz", hash = "sha256:3cdbbf3fac90dc6f118bfd64384f309edeadd902d7c8fb17f02ffa1fc3f49690", size = 104716, upload-time = "2022-10-25T20:38:06.303Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/e0/a9/023730ba63db1e494a271cb018dcd361bd2c917ba7004c3e49d5daf795a2/py_cpuinfo-9.0.0-py3-none-any.whl", hash = "sha256:859625bc251f64e21f077d099d4162689c762b5d6a4c3c97553d56241c9674d5", size = 22335, upload-time = "2022-10-25T20:38:27.636Z" }, ] [[package]] name = "pygments" version = "2.20.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/c3/b2/bc9c9196916376152d655522fdcebac55e66de6603a76a02bca1b6414f6c/pygments-2.20.0.tar.gz", hash = "sha256:6757cd03768053ff99f3039c1a36d6c0aa0b263438fcab17520b30a303a82b5f", size = 4955991, upload-time = "2026-03-29T13:29:33.898Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/f4/7e/a72dd26f3b0f4f2bf1dd8923c85f7ceb43172af56d63c7383eb62b332364/pygments-2.20.0-py3-none-any.whl", hash = "sha256:81a9e26dd42fd28a23a2d169d86d7ac03b46e2f8b59ed4698fb4785f946d0176", size = 1231151, upload-time = "2026-03-29T13:29:30.038Z" }, ] [[package]] name = "pyproject-api" version = "1.10.1" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "packaging" }, ] sdist = { url = "https://files.pythonhosted.org/packages/62/62/0fe346fe380b1aafaf819c8cb195d3241bb4f355f908e6339814131a830b/pyproject_api-1.10.1.tar.gz", hash = "sha256:c2b2726bd7aa9217b6c50b621fef5b2ae5def4d55b779c9e0694c15e0a8517ba", size = 23477, upload-time = "2026-05-28T14:22:14.049Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/79/d7/29e1e5e882f79133631f7bcace42d23db493f616463c157a1ab614bf69dd/pyproject_api-1.10.1-py3-none-any.whl", hash = "sha256:fa9e6f66c35b5017e909825d8f2b5d5482ea699d7be809d21c03bd1f7317f36a", size = 12992, upload-time = "2026-05-28T14:22:12.711Z" }, ] [[package]] name = "pytest" version = "9.1.1" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "colorama", marker = "sys_platform == 'win32'" }, { name = "iniconfig" }, { name = "packaging" }, { name = "pluggy" }, { name = "pygments" }, ] sdist = { url = "https://files.pythonhosted.org/packages/e4/47/b9efed96c114afcfa3c9d3fe98a76a1d14c74a9e266d397cf6eb64be5e01/pytest-9.1.1.tar.gz", hash = "sha256:1088fbde8f2b49d95a549a195707afa7a76a3ce9bcadc26b6d71f0ffda5fe313", size = 1636369, upload-time = "2026-06-19T10:58:32.857Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/24/25/1de2678b631f5a49215c6c96fff41ba892b0a34df68d6d80292b1b48aa7f/pytest-9.1.1-py3-none-any.whl", hash = "sha256:37a86b45efb9a47a61a36449063e8e18d0cab3161329fc099eb21783169c4f0c", size = 386536, upload-time = "2026-06-19T10:58:31.347Z" }, ] [[package]] name = "pytest-benchmark" version = "5.2.3" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "py-cpuinfo" }, { name = "pytest" }, ] sdist = { url = "https://files.pythonhosted.org/packages/24/34/9f732b76456d64faffbef6232f1f9dbec7a7c4999ff46282fa418bd1af66/pytest_benchmark-5.2.3.tar.gz", hash = "sha256:deb7317998a23c650fd4ff76e1230066a76cb45dcece0aca5607143c619e7779", size = 341340, upload-time = "2025-11-09T18:48:43.215Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/33/29/e756e715a48959f1c0045342088d7ca9762a2f509b945f362a316e9412b7/pytest_benchmark-5.2.3-py3-none-any.whl", hash = "sha256:bc839726ad20e99aaa0d11a127445457b4219bdb9e80a1afc4b51da7f96b0803", size = 45255, upload-time = "2025-11-09T18:48:39.765Z" }, ] [[package]] name = "pytest-clarity" version = "1.0.1" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "pprintpp" }, { name = "pytest" }, { name = "rich" }, ] sdist = { url = "https://files.pythonhosted.org/packages/52/5c/cafa97944de55738a6a2c5a7cee00d073cb80495032d2b112c4546525eca/pytest-clarity-1.0.1.tar.gz", hash = "sha256:505fe345fad4fe11c6a4187fe683f2c7c52c077caa1e135f3e483fe112db7772", size = 4891, upload-time = "2021-06-11T18:16:18.372Z" } [[package]] name = "pytest-icdiff" version = "0.9" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "icdiff" }, { name = "pprintpp" }, { name = "pytest" }, ] sdist = { url = "https://files.pythonhosted.org/packages/5a/0c/66e1e2590e98f4428e374a3b6448dc086a908d15b1e24b914539d13b7ac4/pytest-icdiff-0.9.tar.gz", hash = "sha256:13aede616202e57fcc882568b64589002ef85438046f012ac30a8d959dac8b75", size = 7110, upload-time = "2023-12-05T11:18:30.192Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/e2/e1/cafe1edf7a30be6fa1bbbf43f7af12b34682eadcf19eb6e9f7352062c422/pytest_icdiff-0.9-py3-none-any.whl", hash = "sha256:efee0da3bd1b24ef2d923751c5c547fbb8df0a46795553fba08ef57c3ca03d82", size = 4994, upload-time = "2023-12-05T11:18:28.572Z" }, ] [[package]] name = "pytest-sphinx" version = "0.7.1" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "pytest" }, ] sdist = { url = "https://files.pythonhosted.org/packages/6c/81/3c7e79f46228bbabdc836b3d2ef4adaa32559501055fdb02d40e4a6e7452/pytest_sphinx-0.7.1.tar.gz", hash = "sha256:bdf45d96458e6aa1f3618c4845e60924eaa91244247c527eb88f58d6685dece6", size = 13940, upload-time = "2026-01-21T19:08:28.655Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/df/ee/fc942ac27ad00ac71a5f5b1c8929bd49ff632d2c3dd30f07b552280bd4c8/pytest_sphinx-0.7.1-py3-none-any.whl", hash = "sha256:fa943bb22c15569db02367b5b2b13ef3fbb9e534931ec193d480c05d956979fb", size = 10066, upload-time = "2026-01-21T19:08:26.612Z" }, ] [[package]] name = "pytest-sugar" version = "1.1.1" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "pytest" }, { name = "termcolor" }, ] sdist = { url = "https://files.pythonhosted.org/packages/0b/4e/60fed105549297ba1a700e1ea7b828044842ea27d72c898990510b79b0e2/pytest-sugar-1.1.1.tar.gz", hash = "sha256:73b8b65163ebf10f9f671efab9eed3d56f20d2ca68bda83fa64740a92c08f65d", size = 16533, upload-time = "2025-08-23T12:19:35.737Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/87/d5/81d38a91c1fdafb6711f053f5a9b92ff788013b19821257c2c38c1e132df/pytest_sugar-1.1.1-py3-none-any.whl", hash = "sha256:2f8319b907548d5b9d03a171515c1d43d2e38e32bd8182a1781eb20b43344cc8", size = 11440, upload-time = "2025-08-23T12:19:34.894Z" }, ] [[package]] name = "pytest-xdist" version = "3.8.0" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "execnet" }, { name = "pytest" }, ] sdist = { url = "https://files.pythonhosted.org/packages/78/b4/439b179d1ff526791eb921115fca8e44e596a13efeda518b9d845a619450/pytest_xdist-3.8.0.tar.gz", hash = "sha256:7e578125ec9bc6050861aa93f2d59f1d8d085595d6551c2c90b6f4fad8d3a9f1", size = 88069, upload-time = "2025-07-01T13:30:59.346Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/ca/31/d4e37e9e550c2b92a9cbc2e4d0b7420a27224968580b5a447f420847c975/pytest_xdist-3.8.0-py3-none-any.whl", hash = "sha256:202ca578cfeb7370784a8c33d6d05bc6e13b4f25b5053c30a152269fd10f0b88", size = 46396, upload-time = "2025-07-01T13:30:56.632Z" }, ] [[package]] name = "python-discovery" version = "1.4.3" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "filelock" }, { name = "platformdirs" }, ] sdist = { url = "https://files.pythonhosted.org/packages/66/26/8b004cc36f430345136f6f00fa1aa9ed596c8ed1e8504625fa79522ff39c/python_discovery-1.4.3.tar.gz", hash = "sha256:ad57d7045a862460d4a235986c33f13ed707d3aeb9153fa47eb7dfd0d4673289", size = 70438, upload-time = "2026-07-03T13:21:51.621Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/28/78/9b77ecb4644d1bbea94d29abf78f21c47eca6eb79e9745b702ec0bed2e19/python_discovery-1.4.3-py3-none-any.whl", hash = "sha256:b6e1e4a7d9e3f6948c39746ffe8218225162d738ba39d05ab1d2f6c1cac4878c", size = 33885, upload-time = "2026-07-03T13:21:50.174Z" }, ] [[package]] name = "requests" version = "2.34.2" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "certifi" }, { name = "charset-normalizer" }, { name = "idna" }, { name = "urllib3" }, ] sdist = { url = "https://files.pythonhosted.org/packages/ac/c3/e2a2b89f2d3e2179abd6d00ebd70bff6273f37fb3e0cc209f48b39d00cbf/requests-2.34.2.tar.gz", hash = "sha256:f288924cae4e29463698d6d60bc6a4da69c89185ad1e0bcc4104f584e960b9ed", size = 142856, upload-time = "2026-05-14T19:25:27.735Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/a0/f4/c67b0b3f1b9245e8d266f0f112c500d50e5b4e83cb6f3b71b6528104182a/requests-2.34.2-py3-none-any.whl", hash = "sha256:2a0d60c172f83ac6ab31e4554906c0f3b3588d37b5cb939b1c061f4907e278e0", size = 73075, upload-time = "2026-05-14T19:25:26.443Z" }, ] [[package]] name = "rich" version = "15.0.0" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "markdown-it-py" }, { name = "pygments" }, ] sdist = { url = "https://files.pythonhosted.org/packages/c0/8f/0722ca900cc807c13a6a0c696dacf35430f72e0ec571c4275d2371fca3e9/rich-15.0.0.tar.gz", hash = "sha256:edd07a4824c6b40189fb7ac9bc4c52536e9780fbbfbddf6f1e2502c31b068c36", size = 230680, upload-time = "2026-04-12T08:24:00.75Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/82/3b/64d4899d73f91ba49a8c18a8ff3f0ea8f1c1d75481760df8c68ef5235bf5/rich-15.0.0-py3-none-any.whl", hash = "sha256:33bd4ef74232fb73fe9279a257718407f169c09b78a87ad3d296f548e27de0bb", size = 310654, upload-time = "2026-04-12T08:24:02.83Z" }, ] [[package]] name = "roman-numerals" version = "4.1.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/ae/f9/41dc953bbeb056c17d5f7a519f50fdf010bd0553be2d630bc69d1e022703/roman_numerals-4.1.0.tar.gz", hash = "sha256:1af8b147eb1405d5839e78aeb93131690495fe9da5c91856cb33ad55a7f1e5b2", size = 9077, upload-time = "2025-12-17T18:25:34.381Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/04/54/6f679c435d28e0a568d8e8a7c0a93a09010818634c3c3907fc98d8983770/roman_numerals-4.1.0-py3-none-any.whl", hash = "sha256:647ba99caddc2cc1e55a51e4360689115551bf4476d90e8162cf8c345fe233c7", size = 7676, upload-time = "2025-12-17T18:25:33.098Z" }, ] [[package]] name = "snowballstemmer" version = "3.1.1" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/43/f8/0a71edf031f03c40db17503cb8ca78a69a171254e568e7db241b0ab57ea1/snowballstemmer-3.1.1.tar.gz", hash = "sha256:e07bbc54a0d798fe6010a12398422e62a8bfbba95c394fd0956ef58cb4d3e260", size = 123314, upload-time = "2026-06-03T00:56:40.194Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/4c/07/2ebca9b11fb9be7340a818d8d6f63feaebb146be2c4afbd6061701d6df6e/snowballstemmer-3.1.1-py3-none-any.whl", hash = "sha256:7e207fa178741da09cdee59d3ecec3827ad5f92b1fc5c9ff3755b639f71f5752", size = 104164, upload-time = "2026-06-03T00:56:38.614Z" }, ] [[package]] name = "sortedcollections" version = "2.1.0" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "sortedcontainers" }, ] sdist = { url = "https://files.pythonhosted.org/packages/01/00/6d749cc1f88e7f95f5442a8abb195fa607094deba9e0475affbfb7fa8c04/sortedcollections-2.1.0.tar.gz", hash = "sha256:d8e9609d6c580a16a1224a3dc8965789e03ebc4c3e5ffd05ada54a2fed5dcacd", size = 9287, upload-time = "2021-01-18T22:15:16.623Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/6e/39/c993a7d0c9dbf3aeca5008bdd00e4436ad9b7170527cef0a14634b47001f/sortedcollections-2.1.0-py3-none-any.whl", hash = "sha256:b07abbc73472cc459da9dd6e2607d73d1f3b9309a32dd9a57fa2c6fa882f4c6c", size = 9531, upload-time = "2021-01-18T22:15:15.36Z" }, ] [[package]] name = "sortedcontainers" version = "2.4.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/e8/c4/ba2f8066cceb6f23394729afe52f3bf7adec04bf9ed2c820b39e19299111/sortedcontainers-2.4.0.tar.gz", hash = "sha256:25caa5a06cc30b6b83d11423433f65d1f9d76c4c6a0c90e3379eaa43b9bfdb88", size = 30594, upload-time = "2021-05-16T22:03:42.897Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/32/46/9cb0e58b2deb7f82b84065f37f3bffeb12413f947f9388e4cac22c4621ce/sortedcontainers-2.4.0-py2.py3-none-any.whl", hash = "sha256:a163dcaede0f1c021485e957a39245190e74249897e2ae4b2aa38595db237ee0", size = 29575, upload-time = "2021-05-16T22:03:41.177Z" }, ] [[package]] name = "soupsieve" version = "2.8.4" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/47/2c/0a5f6f8ee0d5589e48c7640213ed5175d52cf540a06725b628cc1a45d6ce/soupsieve-2.8.4.tar.gz", hash = "sha256:e121fd02e975c695e4e9e8774a5ee35d74714b59307868dcc5319ad2d9e3328e", size = 121110, upload-time = "2026-05-24T13:55:57.154Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/5e/f5/0c41cb68dcae6b7de4fac4188a3a9589e21fb31df21ea3a2e888db95e6c9/soupsieve-2.8.4-py3-none-any.whl", hash = "sha256:e7e6b0769c8f51ed59acab6e994b00621096cfb1c640a7509295987388fbaf65", size = 37304, upload-time = "2026-05-24T13:55:55.406Z" }, ] [[package]] name = "sphinx" version = "9.0.4" source = { registry = "https://pypi.org/simple" } resolution-markers = [ "python_full_version < '3.12'", ] dependencies = [ { name = "alabaster" }, { name = "babel" }, { name = "colorama", marker = "sys_platform == 'win32'" }, { name = "docutils" }, { name = "imagesize" }, { name = "jinja2" }, { name = "packaging" }, { name = "pygments" }, { name = "requests" }, { name = "roman-numerals" }, { name = "snowballstemmer" }, { name = "sphinxcontrib-applehelp" }, { name = "sphinxcontrib-devhelp" }, { name = "sphinxcontrib-htmlhelp" }, { name = "sphinxcontrib-jsmath" }, { name = "sphinxcontrib-qthelp" }, { name = "sphinxcontrib-serializinghtml" }, ] sdist = { url = "https://files.pythonhosted.org/packages/42/50/a8c6ccc36d5eacdfd7913ddccd15a9cee03ecafc5ee2bc40e1f168d85022/sphinx-9.0.4.tar.gz", hash = "sha256:594ef59d042972abbc581d8baa577404abe4e6c3b04ef61bd7fc2acbd51f3fa3", size = 8710502, upload-time = "2025-12-04T07:45:27.343Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/c6/3f/4bbd76424c393caead2e1eb89777f575dee5c8653e2d4b6afd7a564f5974/sphinx-9.0.4-py3-none-any.whl", hash = "sha256:5bebc595a5e943ea248b99c13814c1c5e10b3ece718976824ffa7959ff95fffb", size = 3917713, upload-time = "2025-12-04T07:45:24.944Z" }, ] [[package]] name = "sphinx" version = "9.1.0" source = { registry = "https://pypi.org/simple" } resolution-markers = [ "python_full_version >= '3.15'", "python_full_version >= '3.12' and python_full_version < '3.15'", ] dependencies = [ { name = "alabaster" }, { name = "babel" }, { name = "colorama", marker = "sys_platform == 'win32'" }, { name = "docutils" }, { name = "imagesize" }, { name = "jinja2" }, { name = "packaging" }, { name = "pygments" }, { name = "requests" }, { name = "roman-numerals" }, { name = "snowballstemmer" }, { name = "sphinxcontrib-applehelp" }, { name = "sphinxcontrib-devhelp" }, { name = "sphinxcontrib-htmlhelp" }, { name = "sphinxcontrib-jsmath" }, { name = "sphinxcontrib-qthelp" }, { name = "sphinxcontrib-serializinghtml" }, ] sdist = { url = "https://files.pythonhosted.org/packages/cd/bd/f08eb0f4eed5c83f1ba2a3bd18f7745a2b1525fad70660a1c00224ec468a/sphinx-9.1.0.tar.gz", hash = "sha256:7741722357dd75f8190766926071fed3bdc211c74dd2d7d4df5404da95930ddb", size = 8718324, upload-time = "2025-12-31T15:09:27.646Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/73/f7/b1884cb3188ab181fc81fa00c266699dab600f927a964df02ec3d5d1916a/sphinx-9.1.0-py3-none-any.whl", hash = "sha256:c84fdd4e782504495fe4f2c0b3413d6c2bf388589bb352d439b2a3bb99991978", size = 3921742, upload-time = "2025-12-31T15:09:25.561Z" }, ] [[package]] name = "sphinx-basic-ng" version = "1.0.0b2" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "sphinx", version = "9.0.4", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version < '3.12'" }, { name = "sphinx", version = "9.1.0", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version >= '3.12'" }, ] sdist = { url = "https://files.pythonhosted.org/packages/98/0b/a866924ded68efec7a1759587a4e478aec7559d8165fac8b2ad1c0e774d6/sphinx_basic_ng-1.0.0b2.tar.gz", hash = "sha256:9ec55a47c90c8c002b5960c57492ec3021f5193cb26cebc2dc4ea226848651c9", size = 20736, upload-time = "2023-07-08T18:40:54.166Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/3c/dd/018ce05c532a22007ac58d4f45232514cd9d6dd0ee1dc374e309db830983/sphinx_basic_ng-1.0.0b2-py3-none-any.whl", hash = "sha256:eb09aedbabfb650607e9b4b68c9d240b90b1e1be221d6ad71d61c52e29f7932b", size = 22496, upload-time = "2023-07-08T18:40:52.659Z" }, ] [[package]] name = "sphinx-copybutton" version = "0.5.2" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "sphinx", version = "9.0.4", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version < '3.12'" }, { name = "sphinx", version = "9.1.0", source = { registry = "https://pypi.org/simple" }, marker = "python_full_version >= '3.12'" }, ] sdist = { url = "https://files.pythonhosted.org/packages/fc/2b/a964715e7f5295f77509e59309959f4125122d648f86b4fe7d70ca1d882c/sphinx-copybutton-0.5.2.tar.gz", hash = "sha256:4cf17c82fb9646d1bc9ca92ac280813a3b605d8c421225fd9913154103ee1fbd", size = 23039, upload-time = "2023-04-14T08:10:22.998Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/9e/48/1ea60e74949eecb12cdd6ac43987f9fd331156388dcc2319b45e2ebb81bf/sphinx_copybutton-0.5.2-py3-none-any.whl", hash = "sha256:fb543fd386d917746c9a2c50360c7905b605726b9355cd26e9974857afeae06e", size = 13343, upload-time = "2023-04-14T08:10:20.844Z" }, ] [[package]] name = "sphinxcontrib-applehelp" version = "2.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/ba/6e/b837e84a1a704953c62ef8776d45c3e8d759876b4a84fe14eba2859106fe/sphinxcontrib_applehelp-2.0.0.tar.gz", hash = "sha256:2f29ef331735ce958efa4734873f084941970894c6090408b079c61b2e1c06d1", size = 20053, upload-time = "2024-07-29T01:09:00.465Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/5d/85/9ebeae2f76e9e77b952f4b274c27238156eae7979c5421fba91a28f4970d/sphinxcontrib_applehelp-2.0.0-py3-none-any.whl", hash = "sha256:4cd3f0ec4ac5dd9c17ec65e9ab272c9b867ea77425228e68ecf08d6b28ddbdb5", size = 119300, upload-time = "2024-07-29T01:08:58.99Z" }, ] [[package]] name = "sphinxcontrib-devhelp" version = "2.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/f6/d2/5beee64d3e4e747f316bae86b55943f51e82bb86ecd325883ef65741e7da/sphinxcontrib_devhelp-2.0.0.tar.gz", hash = "sha256:411f5d96d445d1d73bb5d52133377b4248ec79db5c793ce7dbe59e074b4dd1ad", size = 12967, upload-time = "2024-07-29T01:09:23.417Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/35/7a/987e583882f985fe4d7323774889ec58049171828b58c2217e7f79cdf44e/sphinxcontrib_devhelp-2.0.0-py3-none-any.whl", hash = "sha256:aefb8b83854e4b0998877524d1029fd3e6879210422ee3780459e28a1f03a8a2", size = 82530, upload-time = "2024-07-29T01:09:21.945Z" }, ] [[package]] name = "sphinxcontrib-htmlhelp" version = "2.1.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/43/93/983afd9aa001e5201eab16b5a444ed5b9b0a7a010541e0ddfbbfd0b2470c/sphinxcontrib_htmlhelp-2.1.0.tar.gz", hash = "sha256:c9e2916ace8aad64cc13a0d233ee22317f2b9025b9cf3295249fa985cc7082e9", size = 22617, upload-time = "2024-07-29T01:09:37.889Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/0a/7b/18a8c0bcec9182c05a0b3ec2a776bba4ead82750a55ff798e8d406dae604/sphinxcontrib_htmlhelp-2.1.0-py3-none-any.whl", hash = "sha256:166759820b47002d22914d64a075ce08f4c46818e17cfc9470a9786b759b19f8", size = 98705, upload-time = "2024-07-29T01:09:36.407Z" }, ] [[package]] name = "sphinxcontrib-jsmath" version = "1.0.1" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/b2/e8/9ed3830aeed71f17c026a07a5097edcf44b692850ef215b161b8ad875729/sphinxcontrib-jsmath-1.0.1.tar.gz", hash = "sha256:a9925e4a4587247ed2191a22df5f6970656cb8ca2bd6284309578f2153e0c4b8", size = 5787, upload-time = "2019-01-21T16:10:16.347Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/c2/42/4c8646762ee83602e3fb3fbe774c2fac12f317deb0b5dbeeedd2d3ba4b77/sphinxcontrib_jsmath-1.0.1-py2.py3-none-any.whl", hash = "sha256:2ec2eaebfb78f3f2078e73666b1415417a116cc848b72e5172e596c871103178", size = 5071, upload-time = "2019-01-21T16:10:14.333Z" }, ] [[package]] name = "sphinxcontrib-qthelp" version = "2.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/68/bc/9104308fc285eb3e0b31b67688235db556cd5b0ef31d96f30e45f2e51cae/sphinxcontrib_qthelp-2.0.0.tar.gz", hash = "sha256:4fe7d0ac8fc171045be623aba3e2a8f613f8682731f9153bb2e40ece16b9bbab", size = 17165, upload-time = "2024-07-29T01:09:56.435Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/27/83/859ecdd180cacc13b1f7e857abf8582a64552ea7a061057a6c716e790fce/sphinxcontrib_qthelp-2.0.0-py3-none-any.whl", hash = "sha256:b18a828cdba941ccd6ee8445dbe72ffa3ef8cbe7505d8cd1fa0d42d3f2d5f3eb", size = 88743, upload-time = "2024-07-29T01:09:54.885Z" }, ] [[package]] name = "sphinxcontrib-serializinghtml" version = "2.0.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/3b/44/6716b257b0aa6bfd51a1b31665d1c205fb12cb5ad56de752dfa15657de2f/sphinxcontrib_serializinghtml-2.0.0.tar.gz", hash = "sha256:e9d912827f872c029017a53f0ef2180b327c3f7fd23c87229f7a8e8b70031d4d", size = 16080, upload-time = "2024-07-29T01:10:09.332Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/52/a7/d2782e4e3f77c8450f727ba74a8f12756d5ba823d81b941f1b04da9d033a/sphinxcontrib_serializinghtml-2.0.0-py3-none-any.whl", hash = "sha256:6e2cb0eef194e10c27ec0023bfeb25badbbb5868244cf5bc5bdc04e4464bf331", size = 92072, upload-time = "2024-07-29T01:10:08.203Z" }, ] [[package]] name = "termcolor" version = "3.3.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/46/79/cf31d7a93a8fdc6aa0fbb665be84426a8c5a557d9240b6239e9e11e35fc5/termcolor-3.3.0.tar.gz", hash = "sha256:348871ca648ec6a9a983a13ab626c0acce02f515b9e1983332b17af7979521c5", size = 14434, upload-time = "2025-12-29T12:55:21.882Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/33/d1/8bb87d21e9aeb323cc03034f5eaf2c8f69841e40e4853c2627edf8111ed3/termcolor-3.3.0-py3-none-any.whl", hash = "sha256:cf642efadaf0a8ebbbf4bc7a31cec2f9b5f21a9f726f4ccbb08192c9c26f43a5", size = 7734, upload-time = "2025-12-29T12:55:20.718Z" }, ] [[package]] name = "tomli-w" version = "1.2.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/19/75/241269d1da26b624c0d5e110e8149093c759b7a286138f4efd61a60e75fe/tomli_w-1.2.0.tar.gz", hash = "sha256:2dd14fac5a47c27be9cd4c976af5a12d87fb1f0b4512f81d69cce3b35ae25021", size = 7184, upload-time = "2025-01-15T12:07:24.262Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/c7/18/c86eb8e0202e32dd3df50d43d7ff9854f8e0603945ff398974c1d91ac1ef/tomli_w-1.2.0-py3-none-any.whl", hash = "sha256:188306098d013b691fcadc011abd66727d3c414c571bb01b1a174ba8c983cf90", size = 6675, upload-time = "2025-01-15T12:07:22.074Z" }, ] [[package]] name = "tox" version = "4.56.1" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "cachetools" }, { name = "colorama" }, { name = "filelock" }, { name = "packaging" }, { name = "platformdirs" }, { name = "pluggy" }, { name = "pyproject-api" }, { name = "python-discovery" }, { name = "tomli-w" }, { name = "virtualenv" }, ] sdist = { url = "https://files.pythonhosted.org/packages/60/6a/d20d405fc6661902ff803a9fa048d8aae27597c3b5dc750369ded82d08f7/tox-4.56.1.tar.gz", hash = "sha256:db1c2610802553189cf40de251661d066a635ee0ed9bf2a60093b5f1a7f36ef8", size = 283155, upload-time = "2026-06-25T06:18:36.802Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/d8/97/560a5dfde154619d9643b1e208119dddc29bbb35a38a4ce4d095c16cf8f0/tox-4.56.1-py3-none-any.whl", hash = "sha256:4d06b925c4dd67872099b39c5a46fba79a2169c5f6e32060f95a8b1181f0ef55", size = 216469, upload-time = "2026-06-25T06:18:35.229Z" }, ] [[package]] name = "tox-uv" version = "1.35.2" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "tox-uv-bare" }, { name = "uv" }, ] wheels = [ { url = "https://files.pythonhosted.org/packages/ca/dc/6e9994c799bdbb309f829dd6b8d98764dd0757302f3433c380438a3a127b/tox_uv-1.35.2-py3-none-any.whl", hash = "sha256:2d99b0e3c782ba49e7cbe521c8d344758595961b17a3633738d67096641c1bde", size = 6565, upload-time = "2026-05-05T01:34:16.07Z" }, ] [[package]] name = "tox-uv-bare" version = "1.35.2" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "packaging" }, { name = "tox" }, ] sdist = { url = "https://files.pythonhosted.org/packages/0a/cb/168dc1ccf24e4065a9a0a33df55709ed2b5eb73bd2b13ddd53187e5dffb8/tox_uv_bare-1.35.2.tar.gz", hash = "sha256:49e28a804c97f23ea17e25859960c0fa78f35bccb7e14344cfd840e89a9aade9", size = 32333, upload-time = "2026-05-05T01:34:18.916Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/5f/53/4a33dc81da39db7b31e5622333df361e8fe055b7ec636bd5fea762c9182d/tox_uv_bare-1.35.2-py3-none-any.whl", hash = "sha256:c0d590a41d1054a1ad0874e9e5943ff52402786e3d4599d8f8d37a65b566ef53", size = 22307, upload-time = "2026-05-05T01:34:17.681Z" }, ] [[package]] name = "ty" version = "0.0.72" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/d5/df/656e684bafb13c1d146e7d5b5f3e7978ca177232acc84998ff36427e9462/ty-0.0.72.tar.gz", hash = "sha256:ec2b8066b618df18cab4cb8e992f8da45d360332acb23fa34df7fa29cd1b9d3a", size = 6654939, upload-time = "2026-08-14T21:35:42.612Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/e2/3b/f51461239a4e66565d4b362f97a3b55fe7fdba2e944068341f87c62f6743/ty-0.0.72-py3-none-linux_armv6l.whl", hash = "sha256:fda86db153ffd85ee52000cf175d6a3f1c0223772cf7c5b6f726200bf92c7b44", size = 12621989, upload-time = "2026-08-14T21:35:01.676Z" }, { url = "https://files.pythonhosted.org/packages/ca/fb/79ddf683affc679ca856f3510b5640ec3a88a842ba5f654f5d4bc78f1786/ty-0.0.72-py3-none-macosx_10_12_x86_64.whl", hash = "sha256:ceb944c612529b9023acfdc9cf4c0dcbb722549f9d17d46baecd1141baf01d7f", size = 12233910, upload-time = "2026-08-14T21:35:04.334Z" }, { url = "https://files.pythonhosted.org/packages/5d/45/10562a0d84802158db8fa4ec46de54aa9fdcecdeeaabbfe3639ae7042b66/ty-0.0.72-py3-none-macosx_11_0_arm64.whl", hash = "sha256:108d76218333d6c092e5f1cebf8e9b06f25738613a0236a28e2dd47c936ee52c", size = 12084108, upload-time = "2026-08-14T21:35:06.686Z" }, { url = "https://files.pythonhosted.org/packages/a1/dc/1fe1aef8d697e3509face271a5331700c7aa1d1e44a4b622707bdfa41d4b/ty-0.0.72-py3-none-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:7f3943f186f741a2499a31053872169250c9264a9a49684920e48d8fcf4ef4f5", size = 12132640, upload-time = "2026-08-14T21:35:09.305Z" }, { url = "https://files.pythonhosted.org/packages/14/46/41ceb265e96969487311a2014bd0e53abb4fbc1395efb2ebe411fcb4db62/ty-0.0.72-py3-none-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:cf283c07dc3cc52ca48a3ad8ab100fb5aec3aebbd03ef6a12d5f910b8e596fc5", size = 12402489, upload-time = "2026-08-14T21:35:11.555Z" }, { url = "https://files.pythonhosted.org/packages/2b/45/30bf43cb4fd505c5c2dd30fda27dde5f05208686cd21217adec77c954204/ty-0.0.72-py3-none-manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:95f3b6462c38f9f115d10cee21f47fedf715fcf2040daf36eef210359300bc7c", size = 13130835, upload-time = "2026-08-14T21:35:13.746Z" }, { url = "https://files.pythonhosted.org/packages/31/2f/03bba754d2613f640df168335c41f83f41db150bb515839c60d80e3a7880/ty-0.0.72-py3-none-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:30caf658feb8ffb250d9e9e47107657a78f5f3425c227df1664d8df2ebe38880", size = 13590392, upload-time = "2026-08-14T21:35:16.839Z" }, { url = "https://files.pythonhosted.org/packages/04/c7/03c67f00e63005ec41585653dc3096064570b1e6273742baae2798cd242f/ty-0.0.72-py3-none-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:27bdc012ddfbeec8948e4a6036c0dc39ac7cf2c8ec7c7d48dc7d2fd56d57b399", size = 13309629, upload-time = "2026-08-14T21:35:19.169Z" }, { url = "https://files.pythonhosted.org/packages/c1/df/102d3b264eb7f2a58dd11952f229bb5150bb5668d176a6154976a6675981/ty-0.0.72-py3-none-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:802c5970a77d7739e6f499921fbb6984fb7ad8a31d95e1ff42fd46f3642e4f3b", size = 12734028, upload-time = "2026-08-14T21:35:22.099Z" }, { url = "https://files.pythonhosted.org/packages/61/85/d0737c8c54d0ba67366ddfb9f31d88edf0b02299e65923e6945ae60ebcb5/ty-0.0.72-py3-none-manylinux_2_31_riscv64.whl", hash = "sha256:47dce65114fdc615c68ca0edb393b433df0956447e4267df0e264137a789598d", size = 13174832, upload-time = "2026-08-14T21:35:24.71Z" }, { url = "https://files.pythonhosted.org/packages/1e/31/497f5a96c36d9b586ab6afe0574986835c6fd5b835a89773d2bec4711b49/ty-0.0.72-py3-none-musllinux_1_2_aarch64.whl", hash = "sha256:325144fa07e2675d0faa337fcc864213c272a499eb0cfe5bde2fdc62282d27bc", size = 12215005, upload-time = "2026-08-14T21:35:26.892Z" }, { url = "https://files.pythonhosted.org/packages/df/7d/46e65b17b4966c7cd0140f134380d33d8e84fe6efccd761533ce793dc502/ty-0.0.72-py3-none-musllinux_1_2_armv7l.whl", hash = "sha256:a5c9f15d0f58e43707d8848274be1821a0ef408eccb8aa7dda28a4a9eddf7640", size = 12421298, upload-time = "2026-08-14T21:35:29.301Z" }, { url = "https://files.pythonhosted.org/packages/08/2a/12ada4ec17700b3cb1d4fd3bc3e5b1852df9e6885288429318cade87b3c1/ty-0.0.72-py3-none-musllinux_1_2_i686.whl", hash = "sha256:8ee508d64b381871529cc22c412b41071bf5e908b7aa5d66a38f3f6b2573a806", size = 12669242, upload-time = "2026-08-14T21:35:31.444Z" }, { url = "https://files.pythonhosted.org/packages/1c/1a/4692536880790fb550ed6d44a6096778dc71bb112f2c6d615cebb01a57e5/ty-0.0.72-py3-none-musllinux_1_2_x86_64.whl", hash = "sha256:3699e2ec7921d44da79d6b089f7bf239b2cc53c4e45a5a38430adc34ee9e9a55", size = 12988199, upload-time = "2026-08-14T21:35:33.749Z" }, { url = "https://files.pythonhosted.org/packages/9a/0d/f5e5a50322e9c45865e7b7a428ba6cd6527387cf0f2472492ac3cf746243/ty-0.0.72-py3-none-win32.whl", hash = "sha256:f25f72a67bd36cd247707c4784e52fad0b6b4f42a1b7dd14804110fa95c486ed", size = 11939708, upload-time = "2026-08-14T21:35:36.006Z" }, { url = "https://files.pythonhosted.org/packages/3f/4e/8af3534b2e4214e6184a5a59c34101e94a68d578f081f97b995866bab1bf/ty-0.0.72-py3-none-win_amd64.whl", hash = "sha256:cdeee869341717e1736cea2e2d7856738c6957c320f584ed2f68c8f90100d2f5", size = 12643876, upload-time = "2026-08-14T21:35:38.141Z" }, { url = "https://files.pythonhosted.org/packages/ff/ea/a2606e654c7276bd08586391a2525b0af3f3bf60228a8c57b2d248f273f9/ty-0.0.72-py3-none-win_arm64.whl", hash = "sha256:1bd3ac3ed4424a6d6990a85dc388556aea012bd752de21349a84b685951de0d8", size = 12394857, upload-time = "2026-08-14T21:35:40.277Z" }, ] [[package]] name = "typing-extensions" version = "4.16.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/f6/cc/6253133b5bb138fc3306cebfbda2c520f545d36b5be2c7255cc528bb45d6/typing_extensions-4.16.0.tar.gz", hash = "sha256:dc983d19a509c94dba722ee6abd33940f7c05a89e243c47e907eb4db6f1a43e5", size = 113555, upload-time = "2026-07-02T08:40:05.92Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/49/d3/b8441a820a491ddfc024b0b0cf0393375b75ea13866d9c66727e54c2fc80/typing_extensions-4.16.0-py3-none-any.whl", hash = "sha256:481caa481374e813c1b176ada14e97f1f67a4539ce9cfeb3f350d78d6370c2e8", size = 45571, upload-time = "2026-07-02T08:40:04.659Z" }, ] [[package]] name = "urllib3" version = "2.7.0" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/53/0c/06f8b233b8fd13b9e5ee11424ef85419ba0d8ba0b3138bf360be2ff56953/urllib3-2.7.0.tar.gz", hash = "sha256:231e0ec3b63ceb14667c67be60f2f2c40a518cb38b03af60abc813da26505f4c", size = 433602, upload-time = "2026-05-07T16:13:18.596Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/7f/3e/5db95bcf282c52709639744ca2a8b149baccf648e39c8cc87553df9eae0c/urllib3-2.7.0-py3-none-any.whl", hash = "sha256:9fb4c81ebbb1ce9531cce37674bbc6f1360472bc18ca9a553ede278ef7276897", size = 131087, upload-time = "2026-05-07T16:13:17.151Z" }, ] [[package]] name = "uv" version = "0.11.27" source = { registry = "https://pypi.org/simple" } sdist = { url = "https://files.pythonhosted.org/packages/8f/ed/b8bb8bf2044561e3349ebe75be0d8abdeb19577886753b49200ec6caea0d/uv-0.11.27.tar.gz", hash = "sha256:3469204521869f0e6bdea17b02c1d86db2d0150820895653a6152cab206fb00b", size = 5978029, upload-time = "2026-07-06T21:00:29.995Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/b2/fe/8a080fb603f276ceb2d960454b2b5998cc6e5c0c6d5dbbbeb48b141de4f2/uv-0.11.27-py3-none-linux_armv6l.whl", hash = "sha256:6cedad2185b16bd5da77096d4813159c9c3c572897537256eecdb4092941adc0", size = 25490659, upload-time = "2026-07-06T20:59:29.003Z" }, { url = "https://files.pythonhosted.org/packages/d1/15/886a2ef7b00c1a4fcf706e7a6b946b3f7485a55f42d0aa9b5572caed58b6/uv-0.11.27-py3-none-macosx_10_12_x86_64.whl", hash = "sha256:42b273459864c67f3736ae2a63929df463975d885bbc1afd8f53f7e0fb1f2269", size = 24498434, upload-time = "2026-07-06T20:59:33.042Z" }, { url = "https://files.pythonhosted.org/packages/2d/6e/45335717c4372bf955c87bc05c6462dd4c0c6087ed12c3991b14cbba77cd/uv-0.11.27-py3-none-macosx_11_0_arm64.whl", hash = "sha256:b316464a1028a43478b74424b4b78925c463758baec93cb754fb2392ba175138", size = 23248727, upload-time = "2026-07-06T20:59:36.201Z" }, { url = "https://files.pythonhosted.org/packages/0a/fa/41dde1e350c5a277b797371faf96fb013c2c13ed18df6efc51ed8ec9bb5b/uv-0.11.27-py3-none-manylinux_2_17_aarch64.manylinux2014_aarch64.musllinux_1_1_aarch64.whl", hash = "sha256:3ca478883d78270ceed57f229d1b480dbcadf5d79b2ce9624574807d6ec48554", size = 25208126, upload-time = "2026-07-06T20:59:39.984Z" }, { url = "https://files.pythonhosted.org/packages/00/e3/bc6d4af24ab533db4c741cebade3a58b91fc0563059d39e838161dd210c8/uv-0.11.27-py3-none-manylinux_2_17_armv7l.manylinux2014_armv7l.musllinux_1_1_armv7l.whl", hash = "sha256:232dfb7549c8a4217ab1970dea0de731926b8ca21769ed89951ad8f8c3bce8b6", size = 25030974, upload-time = "2026-07-06T20:59:43.378Z" }, { url = "https://files.pythonhosted.org/packages/c3/0c/82e736930d3f78ca6c3286ef31627d7155e20191af88afc40ec29486f400/uv-0.11.27-py3-none-manylinux_2_17_armv7l.manylinux2014_armv7l.whl", hash = "sha256:4c0cf7c7960587a231252cbe4d7a032b5a02c29cfab3fcc4e75a915b1c5cacee", size = 25015115, upload-time = "2026-07-06T20:59:46.694Z" }, { url = "https://files.pythonhosted.org/packages/a0/5b/512ebf3b24b708ea2adda4ec4d4bd23b2404d7a7ea3bd24d2b92210ab680/uv-0.11.27-py3-none-manylinux_2_17_i686.manylinux2014_i686.whl", hash = "sha256:47b5863ef715ffe4c29e792c9884a4e8b8016b0628d3613ac84c696acc128a78", size = 26487914, upload-time = "2026-07-06T20:59:50.414Z" }, { url = "https://files.pythonhosted.org/packages/98/d5/3871185331266156fbd09ab0ad7ddc69ca759b3a28ece5488bdb64f152d9/uv-0.11.27-py3-none-manylinux_2_17_ppc64le.manylinux2014_ppc64le.whl", hash = "sha256:a5764155d2a578a41d2827f464d4ce5b7788632e732cb304e2025fb3d043b46f", size = 27393306, upload-time = "2026-07-06T20:59:53.852Z" }, { url = "https://files.pythonhosted.org/packages/24/0f/9fe3cc9b8d498f2e426b3cda90d337b076d64f19c2d55cb0b7d091c4bfe9/uv-0.11.27-py3-none-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:d806e1067c8eb9f8ba5dbdca46484512d224070e8473442319d4c1fbc3246f4d", size = 26563495, upload-time = "2026-07-06T20:59:56.945Z" }, { url = "https://files.pythonhosted.org/packages/e7/be/18393c15ac0c982fefa34944135ead3adc565da5023d973eff5081a95a62/uv-0.11.27-py3-none-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:8cb783b9db3868e51e8da1956aaa7e800262ad1af03dfc8b024f3b04ecb447c2", size = 26652374, upload-time = "2026-07-06T21:00:00.256Z" }, { url = "https://files.pythonhosted.org/packages/b8/93/1bb8bee2b0bcc6e9655518ecaa9a792b1952dd99ae7366fe4f6c82754361/uv-0.11.27-py3-none-manylinux_2_28_aarch64.whl", hash = "sha256:8e2b86d3dee515eeba6ea001d8b3eac20b204db07d39b04187c755a490a4fba6", size = 25341573, upload-time = "2026-07-06T21:00:03.789Z" }, { url = "https://files.pythonhosted.org/packages/e6/e0/fae0d1c972b25ac192ac807c1b1baf0f12070c40c8af2eb8e22310ea8846/uv-0.11.27-py3-none-manylinux_2_31_riscv64.musllinux_1_1_riscv64.whl", hash = "sha256:d325b8bd2665ce3ac58d33f977683cfb2cb8eb951effab06fad8518426bc0a90", size = 26051363, upload-time = "2026-07-06T21:00:07.281Z" }, { url = "https://files.pythonhosted.org/packages/e5/a2/4c0c103ea431f5d70cd33f10c754b5b1de9687fea982ca1a20a4eee0a4a7/uv-0.11.27-py3-none-manylinux_2_31_riscv64.whl", hash = "sha256:3d5c9036b558a323f254e3d16038183c22c55e0d06b921f1ed9706953311e52f", size = 26148896, upload-time = "2026-07-06T21:00:10.56Z" }, { url = "https://files.pythonhosted.org/packages/bb/b7/a514307a90ca9f1cb59efd0898958dea6c1092ad5e4e6b6f2eb4d55109db/uv-0.11.27-py3-none-musllinux_1_1_i686.whl", hash = "sha256:4cc04e625e7bfac6975fd384d6598169cea0030995ff3b557950ec3077974a4d", size = 25701138, upload-time = "2026-07-06T21:00:13.772Z" }, { url = "https://files.pythonhosted.org/packages/bf/46/c6cfa675d727a199cfce32f7a30350ce6e47f699c3cd7f0433a619c671d4/uv-0.11.27-py3-none-musllinux_1_1_x86_64.whl", hash = "sha256:109d8e145b390d0e14f2aefd9708a7522a4236d6bee20361a7558e77a14c0531", size = 26913232, upload-time = "2026-07-06T21:00:17.233Z" }, { url = "https://files.pythonhosted.org/packages/a4/04/0070ecdea37baa9d38187abedc78eed9a52a2e6cb1d4f175c580640f3456/uv-0.11.27-py3-none-win32.whl", hash = "sha256:b330d2ab6af0f79396fb350a9fed8ed1aa92516310f7533de9a8dfebc4e147cd", size = 24374672, upload-time = "2026-07-06T21:00:20.399Z" }, { url = "https://files.pythonhosted.org/packages/d0/b9/f3df522d2e609fe511e5bee24b34c91ce281ce472594121fa1d5fa159d9d/uv-0.11.27-py3-none-win_amd64.whl", hash = "sha256:e20f25921ed4c46d32ac18a9b2e610c0384439fd367f647f2b68e0e1d90e9885", size = 27275452, upload-time = "2026-07-06T21:00:23.903Z" }, { url = "https://files.pythonhosted.org/packages/8d/2e/4ea9c3bbf95a21c627a3dfa359f5a3266e648cd103c5ade374a6e4265c5f/uv-0.11.27-py3-none-win_arm64.whl", hash = "sha256:a41da27667e95c0df939e99e77a4d9169fb895df0f6788b2ab65ed5efdc1395f", size = 25561477, upload-time = "2026-07-06T21:00:27.333Z" }, ] [[package]] name = "virtualenv" version = "21.6.0" source = { registry = "https://pypi.org/simple" } dependencies = [ { name = "distlib" }, { name = "filelock" }, { name = "platformdirs" }, { name = "python-discovery" }, ] sdist = { url = "https://files.pythonhosted.org/packages/74/65/ec1d92091671e6407d3e7c1f5801413bb7b2b57630a50cae7750456ba0ed/virtualenv-21.6.0.tar.gz", hash = "sha256:e18a4d750f2b64dea73e72ffde3922f3c52365fabdc8157ebd3da20d031c4734", size = 5526111, upload-time = "2026-07-06T22:49:56.972Z" } wheels = [ { url = "https://files.pythonhosted.org/packages/b8/e7/2fbd0cc1653c53eed8f10670538bb547de2b3e37aacad283faa82a71094b/virtualenv-21.6.0-py3-none-any.whl", hash = "sha256:bce9d097950fef9d81129b333babfb7767072850c2f1acce0ec536708401bfd1", size = 5506216, upload-time = "2026-07-06T22:49:54.941Z" }, ]
  • GitHub Repository